About the Execution of ITS-Tools for CANInsertWithFailure-PT-060
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 14702.972 | 3600000.00 | 5124575.00 | 7629.80 | ? ? 1 ? ? ? 1 ? ? ? ? ? ? ? ? ? | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r070-tall-171620505200141.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is CANInsertWithFailure-PT-060, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r070-tall-171620505200141
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 23M
-rw-r--r-- 1 mcc users 8.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.9K May 19 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 19 15:34 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K May 19 07:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 17:57 LTLFireability.xml
-rw-r--r-- 1 mcc users 23K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 188K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.6K Apr 12 09:48 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 59K Apr 12 09:48 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K May 19 07:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K May 19 15:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 22M May 18 16:42 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of positive values
NUM_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME CANInsertWithFailure-PT-060-UpperBounds-00
FORMULA_NAME CANInsertWithFailure-PT-060-UpperBounds-01
FORMULA_NAME CANInsertWithFailure-PT-060-UpperBounds-02
FORMULA_NAME CANInsertWithFailure-PT-060-UpperBounds-03
FORMULA_NAME CANInsertWithFailure-PT-060-UpperBounds-04
FORMULA_NAME CANInsertWithFailure-PT-060-UpperBounds-05
FORMULA_NAME CANInsertWithFailure-PT-060-UpperBounds-06
FORMULA_NAME CANInsertWithFailure-PT-060-UpperBounds-07
FORMULA_NAME CANInsertWithFailure-PT-060-UpperBounds-08
FORMULA_NAME CANInsertWithFailure-PT-060-UpperBounds-09
FORMULA_NAME CANInsertWithFailure-PT-060-UpperBounds-10
FORMULA_NAME CANInsertWithFailure-PT-060-UpperBounds-11
FORMULA_NAME CANInsertWithFailure-PT-060-UpperBounds-12
FORMULA_NAME CANInsertWithFailure-PT-060-UpperBounds-13
FORMULA_NAME CANInsertWithFailure-PT-060-UpperBounds-14
FORMULA_NAME CANInsertWithFailure-PT-060-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1716253964317
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CANInsertWithFailure-PT-060
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2024-05-21 01:12:45] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-21 01:12:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 01:12:46] [INFO ] Load time of PNML (sax parser for PT used): 574 ms
[2024-05-21 01:12:46] [INFO ] Transformed 7924 places.
[2024-05-21 01:12:46] [INFO ] Transformed 21960 transitions.
[2024-05-21 01:12:46] [INFO ] Parsed PT model containing 7924 places and 21960 transitions and 58800 arcs in 747 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 9 ms.
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
// Phase 1: matrix 21960 rows 7924 cols
[2024-05-21 01:12:49] [INFO ] Computed 63 invariants in 2715 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[60, 60, 1, 60, 60, 60, 1, 60, 60, 60, 60, 60, 60, 60, 60, 60]
RANDOM walk for 10000 steps (6 resets) in 172 ms. (57 steps per ms)
FORMULA CANInsertWithFailure-PT-060-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CANInsertWithFailure-PT-060-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 140014 steps (28 resets) in 217 ms. (642 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 1, 0, 1, 0, 1, 1, 0, 0, 0, 0, 0, 1, 1] Max Struct:[60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60]
[2024-05-21 01:12:49] [INFO ] Invariant cache hit.
[2024-05-21 01:12:50] [INFO ] [Real]Absence check using 61 positive place invariants in 186 ms returned sat
[2024-05-21 01:12:50] [INFO ] [Real]Absence check using 61 positive and 2 generalized place invariants in 68 ms returned sat
[2024-05-21 01:12:53] [INFO ] [Real]Absence check using state equation in 2548 ms returned sat
[2024-05-21 01:12:54] [INFO ] State equation strengthened by 7140 read => feed constraints.
[2024-05-21 01:12:54] [INFO ] [Real]Added 7140 Read/Feed constraints in 523 ms returned sat
0.0timeout
^^^^^^^^^^
(error "Invalid token: 0.0timeout")
[2024-05-21 01:12:54] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 01:12:55] [INFO ] [Nat]Absence check using 61 positive place invariants in 199 ms returned sat
[2024-05-21 01:12:55] [INFO ] [Nat]Absence check using 61 positive and 2 generalized place invariants in 65 ms returned sat
[2024-05-21 01:12:58] [INFO ] [Nat]Absence check using state equation in 2801 ms returned sat
[2024-05-21 01:12:59] [INFO ] [Nat]Added 7140 Read/Feed constraints in 497 ms returned sat
[2024-05-21 01:13:10] [INFO ] Deduced a trap composed of 42 places in 11121 ms of which 291 ms to minimize.
[2024-05-21 01:13:10] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-05-21 01:13:11] [INFO ] [Real]Absence check using 61 positive place invariants in 176 ms returned sat
[2024-05-21 01:13:11] [INFO ] [Real]Absence check using 61 positive and 2 generalized place invariants in 74 ms returned sat
[2024-05-21 01:13:14] [INFO ] [Real]Absence check using state equation in 2628 ms returned sat
[2024-05-21 01:13:15] [INFO ] [Real]Added 7140 Read/Feed constraints in 484 ms returned sat
[2024-05-21 01:13:15] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 01:13:16] [INFO ] [Nat]Absence check using 61 positive place invariants in 184 ms returned sat
[2024-05-21 01:13:16] [INFO ] [Nat]Absence check using 61 positive and 2 generalized place invariants in 64 ms returned sat
[2024-05-21 01:13:19] [INFO ] [Nat]Absence check using state equation in 2570 ms returned sat
[2024-05-21 01:13:19] [INFO ] [Nat]Added 7140 Read/Feed constraints in 488 ms returned sat
[2024-05-21 01:13:29] [INFO ] Deduced a trap composed of 9 places in 9823 ms of which 41 ms to minimize.
[2024-05-21 01:13:29] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 1
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-05-21 01:13:30] [INFO ] [Real]Absence check using 61 positive place invariants in 170 ms returned sat
[2024-05-21 01:13:30] [INFO ] [Real]Absence check using 61 positive and 2 generalized place invariants in 66 ms returned sat
[2024-05-21 01:13:33] [INFO ] [Real]Absence check using state equation in 2439 ms returned sat
[2024-05-21 01:13:34] [INFO ] [Real]Added 7140 Read/Feed constraints in 472 ms returned sat
[2024-05-21 01:13:34] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 01:13:35] [INFO ] [Nat]Absence check using 61 positive place invariants in 170 ms returned sat
[2024-05-21 01:13:35] [INFO ] [Nat]Absence check using 61 positive and 2 generalized place invariants in 63 ms returned sat
[2024-05-21 01:13:38] [INFO ] [Nat]Absence check using state equation in 2610 ms returned sat
[2024-05-21 01:13:38] [INFO ] [Nat]Added 7140 Read/Feed constraints in 471 ms returned sat
[2024-05-21 01:13:48] [INFO ] Deduced a trap composed of 42 places in 9860 ms of which 42 ms to minimize.
[2024-05-21 01:13:48] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 2
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-05-21 01:13:49] [INFO ] [Real]Absence check using 61 positive place invariants in 166 ms returned sat
[2024-05-21 01:13:49] [INFO ] [Real]Absence check using 61 positive and 2 generalized place invariants in 74 ms returned sat
[2024-05-21 01:13:52] [INFO ] [Real]Absence check using state equation in 2578 ms returned sat
[2024-05-21 01:13:53] [INFO ] [Real]Added 7140 Read/Feed constraints in 446 ms returned sat
[2024-05-21 01:13:53] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 01:13:54] [INFO ] [Nat]Absence check using 61 positive place invariants in 168 ms returned sat
[2024-05-21 01:13:54] [INFO ] [Nat]Absence check using 61 positive and 2 generalized place invariants in 64 ms returned sat
[2024-05-21 01:13:56] [INFO ] [Nat]Absence check using state equation in 2464 ms returned sat
[2024-05-21 01:13:57] [INFO ] [Nat]Added 7140 Read/Feed constraints in 439 ms returned sat
[2024-05-21 01:14:07] [INFO ] Deduced a trap composed of 42 places in 9517 ms of which 38 ms to minimize.
[2024-05-21 01:14:07] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 3
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-05-21 01:14:08] [INFO ] [Real]Absence check using 61 positive place invariants in 167 ms returned sat
[2024-05-21 01:14:08] [INFO ] [Real]Absence check using 61 positive and 2 generalized place invariants in 69 ms returned sat
[2024-05-21 01:14:10] [INFO ] [Real]Absence check using state equation in 2545 ms returned sat
[2024-05-21 01:14:11] [INFO ] [Real]Added 7140 Read/Feed constraints in 443 ms returned sat
[2024-05-21 01:14:11] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 01:14:12] [INFO ] [Nat]Absence check using 61 positive place invariants in 176 ms returned sat
[2024-05-21 01:14:12] [INFO ] [Nat]Absence check using 61 positive and 2 generalized place invariants in 61 ms returned sat
[2024-05-21 01:14:15] [INFO ] [Nat]Absence check using state equation in 2592 ms returned sat
[2024-05-21 01:14:15] [INFO ] [Nat]Added 7140 Read/Feed constraints in 475 ms returned sat
[2024-05-21 01:14:26] [INFO ] Deduced a trap composed of 9 places in 10095 ms of which 35 ms to minimize.
[2024-05-21 01:14:26] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 4
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-05-21 01:14:27] [INFO ] [Real]Absence check using 61 positive place invariants in 159 ms returned sat
[2024-05-21 01:14:27] [INFO ] [Real]Absence check using 61 positive and 2 generalized place invariants in 63 ms returned sat
[2024-05-21 01:14:29] [INFO ] [Real]Absence check using state equation in 2395 ms returned sat
[2024-05-21 01:14:30] [INFO ] [Real]Added 7140 Read/Feed constraints in 458 ms returned sat
[2024-05-21 01:14:30] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 01:14:31] [INFO ] [Nat]Absence check using 61 positive place invariants in 171 ms returned sat
[2024-05-21 01:14:31] [INFO ] [Nat]Absence check using 61 positive and 2 generalized place invariants in 65 ms returned sat
[2024-05-21 01:14:34] [INFO ] [Nat]Absence check using state equation in 2540 ms returned sat
[2024-05-21 01:14:34] [INFO ] [Nat]Added 7140 Read/Feed constraints in 462 ms returned sat
[2024-05-21 01:14:45] [INFO ] Deduced a trap composed of 42 places in 10231 ms of which 42 ms to minimize.
[2024-05-21 01:14:45] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 5
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-05-21 01:14:46] [INFO ] [Real]Absence check using 61 positive place invariants in 169 ms returned sat
[2024-05-21 01:14:46] [INFO ] [Real]Absence check using 61 positive and 2 generalized place invariants in 68 ms returned sat
[2024-05-21 01:14:48] [INFO ] [Real]Absence check using state equation in 2531 ms returned sat
[2024-05-21 01:14:49] [INFO ] [Real]Added 7140 Read/Feed constraints in 490 ms returned sat
[2024-05-21 01:14:50] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 01:14:50] [INFO ] [Nat]Absence check using 61 positive place invariants in 184 ms returned sat
[2024-05-21 01:14:50] [INFO ] [Nat]Absence check using 61 positive and 2 generalized place invariants in 67 ms returned sat
[2024-05-21 01:14:53] [INFO ] [Nat]Absence check using state equation in 2619 ms returned sat
[2024-05-21 01:14:54] [INFO ] [Nat]Added 7140 Read/Feed constraints in 473 ms returned sat
[2024-05-21 01:15:05] [INFO ] Deduced a trap composed of 9 places in 10621 ms of which 40 ms to minimize.
[2024-05-21 01:15:05] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 6
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-05-21 01:15:05] [INFO ] [Real]Absence check using 61 positive place invariants in 160 ms returned sat
[2024-05-21 01:15:06] [INFO ] [Real]Absence check using 61 positive and 2 generalized place invariants in 67 ms returned sat
[2024-05-21 01:15:08] [INFO ] [Real]Absence check using state equation in 2615 ms returned sat
[2024-05-21 01:15:09] [INFO ] [Real]Added 7140 Read/Feed constraints in 505 ms returned sat
[2024-05-21 01:15:09] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 01:15:10] [INFO ] [Nat]Absence check using 61 positive place invariants in 172 ms returned sat
[2024-05-21 01:15:10] [INFO ] [Nat]Absence check using 61 positive and 2 generalized place invariants in 65 ms returned sat
[2024-05-21 01:15:13] [INFO ] [Nat]Absence check using state equation in 2427 ms returned sat
[2024-05-21 01:15:13] [INFO ] [Nat]Added 7140 Read/Feed constraints in 472 ms returned sat
[2024-05-21 01:15:24] [INFO ] Deduced a trap composed of 5 places in 10679 ms of which 43 ms to minimize.
[2024-05-21 01:15:24] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 7
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-05-21 01:15:25] [INFO ] [Real]Absence check using 61 positive place invariants in 158 ms returned sat
[2024-05-21 01:15:25] [INFO ] [Real]Absence check using 61 positive and 2 generalized place invariants in 67 ms returned sat
[2024-05-21 01:15:28] [INFO ] [Real]Absence check using state equation in 2529 ms returned sat
[2024-05-21 01:15:29] [INFO ] [Real]Added 7140 Read/Feed constraints in 464 ms returned sat
[2024-05-21 01:15:29] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 01:15:30] [INFO ] [Nat]Absence check using 61 positive place invariants in 177 ms returned sat
[2024-05-21 01:15:30] [INFO ] [Nat]Absence check using 61 positive and 2 generalized place invariants in 65 ms returned sat
[2024-05-21 01:15:32] [INFO ] [Nat]Absence check using state equation in 2557 ms returned sat
[2024-05-21 01:15:33] [INFO ] [Nat]Added 7140 Read/Feed constraints in 470 ms returned sat
[2024-05-21 01:15:44] [INFO ] Deduced a trap composed of 13 places in 10505 ms of which 40 ms to minimize.
[2024-05-21 01:15:44] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 8
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-05-21 01:15:45] [INFO ] [Real]Absence check using 61 positive place invariants in 162 ms returned sat
[2024-05-21 01:15:45] [INFO ] [Real]Absence check using 61 positive and 2 generalized place invariants in 69 ms returned sat
[2024-05-21 01:15:47] [INFO ] [Real]Absence check using state equation in 2593 ms returned sat
[2024-05-21 01:15:48] [INFO ] [Real]Added 7140 Read/Feed constraints in 448 ms returned sat
[2024-05-21 01:15:49] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 01:15:49] [INFO ] [Nat]Absence check using 61 positive place invariants in 175 ms returned sat
[2024-05-21 01:15:49] [INFO ] [Nat]Absence check using 61 positive and 2 generalized place invariants in 67 ms returned sat
[2024-05-21 01:15:52] [INFO ] [Nat]Absence check using state equation in 2586 ms returned sat
[2024-05-21 01:15:53] [INFO ] [Nat]Added 7140 Read/Feed constraints in 470 ms returned sat
[2024-05-21 01:16:03] [INFO ] Deduced a trap composed of 42 places in 9811 ms of which 39 ms to minimize.
[2024-05-21 01:16:03] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 9
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-05-21 01:16:04] [INFO ] [Real]Absence check using 61 positive place invariants in 160 ms returned sat
[2024-05-21 01:16:04] [INFO ] [Real]Absence check using 61 positive and 2 generalized place invariants in 67 ms returned sat
[2024-05-21 01:16:06] [INFO ] [Real]Absence check using state equation in 2580 ms returned sat
[2024-05-21 01:16:07] [INFO ] [Real]Added 7140 Read/Feed constraints in 436 ms returned sat
[2024-05-21 01:16:07] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 01:16:08] [INFO ] [Nat]Absence check using 61 positive place invariants in 168 ms returned sat
[2024-05-21 01:16:08] [INFO ] [Nat]Absence check using 61 positive and 2 generalized place invariants in 65 ms returned sat
[2024-05-21 01:16:11] [INFO ] [Nat]Absence check using state equation in 2547 ms returned sat
[2024-05-21 01:16:11] [INFO ] [Nat]Added 7140 Read/Feed constraints in 474 ms returned sat
[2024-05-21 01:16:23] [INFO ] Deduced a trap composed of 42 places in 11105 ms of which 39 ms to minimize.
[2024-05-21 01:16:23] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 10
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-05-21 01:16:24] [INFO ] [Real]Absence check using 61 positive place invariants in 162 ms returned sat
[2024-05-21 01:16:24] [INFO ] [Real]Absence check using 61 positive and 2 generalized place invariants in 69 ms returned sat
[2024-05-21 01:16:26] [INFO ] [Real]Absence check using state equation in 2623 ms returned sat
[2024-05-21 01:16:27] [INFO ] [Real]Added 7140 Read/Feed constraints in 480 ms returned sat
[2024-05-21 01:16:28] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 01:16:29] [INFO ] [Nat]Absence check using 61 positive place invariants in 170 ms returned sat
[2024-05-21 01:16:29] [INFO ] [Nat]Absence check using 61 positive and 2 generalized place invariants in 65 ms returned sat
[2024-05-21 01:16:31] [INFO ] [Nat]Absence check using state equation in 2454 ms returned sat
[2024-05-21 01:16:32] [INFO ] [Nat]Added 7140 Read/Feed constraints in 445 ms returned sat
[2024-05-21 01:16:42] [INFO ] Deduced a trap composed of 42 places in 10192 ms of which 42 ms to minimize.
[2024-05-21 01:16:42] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 11
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-05-21 01:16:43] [INFO ] [Real]Absence check using 61 positive place invariants in 162 ms returned sat
[2024-05-21 01:16:43] [INFO ] [Real]Absence check using 61 positive and 2 generalized place invariants in 65 ms returned sat
[2024-05-21 01:16:46] [INFO ] [Real]Absence check using state equation in 2547 ms returned sat
[2024-05-21 01:16:46] [INFO ] [Real]Added 7140 Read/Feed constraints in 463 ms returned sat
[2024-05-21 01:16:47] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 01:16:48] [INFO ] [Nat]Absence check using 61 positive place invariants in 175 ms returned sat
[2024-05-21 01:16:48] [INFO ] [Nat]Absence check using 61 positive and 2 generalized place invariants in 74 ms returned sat
[2024-05-21 01:16:50] [INFO ] [Nat]Absence check using state equation in 2585 ms returned sat
[2024-05-21 01:16:51] [INFO ] [Nat]Added 7140 Read/Feed constraints in 437 ms returned sat
[2024-05-21 01:17:01] [INFO ] Deduced a trap composed of 42 places in 9791 ms of which 40 ms to minimize.
[2024-05-21 01:17:01] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 12
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-05-21 01:17:02] [INFO ] [Real]Absence check using 61 positive place invariants in 163 ms returned sat
[2024-05-21 01:17:02] [INFO ] [Real]Absence check using 61 positive and 2 generalized place invariants in 70 ms returned sat
[2024-05-21 01:17:04] [INFO ] [Real]Absence check using state equation in 2460 ms returned sat
[2024-05-21 01:17:05] [INFO ] [Real]Added 7140 Read/Feed constraints in 449 ms returned sat
[2024-05-21 01:17:05] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 01:17:06] [INFO ] [Nat]Absence check using 61 positive place invariants in 173 ms returned sat
[2024-05-21 01:17:06] [INFO ] [Nat]Absence check using 61 positive and 2 generalized place invariants in 66 ms returned sat
[2024-05-21 01:17:09] [INFO ] [Nat]Absence check using state equation in 2579 ms returned sat
[2024-05-21 01:17:09] [INFO ] [Nat]Added 7140 Read/Feed constraints in 462 ms returned sat
[2024-05-21 01:17:19] [INFO ] Deduced a trap composed of 46 places in 9658 ms of which 35 ms to minimize.
[2024-05-21 01:17:19] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 13
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
Current structural bounds on expressions (after SMT) : Max Seen:[0, 1, 0, 1, 0, 1, 1, 0, 0, 0, 0, 0, 1, 1] Max Struct:[60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 1, 0, 1, 0, 1, 1, 0, 0, 0, 0, 0, 1, 1] Max Struct:[60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60]
Support contains 14 out of 7924 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 7924/7924 places, 21960/21960 transitions.
Graph (complete) has 29701 edges and 7924 vertex of which 7923 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.32 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 420 transitions
Trivial Post-agglo rules discarded 420 transitions
Performed 420 trivial Post agglomeration. Transition count delta: 420
Iterating post reduction 0 with 420 rules applied. Total rules applied 421 place count 7923 transition count 21540
Reduce places removed 420 places and 0 transitions.
Iterating post reduction 1 with 420 rules applied. Total rules applied 841 place count 7503 transition count 21540
Performed 3535 Post agglomeration using F-continuation condition.Transition count delta: 3535
Deduced a syphon composed of 3535 places in 20 ms
Reduce places removed 3535 places and 0 transitions.
Iterating global reduction 2 with 7070 rules applied. Total rules applied 7911 place count 3968 transition count 18005
Drop transitions (Redundant composition of simpler transitions.) removed 3417 transitions
Redundant transition composition rules discarded 3417 transitions
Iterating global reduction 2 with 3417 rules applied. Total rules applied 11328 place count 3968 transition count 14588
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 11329 place count 3968 transition count 14587
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 11330 place count 3967 transition count 14587
Partial Free-agglomeration rule applied 3652 times.
Drop transitions (Partial Free agglomeration) removed 3652 transitions
Iterating global reduction 3 with 3652 rules applied. Total rules applied 14982 place count 3967 transition count 14587
Applied a total of 14982 rules in 6497 ms. Remains 3967 /7924 variables (removed 3957) and now considering 14587/21960 (removed 7373) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6509 ms. Remains : 3967/7924 places, 14587/21960 transitions.
// Phase 1: matrix 14587 rows 3967 cols
[2024-05-21 01:17:27] [INFO ] Computed 62 invariants in 628 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 1, 0, 1, 0, 1, 1, 0, 0, 0, 0, 0, 1, 1] Max Struct:[60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60]
RANDOM walk for 1000000 steps (3637 resets) in 18864 ms. (53 steps per ms)
BEST_FIRST walk for 14000014 steps (658 resets) in 23993 ms. (583 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] Max Struct:[60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60]
[2024-05-21 01:18:09] [INFO ] Invariant cache hit.
[2024-05-21 01:18:10] [INFO ] [Real]Absence check using 60 positive place invariants in 64 ms returned sat
[2024-05-21 01:18:10] [INFO ] [Real]Absence check using 60 positive and 2 generalized place invariants in 31 ms returned sat
[2024-05-21 01:18:13] [INFO ] [Real]Absence check using state equation in 3388 ms returned sat
[2024-05-21 01:18:14] [INFO ] State equation strengthened by 14384 read => feed constraints.
[2024-05-21 01:18:15] [INFO ] [Real]Added 14384 Read/Feed constraints in 1211 ms returned sat
[2024-05-21 01:18:15] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 01:18:16] [INFO ] [Nat]Absence check using 60 positive place invariants in 77 ms returned sat
[2024-05-21 01:18:16] [INFO ] [Nat]Absence check using 60 positive and 2 generalized place invariants in 32 ms returned sat
[2024-05-21 01:18:19] [INFO ] [Nat]Absence check using state equation in 3436 ms returned sat
[2024-05-21 01:18:21] [INFO ] [Nat]Added 14384 Read/Feed constraints in 1369 ms returned sat
[2024-05-21 01:18:22] [INFO ] Computed and/alt/rep : 10633/28257/10633 causal constraints (skipped 3894 transitions) in 855 ms.
Minimization took 6047 ms.
[2024-05-21 01:18:28] [INFO ] [Real]Absence check using 60 positive place invariants in 65 ms returned sat
[2024-05-21 01:18:28] [INFO ] [Real]Absence check using 60 positive and 2 generalized place invariants in 30 ms returned sat
[2024-05-21 01:18:32] [INFO ] [Real]Absence check using state equation in 3467 ms returned sat
[2024-05-21 01:18:33] [INFO ] [Real]Added 14384 Read/Feed constraints in 1264 ms returned sat
[2024-05-21 01:18:34] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 01:18:34] [INFO ] [Nat]Absence check using 60 positive place invariants in 74 ms returned sat
[2024-05-21 01:18:34] [INFO ] [Nat]Absence check using 60 positive and 2 generalized place invariants in 31 ms returned sat
[2024-05-21 01:18:37] [INFO ] [Nat]Absence check using state equation in 3419 ms returned sat
[2024-05-21 01:18:39] [INFO ] [Nat]Added 14384 Read/Feed constraints in 1545 ms returned sat
[2024-05-21 01:18:40] [INFO ] Computed and/alt/rep : 10633/28257/10633 causal constraints (skipped 3894 transitions) in 830 ms.
Minimization took 6046 ms.
[2024-05-21 01:18:47] [INFO ] [Real]Absence check using 60 positive place invariants in 69 ms returned sat
[2024-05-21 01:18:47] [INFO ] [Real]Absence check using 60 positive and 2 generalized place invariants in 33 ms returned sat
[2024-05-21 01:18:50] [INFO ] [Real]Absence check using state equation in 3522 ms returned sat
[2024-05-21 01:18:52] [INFO ] [Real]Added 14384 Read/Feed constraints in 1401 ms returned sat
[2024-05-21 01:18:52] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 01:18:53] [INFO ] [Nat]Absence check using 60 positive place invariants in 77 ms returned sat
[2024-05-21 01:18:53] [INFO ] [Nat]Absence check using 60 positive and 2 generalized place invariants in 31 ms returned sat
[2024-05-21 01:18:56] [INFO ] [Nat]Absence check using state equation in 3591 ms returned sat
[2024-05-21 01:18:58] [INFO ] [Nat]Added 14384 Read/Feed constraints in 1454 ms returned sat
[2024-05-21 01:18:59] [INFO ] Computed and/alt/rep : 10633/28257/10633 causal constraints (skipped 3894 transitions) in 778 ms.
Minimization took 6081 ms.
[2024-05-21 01:19:05] [INFO ] [Real]Absence check using 60 positive place invariants in 67 ms returned sat
[2024-05-21 01:19:05] [INFO ] [Real]Absence check using 60 positive and 2 generalized place invariants in 32 ms returned sat
[2024-05-21 01:19:09] [INFO ] [Real]Absence check using state equation in 3522 ms returned sat
[2024-05-21 01:19:11] [INFO ] [Real]Added 14384 Read/Feed constraints in 1356 ms returned sat
[2024-05-21 01:19:11] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 01:19:11] [INFO ] [Nat]Absence check using 60 positive place invariants in 77 ms returned sat
[2024-05-21 01:19:11] [INFO ] [Nat]Absence check using 60 positive and 2 generalized place invariants in 31 ms returned sat
[2024-05-21 01:19:15] [INFO ] [Nat]Absence check using state equation in 3629 ms returned sat
[2024-05-21 01:19:17] [INFO ] [Nat]Added 14384 Read/Feed constraints in 1538 ms returned sat
[2024-05-21 01:19:18] [INFO ] Computed and/alt/rep : 10633/28257/10633 causal constraints (skipped 3894 transitions) in 748 ms.
Minimization took 6000 ms.
[2024-05-21 01:19:24] [INFO ] [Real]Absence check using 60 positive place invariants in 69 ms returned sat
[2024-05-21 01:19:24] [INFO ] [Real]Absence check using 60 positive and 2 generalized place invariants in 32 ms returned sat
[2024-05-21 01:19:27] [INFO ] [Real]Absence check using state equation in 3351 ms returned sat
[2024-05-21 01:19:29] [INFO ] [Real]Added 14384 Read/Feed constraints in 1270 ms returned sat
[2024-05-21 01:19:29] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 01:19:30] [INFO ] [Nat]Absence check using 60 positive place invariants in 77 ms returned sat
[2024-05-21 01:19:30] [INFO ] [Nat]Absence check using 60 positive and 2 generalized place invariants in 31 ms returned sat
[2024-05-21 01:19:33] [INFO ] [Nat]Absence check using state equation in 3507 ms returned sat
[2024-05-21 01:19:35] [INFO ] [Nat]Added 14384 Read/Feed constraints in 1443 ms returned sat
[2024-05-21 01:19:36] [INFO ] Computed and/alt/rep : 10633/28257/10633 causal constraints (skipped 3894 transitions) in 705 ms.
Minimization took 5841 ms.
[2024-05-21 01:19:42] [INFO ] [Real]Absence check using 60 positive place invariants in 65 ms returned sat
[2024-05-21 01:19:42] [INFO ] [Real]Absence check using 60 positive and 2 generalized place invariants in 31 ms returned sat
[2024-05-21 01:19:45] [INFO ] [Real]Absence check using state equation in 3342 ms returned sat
[2024-05-21 01:19:47] [INFO ] [Real]Added 14384 Read/Feed constraints in 1345 ms returned sat
[2024-05-21 01:19:47] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 01:19:48] [INFO ] [Nat]Absence check using 60 positive place invariants in 73 ms returned sat
[2024-05-21 01:19:48] [INFO ] [Nat]Absence check using 60 positive and 2 generalized place invariants in 33 ms returned sat
[2024-05-21 01:19:51] [INFO ] [Nat]Absence check using state equation in 3297 ms returned sat
[2024-05-21 01:19:52] [INFO ] [Nat]Added 14384 Read/Feed constraints in 1356 ms returned sat
[2024-05-21 01:19:54] [INFO ] Computed and/alt/rep : 10633/28257/10633 causal constraints (skipped 3894 transitions) in 776 ms.
Minimization took 5962 ms.
[2024-05-21 01:20:00] [INFO ] [Real]Absence check using 60 positive place invariants in 64 ms returned sat
[2024-05-21 01:20:00] [INFO ] [Real]Absence check using 60 positive and 2 generalized place invariants in 31 ms returned sat
[2024-05-21 01:20:03] [INFO ] [Real]Absence check using state equation in 3269 ms returned sat
[2024-05-21 01:20:05] [INFO ] [Real]Added 14384 Read/Feed constraints in 1275 ms returned sat
[2024-05-21 01:20:05] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 01:20:06] [INFO ] [Nat]Absence check using 60 positive place invariants in 74 ms returned sat
[2024-05-21 01:20:06] [INFO ] [Nat]Absence check using 60 positive and 2 generalized place invariants in 30 ms returned sat
[2024-05-21 01:20:09] [INFO ] [Nat]Absence check using state equation in 3481 ms returned sat
[2024-05-21 01:20:11] [INFO ] [Nat]Added 14384 Read/Feed constraints in 1485 ms returned sat
[2024-05-21 01:20:12] [INFO ] Computed and/alt/rep : 10633/28257/10633 causal constraints (skipped 3894 transitions) in 783 ms.
Minimization took 6004 ms.
[2024-05-21 01:20:18] [INFO ] [Real]Absence check using 60 positive place invariants in 65 ms returned sat
[2024-05-21 01:20:18] [INFO ] [Real]Absence check using 60 positive and 2 generalized place invariants in 31 ms returned sat
[2024-05-21 01:20:22] [INFO ] [Real]Absence check using state equation in 3315 ms returned sat
[2024-05-21 01:20:23] [INFO ] [Real]Added 14384 Read/Feed constraints in 1239 ms returned sat
[2024-05-21 01:20:23] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 01:20:24] [INFO ] [Nat]Absence check using 60 positive place invariants in 76 ms returned sat
[2024-05-21 01:20:24] [INFO ] [Nat]Absence check using 60 positive and 2 generalized place invariants in 30 ms returned sat
[2024-05-21 01:20:27] [INFO ] [Nat]Absence check using state equation in 3519 ms returned sat
[2024-05-21 01:20:29] [INFO ] [Nat]Added 14384 Read/Feed constraints in 1346 ms returned sat
[2024-05-21 01:20:30] [INFO ] Computed and/alt/rep : 10633/28257/10633 causal constraints (skipped 3894 transitions) in 745 ms.
Minimization took 5867 ms.
[2024-05-21 01:20:36] [INFO ] [Real]Absence check using 60 positive place invariants in 66 ms returned sat
[2024-05-21 01:20:36] [INFO ] [Real]Absence check using 60 positive and 2 generalized place invariants in 30 ms returned sat
[2024-05-21 01:20:39] [INFO ] [Real]Absence check using state equation in 3407 ms returned sat
[2024-05-21 01:20:41] [INFO ] [Real]Added 14384 Read/Feed constraints in 1167 ms returned sat
[2024-05-21 01:20:41] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 01:20:42] [INFO ] [Nat]Absence check using 60 positive place invariants in 75 ms returned sat
[2024-05-21 01:20:42] [INFO ] [Nat]Absence check using 60 positive and 2 generalized place invariants in 30 ms returned sat
[2024-05-21 01:20:45] [INFO ] [Nat]Absence check using state equation in 3559 ms returned sat
[2024-05-21 01:20:47] [INFO ] [Nat]Added 14384 Read/Feed constraints in 1477 ms returned sat
[2024-05-21 01:20:48] [INFO ] Computed and/alt/rep : 10633/28257/10633 causal constraints (skipped 3894 transitions) in 789 ms.
Minimization took 5975 ms.
[2024-05-21 01:20:54] [INFO ] [Real]Absence check using 60 positive place invariants in 66 ms returned sat
[2024-05-21 01:20:54] [INFO ] [Real]Absence check using 60 positive and 2 generalized place invariants in 39 ms returned sat
[2024-05-21 01:20:58] [INFO ] [Real]Absence check using state equation in 3564 ms returned sat
[2024-05-21 01:20:59] [INFO ] [Real]Added 14384 Read/Feed constraints in 1274 ms returned sat
[2024-05-21 01:21:00] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 01:21:00] [INFO ] [Nat]Absence check using 60 positive place invariants in 77 ms returned sat
[2024-05-21 01:21:00] [INFO ] [Nat]Absence check using 60 positive and 2 generalized place invariants in 31 ms returned sat
[2024-05-21 01:21:04] [INFO ] [Nat]Absence check using state equation in 3550 ms returned sat
[2024-05-21 01:21:05] [INFO ] [Nat]Added 14384 Read/Feed constraints in 1363 ms returned sat
[2024-05-21 01:21:06] [INFO ] Computed and/alt/rep : 10633/28257/10633 causal constraints (skipped 3894 transitions) in 757 ms.
Minimization took 6187 ms.
[2024-05-21 01:21:13] [INFO ] [Real]Absence check using 60 positive place invariants in 71 ms returned sat
[2024-05-21 01:21:13] [INFO ] [Real]Absence check using 60 positive and 2 generalized place invariants in 33 ms returned sat
[2024-05-21 01:21:16] [INFO ] [Real]Absence check using state equation in 3444 ms returned sat
[2024-05-21 01:21:18] [INFO ] [Real]Added 14384 Read/Feed constraints in 1371 ms returned sat
[2024-05-21 01:21:18] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 01:21:19] [INFO ] [Nat]Absence check using 60 positive place invariants in 83 ms returned sat
[2024-05-21 01:21:19] [INFO ] [Nat]Absence check using 60 positive and 2 generalized place invariants in 34 ms returned sat
[2024-05-21 01:21:22] [INFO ] [Nat]Absence check using state equation in 3416 ms returned sat
[2024-05-21 01:21:24] [INFO ] [Nat]Added 14384 Read/Feed constraints in 1653 ms returned sat
[2024-05-21 01:21:25] [INFO ] Computed and/alt/rep : 10633/28257/10633 causal constraints (skipped 3894 transitions) in 794 ms.
Minimization took 6113 ms.
[2024-05-21 01:21:32] [INFO ] [Real]Absence check using 60 positive place invariants in 67 ms returned sat
[2024-05-21 01:21:32] [INFO ] [Real]Absence check using 60 positive and 2 generalized place invariants in 32 ms returned sat
[2024-05-21 01:21:35] [INFO ] [Real]Absence check using state equation in 3517 ms returned sat
[2024-05-21 01:21:37] [INFO ] [Real]Added 14384 Read/Feed constraints in 1278 ms returned sat
[2024-05-21 01:21:37] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 01:21:37] [INFO ] [Nat]Absence check using 60 positive place invariants in 78 ms returned sat
[2024-05-21 01:21:37] [INFO ] [Nat]Absence check using 60 positive and 2 generalized place invariants in 36 ms returned sat
[2024-05-21 01:21:41] [INFO ] [Nat]Absence check using state equation in 3412 ms returned sat
[2024-05-21 01:21:43] [INFO ] [Nat]Added 14384 Read/Feed constraints in 1681 ms returned sat
[2024-05-21 01:21:44] [INFO ] Computed and/alt/rep : 10633/28257/10633 causal constraints (skipped 3894 transitions) in 764 ms.
Minimization took 6127 ms.
[2024-05-21 01:21:50] [INFO ] [Real]Absence check using 60 positive place invariants in 66 ms returned sat
[2024-05-21 01:21:50] [INFO ] [Real]Absence check using 60 positive and 2 generalized place invariants in 31 ms returned sat
[2024-05-21 01:21:54] [INFO ] [Real]Absence check using state equation in 3612 ms returned sat
[2024-05-21 01:21:55] [INFO ] [Real]Added 14384 Read/Feed constraints in 1296 ms returned sat
[2024-05-21 01:21:56] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 01:21:56] [INFO ] [Nat]Absence check using 60 positive place invariants in 78 ms returned sat
[2024-05-21 01:21:56] [INFO ] [Nat]Absence check using 60 positive and 2 generalized place invariants in 32 ms returned sat
[2024-05-21 01:22:00] [INFO ] [Nat]Absence check using state equation in 3811 ms returned sat
[2024-05-21 01:22:02] [INFO ] [Nat]Added 14384 Read/Feed constraints in 1602 ms returned sat
[2024-05-21 01:22:03] [INFO ] Computed and/alt/rep : 10633/28257/10633 causal constraints (skipped 3894 transitions) in 736 ms.
Minimization took 6047 ms.
[2024-05-21 01:22:09] [INFO ] [Real]Absence check using 60 positive place invariants in 66 ms returned sat
[2024-05-21 01:22:09] [INFO ] [Real]Absence check using 60 positive and 2 generalized place invariants in 32 ms returned sat
[2024-05-21 01:22:13] [INFO ] [Real]Absence check using state equation in 3712 ms returned sat
[2024-05-21 01:22:15] [INFO ] [Real]Added 14384 Read/Feed constraints in 1265 ms returned sat
[2024-05-21 01:22:15] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 01:22:15] [INFO ] [Nat]Absence check using 60 positive place invariants in 75 ms returned sat
[2024-05-21 01:22:15] [INFO ] [Nat]Absence check using 60 positive and 2 generalized place invariants in 33 ms returned sat
[2024-05-21 01:22:19] [INFO ] [Nat]Absence check using state equation in 3529 ms returned sat
[2024-05-21 01:22:20] [INFO ] [Nat]Added 14384 Read/Feed constraints in 1534 ms returned sat
[2024-05-21 01:22:22] [INFO ] Computed and/alt/rep : 10633/28257/10633 causal constraints (skipped 3894 transitions) in 895 ms.
Minimization took 6126 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] Max Struct:[60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] Max Struct:[60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60]
Support contains 14 out of 3967 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3967/3967 places, 14587/14587 transitions.
Applied a total of 0 rules in 787 ms. Remains 3967 /3967 variables (removed 0) and now considering 14587/14587 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 787 ms. Remains : 3967/3967 places, 14587/14587 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3967/3967 places, 14587/14587 transitions.
Applied a total of 0 rules in 763 ms. Remains 3967 /3967 variables (removed 0) and now considering 14587/14587 (removed 0) transitions.
[2024-05-21 01:22:29] [INFO ] Invariant cache hit.
[2024-05-21 01:22:36] [INFO ] Implicit Places using invariants in 6531 ms returned []
Implicit Place search using SMT only with invariants took 6533 ms to find 0 implicit places.
Running 14527 sub problems to find dead transitions.
[2024-05-21 01:22:36] [INFO ] Invariant cache hit.
[2024-05-21 01:22:36] [INFO ] State equation strengthened by 14384 read => feed constraints.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/3966 variables, 60/60 constraints. Problems are: Problem set: 0 solved, 14527 unsolved
SMT process timed out in 58400ms, After SMT, problems are : Problem set: 0 solved, 14527 unsolved
Search for dead transitions found 0 dead transitions in 58589ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65950 ms. Remains : 3967/3967 places, 14587/14587 transitions.
[2024-05-21 01:23:35] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] Max Struct:[60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60]
RANDOM walk for 1000000 steps (3638 resets) in 20356 ms. (49 steps per ms)
BEST_FIRST walk for 14000014 steps (663 resets) in 24521 ms. (570 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] Max Struct:[60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60]
[2024-05-21 01:24:19] [INFO ] Invariant cache hit.
[2024-05-21 01:24:20] [INFO ] [Real]Absence check using 60 positive place invariants in 68 ms returned sat
[2024-05-21 01:24:20] [INFO ] [Real]Absence check using 60 positive and 2 generalized place invariants in 31 ms returned sat
[2024-05-21 01:24:23] [INFO ] [Real]Absence check using state equation in 3510 ms returned sat
[2024-05-21 01:24:24] [INFO ] State equation strengthened by 14384 read => feed constraints.
[2024-05-21 01:24:25] [INFO ] [Real]Added 14384 Read/Feed constraints in 1301 ms returned sat
[2024-05-21 01:24:25] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 01:24:26] [INFO ] [Nat]Absence check using 60 positive place invariants in 79 ms returned sat
[2024-05-21 01:24:26] [INFO ] [Nat]Absence check using 60 positive and 2 generalized place invariants in 32 ms returned sat
[2024-05-21 01:24:30] [INFO ] [Nat]Absence check using state equation in 3713 ms returned sat
[2024-05-21 01:24:31] [INFO ] [Nat]Added 14384 Read/Feed constraints in 1412 ms returned sat
[2024-05-21 01:24:32] [INFO ] Computed and/alt/rep : 10633/28257/10633 causal constraints (skipped 3894 transitions) in 780 ms.
Minimization took 6197 ms.
[2024-05-21 01:24:39] [INFO ] [Real]Absence check using 60 positive place invariants in 67 ms returned sat
[2024-05-21 01:24:39] [INFO ] [Real]Absence check using 60 positive and 2 generalized place invariants in 34 ms returned sat
[2024-05-21 01:24:42] [INFO ] [Real]Absence check using state equation in 3543 ms returned sat
[2024-05-21 01:24:44] [INFO ] [Real]Added 14384 Read/Feed constraints in 1254 ms returned sat
[2024-05-21 01:24:44] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 01:24:45] [INFO ] [Nat]Absence check using 60 positive place invariants in 75 ms returned sat
[2024-05-21 01:24:45] [INFO ] [Nat]Absence check using 60 positive and 2 generalized place invariants in 32 ms returned sat
[2024-05-21 01:24:48] [INFO ] [Nat]Absence check using state equation in 3601 ms returned sat
[2024-05-21 01:24:50] [INFO ] [Nat]Added 14384 Read/Feed constraints in 1592 ms returned sat
[2024-05-21 01:24:51] [INFO ] Computed and/alt/rep : 10633/28257/10633 causal constraints (skipped 3894 transitions) in 782 ms.
Minimization took 5947 ms.
[2024-05-21 01:24:57] [INFO ] [Real]Absence check using 60 positive place invariants in 66 ms returned sat
[2024-05-21 01:24:57] [INFO ] [Real]Absence check using 60 positive and 2 generalized place invariants in 32 ms returned sat
[2024-05-21 01:25:01] [INFO ] [Real]Absence check using state equation in 3280 ms returned sat
[2024-05-21 01:25:02] [INFO ] [Real]Added 14384 Read/Feed constraints in 1303 ms returned sat
[2024-05-21 01:25:03] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 01:25:03] [INFO ] [Nat]Absence check using 60 positive place invariants in 74 ms returned sat
[2024-05-21 01:25:03] [INFO ] [Nat]Absence check using 60 positive and 2 generalized place invariants in 28 ms returned sat
[2024-05-21 01:25:06] [INFO ] [Nat]Absence check using state equation in 3338 ms returned sat
[2024-05-21 01:25:08] [INFO ] [Nat]Added 14384 Read/Feed constraints in 1360 ms returned sat
[2024-05-21 01:25:09] [INFO ] Computed and/alt/rep : 10633/28257/10633 causal constraints (skipped 3894 transitions) in 739 ms.
Minimization took 5997 ms.
[2024-05-21 01:25:15] [INFO ] [Real]Absence check using 60 positive place invariants in 67 ms returned sat
[2024-05-21 01:25:15] [INFO ] [Real]Absence check using 60 positive and 2 generalized place invariants in 31 ms returned sat
[2024-05-21 01:25:19] [INFO ] [Real]Absence check using state equation in 3444 ms returned sat
[2024-05-21 01:25:20] [INFO ] [Real]Added 14384 Read/Feed constraints in 1295 ms returned sat
[2024-05-21 01:25:21] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 01:25:21] [INFO ] [Nat]Absence check using 60 positive place invariants in 73 ms returned sat
[2024-05-21 01:25:21] [INFO ] [Nat]Absence check using 60 positive and 2 generalized place invariants in 30 ms returned sat
[2024-05-21 01:25:25] [INFO ] [Nat]Absence check using state equation in 3430 ms returned sat
[2024-05-21 01:25:26] [INFO ] [Nat]Added 14384 Read/Feed constraints in 1550 ms returned sat
[2024-05-21 01:25:27] [INFO ] Computed and/alt/rep : 10633/28257/10633 causal constraints (skipped 3894 transitions) in 772 ms.
Minimization took 6080 ms.
[2024-05-21 01:25:34] [INFO ] [Real]Absence check using 60 positive place invariants in 68 ms returned sat
[2024-05-21 01:25:34] [INFO ] [Real]Absence check using 60 positive and 2 generalized place invariants in 32 ms returned sat
[2024-05-21 01:25:37] [INFO ] [Real]Absence check using state equation in 3460 ms returned sat
[2024-05-21 01:25:39] [INFO ] [Real]Added 14384 Read/Feed constraints in 1292 ms returned sat
[2024-05-21 01:25:39] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 01:25:39] [INFO ] [Nat]Absence check using 60 positive place invariants in 76 ms returned sat
[2024-05-21 01:25:40] [INFO ] [Nat]Absence check using 60 positive and 2 generalized place invariants in 32 ms returned sat
[2024-05-21 01:25:43] [INFO ] [Nat]Absence check using state equation in 3415 ms returned sat
[2024-05-21 01:25:44] [INFO ] [Nat]Added 14384 Read/Feed constraints in 1361 ms returned sat
[2024-05-21 01:25:45] [INFO ] Computed and/alt/rep : 10633/28257/10633 causal constraints (skipped 3894 transitions) in 754 ms.
Minimization took 5950 ms.
[2024-05-21 01:25:52] [INFO ] [Real]Absence check using 60 positive place invariants in 64 ms returned sat
[2024-05-21 01:25:52] [INFO ] [Real]Absence check using 60 positive and 2 generalized place invariants in 30 ms returned sat
[2024-05-21 01:25:55] [INFO ] [Real]Absence check using state equation in 3374 ms returned sat
[2024-05-21 01:25:57] [INFO ] [Real]Added 14384 Read/Feed constraints in 1393 ms returned sat
[2024-05-21 01:25:57] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 01:25:58] [INFO ] [Nat]Absence check using 60 positive place invariants in 74 ms returned sat
[2024-05-21 01:25:58] [INFO ] [Nat]Absence check using 60 positive and 2 generalized place invariants in 31 ms returned sat
[2024-05-21 01:26:01] [INFO ] [Nat]Absence check using state equation in 3286 ms returned sat
[2024-05-21 01:26:02] [INFO ] [Nat]Added 14384 Read/Feed constraints in 1283 ms returned sat
[2024-05-21 01:26:03] [INFO ] Computed and/alt/rep : 10633/28257/10633 causal constraints (skipped 3894 transitions) in 716 ms.
Minimization took 5923 ms.
[2024-05-21 01:26:10] [INFO ] [Real]Absence check using 60 positive place invariants in 67 ms returned sat
[2024-05-21 01:26:10] [INFO ] [Real]Absence check using 60 positive and 2 generalized place invariants in 30 ms returned sat
[2024-05-21 01:26:13] [INFO ] [Real]Absence check using state equation in 3272 ms returned sat
[2024-05-21 01:26:14] [INFO ] [Real]Added 14384 Read/Feed constraints in 1270 ms returned sat
[2024-05-21 01:26:15] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 01:26:15] [INFO ] [Nat]Absence check using 60 positive place invariants in 80 ms returned sat
[2024-05-21 01:26:15] [INFO ] [Nat]Absence check using 60 positive and 2 generalized place invariants in 32 ms returned sat
[2024-05-21 01:26:19] [INFO ] [Nat]Absence check using state equation in 3409 ms returned sat
[2024-05-21 01:26:20] [INFO ] [Nat]Added 14384 Read/Feed constraints in 1486 ms returned sat
[2024-05-21 01:26:21] [INFO ] Computed and/alt/rep : 10633/28257/10633 causal constraints (skipped 3894 transitions) in 772 ms.
Minimization took 6057 ms.
[2024-05-21 01:26:28] [INFO ] [Real]Absence check using 60 positive place invariants in 68 ms returned sat
[2024-05-21 01:26:28] [INFO ] [Real]Absence check using 60 positive and 2 generalized place invariants in 32 ms returned sat
[2024-05-21 01:26:31] [INFO ] [Real]Absence check using state equation in 3406 ms returned sat
[2024-05-21 01:26:33] [INFO ] [Real]Added 14384 Read/Feed constraints in 1254 ms returned sat
[2024-05-21 01:26:33] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 01:26:33] [INFO ] [Nat]Absence check using 60 positive place invariants in 74 ms returned sat
[2024-05-21 01:26:33] [INFO ] [Nat]Absence check using 60 positive and 2 generalized place invariants in 31 ms returned sat
[2024-05-21 01:26:37] [INFO ] [Nat]Absence check using state equation in 3496 ms returned sat
[2024-05-21 01:26:38] [INFO ] [Nat]Added 14384 Read/Feed constraints in 1412 ms returned sat
[2024-05-21 01:26:39] [INFO ] Computed and/alt/rep : 10633/28257/10633 causal constraints (skipped 3894 transitions) in 747 ms.
Minimization took 6099 ms.
[2024-05-21 01:26:46] [INFO ] [Real]Absence check using 60 positive place invariants in 66 ms returned sat
[2024-05-21 01:26:46] [INFO ] [Real]Absence check using 60 positive and 2 generalized place invariants in 32 ms returned sat
[2024-05-21 01:26:50] [INFO ] [Real]Absence check using state equation in 3574 ms returned sat
[2024-05-21 01:26:51] [INFO ] [Real]Added 14384 Read/Feed constraints in 1284 ms returned sat
[2024-05-21 01:26:52] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 01:26:52] [INFO ] [Nat]Absence check using 60 positive place invariants in 78 ms returned sat
[2024-05-21 01:26:52] [INFO ] [Nat]Absence check using 60 positive and 2 generalized place invariants in 32 ms returned sat
[2024-05-21 01:26:56] [INFO ] [Nat]Absence check using state equation in 3677 ms returned sat
[2024-05-21 01:26:57] [INFO ] [Nat]Added 14384 Read/Feed constraints in 1481 ms returned sat
[2024-05-21 01:26:58] [INFO ] Computed and/alt/rep : 10633/28257/10633 causal constraints (skipped 3894 transitions) in 783 ms.
Minimization took 6097 ms.
[2024-05-21 01:27:05] [INFO ] [Real]Absence check using 60 positive place invariants in 66 ms returned sat
[2024-05-21 01:27:05] [INFO ] [Real]Absence check using 60 positive and 2 generalized place invariants in 33 ms returned sat
[2024-05-21 01:27:08] [INFO ] [Real]Absence check using state equation in 3542 ms returned sat
[2024-05-21 01:27:10] [INFO ] [Real]Added 14384 Read/Feed constraints in 1209 ms returned sat
[2024-05-21 01:27:10] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 01:27:11] [INFO ] [Nat]Absence check using 60 positive place invariants in 76 ms returned sat
[2024-05-21 01:27:11] [INFO ] [Nat]Absence check using 60 positive and 2 generalized place invariants in 31 ms returned sat
[2024-05-21 01:27:14] [INFO ] [Nat]Absence check using state equation in 3400 ms returned sat
[2024-05-21 01:27:15] [INFO ] [Nat]Added 14384 Read/Feed constraints in 1437 ms returned sat
[2024-05-21 01:27:17] [INFO ] Computed and/alt/rep : 10633/28257/10633 causal constraints (skipped 3894 transitions) in 766 ms.
Minimization took 6013 ms.
[2024-05-21 01:27:23] [INFO ] [Real]Absence check using 60 positive place invariants in 66 ms returned sat
[2024-05-21 01:27:23] [INFO ] [Real]Absence check using 60 positive and 2 generalized place invariants in 32 ms returned sat
[2024-05-21 01:27:26] [INFO ] [Real]Absence check using state equation in 3386 ms returned sat
[2024-05-21 01:27:28] [INFO ] [Real]Added 14384 Read/Feed constraints in 1249 ms returned sat
[2024-05-21 01:27:28] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 01:27:29] [INFO ] [Nat]Absence check using 60 positive place invariants in 72 ms returned sat
[2024-05-21 01:27:29] [INFO ] [Nat]Absence check using 60 positive and 2 generalized place invariants in 30 ms returned sat
[2024-05-21 01:27:32] [INFO ] [Nat]Absence check using state equation in 3431 ms returned sat
[2024-05-21 01:27:34] [INFO ] [Nat]Added 14384 Read/Feed constraints in 1603 ms returned sat
[2024-05-21 01:27:35] [INFO ] Computed and/alt/rep : 10633/28257/10633 causal constraints (skipped 3894 transitions) in 769 ms.
Minimization took 5922 ms.
[2024-05-21 01:27:41] [INFO ] [Real]Absence check using 60 positive place invariants in 68 ms returned sat
[2024-05-21 01:27:41] [INFO ] [Real]Absence check using 60 positive and 2 generalized place invariants in 32 ms returned sat
[2024-05-21 01:27:45] [INFO ] [Real]Absence check using state equation in 3367 ms returned sat
[2024-05-21 01:27:46] [INFO ] [Real]Added 14384 Read/Feed constraints in 1320 ms returned sat
[2024-05-21 01:27:47] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 01:27:47] [INFO ] [Nat]Absence check using 60 positive place invariants in 71 ms returned sat
[2024-05-21 01:27:47] [INFO ] [Nat]Absence check using 60 positive and 2 generalized place invariants in 38 ms returned sat
[2024-05-21 01:27:50] [INFO ] [Nat]Absence check using state equation in 3387 ms returned sat
[2024-05-21 01:27:52] [INFO ] [Nat]Added 14384 Read/Feed constraints in 1611 ms returned sat
[2024-05-21 01:27:53] [INFO ] Computed and/alt/rep : 10633/28257/10633 causal constraints (skipped 3894 transitions) in 711 ms.
Minimization took 5984 ms.
[2024-05-21 01:27:59] [INFO ] [Real]Absence check using 60 positive place invariants in 65 ms returned sat
[2024-05-21 01:27:59] [INFO ] [Real]Absence check using 60 positive and 2 generalized place invariants in 30 ms returned sat
[2024-05-21 01:28:03] [INFO ] [Real]Absence check using state equation in 3387 ms returned sat
[2024-05-21 01:28:04] [INFO ] [Real]Added 14384 Read/Feed constraints in 1195 ms returned sat
[2024-05-21 01:28:05] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 01:28:05] [INFO ] [Nat]Absence check using 60 positive place invariants in 74 ms returned sat
[2024-05-21 01:28:05] [INFO ] [Nat]Absence check using 60 positive and 2 generalized place invariants in 29 ms returned sat
[2024-05-21 01:28:08] [INFO ] [Nat]Absence check using state equation in 3410 ms returned sat
[2024-05-21 01:28:10] [INFO ] [Nat]Added 14384 Read/Feed constraints in 1503 ms returned sat
[2024-05-21 01:28:11] [INFO ] Computed and/alt/rep : 10633/28257/10633 causal constraints (skipped 3894 transitions) in 758 ms.
Minimization took 5857 ms.
[2024-05-21 01:28:17] [INFO ] [Real]Absence check using 60 positive place invariants in 64 ms returned sat
[2024-05-21 01:28:17] [INFO ] [Real]Absence check using 60 positive and 2 generalized place invariants in 30 ms returned sat
[2024-05-21 01:28:21] [INFO ] [Real]Absence check using state equation in 3291 ms returned sat
[2024-05-21 01:28:22] [INFO ] [Real]Added 14384 Read/Feed constraints in 1287 ms returned sat
[2024-05-21 01:28:22] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 01:28:23] [INFO ] [Nat]Absence check using 60 positive place invariants in 73 ms returned sat
[2024-05-21 01:28:23] [INFO ] [Nat]Absence check using 60 positive and 2 generalized place invariants in 31 ms returned sat
[2024-05-21 01:28:26] [INFO ] [Nat]Absence check using state equation in 3494 ms returned sat
[2024-05-21 01:28:28] [INFO ] [Nat]Added 14384 Read/Feed constraints in 1557 ms returned sat
[2024-05-21 01:28:29] [INFO ] Computed and/alt/rep : 10633/28257/10633 causal constraints (skipped 3894 transitions) in 759 ms.
Minimization took 6054 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] Max Struct:[60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] Max Struct:[60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60]
Support contains 14 out of 3967 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3967/3967 places, 14587/14587 transitions.
Applied a total of 0 rules in 735 ms. Remains 3967 /3967 variables (removed 0) and now considering 14587/14587 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 735 ms. Remains : 3967/3967 places, 14587/14587 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3967/3967 places, 14587/14587 transitions.
Applied a total of 0 rules in 724 ms. Remains 3967 /3967 variables (removed 0) and now considering 14587/14587 (removed 0) transitions.
[2024-05-21 01:28:37] [INFO ] Invariant cache hit.
[2024-05-21 01:28:43] [INFO ] Implicit Places using invariants in 6578 ms returned []
Implicit Place search using SMT only with invariants took 6578 ms to find 0 implicit places.
Running 14527 sub problems to find dead transitions.
[2024-05-21 01:28:43] [INFO ] Invariant cache hit.
[2024-05-21 01:28:43] [INFO ] State equation strengthened by 14384 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3966 variables, 60/60 constraints. Problems are: Problem set: 0 solved, 14527 unsolved
SMT process timed out in 59123ms, After SMT, problems are : Problem set: 0 solved, 14527 unsolved
Search for dead transitions found 0 dead transitions in 59239ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66570 ms. Remains : 3967/3967 places, 14587/14587 transitions.
RANDOM walk for 40000 steps (142 resets) in 2486 ms. (16 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 28/28 properties
[2024-05-21 01:29:44] [INFO ] Flatten gal took : 1004 ms
[2024-05-21 01:29:44] [INFO ] Flatten gal took : 375 ms
[2024-05-21 01:29:45] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12379778310385832071.gal : 123 ms
[2024-05-21 01:29:45] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8152501476035050782.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality12379778310385832071.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8152501476035050782.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality8152501476035050782.prop.
Interrupted probabilistic random walk after 46121 steps, run timeout after 3001 ms. (steps per millisecond=15 ) properties seen :0 out of 28
Probabilistic random walk after 46121 steps, saw 28519 distinct states, run finished after 3004 ms. (steps per millisecond=15 ) properties seen :0
[2024-05-21 01:29:46] [INFO ] Invariant cache hit.
[2024-05-21 01:29:47] [INFO ] State equation strengthened by 14384 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (OVERLAPS) 3831/3845 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 28 unsolved
[2024-05-21 01:29:47] [INFO ] Deduced a trap composed of 2 places in 99 ms of which 1 ms to minimize.
Problem MAX0 is UNSAT
[2024-05-21 01:29:47] [INFO ] Deduced a trap composed of 2 places in 100 ms of which 1 ms to minimize.
Problem MAX1 is UNSAT
Problem MAX2 is UNSAT
Problem MAX3 is UNSAT
Problem MAX4 is UNSAT
Problem MAX5 is UNSAT
Problem MAX6 is UNSAT
Problem MAX7 is UNSAT
Problem MAX8 is UNSAT
Problem MAX9 is UNSAT
Problem MAX10 is UNSAT
Problem MAX11 is UNSAT
Problem MAX12 is UNSAT
Problem MAX13 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/3845 variables, 2/3 constraints. Problems are: Problem set: 14 solved, 14 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/3845 variables, 0/3 constraints. Problems are: Problem set: 14 solved, 14 unsolved
At refinement iteration 4 (OVERLAPS) 118/3963 variables, 59/62 constraints. Problems are: Problem set: 14 solved, 14 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3963/18554 variables, and 62 constraints, problems are : Problem set: 14 solved, 14 unsolved in 5044 ms.
Refiners :[Positive P Invariants (semi-flows): 60/60 constraints, Generalized P Invariants (flows): 0/2 constraints, State Equation: 0/3967 constraints, ReadFeed: 0/14384 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 14 solved, 14 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 14 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 3831/3845 variables, 1/1 constraints. Problems are: Problem set: 14 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3845 variables, 2/3 constraints. Problems are: Problem set: 14 solved, 14 unsolved
[2024-05-21 01:29:52] [INFO ] Deduced a trap composed of 2 places in 97 ms of which 1 ms to minimize.
[2024-05-21 01:29:53] [INFO ] Deduced a trap composed of 2 places in 94 ms of which 1 ms to minimize.
[2024-05-21 01:29:53] [INFO ] Deduced a trap composed of 2 places in 93 ms of which 1 ms to minimize.
[2024-05-21 01:29:53] [INFO ] Deduced a trap composed of 2 places in 97 ms of which 1 ms to minimize.
[2024-05-21 01:29:53] [INFO ] Deduced a trap composed of 2 places in 98 ms of which 2 ms to minimize.
[2024-05-21 01:29:53] [INFO ] Deduced a trap composed of 2 places in 93 ms of which 1 ms to minimize.
[2024-05-21 01:29:53] [INFO ] Deduced a trap composed of 2 places in 103 ms of which 1 ms to minimize.
[2024-05-21 01:29:53] [INFO ] Deduced a trap composed of 2 places in 92 ms of which 1 ms to minimize.
[2024-05-21 01:29:54] [INFO ] Deduced a trap composed of 2 places in 92 ms of which 1 ms to minimize.
[2024-05-21 01:29:54] [INFO ] Deduced a trap composed of 2 places in 87 ms of which 1 ms to minimize.
[2024-05-21 01:29:54] [INFO ] Deduced a trap composed of 2 places in 85 ms of which 1 ms to minimize.
[2024-05-21 01:29:54] [INFO ] Deduced a trap composed of 2 places in 84 ms of which 1 ms to minimize.
[2024-05-21 01:29:54] [INFO ] Deduced a trap composed of 2 places in 83 ms of which 1 ms to minimize.
[2024-05-21 01:29:54] [INFO ] Deduced a trap composed of 2 places in 85 ms of which 1 ms to minimize.
[2024-05-21 01:29:54] [INFO ] Deduced a trap composed of 2 places in 88 ms of which 1 ms to minimize.
[2024-05-21 01:29:54] [INFO ] Deduced a trap composed of 2 places in 86 ms of which 1 ms to minimize.
[2024-05-21 01:29:55] [INFO ] Deduced a trap composed of 2 places in 84 ms of which 1 ms to minimize.
[2024-05-21 01:29:55] [INFO ] Deduced a trap composed of 2 places in 87 ms of which 1 ms to minimize.
[2024-05-21 01:29:55] [INFO ] Deduced a trap composed of 2 places in 92 ms of which 4 ms to minimize.
[2024-05-21 01:29:55] [INFO ] Deduced a trap composed of 2 places in 82 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/3845 variables, 20/23 constraints. Problems are: Problem set: 14 solved, 14 unsolved
[2024-05-21 01:29:55] [INFO ] Deduced a trap composed of 2 places in 82 ms of which 1 ms to minimize.
[2024-05-21 01:29:55] [INFO ] Deduced a trap composed of 2 places in 90 ms of which 1 ms to minimize.
[2024-05-21 01:29:55] [INFO ] Deduced a trap composed of 2 places in 142 ms of which 1 ms to minimize.
[2024-05-21 01:29:56] [INFO ] Deduced a trap composed of 2 places in 88 ms of which 1 ms to minimize.
[2024-05-21 01:29:56] [INFO ] Deduced a trap composed of 2 places in 89 ms of which 1 ms to minimize.
[2024-05-21 01:29:56] [INFO ] Deduced a trap composed of 2 places in 93 ms of which 2 ms to minimize.
[2024-05-21 01:29:56] [INFO ] Deduced a trap composed of 2 places in 89 ms of which 0 ms to minimize.
[2024-05-21 01:29:56] [INFO ] Deduced a trap composed of 2 places in 87 ms of which 1 ms to minimize.
[2024-05-21 01:29:56] [INFO ] Deduced a trap composed of 2 places in 88 ms of which 1 ms to minimize.
[2024-05-21 01:29:56] [INFO ] Deduced a trap composed of 2 places in 84 ms of which 1 ms to minimize.
[2024-05-21 01:29:57] [INFO ] Deduced a trap composed of 2 places in 88 ms of which 1 ms to minimize.
[2024-05-21 01:29:57] [INFO ] Deduced a trap composed of 2 places in 85 ms of which 2 ms to minimize.
[2024-05-21 01:29:57] [INFO ] Deduced a trap composed of 2 places in 86 ms of which 1 ms to minimize.
SMT process timed out in 10340ms, After SMT, problems are : Problem set: 14 solved, 14 unsolved
Fused 14 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 14 out of 3967 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3967/3967 places, 14587/14587 transitions.
Applied a total of 0 rules in 745 ms. Remains 3967 /3967 variables (removed 0) and now considering 14587/14587 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 750 ms. Remains : 3967/3967 places, 14587/14587 transitions.
RANDOM walk for 40000 steps (143 resets) in 1425 ms. (28 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 155 ms. (256 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 177 ms. (224 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 178 ms. (223 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 141 ms. (281 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 126 ms. (314 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 122 ms. (325 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 120 ms. (330 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 114 ms. (347 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 105 ms. (377 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 117 ms. (339 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 107 ms. (370 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 107 ms. (370 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 105 ms. (377 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 113 ms. (350 steps per ms) remains 14/14 properties
Interrupted probabilistic random walk after 56622 steps, run timeout after 3001 ms. (steps per millisecond=18 ) properties seen :0 out of 14
Probabilistic random walk after 56622 steps, saw 29914 distinct states, run finished after 3002 ms. (steps per millisecond=18 ) properties seen :0
[2024-05-21 01:30:02] [INFO ] Invariant cache hit.
[2024-05-21 01:30:02] [INFO ] State equation strengthened by 14384 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 3831/3845 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 14 unsolved
[2024-05-21 01:30:02] [INFO ] Deduced a trap composed of 2 places in 111 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/3845 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/3845 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (OVERLAPS) 118/3963 variables, 59/61 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3963 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (OVERLAPS) 2/3965 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 14 unsolved
[2024-05-21 01:30:13] [INFO ] Deduced a trap composed of 71 places in 5471 ms of which 27 ms to minimize.
[2024-05-21 01:30:18] [INFO ] Deduced a trap composed of 72 places in 5327 ms of which 27 ms to minimize.
[2024-05-21 01:30:24] [INFO ] Deduced a trap composed of 70 places in 5205 ms of which 26 ms to minimize.
[2024-05-21 01:30:29] [INFO ] Deduced a trap composed of 101 places in 5350 ms of which 26 ms to minimize.
[2024-05-21 01:30:34] [INFO ] Deduced a trap composed of 68 places in 5165 ms of which 25 ms to minimize.
Detected timeout of ITS tools.
[2024-05-21 01:30:35] [INFO ] Flatten gal took : 308 ms
[2024-05-21 01:30:35] [INFO ] Applying decomposition
[2024-05-21 01:30:35] [INFO ] Flatten gal took : 290 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph10572320393202298475.txt' '-o' '/tmp/graph10572320393202298475.bin' '-w' '/tmp/graph10572320393202298475.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph10572320393202298475.bin' '-l' '-1' '-v' '-w' '/tmp/graph10572320393202298475.weights' '-q' '0' '-e' '0.001'
[2024-05-21 01:30:36] [INFO ] Decomposing Gal with order
[2024-05-21 01:30:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 01:30:38] [INFO ] Removed a total of 11017 redundant transitions.
[2024-05-21 01:30:38] [INFO ] Flatten gal took : 1679 ms
[2024-05-21 01:30:39] [INFO ] Deduced a trap composed of 75 places in 4590 ms of which 21 ms to minimize.
[2024-05-21 01:30:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 13230 labels/synchronizations in 1118 ms.
[2024-05-21 01:30:40] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12428306888427929312.gal : 121 ms
[2024-05-21 01:30:40] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7450585498354016002.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.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality12428306888427929312.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7450585498354016002.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
Loading property file /tmp/ReachabilityCardinality7450585498354016002.prop.
[2024-05-21 01:30:44] [INFO ] Deduced a trap composed of 67 places in 4761 ms of which 26 ms to minimize.
SDD proceeding with computation,14 properties remain. new max is 4
SDD size :1 after 3082
SDD proceeding with computation,14 properties remain. new max is 8
SDD size :3082 after 3082
SDD proceeding with computation,14 properties remain. new max is 16
SDD size :3082 after 3082
SDD proceeding with computation,14 properties remain. new max is 32
SDD size :3082 after 3082
SDD proceeding with computation,14 properties remain. new max is 64
SDD size :3082 after 3082
SDD proceeding with computation,14 properties remain. new max is 128
SDD size :3082 after 3082
SDD proceeding with computation,14 properties remain. new max is 256
SDD size :3082 after 3082
SDD proceeding with computation,14 properties remain. new max is 512
SDD size :3082 after 3082
SDD proceeding with computation,14 properties remain. new max is 1024
SDD size :3082 after 3082
SDD proceeding with computation,14 properties remain. new max is 2048
SDD size :3082 after 3082
SDD proceeding with computation,14 properties remain. new max is 4096
SDD size :3082 after 3082
SDD proceeding with computation,14 properties remain. new max is 8192
SDD size :3082 after 3082
SDD proceeding with computation,14 properties remain. new max is 16384
SDD size :3082 after 3082
[2024-05-21 01:30:49] [INFO ] Deduced a trap composed of 86 places in 5191 ms of which 25 ms to minimize.
SMT process timed out in 47292ms, After SMT, problems are : Problem set: 0 solved, 14 unsolved
Fused 14 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 14 out of 3967 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3967/3967 places, 14587/14587 transitions.
Applied a total of 0 rules in 769 ms. Remains 3967 /3967 variables (removed 0) and now considering 14587/14587 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 770 ms. Remains : 3967/3967 places, 14587/14587 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3967/3967 places, 14587/14587 transitions.
Applied a total of 0 rules in 815 ms. Remains 3967 /3967 variables (removed 0) and now considering 14587/14587 (removed 0) transitions.
[2024-05-21 01:30:50] [INFO ] Invariant cache hit.
SDD proceeding with computation,14 properties remain. new max is 32768
SDD size :3082 after 6937
[2024-05-21 01:30:57] [INFO ] Implicit Places using invariants in 6664 ms returned []
Implicit Place search using SMT only with invariants took 6669 ms to find 0 implicit places.
Running 14527 sub problems to find dead transitions.
[2024-05-21 01:30:57] [INFO ] Invariant cache hit.
[2024-05-21 01:30:58] [INFO ] State equation strengthened by 14384 read => feed constraints.
Detected timeout of ITS tools.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/3966 variables, 60/60 constraints. Problems are: Problem set: 0 solved, 14527 unsolved
SMT process timed out in 58904ms, After SMT, problems are : Problem set: 0 solved, 14527 unsolved
Search for dead transitions found 0 dead transitions in 59064ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66585 ms. Remains : 3967/3967 places, 14587/14587 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] Max Struct:[60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60]
Starting property specific reduction for CANInsertWithFailure-PT-060-UpperBounds-00
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[60]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[60]
[2024-05-21 01:31:56] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[60]
RANDOM walk for 10000 steps (36 resets) in 236 ms. (42 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 19 ms. (500 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[60]
[2024-05-21 01:31:57] [INFO ] Invariant cache hit.
[2024-05-21 01:31:57] [INFO ] [Real]Absence check using 60 positive place invariants in 68 ms returned sat
[2024-05-21 01:31:57] [INFO ] [Real]Absence check using 60 positive and 2 generalized place invariants in 31 ms returned sat
[2024-05-21 01:32:00] [INFO ] [Real]Absence check using state equation in 3374 ms returned sat
[2024-05-21 01:32:01] [INFO ] State equation strengthened by 14384 read => feed constraints.
[2024-05-21 01:32:02] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-21 01:32:02] [INFO ] [Real]Added 14384 Read/Feed constraints in 751 ms returned unknown
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[60]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[60]
Support contains 1 out of 3967 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3967/3967 places, 14587/14587 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 2 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 3962 transition count 14582
Partial Free-agglomeration rule applied 8 times.
Drop transitions (Partial Free agglomeration) removed 8 transitions
Iterating global reduction 0 with 8 rules applied. Total rules applied 18 place count 3962 transition count 14582
Applied a total of 18 rules in 2089 ms. Remains 3962 /3967 variables (removed 5) and now considering 14582/14587 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2090 ms. Remains : 3962/3967 places, 14582/14587 transitions.
// Phase 1: matrix 14582 rows 3962 cols
[2024-05-21 01:32:04] [INFO ] Computed 62 invariants in 702 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[60]
RANDOM walk for 1000000 steps (3642 resets) in 20514 ms. (48 steps per ms)
BEST_FIRST walk for 1000001 steps (46 resets) in 1755 ms. (569 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[60]
[2024-05-21 01:32:27] [INFO ] Invariant cache hit.
[2024-05-21 01:32:27] [INFO ] [Real]Absence check using 60 positive place invariants in 66 ms returned sat
[2024-05-21 01:32:27] [INFO ] [Real]Absence check using 60 positive and 2 generalized place invariants in 31 ms returned sat
[2024-05-21 01:32:30] [INFO ] [Real]Absence check using state equation in 3226 ms returned sat
[2024-05-21 01:32:31] [INFO ] State equation strengthened by 14402 read => feed constraints.
[2024-05-21 01:32:32] [INFO ] [Real]Added 14402 Read/Feed constraints in 1209 ms returned sat
[2024-05-21 01:32:32] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 01:32:33] [INFO ] [Nat]Absence check using 60 positive place invariants in 76 ms returned sat
[2024-05-21 01:32:33] [INFO ] [Nat]Absence check using 60 positive and 2 generalized place invariants in 31 ms returned sat
[2024-05-21 01:32:36] [INFO ] [Nat]Absence check using state equation in 3541 ms returned sat
[2024-05-21 01:32:38] [INFO ] [Nat]Added 14402 Read/Feed constraints in 1402 ms returned sat
[2024-05-21 01:32:39] [INFO ] Computed and/alt/rep : 10628/28280/10628 causal constraints (skipped 3894 transitions) in 832 ms.
Minimization took 6287 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[60]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[60]
Support contains 1 out of 3962 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3962/3962 places, 14582/14582 transitions.
Applied a total of 0 rules in 770 ms. Remains 3962 /3962 variables (removed 0) and now considering 14582/14582 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 770 ms. Remains : 3962/3962 places, 14582/14582 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3962/3962 places, 14582/14582 transitions.
Applied a total of 0 rules in 765 ms. Remains 3962 /3962 variables (removed 0) and now considering 14582/14582 (removed 0) transitions.
[2024-05-21 01:32:47] [INFO ] Invariant cache hit.
[2024-05-21 01:32:53] [INFO ] Implicit Places using invariants in 6492 ms returned []
Implicit Place search using SMT only with invariants took 6494 ms to find 0 implicit places.
Running 14522 sub problems to find dead transitions.
[2024-05-21 01:32:53] [INFO ] Invariant cache hit.
[2024-05-21 01:32:54] [INFO ] State equation strengthened by 14402 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3961 variables, 60/60 constraints. Problems are: Problem set: 0 solved, 14522 unsolved
SMT process timed out in 56874ms, After SMT, problems are : Problem set: 0 solved, 14522 unsolved
Search for dead transitions found 0 dead transitions in 57030ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64325 ms. Remains : 3962/3962 places, 14582/14582 transitions.
[2024-05-21 01:33:51] [INFO ] Flatten gal took : 381 ms
RANDOM walk for 40000 steps (144 resets) in 2334 ms. (17 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 101 ms. (392 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 113 ms. (350 steps per ms) remains 2/2 properties
[2024-05-21 01:33:51] [INFO ] Flatten gal took : 412 ms
[2024-05-21 01:33:51] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14631551350502885907.gal : 52 ms
[2024-05-21 01:33:51] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11201887316150132780.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.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality14631551350502885907.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11201887316150132780.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
Loading property file /tmp/ReachabilityCardinality11201887316150132780.prop.
Interrupted probabilistic random walk after 60006 steps, run timeout after 3001 ms. (steps per millisecond=19 ) properties seen :0 out of 2
Probabilistic random walk after 60006 steps, saw 30389 distinct states, run finished after 3001 ms. (steps per millisecond=19 ) properties seen :0
[2024-05-21 01:33:54] [INFO ] Invariant cache hit.
[2024-05-21 01:33:54] [INFO ] State equation strengthened by 14402 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 3839/3840 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 01:33:56] [INFO ] Deduced a trap composed of 2 places in 691 ms of which 2 ms to minimize.
Problem MAX0 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/3840 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/3840 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 118/3958 variables, 59/61 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3958 variables, 0/61 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/3960 variables, 2/63 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-21 01:34:02] [INFO ] Deduced a trap composed of 76 places in 5490 ms of which 24 ms to minimize.
SMT process timed out in 7599ms, After SMT, problems are : Problem set: 1 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 3962 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3962/3962 places, 14582/14582 transitions.
Applied a total of 0 rules in 794 ms. Remains 3962 /3962 variables (removed 0) and now considering 14582/14582 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 794 ms. Remains : 3962/3962 places, 14582/14582 transitions.
RANDOM walk for 40000 steps (144 resets) in 1495 ms. (26 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 84 ms. (470 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 63677 steps, run timeout after 3001 ms. (steps per millisecond=21 ) properties seen :0 out of 1
Probabilistic random walk after 63677 steps, saw 30864 distinct states, run finished after 3001 ms. (steps per millisecond=21 ) properties seen :0
[2024-05-21 01:34:06] [INFO ] Invariant cache hit.
[2024-05-21 01:34:06] [INFO ] State equation strengthened by 14402 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3839/3840 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 01:34:07] [INFO ] Deduced a trap composed of 2 places in 102 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/3840 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/3840 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 118/3958 variables, 59/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3958 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/3960 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 01:34:12] [INFO ] Deduced a trap composed of 65 places in 5089 ms of which 25 ms to minimize.
[2024-05-21 01:34:12] [INFO ] Deduced a trap composed of 73 places in 107 ms of which 2 ms to minimize.
[2024-05-21 01:34:13] [INFO ] Deduced a trap composed of 76 places in 124 ms of which 2 ms to minimize.
[2024-05-21 01:34:13] [INFO ] Deduced a trap composed of 75 places in 121 ms of which 2 ms to minimize.
[2024-05-21 01:34:13] [INFO ] Deduced a trap composed of 74 places in 129 ms of which 2 ms to minimize.
[2024-05-21 01:34:13] [INFO ] Deduced a trap composed of 75 places in 124 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/3960 variables, 6/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3960 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 14582/18542 variables, 3960/4029 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/18542 variables, 14402/18431 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/18542 variables, 0/18431 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 2/18544 variables, 2/18433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/18544 variables, 0/18433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/18544 variables, 0/18433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 18544/18544 variables, and 18433 constraints, problems are : Problem set: 0 solved, 1 unsolved in 17186 ms.
Refiners :[Positive P Invariants (semi-flows): 60/60 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 3962/3962 constraints, ReadFeed: 14402/14402 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3839/3840 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3840 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 01:34:24] [INFO ] Deduced a trap composed of 2 places in 104 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/3840 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3840 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 118/3958 variables, 59/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3958 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/3960 variables, 2/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3960 variables, 6/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 01:34:30] [INFO ] Deduced a trap composed of 87 places in 5521 ms of which 25 ms to minimize.
[2024-05-21 01:34:30] [INFO ] Deduced a trap composed of 75 places in 122 ms of which 2 ms to minimize.
[2024-05-21 01:34:30] [INFO ] Deduced a trap composed of 73 places in 114 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/3960 variables, 3/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3960 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 14582/18542 variables, 3960/4033 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/18542 variables, 14402/18435 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/18542 variables, 1/18436 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/18542 variables, 0/18436 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Detected timeout of ITS tools.
[2024-05-21 01:34:42] [INFO ] Flatten gal took : 267 ms
[2024-05-21 01:34:42] [INFO ] Applying decomposition
[2024-05-21 01:34:42] [INFO ] Flatten gal took : 273 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph7006294919314423561.txt' '-o' '/tmp/graph7006294919314423561.bin' '-w' '/tmp/graph7006294919314423561.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7006294919314423561.bin' '-l' '-1' '-v' '-w' '/tmp/graph7006294919314423561.weights' '-q' '0' '-e' '0.001'
[2024-05-21 01:34:42] [INFO ] Decomposing Gal with order
[2024-05-21 01:34:43] [INFO ] Rewriting arrays to variables to allow decomposition.
Solver is answering 'unknown', stopping.
[2024-05-21 01:34:44] [INFO ] Removed a total of 11039 redundant transitions.
[2024-05-21 01:34:44] [INFO ] Flatten gal took : 998 ms
After SMT solving in domain Int declared 18544/18544 variables, and 18438 constraints, problems are : Problem set: 0 solved, 1 unsolved in 20937 ms.
Refiners :[Positive P Invariants (semi-flows): 60/60 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 3962/3962 constraints, ReadFeed: 14402/14402 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 11/11 constraints]
After SMT, in 38286ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 48 ms.
Support contains 1 out of 3962 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3962/3962 places, 14582/14582 transitions.
Applied a total of 0 rules in 713 ms. Remains 3962 /3962 variables (removed 0) and now considering 14582/14582 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 713 ms. Remains : 3962/3962 places, 14582/14582 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3962/3962 places, 14582/14582 transitions.
[2024-05-21 01:34:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 14220 labels/synchronizations in 943 ms.
[2024-05-21 01:34:45] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17726137400679721819.gal : 91 ms
[2024-05-21 01:34:45] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11716946681842532695.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.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality17726137400679721819.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11716946681842532695.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...309
Applied a total of 0 rules in 780 ms. Remains 3962 /3962 variables (removed 0) and now considering 14582/14582 (removed 0) transitions.
[2024-05-21 01:34:46] [INFO ] Invariant cache hit.
Loading property file /tmp/ReachabilityCardinality11716946681842532695.prop.
[2024-05-21 01:34:52] [INFO ] Implicit Places using invariants in 6324 ms returned []
Implicit Place search using SMT only with invariants took 6327 ms to find 0 implicit places.
Running 14522 sub problems to find dead transitions.
[2024-05-21 01:34:52] [INFO ] Invariant cache hit.
[2024-05-21 01:34:52] [INFO ] State equation strengthened by 14402 read => feed constraints.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 3542
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :3542 after 3542
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :3542 after 3542
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :3542 after 3542
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :3542 after 3542
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :3542 after 3542
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :3542 after 3542
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :3542 after 3542
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :3542 after 3542
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :3542 after 3542
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :3542 after 3542
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :3542 after 3542
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :3542 after 3542
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :3542 after 2.49598e+06
Detected timeout of ITS tools.
At refinement iteration 0 (INCLUDED_ONLY) 0/3961 variables, 60/60 constraints. Problems are: Problem set: 0 solved, 14522 unsolved
SMT process timed out in 57032ms, After SMT, problems are : Problem set: 0 solved, 14522 unsolved
Search for dead transitions found 0 dead transitions in 57169ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64316 ms. Remains : 3962/3962 places, 14582/14582 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[1] Max Struct:[60]
Ending property specific reduction for CANInsertWithFailure-PT-060-UpperBounds-00 in 233011 ms.
Starting property specific reduction for CANInsertWithFailure-PT-060-UpperBounds-01
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[60]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[60]
// Phase 1: matrix 14587 rows 3967 cols
[2024-05-21 01:35:50] [INFO ] Computed 62 invariants in 534 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[60]
RANDOM walk for 10000 steps (36 resets) in 216 ms. (46 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 20 ms. (476 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[60]
[2024-05-21 01:35:50] [INFO ] Invariant cache hit.
[2024-05-21 01:35:51] [INFO ] [Real]Absence check using 60 positive place invariants in 64 ms returned sat
[2024-05-21 01:35:51] [INFO ] [Real]Absence check using 60 positive and 2 generalized place invariants in 30 ms returned sat
[2024-05-21 01:35:54] [INFO ] [Real]Absence check using state equation in 3382 ms returned sat
[2024-05-21 01:35:54] [INFO ] State equation strengthened by 14384 read => feed constraints.
[2024-05-21 01:35:55] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-21 01:35:55] [INFO ] [Real]Added 14384 Read/Feed constraints in 727 ms returned unknown
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[60]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[60]
Support contains 1 out of 3967 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3967/3967 places, 14587/14587 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 3 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 3962 transition count 14582
Partial Free-agglomeration rule applied 8 times.
Drop transitions (Partial Free agglomeration) removed 8 transitions
Iterating global reduction 0 with 8 rules applied. Total rules applied 18 place count 3962 transition count 14582
Applied a total of 18 rules in 1981 ms. Remains 3962 /3967 variables (removed 5) and now considering 14582/14587 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1982 ms. Remains : 3962/3967 places, 14582/14587 transitions.
// Phase 1: matrix 14582 rows 3962 cols
[2024-05-21 01:35:58] [INFO ] Computed 62 invariants in 567 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[60]
RANDOM walk for 1000000 steps (3637 resets) in 19081 ms. (52 steps per ms)
BEST_FIRST walk for 1000001 steps (46 resets) in 1789 ms. (558 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[60]
[2024-05-21 01:36:19] [INFO ] Invariant cache hit.
[2024-05-21 01:36:19] [INFO ] [Real]Absence check using 60 positive place invariants in 66 ms returned sat
[2024-05-21 01:36:19] [INFO ] [Real]Absence check using 60 positive and 2 generalized place invariants in 33 ms returned sat
[2024-05-21 01:36:22] [INFO ] [Real]Absence check using state equation in 3447 ms returned sat
[2024-05-21 01:36:23] [INFO ] State equation strengthened by 14402 read => feed constraints.
[2024-05-21 01:36:24] [INFO ] [Real]Added 14402 Read/Feed constraints in 1290 ms returned sat
[2024-05-21 01:36:24] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 01:36:25] [INFO ] [Nat]Absence check using 60 positive place invariants in 93 ms returned sat
[2024-05-21 01:36:25] [INFO ] [Nat]Absence check using 60 positive and 2 generalized place invariants in 32 ms returned sat
[2024-05-21 01:36:29] [INFO ] [Nat]Absence check using state equation in 3586 ms returned sat
[2024-05-21 01:36:30] [INFO ] [Nat]Added 14402 Read/Feed constraints in 1457 ms returned sat
[2024-05-21 01:36:31] [INFO ] Computed and/alt/rep : 10628/28280/10628 causal constraints (skipped 3894 transitions) in 745 ms.
Minimization took 6253 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[60]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[60]
Support contains 1 out of 3962 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3962/3962 places, 14582/14582 transitions.
Applied a total of 0 rules in 725 ms. Remains 3962 /3962 variables (removed 0) and now considering 14582/14582 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 727 ms. Remains : 3962/3962 places, 14582/14582 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3962/3962 places, 14582/14582 transitions.
Applied a total of 0 rules in 726 ms. Remains 3962 /3962 variables (removed 0) and now considering 14582/14582 (removed 0) transitions.
[2024-05-21 01:36:39] [INFO ] Invariant cache hit.
[2024-05-21 01:36:45] [INFO ] Implicit Places using invariants in 6557 ms returned []
Implicit Place search using SMT only with invariants took 6557 ms to find 0 implicit places.
Running 14522 sub problems to find dead transitions.
[2024-05-21 01:36:45] [INFO ] Invariant cache hit.
[2024-05-21 01:36:46] [INFO ] State equation strengthened by 14402 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3961 variables, 60/60 constraints. Problems are: Problem set: 0 solved, 14522 unsolved
SMT process timed out in 56822ms, After SMT, problems are : Problem set: 0 solved, 14522 unsolved
Search for dead transitions found 0 dead transitions in 56951ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64270 ms. Remains : 3962/3962 places, 14582/14582 transitions.
[2024-05-21 01:37:42] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[60]
RANDOM walk for 1000000 steps (3641 resets) in 19658 ms. (50 steps per ms)
BEST_FIRST walk for 1000001 steps (47 resets) in 1723 ms. (580 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[60]
[2024-05-21 01:38:04] [INFO ] Invariant cache hit.
[2024-05-21 01:38:04] [INFO ] [Real]Absence check using 60 positive place invariants in 66 ms returned sat
[2024-05-21 01:38:04] [INFO ] [Real]Absence check using 60 positive and 2 generalized place invariants in 31 ms returned sat
[2024-05-21 01:38:08] [INFO ] [Real]Absence check using state equation in 3455 ms returned sat
[2024-05-21 01:38:08] [INFO ] State equation strengthened by 14402 read => feed constraints.
[2024-05-21 01:38:09] [INFO ] [Real]Added 14402 Read/Feed constraints in 1266 ms returned sat
[2024-05-21 01:38:10] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 01:38:10] [INFO ] [Nat]Absence check using 60 positive place invariants in 75 ms returned sat
[2024-05-21 01:38:10] [INFO ] [Nat]Absence check using 60 positive and 2 generalized place invariants in 31 ms returned sat
[2024-05-21 01:38:14] [INFO ] [Nat]Absence check using state equation in 3463 ms returned sat
[2024-05-21 01:38:15] [INFO ] [Nat]Added 14402 Read/Feed constraints in 1442 ms returned sat
[2024-05-21 01:38:16] [INFO ] Computed and/alt/rep : 10628/28280/10628 causal constraints (skipped 3894 transitions) in 757 ms.
Minimization took 6096 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[60]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[60]
Support contains 1 out of 3962 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3962/3962 places, 14582/14582 transitions.
Applied a total of 0 rules in 726 ms. Remains 3962 /3962 variables (removed 0) and now considering 14582/14582 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 728 ms. Remains : 3962/3962 places, 14582/14582 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3962/3962 places, 14582/14582 transitions.
Applied a total of 0 rules in 714 ms. Remains 3962 /3962 variables (removed 0) and now considering 14582/14582 (removed 0) transitions.
[2024-05-21 01:38:24] [INFO ] Invariant cache hit.
[2024-05-21 01:38:30] [INFO ] Implicit Places using invariants in 6256 ms returned []
Implicit Place search using SMT only with invariants took 6258 ms to find 0 implicit places.
Running 14522 sub problems to find dead transitions.
[2024-05-21 01:38:30] [INFO ] Invariant cache hit.
[2024-05-21 01:38:30] [INFO ] State equation strengthened by 14402 read => feed constraints.
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/3961 variables, 60/60 constraints. Problems are: Problem set: 0 solved, 14522 unsolved
SMT process timed out in 58522ms, After SMT, problems are : Problem set: 0 solved, 14522 unsolved
Search for dead transitions found 0 dead transitions in 58648ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65637 ms. Remains : 3962/3962 places, 14582/14582 transitions.
[2024-05-21 01:39:29] [INFO ] Flatten gal took : 269 ms
RANDOM walk for 40000 steps (144 resets) in 1308 ms. (30 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 103 ms. (384 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 100 ms. (396 steps per ms) remains 2/2 properties
[2024-05-21 01:39:29] [INFO ] Flatten gal took : 326 ms
[2024-05-21 01:39:29] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7155971914782061044.gal : 71 ms
[2024-05-21 01:39:29] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14538917346921712619.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.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality7155971914782061044.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14538917346921712619.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality14538917346921712619.prop.
Interrupted probabilistic random walk after 59941 steps, run timeout after 3001 ms. (steps per millisecond=19 ) properties seen :0 out of 2
Probabilistic random walk after 59941 steps, saw 30375 distinct states, run finished after 3001 ms. (steps per millisecond=19 ) properties seen :0
[2024-05-21 01:39:32] [INFO ] Invariant cache hit.
[2024-05-21 01:39:32] [INFO ] State equation strengthened by 14402 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 3839/3840 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 01:39:33] [INFO ] Deduced a trap composed of 2 places in 89 ms of which 1 ms to minimize.
Problem MAX0 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/3840 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/3840 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 118/3958 variables, 59/61 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3958 variables, 0/61 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/3960 variables, 2/63 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-21 01:39:39] [INFO ] Deduced a trap composed of 76 places in 5548 ms of which 25 ms to minimize.
SMT process timed out in 6710ms, After SMT, problems are : Problem set: 1 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 3962 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3962/3962 places, 14582/14582 transitions.
Applied a total of 0 rules in 707 ms. Remains 3962 /3962 variables (removed 0) and now considering 14582/14582 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 707 ms. Remains : 3962/3962 places, 14582/14582 transitions.
RANDOM walk for 40000 steps (143 resets) in 1052 ms. (37 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 124 ms. (320 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 63545 steps, run timeout after 3001 ms. (steps per millisecond=21 ) properties seen :0 out of 1
Probabilistic random walk after 63545 steps, saw 30853 distinct states, run finished after 3001 ms. (steps per millisecond=21 ) properties seen :0
[2024-05-21 01:39:43] [INFO ] Invariant cache hit.
[2024-05-21 01:39:43] [INFO ] State equation strengthened by 14402 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3839/3840 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 01:39:44] [INFO ] Deduced a trap composed of 2 places in 85 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/3840 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/3840 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 118/3958 variables, 59/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3958 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/3960 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 01:39:49] [INFO ] Deduced a trap composed of 67 places in 5339 ms of which 25 ms to minimize.
[2024-05-21 01:39:55] [INFO ] Deduced a trap composed of 69 places in 5262 ms of which 26 ms to minimize.
[2024-05-21 01:40:00] [INFO ] Deduced a trap composed of 89 places in 5044 ms of which 24 ms to minimize.
[2024-05-21 01:40:05] [INFO ] Deduced a trap composed of 78 places in 4998 ms of which 23 ms to minimize.
[2024-05-21 01:40:10] [INFO ] Deduced a trap composed of 82 places in 5038 ms of which 25 ms to minimize.
[2024-05-21 01:40:15] [INFO ] Deduced a trap composed of 73 places in 5109 ms of which 26 ms to minimize.
Detected timeout of ITS tools.
[2024-05-21 01:40:20] [INFO ] Flatten gal took : 258 ms
[2024-05-21 01:40:20] [INFO ] Applying decomposition
[2024-05-21 01:40:20] [INFO ] Flatten gal took : 269 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph18351554327383757695.txt' '-o' '/tmp/graph18351554327383757695.bin' '-w' '/tmp/graph18351554327383757695.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph18351554327383757695.bin' '-l' '-1' '-v' '-w' '/tmp/graph18351554327383757695.weights' '-q' '0' '-e' '0.001'
[2024-05-21 01:40:20] [INFO ] Decomposing Gal with order
[2024-05-21 01:40:20] [INFO ] Deduced a trap composed of 87 places in 5221 ms of which 22 ms to minimize.
[2024-05-21 01:40:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 01:40:22] [INFO ] Removed a total of 11035 redundant transitions.
[2024-05-21 01:40:22] [INFO ] Flatten gal took : 909 ms
[2024-05-21 01:40:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 13866 labels/synchronizations in 830 ms.
[2024-05-21 01:40:23] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality18208714245527299654.gal : 88 ms
[2024-05-21 01:40:23] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17597096108207038692.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.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality18208714245527299654.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17597096108207038692.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...309
Loading property file /tmp/ReachabilityCardinality17597096108207038692.prop.
[2024-05-21 01:40:25] [INFO ] Deduced a trap composed of 92 places in 4881 ms of which 22 ms to minimize.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 3481
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :3481 after 3481
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :3481 after 3481
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :3481 after 3481
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :3481 after 3481
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :3481 after 3481
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :3481 after 3481
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :3481 after 3481
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :3481 after 3481
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :3481 after 3481
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :3481 after 3481
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :3481 after 3481
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :3481 after 3481
[2024-05-21 01:40:31] [INFO ] Deduced a trap composed of 88 places in 5185 ms of which 23 ms to minimize.
SMT process timed out in 47785ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 3962 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3962/3962 places, 14582/14582 transitions.
Applied a total of 0 rules in 715 ms. Remains 3962 /3962 variables (removed 0) and now considering 14582/14582 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 715 ms. Remains : 3962/3962 places, 14582/14582 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3962/3962 places, 14582/14582 transitions.
Applied a total of 0 rules in 711 ms. Remains 3962 /3962 variables (removed 0) and now considering 14582/14582 (removed 0) transitions.
[2024-05-21 01:40:32] [INFO ] Invariant cache hit.
[2024-05-21 01:40:38] [INFO ] Implicit Places using invariants in 6388 ms returned []
Implicit Place search using SMT only with invariants took 6389 ms to find 0 implicit places.
Running 14522 sub problems to find dead transitions.
[2024-05-21 01:40:39] [INFO ] Invariant cache hit.
[2024-05-21 01:40:39] [INFO ] State equation strengthened by 14402 read => feed constraints.
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :3481 after 2.37651e+06
Detected timeout of ITS tools.
At refinement iteration 0 (INCLUDED_ONLY) 0/3961 variables, 60/60 constraints. Problems are: Problem set: 0 solved, 14522 unsolved
SMT process timed out in 55989ms, After SMT, problems are : Problem set: 0 solved, 14522 unsolved
Search for dead transitions found 0 dead transitions in 56117ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63238 ms. Remains : 3962/3962 places, 14582/14582 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[1] Max Struct:[60]
Ending property specific reduction for CANInsertWithFailure-PT-060-UpperBounds-01 in 345309 ms.
Starting property specific reduction for CANInsertWithFailure-PT-060-UpperBounds-03
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[60]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[60]
// Phase 1: matrix 14587 rows 3967 cols
[2024-05-21 01:41:35] [INFO ] Computed 62 invariants in 564 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[60]
RANDOM walk for 10000 steps (36 resets) in 184 ms. (54 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 18 ms. (526 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[60]
[2024-05-21 01:41:35] [INFO ] Invariant cache hit.
[2024-05-21 01:41:36] [INFO ] [Real]Absence check using 60 positive place invariants in 65 ms returned sat
[2024-05-21 01:41:36] [INFO ] [Real]Absence check using 60 positive and 2 generalized place invariants in 31 ms returned sat
[2024-05-21 01:41:39] [INFO ] [Real]Absence check using state equation in 3329 ms returned sat
[2024-05-21 01:41:40] [INFO ] State equation strengthened by 14384 read => feed constraints.
[2024-05-21 01:41:40] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-21 01:41:40] [INFO ] [Real]Added 14384 Read/Feed constraints in 801 ms returned unknown
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[60]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[60]
Support contains 1 out of 3967 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3967/3967 places, 14587/14587 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 4 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 3963 transition count 14583
Partial Free-agglomeration rule applied 9 times.
Drop transitions (Partial Free agglomeration) removed 9 transitions
Iterating global reduction 0 with 9 rules applied. Total rules applied 17 place count 3963 transition count 14583
Applied a total of 17 rules in 2004 ms. Remains 3963 /3967 variables (removed 4) and now considering 14583/14587 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2004 ms. Remains : 3963/3967 places, 14583/14587 transitions.
// Phase 1: matrix 14583 rows 3963 cols
[2024-05-21 01:41:43] [INFO ] Computed 62 invariants in 508 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[60]
RANDOM walk for 1000000 steps (3637 resets) in 18812 ms. (53 steps per ms)
BEST_FIRST walk for 1000001 steps (46 resets) in 1690 ms. (591 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[60]
[2024-05-21 01:42:03] [INFO ] Invariant cache hit.
[2024-05-21 01:42:04] [INFO ] [Real]Absence check using 60 positive place invariants in 62 ms returned sat
[2024-05-21 01:42:04] [INFO ] [Real]Absence check using 60 positive and 2 generalized place invariants in 32 ms returned sat
[2024-05-21 01:42:07] [INFO ] [Real]Absence check using state equation in 3272 ms returned sat
[2024-05-21 01:42:08] [INFO ] State equation strengthened by 14401 read => feed constraints.
[2024-05-21 01:42:09] [INFO ] [Real]Added 14401 Read/Feed constraints in 1640 ms returned sat
[2024-05-21 01:42:10] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 01:42:10] [INFO ] [Nat]Absence check using 60 positive place invariants in 73 ms returned sat
[2024-05-21 01:42:10] [INFO ] [Nat]Absence check using 60 positive and 2 generalized place invariants in 30 ms returned sat
[2024-05-21 01:42:13] [INFO ] [Nat]Absence check using state equation in 3370 ms returned sat
[2024-05-21 01:42:15] [INFO ] [Nat]Added 14401 Read/Feed constraints in 1901 ms returned sat
[2024-05-21 01:42:16] [INFO ] Computed and/alt/rep : 10629/28278/10629 causal constraints (skipped 3894 transitions) in 764 ms.
Minimization took 6066 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[60]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[60]
Support contains 1 out of 3963 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3963/3963 places, 14583/14583 transitions.
Applied a total of 0 rules in 721 ms. Remains 3963 /3963 variables (removed 0) and now considering 14583/14583 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 721 ms. Remains : 3963/3963 places, 14583/14583 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3963/3963 places, 14583/14583 transitions.
Applied a total of 0 rules in 720 ms. Remains 3963 /3963 variables (removed 0) and now considering 14583/14583 (removed 0) transitions.
[2024-05-21 01:42:24] [INFO ] Invariant cache hit.
[2024-05-21 01:42:30] [INFO ] Implicit Places using invariants in 6507 ms returned []
Implicit Place search using SMT only with invariants took 6508 ms to find 0 implicit places.
Running 14523 sub problems to find dead transitions.
[2024-05-21 01:42:30] [INFO ] Invariant cache hit.
[2024-05-21 01:42:31] [INFO ] State equation strengthened by 14401 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3962 variables, 60/60 constraints. Problems are: Problem set: 0 solved, 14523 unsolved
SMT process timed out in 57446ms, After SMT, problems are : Problem set: 0 solved, 14523 unsolved
Search for dead transitions found 0 dead transitions in 57566ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64812 ms. Remains : 3963/3963 places, 14583/14583 transitions.
RANDOM walk for 40000 steps (144 resets) in 1146 ms. (34 steps per ms) remains 2/2 properties
[2024-05-21 01:43:28] [INFO ] Flatten gal took : 368 ms
BEST_FIRST walk for 40004 steps (8 resets) in 92 ms. (430 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 106 ms. (373 steps per ms) remains 2/2 properties
[2024-05-21 01:43:29] [INFO ] Flatten gal took : 339 ms
[2024-05-21 01:43:29] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13385950146262023259.gal : 51 ms
[2024-05-21 01:43:29] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11214225409319820648.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.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality13385950146262023259.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11214225409319820648.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
Loading property file /tmp/ReachabilityCardinality11214225409319820648.prop.
Interrupted probabilistic random walk after 60336 steps, run timeout after 3001 ms. (steps per millisecond=20 ) properties seen :0 out of 2
Probabilistic random walk after 60336 steps, saw 30426 distinct states, run finished after 3001 ms. (steps per millisecond=20 ) properties seen :0
[2024-05-21 01:43:31] [INFO ] Invariant cache hit.
[2024-05-21 01:43:32] [INFO ] State equation strengthened by 14401 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 3840/3841 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 01:43:32] [INFO ] Deduced a trap composed of 2 places in 88 ms of which 1 ms to minimize.
Problem MAX0 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/3841 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/3841 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 118/3959 variables, 59/61 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3959 variables, 0/61 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/3961 variables, 2/63 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-21 01:43:38] [INFO ] Deduced a trap composed of 77 places in 5712 ms of which 27 ms to minimize.
SMT process timed out in 6951ms, After SMT, problems are : Problem set: 1 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 3963 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3963/3963 places, 14583/14583 transitions.
Applied a total of 0 rules in 708 ms. Remains 3963 /3963 variables (removed 0) and now considering 14583/14583 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 708 ms. Remains : 3963/3963 places, 14583/14583 transitions.
RANDOM walk for 40000 steps (145 resets) in 1112 ms. (35 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 103 ms. (384 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 62669 steps, run timeout after 3001 ms. (steps per millisecond=20 ) properties seen :0 out of 1
Probabilistic random walk after 62669 steps, saw 30737 distinct states, run finished after 3001 ms. (steps per millisecond=20 ) properties seen :0
[2024-05-21 01:43:42] [INFO ] Invariant cache hit.
[2024-05-21 01:43:43] [INFO ] State equation strengthened by 14401 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3840/3841 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 01:43:43] [INFO ] Deduced a trap composed of 2 places in 86 ms of which 1 ms to minimize.
[2024-05-21 01:43:43] [INFO ] Deduced a trap composed of 2 places in 86 ms of which 1 ms to minimize.
[2024-05-21 01:43:43] [INFO ] Deduced a trap composed of 2 places in 83 ms of which 1 ms to minimize.
[2024-05-21 01:43:44] [INFO ] Deduced a trap composed of 2 places in 87 ms of which 1 ms to minimize.
[2024-05-21 01:43:44] [INFO ] Deduced a trap composed of 2 places in 85 ms of which 1 ms to minimize.
[2024-05-21 01:43:44] [INFO ] Deduced a trap composed of 2 places in 83 ms of which 1 ms to minimize.
[2024-05-21 01:43:44] [INFO ] Deduced a trap composed of 2 places in 82 ms of which 1 ms to minimize.
[2024-05-21 01:43:44] [INFO ] Deduced a trap composed of 2 places in 84 ms of which 1 ms to minimize.
[2024-05-21 01:43:44] [INFO ] Deduced a trap composed of 2 places in 83 ms of which 1 ms to minimize.
[2024-05-21 01:43:44] [INFO ] Deduced a trap composed of 2 places in 82 ms of which 1 ms to minimize.
[2024-05-21 01:43:44] [INFO ] Deduced a trap composed of 2 places in 84 ms of which 1 ms to minimize.
[2024-05-21 01:43:45] [INFO ] Deduced a trap composed of 2 places in 83 ms of which 1 ms to minimize.
[2024-05-21 01:43:45] [INFO ] Deduced a trap composed of 2 places in 81 ms of which 1 ms to minimize.
[2024-05-21 01:43:45] [INFO ] Deduced a trap composed of 2 places in 84 ms of which 1 ms to minimize.
[2024-05-21 01:43:45] [INFO ] Deduced a trap composed of 2 places in 83 ms of which 1 ms to minimize.
[2024-05-21 01:43:45] [INFO ] Deduced a trap composed of 2 places in 81 ms of which 0 ms to minimize.
[2024-05-21 01:43:45] [INFO ] Deduced a trap composed of 2 places in 84 ms of which 1 ms to minimize.
[2024-05-21 01:43:45] [INFO ] Deduced a trap composed of 2 places in 84 ms of which 1 ms to minimize.
[2024-05-21 01:43:46] [INFO ] Deduced a trap composed of 2 places in 83 ms of which 1 ms to minimize.
[2024-05-21 01:43:46] [INFO ] Deduced a trap composed of 2 places in 84 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/3841 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 01:43:46] [INFO ] Deduced a trap composed of 2 places in 81 ms of which 1 ms to minimize.
[2024-05-21 01:43:46] [INFO ] Deduced a trap composed of 2 places in 77 ms of which 1 ms to minimize.
[2024-05-21 01:43:46] [INFO ] Deduced a trap composed of 2 places in 80 ms of which 0 ms to minimize.
[2024-05-21 01:43:46] [INFO ] Deduced a trap composed of 2 places in 82 ms of which 1 ms to minimize.
[2024-05-21 01:43:46] [INFO ] Deduced a trap composed of 2 places in 82 ms of which 0 ms to minimize.
[2024-05-21 01:43:46] [INFO ] Deduced a trap composed of 2 places in 80 ms of which 1 ms to minimize.
[2024-05-21 01:43:47] [INFO ] Deduced a trap composed of 2 places in 81 ms of which 1 ms to minimize.
[2024-05-21 01:43:47] [INFO ] Deduced a trap composed of 2 places in 76 ms of which 1 ms to minimize.
[2024-05-21 01:43:47] [INFO ] Deduced a trap composed of 2 places in 80 ms of which 1 ms to minimize.
[2024-05-21 01:43:47] [INFO ] Deduced a trap composed of 2 places in 79 ms of which 0 ms to minimize.
[2024-05-21 01:43:47] [INFO ] Deduced a trap composed of 2 places in 79 ms of which 1 ms to minimize.
[2024-05-21 01:43:47] [INFO ] Deduced a trap composed of 2 places in 80 ms of which 1 ms to minimize.
[2024-05-21 01:43:47] [INFO ] Deduced a trap composed of 2 places in 80 ms of which 1 ms to minimize.
[2024-05-21 01:43:47] [INFO ] Deduced a trap composed of 2 places in 79 ms of which 1 ms to minimize.
[2024-05-21 01:43:48] [INFO ] Deduced a trap composed of 2 places in 77 ms of which 1 ms to minimize.
[2024-05-21 01:43:48] [INFO ] Deduced a trap composed of 2 places in 82 ms of which 2 ms to minimize.
[2024-05-21 01:43:48] [INFO ] Deduced a trap composed of 2 places in 77 ms of which 1 ms to minimize.
[2024-05-21 01:43:48] [INFO ] Deduced a trap composed of 2 places in 77 ms of which 1 ms to minimize.
[2024-05-21 01:43:48] [INFO ] Deduced a trap composed of 2 places in 75 ms of which 1 ms to minimize.
[2024-05-21 01:43:48] [INFO ] Deduced a trap composed of 2 places in 76 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/3841 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 01:43:48] [INFO ] Deduced a trap composed of 2 places in 79 ms of which 1 ms to minimize.
[2024-05-21 01:43:49] [INFO ] Deduced a trap composed of 2 places in 76 ms of which 1 ms to minimize.
[2024-05-21 01:43:49] [INFO ] Deduced a trap composed of 2 places in 78 ms of which 1 ms to minimize.
[2024-05-21 01:43:49] [INFO ] Deduced a trap composed of 2 places in 77 ms of which 0 ms to minimize.
[2024-05-21 01:43:49] [INFO ] Deduced a trap composed of 2 places in 77 ms of which 1 ms to minimize.
[2024-05-21 01:43:49] [INFO ] Deduced a trap composed of 2 places in 75 ms of which 1 ms to minimize.
[2024-05-21 01:43:49] [INFO ] Deduced a trap composed of 2 places in 74 ms of which 1 ms to minimize.
[2024-05-21 01:43:49] [INFO ] Deduced a trap composed of 2 places in 72 ms of which 1 ms to minimize.
[2024-05-21 01:43:49] [INFO ] Deduced a trap composed of 2 places in 77 ms of which 1 ms to minimize.
[2024-05-21 01:43:50] [INFO ] Deduced a trap composed of 2 places in 75 ms of which 0 ms to minimize.
[2024-05-21 01:43:50] [INFO ] Deduced a trap composed of 2 places in 74 ms of which 0 ms to minimize.
[2024-05-21 01:43:50] [INFO ] Deduced a trap composed of 2 places in 69 ms of which 1 ms to minimize.
[2024-05-21 01:43:50] [INFO ] Deduced a trap composed of 2 places in 70 ms of which 1 ms to minimize.
[2024-05-21 01:43:50] [INFO ] Deduced a trap composed of 2 places in 74 ms of which 0 ms to minimize.
[2024-05-21 01:43:50] [INFO ] Deduced a trap composed of 2 places in 73 ms of which 1 ms to minimize.
[2024-05-21 01:43:50] [INFO ] Deduced a trap composed of 2 places in 71 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/3841 variables, 16/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3841 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 118/3959 variables, 59/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3959 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 2/3961 variables, 2/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3961 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 14583/18544 variables, 3961/4079 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 18544/18546 variables, and 18480 constraints, problems are : Problem set: 0 solved, 1 unsolved in 17384 ms.
Refiners :[Positive P Invariants (semi-flows): 60/60 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 3961/3963 constraints, ReadFeed: 14401/14401 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 56/56 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3840/3841 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3841 variables, 56/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 01:44:01] [INFO ] Deduced a trap composed of 2 places in 73 ms of which 2 ms to minimize.
[2024-05-21 01:44:01] [INFO ] Deduced a trap composed of 2 places in 67 ms of which 1 ms to minimize.
[2024-05-21 01:44:01] [INFO ] Deduced a trap composed of 2 places in 72 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/3841 variables, 3/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3841 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 118/3959 variables, 59/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3959 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/3961 variables, 2/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 01:44:07] [INFO ] Deduced a trap composed of 80 places in 5514 ms of which 26 ms to minimize.
[2024-05-21 01:44:12] [INFO ] Deduced a trap composed of 66 places in 5423 ms of which 26 ms to minimize.
[2024-05-21 01:44:18] [INFO ] Deduced a trap composed of 72 places in 5600 ms of which 26 ms to minimize.
Detected timeout of ITS tools.
[2024-05-21 01:44:19] [INFO ] Flatten gal took : 260 ms
[2024-05-21 01:44:19] [INFO ] Applying decomposition
[2024-05-21 01:44:19] [INFO ] Flatten gal took : 274 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph8863506919538052220.txt' '-o' '/tmp/graph8863506919538052220.bin' '-w' '/tmp/graph8863506919538052220.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8863506919538052220.bin' '-l' '-1' '-v' '-w' '/tmp/graph8863506919538052220.weights' '-q' '0' '-e' '0.001'
[2024-05-21 01:44:20] [INFO ] Decomposing Gal with order
[2024-05-21 01:44:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 01:44:21] [INFO ] Removed a total of 11040 redundant transitions.
[2024-05-21 01:44:21] [INFO ] Flatten gal took : 911 ms
[2024-05-21 01:44:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 14099 labels/synchronizations in 874 ms.
[2024-05-21 01:44:22] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6141533282311200385.gal : 89 ms
[2024-05-21 01:44:22] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9338441785013260876.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality6141533282311200385.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9338441785013260876.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...307
[2024-05-21 01:44:24] [INFO ] Deduced a trap composed of 100 places in 5521 ms of which 26 ms to minimize.
Loading property file /tmp/ReachabilityCardinality9338441785013260876.prop.
[2024-05-21 01:44:29] [INFO ] Deduced a trap composed of 65 places in 5258 ms of which 22 ms to minimize.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 176
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :176 after 176
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :176 after 176
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :176 after 176
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :176 after 176
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :176 after 176
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :176 after 176
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :176 after 176
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :176 after 176
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :176 after 176
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :176 after 176
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :176 after 176
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :176 after 176
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :176 after 30047
[2024-05-21 01:44:34] [INFO ] Deduced a trap composed of 68 places in 5124 ms of which 24 ms to minimize.
[2024-05-21 01:44:39] [INFO ] Deduced a trap composed of 90 places in 5236 ms of which 23 ms to minimize.
[2024-05-21 01:44:45] [INFO ] Deduced a trap composed of 83 places in 5609 ms of which 25 ms to minimize.
SMT process timed out in 62672ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 3963 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3963/3963 places, 14583/14583 transitions.
Applied a total of 0 rules in 726 ms. Remains 3963 /3963 variables (removed 0) and now considering 14583/14583 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 726 ms. Remains : 3963/3963 places, 14583/14583 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3963/3963 places, 14583/14583 transitions.
Applied a total of 0 rules in 732 ms. Remains 3963 /3963 variables (removed 0) and now considering 14583/14583 (removed 0) transitions.
[2024-05-21 01:44:47] [INFO ] Invariant cache hit.
[2024-05-21 01:44:53] [INFO ] Implicit Places using invariants in 6622 ms returned []
Implicit Place search using SMT only with invariants took 6623 ms to find 0 implicit places.
Running 14523 sub problems to find dead transitions.
[2024-05-21 01:44:53] [INFO ] Invariant cache hit.
[2024-05-21 01:44:53] [INFO ] State equation strengthened by 14401 read => feed constraints.
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :30047 after 5.30795e+06
Detected timeout of ITS tools.
At refinement iteration 0 (INCLUDED_ONLY) 0/3962 variables, 60/60 constraints. Problems are: Problem set: 0 solved, 14523 unsolved
SMT process timed out in 55852ms, After SMT, problems are : Problem set: 0 solved, 14523 unsolved
Search for dead transitions found 0 dead transitions in 55971ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63345 ms. Remains : 3963/3963 places, 14583/14583 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[1] Max Struct:[60]
Ending property specific reduction for CANInsertWithFailure-PT-060-UpperBounds-03 in 254612 ms.
Starting property specific reduction for CANInsertWithFailure-PT-060-UpperBounds-04
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[60]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[60]
// Phase 1: matrix 14587 rows 3967 cols
[2024-05-21 01:45:50] [INFO ] Computed 62 invariants in 523 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[60]
RANDOM walk for 10000 steps (35 resets) in 227 ms. (43 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 18 ms. (526 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[60]
[2024-05-21 01:45:50] [INFO ] Invariant cache hit.
[2024-05-21 01:45:50] [INFO ] [Real]Absence check using 60 positive place invariants in 70 ms returned sat
[2024-05-21 01:45:51] [INFO ] [Real]Absence check using 60 positive and 2 generalized place invariants in 34 ms returned sat
[2024-05-21 01:45:54] [INFO ] [Real]Absence check using state equation in 3429 ms returned sat
[2024-05-21 01:45:54] [INFO ] State equation strengthened by 14384 read => feed constraints.
[2024-05-21 01:45:55] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:860)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2249)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:929)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[60]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[60]
Support contains 1 out of 3967 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3967/3967 places, 14587/14587 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 3963 transition count 14583
Partial Free-agglomeration rule applied 9 times.
Drop transitions (Partial Free agglomeration) removed 9 transitions
Iterating global reduction 0 with 9 rules applied. Total rules applied 17 place count 3963 transition count 14583
Applied a total of 17 rules in 2028 ms. Remains 3963 /3967 variables (removed 4) and now considering 14583/14587 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2028 ms. Remains : 3963/3967 places, 14583/14587 transitions.
// Phase 1: matrix 14583 rows 3963 cols
[2024-05-21 01:45:58] [INFO ] Computed 62 invariants in 533 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[60]
RANDOM walk for 1000000 steps (3643 resets) in 18693 ms. (53 steps per ms)
BEST_FIRST walk for 1000001 steps (47 resets) in 1693 ms. (590 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[60]
[2024-05-21 01:46:18] [INFO ] Invariant cache hit.
[2024-05-21 01:46:18] [INFO ] [Real]Absence check using 60 positive place invariants in 66 ms returned sat
[2024-05-21 01:46:18] [INFO ] [Real]Absence check using 60 positive and 2 generalized place invariants in 31 ms returned sat
[2024-05-21 01:46:22] [INFO ] [Real]Absence check using state equation in 3420 ms returned sat
[2024-05-21 01:46:22] [INFO ] State equation strengthened by 14401 read => feed constraints.
[2024-05-21 01:46:24] [INFO ] [Real]Added 14401 Read/Feed constraints in 1325 ms returned sat
[2024-05-21 01:46:24] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 01:46:24] [INFO ] [Nat]Absence check using 60 positive place invariants in 74 ms returned sat
[2024-05-21 01:46:24] [INFO ] [Nat]Absence check using 60 positive and 2 generalized place invariants in 33 ms returned sat
[2024-05-21 01:46:28] [INFO ] [Nat]Absence check using state equation in 3501 ms returned sat
[2024-05-21 01:46:29] [INFO ] [Nat]Added 14401 Read/Feed constraints in 1481 ms returned sat
[2024-05-21 01:46:31] [INFO ] Computed and/alt/rep : 10629/28278/10629 causal constraints (skipped 3894 transitions) in 941 ms.
Minimization took 6123 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[60]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[60]
Support contains 1 out of 3963 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3963/3963 places, 14583/14583 transitions.
Applied a total of 0 rules in 747 ms. Remains 3963 /3963 variables (removed 0) and now considering 14583/14583 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 747 ms. Remains : 3963/3963 places, 14583/14583 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3963/3963 places, 14583/14583 transitions.
Applied a total of 0 rules in 742 ms. Remains 3963 /3963 variables (removed 0) and now considering 14583/14583 (removed 0) transitions.
[2024-05-21 01:46:38] [INFO ] Invariant cache hit.
[2024-05-21 01:46:45] [INFO ] Implicit Places using invariants in 6764 ms returned []
Implicit Place search using SMT only with invariants took 6764 ms to find 0 implicit places.
Running 14523 sub problems to find dead transitions.
[2024-05-21 01:46:45] [INFO ] Invariant cache hit.
[2024-05-21 01:46:45] [INFO ] State equation strengthened by 14401 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3962 variables, 60/60 constraints. Problems are: Problem set: 0 solved, 14523 unsolved
SMT process timed out in 56969ms, After SMT, problems are : Problem set: 0 solved, 14523 unsolved
Search for dead transitions found 0 dead transitions in 57111ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64641 ms. Remains : 3963/3963 places, 14583/14583 transitions.
[2024-05-21 01:47:42] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[60]
RANDOM walk for 1000000 steps (3639 resets) in 19340 ms. (51 steps per ms)
BEST_FIRST walk for 1000001 steps (47 resets) in 1733 ms. (576 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[60]
[2024-05-21 01:48:03] [INFO ] Invariant cache hit.
[2024-05-21 01:48:04] [INFO ] [Real]Absence check using 60 positive place invariants in 66 ms returned sat
[2024-05-21 01:48:04] [INFO ] [Real]Absence check using 60 positive and 2 generalized place invariants in 32 ms returned sat
[2024-05-21 01:48:07] [INFO ] [Real]Absence check using state equation in 3423 ms returned sat
[2024-05-21 01:48:08] [INFO ] State equation strengthened by 14401 read => feed constraints.
[2024-05-21 01:48:09] [INFO ] [Real]Added 14401 Read/Feed constraints in 1373 ms returned sat
[2024-05-21 01:48:09] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 01:48:10] [INFO ] [Nat]Absence check using 60 positive place invariants in 75 ms returned sat
[2024-05-21 01:48:10] [INFO ] [Nat]Absence check using 60 positive and 2 generalized place invariants in 31 ms returned sat
[2024-05-21 01:48:13] [INFO ] [Nat]Absence check using state equation in 3670 ms returned sat
[2024-05-21 01:48:15] [INFO ] [Nat]Added 14401 Read/Feed constraints in 1557 ms returned sat
[2024-05-21 01:48:16] [INFO ] Computed and/alt/rep : 10629/28278/10629 causal constraints (skipped 3894 transitions) in 843 ms.
Minimization took 6252 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[60]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[60]
Support contains 1 out of 3963 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3963/3963 places, 14583/14583 transitions.
Applied a total of 0 rules in 781 ms. Remains 3963 /3963 variables (removed 0) and now considering 14583/14583 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 781 ms. Remains : 3963/3963 places, 14583/14583 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3963/3963 places, 14583/14583 transitions.
Applied a total of 0 rules in 737 ms. Remains 3963 /3963 variables (removed 0) and now considering 14583/14583 (removed 0) transitions.
[2024-05-21 01:48:24] [INFO ] Invariant cache hit.
[2024-05-21 01:48:31] [INFO ] Implicit Places using invariants in 6573 ms returned []
Implicit Place search using SMT only with invariants took 6573 ms to find 0 implicit places.
Running 14523 sub problems to find dead transitions.
[2024-05-21 01:48:31] [INFO ] Invariant cache hit.
[2024-05-21 01:48:31] [INFO ] State equation strengthened by 14401 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3962 variables, 60/60 constraints. Problems are: Problem set: 0 solved, 14523 unsolved
SMT process timed out in 60868ms, After SMT, problems are : Problem set: 0 solved, 14523 unsolved
Search for dead transitions found 0 dead transitions in 61019ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 68347 ms. Remains : 3963/3963 places, 14583/14583 transitions.
RANDOM walk for 40000 steps (145 resets) in 1135 ms. (35 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 99 ms. (400 steps per ms) remains 2/2 properties
[2024-05-21 01:49:32] [INFO ] Flatten gal took : 425 ms
BEST_FIRST walk for 40004 steps (8 resets) in 147 ms. (270 steps per ms) remains 2/2 properties
[2024-05-21 01:49:32] [INFO ] Flatten gal took : 359 ms
[2024-05-21 01:49:33] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9546435842061590022.gal : 83 ms
[2024-05-21 01:49:33] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14982215975389604838.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality9546435842061590022.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14982215975389604838.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality14982215975389604838.prop.
Interrupted probabilistic random walk after 58175 steps, run timeout after 3001 ms. (steps per millisecond=19 ) properties seen :0 out of 2
Probabilistic random walk after 58175 steps, saw 30137 distinct states, run finished after 3003 ms. (steps per millisecond=19 ) properties seen :0
[2024-05-21 01:49:35] [INFO ] Invariant cache hit.
[2024-05-21 01:49:35] [INFO ] State equation strengthened by 14401 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 3840/3841 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 01:49:36] [INFO ] Deduced a trap composed of 2 places in 86 ms of which 1 ms to minimize.
Problem MAX0 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/3841 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/3841 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 118/3959 variables, 59/61 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3959 variables, 0/61 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/3961 variables, 2/63 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-21 01:49:42] [INFO ] Deduced a trap composed of 67 places in 5399 ms of which 25 ms to minimize.
SMT process timed out in 6614ms, After SMT, problems are : Problem set: 1 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 3963 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3963/3963 places, 14583/14583 transitions.
Applied a total of 0 rules in 713 ms. Remains 3963 /3963 variables (removed 0) and now considering 14583/14583 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 713 ms. Remains : 3963/3963 places, 14583/14583 transitions.
RANDOM walk for 40000 steps (144 resets) in 1021 ms. (39 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 140 ms. (283 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 63660 steps, run timeout after 3001 ms. (steps per millisecond=21 ) properties seen :0 out of 1
Probabilistic random walk after 63660 steps, saw 30863 distinct states, run finished after 3001 ms. (steps per millisecond=21 ) properties seen :0
[2024-05-21 01:49:46] [INFO ] Invariant cache hit.
[2024-05-21 01:49:46] [INFO ] State equation strengthened by 14401 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3840/3841 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 01:49:46] [INFO ] Deduced a trap composed of 2 places in 85 ms of which 1 ms to minimize.
[2024-05-21 01:49:47] [INFO ] Deduced a trap composed of 2 places in 99 ms of which 1 ms to minimize.
[2024-05-21 01:49:47] [INFO ] Deduced a trap composed of 2 places in 83 ms of which 1 ms to minimize.
[2024-05-21 01:49:47] [INFO ] Deduced a trap composed of 2 places in 74 ms of which 1 ms to minimize.
[2024-05-21 01:49:47] [INFO ] Deduced a trap composed of 2 places in 84 ms of which 1 ms to minimize.
[2024-05-21 01:49:47] [INFO ] Deduced a trap composed of 2 places in 80 ms of which 0 ms to minimize.
[2024-05-21 01:49:47] [INFO ] Deduced a trap composed of 2 places in 80 ms of which 1 ms to minimize.
[2024-05-21 01:49:47] [INFO ] Deduced a trap composed of 2 places in 81 ms of which 1 ms to minimize.
[2024-05-21 01:49:48] [INFO ] Deduced a trap composed of 2 places in 81 ms of which 1 ms to minimize.
[2024-05-21 01:49:48] [INFO ] Deduced a trap composed of 2 places in 80 ms of which 0 ms to minimize.
[2024-05-21 01:49:48] [INFO ] Deduced a trap composed of 2 places in 81 ms of which 1 ms to minimize.
[2024-05-21 01:49:48] [INFO ] Deduced a trap composed of 2 places in 81 ms of which 1 ms to minimize.
[2024-05-21 01:49:48] [INFO ] Deduced a trap composed of 2 places in 75 ms of which 1 ms to minimize.
[2024-05-21 01:49:48] [INFO ] Deduced a trap composed of 2 places in 79 ms of which 1 ms to minimize.
[2024-05-21 01:49:48] [INFO ] Deduced a trap composed of 2 places in 75 ms of which 1 ms to minimize.
[2024-05-21 01:49:48] [INFO ] Deduced a trap composed of 2 places in 73 ms of which 1 ms to minimize.
[2024-05-21 01:49:48] [INFO ] Deduced a trap composed of 2 places in 77 ms of which 1 ms to minimize.
[2024-05-21 01:49:49] [INFO ] Deduced a trap composed of 2 places in 77 ms of which 1 ms to minimize.
[2024-05-21 01:49:49] [INFO ] Deduced a trap composed of 2 places in 74 ms of which 1 ms to minimize.
[2024-05-21 01:49:49] [INFO ] Deduced a trap composed of 2 places in 71 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/3841 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 01:49:49] [INFO ] Deduced a trap composed of 2 places in 77 ms of which 1 ms to minimize.
[2024-05-21 01:49:49] [INFO ] Deduced a trap composed of 2 places in 75 ms of which 1 ms to minimize.
[2024-05-21 01:49:49] [INFO ] Deduced a trap composed of 2 places in 75 ms of which 1 ms to minimize.
[2024-05-21 01:49:49] [INFO ] Deduced a trap composed of 2 places in 75 ms of which 1 ms to minimize.
[2024-05-21 01:49:49] [INFO ] Deduced a trap composed of 2 places in 74 ms of which 1 ms to minimize.
[2024-05-21 01:49:50] [INFO ] Deduced a trap composed of 2 places in 73 ms of which 1 ms to minimize.
[2024-05-21 01:49:50] [INFO ] Deduced a trap composed of 2 places in 76 ms of which 1 ms to minimize.
[2024-05-21 01:49:50] [INFO ] Deduced a trap composed of 2 places in 73 ms of which 1 ms to minimize.
[2024-05-21 01:49:50] [INFO ] Deduced a trap composed of 2 places in 69 ms of which 0 ms to minimize.
[2024-05-21 01:49:50] [INFO ] Deduced a trap composed of 2 places in 76 ms of which 1 ms to minimize.
[2024-05-21 01:49:50] [INFO ] Deduced a trap composed of 2 places in 73 ms of which 0 ms to minimize.
[2024-05-21 01:49:50] [INFO ] Deduced a trap composed of 2 places in 73 ms of which 1 ms to minimize.
[2024-05-21 01:49:50] [INFO ] Deduced a trap composed of 2 places in 68 ms of which 1 ms to minimize.
[2024-05-21 01:49:51] [INFO ] Deduced a trap composed of 2 places in 74 ms of which 1 ms to minimize.
[2024-05-21 01:49:51] [INFO ] Deduced a trap composed of 2 places in 73 ms of which 0 ms to minimize.
[2024-05-21 01:49:51] [INFO ] Deduced a trap composed of 2 places in 75 ms of which 1 ms to minimize.
[2024-05-21 01:49:51] [INFO ] Deduced a trap composed of 2 places in 90 ms of which 1 ms to minimize.
[2024-05-21 01:49:51] [INFO ] Deduced a trap composed of 2 places in 79 ms of which 1 ms to minimize.
[2024-05-21 01:49:51] [INFO ] Deduced a trap composed of 2 places in 82 ms of which 1 ms to minimize.
[2024-05-21 01:49:51] [INFO ] Deduced a trap composed of 2 places in 90 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/3841 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 01:49:51] [INFO ] Deduced a trap composed of 2 places in 77 ms of which 1 ms to minimize.
[2024-05-21 01:49:52] [INFO ] Deduced a trap composed of 2 places in 73 ms of which 1 ms to minimize.
[2024-05-21 01:49:52] [INFO ] Deduced a trap composed of 2 places in 83 ms of which 1 ms to minimize.
[2024-05-21 01:49:52] [INFO ] Deduced a trap composed of 2 places in 77 ms of which 1 ms to minimize.
[2024-05-21 01:49:52] [INFO ] Deduced a trap composed of 2 places in 73 ms of which 1 ms to minimize.
[2024-05-21 01:49:52] [INFO ] Deduced a trap composed of 2 places in 88 ms of which 1 ms to minimize.
[2024-05-21 01:49:53] [INFO ] Deduced a trap composed of 2 places in 392 ms of which 1 ms to minimize.
[2024-05-21 01:49:53] [INFO ] Deduced a trap composed of 2 places in 77 ms of which 1 ms to minimize.
[2024-05-21 01:49:53] [INFO ] Deduced a trap composed of 2 places in 78 ms of which 1 ms to minimize.
[2024-05-21 01:49:53] [INFO ] Deduced a trap composed of 2 places in 80 ms of which 0 ms to minimize.
[2024-05-21 01:49:53] [INFO ] Deduced a trap composed of 2 places in 79 ms of which 1 ms to minimize.
[2024-05-21 01:49:53] [INFO ] Deduced a trap composed of 2 places in 79 ms of which 1 ms to minimize.
[2024-05-21 01:49:53] [INFO ] Deduced a trap composed of 2 places in 73 ms of which 0 ms to minimize.
[2024-05-21 01:49:53] [INFO ] Deduced a trap composed of 2 places in 78 ms of which 1 ms to minimize.
[2024-05-21 01:49:54] [INFO ] Deduced a trap composed of 2 places in 78 ms of which 0 ms to minimize.
[2024-05-21 01:49:54] [INFO ] Deduced a trap composed of 2 places in 78 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/3841 variables, 16/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3841 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 118/3959 variables, 59/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3959 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 2/3961 variables, 2/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3961 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 14583/18544 variables, 3961/4079 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/18544 variables, 14401/18480 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/18544 variables, 0/18480 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 2/18546 variables, 2/18482 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/18546 variables, 0/18482 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/18546 variables, 0/18482 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 18546/18546 variables, and 18482 constraints, problems are : Problem set: 0 solved, 1 unsolved in 16246 ms.
Refiners :[Positive P Invariants (semi-flows): 60/60 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 3963/3963 constraints, ReadFeed: 14401/14401 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 56/56 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3840/3841 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3841 variables, 56/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 01:50:03] [INFO ] Deduced a trap composed of 2 places in 73 ms of which 1 ms to minimize.
[2024-05-21 01:50:03] [INFO ] Deduced a trap composed of 2 places in 74 ms of which 1 ms to minimize.
[2024-05-21 01:50:03] [INFO ] Deduced a trap composed of 2 places in 85 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/3841 variables, 3/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3841 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 118/3959 variables, 59/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3959 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/3961 variables, 2/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 01:50:09] [INFO ] Deduced a trap composed of 66 places in 5316 ms of which 24 ms to minimize.
[2024-05-21 01:50:14] [INFO ] Deduced a trap composed of 65 places in 5349 ms of which 27 ms to minimize.
[2024-05-21 01:50:20] [INFO ] Deduced a trap composed of 100 places in 5583 ms of which 26 ms to minimize.
Detected timeout of ITS tools.
[2024-05-21 01:50:23] [INFO ] Flatten gal took : 272 ms
[2024-05-21 01:50:23] [INFO ] Applying decomposition
[2024-05-21 01:50:23] [INFO ] Flatten gal took : 272 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph8363967523436565459.txt' '-o' '/tmp/graph8363967523436565459.bin' '-w' '/tmp/graph8363967523436565459.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8363967523436565459.bin' '-l' '-1' '-v' '-w' '/tmp/graph8363967523436565459.weights' '-q' '0' '-e' '0.001'
[2024-05-21 01:50:24] [INFO ] Decomposing Gal with order
[2024-05-21 01:50:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 01:50:25] [INFO ] Removed a total of 11038 redundant transitions.
[2024-05-21 01:50:25] [INFO ] Flatten gal took : 989 ms
[2024-05-21 01:50:26] [INFO ] Deduced a trap composed of 107 places in 5691 ms of which 25 ms to minimize.
[2024-05-21 01:50:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 13988 labels/synchronizations in 883 ms.
[2024-05-21 01:50:26] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10460709363426558535.gal : 70 ms
[2024-05-21 01:50:26] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14957847685860410270.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality10460709363426558535.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14957847685860410270.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...309
Loading property file /tmp/ReachabilityCardinality14957847685860410270.prop.
[2024-05-21 01:50:31] [INFO ] Deduced a trap composed of 65 places in 5291 ms of which 25 ms to minimize.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 118
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :118 after 118
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :118 after 118
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :118 after 118
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :118 after 118
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :118 after 118
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :118 after 118
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :118 after 118
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :118 after 118
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :118 after 118
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :118 after 118
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :118 after 118
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :118 after 118
[2024-05-21 01:50:36] [INFO ] Deduced a trap composed of 76 places in 5236 ms of which 26 ms to minimize.
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :118 after 18475
[2024-05-21 01:50:42] [INFO ] Deduced a trap composed of 80 places in 5492 ms of which 25 ms to minimize.
[2024-05-21 01:50:47] [INFO ] Deduced a trap composed of 66 places in 5255 ms of which 25 ms to minimize.
SMT process timed out in 61447ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 3963 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3963/3963 places, 14583/14583 transitions.
Applied a total of 0 rules in 733 ms. Remains 3963 /3963 variables (removed 0) and now considering 14583/14583 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 735 ms. Remains : 3963/3963 places, 14583/14583 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3963/3963 places, 14583/14583 transitions.
Applied a total of 0 rules in 761 ms. Remains 3963 /3963 variables (removed 0) and now considering 14583/14583 (removed 0) transitions.
[2024-05-21 01:50:49] [INFO ] Invariant cache hit.
[2024-05-21 01:50:55] [INFO ] Implicit Places using invariants in 6364 ms returned []
Implicit Place search using SMT only with invariants took 6365 ms to find 0 implicit places.
Running 14523 sub problems to find dead transitions.
[2024-05-21 01:50:55] [INFO ] Invariant cache hit.
[2024-05-21 01:50:55] [INFO ] State equation strengthened by 14401 read => feed constraints.
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :18475 after 49913
Detected timeout of ITS tools.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 1.0)
(s3 0.0)
(s4 1.0)
(s5 1.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 1.0)
(s11 1.0)
(s12 0.0)
(s13 1.0)
(s14 0.0)
(s15 0.0)
(s16 1.0)
(s17 1.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 1.0)
(s23 1.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 1.0)
(s29 1.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 1.0)
(s35 0.0)
(s36 0.0)
(s37 1.0)
(s38 0.0)
(s39 0.0)
(s40 1.0)
(s41 0.0)
(s42 0.0)
(s43 1.0)
(s44 0.0)
(s45 0.0)
(s46 1.0)
(s47 0.0)
(s48 0.0)
(s49 1.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 1.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 1.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 1.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 1.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 1.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 1.0)
(s89 0.0)
(s90 0.0)
(s91 1.0)
(s92 0.0)
(s93 0.0)
(s94 1.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 1.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 1.0)
(s107 0.0)
(s108 0.0)
(s109 1.0)
(s110 0.0)
(s111 0.0)
(s112 1.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 1.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 1.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 1.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 1.0)
(s137 0.0)
(s138 0.0)
(s139 1.0)
(s140 0.0)
(s141 0.0)
(s142 1.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 1.0)
(s149 0.0)
(s150 0.0)
(s151 1.0)
(s152 0.0)
(s153 0.0)
(s154 1.0)
(s155 0.0)
(s156 0.0)
(s157 1.0)
(s158 0.0)
(s159 0.0)
(s160 1.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 1.0)
(s167 0.0)
(s168 0.0)
(s169 1.0)
(s170 0.0)
(s171 0.0)
(s172 1.0)
(s173 0.0)
(s174 0.0)
(s175 1.0)
(s176 0.0)
(s177 0.0)
(s178 1.0)
(s179 0.0)
(s180 0.0)
(s181 1.0)
(s182 0.0)
(s183 0.0)
(s184 1.0)
(s185 0.0)
(s186 0.0)
(s187 1.0)
(s188 0.0)
(s189 0.0)
(s190 1.0)
(s191 0.0)
(s192 0.0)
(s193 1.0)
(s194 0.0)
(s195 0.0)
(s196 1.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 1.0)
(s203 0.0)
(s204 0.0)
(s205 1.0)
(s206 0.0)
(s207 0.0)
(s208 1.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 1.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 1.0)
(s221 0.0)
(s222 0.0)
(s223 1.0)
(s224 0.0)
(s225 0.0)
(s226 1.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 1.0)
(s233 0.0)
(s234 0.0)
(s235 1.0)
(s236 0.0)
(s237 0.0)
(s238 1.0)
(s239 0.0)
(s240 0.0)
(s241 1.0)
(s242 0.0)
(s243 0.0)
(s244 1.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 1.0)
(s251 0.0)
(s252 0.0)
(s253 1.0)
(s254 0.0)
(s255 0.0)
(s256 1.0)
(s257 0.0)
(s258 0.0)
(s259 1.0)
(s260 0.0)
(s261 0.0)
(s262 1.0)
(s263 0.0)
(s264 0.0)
(s265 1.0)
(s266 0.0)
(s267 0.0)
(s268 1.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 1.0)
(s275 0.0)
(s276 0.0)
(s277 1.0)
(s278 0.0)
(s279 0.0)
(s280 1.0)
(s281 0.0)
(s282 0.0)
(s283 1.0)
(s284 0.0)
(s285 0.0)
(s286 1.0)
(s287 0.0)
(s288 0.0)
(s289 1.0)
(s290 0.0)
(s291 0.0)
(s292 1.0)
(s293 0.0)
(s294 0.0)
(s295 1.0)
(s296 0.0)
(s297 0.0)
(s298 1.0)
(s299 0.0)
(s300 0.0)
(s301 1.0)
(s302 0.0)
(s303 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/3962 variables, 60/60 constraints. Problems are: Problem set: 0 solved, 14523 unsolved
SMT process timed out in 58830ms, After SMT, problems are : Problem set: 0 solved, 14523 unsolved
Search for dead transitions found 0 dead transitions in 58959ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66105 ms. Remains : 3963/3963 places, 14583/14583 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[1] Max Struct:[60]
Ending property specific reduction for CANInsertWithFailure-PT-060-UpperBounds-04 in 364888 ms.
Starting property specific reduction for CANInsertWithFailure-PT-060-UpperBounds-05
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[60]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[60]
// Phase 1: matrix 14587 rows 3967 cols
[2024-05-21 01:51:55] [INFO ] Computed 62 invariants in 518 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[60]
RANDOM walk for 10000 steps (36 resets) in 254 ms. (39 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 21 ms. (454 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[60]
[2024-05-21 01:51:55] [INFO ] Invariant cache hit.
[2024-05-21 01:51:55] [INFO ] [Real]Absence check using 60 positive place invariants in 67 ms returned sat
[2024-05-21 01:51:55] [INFO ] [Real]Absence check using 60 positive and 2 generalized place invariants in 30 ms returned sat
[2024-05-21 01:51:59] [INFO ] [Real]Absence check using state equation in 3385 ms returned sat
[2024-05-21 01:51:59] [INFO ] State equation strengthened by 14384 read => feed constraints.
[2024-05-21 01:52:00] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-21 01:52:00] [INFO ] [Real]Added 14384 Read/Feed constraints in 736 ms returned unknown
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[60]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[60]
Support contains 1 out of 3967 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3967/3967 places, 14587/14587 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 3 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 3962 transition count 14582
Partial Free-agglomeration rule applied 8 times.
Drop transitions (Partial Free agglomeration) removed 8 transitions
Iterating global reduction 0 with 8 rules applied. Total rules applied 18 place count 3962 transition count 14582
Applied a total of 18 rules in 1942 ms. Remains 3962 /3967 variables (removed 5) and now considering 14582/14587 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1944 ms. Remains : 3962/3967 places, 14582/14587 transitions.
// Phase 1: matrix 14582 rows 3962 cols
[2024-05-21 01:52:02] [INFO ] Computed 62 invariants in 579 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[60]
RANDOM walk for 1000000 steps (3640 resets) in 18650 ms. (53 steps per ms)
BEST_FIRST walk for 1000001 steps (48 resets) in 1699 ms. (588 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[60]
[2024-05-21 01:52:23] [INFO ] Invariant cache hit.
[2024-05-21 01:52:23] [INFO ] [Real]Absence check using 60 positive place invariants in 65 ms returned sat
[2024-05-21 01:52:23] [INFO ] [Real]Absence check using 60 positive and 2 generalized place invariants in 31 ms returned sat
[2024-05-21 01:52:27] [INFO ] [Real]Absence check using state equation in 3411 ms returned sat
[2024-05-21 01:52:27] [INFO ] State equation strengthened by 14402 read => feed constraints.
[2024-05-21 01:52:28] [INFO ] [Real]Added 14402 Read/Feed constraints in 1261 ms returned sat
[2024-05-21 01:52:29] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 01:52:29] [INFO ] [Nat]Absence check using 60 positive place invariants in 77 ms returned sat
[2024-05-21 01:52:29] [INFO ] [Nat]Absence check using 60 positive and 2 generalized place invariants in 30 ms returned sat
[2024-05-21 01:52:32] [INFO ] [Nat]Absence check using state equation in 3265 ms returned sat
[2024-05-21 01:52:34] [INFO ] [Nat]Added 14402 Read/Feed constraints in 1314 ms returned sat
[2024-05-21 01:52:35] [INFO ] Computed and/alt/rep : 10628/28280/10628 causal constraints (skipped 3894 transitions) in 730 ms.
Minimization took 6501 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[60]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[60]
Support contains 1 out of 3962 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3962/3962 places, 14582/14582 transitions.
Applied a total of 0 rules in 732 ms. Remains 3962 /3962 variables (removed 0) and now considering 14582/14582 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 732 ms. Remains : 3962/3962 places, 14582/14582 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3962/3962 places, 14582/14582 transitions.
Applied a total of 0 rules in 820 ms. Remains 3962 /3962 variables (removed 0) and now considering 14582/14582 (removed 0) transitions.
[2024-05-21 01:52:43] [INFO ] Invariant cache hit.
[2024-05-21 01:52:50] [INFO ] Implicit Places using invariants in 6733 ms returned []
Implicit Place search using SMT only with invariants took 6734 ms to find 0 implicit places.
Running 14522 sub problems to find dead transitions.
[2024-05-21 01:52:50] [INFO ] Invariant cache hit.
[2024-05-21 01:52:50] [INFO ] State equation strengthened by 14402 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3961 variables, 60/60 constraints. Problems are: Problem set: 0 solved, 14522 unsolved
SMT process timed out in 58156ms, After SMT, problems are : Problem set: 0 solved, 14522 unsolved
Search for dead transitions found 0 dead transitions in 58307ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65884 ms. Remains : 3962/3962 places, 14582/14582 transitions.
[2024-05-21 01:53:49] [INFO ] Flatten gal took : 554 ms
RANDOM walk for 40000 steps (144 resets) in 2143 ms. (18 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 99 ms. (400 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 126 ms. (314 steps per ms) remains 2/2 properties
[2024-05-21 01:53:49] [INFO ] Flatten gal took : 329 ms
[2024-05-21 01:53:49] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13517787393403352346.gal : 46 ms
[2024-05-21 01:53:49] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15450162741402082549.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.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality13517787393403352346.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15450162741402082549.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
Loading property file /tmp/ReachabilityCardinality15450162741402082549.prop.
Interrupted probabilistic random walk after 59820 steps, run timeout after 3001 ms. (steps per millisecond=19 ) properties seen :0 out of 2
Probabilistic random walk after 59820 steps, saw 30352 distinct states, run finished after 3001 ms. (steps per millisecond=19 ) properties seen :0
[2024-05-21 01:53:52] [INFO ] Invariant cache hit.
[2024-05-21 01:53:52] [INFO ] State equation strengthened by 14402 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 3839/3840 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 01:53:52] [INFO ] Deduced a trap composed of 2 places in 86 ms of which 2 ms to minimize.
Problem MAX0 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/3840 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/3840 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 118/3958 variables, 59/61 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3958 variables, 0/61 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/3960 variables, 2/63 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-21 01:53:58] [INFO ] Deduced a trap composed of 69 places in 5377 ms of which 25 ms to minimize.
SMT process timed out in 6505ms, After SMT, problems are : Problem set: 1 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 3962 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3962/3962 places, 14582/14582 transitions.
Applied a total of 0 rules in 714 ms. Remains 3962 /3962 variables (removed 0) and now considering 14582/14582 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 715 ms. Remains : 3962/3962 places, 14582/14582 transitions.
RANDOM walk for 40000 steps (144 resets) in 1323 ms. (30 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 159 ms. (250 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 63796 steps, run timeout after 3001 ms. (steps per millisecond=21 ) properties seen :0 out of 1
Probabilistic random walk after 63796 steps, saw 30893 distinct states, run finished after 3002 ms. (steps per millisecond=21 ) properties seen :0
[2024-05-21 01:54:02] [INFO ] Invariant cache hit.
[2024-05-21 01:54:03] [INFO ] State equation strengthened by 14402 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3839/3840 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 01:54:03] [INFO ] Deduced a trap composed of 2 places in 83 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/3840 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/3840 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 118/3958 variables, 59/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3958 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/3960 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 01:54:09] [INFO ] Deduced a trap composed of 66 places in 5239 ms of which 25 ms to minimize.
[2024-05-21 01:54:14] [INFO ] Deduced a trap composed of 69 places in 5143 ms of which 24 ms to minimize.
[2024-05-21 01:54:19] [INFO ] Deduced a trap composed of 73 places in 5047 ms of which 23 ms to minimize.
[2024-05-21 01:54:24] [INFO ] Deduced a trap composed of 72 places in 4968 ms of which 23 ms to minimize.
[2024-05-21 01:54:29] [INFO ] Deduced a trap composed of 73 places in 4843 ms of which 23 ms to minimize.
[2024-05-21 01:54:34] [INFO ] Deduced a trap composed of 68 places in 4793 ms of which 23 ms to minimize.
Detected timeout of ITS tools.
[2024-05-21 01:54:39] [INFO ] Deduced a trap composed of 75 places in 4946 ms of which 24 ms to minimize.
[2024-05-21 01:54:39] [INFO ] Flatten gal took : 261 ms
[2024-05-21 01:54:39] [INFO ] Applying decomposition
[2024-05-21 01:54:40] [INFO ] Flatten gal took : 268 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph17248203160352293212.txt' '-o' '/tmp/graph17248203160352293212.bin' '-w' '/tmp/graph17248203160352293212.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17248203160352293212.bin' '-l' '-1' '-v' '-w' '/tmp/graph17248203160352293212.weights' '-q' '0' '-e' '0.001'
[2024-05-21 01:54:40] [INFO ] Decomposing Gal with order
[2024-05-21 01:54:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 01:54:41] [INFO ] Removed a total of 11039 redundant transitions.
[2024-05-21 01:54:41] [INFO ] Flatten gal took : 922 ms
[2024-05-21 01:54:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 13986 labels/synchronizations in 804 ms.
[2024-05-21 01:54:42] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13234783525069145292.gal : 69 ms
[2024-05-21 01:54:42] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2423899741389271171.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.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality13234783525069145292.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2423899741389271171.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
[2024-05-21 01:54:44] [INFO ] Deduced a trap composed of 69 places in 5086 ms of which 22 ms to minimize.
Loading property file /tmp/ReachabilityCardinality2423899741389271171.prop.
[2024-05-21 01:54:49] [INFO ] Deduced a trap composed of 69 places in 4678 ms of which 22 ms to minimize.
SMT process timed out in 46462ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 3962 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3962/3962 places, 14582/14582 transitions.
Applied a total of 0 rules in 771 ms. Remains 3962 /3962 variables (removed 0) and now considering 14582/14582 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 771 ms. Remains : 3962/3962 places, 14582/14582 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3962/3962 places, 14582/14582 transitions.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 6770
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :6770 after 6770
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :6770 after 6770
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :6770 after 6770
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :6770 after 6770
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :6770 after 6770
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :6770 after 6770
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :6770 after 6770
Applied a total of 0 rules in 747 ms. Remains 3962 /3962 variables (removed 0) and now considering 14582/14582 (removed 0) transitions.
[2024-05-21 01:54:50] [INFO ] Invariant cache hit.
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :6770 after 6770
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :6770 after 6770
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :6770 after 6819
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :6819 after 6838
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :6838 after 6865
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :6865 after 8200
[2024-05-21 01:54:57] [INFO ] Implicit Places using invariants in 6540 ms returned []
Implicit Place search using SMT only with invariants took 6540 ms to find 0 implicit places.
Running 14522 sub problems to find dead transitions.
[2024-05-21 01:54:57] [INFO ] Invariant cache hit.
[2024-05-21 01:54:57] [INFO ] State equation strengthened by 14402 read => feed constraints.
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :8200 after 2.63464e+06
Detected timeout of ITS tools.
At refinement iteration 0 (INCLUDED_ONLY) 0/3961 variables, 60/60 constraints. Problems are: Problem set: 0 solved, 14522 unsolved
SMT process timed out in 61404ms, After SMT, problems are : Problem set: 0 solved, 14522 unsolved
Search for dead transitions found 0 dead transitions in 61593ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 68897 ms. Remains : 3962/3962 places, 14582/14582 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[1] Max Struct:[60]
Ending property specific reduction for CANInsertWithFailure-PT-060-UpperBounds-05 in 244470 ms.
Starting property specific reduction for CANInsertWithFailure-PT-060-UpperBounds-07
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[60]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[60]
// Phase 1: matrix 14587 rows 3967 cols
[2024-05-21 01:55:59] [INFO ] Computed 62 invariants in 542 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[60]
RANDOM walk for 10000 steps (35 resets) in 217 ms. (45 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 19 ms. (500 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[60]
[2024-05-21 01:55:59] [INFO ] Invariant cache hit.
[2024-05-21 01:56:00] [INFO ] [Real]Absence check using 60 positive place invariants in 66 ms returned sat
[2024-05-21 01:56:00] [INFO ] [Real]Absence check using 60 positive and 2 generalized place invariants in 32 ms returned sat
[2024-05-21 01:56:03] [INFO ] [Real]Absence check using state equation in 3683 ms returned sat
[2024-05-21 01:56:04] [INFO ] State equation strengthened by 14384 read => feed constraints.
[2024-05-21 01:56:04] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:860)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2249)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:929)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[60]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[60]
Support contains 1 out of 3967 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3967/3967 places, 14587/14587 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 3 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 3963 transition count 14583
Partial Free-agglomeration rule applied 9 times.
Drop transitions (Partial Free agglomeration) removed 9 transitions
Iterating global reduction 0 with 9 rules applied. Total rules applied 17 place count 3963 transition count 14583
Applied a total of 17 rules in 2021 ms. Remains 3963 /3967 variables (removed 4) and now considering 14583/14587 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2021 ms. Remains : 3963/3967 places, 14583/14587 transitions.
// Phase 1: matrix 14583 rows 3963 cols
[2024-05-21 01:56:07] [INFO ] Computed 62 invariants in 541 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[60]
RANDOM walk for 1000000 steps (3637 resets) in 22221 ms. (45 steps per ms)
BEST_FIRST walk for 1000001 steps (48 resets) in 1924 ms. (519 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[60]
[2024-05-21 01:56:31] [INFO ] Invariant cache hit.
[2024-05-21 01:56:32] [INFO ] [Real]Absence check using 60 positive place invariants in 69 ms returned sat
[2024-05-21 01:56:32] [INFO ] [Real]Absence check using 60 positive and 2 generalized place invariants in 32 ms returned sat
[2024-05-21 01:56:35] [INFO ] [Real]Absence check using state equation in 3618 ms returned sat
[2024-05-21 01:56:36] [INFO ] State equation strengthened by 14401 read => feed constraints.
[2024-05-21 01:56:37] [INFO ] [Real]Added 14401 Read/Feed constraints in 1404 ms returned sat
[2024-05-21 01:56:37] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 01:56:38] [INFO ] [Nat]Absence check using 60 positive place invariants in 78 ms returned sat
[2024-05-21 01:56:38] [INFO ] [Nat]Absence check using 60 positive and 2 generalized place invariants in 32 ms returned sat
[2024-05-21 01:56:42] [INFO ] [Nat]Absence check using state equation in 3586 ms returned sat
[2024-05-21 01:56:43] [INFO ] [Nat]Added 14401 Read/Feed constraints in 1794 ms returned sat
[2024-05-21 01:56:45] [INFO ] Computed and/alt/rep : 10629/28278/10629 causal constraints (skipped 3894 transitions) in 866 ms.
Minimization took 6603 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[60]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[60]
Support contains 1 out of 3963 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3963/3963 places, 14583/14583 transitions.
Applied a total of 0 rules in 785 ms. Remains 3963 /3963 variables (removed 0) and now considering 14583/14583 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 786 ms. Remains : 3963/3963 places, 14583/14583 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3963/3963 places, 14583/14583 transitions.
Applied a total of 0 rules in 778 ms. Remains 3963 /3963 variables (removed 0) and now considering 14583/14583 (removed 0) transitions.
[2024-05-21 01:56:53] [INFO ] Invariant cache hit.
[2024-05-21 01:57:00] [INFO ] Implicit Places using invariants in 7010 ms returned []
Implicit Place search using SMT only with invariants took 7014 ms to find 0 implicit places.
Running 14523 sub problems to find dead transitions.
[2024-05-21 01:57:00] [INFO ] Invariant cache hit.
[2024-05-21 01:57:00] [INFO ] State equation strengthened by 14401 read => feed constraints.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/3962 variables, 60/60 constraints. Problems are: Problem set: 0 solved, 14523 unsolved
SMT process timed out in 57917ms, After SMT, problems are : Problem set: 0 solved, 14523 unsolved
Search for dead transitions found 0 dead transitions in 58040ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65854 ms. Remains : 3963/3963 places, 14583/14583 transitions.
[2024-05-21 01:57:58] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[60]
RANDOM walk for 1000000 steps (3637 resets) in 20781 ms. (48 steps per ms)
BEST_FIRST walk for 1000001 steps (48 resets) in 1785 ms. (559 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[60]
[2024-05-21 01:58:20] [INFO ] Invariant cache hit.
[2024-05-21 01:58:21] [INFO ] [Real]Absence check using 60 positive place invariants in 67 ms returned sat
[2024-05-21 01:58:21] [INFO ] [Real]Absence check using 60 positive and 2 generalized place invariants in 32 ms returned sat
[2024-05-21 01:58:24] [INFO ] [Real]Absence check using state equation in 3341 ms returned sat
[2024-05-21 01:58:25] [INFO ] State equation strengthened by 14401 read => feed constraints.
[2024-05-21 01:58:26] [INFO ] [Real]Added 14401 Read/Feed constraints in 1386 ms returned sat
[2024-05-21 01:58:26] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 01:58:27] [INFO ] [Nat]Absence check using 60 positive place invariants in 75 ms returned sat
[2024-05-21 01:58:27] [INFO ] [Nat]Absence check using 60 positive and 2 generalized place invariants in 34 ms returned sat
[2024-05-21 01:58:30] [INFO ] [Nat]Absence check using state equation in 3413 ms returned sat
[2024-05-21 01:58:32] [INFO ] [Nat]Added 14401 Read/Feed constraints in 1753 ms returned sat
[2024-05-21 01:58:33] [INFO ] Computed and/alt/rep : 10629/28278/10629 causal constraints (skipped 3894 transitions) in 752 ms.
Minimization took 6484 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[60]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[60]
Support contains 1 out of 3963 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3963/3963 places, 14583/14583 transitions.
Applied a total of 0 rules in 759 ms. Remains 3963 /3963 variables (removed 0) and now considering 14583/14583 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 760 ms. Remains : 3963/3963 places, 14583/14583 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3963/3963 places, 14583/14583 transitions.
Applied a total of 0 rules in 761 ms. Remains 3963 /3963 variables (removed 0) and now considering 14583/14583 (removed 0) transitions.
[2024-05-21 01:58:41] [INFO ] Invariant cache hit.
[2024-05-21 01:58:48] [INFO ] Implicit Places using invariants in 6473 ms returned []
Implicit Place search using SMT only with invariants took 6474 ms to find 0 implicit places.
Running 14523 sub problems to find dead transitions.
[2024-05-21 01:58:48] [INFO ] Invariant cache hit.
[2024-05-21 01:58:48] [INFO ] State equation strengthened by 14401 read => feed constraints.
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/3962 variables, 60/60 constraints. Problems are: Problem set: 0 solved, 14523 unsolved
SMT process timed out in 59243ms, After SMT, problems are : Problem set: 0 solved, 14523 unsolved
Search for dead transitions found 0 dead transitions in 59397ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66651 ms. Remains : 3963/3963 places, 14583/14583 transitions.
[2024-05-21 01:59:47] [INFO ] Flatten gal took : 282 ms
RANDOM walk for 40000 steps (144 resets) in 1313 ms. (30 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 109 ms. (363 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 111 ms. (357 steps per ms) remains 2/2 properties
[2024-05-21 01:59:48] [INFO ] Flatten gal took : 296 ms
[2024-05-21 01:59:48] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9248545714404714782.gal : 52 ms
[2024-05-21 01:59:48] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4671647674838100112.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.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality9248545714404714782.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4671647674838100112.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality4671647674838100112.prop.
Interrupted probabilistic random walk after 57928 steps, run timeout after 3001 ms. (steps per millisecond=19 ) properties seen :0 out of 2
Probabilistic random walk after 57928 steps, saw 30086 distinct states, run finished after 3001 ms. (steps per millisecond=19 ) properties seen :0
[2024-05-21 01:59:51] [INFO ] Invariant cache hit.
[2024-05-21 01:59:51] [INFO ] State equation strengthened by 14401 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 3840/3841 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 01:59:51] [INFO ] Deduced a trap composed of 2 places in 83 ms of which 1 ms to minimize.
Problem MAX0 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/3841 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/3841 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 118/3959 variables, 59/61 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3959 variables, 0/61 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/3961 variables, 2/63 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-21 01:59:57] [INFO ] Deduced a trap composed of 80 places in 5390 ms of which 26 ms to minimize.
SMT process timed out in 6568ms, After SMT, problems are : Problem set: 1 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 3963 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3963/3963 places, 14583/14583 transitions.
Applied a total of 0 rules in 711 ms. Remains 3963 /3963 variables (removed 0) and now considering 14583/14583 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 712 ms. Remains : 3963/3963 places, 14583/14583 transitions.
RANDOM walk for 40000 steps (144 resets) in 1065 ms. (37 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 100 ms. (396 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 64250 steps, run timeout after 3001 ms. (steps per millisecond=21 ) properties seen :0 out of 1
Probabilistic random walk after 64250 steps, saw 30952 distinct states, run finished after 3001 ms. (steps per millisecond=21 ) properties seen :0
[2024-05-21 02:00:01] [INFO ] Invariant cache hit.
[2024-05-21 02:00:01] [INFO ] State equation strengthened by 14401 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3840/3841 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 02:00:02] [INFO ] Deduced a trap composed of 2 places in 82 ms of which 1 ms to minimize.
[2024-05-21 02:00:02] [INFO ] Deduced a trap composed of 2 places in 83 ms of which 1 ms to minimize.
[2024-05-21 02:00:02] [INFO ] Deduced a trap composed of 2 places in 82 ms of which 1 ms to minimize.
[2024-05-21 02:00:02] [INFO ] Deduced a trap composed of 2 places in 84 ms of which 1 ms to minimize.
[2024-05-21 02:00:03] [INFO ] Deduced a trap composed of 2 places in 80 ms of which 1 ms to minimize.
[2024-05-21 02:00:03] [INFO ] Deduced a trap composed of 2 places in 83 ms of which 1 ms to minimize.
[2024-05-21 02:00:03] [INFO ] Deduced a trap composed of 2 places in 78 ms of which 1 ms to minimize.
[2024-05-21 02:00:03] [INFO ] Deduced a trap composed of 2 places in 77 ms of which 1 ms to minimize.
[2024-05-21 02:00:03] [INFO ] Deduced a trap composed of 2 places in 78 ms of which 1 ms to minimize.
[2024-05-21 02:00:03] [INFO ] Deduced a trap composed of 2 places in 75 ms of which 1 ms to minimize.
[2024-05-21 02:00:03] [INFO ] Deduced a trap composed of 2 places in 79 ms of which 1 ms to minimize.
[2024-05-21 02:00:03] [INFO ] Deduced a trap composed of 2 places in 79 ms of which 2 ms to minimize.
[2024-05-21 02:00:04] [INFO ] Deduced a trap composed of 2 places in 86 ms of which 1 ms to minimize.
[2024-05-21 02:00:04] [INFO ] Deduced a trap composed of 2 places in 78 ms of which 1 ms to minimize.
[2024-05-21 02:00:04] [INFO ] Deduced a trap composed of 2 places in 80 ms of which 1 ms to minimize.
[2024-05-21 02:00:04] [INFO ] Deduced a trap composed of 2 places in 82 ms of which 0 ms to minimize.
[2024-05-21 02:00:04] [INFO ] Deduced a trap composed of 2 places in 81 ms of which 0 ms to minimize.
[2024-05-21 02:00:04] [INFO ] Deduced a trap composed of 2 places in 81 ms of which 1 ms to minimize.
[2024-05-21 02:00:04] [INFO ] Deduced a trap composed of 2 places in 80 ms of which 1 ms to minimize.
[2024-05-21 02:00:04] [INFO ] Deduced a trap composed of 2 places in 78 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/3841 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 02:00:05] [INFO ] Deduced a trap composed of 2 places in 82 ms of which 4 ms to minimize.
[2024-05-21 02:00:05] [INFO ] Deduced a trap composed of 2 places in 80 ms of which 1 ms to minimize.
[2024-05-21 02:00:05] [INFO ] Deduced a trap composed of 2 places in 81 ms of which 1 ms to minimize.
[2024-05-21 02:00:05] [INFO ] Deduced a trap composed of 2 places in 73 ms of which 0 ms to minimize.
[2024-05-21 02:00:05] [INFO ] Deduced a trap composed of 2 places in 80 ms of which 1 ms to minimize.
[2024-05-21 02:00:05] [INFO ] Deduced a trap composed of 2 places in 77 ms of which 1 ms to minimize.
[2024-05-21 02:00:05] [INFO ] Deduced a trap composed of 2 places in 78 ms of which 1 ms to minimize.
[2024-05-21 02:00:05] [INFO ] Deduced a trap composed of 2 places in 75 ms of which 1 ms to minimize.
[2024-05-21 02:00:06] [INFO ] Deduced a trap composed of 2 places in 75 ms of which 1 ms to minimize.
[2024-05-21 02:00:06] [INFO ] Deduced a trap composed of 2 places in 75 ms of which 0 ms to minimize.
[2024-05-21 02:00:06] [INFO ] Deduced a trap composed of 2 places in 74 ms of which 1 ms to minimize.
[2024-05-21 02:00:06] [INFO ] Deduced a trap composed of 2 places in 75 ms of which 1 ms to minimize.
[2024-05-21 02:00:06] [INFO ] Deduced a trap composed of 2 places in 78 ms of which 1 ms to minimize.
[2024-05-21 02:00:06] [INFO ] Deduced a trap composed of 2 places in 76 ms of which 1 ms to minimize.
[2024-05-21 02:00:06] [INFO ] Deduced a trap composed of 2 places in 77 ms of which 1 ms to minimize.
[2024-05-21 02:00:06] [INFO ] Deduced a trap composed of 2 places in 73 ms of which 1 ms to minimize.
[2024-05-21 02:00:07] [INFO ] Deduced a trap composed of 2 places in 76 ms of which 1 ms to minimize.
[2024-05-21 02:00:07] [INFO ] Deduced a trap composed of 2 places in 72 ms of which 1 ms to minimize.
[2024-05-21 02:00:07] [INFO ] Deduced a trap composed of 2 places in 76 ms of which 1 ms to minimize.
[2024-05-21 02:00:07] [INFO ] Deduced a trap composed of 2 places in 73 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/3841 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 02:00:07] [INFO ] Deduced a trap composed of 2 places in 67 ms of which 1 ms to minimize.
[2024-05-21 02:00:07] [INFO ] Deduced a trap composed of 2 places in 76 ms of which 1 ms to minimize.
[2024-05-21 02:00:07] [INFO ] Deduced a trap composed of 2 places in 75 ms of which 1 ms to minimize.
[2024-05-21 02:00:07] [INFO ] Deduced a trap composed of 2 places in 72 ms of which 0 ms to minimize.
[2024-05-21 02:00:08] [INFO ] Deduced a trap composed of 2 places in 69 ms of which 0 ms to minimize.
[2024-05-21 02:00:08] [INFO ] Deduced a trap composed of 2 places in 75 ms of which 1 ms to minimize.
[2024-05-21 02:00:08] [INFO ] Deduced a trap composed of 2 places in 74 ms of which 1 ms to minimize.
[2024-05-21 02:00:08] [INFO ] Deduced a trap composed of 2 places in 67 ms of which 0 ms to minimize.
[2024-05-21 02:00:08] [INFO ] Deduced a trap composed of 2 places in 77 ms of which 0 ms to minimize.
[2024-05-21 02:00:08] [INFO ] Deduced a trap composed of 2 places in 69 ms of which 1 ms to minimize.
[2024-05-21 02:00:08] [INFO ] Deduced a trap composed of 2 places in 71 ms of which 0 ms to minimize.
[2024-05-21 02:00:08] [INFO ] Deduced a trap composed of 2 places in 73 ms of which 1 ms to minimize.
[2024-05-21 02:00:09] [INFO ] Deduced a trap composed of 2 places in 71 ms of which 1 ms to minimize.
[2024-05-21 02:00:09] [INFO ] Deduced a trap composed of 2 places in 71 ms of which 1 ms to minimize.
[2024-05-21 02:00:09] [INFO ] Deduced a trap composed of 2 places in 70 ms of which 0 ms to minimize.
[2024-05-21 02:00:09] [INFO ] Deduced a trap composed of 2 places in 72 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/3841 variables, 16/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3841 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 118/3959 variables, 59/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3959 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 2/3961 variables, 2/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3961 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 14583/18544 variables, 3961/4079 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 18544/18546 variables, and 18480 constraints, problems are : Problem set: 0 solved, 1 unsolved in 27372 ms.
Refiners :[Positive P Invariants (semi-flows): 60/60 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 3961/3963 constraints, ReadFeed: 14401/14401 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 56/56 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3840/3841 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3841 variables, 56/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 02:00:29] [INFO ] Deduced a trap composed of 2 places in 72 ms of which 1 ms to minimize.
[2024-05-21 02:00:30] [INFO ] Deduced a trap composed of 2 places in 69 ms of which 1 ms to minimize.
[2024-05-21 02:00:30] [INFO ] Deduced a trap composed of 2 places in 74 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/3841 variables, 3/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3841 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 118/3959 variables, 59/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3959 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/3961 variables, 2/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 02:00:36] [INFO ] Deduced a trap composed of 75 places in 5785 ms of which 24 ms to minimize.
Detected timeout of ITS tools.
[2024-05-21 02:00:38] [INFO ] Flatten gal took : 261 ms
[2024-05-21 02:00:38] [INFO ] Applying decomposition
[2024-05-21 02:00:39] [INFO ] Flatten gal took : 387 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph14985499693333849093.txt' '-o' '/tmp/graph14985499693333849093.bin' '-w' '/tmp/graph14985499693333849093.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14985499693333849093.bin' '-l' '-1' '-v' '-w' '/tmp/graph14985499693333849093.weights' '-q' '0' '-e' '0.001'
[2024-05-21 02:00:39] [INFO ] Decomposing Gal with order
[2024-05-21 02:00:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 02:00:40] [INFO ] Removed a total of 11038 redundant transitions.
[2024-05-21 02:00:40] [INFO ] Flatten gal took : 954 ms
[2024-05-21 02:00:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 14104 labels/synchronizations in 844 ms.
[2024-05-21 02:00:41] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1572385383141107400.gal : 91 ms
[2024-05-21 02:00:41] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality18357741814588406230.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.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality1572385383141107400.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality18357741814588406230.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
[2024-05-21 02:00:42] [INFO ] Deduced a trap composed of 100 places in 5858 ms of which 69 ms to minimize.
Loading property file /tmp/ReachabilityCardinality18357741814588406230.prop.
[2024-05-21 02:00:47] [INFO ] Deduced a trap composed of 80 places in 5206 ms of which 25 ms to minimize.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 340
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :340 after 340
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :340 after 340
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :340 after 340
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :340 after 340
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :340 after 340
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :340 after 340
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :340 after 340
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :340 after 340
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :340 after 340
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :340 after 340
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :340 after 340
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :340 after 340
[2024-05-21 02:00:53] [INFO ] Deduced a trap composed of 83 places in 5365 ms of which 28 ms to minimize.
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :340 after 37849
[2024-05-21 02:00:58] [INFO ] Deduced a trap composed of 74 places in 5316 ms of which 27 ms to minimize.
[2024-05-21 02:01:03] [INFO ] Deduced a trap composed of 67 places in 5276 ms of which 26 ms to minimize.
[2024-05-21 02:01:09] [INFO ] Deduced a trap composed of 71 places in 5304 ms of which 25 ms to minimize.
[2024-05-21 02:01:14] [INFO ] Deduced a trap composed of 76 places in 5206 ms of which 25 ms to minimize.
SMT process timed out in 72667ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 3963 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3963/3963 places, 14583/14583 transitions.
Applied a total of 0 rules in 749 ms. Remains 3963 /3963 variables (removed 0) and now considering 14583/14583 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 749 ms. Remains : 3963/3963 places, 14583/14583 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3963/3963 places, 14583/14583 transitions.
Applied a total of 0 rules in 766 ms. Remains 3963 /3963 variables (removed 0) and now considering 14583/14583 (removed 0) transitions.
[2024-05-21 02:01:16] [INFO ] Invariant cache hit.
[2024-05-21 02:01:22] [INFO ] Implicit Places using invariants in 6369 ms returned []
Implicit Place search using SMT only with invariants took 6370 ms to find 0 implicit places.
Running 14523 sub problems to find dead transitions.
[2024-05-21 02:01:22] [INFO ] Invariant cache hit.
[2024-05-21 02:01:22] [INFO ] State equation strengthened by 14401 read => feed constraints.
Detected timeout of ITS tools.
At refinement iteration 0 (INCLUDED_ONLY) 0/3962 variables, 60/60 constraints. Problems are: Problem set: 0 solved, 14523 unsolved
SMT process timed out in 60286ms, After SMT, problems are : Problem set: 0 solved, 14523 unsolved
Search for dead transitions found 0 dead transitions in 60410ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 67567 ms. Remains : 3963/3963 places, 14583/14583 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[1] Max Struct:[60]
Ending property specific reduction for CANInsertWithFailure-PT-060-UpperBounds-07 in 383768 ms.
Starting property specific reduction for CANInsertWithFailure-PT-060-UpperBounds-08
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[60]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[60]
// Phase 1: matrix 14587 rows 3967 cols
[2024-05-21 02:02:23] [INFO ] Computed 62 invariants in 537 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[60]
RANDOM walk for 10000 steps (36 resets) in 215 ms. (46 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 20 ms. (476 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[60]
[2024-05-21 02:02:23] [INFO ] Invariant cache hit.
[2024-05-21 02:02:24] [INFO ] [Real]Absence check using 60 positive place invariants in 67 ms returned sat
[2024-05-21 02:02:24] [INFO ] [Real]Absence check using 60 positive and 2 generalized place invariants in 33 ms returned sat
[2024-05-21 02:02:27] [INFO ] [Real]Absence check using state equation in 3559 ms returned sat
[2024-05-21 02:02:28] [INFO ] State equation strengthened by 14384 read => feed constraints.
[2024-05-21 02:02:28] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:860)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2249)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:929)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[60]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[60]
Support contains 1 out of 3967 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3967/3967 places, 14587/14587 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 3 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 3962 transition count 14582
Partial Free-agglomeration rule applied 8 times.
Drop transitions (Partial Free agglomeration) removed 8 transitions
Iterating global reduction 0 with 8 rules applied. Total rules applied 18 place count 3962 transition count 14582
Applied a total of 18 rules in 2254 ms. Remains 3962 /3967 variables (removed 5) and now considering 14582/14587 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2255 ms. Remains : 3962/3967 places, 14582/14587 transitions.
// Phase 1: matrix 14582 rows 3962 cols
[2024-05-21 02:02:31] [INFO ] Computed 62 invariants in 532 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[60]
RANDOM walk for 1000000 steps (3638 resets) in 23396 ms. (42 steps per ms)
BEST_FIRST walk for 1000001 steps (46 resets) in 1894 ms. (527 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[60]
[2024-05-21 02:02:56] [INFO ] Invariant cache hit.
[2024-05-21 02:02:57] [INFO ] [Real]Absence check using 60 positive place invariants in 66 ms returned sat
[2024-05-21 02:02:57] [INFO ] [Real]Absence check using 60 positive and 2 generalized place invariants in 31 ms returned sat
[2024-05-21 02:03:00] [INFO ] [Real]Absence check using state equation in 3524 ms returned sat
[2024-05-21 02:03:01] [INFO ] State equation strengthened by 14402 read => feed constraints.
[2024-05-21 02:03:02] [INFO ] [Real]Added 14402 Read/Feed constraints in 1382 ms returned sat
[2024-05-21 02:03:02] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 02:03:03] [INFO ] [Nat]Absence check using 60 positive place invariants in 74 ms returned sat
[2024-05-21 02:03:03] [INFO ] [Nat]Absence check using 60 positive and 2 generalized place invariants in 31 ms returned sat
[2024-05-21 02:03:06] [INFO ] [Nat]Absence check using state equation in 3325 ms returned sat
[2024-05-21 02:03:08] [INFO ] [Nat]Added 14402 Read/Feed constraints in 1401 ms returned sat
[2024-05-21 02:03:09] [INFO ] Computed and/alt/rep : 10628/28280/10628 causal constraints (skipped 3894 transitions) in 822 ms.
Minimization took 7974 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[60]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[60]
Support contains 1 out of 3962 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3962/3962 places, 14582/14582 transitions.
Applied a total of 0 rules in 743 ms. Remains 3962 /3962 variables (removed 0) and now considering 14582/14582 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 743 ms. Remains : 3962/3962 places, 14582/14582 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3962/3962 places, 14582/14582 transitions.
Applied a total of 0 rules in 748 ms. Remains 3962 /3962 variables (removed 0) and now considering 14582/14582 (removed 0) transitions.
[2024-05-21 02:03:18] [INFO ] Invariant cache hit.
[2024-05-21 02:03:25] [INFO ] Implicit Places using invariants in 6724 ms returned []
Implicit Place search using SMT only with invariants took 6725 ms to find 0 implicit places.
Running 14522 sub problems to find dead transitions.
[2024-05-21 02:03:25] [INFO ] Invariant cache hit.
[2024-05-21 02:03:25] [INFO ] State equation strengthened by 14402 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3961 variables, 60/60 constraints. Problems are: Problem set: 0 solved, 14522 unsolved
SMT process timed out in 58303ms, After SMT, problems are : Problem set: 0 solved, 14522 unsolved
Search for dead transitions found 0 dead transitions in 58429ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65921 ms. Remains : 3962/3962 places, 14582/14582 transitions.
[2024-05-21 02:04:24] [INFO ] Flatten gal took : 353 ms
RANDOM walk for 40000 steps (144 resets) in 1273 ms. (31 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 108 ms. (367 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 116 ms. (341 steps per ms) remains 2/2 properties
[2024-05-21 02:04:24] [INFO ] Flatten gal took : 355 ms
[2024-05-21 02:04:24] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality932475121877673146.gal : 48 ms
[2024-05-21 02:04:24] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14216855509181304006.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality932475121877673146.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14216855509181304006.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality14216855509181304006.prop.
Interrupted probabilistic random walk after 56702 steps, run timeout after 3001 ms. (steps per millisecond=18 ) properties seen :0 out of 2
Probabilistic random walk after 56702 steps, saw 29924 distinct states, run finished after 3001 ms. (steps per millisecond=18 ) properties seen :0
[2024-05-21 02:04:27] [INFO ] Invariant cache hit.
[2024-05-21 02:04:27] [INFO ] State equation strengthened by 14402 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 3839/3840 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 02:04:28] [INFO ] Deduced a trap composed of 2 places in 92 ms of which 1 ms to minimize.
Problem MAX0 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/3840 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/3840 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 118/3958 variables, 59/61 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3958 variables, 0/61 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/3960 variables, 2/63 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-21 02:04:34] [INFO ] Deduced a trap composed of 70 places in 5587 ms of which 27 ms to minimize.
SMT process timed out in 6915ms, After SMT, problems are : Problem set: 1 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 3962 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3962/3962 places, 14582/14582 transitions.
Applied a total of 0 rules in 706 ms. Remains 3962 /3962 variables (removed 0) and now considering 14582/14582 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 706 ms. Remains : 3962/3962 places, 14582/14582 transitions.
RANDOM walk for 40000 steps (143 resets) in 1304 ms. (30 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 122 ms. (325 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 63102 steps, run timeout after 3001 ms. (steps per millisecond=21 ) properties seen :0 out of 1
Probabilistic random walk after 63102 steps, saw 30799 distinct states, run finished after 3001 ms. (steps per millisecond=21 ) properties seen :0
[2024-05-21 02:04:38] [INFO ] Invariant cache hit.
[2024-05-21 02:04:38] [INFO ] State equation strengthened by 14402 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3839/3840 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 02:04:39] [INFO ] Deduced a trap composed of 2 places in 86 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/3840 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/3840 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 118/3958 variables, 59/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3958 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/3960 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 02:04:44] [INFO ] Deduced a trap composed of 67 places in 5260 ms of which 25 ms to minimize.
[2024-05-21 02:04:50] [INFO ] Deduced a trap composed of 66 places in 5264 ms of which 25 ms to minimize.
[2024-05-21 02:04:55] [INFO ] Deduced a trap composed of 68 places in 5344 ms of which 26 ms to minimize.
[2024-05-21 02:05:01] [INFO ] Deduced a trap composed of 66 places in 5361 ms of which 26 ms to minimize.
[2024-05-21 02:05:06] [INFO ] Deduced a trap composed of 80 places in 5238 ms of which 26 ms to minimize.
[2024-05-21 02:05:11] [INFO ] Deduced a trap composed of 81 places in 5131 ms of which 26 ms to minimize.
Detected timeout of ITS tools.
[2024-05-21 02:05:15] [INFO ] Flatten gal took : 280 ms
[2024-05-21 02:05:15] [INFO ] Applying decomposition
[2024-05-21 02:05:15] [INFO ] Flatten gal took : 280 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph1849831918590177173.txt' '-o' '/tmp/graph1849831918590177173.bin' '-w' '/tmp/graph1849831918590177173.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph1849831918590177173.bin' '-l' '-1' '-v' '-w' '/tmp/graph1849831918590177173.weights' '-q' '0' '-e' '0.001'
[2024-05-21 02:05:15] [INFO ] Decomposing Gal with order
[2024-05-21 02:05:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 02:05:16] [INFO ] Deduced a trap composed of 77 places in 5211 ms of which 25 ms to minimize.
[2024-05-21 02:05:17] [INFO ] Removed a total of 11035 redundant transitions.
[2024-05-21 02:05:17] [INFO ] Flatten gal took : 932 ms
[2024-05-21 02:05:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 13866 labels/synchronizations in 861 ms.
[2024-05-21 02:05:18] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12674674466719607828.gal : 130 ms
[2024-05-21 02:05:18] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15743653926577265534.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.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality12674674466719607828.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15743653926577265534.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...309
Loading property file /tmp/ReachabilityCardinality15743653926577265534.prop.
[2024-05-21 02:05:21] [INFO ] Deduced a trap composed of 72 places in 4592 ms of which 22 ms to minimize.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 252
[2024-05-21 02:05:26] [INFO ] Deduced a trap composed of 104 places in 5014 ms of which 24 ms to minimize.
SMT process timed out in 48100ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 3962 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3962/3962 places, 14582/14582 transitions.
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :252 after 252
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :252 after 252
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :252 after 252
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :252 after 252
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :252 after 252
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :252 after 252
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :252 after 252
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :252 after 252
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :252 after 252
Applied a total of 0 rules in 734 ms. Remains 3962 /3962 variables (removed 0) and now considering 14582/14582 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 734 ms. Remains : 3962/3962 places, 14582/14582 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3962/3962 places, 14582/14582 transitions.
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :252 after 252
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :252 after 252
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :252 after 252
Applied a total of 0 rules in 755 ms. Remains 3962 /3962 variables (removed 0) and now considering 14582/14582 (removed 0) transitions.
[2024-05-21 02:05:28] [INFO ] Invariant cache hit.
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :252 after 29050
[2024-05-21 02:05:34] [INFO ] Implicit Places using invariants in 6686 ms returned []
Implicit Place search using SMT only with invariants took 6688 ms to find 0 implicit places.
Running 14522 sub problems to find dead transitions.
[2024-05-21 02:05:34] [INFO ] Invariant cache hit.
[2024-05-21 02:05:35] [INFO ] State equation strengthened by 14402 read => feed constraints.
Detected timeout of ITS tools.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/3961 variables, 60/60 constraints. Problems are: Problem set: 0 solved, 14522 unsolved
SMT process timed out in 60311ms, After SMT, problems are : Problem set: 0 solved, 14522 unsolved
Search for dead transitions found 0 dead transitions in 60448ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 67911 ms. Remains : 3962/3962 places, 14582/14582 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[1] Max Struct:[60]
Ending property specific reduction for CANInsertWithFailure-PT-060-UpperBounds-08 in 252407 ms.
Starting property specific reduction for CANInsertWithFailure-PT-060-UpperBounds-09
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[60]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[60]
// Phase 1: matrix 14587 rows 3967 cols
[2024-05-21 02:06:35] [INFO ] Computed 62 invariants in 545 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[60]
RANDOM walk for 10000 steps (36 resets) in 221 ms. (45 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 30 ms. (322 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[60]
[2024-05-21 02:06:36] [INFO ] Invariant cache hit.
[2024-05-21 02:06:36] [INFO ] [Real]Absence check using 60 positive place invariants in 83 ms returned sat
[2024-05-21 02:06:36] [INFO ] [Real]Absence check using 60 positive and 2 generalized place invariants in 33 ms returned sat
[2024-05-21 02:06:39] [INFO ] [Real]Absence check using state equation in 3188 ms returned sat
[2024-05-21 02:06:40] [INFO ] State equation strengthened by 14384 read => feed constraints.
[2024-05-21 02:06:41] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-21 02:06:41] [INFO ] [Real]Added 14384 Read/Feed constraints in 793 ms returned unknown
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[60]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[60]
Support contains 1 out of 3967 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3967/3967 places, 14587/14587 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 2 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 3962 transition count 14582
Partial Free-agglomeration rule applied 8 times.
Drop transitions (Partial Free agglomeration) removed 8 transitions
Iterating global reduction 0 with 8 rules applied. Total rules applied 18 place count 3962 transition count 14582
Applied a total of 18 rules in 2040 ms. Remains 3962 /3967 variables (removed 5) and now considering 14582/14587 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2043 ms. Remains : 3962/3967 places, 14582/14587 transitions.
// Phase 1: matrix 14582 rows 3962 cols
[2024-05-21 02:06:43] [INFO ] Computed 62 invariants in 644 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[60]
RANDOM walk for 1000000 steps (3641 resets) in 21259 ms. (47 steps per ms)
BEST_FIRST walk for 1000001 steps (47 resets) in 1835 ms. (544 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[60]
[2024-05-21 02:07:06] [INFO ] Invariant cache hit.
[2024-05-21 02:07:07] [INFO ] [Real]Absence check using 60 positive place invariants in 68 ms returned sat
[2024-05-21 02:07:07] [INFO ] [Real]Absence check using 60 positive and 2 generalized place invariants in 32 ms returned sat
[2024-05-21 02:07:11] [INFO ] [Real]Absence check using state equation in 3755 ms returned sat
[2024-05-21 02:07:11] [INFO ] State equation strengthened by 14402 read => feed constraints.
[2024-05-21 02:07:13] [INFO ] [Real]Added 14402 Read/Feed constraints in 1370 ms returned sat
[2024-05-21 02:07:13] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 02:07:13] [INFO ] [Nat]Absence check using 60 positive place invariants in 83 ms returned sat
[2024-05-21 02:07:13] [INFO ] [Nat]Absence check using 60 positive and 2 generalized place invariants in 34 ms returned sat
[2024-05-21 02:07:18] [INFO ] [Nat]Absence check using state equation in 4309 ms returned sat
[2024-05-21 02:07:19] [INFO ] [Nat]Added 14402 Read/Feed constraints in 1572 ms returned sat
[2024-05-21 02:07:20] [INFO ] Computed and/alt/rep : 10628/28280/10628 causal constraints (skipped 3894 transitions) in 816 ms.
Minimization took 7042 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[60]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[60]
Support contains 1 out of 3962 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3962/3962 places, 14582/14582 transitions.
Applied a total of 0 rules in 760 ms. Remains 3962 /3962 variables (removed 0) and now considering 14582/14582 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 762 ms. Remains : 3962/3962 places, 14582/14582 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3962/3962 places, 14582/14582 transitions.
Applied a total of 0 rules in 738 ms. Remains 3962 /3962 variables (removed 0) and now considering 14582/14582 (removed 0) transitions.
[2024-05-21 02:07:29] [INFO ] Invariant cache hit.
[2024-05-21 02:07:36] [INFO ] Implicit Places using invariants in 6754 ms returned []
Implicit Place search using SMT only with invariants took 6756 ms to find 0 implicit places.
Running 14522 sub problems to find dead transitions.
[2024-05-21 02:07:36] [INFO ] Invariant cache hit.
[2024-05-21 02:07:36] [INFO ] State equation strengthened by 14402 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3961 variables, 60/60 constraints. Problems are: Problem set: 0 solved, 14522 unsolved
SMT process timed out in 58599ms, After SMT, problems are : Problem set: 0 solved, 14522 unsolved
Search for dead transitions found 0 dead transitions in 58740ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66255 ms. Remains : 3962/3962 places, 14582/14582 transitions.
RANDOM walk for 40000 steps (145 resets) in 1002 ms. (39 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 107 ms. (370 steps per ms) remains 2/2 properties
[2024-05-21 02:08:35] [INFO ] Flatten gal took : 350 ms
BEST_FIRST walk for 40004 steps (8 resets) in 80 ms. (493 steps per ms) remains 2/2 properties
[2024-05-21 02:08:35] [INFO ] Flatten gal took : 433 ms
[2024-05-21 02:08:35] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17953873026562224895.gal : 55 ms
[2024-05-21 02:08:35] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11679815931515110167.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.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality17953873026562224895.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11679815931515110167.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
Loading property file /tmp/ReachabilityCardinality11679815931515110167.prop.
Interrupted probabilistic random walk after 57898 steps, run timeout after 3001 ms. (steps per millisecond=19 ) properties seen :0 out of 2
Probabilistic random walk after 57898 steps, saw 30086 distinct states, run finished after 3002 ms. (steps per millisecond=19 ) properties seen :0
[2024-05-21 02:08:38] [INFO ] Invariant cache hit.
[2024-05-21 02:08:38] [INFO ] State equation strengthened by 14402 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 3839/3840 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 02:08:39] [INFO ] Deduced a trap composed of 2 places in 82 ms of which 1 ms to minimize.
Problem MAX0 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/3840 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/3840 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 118/3958 variables, 59/61 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3958 variables, 0/61 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/3960 variables, 2/63 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-21 02:08:45] [INFO ] Deduced a trap composed of 79 places in 5680 ms of which 27 ms to minimize.
SMT process timed out in 6871ms, After SMT, problems are : Problem set: 1 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 3962 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3962/3962 places, 14582/14582 transitions.
Applied a total of 0 rules in 724 ms. Remains 3962 /3962 variables (removed 0) and now considering 14582/14582 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 724 ms. Remains : 3962/3962 places, 14582/14582 transitions.
RANDOM walk for 40000 steps (144 resets) in 961 ms. (41 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 123 ms. (322 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 62873 steps, run timeout after 3001 ms. (steps per millisecond=20 ) properties seen :0 out of 1
Probabilistic random walk after 62873 steps, saw 30770 distinct states, run finished after 3001 ms. (steps per millisecond=20 ) properties seen :0
[2024-05-21 02:08:49] [INFO ] Invariant cache hit.
[2024-05-21 02:08:49] [INFO ] State equation strengthened by 14402 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3839/3840 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 02:08:50] [INFO ] Deduced a trap composed of 2 places in 90 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/3840 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/3840 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 118/3958 variables, 59/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3958 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/3960 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 02:08:55] [INFO ] Deduced a trap composed of 67 places in 5218 ms of which 26 ms to minimize.
[2024-05-21 02:09:01] [INFO ] Deduced a trap composed of 66 places in 5206 ms of which 26 ms to minimize.
[2024-05-21 02:09:06] [INFO ] Deduced a trap composed of 92 places in 5160 ms of which 24 ms to minimize.
[2024-05-21 02:09:15] [INFO ] Deduced a trap composed of 101 places in 8881 ms of which 38 ms to minimize.
[2024-05-21 02:09:25] [INFO ] Deduced a trap composed of 84 places in 9807 ms of which 32 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/3960 variables, 5/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3960 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Detected timeout of ITS tools.
[2024-05-21 02:09:26] [INFO ] Flatten gal took : 271 ms
[2024-05-21 02:09:26] [INFO ] Applying decomposition
[2024-05-21 02:09:26] [INFO ] Flatten gal took : 278 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph13040287600566412394.txt' '-o' '/tmp/graph13040287600566412394.bin' '-w' '/tmp/graph13040287600566412394.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph13040287600566412394.bin' '-l' '-1' '-v' '-w' '/tmp/graph13040287600566412394.weights' '-q' '0' '-e' '0.001'
[2024-05-21 02:09:27] [INFO ] Decomposing Gal with order
[2024-05-21 02:09:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 02:09:28] [INFO ] Removed a total of 11039 redundant transitions.
[2024-05-21 02:09:28] [INFO ] Flatten gal took : 949 ms
[2024-05-21 02:09:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 13986 labels/synchronizations in 872 ms.
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 14582/18542 variables, 3960/4028 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 02:09:29] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8794264604484175575.gal : 82 ms
[2024-05-21 02:09:29] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9352405741087509550.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.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality8794264604484175575.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9352405741087509550.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...307
Loading property file /tmp/ReachabilityCardinality9352405741087509550.prop.
At refinement iteration 10 (INCLUDED_ONLY) 0/18542 variables, 14402/18430 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/18542 variables, 0/18430 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 2/18544 variables, 2/18432 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 18544/18544 variables, and 18432 constraints, problems are : Problem set: 0 solved, 1 unsolved in 45028 ms.
Refiners :[Positive P Invariants (semi-flows): 60/60 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 3962/3962 constraints, ReadFeed: 14402/14402 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3839/3840 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3840 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 02:09:35] [INFO ] Deduced a trap composed of 2 places in 94 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/3840 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3840 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 118/3958 variables, 59/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3958 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/3960 variables, 2/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3960 variables, 5/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 4642
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :4642 after 4642
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :4642 after 4642
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :4642 after 4642
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :4642 after 4642
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :4642 after 4642
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :4642 after 4642
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :4642 after 4661
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :4661 after 4668
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :4668 after 4677
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :4677 after 4691
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :4691 after 4710
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :4710 after 4736
[2024-05-21 02:09:41] [INFO ] Deduced a trap composed of 90 places in 5743 ms of which 27 ms to minimize.
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :4736 after 15804
[2024-05-21 02:09:49] [INFO ] Deduced a trap composed of 85 places in 7972 ms of which 68 ms to minimize.
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :15804 after 2.41156e+06
[2024-05-21 02:09:59] [INFO ] Deduced a trap composed of 89 places in 10120 ms of which 36 ms to minimize.
[2024-05-21 02:10:05] [INFO ] Deduced a trap composed of 65 places in 5396 ms of which 25 ms to minimize.
[2024-05-21 02:10:10] [INFO ] Deduced a trap composed of 86 places in 5326 ms of which 25 ms to minimize.
[2024-05-21 02:10:15] [INFO ] Deduced a trap composed of 93 places in 5271 ms of which 25 ms to minimize.
Detected timeout of ITS tools.
[2024-05-21 02:10:21] [INFO ] Deduced a trap composed of 90 places in 5335 ms of which 25 ms to minimize.
SMT process timed out in 91669ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 3962 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3962/3962 places, 14582/14582 transitions.
Applied a total of 0 rules in 812 ms. Remains 3962 /3962 variables (removed 0) and now considering 14582/14582 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 812 ms. Remains : 3962/3962 places, 14582/14582 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3962/3962 places, 14582/14582 transitions.
Applied a total of 0 rules in 737 ms. Remains 3962 /3962 variables (removed 0) and now considering 14582/14582 (removed 0) transitions.
[2024-05-21 02:10:22] [INFO ] Invariant cache hit.
[2024-05-21 02:10:29] [INFO ] Implicit Places using invariants in 6367 ms returned []
Implicit Place search using SMT only with invariants took 6367 ms to find 0 implicit places.
Running 14522 sub problems to find dead transitions.
[2024-05-21 02:10:29] [INFO ] Invariant cache hit.
[2024-05-21 02:10:29] [INFO ] State equation strengthened by 14402 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
(s0 0.0)
(s1 1.0)
(s3 0.0)
(s4 1.0)
(s5 1.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 1.0)
(s11 1.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 1.0)
(s17 1.0)
(s18 0.0)
(s19 1.0)
(s20 0.0)
(s21 0.0)
(s22 1.0)
(s23 1.0)
(s24 0.0)
(s25 1.0)
(s26 0.0)
(s27 0.0)
(s28 1.0)
(s29 1.0)
(s30 0.0)
(s31 1.0)
(s32 0.0)
(s33 0.0)
(s34 1.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 1.0)
(s41 0.0)
(s42 0.0)
(s43 1.0)
(s44 0.0)
(s45 0.0)
(s46 1.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 1.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 1.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 1.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 1.0)
(s77 0.0)
(s78 0.0)
(s79 1.0)
(s80 0.0)
(s81 0.0)
(s82 1.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 1.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 1.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 1.0)
(s101 0.0)
(s102 0.0)
(s103 1.0)
(s104 0.0)
(s105 0.0)
(s106 1.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 1.0)
(s113 0.0)
(s114 0.0)
(s115 1.0)
(s116 0.0)
(s117 0.0)
(s118 1.0)
(s119 0.0)
(s120 0.0)
(s121 1.0)
(s122 0.0)
(s123 0.0)
(s124 1.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 1.0)
(s131 0.0)
(s132 0.0)
(s133 1.0)
(s134 0.0)
(s135 0.0)
(s136 1.0)
(s137 0.0)
(s138 0.0)
(s139 1.0)
(s140 0.0)
(s141 0.0)
(s142 1.0)
(s143 0.0)
(s144 0.0)
(s145 1.0)
(s146 0.0)
(s147 0.0)
(s148 1.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 1.0)
(s155 0.0)
(s156 0.0)
(s157 1.0)
(s158 0.0)
(s159 0.0)
(s160 1.0)
(s161 0.0)
(s162 0.0)
(s163 1.0)
(s164 0.0)
(s165 0.0)
(s166 1.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 1.0)
(s173 0.0)
(s174 0.0)
(s175 1.0)
(s176 0.0)
(s177 0.0)
(s178 1.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 1.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 1.0)
(s191 0.0)
(s192 0.0)
(s193 1.0)
(s194 0.0)
(s195 0.0)
(s196 1.0)
(s197 0.0)
(s198 0.0)
(s199 1.0)
(s200 0.0)
(s201 0.0)
(s202 1.0)
(s203 0.0)
(s204 0.0)
(s205 1.0)
(s206 0.0)
(s207 0.0)
(s208 1.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 1.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 1.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 1.0)
(s227 0.0)
(s228 0.0)
(s229 1.0)
(s230 0.0)
(s231 0.0)
(s232 1.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 1.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 1.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 1.0)
(s251 0.0)
(s252 0.0)
(s253 1.0)
(s254 0.0)
(s255 0.0)
(s256 1.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 1.0)
(s263 0.0)
(s264 0.0)
(s265 1.0)
(s266 0.0)
(s267 0.0)
(s268 1.0)
(s269 0.0)
(s270 0.0)
(s271 1.0)
(s272 0.0)
(s273 0.0)
(s274 1.0)
(s275 0.0)
(s276 0.0)
(s277 1.0)
(s278 0.0)
(s279 0.0)
(s280 1.0)
(s281 0.0)
(s282 0.0)
(s283 1.0)
(s284 0.0)
(s285 0.0)
(s286 1.0)
(s287 0.0)
(s288 0.0)
(s289 1.0)
(s290 0.0)
(s291 0.0)
(s292 1.0)
(s293 0.0)
(s294 0.0)
(s295 1.0)
(s296 0.0)
(s297 0.0)
(s298 1.0)
(s299 0.0)
(s300 0.0)
(s301 1.0)
(s302 0.0)
(s303 0.0)
(s304 1.0)
(s305 0.0)
(s306 0.0)
(s307 1.0)
(s308 0.0)
(s309 0.0)
(s310 1.0)
(s311 0.0)
(s312 0.0)
(s313 1.0)
(s314 0.0)
(s315 0.0)
(s316 1.0)
(s317 0.0)
(s318 0.0)
(s319 1.0)
(s320 0.0)
(s321 0.0)
(s322 1.0)
(s323 0.0)
(s324 0.0)
(s325 1.0)
(s326 0.0)
(s327 0.0)
(s328 1.0)
(s329 0.0)
(s330 0.0)
(s331 1.0)
(s332 0.0)
(s333 0.0)
(s334 1.0)
(s335 0.0)
(s336 0.0)
(s337 1.0)
(s338 0.0)
(s339 0.0)
(s340 1.0)
(s341 0.0)
(s342 0.0)
(s343 1.0)
(s344 0.0)
(s345 0.0)
(s346 1.0)
(s347 0.0)
(s348 0.0)
(s349 1.0)
(s350 0.0)
(s35 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/3961 variables, 60/60 constraints. Problems are: Problem set: 0 solved, 14522 unsolved
SMT process timed out in 58403ms, After SMT, problems are : Problem set: 0 solved, 14522 unsolved
Search for dead transitions found 0 dead transitions in 58545ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65671 ms. Remains : 3962/3962 places, 14582/14582 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[1] Max Struct:[60]
Ending property specific reduction for CANInsertWithFailure-PT-060-UpperBounds-09 in 292370 ms.
Starting property specific reduction for CANInsertWithFailure-PT-060-UpperBounds-10
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[60]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[60]
// Phase 1: matrix 14587 rows 3967 cols
[2024-05-21 02:11:28] [INFO ] Computed 62 invariants in 523 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[60]
RANDOM walk for 10000 steps (36 resets) in 199 ms. (50 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 19 ms. (500 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[60]
[2024-05-21 02:11:28] [INFO ] Invariant cache hit.
[2024-05-21 02:11:28] [INFO ] [Real]Absence check using 60 positive place invariants in 68 ms returned sat
[2024-05-21 02:11:28] [INFO ] [Real]Absence check using 60 positive and 2 generalized place invariants in 31 ms returned sat
[2024-05-21 02:11:32] [INFO ] [Real]Absence check using state equation in 3474 ms returned sat
[2024-05-21 02:11:32] [INFO ] State equation strengthened by 14384 read => feed constraints.
[2024-05-21 02:11:33] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:860)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2249)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:929)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[60]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[60]
Support contains 1 out of 3967 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3967/3967 places, 14587/14587 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 3 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 3962 transition count 14582
Partial Free-agglomeration rule applied 8 times.
Drop transitions (Partial Free agglomeration) removed 8 transitions
Iterating global reduction 0 with 8 rules applied. Total rules applied 18 place count 3962 transition count 14582
Applied a total of 18 rules in 2179 ms. Remains 3962 /3967 variables (removed 5) and now considering 14582/14587 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2179 ms. Remains : 3962/3967 places, 14582/14587 transitions.
// Phase 1: matrix 14582 rows 3962 cols
[2024-05-21 02:11:36] [INFO ] Computed 62 invariants in 534 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[60]
RANDOM walk for 1000000 steps (3641 resets) in 20048 ms. (49 steps per ms)
BEST_FIRST walk for 1000001 steps (46 resets) in 1772 ms. (564 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[60]
[2024-05-21 02:11:57] [INFO ] Invariant cache hit.
[2024-05-21 02:11:58] [INFO ] [Real]Absence check using 60 positive place invariants in 65 ms returned sat
[2024-05-21 02:11:58] [INFO ] [Real]Absence check using 60 positive and 2 generalized place invariants in 32 ms returned sat
[2024-05-21 02:12:01] [INFO ] [Real]Absence check using state equation in 3286 ms returned sat
[2024-05-21 02:12:02] [INFO ] State equation strengthened by 14402 read => feed constraints.
[2024-05-21 02:12:03] [INFO ] [Real]Added 14402 Read/Feed constraints in 1272 ms returned sat
[2024-05-21 02:12:03] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 02:12:04] [INFO ] [Nat]Absence check using 60 positive place invariants in 83 ms returned sat
[2024-05-21 02:12:04] [INFO ] [Nat]Absence check using 60 positive and 2 generalized place invariants in 34 ms returned sat
[2024-05-21 02:12:08] [INFO ] [Nat]Absence check using state equation in 3954 ms returned sat
[2024-05-21 02:12:09] [INFO ] [Nat]Added 14402 Read/Feed constraints in 1628 ms returned sat
[2024-05-21 02:12:11] [INFO ] Computed and/alt/rep : 10628/28280/10628 causal constraints (skipped 3894 transitions) in 946 ms.
Minimization took 7300 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[60]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[60]
Support contains 1 out of 3962 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3962/3962 places, 14582/14582 transitions.
Applied a total of 0 rules in 752 ms. Remains 3962 /3962 variables (removed 0) and now considering 14582/14582 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 752 ms. Remains : 3962/3962 places, 14582/14582 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3962/3962 places, 14582/14582 transitions.
Applied a total of 0 rules in 746 ms. Remains 3962 /3962 variables (removed 0) and now considering 14582/14582 (removed 0) transitions.
[2024-05-21 02:12:19] [INFO ] Invariant cache hit.
[2024-05-21 02:12:26] [INFO ] Implicit Places using invariants in 6574 ms returned []
Implicit Place search using SMT only with invariants took 6575 ms to find 0 implicit places.
Running 14522 sub problems to find dead transitions.
[2024-05-21 02:12:26] [INFO ] Invariant cache hit.
[2024-05-21 02:12:26] [INFO ] State equation strengthened by 14402 read => feed constraints.
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
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -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="CANInsertWithFailure-PT-060"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is CANInsertWithFailure-PT-060, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r070-tall-171620505200141"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/CANInsertWithFailure-PT-060.tgz
mv CANInsertWithFailure-PT-060 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "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 [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "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 "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.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 [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
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 ;