About the Execution of ITS-Tools for FunctionPointer-PT-c128
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 0.000 | 3600000.00 | 0.00 | 0.00 | FFT?FFTFFF?FFFFF | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r100-smll-174867007500164.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5832
Executing tool itstools
Input is FunctionPointer-PT-c128, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r100-smll-174867007500164
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.6M
-rw-r--r-- 1 mcc users 7.3K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 151K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.7K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 49K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 5 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 4.2M May 29 14:32 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
echo here is the order used to build the result vector(from xml file)
FORMULA_NAME FunctionPointer-PT-c128-LTLFireability-00
FORMULA_NAME FunctionPointer-PT-c128-LTLFireability-01
FORMULA_NAME FunctionPointer-PT-c128-LTLFireability-02
FORMULA_NAME FunctionPointer-PT-c128-LTLFireability-03
FORMULA_NAME FunctionPointer-PT-c128-LTLFireability-04
FORMULA_NAME FunctionPointer-PT-c128-LTLFireability-05
FORMULA_NAME FunctionPointer-PT-c128-LTLFireability-06
FORMULA_NAME FunctionPointer-PT-c128-LTLFireability-07
FORMULA_NAME FunctionPointer-PT-c128-LTLFireability-08
FORMULA_NAME FunctionPointer-PT-c128-LTLFireability-09
FORMULA_NAME FunctionPointer-PT-c128-LTLFireability-10
FORMULA_NAME FunctionPointer-PT-c128-LTLFireability-11
FORMULA_NAME FunctionPointer-PT-c128-LTLFireability-12
FORMULA_NAME FunctionPointer-PT-c128-LTLFireability-13
FORMULA_NAME FunctionPointer-PT-c128-LTLFireability-14
FORMULA_NAME FunctionPointer-PT-c128-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1748891000804
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FunctionPointer-PT-c128
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-06-02 19:03:23] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-02 19:03:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 19:03:23] [INFO ] Load time of PNML (sax parser for PT used): 731 ms
[2025-06-02 19:03:23] [INFO ] Transformed 2826 places.
[2025-06-02 19:03:24] [INFO ] Transformed 8960 transitions.
[2025-06-02 19:03:24] [INFO ] Parsed PT model containing 2826 places and 8960 transitions and 36096 arcs in 966 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 19 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Deduced a syphon composed of 1198 places in 66 ms
Reduce places removed 1198 places and 2998 transitions.
FORMULA FunctionPointer-PT-c128-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c128-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c128-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c128-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c128-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c128-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c128-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c128-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 19 out of 1628 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1628/1628 places, 5962/5962 transitions.
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 0 with 17 rules applied. Total rules applied 17 place count 1611 transition count 5962
Discarding 293 places :
Symmetric choice reduction at 1 with 293 rule applications. Total rules 310 place count 1318 transition count 3792
Iterating global reduction 1 with 293 rules applied. Total rules applied 603 place count 1318 transition count 3792
Ensure Unique test removed 430 transitions
Reduce isomorphic transitions removed 430 transitions.
Iterating post reduction 1 with 430 rules applied. Total rules applied 1033 place count 1318 transition count 3362
Discarding 150 places :
Symmetric choice reduction at 2 with 150 rule applications. Total rules 1183 place count 1168 transition count 3062
Iterating global reduction 2 with 150 rules applied. Total rules applied 1333 place count 1168 transition count 3062
Ensure Unique test removed 96 transitions
Reduce isomorphic transitions removed 96 transitions.
Iterating post reduction 2 with 96 rules applied. Total rules applied 1429 place count 1168 transition count 2966
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 1443 place count 1154 transition count 2938
Iterating global reduction 3 with 14 rules applied. Total rules applied 1457 place count 1154 transition count 2938
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 1471 place count 1140 transition count 2910
Iterating global reduction 3 with 14 rules applied. Total rules applied 1485 place count 1140 transition count 2910
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 1499 place count 1126 transition count 2882
Iterating global reduction 3 with 14 rules applied. Total rules applied 1513 place count 1126 transition count 2882
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 1527 place count 1112 transition count 2854
Iterating global reduction 3 with 14 rules applied. Total rules applied 1541 place count 1112 transition count 2854
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 1554 place count 1099 transition count 2828
Iterating global reduction 3 with 13 rules applied. Total rules applied 1567 place count 1099 transition count 2828
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 1580 place count 1086 transition count 2802
Iterating global reduction 3 with 13 rules applied. Total rules applied 1593 place count 1086 transition count 2802
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 1606 place count 1073 transition count 2776
Iterating global reduction 3 with 13 rules applied. Total rules applied 1619 place count 1073 transition count 2776
Discarding 53 places :
Symmetric choice reduction at 3 with 53 rule applications. Total rules 1672 place count 1020 transition count 2576
Iterating global reduction 3 with 53 rules applied. Total rules applied 1725 place count 1020 transition count 2576
Discarding 53 places :
Symmetric choice reduction at 3 with 53 rule applications. Total rules 1778 place count 967 transition count 2364
Iterating global reduction 3 with 53 rules applied. Total rules applied 1831 place count 967 transition count 2364
Discarding 53 places :
Symmetric choice reduction at 3 with 53 rule applications. Total rules 1884 place count 914 transition count 2246
Iterating global reduction 3 with 53 rules applied. Total rules applied 1937 place count 914 transition count 2246
Discarding 53 places :
Symmetric choice reduction at 3 with 53 rule applications. Total rules 1990 place count 861 transition count 2140
Iterating global reduction 3 with 53 rules applied. Total rules applied 2043 place count 861 transition count 2140
Discarding 53 places :
Symmetric choice reduction at 3 with 53 rule applications. Total rules 2096 place count 808 transition count 2034
Iterating global reduction 3 with 53 rules applied. Total rules applied 2149 place count 808 transition count 2034
Discarding 53 places :
Symmetric choice reduction at 3 with 53 rule applications. Total rules 2202 place count 755 transition count 1928
Iterating global reduction 3 with 53 rules applied. Total rules applied 2255 place count 755 transition count 1928
Discarding 52 places :
Symmetric choice reduction at 3 with 52 rule applications. Total rules 2307 place count 703 transition count 1824
Iterating global reduction 3 with 52 rules applied. Total rules applied 2359 place count 703 transition count 1824
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 2365 place count 697 transition count 1812
Iterating global reduction 3 with 6 rules applied. Total rules applied 2371 place count 697 transition count 1812
Applied a total of 2371 rules in 2677 ms. Remains 697 /1628 variables (removed 931) and now considering 1812/5962 (removed 4150) transitions.
[2025-06-02 19:03:27] [INFO ] Flow matrix only has 1213 transitions (discarded 599 similar events)
// Phase 1: matrix 1213 rows 697 cols
[2025-06-02 19:03:27] [INFO ] Computed 2 invariants in 58 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 19:03:28] [INFO ] Implicit Places using invariants in 1104 ms returned []
[2025-06-02 19:03:28] [INFO ] Flow matrix only has 1213 transitions (discarded 599 similar events)
[2025-06-02 19:03:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 19:03:29] [INFO ] State equation strengthened by 294 read => feed constraints.
[2025-06-02 19:03:33] [INFO ] Implicit Places using invariants and state equation in 5595 ms returned []
Implicit Place search using SMT with State Equation took 6751 ms to find 0 implicit places.
Running 1810 sub problems to find dead transitions.
[2025-06-02 19:03:33] [INFO ] Flow matrix only has 1213 transitions (discarded 599 similar events)
[2025-06-02 19:03:33] [INFO ] Invariant cache hit.
[2025-06-02 19:03:33] [INFO ] State equation strengthened by 294 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/697 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/697 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1810 unsolved
(s480 1.0timeout
^^^^^^^^^^
(error "Invalid token: 1.0timeout")
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 23.0)
(s5 1.0)
(s6 0.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 0.0)
(s11 1.0)
(s12 0.0)
(s13 1.0)
(s14 0.0)
(s15 1.0)
(s16 0.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 0.0)
(s39 0.0)
(s40 1.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 1.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 1.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 1.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 1.0)
(s135 0.0)
(s136 0.0)
(s137 1.0)
(s138 0.0)
(s139 1.0)
(s140 0.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 0.0)
(s150 1.0)
(s151 0.0)
(s152 1.0)
(s153 0.0)
(s154 1.0)
(s155 0.0)
(s156 1.0)
(s157 1.0)
(s158 0.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 0.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 0.0)
(s174 1.0)
(s175 0.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 0.0)
(s184 0.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 0.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 1.0)
(s329 1.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 1.0)
(s349 1.0)
(s350 1.0)
(s351 1.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s355 1.0)
(s356 1.0)
(s357 1.0)
(s358 1.0)
(s359 1.0)
(s360 1.0)
(s361 1.0)
(s362 1.0)
(s363 1.0)
(s364 1.0)
(s365 1.0)
(s366 1.0)
(s367 1.0)
(s368 1.0)
(s369 1.0)
(s370 1.0)
(s371 1.0)
(s372 1.0)
(s373 1.0)
(s374 1.0)
(s375 1.0)
(s376 1.0)
(s377 1.0)
(s378 1.0)
(s379 1.0)
(s380 1.0)
(s381 1.0)
(s382 1.0)
(s383 1.0)
(s384 1.0)
(s385 1.0)
(s386 1.0)
(s387 1.0)
(s388 1.0)
(s389 1.0)
(s390 1.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 1.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 1.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 0.0)
(s429 0.0)
(s430 0.0)
(s431 0.0)
(s432 0.0)
(s433 0.0)
(s434 0.0)
(s435 1.0)
(s436 0.0)
(s437 0.0)
(s438 0.0)
(s439 0.0)
(s440 0.0)
(s441 0.0)
(s442 0.0)
(s443 0.0)
(s444 0.0)
(s445 0.0)
(s446 0.0)
(s447 0.0)
(s448 0.0)
(s449 0.0)
(s450 0.0)
(s451 0.0)
(s452 0.0)
(s453 0.0)
(s454 1.0)
(s455 1.0)
(s456 1.0)
(s457 0.0)
(s458 0.0)
(s459 1.0)
(s460 0.0)
(s461 1.0)
(s462 1.0)
(s463 1.0)
(s464 1.0)
(s465 1.0)
(s466 0.0)
(s467 1.0)
(s468 0.0)
(s469 0.0)
(s470 0.0)
(s471 1.0)
(s472 1.0)
(s473 1.0)
(s474 0.0)
(s475 0.0)
(s476 0.0)
(s477 1.0)
(s478 1.0)
(s479 1.0)
(s480 1.0timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 697/1910 variables, and 2 constraints, problems are : Problem set: 0 solved, 1810 unsolved in 30107 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/697 constraints, ReadFeed: 0/294 constraints, PredecessorRefiner: 1810/1810 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1810 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/697 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/697 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1810 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 697/1910 variables, and 2 constraints, problems are : Problem set: 0 solved, 1810 unsolved in 30072 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/697 constraints, ReadFeed: 0/294 constraints, PredecessorRefiner: 0/1810 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 65712ms problems are : Problem set: 0 solved, 1810 unsolved
Search for dead transitions found 0 dead transitions in 65756ms
Starting structural reductions in LTL mode, iteration 1 : 697/1628 places, 1812/5962 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 75227 ms. Remains : 697/1628 places, 1812/5962 transitions.
Support contains 19 out of 697 places after structural reductions.
[2025-06-02 19:04:40] [INFO ] Flatten gal took : 317 ms
[2025-06-02 19:04:40] [INFO ] Flatten gal took : 207 ms
[2025-06-02 19:04:40] [INFO ] Input system was already deterministic with 1812 transitions.
Reduction of identical properties reduced properties to check from 17 to 16
RANDOM walk for 40013 steps (8 resets) in 1318 ms. (30 steps per ms) remains 15/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 50 ms. (78 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 26 ms. (148 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 41 ms. (95 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 48 ms. (81 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 15/15 properties
Interrupted probabilistic random walk after 108518 steps, run timeout after 3001 ms. (steps per millisecond=36 ) properties seen :0 out of 15
Probabilistic random walk after 108518 steps, saw 70459 distinct states, run finished after 3008 ms. (steps per millisecond=36 ) properties seen :0
[2025-06-02 19:04:44] [INFO ] Flow matrix only has 1213 transitions (discarded 599 similar events)
[2025-06-02 19:04:44] [INFO ] Invariant cache hit.
[2025-06-02 19:04:44] [INFO ] State equation strengthened by 294 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 381/399 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/399 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (OVERLAPS) 930/1329 variables, 399/400 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1329 variables, 217/617 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1329 variables, 0/617 constraints. Problems are: Problem set: 0 solved, 15 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 483/1812 variables, 206/823 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1812 variables, 1/824 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1812 variables, 77/901 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1812 variables, 0/901 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 10 (OVERLAPS) 98/1910 variables, 92/993 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1910 variables, 0/993 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 12 (OVERLAPS) 0/1910 variables, 0/993 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1910/1910 variables, and 993 constraints, problems are : Problem set: 0 solved, 15 unsolved in 4553 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 697/697 constraints, ReadFeed: 294/294 constraints, PredecessorRefiner: 15/13 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 15 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 381/399 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/399 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (OVERLAPS) 930/1329 variables, 399/400 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1329 variables, 217/617 constraints. Problems are: Problem set: 0 solved, 15 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:04:51] [INFO ] Deduced a trap along path composed of 3 places in 57 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:04:51] [INFO ] Deduced a trap along path composed of 3 places in 39 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/1329 variables, 2/619 constraints. Problems are: Problem set: 0 solved, 15 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:04:52] [INFO ] Deduced a trap along path composed of 3 places in 23 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/1329 variables, 1/620 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1329 variables, 0/620 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (OVERLAPS) 483/1812 variables, 206/826 constraints. Problems are: Problem set: 0 solved, 15 unsolved
SMT process timed out in 9717ms, After SMT, problems are : Problem set: 0 solved, 15 unsolved
Fused 15 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 18 out of 697 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 697/697 places, 1812/1812 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 696 transition count 1810
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 696 transition count 1810
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 696 transition count 1808
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 5 place count 695 transition count 1806
Iterating global reduction 1 with 1 rules applied. Total rules applied 6 place count 695 transition count 1806
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 7 place count 694 transition count 1804
Iterating global reduction 1 with 1 rules applied. Total rules applied 8 place count 694 transition count 1804
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 9 place count 693 transition count 1802
Iterating global reduction 1 with 1 rules applied. Total rules applied 10 place count 693 transition count 1802
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 692 transition count 1800
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 692 transition count 1800
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 13 place count 691 transition count 1796
Iterating global reduction 1 with 1 rules applied. Total rules applied 14 place count 691 transition count 1796
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 15 place count 690 transition count 1792
Iterating global reduction 1 with 1 rules applied. Total rules applied 16 place count 690 transition count 1792
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 17 place count 689 transition count 1790
Iterating global reduction 1 with 1 rules applied. Total rules applied 18 place count 689 transition count 1790
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 19 place count 688 transition count 1788
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 688 transition count 1788
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 21 place count 687 transition count 1786
Iterating global reduction 1 with 1 rules applied. Total rules applied 22 place count 687 transition count 1786
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 23 place count 686 transition count 1784
Iterating global reduction 1 with 1 rules applied. Total rules applied 24 place count 686 transition count 1784
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 25 place count 685 transition count 1782
Iterating global reduction 1 with 1 rules applied. Total rules applied 26 place count 685 transition count 1782
Drop transitions (Redundant composition of simpler transitions.) removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 1 with 20 rules applied. Total rules applied 46 place count 685 transition count 1762
Applied a total of 46 rules in 1009 ms. Remains 685 /697 variables (removed 12) and now considering 1762/1812 (removed 50) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1009 ms. Remains : 685/697 places, 1762/1812 transitions.
RANDOM walk for 40060 steps (8 resets) in 1224 ms. (32 steps per ms) remains 14/15 properties
BEST_FIRST walk for 40004 steps (8 resets) in 88 ms. (449 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 97 ms. (408 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 110 ms. (360 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 103 ms. (384 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 95 ms. (416 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 80 ms. (493 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 81 ms. (487 steps per ms) remains 13/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 81 ms. (487 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 86 ms. (459 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 76 ms. (519 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 86 ms. (459 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (17 resets) in 100 ms. (396 steps per ms) remains 10/13 properties
[2025-06-02 19:04:56] [INFO ] Flow matrix only has 1184 transitions (discarded 578 similar events)
// Phase 1: matrix 1184 rows 685 cols
[2025-06-02 19:04:56] [INFO ] Computed 2 invariants in 19 ms
[2025-06-02 19:04:56] [INFO ] State equation strengthened by 291 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 383/394 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/394 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 823/1217 variables, 394/395 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1217 variables, 75/470 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1217 variables, 0/470 constraints. Problems are: Problem set: 0 solved, 10 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 560/1777 variables, 201/671 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1777 variables, 216/887 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1777 variables, 0/887 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (OVERLAPS) 1/1778 variables, 1/888 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1778 variables, 1/889 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1778 variables, 0/889 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 12 (OVERLAPS) 91/1869 variables, 89/978 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1869 variables, 0/978 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 14 (OVERLAPS) 0/1869 variables, 0/978 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1869/1869 variables, and 978 constraints, problems are : Problem set: 0 solved, 10 unsolved in 3992 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 685/685 constraints, ReadFeed: 291/291 constraints, PredecessorRefiner: 10/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 383/394 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/394 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 823/1217 variables, 394/395 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1217 variables, 75/470 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1217 variables, 0/470 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (OVERLAPS) 560/1777 variables, 201/671 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1777 variables, 216/887 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1777 variables, 9/896 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:05:03] [INFO ] Deduced a trap along path composed of 3 places in 27 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:05:03] [INFO ] Deduced a trap along path composed of 3 places in 31 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:05:03] [INFO ] Deduced a trap along path composed of 3 places in 24 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:05:03] [INFO ] Deduced a trap along path composed of 3 places in 22 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:05:03] [INFO ] Deduced a trap along path composed of 3 places in 24 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:05:03] [INFO ] Deduced a trap along path composed of 3 places in 21 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/1777 variables, 6/902 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1777 variables, 0/902 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (OVERLAPS) 1/1778 variables, 1/903 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1778 variables, 1/904 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1778 variables, 0/904 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 14 (OVERLAPS) 91/1869 variables, 89/993 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:05:12] [INFO ] Deduced a trap along path composed of 3 places in 50 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:05:12] [INFO ] Deduced a trap along path composed of 3 places in 28 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/1869 variables, 2/995 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1869 variables, 0/995 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 17 (OVERLAPS) 0/1869 variables, 0/995 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1869/1869 variables, and 995 constraints, problems are : Problem set: 0 solved, 10 unsolved in 19812 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 685/685 constraints, ReadFeed: 291/291 constraints, PredecessorRefiner: 10/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 8/8 constraints]
After SMT, in 23888ms problems are : Problem set: 0 solved, 10 unsolved
Finished Parikh walk after 140732 steps, including 234 resets, run visited all 1 properties in 857 ms. (steps per millisecond=164 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 10 properties in 10001 ms.
FORMULA FunctionPointer-PT-c128-LTLFireability-05 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 192 stabilizing places and 512 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(p1))))'
Support contains 4 out of 697 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 697/697 places, 1812/1812 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 686 transition count 1788
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 686 transition count 1788
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 24 place count 686 transition count 1786
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 34 place count 676 transition count 1764
Iterating global reduction 1 with 10 rules applied. Total rules applied 44 place count 676 transition count 1764
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 54 place count 666 transition count 1728
Iterating global reduction 1 with 10 rules applied. Total rules applied 64 place count 666 transition count 1728
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 74 place count 656 transition count 1692
Iterating global reduction 1 with 10 rules applied. Total rules applied 84 place count 656 transition count 1692
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 94 place count 646 transition count 1672
Iterating global reduction 1 with 10 rules applied. Total rules applied 104 place count 646 transition count 1672
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 114 place count 636 transition count 1650
Iterating global reduction 1 with 10 rules applied. Total rules applied 124 place count 636 transition count 1650
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 133 place count 627 transition count 1630
Iterating global reduction 1 with 9 rules applied. Total rules applied 142 place count 627 transition count 1630
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 150 place count 619 transition count 1614
Iterating global reduction 1 with 8 rules applied. Total rules applied 158 place count 619 transition count 1614
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 166 place count 611 transition count 1598
Iterating global reduction 1 with 8 rules applied. Total rules applied 174 place count 611 transition count 1598
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 175 place count 610 transition count 1596
Iterating global reduction 1 with 1 rules applied. Total rules applied 176 place count 610 transition count 1596
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 177 place count 609 transition count 1594
Iterating global reduction 1 with 1 rules applied. Total rules applied 178 place count 609 transition count 1594
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 179 place count 608 transition count 1592
Iterating global reduction 1 with 1 rules applied. Total rules applied 180 place count 608 transition count 1592
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 182 place count 608 transition count 1590
Applied a total of 182 rules in 964 ms. Remains 608 /697 variables (removed 89) and now considering 1590/1812 (removed 222) transitions.
[2025-06-02 19:05:31] [INFO ] Flow matrix only has 1063 transitions (discarded 527 similar events)
// Phase 1: matrix 1063 rows 608 cols
[2025-06-02 19:05:31] [INFO ] Computed 2 invariants in 9 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 19:05:31] [INFO ] Implicit Places using invariants in 564 ms returned []
[2025-06-02 19:05:31] [INFO ] Flow matrix only has 1063 transitions (discarded 527 similar events)
[2025-06-02 19:05:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 19:05:32] [INFO ] State equation strengthened by 264 read => feed constraints.
[2025-06-02 19:06:02] [INFO ] Performed 335/608 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2025-06-02 19:06:19] [INFO ] Implicit Places using invariants and state equation in 47706 ms returned []
Implicit Place search using SMT with State Equation took 48276 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 19:06:19] [INFO ] Redundant transitions in 174 ms returned []
Running 1588 sub problems to find dead transitions.
[2025-06-02 19:06:19] [INFO ] Flow matrix only has 1063 transitions (discarded 527 similar events)
[2025-06-02 19:06:19] [INFO ] Invariant cache hit.
[2025-06-02 19:06:19] [INFO ] State equation strengthened by 264 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/608 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1588 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/608 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1588 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 608/1671 variables, and 2 constraints, problems are : Problem set: 0 solved, 1588 unsolved in 30045 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/608 constraints, ReadFeed: 0/264 constraints, PredecessorRefiner: 1588/1588 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1588 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/608 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1588 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/608 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1588 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 Int declared 608/1671 variables, and 2 constraints, problems are : Problem set: 0 solved, 1588 unsolved in 30056 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/608 constraints, ReadFeed: 0/264 constraints, PredecessorRefiner: 0/1588 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 64049ms problems are : Problem set: 0 solved, 1588 unsolved
Search for dead transitions found 0 dead transitions in 64059ms
Starting structural reductions in SI_LTL mode, iteration 1 : 608/697 places, 1590/1812 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 113494 ms. Remains : 608/697 places, 1590/1812 transitions.
Stuttering acceptance computed with spot in 295 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : FunctionPointer-PT-c128-LTLFireability-00
Stuttering criterion allowed to conclude after 225 steps with 0 reset in 21 ms.
FORMULA FunctionPointer-PT-c128-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-c128-LTLFireability-00 finished in 113932 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||(p1&&X(G(p2)))))))'
Support contains 4 out of 697 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 697/697 places, 1812/1812 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 689 transition count 1794
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 689 transition count 1794
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 18 place count 689 transition count 1792
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 25 place count 682 transition count 1776
Iterating global reduction 1 with 7 rules applied. Total rules applied 32 place count 682 transition count 1776
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 39 place count 675 transition count 1752
Iterating global reduction 1 with 7 rules applied. Total rules applied 46 place count 675 transition count 1752
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 53 place count 668 transition count 1728
Iterating global reduction 1 with 7 rules applied. Total rules applied 60 place count 668 transition count 1728
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 67 place count 661 transition count 1714
Iterating global reduction 1 with 7 rules applied. Total rules applied 74 place count 661 transition count 1714
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 81 place count 654 transition count 1698
Iterating global reduction 1 with 7 rules applied. Total rules applied 88 place count 654 transition count 1698
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 95 place count 647 transition count 1682
Iterating global reduction 1 with 7 rules applied. Total rules applied 102 place count 647 transition count 1682
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 108 place count 641 transition count 1670
Iterating global reduction 1 with 6 rules applied. Total rules applied 114 place count 641 transition count 1670
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 120 place count 635 transition count 1658
Iterating global reduction 1 with 6 rules applied. Total rules applied 126 place count 635 transition count 1658
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 127 place count 634 transition count 1656
Iterating global reduction 1 with 1 rules applied. Total rules applied 128 place count 634 transition count 1656
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 129 place count 633 transition count 1654
Iterating global reduction 1 with 1 rules applied. Total rules applied 130 place count 633 transition count 1654
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 131 place count 632 transition count 1652
Iterating global reduction 1 with 1 rules applied. Total rules applied 132 place count 632 transition count 1652
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 1 with 8 rules applied. Total rules applied 140 place count 632 transition count 1644
Applied a total of 140 rules in 674 ms. Remains 632 /697 variables (removed 65) and now considering 1644/1812 (removed 168) transitions.
[2025-06-02 19:07:24] [INFO ] Flow matrix only has 1099 transitions (discarded 545 similar events)
// Phase 1: matrix 1099 rows 632 cols
[2025-06-02 19:07:24] [INFO ] Computed 2 invariants in 10 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 19:07:25] [INFO ] Implicit Places using invariants in 950 ms returned []
[2025-06-02 19:07:25] [INFO ] Flow matrix only has 1099 transitions (discarded 545 similar events)
[2025-06-02 19:07:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 19:07:26] [INFO ] State equation strengthened by 271 read => feed constraints.
[2025-06-02 19:07:35] [INFO ] Implicit Places using invariants and state equation in 9598 ms returned []
Implicit Place search using SMT with State Equation took 10552 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 19:07:35] [INFO ] Redundant transitions in 55 ms returned []
Running 1642 sub problems to find dead transitions.
[2025-06-02 19:07:35] [INFO ] Flow matrix only has 1099 transitions (discarded 545 similar events)
[2025-06-02 19:07:35] [INFO ] Invariant cache hit.
[2025-06-02 19:07:35] [INFO ] State equation strengthened by 271 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/632 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1642 unsolved
SMT process timed out in 33773ms, After SMT, problems are : Problem set: 0 solved, 1642 unsolved
Search for dead transitions found 0 dead transitions in 33778ms
Starting structural reductions in SI_LTL mode, iteration 1 : 632/697 places, 1644/1812 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 45071 ms. Remains : 632/697 places, 1644/1812 transitions.
Stuttering acceptance computed with spot in 211 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : FunctionPointer-PT-c128-LTLFireability-03
Product exploration explored 100000 steps with 785 reset in 1378 ms.
Product exploration explored 100000 steps with 707 reset in 1215 ms.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Knowledge obtained : [(AND p1 p0 p2), (X p2), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND p1 (NOT p0)))), (X p0), (X p1), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X p2)), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X p1)), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 17 factoid took 157 ms. Reduced automaton from 3 states, 8 edges and 3 AP (stutter insensitive) to 3 states, 8 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 134 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
RANDOM walk for 40038 steps (8 resets) in 360 ms. (110 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 120 ms. (330 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 169 ms. (235 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 361 ms. (110 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 341 ms. (116 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 92 ms. (430 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 75 ms. (526 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 90 ms. (439 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 92 ms. (430 steps per ms) remains 8/8 properties
Interrupted probabilistic random walk after 145155 steps, run timeout after 3001 ms. (steps per millisecond=48 ) properties seen :0 out of 8
Probabilistic random walk after 145155 steps, saw 94236 distinct states, run finished after 3001 ms. (steps per millisecond=48 ) properties seen :0
[2025-06-02 19:08:16] [INFO ] Flow matrix only has 1099 transitions (discarded 545 similar events)
[2025-06-02 19:08:16] [INFO ] Invariant cache hit.
[2025-06-02 19:08:16] [INFO ] State equation strengthened by 271 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 344/348 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/348 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 1170/1518 variables, 484/488 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1518 variables, 271/759 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1518 variables, 0/759 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 62/1580 variables, 1/760 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1580 variables, 0/760 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 1/1581 variables, 1/761 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1581 variables, 1/762 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1581 variables, 0/762 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (OVERLAPS) 148/1729 variables, 141/903 constraints. Problems are: Problem set: 0 solved, 8 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/1729 variables, 0/903 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (OVERLAPS) 2/1731 variables, 2/905 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1731 variables, 0/905 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 15 (OVERLAPS) 0/1731 variables, 0/905 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1731/1731 variables, and 905 constraints, problems are : Problem set: 0 solved, 8 unsolved in 3507 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 632/632 constraints, ReadFeed: 271/271 constraints, PredecessorRefiner: 8/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 344/348 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/348 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 1170/1518 variables, 484/488 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1518 variables, 271/759 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1518 variables, 3/762 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1518 variables, 0/762 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 62/1580 variables, 1/763 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1580 variables, 0/763 constraints. Problems are: Problem set: 0 solved, 8 unsolved
SMT process timed out in 8571ms, After SMT, problems are : Problem set: 0 solved, 8 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 4 out of 632 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 632/632 places, 1644/1644 transitions.
Applied a total of 0 rules in 96 ms. Remains 632 /632 variables (removed 0) and now considering 1644/1644 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 96 ms. Remains : 632/632 places, 1644/1644 transitions.
RANDOM walk for 40047 steps (8 resets) in 174 ms. (228 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 57 ms. (689 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 79 ms. (500 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 67 ms. (588 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 75 ms. (526 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 64 ms. (615 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 68 ms. (579 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 88 ms. (449 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 62 ms. (634 steps per ms) remains 8/8 properties
Interrupted probabilistic random walk after 123176 steps, run timeout after 3001 ms. (steps per millisecond=41 ) properties seen :0 out of 8
Probabilistic random walk after 123176 steps, saw 79972 distinct states, run finished after 3001 ms. (steps per millisecond=41 ) properties seen :0
[2025-06-02 19:08:27] [INFO ] Flow matrix only has 1099 transitions (discarded 545 similar events)
[2025-06-02 19:08:27] [INFO ] Invariant cache hit.
[2025-06-02 19:08:27] [INFO ] State equation strengthened by 271 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 344/348 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/348 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 1170/1518 variables, 484/488 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1518 variables, 271/759 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1518 variables, 0/759 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 62/1580 variables, 1/760 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1580 variables, 0/760 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 1/1581 variables, 1/761 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1581 variables, 1/762 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1581 variables, 0/762 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (OVERLAPS) 148/1729 variables, 141/903 constraints. Problems are: Problem set: 0 solved, 8 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/1729 variables, 0/903 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (OVERLAPS) 2/1731 variables, 2/905 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1731 variables, 0/905 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 15 (OVERLAPS) 0/1731 variables, 0/905 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1731/1731 variables, and 905 constraints, problems are : Problem set: 0 solved, 8 unsolved in 3990 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 632/632 constraints, ReadFeed: 271/271 constraints, PredecessorRefiner: 8/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 344/348 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/348 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 1170/1518 variables, 484/488 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1518 variables, 271/759 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1518 variables, 3/762 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1518 variables, 0/762 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 62/1580 variables, 1/763 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1580 variables, 0/763 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (OVERLAPS) 1/1581 variables, 1/764 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1581 variables, 1/765 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1581 variables, 0/765 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (OVERLAPS) 148/1729 variables, 141/906 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1729 variables, 0/906 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (OVERLAPS) 2/1731 variables, 2/908 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1731 variables, 0/908 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 16 (OVERLAPS) 0/1731 variables, 0/908 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1731/1731 variables, and 908 constraints, problems are : Problem set: 0 solved, 8 unsolved in 16848 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 632/632 constraints, ReadFeed: 271/271 constraints, PredecessorRefiner: 8/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 20878ms problems are : Problem set: 0 solved, 8 unsolved
Fused 8 Parikh solutions to 7 different solutions.
Parikh walk visited 0 properties in 31538 ms.
Support contains 4 out of 632 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 632/632 places, 1644/1644 transitions.
Applied a total of 0 rules in 118 ms. Remains 632 /632 variables (removed 0) and now considering 1644/1644 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 119 ms. Remains : 632/632 places, 1644/1644 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 632/632 places, 1644/1644 transitions.
Applied a total of 0 rules in 119 ms. Remains 632 /632 variables (removed 0) and now considering 1644/1644 (removed 0) transitions.
[2025-06-02 19:09:20] [INFO ] Flow matrix only has 1099 transitions (discarded 545 similar events)
[2025-06-02 19:09:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 19:09:21] [INFO ] Implicit Places using invariants in 938 ms returned []
[2025-06-02 19:09:21] [INFO ] Flow matrix only has 1099 transitions (discarded 545 similar events)
[2025-06-02 19:09:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 19:09:22] [INFO ] State equation strengthened by 271 read => feed constraints.
[2025-06-02 19:09:30] [INFO ] Implicit Places using invariants and state equation in 8536 ms returned []
Implicit Place search using SMT with State Equation took 9482 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 19:09:30] [INFO ] Redundant transitions in 163 ms returned []
Running 1642 sub problems to find dead transitions.
[2025-06-02 19:09:30] [INFO ] Flow matrix only has 1099 transitions (discarded 545 similar events)
[2025-06-02 19:09:30] [INFO ] Invariant cache hit.
[2025-06-02 19:09:30] [INFO ] State equation strengthened by 271 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/632 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1642 unsolved
SMT process timed out in 34256ms, After SMT, problems are : Problem set: 0 solved, 1642 unsolved
Search for dead transitions found 0 dead transitions in 34267ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44045 ms. Remains : 632/632 places, 1644/1644 transitions.
Knowledge obtained : [(AND p1 p0 p2), (X p2), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND p1 (NOT p0)))), (X p0), (X p1), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X p2)), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X p1)), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 17 factoid took 246 ms. Reduced automaton from 3 states, 8 edges and 3 AP (stutter insensitive) to 3 states, 8 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 178 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 177 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Support contains 4 out of 632 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 632/632 places, 1644/1644 transitions.
Applied a total of 0 rules in 174 ms. Remains 632 /632 variables (removed 0) and now considering 1644/1644 (removed 0) transitions.
[2025-06-02 19:10:05] [INFO ] Flow matrix only has 1099 transitions (discarded 545 similar events)
[2025-06-02 19:10:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 19:10:06] [INFO ] Implicit Places using invariants in 1147 ms returned []
[2025-06-02 19:10:06] [INFO ] Flow matrix only has 1099 transitions (discarded 545 similar events)
[2025-06-02 19:10:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 19:10:07] [INFO ] State equation strengthened by 271 read => feed constraints.
[2025-06-02 19:10:15] [INFO ] Implicit Places using invariants and state equation in 9345 ms returned []
Implicit Place search using SMT with State Equation took 10495 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 19:10:15] [INFO ] Redundant transitions in 65 ms returned []
Running 1642 sub problems to find dead transitions.
[2025-06-02 19:10:15] [INFO ] Flow matrix only has 1099 transitions (discarded 545 similar events)
[2025-06-02 19:10:15] [INFO ] Invariant cache hit.
[2025-06-02 19:10:15] [INFO ] State equation strengthened by 271 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/632 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1642 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/632 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1642 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 632/1731 variables, and 2 constraints, problems are : Problem set: 0 solved, 1642 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/632 constraints, ReadFeed: 0/271 constraints, PredecessorRefiner: 1642/1642 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1642 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/632 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1642 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/632 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1642 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 632/1731 variables, and 2 constraints, problems are : Problem set: 0 solved, 1642 unsolved in 30045 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/632 constraints, ReadFeed: 0/271 constraints, PredecessorRefiner: 0/1642 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 63869ms problems are : Problem set: 0 solved, 1642 unsolved
Search for dead transitions found 0 dead transitions in 63874ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 74619 ms. Remains : 632/632 places, 1644/1644 transitions.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Knowledge obtained : [(AND p0 p1 p2), (X p2), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p2 (NOT p0)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 17 factoid took 232 ms. Reduced automaton from 3 states, 8 edges and 3 AP (stutter insensitive) to 3 states, 8 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 172 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
RANDOM walk for 40132 steps (8 resets) in 216 ms. (184 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 52 ms. (754 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 68 ms. (579 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 64 ms. (615 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 64 ms. (615 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 61 ms. (645 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 55 ms. (714 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 67 ms. (588 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 50 ms. (784 steps per ms) remains 8/8 properties
Interrupted probabilistic random walk after 119007 steps, run timeout after 3001 ms. (steps per millisecond=39 ) properties seen :0 out of 8
Probabilistic random walk after 119007 steps, saw 77264 distinct states, run finished after 3003 ms. (steps per millisecond=39 ) properties seen :0
[2025-06-02 19:11:23] [INFO ] Flow matrix only has 1099 transitions (discarded 545 similar events)
[2025-06-02 19:11:23] [INFO ] Invariant cache hit.
[2025-06-02 19:11:23] [INFO ] State equation strengthened by 271 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 344/348 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/348 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 1170/1518 variables, 484/488 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1518 variables, 271/759 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1518 variables, 0/759 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 62/1580 variables, 1/760 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1580 variables, 0/760 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 1/1581 variables, 1/761 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1581 variables, 1/762 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1581 variables, 0/762 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (OVERLAPS) 148/1729 variables, 141/903 constraints. Problems are: Problem set: 0 solved, 8 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/1729 variables, 0/903 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (OVERLAPS) 2/1731 variables, 2/905 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1731 variables, 0/905 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 15 (OVERLAPS) 0/1731 variables, 0/905 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1731/1731 variables, and 905 constraints, problems are : Problem set: 0 solved, 8 unsolved in 3948 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 632/632 constraints, ReadFeed: 271/271 constraints, PredecessorRefiner: 8/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 344/348 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/348 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 1170/1518 variables, 484/488 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1518 variables, 271/759 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1518 variables, 3/762 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1518 variables, 0/762 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 62/1580 variables, 1/763 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:11:31] [INFO ] Deduced a trap along path composed of 3 places in 25 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:11:31] [INFO ] Deduced a trap along path composed of 3 places in 19 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1580 variables, 2/765 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1580/1731 variables, and 765 constraints, problems are : Problem set: 0 solved, 8 unsolved in 5008 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 0/1 constraints, State Equation: 488/632 constraints, ReadFeed: 271/271 constraints, PredecessorRefiner: 8/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 8994ms problems are : Problem set: 0 solved, 8 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 4 out of 632 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 632/632 places, 1644/1644 transitions.
Applied a total of 0 rules in 93 ms. Remains 632 /632 variables (removed 0) and now considering 1644/1644 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 93 ms. Remains : 632/632 places, 1644/1644 transitions.
RANDOM walk for 40007 steps (8 resets) in 157 ms. (253 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 36 ms. (1081 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 52 ms. (754 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 50 ms. (784 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 50 ms. (784 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 50 ms. (784 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 45 ms. (869 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 53 ms. (740 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 39 ms. (1000 steps per ms) remains 8/8 properties
Interrupted probabilistic random walk after 118161 steps, run timeout after 3001 ms. (steps per millisecond=39 ) properties seen :0 out of 8
Probabilistic random walk after 118161 steps, saw 76716 distinct states, run finished after 3001 ms. (steps per millisecond=39 ) properties seen :0
[2025-06-02 19:11:35] [INFO ] Flow matrix only has 1099 transitions (discarded 545 similar events)
[2025-06-02 19:11:35] [INFO ] Invariant cache hit.
[2025-06-02 19:11:35] [INFO ] State equation strengthened by 271 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 344/348 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/348 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 1170/1518 variables, 484/488 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1518 variables, 271/759 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1518 variables, 0/759 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 62/1580 variables, 1/760 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1580 variables, 0/760 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 1/1581 variables, 1/761 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1581 variables, 1/762 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1581 variables, 0/762 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (OVERLAPS) 148/1729 variables, 141/903 constraints. Problems are: Problem set: 0 solved, 8 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/1729 variables, 0/903 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (OVERLAPS) 2/1731 variables, 2/905 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1731 variables, 0/905 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 15 (OVERLAPS) 0/1731 variables, 0/905 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1731/1731 variables, and 905 constraints, problems are : Problem set: 0 solved, 8 unsolved in 3920 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 632/632 constraints, ReadFeed: 271/271 constraints, PredecessorRefiner: 8/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 344/348 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/348 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 1170/1518 variables, 484/488 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1518 variables, 271/759 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1518 variables, 3/762 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1518 variables, 0/762 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 62/1580 variables, 1/763 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1580 variables, 0/763 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (OVERLAPS) 1/1581 variables, 1/764 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1581 variables, 1/765 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1581 variables, 0/765 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (OVERLAPS) 148/1729 variables, 141/906 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1729 variables, 0/906 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (OVERLAPS) 2/1731 variables, 2/908 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1731 variables, 0/908 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 16 (OVERLAPS) 0/1731 variables, 0/908 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1731/1731 variables, and 908 constraints, problems are : Problem set: 0 solved, 8 unsolved in 15528 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 632/632 constraints, ReadFeed: 271/271 constraints, PredecessorRefiner: 8/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 19480ms problems are : Problem set: 0 solved, 8 unsolved
Fused 8 Parikh solutions to 7 different solutions.
Parikh walk visited 0 properties in 29545 ms.
Support contains 4 out of 632 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 632/632 places, 1644/1644 transitions.
Applied a total of 0 rules in 108 ms. Remains 632 /632 variables (removed 0) and now considering 1644/1644 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 108 ms. Remains : 632/632 places, 1644/1644 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 632/632 places, 1644/1644 transitions.
Applied a total of 0 rules in 107 ms. Remains 632 /632 variables (removed 0) and now considering 1644/1644 (removed 0) transitions.
[2025-06-02 19:12:24] [INFO ] Flow matrix only has 1099 transitions (discarded 545 similar events)
[2025-06-02 19:12:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 19:12:25] [INFO ] Implicit Places using invariants in 923 ms returned []
[2025-06-02 19:12:25] [INFO ] Flow matrix only has 1099 transitions (discarded 545 similar events)
[2025-06-02 19:12:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 19:12:26] [INFO ] State equation strengthened by 271 read => feed constraints.
[2025-06-02 19:12:35] [INFO ] Implicit Places using invariants and state equation in 9562 ms returned []
Implicit Place search using SMT with State Equation took 10487 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 19:12:35] [INFO ] Redundant transitions in 93 ms returned []
Running 1642 sub problems to find dead transitions.
[2025-06-02 19:12:35] [INFO ] Flow matrix only has 1099 transitions (discarded 545 similar events)
[2025-06-02 19:12:35] [INFO ] Invariant cache hit.
[2025-06-02 19:12:35] [INFO ] State equation strengthened by 271 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/632 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1642 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/632 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1642 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 632/1731 variables, and 2 constraints, problems are : Problem set: 0 solved, 1642 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/632 constraints, ReadFeed: 0/271 constraints, PredecessorRefiner: 1642/1642 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1642 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/632 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1642 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/632 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1642 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1)
(s1 1)
(s2 1)
(s3 1)
(s4 9)
(s5 1)
(s6 0)
(s7 0)
(s8 1)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 1)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 1)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 1)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 1)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 1)
(s102 0)
(s103 0)
(s104 1)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 1)
(s135 1)
(s136 0)
(s137 1)
(s138 0)
(s139 0)
(s140 1)
(s141 1)
(s142 1)
(s143 1)
(s144 0)
(s145 1)
(s146 0)
(s147 1)
(s148 1)
(s149 0)
(s150 1)
(s151 0)
(s152 1)
(s153 1)
(s154 0)
(s155 0)
(s156 1)
(s157 1)
(s158 1)
(s159 0)
(s160 1)
(s161 0)
(s162 0)
(s163 1)
(s164 0)
(s165 1)
(s166 1)
(s167 1)
(s168 1)
(s169 1)
(s170 1)
(s171 1)
(s172 0)
(s173 0)
(s174 0)
(s175 1)
(s176 1)
(s177 1)
(s178 1)
(s179 1)
(s180 1)
(s181 1)
(s182 1)
(s183 1)
(s184 1)
(s185 1)
(s186 1)
(s187 1)
(s188 1)
(s189 1)
(s190 1)
(s191 1)
(s192 1)
(s193 1)
(s194 0)
(s195 1)
(s196 1)
(s197 1)
(s198 1)
(s199 1)
(s200 1)
(s201 1)
(s202 1)
(s203 1)
(s204 1)
(s205 1)
(s206 1)
(s207 1)
(s208 1)
(s209 1)
(s210 1)
(s211 1)
(s212 1)
(s213 1)
(s214 1)
(s215 1)
(s216 1)
(s217 1)
(s218 1)
(s219 1)
(s220 1)
(s221 1)
(s222 1)
(s223 1)
(s224 1)
(s225 1)
(s226 1)
(s227 1)
(s228 1)
(s229 1)
(s230 1)
(s231 1)
(s232 1)
(s233 1)
(s234 1)
(s235 1)
(s236 1)
(s237 1)
(s238 1)
(s239 1)
(s240 1)
(s241 1)
(s242 1)
(s243 1)
(s244 1)
(s245 1)
(s246 1)
(s247 1)
(s248 1)
(s249 1)
(s250 1)
(s251 1)
(s252 1)
(s253 1)
(s254 1)
(s255 1)
(s256 1)
(s257 1)
(s258 1)
(s259 1)
(s260 1)
(s261 1)
(s262 1)
(s263 1)
(s264 1)
(s265 1)
(s266 1)
(s267 1)
(s268 1)
(s269 1)
(s270 1)
(s271 1)
(s272 1)
(s273 1)
(s274 1)
(s275 1)
(s276 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 632/1731 variables, and 2 constraints, problems are : Problem set: 0 solved, 1642 unsolved in 30049 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/632 constraints, ReadFeed: 0/271 constraints, PredecessorRefiner: 0/1642 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 64545ms problems are : Problem set: 0 solved, 1642 unsolved
Search for dead transitions found 0 dead transitions in 64551ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 75254 ms. Remains : 632/632 places, 1644/1644 transitions.
Knowledge obtained : [(AND p0 p1 p2), (X p2), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p2 (NOT p0)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 17 factoid took 241 ms. Reduced automaton from 3 states, 8 edges and 3 AP (stutter insensitive) to 3 states, 8 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 175 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 172 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 174 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 750 reset in 1206 ms.
Product exploration explored 100000 steps with 737 reset in 911 ms.
Built C files in :
/tmp/ltsmin11843643627228701751
[2025-06-02 19:13:43] [INFO ] Too many transitions (1644) to apply POR reductions. Disabling POR matrices.
[2025-06-02 19:13:43] [INFO ] Built C files in 65ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11843643627228701751
Running compilation step : cd /tmp/ltsmin11843643627228701751;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11843643627228701751;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11843643627228701751;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
Support contains 4 out of 632 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 632/632 places, 1644/1644 transitions.
Applied a total of 0 rules in 97 ms. Remains 632 /632 variables (removed 0) and now considering 1644/1644 (removed 0) transitions.
[2025-06-02 19:13:46] [INFO ] Flow matrix only has 1099 transitions (discarded 545 similar events)
[2025-06-02 19:13:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 19:13:47] [INFO ] Implicit Places using invariants in 862 ms returned []
[2025-06-02 19:13:47] [INFO ] Flow matrix only has 1099 transitions (discarded 545 similar events)
[2025-06-02 19:13:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 19:13:47] [INFO ] State equation strengthened by 271 read => feed constraints.
[2025-06-02 19:13:55] [INFO ] Implicit Places using invariants and state equation in 8691 ms returned []
Implicit Place search using SMT with State Equation took 9556 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 19:13:55] [INFO ] Redundant transitions in 53 ms returned []
Running 1642 sub problems to find dead transitions.
[2025-06-02 19:13:55] [INFO ] Flow matrix only has 1099 transitions (discarded 545 similar events)
[2025-06-02 19:13:55] [INFO ] Invariant cache hit.
[2025-06-02 19:13:55] [INFO ] State equation strengthened by 271 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/632 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1642 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/632 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1642 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 632/1731 variables, and 2 constraints, problems are : Problem set: 0 solved, 1642 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/632 constraints, ReadFeed: 0/271 constraints, PredecessorRefiner: 1642/1642 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1642 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/632 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1642 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/632 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1642 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 Int declared 632/1731 variables, and 2 constraints, problems are : Problem set: 0 solved, 1642 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/632 constraints, ReadFeed: 0/271 constraints, PredecessorRefiner: 0/1642 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 64267ms problems are : Problem set: 0 solved, 1642 unsolved
Search for dead transitions found 0 dead transitions in 64270ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 73988 ms. Remains : 632/632 places, 1644/1644 transitions.
Built C files in :
/tmp/ltsmin12688164596800911042
[2025-06-02 19:15:00] [INFO ] Too many transitions (1644) to apply POR reductions. Disabling POR matrices.
[2025-06-02 19:15:00] [INFO ] Built C files in 29ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12688164596800911042
Running compilation step : cd /tmp/ltsmin12688164596800911042;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12688164596800911042;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12688164596800911042;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
[2025-06-02 19:15:03] [INFO ] Flatten gal took : 222 ms
[2025-06-02 19:15:03] [INFO ] Flatten gal took : 120 ms
[2025-06-02 19:15:03] [INFO ] Time to serialize gal into /tmp/LTL5396855793496407946.gal : 33 ms
[2025-06-02 19:15:03] [INFO ] Time to serialize properties into /tmp/LTL13490413738278549642.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5396855793496407946.gal' '-t' 'CGAL' '-hoa' '/tmp/aut10716164918405542746.hoa' '-atoms' '/tmp/LTL13490413738278549642.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL13490413738278549642.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut10716164918405542746.hoa
Detected timeout of ITS tools.
[2025-06-02 19:15:18] [INFO ] Flatten gal took : 67 ms
[2025-06-02 19:15:19] [INFO ] Flatten gal took : 70 ms
[2025-06-02 19:15:19] [INFO ] Time to serialize gal into /tmp/LTL16420463927627061853.gal : 34 ms
[2025-06-02 19:15:19] [INFO ] Time to serialize properties into /tmp/LTL375991076104381158.ltl : 7 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16420463927627061853.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL375991076104381158.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((G(F(("(((s0<1)||(l2052<1))&&((s0<1)||(l1641<1)))")||((X(G("((s0<1)||(l1651<1))")))&&("((s0<1)||(l2052<1))"))))))
Formula 0 simplified : FG(!"(((s0<1)||(l2052<1))&&((s0<1)||(l1641<1)))" & (!"((s0<1)||(l2052<1))" | XF!"((s0<1)||(l1651<1))"))
Detected timeout of ITS tools.
[2025-06-02 19:15:34] [INFO ] Flatten gal took : 55 ms
[2025-06-02 19:15:34] [INFO ] Applying decomposition
[2025-06-02 19:15:34] [INFO ] Flatten gal took : 99 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph9950793361165931389.txt' '-o' '/tmp/graph9950793361165931389.bin' '-w' '/tmp/graph9950793361165931389.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph9950793361165931389.bin' '-l' '-1' '-v' '-w' '/tmp/graph9950793361165931389.weights' '-q' '0' '-e' '0.001'
[2025-06-02 19:15:34] [INFO ] Decomposing Gal with order
[2025-06-02 19:15:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 19:15:35] [INFO ] Removed a total of 2736 redundant transitions.
[2025-06-02 19:15:35] [INFO ] Flatten gal took : 251 ms
[2025-06-02 19:15:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 1154 labels/synchronizations in 133 ms.
[2025-06-02 19:15:35] [INFO ] Time to serialize gal into /tmp/LTL215823390132533602.gal : 21 ms
[2025-06-02 19:15:35] [INFO ] Time to serialize properties into /tmp/LTL12877716785892121060.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL215823390132533602.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12877716785892121060.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((G(F(("(((i0.u0.s0<1)||(i24.i1.u159.l2052<1))&&((i0.u0.s0<1)||(i24.i0.u154.l1641<1)))")||((X(G("((i0.u0.s0<1)||(i24.i0.u155.l1651<1)...208
Formula 0 simplified : FG(!"(((i0.u0.s0<1)||(i24.i1.u159.l2052<1))&&((i0.u0.s0<1)||(i24.i0.u154.l1641<1)))" & (!"((i0.u0.s0<1)||(i24.i1.u159.l2052<1))" | X...198
Detected timeout of ITS tools.
Treatment of property FunctionPointer-PT-c128-LTLFireability-03 finished in 506129 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||X(p1))))'
Support contains 3 out of 697 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 697/697 places, 1812/1812 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 687 transition count 1790
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 687 transition count 1790
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 22 place count 687 transition count 1788
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 31 place count 678 transition count 1768
Iterating global reduction 1 with 9 rules applied. Total rules applied 40 place count 678 transition count 1768
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 49 place count 669 transition count 1736
Iterating global reduction 1 with 9 rules applied. Total rules applied 58 place count 669 transition count 1736
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 67 place count 660 transition count 1704
Iterating global reduction 1 with 9 rules applied. Total rules applied 76 place count 660 transition count 1704
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 85 place count 651 transition count 1686
Iterating global reduction 1 with 9 rules applied. Total rules applied 94 place count 651 transition count 1686
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 103 place count 642 transition count 1666
Iterating global reduction 1 with 9 rules applied. Total rules applied 112 place count 642 transition count 1666
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 121 place count 633 transition count 1646
Iterating global reduction 1 with 9 rules applied. Total rules applied 130 place count 633 transition count 1646
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 138 place count 625 transition count 1630
Iterating global reduction 1 with 8 rules applied. Total rules applied 146 place count 625 transition count 1630
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 154 place count 617 transition count 1614
Iterating global reduction 1 with 8 rules applied. Total rules applied 162 place count 617 transition count 1614
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 163 place count 616 transition count 1612
Iterating global reduction 1 with 1 rules applied. Total rules applied 164 place count 616 transition count 1612
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 165 place count 615 transition count 1610
Iterating global reduction 1 with 1 rules applied. Total rules applied 166 place count 615 transition count 1610
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 167 place count 614 transition count 1608
Iterating global reduction 1 with 1 rules applied. Total rules applied 168 place count 614 transition count 1608
Applied a total of 168 rules in 266 ms. Remains 614 /697 variables (removed 83) and now considering 1608/1812 (removed 204) transitions.
[2025-06-02 19:15:50] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
// Phase 1: matrix 1073 rows 614 cols
[2025-06-02 19:15:50] [INFO ] Computed 2 invariants in 37 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 19:15:51] [INFO ] Implicit Places using invariants in 831 ms returned []
[2025-06-02 19:15:51] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2025-06-02 19:15:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 19:15:52] [INFO ] State equation strengthened by 265 read => feed constraints.
[2025-06-02 19:15:57] [INFO ] Implicit Places using invariants and state equation in 5788 ms returned []
Implicit Place search using SMT with State Equation took 6622 ms to find 0 implicit places.
Running 1606 sub problems to find dead transitions.
[2025-06-02 19:15:57] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2025-06-02 19:15:57] [INFO ] Invariant cache hit.
[2025-06-02 19:15:57] [INFO ] State equation strengthened by 265 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 1.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 1.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 1.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 1.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 1.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 1.0)
(s135 0.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 0.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 0.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 timeout
1.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/614 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
SMT process timed out in 34031ms, After SMT, problems are : Problem set: 0 solved, 1606 unsolved
Search for dead transitions found 0 dead transitions in 34036ms
Starting structural reductions in LTL mode, iteration 1 : 614/697 places, 1608/1812 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 40931 ms. Remains : 614/697 places, 1608/1812 transitions.
Stuttering acceptance computed with spot in 96 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : FunctionPointer-PT-c128-LTLFireability-09
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA FunctionPointer-PT-c128-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-c128-LTLFireability-09 finished in 41054 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(X(X(X(F((X(p2)||p1))))))||p0)))'
Support contains 4 out of 697 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 697/697 places, 1812/1812 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 687 transition count 1790
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 687 transition count 1790
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 22 place count 687 transition count 1788
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 31 place count 678 transition count 1768
Iterating global reduction 1 with 9 rules applied. Total rules applied 40 place count 678 transition count 1768
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 49 place count 669 transition count 1736
Iterating global reduction 1 with 9 rules applied. Total rules applied 58 place count 669 transition count 1736
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 67 place count 660 transition count 1704
Iterating global reduction 1 with 9 rules applied. Total rules applied 76 place count 660 transition count 1704
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 85 place count 651 transition count 1686
Iterating global reduction 1 with 9 rules applied. Total rules applied 94 place count 651 transition count 1686
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 103 place count 642 transition count 1666
Iterating global reduction 1 with 9 rules applied. Total rules applied 112 place count 642 transition count 1666
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 121 place count 633 transition count 1646
Iterating global reduction 1 with 9 rules applied. Total rules applied 130 place count 633 transition count 1646
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 138 place count 625 transition count 1630
Iterating global reduction 1 with 8 rules applied. Total rules applied 146 place count 625 transition count 1630
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 154 place count 617 transition count 1614
Iterating global reduction 1 with 8 rules applied. Total rules applied 162 place count 617 transition count 1614
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 163 place count 616 transition count 1612
Iterating global reduction 1 with 1 rules applied. Total rules applied 164 place count 616 transition count 1612
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 165 place count 615 transition count 1610
Iterating global reduction 1 with 1 rules applied. Total rules applied 166 place count 615 transition count 1610
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 167 place count 614 transition count 1608
Iterating global reduction 1 with 1 rules applied. Total rules applied 168 place count 614 transition count 1608
Applied a total of 168 rules in 255 ms. Remains 614 /697 variables (removed 83) and now considering 1608/1812 (removed 204) transitions.
[2025-06-02 19:16:31] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2025-06-02 19:16:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 19:16:32] [INFO ] Implicit Places using invariants in 617 ms returned []
[2025-06-02 19:16:32] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2025-06-02 19:16:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 19:16:33] [INFO ] State equation strengthened by 265 read => feed constraints.
[2025-06-02 19:16:53] [INFO ] Implicit Places using invariants and state equation in 21283 ms returned []
Implicit Place search using SMT with State Equation took 21924 ms to find 0 implicit places.
Running 1606 sub problems to find dead transitions.
[2025-06-02 19:16:53] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2025-06-02 19:16:53] [INFO ] Invariant cache hit.
[2025-06-02 19:16:53] [INFO ] State equation strengthened by 265 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 1.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 1.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 1.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 1.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 1.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 1.0)
(s135 0.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 0.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 0.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 0.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 1.0)
(s329 1.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 1.0)
(s349 1.0)
(s350 1.0)
(s351 1.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s355 1.0)
(s356 1.0)
(s357 1.0)
(s358 1.0)
(s359 1.0)
(s360 1.0)
(s361 1.0)
(s362 1.0)
(s363 1.0)
(s364 1.0)
(s365 1.0)
(s366 1.0)
(s367 1.0)
(s368 1.0)
(s369 1.0)
(s370 1.0)
(s371 1.0)
(s372 1.0)
(s373 1.0)
(s374 1.0)
(s375 1.0)
(s376 1.0)
(s377 1.0)
(s378 1.0)
(s379 1.0)
(s380 1.0)
(s381 1.0)
(s382 1.0)
(s383 1.0)
(s384 1.0)
(s385 1.0)
(s386 1.0)
(s387 1.0)
(s388 1.0)
(s389 1.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 1.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 0.0)
(s429 0.0)
(s430 0.0)
(s431 0.0)
(s432 0.0)
(s433 0.0)
(s434 0.0)
(s435 0.0)
(s436 0.0)
(s437 0.0)
(s438 0.0)
(s439 0.0)
(s440 0.0)
(s441 0.0)
(s442 0.0)
(s443 0.0)
(s444 0.0)
(s445 0.0)
(s446 0.0)
(s447 0.0)
(s448 0.0)
(s449 1.0)
(s450 0.0)
(s451 0.0)
(s452 0.0)
(s453 0.0)
(s454 0.0)
(s455 1.0)
(s456 1.0)
(s457 1.0)
(s458 1.0)
(s459 0.0)
(s460 1.0)
(s461 1.0)
(s462 1.0)
(s463 1.0)
(s464 1.0)
(s465 1.0)
(s466 1.0)
(s467 1.0)
(s468 1.0)
(s469 1.0)
(s470 1.0)
(s471 1.0)
(s472 1.0)
(s473 1.0)
(s474 1.0)
(s475 1.0)
(s476 1.0)
(s477 1.0)
(s478 1.0)
(s479 1.0)
(s480 1.0)
(s481 1.0)
(s482 1.0)
(s483 1.0)
(s484 1.0)
(s485 1.0)
(s486 1.0)
(s487 1.0)
(s488 1.0)
(s489 1.0)
(s490 0.0)
(s491 0.0)
(s492 1.0)
(s493 0.0)
(s494 1.0)
(s495 1.0)
(s496 0.0)
(s497 1.0)
(s498 1.0)
(s499 1.0)
(s500 1.0)
(s501 1.0)
(s502 0.0)
(s503 1.0)
(s504 1.0)
(s505 1.0)
(s506 1.0)
(s507 1.0)
(s508 1.0)
(s509 1.0)
(s510 1.0)
(s511 1.0)
(s512 1.0)
(s513 1.0)
(s514 1.0)
(s515 1.0)
(s516 1.0)
(s517 1.0)
(s518 1.0)
(s519 1.0)
(s520 1.0)
(s521 1.0)
(s522 1.0)
(s523 1.0)
(s524 1.0)
(s525 1.0)
(s526 1.0)
(s527 1.0)
(s528 1.0)
(s529 1.0)
(s530 1.0)
(s531 1.0)
(s532 1.0)
(s533 1.0)
(s534 1.0)
(s535 1.0)
(s536 1.0)
(s537 1.0)
(s538 1.0)
(s539 1.0)
(s540 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/614 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
SMT process timed out in 33620ms, After SMT, problems are : Problem set: 0 solved, 1606 unsolved
Search for dead transitions found 0 dead transitions in 33623ms
Starting structural reductions in LTL mode, iteration 1 : 614/697 places, 1608/1812 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 55806 ms. Remains : 614/697 places, 1608/1812 transitions.
Stuttering acceptance computed with spot in 332 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : FunctionPointer-PT-c128-LTLFireability-10
Product exploration explored 100000 steps with 748 reset in 939 ms.
Product exploration explored 100000 steps with 758 reset in 1051 ms.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Knowledge obtained : [(AND p0 p1 p2)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 165 ms. Reduced automaton from 6 states, 7 edges and 3 AP (stutter sensitive) to 6 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 306 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Reduction of identical properties reduced properties to check from 4 to 2
RANDOM walk for 40118 steps (8 resets) in 212 ms. (188 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 52 ms. (754 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 52 ms. (754 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 176663 steps, run timeout after 3001 ms. (steps per millisecond=58 ) properties seen :0 out of 2
Probabilistic random walk after 176663 steps, saw 114685 distinct states, run finished after 3001 ms. (steps per millisecond=58 ) properties seen :0
[2025-06-02 19:17:33] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2025-06-02 19:17:33] [INFO ] Invariant cache hit.
[2025-06-02 19:17:33] [INFO ] State equation strengthened by 265 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 536/540 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/540 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/540 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 940/1480 variables, 472/477 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1480 variables, 1/478 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/1480 variables, 264/742 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1480 variables, 0/742 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 62/1542 variables, 1/743 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1542 variables, 0/743 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 139/1681 variables, 134/877 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1681 variables, 0/877 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 5/1686 variables, 3/880 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1686 variables, 0/880 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 1/1687 variables, 1/881 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1687 variables, 0/881 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 0/1687 variables, 0/881 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1687/1687 variables, and 881 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1460 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 614/614 constraints, ReadFeed: 265/265 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 536/540 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/540 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/540 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 940/1480 variables, 472/477 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1480 variables, 1/478 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1480 variables, 264/742 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1480 variables, 2/744 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:17:35] [INFO ] Deduced a trap along path composed of 3 places in 35 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:17:35] [INFO ] Deduced a trap along path composed of 3 places in 27 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1480 variables, 2/746 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1480 variables, 0/746 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 62/1542 variables, 1/747 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:17:36] [INFO ] Deduced a trap composed of 131 places in 219 ms of which 10 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/1542 variables, 1/748 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:17:37] [INFO ] Deduced a trap along path composed of 3 places in 34 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:17:37] [INFO ] Deduced a trap along path composed of 3 places in 31 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:17:37] [INFO ] Deduced a trap along path composed of 3 places in 40 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:17:37] [INFO ] Deduced a trap along path composed of 3 places in 29 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:17:38] [INFO ] Deduced a trap along path composed of 3 places in 24 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/1542 variables, 5/753 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1542 variables, 0/753 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 139/1681 variables, 134/887 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1681 variables, 0/887 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 5/1686 variables, 3/890 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1686 variables, 0/890 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 1/1687 variables, 1/891 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1687 variables, 0/891 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 0/1687 variables, 0/891 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1687/1687 variables, and 891 constraints, problems are : Problem set: 0 solved, 2 unsolved in 4858 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 614/614 constraints, ReadFeed: 265/265 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 7/7 constraints]
After SMT, in 6338ms problems are : Problem set: 0 solved, 2 unsolved
Finished Parikh walk after 167195 steps, including 396 resets, run visited all 1 properties in 2638 ms. (steps per millisecond=63 )
Parikh walk visited 2 properties in 5133 ms.
Knowledge obtained : [(AND p0 p1 p2)]
False Knowledge obtained : [(F (NOT (OR p1 p2))), (F (NOT p2)), (F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 1 factoid took 291 ms. Reduced automaton from 6 states, 7 edges and 3 AP (stutter sensitive) to 6 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 303 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 302 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Support contains 4 out of 614 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 614/614 places, 1608/1608 transitions.
Applied a total of 0 rules in 28 ms. Remains 614 /614 variables (removed 0) and now considering 1608/1608 (removed 0) transitions.
[2025-06-02 19:17:45] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2025-06-02 19:17:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 19:17:46] [INFO ] Implicit Places using invariants in 996 ms returned []
[2025-06-02 19:17:46] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2025-06-02 19:17:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 19:17:47] [INFO ] State equation strengthened by 265 read => feed constraints.
[2025-06-02 19:18:05] [INFO ] Implicit Places using invariants and state equation in 18953 ms returned []
Implicit Place search using SMT with State Equation took 19958 ms to find 0 implicit places.
Running 1606 sub problems to find dead transitions.
[2025-06-02 19:18:05] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2025-06-02 19:18:05] [INFO ] Invariant cache hit.
[2025-06-02 19:18:05] [INFO ] State equation strengthened by 265 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/614 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/614 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 614/1687 variables, and 2 constraints, problems are : Problem set: 0 solved, 1606 unsolved in 30053 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/614 constraints, ReadFeed: 0/265 constraints, PredecessorRefiner: 1606/1606 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1606 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/614 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/614 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 614/1687 variables, and 2 constraints, problems are : Problem set: 0 solved, 1606 unsolved in 30048 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/614 constraints, ReadFeed: 0/265 constraints, PredecessorRefiner: 0/1606 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 64895ms problems are : Problem set: 0 solved, 1606 unsolved
Search for dead transitions found 0 dead transitions in 64901ms
Finished structural reductions in LTL mode , in 1 iterations and 84894 ms. Remains : 614/614 places, 1608/1608 transitions.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Knowledge obtained : [(AND p0 p1 p2)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 174 ms. Reduced automaton from 6 states, 7 edges and 3 AP (stutter sensitive) to 6 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 309 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Reduction of identical properties reduced properties to check from 4 to 2
RANDOM walk for 40039 steps (8 resets) in 196 ms. (203 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 41 ms. (952 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 40 ms. (975 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 185878 steps, run timeout after 3001 ms. (steps per millisecond=61 ) properties seen :0 out of 2
Probabilistic random walk after 185878 steps, saw 120664 distinct states, run finished after 3001 ms. (steps per millisecond=61 ) properties seen :0
[2025-06-02 19:19:14] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2025-06-02 19:19:14] [INFO ] Invariant cache hit.
[2025-06-02 19:19:14] [INFO ] State equation strengthened by 265 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 536/540 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/540 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/540 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 940/1480 variables, 472/477 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1480 variables, 1/478 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/1480 variables, 264/742 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1480 variables, 0/742 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 62/1542 variables, 1/743 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1542 variables, 0/743 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 139/1681 variables, 134/877 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1681 variables, 0/877 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 5/1686 variables, 3/880 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1686 variables, 0/880 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 1/1687 variables, 1/881 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1687 variables, 0/881 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 0/1687 variables, 0/881 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1687/1687 variables, and 881 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1613 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 614/614 constraints, ReadFeed: 265/265 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 536/540 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/540 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/540 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 940/1480 variables, 472/477 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1480 variables, 1/478 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1480 variables, 264/742 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1480 variables, 2/744 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:19:16] [INFO ] Deduced a trap along path composed of 3 places in 34 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:19:16] [INFO ] Deduced a trap along path composed of 3 places in 28 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1480 variables, 2/746 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1480 variables, 0/746 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 62/1542 variables, 1/747 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:19:17] [INFO ] Deduced a trap composed of 131 places in 193 ms of which 6 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/1542 variables, 1/748 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:19:18] [INFO ] Deduced a trap along path composed of 3 places in 32 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:19:18] [INFO ] Deduced a trap along path composed of 3 places in 34 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:19:18] [INFO ] Deduced a trap along path composed of 3 places in 30 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:19:18] [INFO ] Deduced a trap along path composed of 3 places in 26 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:19:18] [INFO ] Deduced a trap along path composed of 3 places in 26 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/1542 variables, 5/753 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1542 variables, 0/753 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 139/1681 variables, 134/887 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1681 variables, 0/887 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 5/1686 variables, 3/890 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1686 variables, 0/890 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 1/1687 variables, 1/891 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1687 variables, 0/891 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 0/1687 variables, 0/891 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1687/1687 variables, and 891 constraints, problems are : Problem set: 0 solved, 2 unsolved in 4677 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 614/614 constraints, ReadFeed: 265/265 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 7/7 constraints]
After SMT, in 6309ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 1 properties in 2324 ms.
Support contains 2 out of 614 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 614/614 places, 1608/1608 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 614 transition count 1604
Applied a total of 4 rules in 193 ms. Remains 614 /614 variables (removed 0) and now considering 1604/1608 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 193 ms. Remains : 614/614 places, 1604/1608 transitions.
RANDOM walk for 40042 steps (8 resets) in 149 ms. (266 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 32 ms. (1212 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 269355 steps, run timeout after 3001 ms. (steps per millisecond=89 ) properties seen :0 out of 1
Probabilistic random walk after 269355 steps, saw 174842 distinct states, run finished after 3001 ms. (steps per millisecond=89 ) properties seen :0
[2025-06-02 19:19:25] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
// Phase 1: matrix 1071 rows 614 cols
[2025-06-02 19:19:26] [INFO ] Computed 2 invariants in 8 ms
[2025-06-02 19:19:26] [INFO ] State equation strengthened by 265 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 334/336 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/336 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1139/1475 variables, 471/473 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1475 variables, 265/738 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1475 variables, 0/738 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 62/1537 variables, 1/739 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1537 variables, 0/739 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/1538 variables, 1/740 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1538 variables, 1/741 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1538 variables, 0/741 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 139/1677 variables, 135/876 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/1677 variables, 0/876 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 5/1682 variables, 3/879 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1682 variables, 0/879 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 3/1685 variables, 2/881 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1685 variables, 0/881 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/1685 variables, 0/881 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1685/1685 variables, and 881 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1232 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 614/614 constraints, ReadFeed: 265/265 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 334/336 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/336 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1139/1475 variables, 471/473 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1475 variables, 265/738 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1475 variables, 1/739 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1475 variables, 0/739 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 62/1537 variables, 1/740 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1537 variables, 0/740 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/1538 variables, 1/741 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1538 variables, 1/742 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:19:29] [INFO ] Deduced a trap along path composed of 3 places in 22 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:19:29] [INFO ] Deduced a trap along path composed of 3 places in 26 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/1538 variables, 2/744 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1538 variables, 0/744 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 139/1677 variables, 135/879 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:19:30] [INFO ] Deduced a trap along path composed of 3 places in 23 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/1677 variables, 1/880 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1677 variables, 0/880 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 5/1682 variables, 3/883 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1682 variables, 0/883 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 3/1685 variables, 2/885 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1685 variables, 0/885 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/1685 variables, 0/885 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1685/1685 variables, and 885 constraints, problems are : Problem set: 0 solved, 1 unsolved in 4759 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 614/614 constraints, ReadFeed: 265/265 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 6019ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 946 ms.
Support contains 2 out of 614 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 614/614 places, 1604/1604 transitions.
Applied a total of 0 rules in 155 ms. Remains 614 /614 variables (removed 0) and now considering 1604/1604 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 155 ms. Remains : 614/614 places, 1604/1604 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 614/614 places, 1604/1604 transitions.
Applied a total of 0 rules in 134 ms. Remains 614 /614 variables (removed 0) and now considering 1604/1604 (removed 0) transitions.
[2025-06-02 19:19:33] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2025-06-02 19:19:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 19:19:34] [INFO ] Implicit Places using invariants in 864 ms returned []
[2025-06-02 19:19:34] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2025-06-02 19:19:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 19:19:34] [INFO ] State equation strengthened by 265 read => feed constraints.
[2025-06-02 19:19:53] [INFO ] Implicit Places using invariants and state equation in 19019 ms returned []
Implicit Place search using SMT with State Equation took 19887 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 19:19:53] [INFO ] Redundant transitions in 52 ms returned []
Running 1602 sub problems to find dead transitions.
[2025-06-02 19:19:53] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2025-06-02 19:19:53] [INFO ] Invariant cache hit.
[2025-06-02 19:19:53] [INFO ] State equation strengthened by 265 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/614 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/614 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 614/1685 variables, and 2 constraints, problems are : Problem set: 0 solved, 1602 unsolved in 30046 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/614 constraints, ReadFeed: 0/265 constraints, PredecessorRefiner: 1602/1602 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1602 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/614 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/614 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
(s41 0timeout
^^^^^^^^
(error "Invalid token: 0timeout")
Error getting values : (error "ParserException while parsing response: ((s0 1)
(s1 1)
(s2 1)
(s3 1)
(s4 5)
(s5 1)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 1)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 1)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 614/1685 variables, and 2 constraints, problems are : Problem set: 0 solved, 1602 unsolved in 30046 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/614 constraints, ReadFeed: 0/265 constraints, PredecessorRefiner: 0/1602 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 64067ms problems are : Problem set: 0 solved, 1602 unsolved
Search for dead transitions found 0 dead transitions in 64071ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 84155 ms. Remains : 614/614 places, 1604/1604 transitions.
Knowledge obtained : [(AND p0 p1 p2)]
False Knowledge obtained : [(F (NOT (OR p1 p2))), (F (NOT p2)), (F (NOT p1))]
Knowledge based reduction with 1 factoid took 283 ms. Reduced automaton from 6 states, 7 edges and 3 AP (stutter sensitive) to 6 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 305 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 292 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 279 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 776 reset in 1132 ms.
Product exploration explored 100000 steps with 731 reset in 923 ms.
Applying partial POR strategy [false, false, false, false, false, true]
Stuttering acceptance computed with spot in 313 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Support contains 4 out of 614 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 614/614 places, 1608/1608 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 614 transition count 1604
Applied a total of 4 rules in 414 ms. Remains 614 /614 variables (removed 0) and now considering 1604/1608 (removed 4) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 19:21:01] [INFO ] Redundant transitions in 86 ms returned []
Running 1602 sub problems to find dead transitions.
[2025-06-02 19:21:01] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2025-06-02 19:21:01] [INFO ] Invariant cache hit.
[2025-06-02 19:21:01] [INFO ] State equation strengthened by 265 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/614 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/614 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 614/1685 variables, and 2 constraints, problems are : Problem set: 0 solved, 1602 unsolved in 30048 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/614 constraints, ReadFeed: 0/265 constraints, PredecessorRefiner: 1602/1602 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1602 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/614 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/614 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1)
(s1 1)
(s2 1)
(s3 1)
(s4 5)
(s5 1)
(s6 0)
(s7 1)
(s8 1)
(s9 1)
(s10 1)
(s11 1)
(s12 0)
(s13 0)
(s14 1)
(s15 1)
(s16 0)
(s17 1)
(s18 0)
(s19 1)
(s20 1)
(s21 1)
(s22 1)
(s23 0)
(s24 0)
(s25 0)
(s26 1)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 1)
(s33 1)
(s34 0)
(s35 0)
(s36 1)
(s37 0)
(s38 1)
(s39 1)
(s40 0)
(s41 1)
(s42 1)
(s43 1)
(s44 0)
(s45 0)
(s46 1)
(s47 1)
(s48 0)
(s49 1)
(s50 0)
(s51 1)
(s52 1)
(s53 1)
(s54 0)
(s55 0)
(s56 1)
(s57 0)
(s58 1)
(s59 1)
(s60 1)
(s61 1)
(s62 1)
(s63 1)
(s64 1)
(s65 1)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 1)
(s71 1)
(s72 1)
(s73 1)
(s74 1)
(s75 1)
(s76 1)
(s77 1)
(s78 0)
(s79 0)
(s80 1)
(s81 1)
(s82 1)
(s83 0)
(s84 1)
(s85 0)
(s86 1)
(s87 1)
(s88 0)
(s89 1)
(s90 0)
(s91 0)
(s92 1)
(s93 0)
(s94 0)
(s95 1)
(s96 1)
(s97 1)
(s98 1)
(s99 1)
(s100 1)
(s101 1)
(s102 1)
(s103 0)
(s104 1)
(s105 0)
(s106 1)
(s107 1)
(s108 1)
(s109 1)
(s110 1)
(s111 0)
(s112 1)
(s113 0)
(s114 1)
(s115 1)
(s116 1)
(s117 1)
(s118 1)
(s119 1)
(s120 1)
(s121 1)
(s122 1)
(s123 1)
(s124 1)
(s125 1)
(s126 1)
(s127 1)
(s128 1)
(s129 1)
(s130 1)
(s131 1)
(s132 1)
(s133 1)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 1)
(s141 0)
(s142 0)
(s143 1)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 1)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 1)
(s155 0)
(s156 1)
(s157 0)
(s158 0)
(s159 0)
(s160 1)
(s161 0)
(s162 0)
(s163 1)
(s164 0)
(s165 0)
(s166 1)
(s167 1)
(s168 0)
(s169 0)
(s170 1)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 1)
(s178 0)
(s179 0)
(s180 1)
(s181 0)
(s182 1)
(s183 1)
(s184 1)
(s185 0)
(s186 0)
(s187 0)
(s188 0)
(s189 1)
(s190 0)
(s191 0)
(s192 0)
(s193 1)
(s194 0)
(s195 0)
(s196 1)
(s197 0)
(s198 1)
(s199 1)
(s200 1)
(s201 1)
(s202 1)
(s203 1)
(s204 1)
(s205 1)
(s206 1)
(s207 1)
(s208 1)
(s209 1)
(s210 1)
(s211 1)
(s212 1)
(s213 1)
(s214 1)
(s215 1)
(s216 1)
(s217 1)
(s218 1)
(s219 1)
(s220 1)
(s221 1)
(s222 1)
(s223 1)
(s224 1)
(s225 1)
(s226 1)
(s227 1)
(s228 1)
(s229 1)
(s230 1)
(s231 1)
(s232 1)
(s233 1)
(s234 1)
(s235 1)
(s236 1)
(s237 1)
(s238 1)
(s239 1)
(s240 1)
(s241 1)
(s242 1)
(s243 1)
(s244 1)
(s245 1)
(s246 1)
(s247 1)
(s248 1)
(s249 1)
(s250 1)
(s251 1)
(s252 1)
(s253 1)
(s254 1)
(s255 1)
(s256 1)
(s257 1)
(s258 1)
(s259 1)
(s260 1)
(s261 1)
(s262 1)
(s263 1)
(s264 1)
(s265 1)
(s266 1)
(s267 1)
(s268 1)
(s269 1)
(s270 1)
(s271 1)
(s272 1)
(s273 1)
(s274 1)
(s275 1)
(s276 1)
(s277 1)
(s278 1)
(s279 1)
(s280 1)
(s281 1)
(s282 1)
(s283 1)
(s284 1)
(s285 1)
(s286 1)
(s287 1)
(s288 1)
(s289 1)
(s290 1)
(s291 1)
(s292 1)
(s293 1)
(s294 1)
(s295 1)
(s296 1)
(s297 1)
(s298 1)
(s299 1)
(s300 1)
(s301 1)
(s302 1)
(s303 1)
(s304 1)
(s305 1)
(s306 1)
(s307 1)
(s308 1)
(s309 1)
(s310 1)
(s311 1)
(s312 1)
(s313 1)
(s314 1)
(s315 1)
(s316 1)
(s317 1)
(s318 1)
(s319 1)
(s320 1)
(s321 1)
(s322 1)
(s323 1)
(s324 1)
(s325 1)
(s326 1)
(s327 1)
(s328 1)
(s329 1)
(s330 1)
(s331 1)
(s332 1)
(s333 1)
(s334 1)
(s335 1)
(s336 1)
(s337 1)
(s338 1)
(s339 1)
(s340 1)
(s341 1)
(s342 1)
(s343 1)
(s344 1)
(s345 1)
(s346 1)
(s347 1)
(s348 1)
(s349 1)
(s350 1)
(s351 1)
(s352 1)
(s353 1)
(s354 1)
(s355 1)
(s356 1)
(s357 1)
(s358 1)
(s359 1)
(s360 1)
(s361 1)
(s362 1)
(s363 1)
(s364 1)
(s365 1)
(s366 1)
(s367 1)
(s368 1)
(s369 1)
(s370 1)
(s371 1)
(s372 1)
(s373 1)
(s374 1)
(s375 1)
(s376 1)
(s377 1)
(s378 1)
(s379 1)
(s380 1)
(s381 1)
(s382 1)
(s383 1)
(s384 1)
(s385 1)
(s386 1)
(s387 1)
(s388 1)
(s389 1)
(s390 0)
(s391 0)
(s392 0)
(s393 0)
(s394 0)
(s395 0)
(s396 0)
(s397 0)
(s398 0)
(s399 0)
(s400 0)
(s401 0)
(s402 0)
(s403 0)
(s404 0)
(s405 0)
(s406 0)
(s407 0)
(s408 0)
(s409 0)
(s410 0)
(s411 0)
(s412 0)
(s413 0)
(s414 0)
(s415 0)
(s416 0)
(s417 0)
(s418 0)
(s419 0)
(s420 0)
(s421 0)
(s422 0)
(s423 0)
(s424 0)
(s425 0)
(s426 0)
(s427 0)
(s428 0)
(s429 0)
(s430 0)
(s431 0)
(s432 0)
(s433 0)
(s434 0)
(s435 0)
(s436 0)
(s437 0)
(s438 0)
(s439 0)
(s440 0)
(s441 0)
(s442 0)
(s443 0)
(s444 timeout
0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 614/1685 variables, and 2 constraints, problems are : Problem set: 0 solved, 1602 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/614 constraints, ReadFeed: 0/265 constraints, PredecessorRefiner: 0/1602 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 64391ms problems are : Problem set: 0 solved, 1602 unsolved
Search for dead transitions found 0 dead transitions in 64396ms
Starting structural reductions in SI_LTL mode, iteration 1 : 614/614 places, 1604/1608 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 64927 ms. Remains : 614/614 places, 1604/1608 transitions.
Built C files in :
/tmp/ltsmin12310236466738364941
[2025-06-02 19:22:06] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12310236466738364941
Running compilation step : cd /tmp/ltsmin12310236466738364941;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12310236466738364941;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12310236466738364941;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
Support contains 4 out of 614 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 614/614 places, 1608/1608 transitions.
Applied a total of 0 rules in 18 ms. Remains 614 /614 variables (removed 0) and now considering 1608/1608 (removed 0) transitions.
[2025-06-02 19:22:09] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
// Phase 1: matrix 1073 rows 614 cols
[2025-06-02 19:22:09] [INFO ] Computed 2 invariants in 7 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 19:22:09] [INFO ] Implicit Places using invariants in 790 ms returned []
[2025-06-02 19:22:09] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2025-06-02 19:22:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 19:22:10] [INFO ] State equation strengthened by 265 read => feed constraints.
[2025-06-02 19:22:29] [INFO ] Implicit Places using invariants and state equation in 19195 ms returned []
Implicit Place search using SMT with State Equation took 19988 ms to find 0 implicit places.
Running 1606 sub problems to find dead transitions.
[2025-06-02 19:22:29] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2025-06-02 19:22:29] [INFO ] Invariant cache hit.
[2025-06-02 19:22:29] [INFO ] State equation strengthened by 265 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/614 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
SMT process timed out in 33962ms, After SMT, problems are : Problem set: 0 solved, 1606 unsolved
Search for dead transitions found 0 dead transitions in 33965ms
Finished structural reductions in LTL mode , in 1 iterations and 53975 ms. Remains : 614/614 places, 1608/1608 transitions.
Built C files in :
/tmp/ltsmin5051230034909644432
[2025-06-02 19:23:03] [INFO ] Built C files in 32ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5051230034909644432
Running compilation step : cd /tmp/ltsmin5051230034909644432;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5051230034909644432;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5051230034909644432;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
[2025-06-02 19:23:06] [INFO ] Flatten gal took : 85 ms
[2025-06-02 19:23:06] [INFO ] Flatten gal took : 85 ms
[2025-06-02 19:23:06] [INFO ] Time to serialize gal into /tmp/LTL7737325033568598699.gal : 20 ms
[2025-06-02 19:23:06] [INFO ] Time to serialize properties into /tmp/LTL15430208312122427357.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7737325033568598699.gal' '-t' 'CGAL' '-hoa' '/tmp/aut13057962909970472575.hoa' '-atoms' '/tmp/LTL15430208312122427357.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL15430208312122427357.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut13057962909970472575.hoa
Detected timeout of ITS tools.
[2025-06-02 19:23:21] [INFO ] Flatten gal took : 46 ms
[2025-06-02 19:23:21] [INFO ] Flatten gal took : 44 ms
[2025-06-02 19:23:21] [INFO ] Time to serialize gal into /tmp/LTL14736712961180751748.gal : 7 ms
[2025-06-02 19:23:21] [INFO ] Time to serialize properties into /tmp/LTL7483072848506818529.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14736712961180751748.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7483072848506818529.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(("((s0<1)||(l2062<1))")||(X(X(X(X(F(("((s1<1)||(l653<1))")||(X("((s1<1)||(l653<1))")))))))))))
Formula 0 simplified : F(!"((s0<1)||(l2062<1))" & XXXXG(!"((s1<1)||(l653<1))" & X!"((s1<1)||(l653<1))"))
Detected timeout of ITS tools.
[2025-06-02 19:23:36] [INFO ] Flatten gal took : 49 ms
[2025-06-02 19:23:36] [INFO ] Applying decomposition
[2025-06-02 19:23:36] [INFO ] Flatten gal took : 71 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph3186757327735918715.txt' '-o' '/tmp/graph3186757327735918715.bin' '-w' '/tmp/graph3186757327735918715.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph3186757327735918715.bin' '-l' '-1' '-v' '-w' '/tmp/graph3186757327735918715.weights' '-q' '0' '-e' '0.001'
[2025-06-02 19:23:36] [INFO ] Decomposing Gal with order
[2025-06-02 19:23:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 19:23:37] [INFO ] Removed a total of 2670 redundant transitions.
[2025-06-02 19:23:37] [INFO ] Flatten gal took : 151 ms
[2025-06-02 19:23:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 1248 labels/synchronizations in 104 ms.
[2025-06-02 19:23:37] [INFO ] Time to serialize gal into /tmp/LTL667156793810251816.gal : 20 ms
[2025-06-02 19:23:37] [INFO ] Time to serialize properties into /tmp/LTL2742153277025708208.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL667156793810251816.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2742153277025708208.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...253
Read 1 LTL properties
Checking formula 0 : !((G(("((i1.u1.s0<1)||(i26.i2.u148.l2062<1))")||(X(X(X(X(F(("((i13.i0.u0.s1<1)||(i19.u81.l653<1))")||(X("((i13.i0.u0.s1<1)||(i19.u81.l...174
Formula 0 simplified : F(!"((i1.u1.s0<1)||(i26.i2.u148.l2062<1))" & XXXXG(!"((i13.i0.u0.s1<1)||(i19.u81.l653<1))" & X!"((i13.i0.u0.s1<1)||(i19.u81.l653<1))...158
Detected timeout of ITS tools.
Treatment of property FunctionPointer-PT-c128-LTLFireability-10 finished in 440968 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((X(G(p0))||(G(p2)&&p1)))))'
Support contains 5 out of 697 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 697/697 places, 1812/1812 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 689 transition count 1794
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 689 transition count 1794
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 23 place count 682 transition count 1778
Iterating global reduction 0 with 7 rules applied. Total rules applied 30 place count 682 transition count 1778
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 37 place count 675 transition count 1752
Iterating global reduction 0 with 7 rules applied. Total rules applied 44 place count 675 transition count 1752
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 51 place count 668 transition count 1726
Iterating global reduction 0 with 7 rules applied. Total rules applied 58 place count 668 transition count 1726
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 65 place count 661 transition count 1712
Iterating global reduction 0 with 7 rules applied. Total rules applied 72 place count 661 transition count 1712
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 79 place count 654 transition count 1698
Iterating global reduction 0 with 7 rules applied. Total rules applied 86 place count 654 transition count 1698
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 93 place count 647 transition count 1684
Iterating global reduction 0 with 7 rules applied. Total rules applied 100 place count 647 transition count 1684
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 106 place count 641 transition count 1672
Iterating global reduction 0 with 6 rules applied. Total rules applied 112 place count 641 transition count 1672
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 118 place count 635 transition count 1660
Iterating global reduction 0 with 6 rules applied. Total rules applied 124 place count 635 transition count 1660
Applied a total of 124 rules in 181 ms. Remains 635 /697 variables (removed 62) and now considering 1660/1812 (removed 152) transitions.
[2025-06-02 19:23:52] [INFO ] Flow matrix only has 1107 transitions (discarded 553 similar events)
// Phase 1: matrix 1107 rows 635 cols
[2025-06-02 19:23:52] [INFO ] Computed 2 invariants in 12 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 19:23:53] [INFO ] Implicit Places using invariants in 1013 ms returned []
[2025-06-02 19:23:53] [INFO ] Flow matrix only has 1107 transitions (discarded 553 similar events)
[2025-06-02 19:23:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 19:23:54] [INFO ] State equation strengthened by 271 read => feed constraints.
[2025-06-02 19:23:59] [INFO ] Implicit Places using invariants and state equation in 5887 ms returned []
Implicit Place search using SMT with State Equation took 6907 ms to find 0 implicit places.
Running 1658 sub problems to find dead transitions.
[2025-06-02 19:23:59] [INFO ] Flow matrix only has 1107 transitions (discarded 553 similar events)
[2025-06-02 19:23:59] [INFO ] Invariant cache hit.
[2025-06-02 19:23:59] [INFO ] State equation strengthened by 271 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/635 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1658 unsolved
SMT process timed out in 34371ms, After SMT, problems are : Problem set: 0 solved, 1658 unsolved
Search for dead transitions found 0 dead transitions in 34374ms
Starting structural reductions in LTL mode, iteration 1 : 635/697 places, 1660/1812 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 41467 ms. Remains : 635/697 places, 1660/1812 transitions.
Stuttering acceptance computed with spot in 317 ms :[true, (NOT p0), (AND (NOT p0) (NOT p2)), (NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))]
Running random walk in product with property : FunctionPointer-PT-c128-LTLFireability-13
Entered a terminal (fully accepting) state of product in 1819 steps with 11 reset in 32 ms.
FORMULA FunctionPointer-PT-c128-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-c128-LTLFireability-13 finished in 41846 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 697 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 697/697 places, 1812/1812 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 686 transition count 1788
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 686 transition count 1788
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 24 place count 686 transition count 1786
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 34 place count 676 transition count 1764
Iterating global reduction 1 with 10 rules applied. Total rules applied 44 place count 676 transition count 1764
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 54 place count 666 transition count 1728
Iterating global reduction 1 with 10 rules applied. Total rules applied 64 place count 666 transition count 1728
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 74 place count 656 transition count 1692
Iterating global reduction 1 with 10 rules applied. Total rules applied 84 place count 656 transition count 1692
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 94 place count 646 transition count 1672
Iterating global reduction 1 with 10 rules applied. Total rules applied 104 place count 646 transition count 1672
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 114 place count 636 transition count 1650
Iterating global reduction 1 with 10 rules applied. Total rules applied 124 place count 636 transition count 1650
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 134 place count 626 transition count 1628
Iterating global reduction 1 with 10 rules applied. Total rules applied 144 place count 626 transition count 1628
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 153 place count 617 transition count 1610
Iterating global reduction 1 with 9 rules applied. Total rules applied 162 place count 617 transition count 1610
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 171 place count 608 transition count 1592
Iterating global reduction 1 with 9 rules applied. Total rules applied 180 place count 608 transition count 1592
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 181 place count 607 transition count 1590
Iterating global reduction 1 with 1 rules applied. Total rules applied 182 place count 607 transition count 1590
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 183 place count 606 transition count 1588
Iterating global reduction 1 with 1 rules applied. Total rules applied 184 place count 606 transition count 1588
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 185 place count 605 transition count 1586
Iterating global reduction 1 with 1 rules applied. Total rules applied 186 place count 605 transition count 1586
Applied a total of 186 rules in 403 ms. Remains 605 /697 variables (removed 92) and now considering 1586/1812 (removed 226) transitions.
[2025-06-02 19:24:34] [INFO ] Flow matrix only has 1058 transitions (discarded 528 similar events)
// Phase 1: matrix 1058 rows 605 cols
[2025-06-02 19:24:34] [INFO ] Computed 2 invariants in 12 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 19:24:35] [INFO ] Implicit Places using invariants in 1225 ms returned []
[2025-06-02 19:24:35] [INFO ] Flow matrix only has 1058 transitions (discarded 528 similar events)
[2025-06-02 19:24:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 19:24:36] [INFO ] State equation strengthened by 262 read => feed constraints.
[2025-06-02 19:24:47] [INFO ] Implicit Places using invariants and state equation in 11658 ms returned []
Implicit Place search using SMT with State Equation took 12891 ms to find 0 implicit places.
Running 1584 sub problems to find dead transitions.
[2025-06-02 19:24:47] [INFO ] Flow matrix only has 1058 transitions (discarded 528 similar events)
[2025-06-02 19:24:47] [INFO ] Invariant cache hit.
[2025-06-02 19:24:47] [INFO ] State equation strengthened by 262 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/605 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1584 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/605 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1584 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 3.0)
(s6 0.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 1.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 1.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 1.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 1.0)
(s138 1.0)
(s139 0.0)
(s140 1.0)
(s141 0.0)
(s142 0.0)
(s143 1.0)
(s144 0.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 0.0)
(s149 1.0)
(s150 1.0)
(s151 0.0)
(s152 1.0)
(s153 1.0)
(s154 0.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 0.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 0.0)
(s176 1.0)
(s177 0.0)
(s178 0.0)
(s179 1.0)
(s180 0.0)
(s181 1.0)
(s182 0.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 0.0)
(s190 1.0)
(s191 1.0)
(s192 0.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 1.0)
(s329 1.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 1.0)
(s349 1.0)
(s350 1.0)
(s351 1.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s355 1.0)
(s356 1.0)
(s357 1.0)
(s358 1.0)
(s359 1.0)
(s360 1.0)
(s361 1.0)
(s362 1.0)
(s363 1.0)
(s364 1.0)
(s365 1.0)
(s366 1.0)
(s367 1.0)
(s368 1.0)
(s369 1.0)
(s370 1.0)
(s371 1.0)
(s372 1.0)
(s373 1.0)
(s374 1.0)
(s375 1.0)
(s376 1.0)
(s377 1.0)
(s378 1.0)
(s379 1.0)
(s380 1.0)
(s381 1.0)
(s382 1.0)
(s383 1.0)
(s384 1.0)
(s385 1.0)
(s386 1.0)
(s387 1.0)
(s388 1.0)
(s389 1.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 0.0)
(s429 0.0)
(s430 0.0)
(s431 0.0)
(s432 0.0)
(s433 0.0)
(s434 0.0)
(s435 0.0)
(s436 0.0)
(s437 0.0)
(s438 0.0)
(s439 0.0)
(s440 1.0)
(s441 0.0)
(s442 0.0)
(s443 0.0)
(s444 0.0)
(s445 0.0)
(s446 0.0)
(s447 0.0)
(s448 0.0)
(s449 0.0)
(s450 0.0)
(s451 0.0)
(s452 0.0)
(s453 0.0)
(s454 1.0)
(s455 0.0)
(s456 1.0)
(s457 1.0)
(s458 1.0)
(s459 1.0)
(s460 1.0)
(s461 1.0)
(s462 1.0)
(s463 1.0)
(s464 0.0)
(s465 0.0)
(s466 1.0)
(s467 1.0)
(s468 1.0)
(s469 1.0)
(s470 0.0)
(s471 1.0)
(s472 1.0)
(s473 1.0)
(s474 0.0)
(s475 1.0)
(s476 1.0)
(s477 1.0)
(s478 1.0)
(s479 1.0)
(s480 1.0)
(s481 1.0)
(s482 1.0)
(s483 1.0)
(s484 1.0)
(s485 1.0)
(s486 1.0)
(s487 0.0)
(s488 1.0)
(s489 1.0)
(s490 1.0)
(s491 0.0)
(s492 1.0)
(s493 1.0)
(s494 1.0)
(s495 1.0)
(s496 1.0)
(s497 1.0)
(s498 1.0)
(s499 1.0)
(s500 1.0)
(s501 1.0)
(s502 1.0)
(s503 1.0)
(s504 1.0)
(s505 1.0)
(s506 1.0)
(s507 0.0)
(s508 1.0)
(s509 1.0)
(s510 1.0)
(s511 1.0)
(s512 1.0)
(s513 1.0)
(s514 1.0)
(s515 1.0)
(s516 1.0)
(s517 1.0)
(s518 1.0)
(s519 1.0)
(s520 1.0)
(s521 1.0)
(s522 1.0)
(s523 1.0)
(s524 1.0)
(s525 1.0)
(s526 1.0)
(s527 1.0)
(s528 1.0)
(s529 1.0)
(s530 1.0)
(s531 1.0)
(s532 1.0)
(s533 1.0)
(s534 1.0)
(s535 1.0)
(s536 1.0)
(s537 1.0)
(s538 1.0)
(s539 1.0)
(s540 1.0)
(s541 0.0)
(s542 0.0)
(s543 0.0)
(s544 0.0)
(s545 0.0)
(s546 0.0)
(s547 0.0)
(s548 0.0)
(s549 0.0)
(s550 0.0)
(s551 0.0)
(s552 0.0)
(s553 0.0)
(s554 0.0)
(s555 0.0)
(s556 0.0)
(s557 0.0)
(s558 0.0)
(s559 0.0)
(s560 0.0)
(s561 0.0)
(s562 0.0)
(s563 1.0)
(s564 1.0)
(s565 0.0)
(s566 0.0)
(s567 0.0)
(s568 0.0)
(s569 0.0)
(s570 0.0)
(s571 0.0)
(s572 0.0)
(s573 0.0)
(s574 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 605/1663 variables, and 2 constraints, problems are : Problem set: 0 solved, 1584 unsolved in 30049 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/605 constraints, ReadFeed: 0/262 constraints, PredecessorRefiner: 1584/1584 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1584 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/605 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1584 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/605 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1584 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1)
(s1 1)
(s2 1)
(s3 1)
(s4 3)
(s5 1)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 1)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 1)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 1)
(s135 1)
(s136 1)
(s137 1)
(s138 1)
(s139 1)
(s140 1)
(s141 1)
(s142 1)
(s143 1)
(s144 1)
(s145 1)
(s146 1)
(s147 1)
(s148 1)
(s149 1)
(s150 1)
(s151 1)
(s152 1)
(s153 1)
(s154 1)
(s155 1)
(s156 1)
(s157 1)
(s158 1)
(s159 1)
(s160 0)
(s161 1)
(s162 1)
(s163 1)
(s164 1)
(s165 1)
(s166 1)
(s167 1)
(s168 1)
(s169 1)
(s170 1)
(s171 1)
(s172 1)
(s173 1)
(s174 1)
(s175 1)
(s176 1)
(s177 1)
(s178 1)
(s179 1)
(s180 1)
(s181 1)
(s182 1)
(s183 1)
(s184 1)
(s185 1)
(s186 0)
(s187 1)
(s188 1)
(s189 0)
(s190 1)
(s191 1)
(s192 1)
(s193 1)
(s194 1)
(s195 0)
(s196 1)
(s197 1)
(s198 1)
(s199 1)
(s200 1)
(s201 1)
(s202 1)
(s203 1)
(s204 1)
(s205 1)
(s206 1)
(s207 1)
(s208 1)
(s209 1)
(s210 1)
(s211 1)
(s212 1)
(s213 1)
(s214 1)
(s215 1)
(s216 1)
(s217 1)
(s218 1)
(s219 1)
(s220 1)
(s221 1)
(s222 1)
(s223 1)
(s224 1)
(s225 1)
(s226 1)
(s227 1)
(s228 1)
(s229 1)
(s230 1)
(s231 1)
(s232 1)
(s233 1)
(s234 1)
(s235 1)
(s236 1)
(s237 1)
(s238 1)
(s239 1)
(s240 1)
(s241 1)
(s242 1)
(s243 1)
(s244 1)
(s245 1)
(s246 1)
(s247 1)
(s248 1)
(s249 1)
(s250 1)
(s251 1)
(s252 1)
(s253 1)
(s254 1)
(s255 1)
(s256 1)
(s257 1)
(s258 1)
(s259 1)
(s260 1)
(s261 1)
(s262 1)
(s263 1)
(s264 1)
(s265 1)
(s266 1)
(s267 1)
(s268 1)
(s269 1)
(s270 1)
(s271 1)
(s272 1)
(s273 1)
(s274 1)
(s275 1)
(s276 1)
(s277 1)
(s278 1)
(s279 1)
(s280 1)
(s281 1)
(s282 1)
(s283 1)
(s284 1)
(s285 1)
(s286 1)
(s287 1)
(s288 1)
(s289 1)
(s290 1)
(s291 1)
(s292 1)
(s293 1)
(s294 1)
(s295 1)
(s296 1)
(s297 1)
(s298 1)
(s299 1)
(s300 1)
(s301 1)
(s302 1)
(s303 1)
(s304 1)
(s305 1)
(s306 1)
(s307 1)
(s308 1)
(s309 1)
(s310 1)
(s311 1)
(s312 1)
(s313 1)
(s314 1)
(s315 1)
(s316 1)
(s317 1)
(s318 1)
(s319 1)
(s320 1)
(s321 1)
(s322 1)
(s323 1)
(s324 1)
(s325 1)
(s326 1)
(s327 1)
(s328 1)
(s329 1)
(s330 1)
(s331 1)
(s332 1)
(s333 1)
(s334 1)
(s335 1)
(s336 1)
(s337 1)
(s338 1)
(s339 1)
(s340 1)
(s341 1)
(s342 1)
(s343 1)
(s344 1)
(s345 1)
(s346 1)
(s347 1)
(s348 1)
(s349 1)
(s350 1)
(s351 1)
(s352 1)
(s353 1)
(s354 1)
(s355 1)
(s356 1)
(s357 1)
(s358 1)
(s359 1)
(s360 1)
(s361 1)
(s362 1)
(s363 1)
(s364 1)
(s365 1)
(s366 1)
(s367 1)
(s368 1)
(s369 1)
(s370 1)
(s371 1)
(s372 1)
(s373 1)
(s374 1)
(s375 1)
(s376 1)
(s377 1)
(s378 1)
(s379 1)
(s380 1)
(s381 1)
(s382 1)
(s383 1)
(s384 1)
(s385 1)
(s386 1)
(s387 1)
(s388 1)
(s389 1)
(s390 1)
(s391 0)
(s392 0)
(s393 0)
(s394 0)
(s395 0)
(s396 0)
(s397 0)
(s398 0)
(s399 0)
(s400 0)
(s401 1)
(s402 0)
(s403 0)
(s404 0)
(s405 0)
(s406 0)
(s407 1)
(s408 0)
(s409 0)
(s410 0)
(s411 0)
(s412 0)
(s413 0)
(s414 0)
(s415 0)
(s416 1)
(s417 0)
(s418 0)
(s419 0)
(s420 0)
(s421 0)
(s422 0)
(s423 0)
(s424 0)
(s425 0)
(s426 0)
(s427 0)
(s428 0)
(s429 0)
(s430 0)
(s431 1)
(s432 0)
(s433 0)
(s434 0)
(s435 1)
(s436 0)
(s437 0)
(s438 1)
(s439 0)
(s440 0)
(s441 0)
(s442 0)
(s443 0)
(s444 0)
(s445 1)
(s446 0)
(s447 0)
(s448 0)
(s449 1)
(s450 1)
(s451 0)
(s452 1)
(s453 0)
(s454 1)
(s455 1)
(s456 0)
(s457 1)
(s458 1)
(s459 1)
(s460 1)
(s461 1)
(s462 1)
(s463 0)
(s464 1)
(s465 1)
(s466 0)
(s467 1)
(s468 1)
(s469 1)
(s470 0)
(s471 1)
(s472 0)
(s473 0)
(s474 1)
(s475 1)
(s476 1)
(s477 1)
(s478 0)
(s479 1)
(s480 1)
(s481 1)
(s482 1)
(s483 1)
(s484 1)
(s485 1)
(s486 1)
(s487 1)
(s488 1)
(s489 1)
(s490 0)
(s491 1)
(s492 0)
(s493 1)
(s494 1)
(s495 1)
(s496 0)
(s497 0)
(s498 1)
(s499 1)
(s500 1)
(s501 1)
(s502 1)
(s503 1)
(s504 0)
(s505 1)
(s506 1)
(s507 1)
(s508 1)
(s509 0)
(s510 1)
(s511 1)
(s512 1)
(s513 1)
(s514 1)
(s515 1)
(s516 1)
(s517 1)
(s518 1)
(s519 1)
(s520 1)
(s521 1)
(s522 1)
(s523 1)
(s524 1)
(s525 1)
(s526 1)
(s527 1)
(s528 1)
(s529 1)
(s530 1)
(s531 1)
(s532 1)
(s533 1)
(s534 1)
(s535 1)
(s536 1)
(s537 1)
(s538 1)
(s539 1)
(s540timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 605/1663 variables, and 2 constraints, problems are : Problem set: 0 solved, 1584 unsolved in 30048 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/605 constraints, ReadFeed: 0/262 constraints, PredecessorRefiner: 0/1584 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 64101ms problems are : Problem set: 0 solved, 1584 unsolved
Search for dead transitions found 0 dead transitions in 64107ms
Starting structural reductions in LTL mode, iteration 1 : 605/697 places, 1586/1812 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 77406 ms. Remains : 605/697 places, 1586/1812 transitions.
Stuttering acceptance computed with spot in 115 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-c128-LTLFireability-14
Stuttering criterion allowed to conclude after 47 steps with 0 reset in 1 ms.
FORMULA FunctionPointer-PT-c128-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-c128-LTLFireability-14 finished in 77547 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 3 out of 697 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 697/697 places, 1812/1812 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 688 transition count 1792
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 688 transition count 1792
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 20 place count 688 transition count 1790
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 29 place count 679 transition count 1770
Iterating global reduction 1 with 9 rules applied. Total rules applied 38 place count 679 transition count 1770
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 47 place count 670 transition count 1738
Iterating global reduction 1 with 9 rules applied. Total rules applied 56 place count 670 transition count 1738
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 65 place count 661 transition count 1706
Iterating global reduction 1 with 9 rules applied. Total rules applied 74 place count 661 transition count 1706
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 83 place count 652 transition count 1688
Iterating global reduction 1 with 9 rules applied. Total rules applied 92 place count 652 transition count 1688
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 101 place count 643 transition count 1668
Iterating global reduction 1 with 9 rules applied. Total rules applied 110 place count 643 transition count 1668
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 119 place count 634 transition count 1648
Iterating global reduction 1 with 9 rules applied. Total rules applied 128 place count 634 transition count 1648
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 136 place count 626 transition count 1632
Iterating global reduction 1 with 8 rules applied. Total rules applied 144 place count 626 transition count 1632
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 152 place count 618 transition count 1616
Iterating global reduction 1 with 8 rules applied. Total rules applied 160 place count 618 transition count 1616
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 161 place count 617 transition count 1614
Iterating global reduction 1 with 1 rules applied. Total rules applied 162 place count 617 transition count 1614
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 163 place count 616 transition count 1612
Iterating global reduction 1 with 1 rules applied. Total rules applied 164 place count 616 transition count 1612
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 165 place count 615 transition count 1610
Iterating global reduction 1 with 1 rules applied. Total rules applied 166 place count 615 transition count 1610
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 170 place count 615 transition count 1606
Applied a total of 170 rules in 765 ms. Remains 615 /697 variables (removed 82) and now considering 1606/1812 (removed 206) transitions.
[2025-06-02 19:25:52] [INFO ] Flow matrix only has 1074 transitions (discarded 532 similar events)
// Phase 1: matrix 1074 rows 615 cols
[2025-06-02 19:25:52] [INFO ] Computed 2 invariants in 15 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 19:25:53] [INFO ] Implicit Places using invariants in 1148 ms returned []
[2025-06-02 19:25:53] [INFO ] Flow matrix only has 1074 transitions (discarded 532 similar events)
[2025-06-02 19:25:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 19:25:54] [INFO ] State equation strengthened by 267 read => feed constraints.
[2025-06-02 19:25:59] [INFO ] Implicit Places using invariants and state equation in 6029 ms returned []
Implicit Place search using SMT with State Equation took 7179 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 19:25:59] [INFO ] Redundant transitions in 88 ms returned []
Running 1604 sub problems to find dead transitions.
[2025-06-02 19:25:59] [INFO ] Flow matrix only has 1074 transitions (discarded 532 similar events)
[2025-06-02 19:25:59] [INFO ] Invariant cache hit.
[2025-06-02 19:25:59] [INFO ] State equation strengthened by 267 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/615 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1604 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/615 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1604 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 615/1689 variables, and 2 constraints, problems are : Problem set: 0 solved, 1604 unsolved in 30050 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/615 constraints, ReadFeed: 0/267 constraints, PredecessorRefiner: 1604/1604 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1604 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/615 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1604 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/615 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1604 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 615/1689 variables, and 2 constraints, problems are : Problem set: 0 solved, 1604 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/615 constraints, ReadFeed: 0/267 constraints, PredecessorRefiner: 0/1604 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 64398ms problems are : Problem set: 0 solved, 1604 unsolved
Search for dead transitions found 0 dead transitions in 64402ms
Starting structural reductions in SI_LTL mode, iteration 1 : 615/697 places, 1606/1812 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 72447 ms. Remains : 615/697 places, 1606/1812 transitions.
Stuttering acceptance computed with spot in 105 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : FunctionPointer-PT-c128-LTLFireability-15
Stuttering criterion allowed to conclude after 248 steps with 0 reset in 2 ms.
FORMULA FunctionPointer-PT-c128-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-c128-LTLFireability-15 finished in 72582 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||(p1&&X(G(p2)))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(X(X(X(F((X(p2)||p1))))))||p0)))'
Found a Shortening insensitive property : FunctionPointer-PT-c128-LTLFireability-10
Stuttering acceptance computed with spot in 205 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Support contains 4 out of 697 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 697/697 places, 1812/1812 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 687 transition count 1790
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 687 transition count 1790
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 22 place count 687 transition count 1788
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 31 place count 678 transition count 1768
Iterating global reduction 1 with 9 rules applied. Total rules applied 40 place count 678 transition count 1768
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 49 place count 669 transition count 1736
Iterating global reduction 1 with 9 rules applied. Total rules applied 58 place count 669 transition count 1736
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 67 place count 660 transition count 1704
Iterating global reduction 1 with 9 rules applied. Total rules applied 76 place count 660 transition count 1704
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 85 place count 651 transition count 1686
Iterating global reduction 1 with 9 rules applied. Total rules applied 94 place count 651 transition count 1686
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 103 place count 642 transition count 1666
Iterating global reduction 1 with 9 rules applied. Total rules applied 112 place count 642 transition count 1666
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 121 place count 633 transition count 1646
Iterating global reduction 1 with 9 rules applied. Total rules applied 130 place count 633 transition count 1646
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 138 place count 625 transition count 1630
Iterating global reduction 1 with 8 rules applied. Total rules applied 146 place count 625 transition count 1630
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 154 place count 617 transition count 1614
Iterating global reduction 1 with 8 rules applied. Total rules applied 162 place count 617 transition count 1614
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 163 place count 616 transition count 1612
Iterating global reduction 1 with 1 rules applied. Total rules applied 164 place count 616 transition count 1612
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 165 place count 615 transition count 1610
Iterating global reduction 1 with 1 rules applied. Total rules applied 166 place count 615 transition count 1610
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 167 place count 614 transition count 1608
Iterating global reduction 1 with 1 rules applied. Total rules applied 168 place count 614 transition count 1608
Applied a total of 168 rules in 260 ms. Remains 614 /697 variables (removed 83) and now considering 1608/1812 (removed 204) transitions.
[2025-06-02 19:27:05] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
// Phase 1: matrix 1073 rows 614 cols
[2025-06-02 19:27:05] [INFO ] Computed 2 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 19:27:05] [INFO ] Implicit Places using invariants in 676 ms returned []
[2025-06-02 19:27:05] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2025-06-02 19:27:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 19:27:06] [INFO ] State equation strengthened by 265 read => feed constraints.
[2025-06-02 19:27:24] [INFO ] Implicit Places using invariants and state equation in 18923 ms returned []
Implicit Place search using SMT with State Equation took 19601 ms to find 0 implicit places.
Running 1606 sub problems to find dead transitions.
[2025-06-02 19:27:24] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2025-06-02 19:27:24] [INFO ] Invariant cache hit.
[2025-06-02 19:27:24] [INFO ] State equation strengthened by 265 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/614 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/614 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 614/1687 variables, and 2 constraints, problems are : Problem set: 0 solved, 1606 unsolved in 30042 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/614 constraints, ReadFeed: 0/265 constraints, PredecessorRefiner: 1606/1606 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1606 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/614 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/614 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1606 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 Int declared 614/1687 variables, and 2 constraints, problems are : Problem set: 0 solved, 1606 unsolved in 30046 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/614 constraints, ReadFeed: 0/265 constraints, PredecessorRefiner: 0/1606 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 64241ms problems are : Problem set: 0 solved, 1606 unsolved
Search for dead transitions found 0 dead transitions in 64246ms
Starting structural reductions in LI_LTL mode, iteration 1 : 614/697 places, 1608/1812 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 84113 ms. Remains : 614/697 places, 1608/1812 transitions.
Running random walk in product with property : FunctionPointer-PT-c128-LTLFireability-10
Product exploration explored 100000 steps with 797 reset in 1298 ms.
Product exploration explored 100000 steps with 694 reset in 859 ms.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Knowledge obtained : [(AND p0 p1 p2)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 155 ms. Reduced automaton from 6 states, 7 edges and 3 AP (stutter sensitive) to 6 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 301 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Reduction of identical properties reduced properties to check from 4 to 2
RANDOM walk for 40058 steps (8 resets) in 227 ms. (175 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 44 ms. (888 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 44 ms. (888 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 187593 steps, run timeout after 3001 ms. (steps per millisecond=62 ) properties seen :0 out of 2
Probabilistic random walk after 187593 steps, saw 121780 distinct states, run finished after 3001 ms. (steps per millisecond=62 ) properties seen :0
[2025-06-02 19:28:34] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2025-06-02 19:28:34] [INFO ] Invariant cache hit.
[2025-06-02 19:28:34] [INFO ] State equation strengthened by 265 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 536/540 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/540 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/540 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 940/1480 variables, 472/477 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1480 variables, 1/478 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/1480 variables, 264/742 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1480 variables, 0/742 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 62/1542 variables, 1/743 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1542 variables, 0/743 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 139/1681 variables, 134/877 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1681 variables, 0/877 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 5/1686 variables, 3/880 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1686 variables, 0/880 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 1/1687 variables, 1/881 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1687 variables, 0/881 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 0/1687 variables, 0/881 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1687/1687 variables, and 881 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1618 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 614/614 constraints, ReadFeed: 265/265 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 536/540 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/540 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/540 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 940/1480 variables, 472/477 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1480 variables, 1/478 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1480 variables, 264/742 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1480 variables, 2/744 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:28:37] [INFO ] Deduced a trap along path composed of 3 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:28:37] [INFO ] Deduced a trap along path composed of 3 places in 25 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1480 variables, 2/746 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1480 variables, 0/746 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 62/1542 variables, 1/747 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:28:38] [INFO ] Deduced a trap composed of 131 places in 204 ms of which 7 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/1542 variables, 1/748 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:28:39] [INFO ] Deduced a trap along path composed of 3 places in 24 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:28:39] [INFO ] Deduced a trap along path composed of 3 places in 21 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:28:39] [INFO ] Deduced a trap along path composed of 3 places in 20 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:28:39] [INFO ] Deduced a trap along path composed of 3 places in 21 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:28:39] [INFO ] Deduced a trap along path composed of 3 places in 19 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/1542 variables, 5/753 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1542 variables, 0/753 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 139/1681 variables, 134/887 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1681 variables, 0/887 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 5/1686 variables, 3/890 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1686 variables, 0/890 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 1/1687 variables, 1/891 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1687 variables, 0/891 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 0/1687 variables, 0/891 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1687/1687 variables, and 891 constraints, problems are : Problem set: 0 solved, 2 unsolved in 4497 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 614/614 constraints, ReadFeed: 265/265 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 7/7 constraints]
After SMT, in 6142ms problems are : Problem set: 0 solved, 2 unsolved
Finished Parikh walk after 94026 steps, including 234 resets, run visited all 1 properties in 1147 ms. (steps per millisecond=81 )
Parikh walk visited 2 properties in 3444 ms.
Knowledge obtained : [(AND p0 p1 p2)]
False Knowledge obtained : [(F (NOT (OR p1 p2))), (F (NOT p2)), (F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 1 factoid took 234 ms. Reduced automaton from 6 states, 7 edges and 3 AP (stutter sensitive) to 6 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 267 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 307 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Support contains 4 out of 614 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 614/614 places, 1608/1608 transitions.
Applied a total of 0 rules in 25 ms. Remains 614 /614 variables (removed 0) and now considering 1608/1608 (removed 0) transitions.
[2025-06-02 19:28:45] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2025-06-02 19:28:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 19:28:46] [INFO ] Implicit Places using invariants in 911 ms returned []
[2025-06-02 19:28:46] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2025-06-02 19:28:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 19:28:46] [INFO ] State equation strengthened by 265 read => feed constraints.
[2025-06-02 19:29:06] [INFO ] Implicit Places using invariants and state equation in 20683 ms returned []
Implicit Place search using SMT with State Equation took 21600 ms to find 0 implicit places.
Running 1606 sub problems to find dead transitions.
[2025-06-02 19:29:06] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2025-06-02 19:29:06] [INFO ] Invariant cache hit.
[2025-06-02 19:29:06] [INFO ] State equation strengthened by 265 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/614 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/614 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 614/1687 variables, and 2 constraints, problems are : Problem set: 0 solved, 1606 unsolved in 30045 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/614 constraints, ReadFeed: 0/265 constraints, PredecessorRefiner: 1606/1606 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1606 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/614 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/614 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 614/1687 variables, and 2 constraints, problems are : Problem set: 0 solved, 1606 unsolved in 30047 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/614 constraints, ReadFeed: 0/265 constraints, PredecessorRefiner: 0/1606 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 64826ms problems are : Problem set: 0 solved, 1606 unsolved
Search for dead transitions found 0 dead transitions in 64831ms
Finished structural reductions in LTL mode , in 1 iterations and 86463 ms. Remains : 614/614 places, 1608/1608 transitions.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Knowledge obtained : [(AND p0 p1 p2)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 127 ms. Reduced automaton from 6 states, 7 edges and 3 AP (stutter sensitive) to 6 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 217 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Reduction of identical properties reduced properties to check from 4 to 2
RANDOM walk for 40062 steps (8 resets) in 172 ms. (231 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 38 ms. (1025 steps per ms) remains 1/1 properties
[2025-06-02 19:30:12] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2025-06-02 19:30:12] [INFO ] Invariant cache hit.
[2025-06-02 19:30:12] [INFO ] State equation strengthened by 265 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 334/336 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/336 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1141/1477 variables, 471/473 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1477 variables, 265/738 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1477 variables, 0/738 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 62/1539 variables, 1/739 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1539 variables, 0/739 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/1540 variables, 1/740 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1540 variables, 1/741 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1540 variables, 0/741 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 141/1681 variables, 136/877 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/1681 variables, 0/877 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 5/1686 variables, 3/880 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1686 variables, 0/880 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1/1687 variables, 1/881 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1687 variables, 0/881 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/1687 variables, 0/881 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1687/1687 variables, and 881 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1078 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 614/614 constraints, ReadFeed: 265/265 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 334/336 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/336 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1141/1477 variables, 471/473 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1477 variables, 265/738 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1477 variables, 1/739 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1477 variables, 0/739 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 62/1539 variables, 1/740 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1539/1687 variables, and 740 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1385 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 0/1 constraints, State Equation: 473/614 constraints, ReadFeed: 265/265 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2484ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 261 ms.
Support contains 2 out of 614 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 614/614 places, 1608/1608 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 614 transition count 1604
Applied a total of 4 rules in 303 ms. Remains 614 /614 variables (removed 0) and now considering 1604/1608 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 303 ms. Remains : 614/614 places, 1604/1608 transitions.
RANDOM walk for 40058 steps (8 resets) in 214 ms. (186 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 49 ms. (800 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 280116 steps, run timeout after 3001 ms. (steps per millisecond=93 ) properties seen :0 out of 1
Probabilistic random walk after 280116 steps, saw 181827 distinct states, run finished after 3001 ms. (steps per millisecond=93 ) properties seen :0
[2025-06-02 19:30:18] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
// Phase 1: matrix 1071 rows 614 cols
[2025-06-02 19:30:18] [INFO ] Computed 2 invariants in 6 ms
[2025-06-02 19:30:18] [INFO ] State equation strengthened by 265 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 334/336 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/336 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1139/1475 variables, 471/473 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1475 variables, 265/738 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1475 variables, 0/738 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 62/1537 variables, 1/739 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1537 variables, 0/739 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/1538 variables, 1/740 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1538 variables, 1/741 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1538 variables, 0/741 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 139/1677 variables, 135/876 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/1677 variables, 0/876 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 5/1682 variables, 3/879 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1682 variables, 0/879 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 3/1685 variables, 2/881 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1685 variables, 0/881 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/1685 variables, 0/881 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1685/1685 variables, and 881 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1136 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 614/614 constraints, ReadFeed: 265/265 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 334/336 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/336 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1139/1475 variables, 471/473 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1475 variables, 265/738 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1475 variables, 1/739 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1475 variables, 0/739 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 62/1537 variables, 1/740 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1537 variables, 0/740 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/1538 variables, 1/741 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1538 variables, 1/742 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:30:21] [INFO ] Deduced a trap along path composed of 3 places in 30 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:30:22] [INFO ] Deduced a trap along path composed of 3 places in 24 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/1538 variables, 2/744 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1538 variables, 0/744 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 139/1677 variables, 135/879 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:30:23] [INFO ] Deduced a trap along path composed of 3 places in 28 ms of which 0 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/1677 variables, 1/880 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1677 variables, 0/880 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 5/1682 variables, 3/883 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1682 variables, 0/883 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 3/1685 variables, 2/885 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1685 variables, 0/885 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/1685 variables, 0/885 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1685/1685 variables, and 885 constraints, problems are : Problem set: 0 solved, 1 unsolved in 5613 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 614/614 constraints, ReadFeed: 265/265 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 6769ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 900 ms.
Support contains 2 out of 614 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 614/614 places, 1604/1604 transitions.
Applied a total of 0 rules in 88 ms. Remains 614 /614 variables (removed 0) and now considering 1604/1604 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 88 ms. Remains : 614/614 places, 1604/1604 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 614/614 places, 1604/1604 transitions.
Applied a total of 0 rules in 90 ms. Remains 614 /614 variables (removed 0) and now considering 1604/1604 (removed 0) transitions.
[2025-06-02 19:30:26] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2025-06-02 19:30:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 19:30:27] [INFO ] Implicit Places using invariants in 1024 ms returned []
[2025-06-02 19:30:27] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2025-06-02 19:30:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 19:30:27] [INFO ] State equation strengthened by 265 read => feed constraints.
[2025-06-02 19:30:46] [INFO ] Implicit Places using invariants and state equation in 19338 ms returned []
Implicit Place search using SMT with State Equation took 20365 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 19:30:46] [INFO ] Redundant transitions in 51 ms returned []
Running 1602 sub problems to find dead transitions.
[2025-06-02 19:30:46] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2025-06-02 19:30:46] [INFO ] Invariant cache hit.
[2025-06-02 19:30:46] [INFO ] State equation strengthened by 265 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/614 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
SMT process timed out in 34359ms, After SMT, problems are : Problem set: 0 solved, 1602 unsolved
Search for dead transitions found 0 dead transitions in 34362ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54878 ms. Remains : 614/614 places, 1604/1604 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 944 edges and 614 vertex of which 192 / 614 are part of one of the 64 SCC in 5 ms
Free SCC test removed 128 places
Drop transitions (Empty/Sink Transition effects.) removed 320 transitions
Ensure Unique test removed 405 transitions
Reduce isomorphic transitions removed 725 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 11 place count 486 transition count 869
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 21 place count 476 transition count 869
Performed 73 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 73 Pre rules applied. Total rules applied 21 place count 476 transition count 796
Deduced a syphon composed of 73 places in 0 ms
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 2 with 146 rules applied. Total rules applied 167 place count 403 transition count 796
Discarding 63 places :
Symmetric choice reduction at 2 with 63 rule applications. Total rules 230 place count 340 transition count 733
Iterating global reduction 2 with 63 rules applied. Total rules applied 293 place count 340 transition count 733
Ensure Unique test removed 126 transitions
Reduce isomorphic transitions removed 126 transitions.
Iterating post reduction 2 with 126 rules applied. Total rules applied 419 place count 340 transition count 607
Performed 127 Post agglomeration using F-continuation condition.Transition count delta: 127
Deduced a syphon composed of 127 places in 0 ms
Reduce places removed 127 places and 0 transitions.
Iterating global reduction 3 with 254 rules applied. Total rules applied 673 place count 213 transition count 480
Discarding 64 places :
Symmetric choice reduction at 3 with 64 rule applications. Total rules 737 place count 149 transition count 352
Iterating global reduction 3 with 64 rules applied. Total rules applied 801 place count 149 transition count 352
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 802 place count 149 transition count 351
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 865 place count 86 transition count 225
Iterating global reduction 4 with 63 rules applied. Total rules applied 928 place count 86 transition count 225
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 991 place count 23 transition count 99
Iterating global reduction 4 with 63 rules applied. Total rules applied 1054 place count 23 transition count 99
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 4 with 63 rules applied. Total rules applied 1117 place count 23 transition count 36
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 1117 place count 23 transition count 35
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1119 place count 22 transition count 35
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1121 place count 21 transition count 34
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1123 place count 20 transition count 34
Applied a total of 1123 rules in 143 ms. Remains 20 /614 variables (removed 594) and now considering 34/1604 (removed 1570) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 34 rows 20 cols
[2025-06-02 19:31:21] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-02 19:31:21] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-02 19:31:21] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-02 19:31:21] [INFO ] After 23ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2025-06-02 19:31:21] [INFO ] State equation strengthened by 2 read => feed constraints.
[2025-06-02 19:31:21] [INFO ] After 6ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2025-06-02 19:31:21] [INFO ] After 84ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-02 19:31:21] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-02 19:31:21] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-02 19:31:21] [INFO ] After 27ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2025-06-02 19:31:21] [INFO ] After 7ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-06-02 19:31:21] [INFO ] After 16ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-06-02 19:31:21] [INFO ] After 94ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 333 ms.
Knowledge obtained : [(AND p0 p1 p2)]
False Knowledge obtained : [(F (NOT (OR p1 p2))), (F (NOT p2)), (F (NOT p1))]
Knowledge based reduction with 1 factoid took 264 ms. Reduced automaton from 6 states, 7 edges and 3 AP (stutter sensitive) to 6 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 298 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 291 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 302 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 773 reset in 1190 ms.
Product exploration explored 100000 steps with 738 reset in 874 ms.
Applying partial POR strategy [false, false, false, false, false, true]
Stuttering acceptance computed with spot in 277 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Support contains 4 out of 614 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 614/614 places, 1608/1608 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 614 transition count 1604
Applied a total of 4 rules in 362 ms. Remains 614 /614 variables (removed 0) and now considering 1604/1608 (removed 4) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 19:31:25] [INFO ] Redundant transitions in 88 ms returned []
Running 1602 sub problems to find dead transitions.
[2025-06-02 19:31:25] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
// Phase 1: matrix 1071 rows 614 cols
[2025-06-02 19:31:25] [INFO ] Computed 2 invariants in 10 ms
[2025-06-02 19:31:25] [INFO ] State equation strengthened by 265 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/614 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/614 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 614/1685 variables, and 2 constraints, problems are : Problem set: 0 solved, 1602 unsolved in 30042 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/614 constraints, ReadFeed: 0/265 constraints, PredecessorRefiner: 1602/1602 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1602 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/614 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/614 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 614/1685 variables, and 2 constraints, problems are : Problem set: 0 solved, 1602 unsolved in 30051 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/614 constraints, ReadFeed: 0/265 constraints, PredecessorRefiner: 0/1602 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 64992ms problems are : Problem set: 0 solved, 1602 unsolved
Search for dead transitions found 0 dead transitions in 64997ms
Starting structural reductions in SI_LTL mode, iteration 1 : 614/614 places, 1604/1608 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 65463 ms. Remains : 614/614 places, 1604/1608 transitions.
Built C files in :
/tmp/ltsmin15722891964784226135
[2025-06-02 19:32:30] [INFO ] Built C files in 34ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15722891964784226135
Running compilation step : cd /tmp/ltsmin15722891964784226135;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15722891964784226135;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15722891964784226135;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
Support contains 4 out of 614 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 614/614 places, 1608/1608 transitions.
Applied a total of 0 rules in 33 ms. Remains 614 /614 variables (removed 0) and now considering 1608/1608 (removed 0) transitions.
[2025-06-02 19:32:33] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
// Phase 1: matrix 1073 rows 614 cols
[2025-06-02 19:32:33] [INFO ] Computed 2 invariants in 7 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 19:32:34] [INFO ] Implicit Places using invariants in 950 ms returned []
[2025-06-02 19:32:34] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2025-06-02 19:32:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 19:32:35] [INFO ] State equation strengthened by 265 read => feed constraints.
[2025-06-02 19:32:54] [INFO ] Implicit Places using invariants and state equation in 20294 ms returned []
Implicit Place search using SMT with State Equation took 21248 ms to find 0 implicit places.
Running 1606 sub problems to find dead transitions.
[2025-06-02 19:32:54] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2025-06-02 19:32:54] [INFO ] Invariant cache hit.
[2025-06-02 19:32:54] [INFO ] State equation strengthened by 265 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/614 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/614 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 5.0)
(s6 0.0)
(s7 1.0)
(s8 0.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 0.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 1.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 1.0)
(s136 1.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 0.0)
(s144 1.0)
(s145 0.0)
(s146 0.0)
(s147 1.0)
(s148 0.0)
(s149 1.0)
(s150 1.0)
(s151 0.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 0.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 0.0)
(s160 1.0)
(s161 1.0)
(s162 0.0)
(s163 1.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 0.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 0.0)
(s177 1.0)
(s178 1.0)
(s179 0.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 0.0)
(s184 0.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 0.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 0.0)
(s196 0.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 1.0)
(s329 1.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 614/1687 variables, and 2 constraints, problems are : Problem set: 0 solved, 1606 unsolved in 30049 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/614 constraints, ReadFeed: 0/265 constraints, PredecessorRefiner: 1606/1606 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1606 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/614 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/614 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 614/1687 variables, and 2 constraints, problems are : Problem set: 0 solved, 1606 unsolved in 30045 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/614 constraints, ReadFeed: 0/265 constraints, PredecessorRefiner: 0/1606 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 64031ms problems are : Problem set: 0 solved, 1606 unsolved
Search for dead transitions found 0 dead transitions in 64034ms
Finished structural reductions in LTL mode , in 1 iterations and 85319 ms. Remains : 614/614 places, 1608/1608 transitions.
Built C files in :
/tmp/ltsmin6030942702874047522
[2025-06-02 19:33:58] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6030942702874047522
Running compilation step : cd /tmp/ltsmin6030942702874047522;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6030942702874047522;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6030942702874047522;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
[2025-06-02 19:34:01] [INFO ] Flatten gal took : 41 ms
[2025-06-02 19:34:01] [INFO ] Flatten gal took : 40 ms
[2025-06-02 19:34:01] [INFO ] Time to serialize gal into /tmp/LTL1177110245179416880.gal : 8 ms
[2025-06-02 19:34:01] [INFO ] Time to serialize properties into /tmp/LTL16717988022038132231.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1177110245179416880.gal' '-t' 'CGAL' '-hoa' '/tmp/aut9951116871730585114.hoa' '-atoms' '/tmp/LTL16717988022038132231.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL16717988022038132231.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut9951116871730585114.hoa
Detected timeout of ITS tools.
[2025-06-02 19:34:17] [INFO ] Flatten gal took : 64 ms
[2025-06-02 19:34:17] [INFO ] Flatten gal took : 64 ms
[2025-06-02 19:34:17] [INFO ] Time to serialize gal into /tmp/LTL12669876059938761005.gal : 10 ms
[2025-06-02 19:34:17] [INFO ] Time to serialize properties into /tmp/LTL1269432088693277922.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12669876059938761005.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1269432088693277922.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(("((s0<1)||(l2062<1))")||(X(X(X(X(F(("((s1<1)||(l653<1))")||(X("((s1<1)||(l653<1))")))))))))))
Formula 0 simplified : F(!"((s0<1)||(l2062<1))" & XXXXG(!"((s1<1)||(l653<1))" & X!"((s1<1)||(l653<1))"))
Detected timeout of ITS tools.
[2025-06-02 19:34:32] [INFO ] Flatten gal took : 37 ms
[2025-06-02 19:34:32] [INFO ] Applying decomposition
[2025-06-02 19:34:32] [INFO ] Flatten gal took : 38 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph9184661926770245647.txt' '-o' '/tmp/graph9184661926770245647.bin' '-w' '/tmp/graph9184661926770245647.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph9184661926770245647.bin' '-l' '-1' '-v' '-w' '/tmp/graph9184661926770245647.weights' '-q' '0' '-e' '0.001'
[2025-06-02 19:34:32] [INFO ] Decomposing Gal with order
[2025-06-02 19:34:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 19:34:32] [INFO ] Removed a total of 2669 redundant transitions.
[2025-06-02 19:34:32] [INFO ] Flatten gal took : 90 ms
[2025-06-02 19:34:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 1215 labels/synchronizations in 45 ms.
[2025-06-02 19:34:32] [INFO ] Time to serialize gal into /tmp/LTL9940900557165140926.gal : 12 ms
[2025-06-02 19:34:32] [INFO ] Time to serialize properties into /tmp/LTL18130439029102239179.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9940900557165140926.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL18130439029102239179.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((G(("((i1.u1.s0<1)||(i28.i2.u144.l2062<1))")||(X(X(X(X(F(("((i0.i0.u0.s1<1)||(i11.i1.u80.l653<1))")||(X("((i0.i0.u0.s1<1)||(i11.i1.u...178
Formula 0 simplified : F(!"((i1.u1.s0<1)||(i28.i2.u144.l2062<1))" & XXXXG(!"((i0.i0.u0.s1<1)||(i11.i1.u80.l653<1))" & X!"((i0.i0.u0.s1<1)||(i11.i1.u80.l653...162
Detected timeout of ITS tools.
Treatment of property FunctionPointer-PT-c128-LTLFireability-10 finished in 463134 ms.
[2025-06-02 19:34:47] [INFO ] Flatten gal took : 46 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin9699733559007871719
[2025-06-02 19:34:47] [INFO ] Too many transitions (1812) to apply POR reductions. Disabling POR matrices.
[2025-06-02 19:34:47] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9699733559007871719
Running compilation step : cd /tmp/ltsmin9699733559007871719;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2025-06-02 19:34:47] [INFO ] Applying decomposition
[2025-06-02 19:34:47] [INFO ] Flatten gal took : 48 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph2192653532690182389.txt' '-o' '/tmp/graph2192653532690182389.bin' '-w' '/tmp/graph2192653532690182389.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph2192653532690182389.bin' '-l' '-1' '-v' '-w' '/tmp/graph2192653532690182389.weights' '-q' '0' '-e' '0.001'
[2025-06-02 19:34:47] [INFO ] Decomposing Gal with order
[2025-06-02 19:34:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 19:34:48] [INFO ] Removed a total of 3044 redundant transitions.
[2025-06-02 19:34:48] [INFO ] Flatten gal took : 104 ms
[2025-06-02 19:34:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 1429 labels/synchronizations in 66 ms.
[2025-06-02 19:34:48] [INFO ] Time to serialize gal into /tmp/LTLFireability9627476447155088118.gal : 20 ms
[2025-06-02 19:34:48] [INFO ] Time to serialize properties into /tmp/LTLFireability129848768991564889.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability9627476447155088118.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability129848768991564889.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 2 LTL properties
Checking formula 0 : !((G(F(("(((i0.u1.s0<1)||(i28.i3.u172.l2052<1))&&((i0.u1.s0<1)||(i28.i1.u167.l1641<1)))")||(("((i0.u1.s0<1)||(i28.i3.u172.l2052<1))")&...208
Formula 0 simplified : FG(!"(((i0.u1.s0<1)||(i28.i3.u172.l2052<1))&&((i0.u1.s0<1)||(i28.i1.u167.l1641<1)))" & (!"((i0.u1.s0<1)||(i28.i3.u172.l2052<1))" | X...198
Compilation finished in 6414 ms.
Running link step : cd /tmp/ltsmin9699733559007871719;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 64 ms.
Running LTSmin : cd /tmp/ltsmin9699733559007871719;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](<>(((LTLAPp0==true)||((LTLAPp1==true)&&X([]((LTLAPp2==true)))))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.001: Registering PINS so language module
pins2lts-mc-linux64( 7/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.004: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.014: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.014: LTL layer: formula: [](<>(((LTLAPp0==true)||((LTLAPp1==true)&&X([]((LTLAPp2==true)))))))
pins2lts-mc-linux64( 0/ 8), 0.014: "[](<>(((LTLAPp0==true)||((LTLAPp1==true)&&X([]((LTLAPp2==true)))))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 0.015: Using Spin LTL semantics
pins2lts-mc-linux64( 7/ 8), 0.021: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.022: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.026: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.027: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.032: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.033: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.032: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.048: buchi has 4 states
pins2lts-mc-linux64( 0/ 8), 0.453: There are 1819 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.453: State length is 698, there are 1823 groups
pins2lts-mc-linux64( 0/ 8), 0.453: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.453: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.453: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.453: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 3/ 8), 0.700: [Blue] ~120 levels ~960 states ~7848 transitions
pins2lts-mc-linux64( 3/ 8), 0.911: [Blue] ~240 levels ~1920 states ~15808 transitions
pins2lts-mc-linux64( 3/ 8), 1.251: [Blue] ~480 levels ~3840 states ~31648 transitions
pins2lts-mc-linux64( 1/ 8), 1.899: [Blue] ~960 levels ~7680 states ~54992 transitions
pins2lts-mc-linux64( 2/ 8), 2.874: [Blue] ~1920 levels ~15360 states ~84376 transitions
pins2lts-mc-linux64( 2/ 8), 4.650: [Blue] ~3840 levels ~30720 states ~153496 transitions
pins2lts-mc-linux64( 4/ 8), 7.760: [Blue] ~7680 levels ~61440 states ~350232 transitions
pins2lts-mc-linux64( 7/ 8), 13.126: [Blue] ~15360 levels ~122880 states ~532928 transitions
pins2lts-mc-linux64( 7/ 8), 22.531: [Blue] ~30720 levels ~245760 states ~1044928 transitions
pins2lts-mc-linux64( 7/ 8), 40.568: [Blue] ~61440 levels ~491520 states ~2068928 transitions
pins2lts-mc-linux64( 7/ 8), 76.722: [Blue] ~122880 levels ~983040 states ~4116928 transitions
pins2lts-mc-linux64( 7/ 8), 148.850: [Blue] ~245760 levels ~1966080 states ~8212928 transitions
pins2lts-mc-linux64( 1/ 8), 267.740: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 268.124:
pins2lts-mc-linux64( 0/ 8), 268.125: Explored 3406835 states 20558792 transitions, fanout: 6.035
pins2lts-mc-linux64( 0/ 8), 268.125: Total exploration time 267.660 sec (267.280 sec minimum, 267.434 sec on average)
pins2lts-mc-linux64( 0/ 8), 268.125: States per second: 12728, Transitions per second: 76809
pins2lts-mc-linux64( 0/ 8), 268.125:
pins2lts-mc-linux64( 0/ 8), 268.125: State space has 20280462 states, 0 are accepting
pins2lts-mc-linux64( 0/ 8), 268.125: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 268.125: blue states: 3406835 (16.80%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 268.125: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 268.125: all-red states: 0 (0.00%), bogus 0 (0.00%)
pins2lts-mc-linux64( 0/ 8), 268.125:
pins2lts-mc-linux64( 0/ 8), 268.125: Total memory used for local state coloring: 52.0MB
pins2lts-mc-linux64( 0/ 8), 268.125:
pins2lts-mc-linux64( 0/ 8), 268.125: Queue width: 8B, total height: 3406835, memory: 25.99MB
pins2lts-mc-linux64( 0/ 8), 268.125: Tree memory: 410.7MB, 21.2 B/state, compr.: 0.8%
pins2lts-mc-linux64( 0/ 8), 268.125: Tree fill ratio (roots/leafs): 15.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 268.125: Stored 1957 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 268.125: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 268.125: Est. total memory use: 436.7MB (~1050.0MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin9699733559007871719;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](<>(((LTLAPp0==true)||((LTLAPp1==true)&&X([]((LTLAPp2==true)))))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin9699733559007871719;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](<>(((LTLAPp0==true)||((LTLAPp1==true)&&X([]((LTLAPp2==true)))))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:241)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:176)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:114)
at java.base/java.lang.Thread.run(Thread.java:1583)
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -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="FunctionPointer-PT-c128"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5832"
echo " Executing tool itstools"
echo " Input is FunctionPointer-PT-c128, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r100-smll-174867007500164"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/FunctionPointer-PT-c128.tgz
mv FunctionPointer-PT-c128 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.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 [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;