About the Execution of 2024-gold for CANInsertWithFailure-PT-030
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 15684.330 | 3600000.00 | 5209929.00 | 9404.50 | 1 ? ? ? ? 1 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/mcc2025-input.r041-smll-174853822500035.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5832
Executing tool gold2024
Input is CANInsertWithFailure-PT-030, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r041-smll-174853822500035
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 6.0M
-rw-r--r-- 1 mcc users 12K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 100K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.9K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.5K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.9K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 64K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.8K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.4K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 4 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 5.6M May 29 14:32 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of positive values
NUM_VECTOR
echo here is the order used to build the result vector(from xml file)
FORMULA_NAME CANInsertWithFailure-PT-030-UpperBounds-00
FORMULA_NAME CANInsertWithFailure-PT-030-UpperBounds-01
FORMULA_NAME CANInsertWithFailure-PT-030-UpperBounds-02
FORMULA_NAME CANInsertWithFailure-PT-030-UpperBounds-03
FORMULA_NAME CANInsertWithFailure-PT-030-UpperBounds-04
FORMULA_NAME CANInsertWithFailure-PT-030-UpperBounds-05
FORMULA_NAME CANInsertWithFailure-PT-030-UpperBounds-06
FORMULA_NAME CANInsertWithFailure-PT-030-UpperBounds-07
FORMULA_NAME CANInsertWithFailure-PT-030-UpperBounds-08
FORMULA_NAME CANInsertWithFailure-PT-030-UpperBounds-09
FORMULA_NAME CANInsertWithFailure-PT-030-UpperBounds-10
FORMULA_NAME CANInsertWithFailure-PT-030-UpperBounds-11
FORMULA_NAME CANInsertWithFailure-PT-030-UpperBounds-12
FORMULA_NAME CANInsertWithFailure-PT-030-UpperBounds-13
FORMULA_NAME CANInsertWithFailure-PT-030-UpperBounds-14
FORMULA_NAME CANInsertWithFailure-PT-030-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1748549634963
Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CANInsertWithFailure-PT-030
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2025-05-29 20:13:57] [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]
[2025-05-29 20:13:57] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-29 20:13:58] [INFO ] Load time of PNML (sax parser for PT used): 750 ms
[2025-05-29 20:13:58] [INFO ] Transformed 2164 places.
[2025-05-29 20:13:58] [INFO ] Transformed 5580 transitions.
[2025-05-29 20:13:58] [INFO ] Parsed PT model containing 2164 places and 5580 transitions and 15000 arcs in 1072 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 14 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 5580 rows 2164 cols
[2025-05-29 20:13:59] [INFO ] Computed 33 invariants in 444 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:[1, 30, 30, 30, 30, 1, 1, 30, 1, 30, 30, 30, 30, 30, 30, 30]
RANDOM walk for 10000 steps (13 resets) in 126 ms. (78 steps per ms)
FORMULA CANInsertWithFailure-PT-030-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CANInsertWithFailure-PT-030-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CANInsertWithFailure-PT-030-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CANInsertWithFailure-PT-030-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 120012 steps (24 resets) in 288 ms. (415 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 1, 0, 1, 1, 1, 0, 1, 0, 1, 1, 1] Max Struct:[30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30]
[2025-05-29 20:13:59] [INFO ] Invariant cache hit.
[2025-05-29 20:14:00] [INFO ] [Real]Absence check using 31 positive place invariants in 137 ms returned sat
[2025-05-29 20:14:00] [INFO ] [Real]Absence check using 31 positive and 2 generalized place invariants in 36 ms returned sat
[2025-05-29 20:14:04] [INFO ] [Real]Absence check using state equation in 3496 ms returned sat
[2025-05-29 20:14:04] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2025-05-29 20:14: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: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)
[2025-05-29 20:14:05] [INFO ] [Real]Absence check using 31 positive place invariants in 57 ms returned sat
[2025-05-29 20:14:05] [INFO ] [Real]Absence check using 31 positive and 2 generalized place invariants in 22 ms returned sat
[2025-05-29 20:14:08] [INFO ] [Real]Absence check using state equation in 3174 ms returned sat
[2025-05-29 20:14:09] [INFO ] SMT solver returned unknown. Retrying;
[2025-05-29 20:14:09] [INFO ] [Real]Added 1770 Read/Feed constraints in 960 ms returned sat
[2025-05-29 20:14:09] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 20:14:10] [INFO ] [Nat]Absence check using 31 positive place invariants in 76 ms returned sat
[2025-05-29 20:14:10] [INFO ] [Nat]Absence check using 31 positive and 2 generalized place invariants in 30 ms returned sat
[2025-05-29 20:14:13] [INFO ] [Nat]Absence check using state equation in 2816 ms returned sat
[2025-05-29 20:14:13] [INFO ] SMT solver returned unknown. Retrying;
[2025-05-29 20:14:14] [INFO ] [Nat]Added 1770 Read/Feed constraints in 1172 ms returned unknown
[2025-05-29 20:14:14] [INFO ] [Real]Absence check using 31 positive place invariants in 50 ms returned sat
[2025-05-29 20:14:14] [INFO ] [Real]Absence check using 31 positive and 2 generalized place invariants in 21 ms returned sat
[2025-05-29 20:14:16] [INFO ] [Real]Absence check using state equation in 2272 ms returned sat
[2025-05-29 20:14:17] [INFO ] [Real]Added 1770 Read/Feed constraints in 360 ms returned sat
[2025-05-29 20:14:17] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 20:14:18] [INFO ] [Nat]Absence check using 31 positive place invariants in 76 ms returned sat
[2025-05-29 20:14:18] [INFO ] [Nat]Absence check using 31 positive and 2 generalized place invariants in 32 ms returned sat
[2025-05-29 20:14:20] [INFO ] [Nat]Absence check using state equation in 2466 ms returned sat
[2025-05-29 20:14:21] [INFO ] SMT solver returned unknown. Retrying;
[2025-05-29 20:14:21] [INFO ] [Nat]Added 1770 Read/Feed constraints in 880 ms returned sat
[2025-05-29 20:14:22] [INFO ] Computed and/alt/rep : 5460/8970/5460 causal constraints (skipped 90 transitions) in 489 ms.
[2025-05-29 20:14: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 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.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1137)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:875)
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)
[2025-05-29 20:14:23] [INFO ] [Real]Absence check using 31 positive place invariants in 69 ms returned sat
[2025-05-29 20:14:23] [INFO ] [Real]Absence check using 31 positive and 2 generalized place invariants in 31 ms returned sat
[2025-05-29 20:14:25] [INFO ] [Real]Absence check using state equation in 2336 ms returned sat
[2025-05-29 20:14:26] [INFO ] [Real]Added 1770 Read/Feed constraints in 333 ms returned sat
[2025-05-29 20:14:26] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 20:14:27] [INFO ] [Nat]Absence check using 31 positive place invariants in 73 ms returned sat
[2025-05-29 20:14:27] [INFO ] [Nat]Absence check using 31 positive and 2 generalized place invariants in 32 ms returned sat
[2025-05-29 20:14:29] [INFO ] [Nat]Absence check using state equation in 2330 ms returned sat
[2025-05-29 20:14:30] [INFO ] SMT solver returned unknown. Retrying;
[2025-05-29 20:14:30] [INFO ] [Nat]Added 1770 Read/Feed constraints in 1160 ms returned unknown
[2025-05-29 20:14:31] [INFO ] [Real]Absence check using 31 positive place invariants in 69 ms returned sat
[2025-05-29 20:14:31] [INFO ] [Real]Absence check using 31 positive and 2 generalized place invariants in 30 ms returned sat
[2025-05-29 20:14:33] [INFO ] [Real]Absence check using state equation in 2167 ms returned sat
[2025-05-29 20:14:34] [INFO ] [Real]Added 1770 Read/Feed constraints in 501 ms returned sat
[2025-05-29 20:14:34] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 20:14:34] [INFO ] [Nat]Absence check using 31 positive place invariants in 56 ms returned sat
[2025-05-29 20:14:34] [INFO ] [Nat]Absence check using 31 positive and 2 generalized place invariants in 41 ms returned sat
[2025-05-29 20:14:37] [INFO ] [Nat]Absence check using state equation in 2422 ms returned sat
[2025-05-29 20:14:37] [INFO ] SMT solver returned unknown. Retrying;
[2025-05-29 20:14:38] [INFO ] [Nat]Added 1770 Read/Feed constraints in 1184 ms returned unknown
[2025-05-29 20:14:38] [INFO ] [Real]Absence check using 31 positive place invariants in 56 ms returned sat
[2025-05-29 20:14:38] [INFO ] [Real]Absence check using 31 positive and 2 generalized place invariants in 22 ms returned sat
[2025-05-29 20:14:41] [INFO ] [Real]Absence check using state equation in 2746 ms returned sat
[2025-05-29 20:14:42] [INFO ] [Real]Added 1770 Read/Feed constraints in 361 ms returned sat
[2025-05-29 20:14:42] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 20:14:42] [INFO ] [Nat]Absence check using 31 positive place invariants in 55 ms returned sat
[2025-05-29 20:14:42] [INFO ] [Nat]Absence check using 31 positive and 2 generalized place invariants in 21 ms returned sat
[2025-05-29 20:14:45] [INFO ] [Nat]Absence check using state equation in 2879 ms returned sat
[2025-05-29 20:14:46] [INFO ] SMT solver returned unknown. Retrying;
[2025-05-29 20:14:46] [INFO ] [Nat]Added 1770 Read/Feed constraints in 1151 ms returned unknown
[2025-05-29 20:14:47] [INFO ] [Real]Absence check using 31 positive place invariants in 51 ms returned sat
[2025-05-29 20:14:47] [INFO ] [Real]Absence check using 31 positive and 2 generalized place invariants in 23 ms returned sat
[2025-05-29 20:14:49] [INFO ] [Real]Absence check using state equation in 2258 ms returned sat
[2025-05-29 20:14:50] [INFO ] [Real]Added 1770 Read/Feed constraints in 267 ms returned sat
[2025-05-29 20:14:50] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 20:14:50] [INFO ] [Nat]Absence check using 31 positive place invariants in 68 ms returned sat
[2025-05-29 20:14:50] [INFO ] [Nat]Absence check using 31 positive and 2 generalized place invariants in 30 ms returned sat
[2025-05-29 20:14:53] [INFO ] [Nat]Absence check using state equation in 2608 ms returned sat
[2025-05-29 20:14:53] [INFO ] SMT solver returned unknown. Retrying;
[2025-05-29 20:14:54] [INFO ] [Nat]Added 1770 Read/Feed constraints in 1180 ms returned unknown
[2025-05-29 20:14:54] [INFO ] [Real]Absence check using 31 positive place invariants in 45 ms returned sat
[2025-05-29 20:14:54] [INFO ] [Real]Absence check using 31 positive and 2 generalized place invariants in 21 ms returned sat
[2025-05-29 20:14:57] [INFO ] [Real]Absence check using state equation in 2402 ms returned sat
[2025-05-29 20:14:57] [INFO ] [Real]Added 1770 Read/Feed constraints in 415 ms returned sat
[2025-05-29 20:14:58] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 20:14:58] [INFO ] [Nat]Absence check using 31 positive place invariants in 76 ms returned sat
[2025-05-29 20:14:58] [INFO ] [Nat]Absence check using 31 positive and 2 generalized place invariants in 37 ms returned sat
[2025-05-29 20:15:01] [INFO ] [Nat]Absence check using state equation in 2789 ms returned sat
[2025-05-29 20:15:02] [INFO ] SMT solver returned unknown. Retrying;
[2025-05-29 20:15:02] [INFO ] [Nat]Added 1770 Read/Feed constraints in 1153 ms returned unknown
[2025-05-29 20:15:03] [INFO ] [Real]Absence check using 31 positive place invariants in 73 ms returned sat
[2025-05-29 20:15:03] [INFO ] [Real]Absence check using 31 positive and 2 generalized place invariants in 33 ms returned sat
[2025-05-29 20:15:05] [INFO ] [Real]Absence check using state equation in 2490 ms returned sat
[2025-05-29 20:15:06] [INFO ] [Real]Added 1770 Read/Feed constraints in 338 ms returned sat
[2025-05-29 20:15:06] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 20:15:07] [INFO ] [Nat]Absence check using 31 positive place invariants in 76 ms returned sat
[2025-05-29 20:15:07] [INFO ] [Nat]Absence check using 31 positive and 2 generalized place invariants in 31 ms returned sat
[2025-05-29 20:15:09] [INFO ] [Nat]Absence check using state equation in 2428 ms returned sat
[2025-05-29 20:15:10] [INFO ] SMT solver returned unknown. Retrying;
[2025-05-29 20:15:10] [INFO ] [Nat]Added 1770 Read/Feed constraints in 1127 ms returned sat
[2025-05-29 20:15:11] [INFO ] Computed and/alt/rep : 5460/8970/5460 causal constraints (skipped 90 transitions) in 585 ms.
[2025-05-29 20:15:11] [INFO ] Added : 0 causal constraints over 0 iterations in 586 ms. Result :unknown
[2025-05-29 20:15:11] [INFO ] [Real]Absence check using 31 positive place invariants in 52 ms returned sat
[2025-05-29 20:15:11] [INFO ] [Real]Absence check using 31 positive and 2 generalized place invariants in 33 ms returned sat
[2025-05-29 20:15:15] [INFO ] [Real]Absence check using state equation in 3198 ms returned sat
[2025-05-29 20:15:16] [INFO ] SMT solver returned unknown. Retrying;
[2025-05-29 20:15:16] [INFO ] [Real]Added 1770 Read/Feed constraints in 875 ms returned sat
[2025-05-29 20:15:16] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 20:15:17] [INFO ] [Nat]Absence check using 31 positive place invariants in 77 ms returned sat
[2025-05-29 20:15:17] [INFO ] [Nat]Absence check using 31 positive and 2 generalized place invariants in 31 ms returned sat
[2025-05-29 20:15:20] [INFO ] [Nat]Absence check using state equation in 3050 ms returned sat
[2025-05-29 20:15:20] [INFO ] SMT solver returned unknown. Retrying;
[2025-05-29 20:15:21] [INFO ] [Nat]Added 1770 Read/Feed constraints in 1153 ms returned unknown
[2025-05-29 20:15:21] [INFO ] [Real]Absence check using 31 positive place invariants in 69 ms returned sat
[2025-05-29 20:15:21] [INFO ] [Real]Absence check using 31 positive and 2 generalized place invariants in 30 ms returned sat
[2025-05-29 20:15:25] [INFO ] [Real]Absence check using state equation in 3462 ms returned sat
[2025-05-29 20:15:26] [INFO ] [Real]Added 1770 Read/Feed constraints in 656 ms returned sat
[2025-05-29 20:15:26] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 20:15:26] [INFO ] [Nat]Absence check using 31 positive place invariants in 77 ms returned sat
[2025-05-29 20:15:26] [INFO ] [Nat]Absence check using 31 positive and 2 generalized place invariants in 32 ms returned sat
[2025-05-29 20:15:30] [INFO ] [Nat]Absence check using state equation in 3527 ms returned sat
[2025-05-29 20:15:31] [INFO ] SMT solver returned unknown. Retrying;
[2025-05-29 20:15:31] [INFO ] [Nat]Added 1770 Read/Feed constraints in 880 ms returned unknown
[2025-05-29 20:15:31] [INFO ] [Real]Absence check using 31 positive place invariants in 74 ms returned sat
[2025-05-29 20:15:31] [INFO ] [Real]Absence check using 31 positive and 2 generalized place invariants in 33 ms returned sat
[2025-05-29 20:15:34] [INFO ] [Real]Absence check using state equation in 3092 ms returned sat
[2025-05-29 20:15:35] [INFO ] [Real]Added 1770 Read/Feed constraints in 584 ms returned sat
[2025-05-29 20:15:35] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 20:15:36] [INFO ] [Nat]Absence check using 31 positive place invariants in 71 ms returned sat
[2025-05-29 20:15:36] [INFO ] [Nat]Absence check using 31 positive and 2 generalized place invariants in 32 ms returned sat
[2025-05-29 20:15:39] [INFO ] [Nat]Absence check using state equation in 3223 ms returned sat
[2025-05-29 20:15:40] [INFO ] SMT solver returned unknown. Retrying;
[2025-05-29 20:15:40] [INFO ] [Nat]Added 1770 Read/Feed constraints in 1153 ms returned unknown
Current structural bounds on expressions (after SMT) : Max Seen:[1, 1, 0, 1, 1, 1, 0, 1, 0, 1, 1, 1] Max Struct:[30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1] Max Struct:[30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30]
Support contains 12 out of 2164 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2164/2164 places, 5580/5580 transitions.
Graph (complete) has 7651 edges and 2164 vertex of which 2163 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.16 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 210 transitions
Trivial Post-agglo rules discarded 210 transitions
Performed 210 trivial Post agglomeration. Transition count delta: 210
Iterating post reduction 0 with 210 rules applied. Total rules applied 211 place count 2163 transition count 5370
Reduce places removed 210 places and 0 transitions.
Iterating post reduction 1 with 210 rules applied. Total rules applied 421 place count 1953 transition count 5370
Performed 861 Post agglomeration using F-continuation condition.Transition count delta: 861
Deduced a syphon composed of 861 places in 2 ms
Reduce places removed 861 places and 0 transitions.
Iterating global reduction 2 with 1722 rules applied. Total rules applied 2143 place count 1092 transition count 4509
Drop transitions (Redundant composition of simpler transitions.) removed 804 transitions
Redundant transition composition rules discarded 804 transitions
Iterating global reduction 2 with 804 rules applied. Total rules applied 2947 place count 1092 transition count 3705
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 2948 place count 1092 transition count 3704
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2949 place count 1091 transition count 3704
Partial Free-agglomeration rule applied 928 times.
Drop transitions (Partial Free agglomeration) removed 928 transitions
Iterating global reduction 3 with 928 rules applied. Total rules applied 3877 place count 1091 transition count 3704
Applied a total of 3877 rules in 1504 ms. Remains 1091 /2164 variables (removed 1073) and now considering 3704/5580 (removed 1876) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1520 ms. Remains : 1091/2164 places, 3704/5580 transitions.
// Phase 1: matrix 3704 rows 1091 cols
[2025-05-29 20:15:42] [INFO ] Computed 32 invariants in 95 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1] Max Struct:[30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30]
RANDOM walk for 1000000 steps (7127 resets) in 9469 ms. (105 steps per ms)
BEST_FIRST walk for 12000012 steps (2445 resets) in 15685 ms. (765 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] Max Struct:[30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30]
[2025-05-29 20:16:07] [INFO ] Invariant cache hit.
[2025-05-29 20:16:07] [INFO ] [Real]Absence check using 30 positive place invariants in 21 ms returned sat
[2025-05-29 20:16:07] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 10 ms returned sat
[2025-05-29 20:16:09] [INFO ] [Real]Absence check using state equation in 1121 ms returned sat
[2025-05-29 20:16:09] [INFO ] State equation strengthened by 3585 read => feed constraints.
[2025-05-29 20:16:09] [INFO ] [Real]Added 3585 Read/Feed constraints in 530 ms returned sat
[2025-05-29 20:16:09] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 20:16:10] [INFO ] [Nat]Absence check using 30 positive place invariants in 40 ms returned sat
[2025-05-29 20:16:10] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 17 ms returned sat
[2025-05-29 20:16:11] [INFO ] [Nat]Absence check using state equation in 1182 ms returned sat
[2025-05-29 20:16:12] [INFO ] [Nat]Added 3585 Read/Feed constraints in 678 ms returned sat
[2025-05-29 20:16:12] [INFO ] Computed and/alt/rep : 2632/6936/2632 causal constraints (skipped 1042 transitions) in 299 ms.
[2025-05-29 20:16:13] [INFO ] Added : 16 causal constraints over 4 iterations in 1647 ms. Result :sat
Minimization took 4505 ms.
[2025-05-29 20:16:18] [INFO ] [Real]Absence check using 30 positive place invariants in 23 ms returned sat
[2025-05-29 20:16:18] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 11 ms returned sat
[2025-05-29 20:16:19] [INFO ] [Real]Absence check using state equation in 954 ms returned sat
[2025-05-29 20:16:20] [INFO ] [Real]Added 3585 Read/Feed constraints in 469 ms returned sat
[2025-05-29 20:16:20] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 20:16:20] [INFO ] [Nat]Absence check using 30 positive place invariants in 42 ms returned sat
[2025-05-29 20:16:20] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 21 ms returned sat
[2025-05-29 20:16:21] [INFO ] [Nat]Absence check using state equation in 1358 ms returned sat
[2025-05-29 20:16:22] [INFO ] [Nat]Added 3585 Read/Feed constraints in 950 ms returned sat
[2025-05-29 20:16:23] [INFO ] Computed and/alt/rep : 2632/6936/2632 causal constraints (skipped 1042 transitions) in 397 ms.
[2025-05-29 20:16:24] [INFO ] Added : 14 causal constraints over 3 iterations in 1834 ms. Result :sat
Minimization took 4712 ms.
[2025-05-29 20:16:29] [INFO ] [Real]Absence check using 30 positive place invariants in 26 ms returned sat
[2025-05-29 20:16:29] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 11 ms returned sat
[2025-05-29 20:16:30] [INFO ] [Real]Absence check using state equation in 1045 ms returned sat
[2025-05-29 20:16:31] [INFO ] [Real]Added 3585 Read/Feed constraints in 630 ms returned sat
[2025-05-29 20:16:31] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 20:16:31] [INFO ] [Nat]Absence check using 30 positive place invariants in 38 ms returned sat
[2025-05-29 20:16:32] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 17 ms returned sat
[2025-05-29 20:16:33] [INFO ] [Nat]Absence check using state equation in 1422 ms returned sat
[2025-05-29 20:16:33] [INFO ] [Nat]Added 3585 Read/Feed constraints in 482 ms returned sat
[2025-05-29 20:16:34] [INFO ] Computed and/alt/rep : 2632/6936/2632 causal constraints (skipped 1042 transitions) in 248 ms.
[2025-05-29 20:16:35] [INFO ] Added : 9 causal constraints over 2 iterations in 1151 ms. Result :sat
Minimization took 4505 ms.
[2025-05-29 20:16:39] [INFO ] [Real]Absence check using 30 positive place invariants in 24 ms returned sat
[2025-05-29 20:16:39] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 10 ms returned sat
[2025-05-29 20:16:41] [INFO ] [Real]Absence check using state equation in 1133 ms returned sat
[2025-05-29 20:16:41] [INFO ] [Real]Added 3585 Read/Feed constraints in 433 ms returned sat
[2025-05-29 20:16:41] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 20:16:41] [INFO ] [Nat]Absence check using 30 positive place invariants in 23 ms returned sat
[2025-05-29 20:16:41] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 10 ms returned sat
[2025-05-29 20:16:43] [INFO ] [Nat]Absence check using state equation in 1193 ms returned sat
[2025-05-29 20:16:44] [INFO ] [Nat]Added 3585 Read/Feed constraints in 1011 ms returned sat
[2025-05-29 20:16:44] [INFO ] Computed and/alt/rep : 2632/6936/2632 causal constraints (skipped 1042 transitions) in 242 ms.
[2025-05-29 20:16:45] [INFO ] Added : 12 causal constraints over 3 iterations in 1257 ms. Result :sat
Minimization took 4613 ms.
[2025-05-29 20:16:50] [INFO ] [Real]Absence check using 30 positive place invariants in 23 ms returned sat
[2025-05-29 20:16:50] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 10 ms returned sat
[2025-05-29 20:16:51] [INFO ] [Real]Absence check using state equation in 1180 ms returned sat
[2025-05-29 20:16:51] [INFO ] [Real]Added 3585 Read/Feed constraints in 396 ms returned sat
[2025-05-29 20:16:52] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 20:16:52] [INFO ] [Nat]Absence check using 30 positive place invariants in 24 ms returned sat
[2025-05-29 20:16:52] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 10 ms returned sat
[2025-05-29 20:16:53] [INFO ] [Nat]Absence check using state equation in 1130 ms returned sat
[2025-05-29 20:16:53] [INFO ] [Nat]Added 3585 Read/Feed constraints in 640 ms returned sat
[2025-05-29 20:16:54] [INFO ] Computed and/alt/rep : 2632/6936/2632 causal constraints (skipped 1042 transitions) in 273 ms.
[2025-05-29 20:16:55] [INFO ] Added : 8 causal constraints over 2 iterations in 1273 ms. Result :sat
Minimization took 4504 ms.
[2025-05-29 20:17:00] [INFO ] [Real]Absence check using 30 positive place invariants in 23 ms returned sat
[2025-05-29 20:17:00] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 10 ms returned sat
[2025-05-29 20:17:01] [INFO ] [Real]Absence check using state equation in 1122 ms returned sat
[2025-05-29 20:17:01] [INFO ] [Real]Added 3585 Read/Feed constraints in 606 ms returned sat
[2025-05-29 20:17:02] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 20:17:02] [INFO ] [Nat]Absence check using 30 positive place invariants in 24 ms returned sat
[2025-05-29 20:17:02] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 10 ms returned sat
[2025-05-29 20:17:03] [INFO ] [Nat]Absence check using state equation in 1162 ms returned sat
[2025-05-29 20:17:04] [INFO ] [Nat]Added 3585 Read/Feed constraints in 1125 ms returned sat
[2025-05-29 20:17:04] [INFO ] Computed and/alt/rep : 2632/6936/2632 causal constraints (skipped 1042 transitions) in 251 ms.
[2025-05-29 20:17:06] [INFO ] Added : 24 causal constraints over 5 iterations in 2126 ms. Result :sat
Minimization took 4505 ms.
[2025-05-29 20:17:11] [INFO ] [Real]Absence check using 30 positive place invariants in 25 ms returned sat
[2025-05-29 20:17:11] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 11 ms returned sat
[2025-05-29 20:17:12] [INFO ] [Real]Absence check using state equation in 1021 ms returned sat
[2025-05-29 20:17:13] [INFO ] [Real]Added 3585 Read/Feed constraints in 555 ms returned sat
[2025-05-29 20:17:13] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 20:17:13] [INFO ] [Nat]Absence check using 30 positive place invariants in 33 ms returned sat
[2025-05-29 20:17:13] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 16 ms returned sat
[2025-05-29 20:17:14] [INFO ] [Nat]Absence check using state equation in 1209 ms returned sat
[2025-05-29 20:17:15] [INFO ] [Nat]Added 3585 Read/Feed constraints in 548 ms returned sat
[2025-05-29 20:17:15] [INFO ] Computed and/alt/rep : 2632/6936/2632 causal constraints (skipped 1042 transitions) in 302 ms.
[2025-05-29 20:17:16] [INFO ] Added : 4 causal constraints over 1 iterations in 879 ms. Result :sat
Minimization took 4504 ms.
[2025-05-29 20:17:21] [INFO ] [Real]Absence check using 30 positive place invariants in 24 ms returned sat
[2025-05-29 20:17:21] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 10 ms returned sat
[2025-05-29 20:17:22] [INFO ] [Real]Absence check using state equation in 1011 ms returned sat
[2025-05-29 20:17:22] [INFO ] [Real]Added 3585 Read/Feed constraints in 529 ms returned sat
[2025-05-29 20:17:22] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 20:17:23] [INFO ] [Nat]Absence check using 30 positive place invariants in 42 ms returned sat
[2025-05-29 20:17:23] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 17 ms returned sat
[2025-05-29 20:17:24] [INFO ] [Nat]Absence check using state equation in 1175 ms returned sat
[2025-05-29 20:17:24] [INFO ] [Nat]Added 3585 Read/Feed constraints in 502 ms returned sat
[2025-05-29 20:17:25] [INFO ] Computed and/alt/rep : 2632/6936/2632 causal constraints (skipped 1042 transitions) in 296 ms.
[2025-05-29 20:17:26] [INFO ] Added : 8 causal constraints over 2 iterations in 1158 ms. Result :sat
Minimization took 4501 ms.
[2025-05-29 20:17:30] [INFO ] [Real]Absence check using 30 positive place invariants in 25 ms returned sat
[2025-05-29 20:17:30] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 10 ms returned sat
[2025-05-29 20:17:32] [INFO ] [Real]Absence check using state equation in 1192 ms returned sat
[2025-05-29 20:17:32] [INFO ] [Real]Added 3585 Read/Feed constraints in 504 ms returned sat
[2025-05-29 20:17:32] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 20:17:33] [INFO ] [Nat]Absence check using 30 positive place invariants in 38 ms returned sat
[2025-05-29 20:17:33] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 17 ms returned sat
[2025-05-29 20:17:34] [INFO ] [Nat]Absence check using state equation in 1207 ms returned sat
[2025-05-29 20:17:34] [INFO ] [Nat]Added 3585 Read/Feed constraints in 512 ms returned sat
[2025-05-29 20:17:35] [INFO ] Computed and/alt/rep : 2632/6936/2632 causal constraints (skipped 1042 transitions) in 277 ms.
[2025-05-29 20:17:35] [INFO ] Added : 8 causal constraints over 2 iterations in 1070 ms. Result :sat
Minimization took 4502 ms.
[2025-05-29 20:17:40] [INFO ] [Real]Absence check using 30 positive place invariants in 25 ms returned sat
[2025-05-29 20:17:40] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 11 ms returned sat
[2025-05-29 20:17:41] [INFO ] [Real]Absence check using state equation in 983 ms returned sat
[2025-05-29 20:17:42] [INFO ] [Real]Added 3585 Read/Feed constraints in 439 ms returned sat
[2025-05-29 20:17:42] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 20:17:42] [INFO ] [Nat]Absence check using 30 positive place invariants in 24 ms returned sat
[2025-05-29 20:17:42] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 11 ms returned sat
[2025-05-29 20:17:43] [INFO ] [Nat]Absence check using state equation in 1155 ms returned sat
[2025-05-29 20:17:44] [INFO ] [Nat]Added 3585 Read/Feed constraints in 502 ms returned sat
[2025-05-29 20:17:44] [INFO ] Computed and/alt/rep : 2632/6936/2632 causal constraints (skipped 1042 transitions) in 369 ms.
[2025-05-29 20:17:46] [INFO ] Added : 11 causal constraints over 3 iterations in 1913 ms. Result :sat
Minimization took 4501 ms.
[2025-05-29 20:17:50] [INFO ] [Real]Absence check using 30 positive place invariants in 27 ms returned sat
[2025-05-29 20:17:50] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 12 ms returned sat
[2025-05-29 20:17:52] [INFO ] [Real]Absence check using state equation in 1259 ms returned sat
[2025-05-29 20:17:52] [INFO ] [Real]Added 3585 Read/Feed constraints in 538 ms returned sat
[2025-05-29 20:17:53] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 20:17:53] [INFO ] [Nat]Absence check using 30 positive place invariants in 23 ms returned sat
[2025-05-29 20:17:53] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 11 ms returned sat
[2025-05-29 20:17:54] [INFO ] [Nat]Absence check using state equation in 1180 ms returned sat
[2025-05-29 20:17:55] [INFO ] [Nat]Added 3585 Read/Feed constraints in 617 ms returned sat
[2025-05-29 20:17:55] [INFO ] Computed and/alt/rep : 2632/6936/2632 causal constraints (skipped 1042 transitions) in 279 ms.
[2025-05-29 20:17:56] [INFO ] Added : 6 causal constraints over 2 iterations in 1307 ms. Result :sat
Minimization took 4506 ms.
[2025-05-29 20:18:01] [INFO ] [Real]Absence check using 30 positive place invariants in 24 ms returned sat
[2025-05-29 20:18:01] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 11 ms returned sat
[2025-05-29 20:18:02] [INFO ] [Real]Absence check using state equation in 1174 ms returned sat
[2025-05-29 20:18:02] [INFO ] [Real]Added 3585 Read/Feed constraints in 445 ms returned sat
[2025-05-29 20:18:03] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 20:18:03] [INFO ] [Nat]Absence check using 30 positive place invariants in 25 ms returned sat
[2025-05-29 20:18:03] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 11 ms returned sat
[2025-05-29 20:18:04] [INFO ] [Nat]Absence check using state equation in 1160 ms returned sat
[2025-05-29 20:18:05] [INFO ] [Nat]Added 3585 Read/Feed constraints in 1108 ms returned sat
[2025-05-29 20:18:05] [INFO ] Computed and/alt/rep : 2632/6936/2632 causal constraints (skipped 1042 transitions) in 252 ms.
[2025-05-29 20:18:07] [INFO ] Added : 17 causal constraints over 4 iterations in 1530 ms. Result :sat
Minimization took 4502 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] Max Struct:[30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] Max Struct:[30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30]
Support contains 12 out of 1091 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1091/1091 places, 3704/3704 transitions.
Applied a total of 0 rules in 111 ms. Remains 1091 /1091 variables (removed 0) and now considering 3704/3704 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 111 ms. Remains : 1091/1091 places, 3704/3704 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1091/1091 places, 3704/3704 transitions.
Applied a total of 0 rules in 98 ms. Remains 1091 /1091 variables (removed 0) and now considering 3704/3704 (removed 0) transitions.
[2025-05-29 20:18:11] [INFO ] Invariant cache hit.
[2025-05-29 20:18:14] [INFO ] Implicit Places using invariants in 2307 ms returned []
[2025-05-29 20:18:14] [INFO ] Invariant cache hit.
[2025-05-29 20:18:15] [INFO ] State equation strengthened by 3585 read => feed constraints.
[2025-05-29 20:18:43] [INFO ] Implicit Places using invariants and state equation in 29626 ms returned []
Implicit Place search using SMT with State Equation took 31939 ms to find 0 implicit places.
[2025-05-29 20:18:44] [INFO ] Redundant transitions in 347 ms returned []
Running 3674 sub problems to find dead transitions.
[2025-05-29 20:18:44] [INFO ] Invariant cache hit.
[2025-05-29 20:18:44] [INFO ] State equation strengthened by 3585 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/1090 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 3674 unsolved
SMT process timed out in 33959ms, After SMT, problems are : Problem set: 0 solved, 3674 unsolved
Search for dead transitions found 0 dead transitions in 34035ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66466 ms. Remains : 1091/1091 places, 3704/3704 transitions.
[2025-05-29 20:19:18] [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] Max Struct:[30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30]
RANDOM walk for 1000000 steps (7115 resets) in 10631 ms. (94 steps per ms)
BEST_FIRST walk for 12000012 steps (2445 resets) in 15645 ms. (766 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] Max Struct:[30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30]
[2025-05-29 20:19:44] [INFO ] Invariant cache hit.
[2025-05-29 20:19:44] [INFO ] [Real]Absence check using 30 positive place invariants in 25 ms returned sat
[2025-05-29 20:19:44] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 11 ms returned sat
[2025-05-29 20:19:45] [INFO ] [Real]Absence check using state equation in 1087 ms returned sat
[2025-05-29 20:19:45] [INFO ] State equation strengthened by 3585 read => feed constraints.
[2025-05-29 20:19:46] [INFO ] [Real]Added 3585 Read/Feed constraints in 432 ms returned sat
[2025-05-29 20:19:46] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 20:19:46] [INFO ] [Nat]Absence check using 30 positive place invariants in 25 ms returned sat
[2025-05-29 20:19:46] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 13 ms returned sat
[2025-05-29 20:19:47] [INFO ] [Nat]Absence check using state equation in 1194 ms returned sat
[2025-05-29 20:19:48] [INFO ] [Nat]Added 3585 Read/Feed constraints in 914 ms returned sat
[2025-05-29 20:19:49] [INFO ] Computed and/alt/rep : 2632/6936/2632 causal constraints (skipped 1042 transitions) in 276 ms.
[2025-05-29 20:19:50] [INFO ] Added : 16 causal constraints over 4 iterations in 1782 ms. Result :sat
Minimization took 4503 ms.
[2025-05-29 20:19:55] [INFO ] [Real]Absence check using 30 positive place invariants in 38 ms returned sat
[2025-05-29 20:19:55] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 18 ms returned sat
[2025-05-29 20:19:56] [INFO ] [Real]Absence check using state equation in 1452 ms returned sat
[2025-05-29 20:19:57] [INFO ] [Real]Added 3585 Read/Feed constraints in 469 ms returned sat
[2025-05-29 20:19:57] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 20:19:57] [INFO ] [Nat]Absence check using 30 positive place invariants in 35 ms returned sat
[2025-05-29 20:19:57] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 16 ms returned sat
[2025-05-29 20:19:59] [INFO ] [Nat]Absence check using state equation in 1241 ms returned sat
[2025-05-29 20:20:00] [INFO ] [Nat]Added 3585 Read/Feed constraints in 967 ms returned sat
[2025-05-29 20:20:00] [INFO ] Computed and/alt/rep : 2632/6936/2632 causal constraints (skipped 1042 transitions) in 413 ms.
[2025-05-29 20:20:01] [INFO ] Added : 14 causal constraints over 3 iterations in 1627 ms. Result :sat
Minimization took 4522 ms.
[2025-05-29 20:20:06] [INFO ] [Real]Absence check using 30 positive place invariants in 26 ms returned sat
[2025-05-29 20:20:06] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 11 ms returned sat
[2025-05-29 20:20:07] [INFO ] [Real]Absence check using state equation in 1219 ms returned sat
[2025-05-29 20:20:08] [INFO ] [Real]Added 3585 Read/Feed constraints in 425 ms returned sat
[2025-05-29 20:20:08] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 20:20:08] [INFO ] [Nat]Absence check using 30 positive place invariants in 23 ms returned sat
[2025-05-29 20:20:08] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 11 ms returned sat
[2025-05-29 20:20:09] [INFO ] [Nat]Absence check using state equation in 1213 ms returned sat
[2025-05-29 20:20:10] [INFO ] [Nat]Added 3585 Read/Feed constraints in 493 ms returned sat
[2025-05-29 20:20:10] [INFO ] Computed and/alt/rep : 2632/6936/2632 causal constraints (skipped 1042 transitions) in 263 ms.
[2025-05-29 20:20:11] [INFO ] Added : 9 causal constraints over 2 iterations in 1194 ms. Result :sat
Minimization took 4503 ms.
[2025-05-29 20:20:16] [INFO ] [Real]Absence check using 30 positive place invariants in 40 ms returned sat
[2025-05-29 20:20:16] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 17 ms returned sat
[2025-05-29 20:20:17] [INFO ] [Real]Absence check using state equation in 1422 ms returned sat
[2025-05-29 20:20:18] [INFO ] [Real]Added 3585 Read/Feed constraints in 460 ms returned sat
[2025-05-29 20:20:18] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 20:20:18] [INFO ] [Nat]Absence check using 30 positive place invariants in 38 ms returned sat
[2025-05-29 20:20:18] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 15 ms returned sat
[2025-05-29 20:20:20] [INFO ] [Nat]Absence check using state equation in 1234 ms returned sat
[2025-05-29 20:20:21] [INFO ] [Nat]Added 3585 Read/Feed constraints in 899 ms returned sat
[2025-05-29 20:20:21] [INFO ] Computed and/alt/rep : 2632/6936/2632 causal constraints (skipped 1042 transitions) in 294 ms.
[2025-05-29 20:20:22] [INFO ] Added : 12 causal constraints over 3 iterations in 1734 ms. Result :sat
Minimization took 4502 ms.
[2025-05-29 20:20:27] [INFO ] [Real]Absence check using 30 positive place invariants in 24 ms returned sat
[2025-05-29 20:20:27] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 10 ms returned sat
[2025-05-29 20:20:29] [INFO ] [Real]Absence check using state equation in 1432 ms returned sat
[2025-05-29 20:20:29] [INFO ] [Real]Added 3585 Read/Feed constraints in 645 ms returned sat
[2025-05-29 20:20:30] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 20:20:30] [INFO ] [Nat]Absence check using 30 positive place invariants in 37 ms returned sat
[2025-05-29 20:20:30] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 16 ms returned sat
[2025-05-29 20:20:31] [INFO ] [Nat]Absence check using state equation in 1197 ms returned sat
[2025-05-29 20:20:32] [INFO ] [Nat]Added 3585 Read/Feed constraints in 501 ms returned sat
[2025-05-29 20:20:32] [INFO ] Computed and/alt/rep : 2632/6936/2632 causal constraints (skipped 1042 transitions) in 284 ms.
[2025-05-29 20:20:33] [INFO ] Added : 8 causal constraints over 2 iterations in 1288 ms. Result :sat
Minimization took 4502 ms.
[2025-05-29 20:20:38] [INFO ] [Real]Absence check using 30 positive place invariants in 24 ms returned sat
[2025-05-29 20:20:38] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 11 ms returned sat
[2025-05-29 20:20:39] [INFO ] [Real]Absence check using state equation in 1039 ms returned sat
[2025-05-29 20:20:39] [INFO ] [Real]Added 3585 Read/Feed constraints in 435 ms returned sat
[2025-05-29 20:20:39] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 20:20:40] [INFO ] [Nat]Absence check using 30 positive place invariants in 25 ms returned sat
[2025-05-29 20:20:40] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 10 ms returned sat
[2025-05-29 20:20:41] [INFO ] [Nat]Absence check using state equation in 1030 ms returned sat
[2025-05-29 20:20:42] [INFO ] [Nat]Added 3585 Read/Feed constraints in 1013 ms returned sat
[2025-05-29 20:20:42] [INFO ] Computed and/alt/rep : 2632/6936/2632 causal constraints (skipped 1042 transitions) in 290 ms.
[2025-05-29 20:20:44] [INFO ] Added : 24 causal constraints over 5 iterations in 1972 ms. Result :sat
Minimization took 4503 ms.
[2025-05-29 20:20:48] [INFO ] [Real]Absence check using 30 positive place invariants in 23 ms returned sat
[2025-05-29 20:20:48] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 13 ms returned sat
[2025-05-29 20:20:49] [INFO ] [Real]Absence check using state equation in 971 ms returned sat
[2025-05-29 20:20:50] [INFO ] [Real]Added 3585 Read/Feed constraints in 432 ms returned sat
[2025-05-29 20:20:50] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 20:20:50] [INFO ] [Nat]Absence check using 30 positive place invariants in 24 ms returned sat
[2025-05-29 20:20:50] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 11 ms returned sat
[2025-05-29 20:20:51] [INFO ] [Nat]Absence check using state equation in 997 ms returned sat
[2025-05-29 20:20:52] [INFO ] [Nat]Added 3585 Read/Feed constraints in 545 ms returned sat
[2025-05-29 20:20:52] [INFO ] Computed and/alt/rep : 2632/6936/2632 causal constraints (skipped 1042 transitions) in 261 ms.
[2025-05-29 20:20:53] [INFO ] Added : 4 causal constraints over 1 iterations in 719 ms. Result :sat
Minimization took 4504 ms.
[2025-05-29 20:20:57] [INFO ] [Real]Absence check using 30 positive place invariants in 23 ms returned sat
[2025-05-29 20:20:57] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 10 ms returned sat
[2025-05-29 20:20:58] [INFO ] [Real]Absence check using state equation in 1153 ms returned sat
[2025-05-29 20:20:59] [INFO ] [Real]Added 3585 Read/Feed constraints in 433 ms returned sat
[2025-05-29 20:20:59] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 20:20:59] [INFO ] [Nat]Absence check using 30 positive place invariants in 40 ms returned sat
[2025-05-29 20:20:59] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 17 ms returned sat
[2025-05-29 20:21:01] [INFO ] [Nat]Absence check using state equation in 1400 ms returned sat
[2025-05-29 20:21:01] [INFO ] [Nat]Added 3585 Read/Feed constraints in 633 ms returned sat
[2025-05-29 20:21:02] [INFO ] Computed and/alt/rep : 2632/6936/2632 causal constraints (skipped 1042 transitions) in 253 ms.
[2025-05-29 20:21:03] [INFO ] Added : 8 causal constraints over 2 iterations in 1072 ms. Result :sat
Minimization took 4503 ms.
[2025-05-29 20:21:07] [INFO ] [Real]Absence check using 30 positive place invariants in 24 ms returned sat
[2025-05-29 20:21:07] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 10 ms returned sat
[2025-05-29 20:21:09] [INFO ] [Real]Absence check using state equation in 1241 ms returned sat
[2025-05-29 20:21:09] [INFO ] [Real]Added 3585 Read/Feed constraints in 401 ms returned sat
[2025-05-29 20:21:09] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 20:21:09] [INFO ] [Nat]Absence check using 30 positive place invariants in 24 ms returned sat
[2025-05-29 20:21:09] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 10 ms returned sat
[2025-05-29 20:21:10] [INFO ] [Nat]Absence check using state equation in 1004 ms returned sat
[2025-05-29 20:21:11] [INFO ] [Nat]Added 3585 Read/Feed constraints in 623 ms returned sat
[2025-05-29 20:21:11] [INFO ] Computed and/alt/rep : 2632/6936/2632 causal constraints (skipped 1042 transitions) in 250 ms.
[2025-05-29 20:21:12] [INFO ] Added : 8 causal constraints over 2 iterations in 1235 ms. Result :sat
Minimization took 4509 ms.
[2025-05-29 20:21:17] [INFO ] [Real]Absence check using 30 positive place invariants in 23 ms returned sat
[2025-05-29 20:21:17] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 10 ms returned sat
[2025-05-29 20:21:18] [INFO ] [Real]Absence check using state equation in 927 ms returned sat
[2025-05-29 20:21:19] [INFO ] [Real]Added 3585 Read/Feed constraints in 453 ms returned sat
[2025-05-29 20:21:19] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 20:21:19] [INFO ] [Nat]Absence check using 30 positive place invariants in 35 ms returned sat
[2025-05-29 20:21:19] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 15 ms returned sat
[2025-05-29 20:21:20] [INFO ] [Nat]Absence check using state equation in 1109 ms returned sat
[2025-05-29 20:21:21] [INFO ] [Nat]Added 3585 Read/Feed constraints in 455 ms returned sat
[2025-05-29 20:21:21] [INFO ] Computed and/alt/rep : 2632/6936/2632 causal constraints (skipped 1042 transitions) in 269 ms.
[2025-05-29 20:21:22] [INFO ] Added : 11 causal constraints over 3 iterations in 1746 ms. Result :sat
Minimization took 4503 ms.
[2025-05-29 20:21:27] [INFO ] [Real]Absence check using 30 positive place invariants in 23 ms returned sat
[2025-05-29 20:21:27] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 14 ms returned sat
[2025-05-29 20:21:28] [INFO ] [Real]Absence check using state equation in 944 ms returned sat
[2025-05-29 20:21:29] [INFO ] [Real]Added 3585 Read/Feed constraints in 402 ms returned sat
[2025-05-29 20:21:29] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 20:21:29] [INFO ] [Nat]Absence check using 30 positive place invariants in 23 ms returned sat
[2025-05-29 20:21:29] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 11 ms returned sat
[2025-05-29 20:21:30] [INFO ] [Nat]Absence check using state equation in 1116 ms returned sat
[2025-05-29 20:21:31] [INFO ] [Nat]Added 3585 Read/Feed constraints in 585 ms returned sat
[2025-05-29 20:21:31] [INFO ] Computed and/alt/rep : 2632/6936/2632 causal constraints (skipped 1042 transitions) in 248 ms.
[2025-05-29 20:21:32] [INFO ] Added : 6 causal constraints over 2 iterations in 1247 ms. Result :sat
Minimization took 4504 ms.
[2025-05-29 20:21:37] [INFO ] [Real]Absence check using 30 positive place invariants in 23 ms returned sat
[2025-05-29 20:21:37] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 11 ms returned sat
[2025-05-29 20:21:38] [INFO ] [Real]Absence check using state equation in 959 ms returned sat
[2025-05-29 20:21:38] [INFO ] [Real]Added 3585 Read/Feed constraints in 402 ms returned sat
[2025-05-29 20:21:38] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 20:21:38] [INFO ] [Nat]Absence check using 30 positive place invariants in 24 ms returned sat
[2025-05-29 20:21:38] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 10 ms returned sat
[2025-05-29 20:21:39] [INFO ] [Nat]Absence check using state equation in 1145 ms returned sat
[2025-05-29 20:21:41] [INFO ] [Nat]Added 3585 Read/Feed constraints in 1096 ms returned sat
[2025-05-29 20:21:41] [INFO ] Computed and/alt/rep : 2632/6936/2632 causal constraints (skipped 1042 transitions) in 275 ms.
[2025-05-29 20:21:43] [INFO ] Added : 17 causal constraints over 4 iterations in 2002 ms. Result :sat
Minimization took 4504 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] Max Struct:[30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] Max Struct:[30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30]
Support contains 12 out of 1091 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1091/1091 places, 3704/3704 transitions.
Applied a total of 0 rules in 104 ms. Remains 1091 /1091 variables (removed 0) and now considering 3704/3704 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 105 ms. Remains : 1091/1091 places, 3704/3704 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1091/1091 places, 3704/3704 transitions.
Applied a total of 0 rules in 102 ms. Remains 1091 /1091 variables (removed 0) and now considering 3704/3704 (removed 0) transitions.
[2025-05-29 20:21:47] [INFO ] Invariant cache hit.
[2025-05-29 20:21:50] [INFO ] Implicit Places using invariants in 2574 ms returned []
[2025-05-29 20:21:50] [INFO ] Invariant cache hit.
[2025-05-29 20:21:52] [INFO ] State equation strengthened by 3585 read => feed constraints.
[2025-05-29 20:22:16] [INFO ] Implicit Places using invariants and state equation in 26224 ms returned []
Implicit Place search using SMT with State Equation took 28801 ms to find 0 implicit places.
[2025-05-29 20:22:17] [INFO ] Redundant transitions in 423 ms returned []
Running 3674 sub problems to find dead transitions.
[2025-05-29 20:22:17] [INFO ] Invariant cache hit.
[2025-05-29 20:22:17] [INFO ] State equation strengthened by 3585 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 1.0)
(s3 0.0)
(s4 1.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 1.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 1.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 1.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 1.0)
(s29 0.0)
(s30 0.0)
(s31 0.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 0.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 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1090 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 3674 unsolved
SMT process timed out in 32766ms, After SMT, problems are : Problem set: 0 solved, 3674 unsolved
Search for dead transitions found 0 dead transitions in 32830ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62176 ms. Remains : 1091/1091 places, 3704/3704 transitions.
RANDOM walk for 40000 steps (282 resets) in 3814 ms. (10 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 24/24 properties
[2025-05-29 20:22:51] [INFO ] Flatten gal took : 937 ms
[2025-05-29 20:22:52] [INFO ] Flatten gal took : 325 ms
[2025-05-29 20:22:52] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8360576893064860644.gal : 166 ms
[2025-05-29 20:22:52] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality736688150743748948.prop : 4 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/ReachabilityCardinality8360576893064860644.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality736688150743748948.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 ...327
Loading property file /tmp/ReachabilityCardinality736688150743748948.prop.
Interrupted probabilistic random walk after 128874 steps, run timeout after 3001 ms. (steps per millisecond=42 ) properties seen :0 out of 24
Probabilistic random walk after 128874 steps, saw 26825 distinct states, run finished after 3007 ms. (steps per millisecond=42 ) properties seen :0
[2025-05-29 20:22:54] [INFO ] Invariant cache hit.
[2025-05-29 20:22:54] [INFO ] State equation strengthened by 3585 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 1 (OVERLAPS) 1017/1029 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 24 unsolved
[2025-05-29 20:22:54] [INFO ] Deduced a trap composed of 2 places in 89 ms of which 16 ms to minimize.
Problem MAX0 is UNSAT
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
At refinement iteration 2 (INCLUDED_ONLY) 0/1029 variables, 1/2 constraints. Problems are: Problem set: 12 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1029 variables, 0/2 constraints. Problems are: Problem set: 12 solved, 12 unsolved
At refinement iteration 4 (OVERLAPS) 58/1087 variables, 29/31 constraints. Problems are: Problem set: 12 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1087 variables, 0/31 constraints. Problems are: Problem set: 12 solved, 12 unsolved
At refinement iteration 6 (OVERLAPS) 2/1089 variables, 2/33 constraints. Problems are: Problem set: 12 solved, 12 unsolved
[2025-05-29 20:22:57] [INFO ] Deduced a trap composed of 35 places in 1175 ms of which 13 ms to minimize.
[2025-05-29 20:22:57] [INFO ] Deduced a trap composed of 34 places in 96 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1089 variables, 2/35 constraints. Problems are: Problem set: 12 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1089 variables, 0/35 constraints. Problems are: Problem set: 12 solved, 12 unsolved
SMT process timed out in 5122ms, After SMT, problems are : Problem set: 12 solved, 12 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 12 out of 1091 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1091/1091 places, 3704/3704 transitions.
Applied a total of 0 rules in 117 ms. Remains 1091 /1091 variables (removed 0) and now considering 3704/3704 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 120 ms. Remains : 1091/1091 places, 3704/3704 transitions.
RANDOM walk for 40000 steps (281 resets) in 891 ms. (44 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 115 ms. (344 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 127 ms. (312 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 126 ms. (314 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 125 ms. (317 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 121 ms. (327 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 108 ms. (367 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 108 ms. (367 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 112 ms. (354 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 105 ms. (377 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 105 ms. (377 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 107 ms. (370 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 103 ms. (384 steps per ms) remains 12/12 properties
SDD proceeding with computation,24 properties remain. new max is 4
SDD size :1 after 963
SDD proceeding with computation,24 properties remain. new max is 8
SDD size :963 after 1043
SDD proceeding with computation,24 properties remain. new max is 16
SDD size :1043 after 1171
SDD proceeding with computation,24 properties remain. new max is 32
SDD size :1171 after 1328
SDD proceeding with computation,24 properties remain. new max is 64
SDD size :1328 after 1552
SDD proceeding with computation,24 properties remain. new max is 128
SDD size :1552 after 1720
SDD proceeding with computation,24 properties remain. new max is 256
SDD size :1720 after 1733
SDD proceeding with computation,24 properties remain. new max is 512
SDD size :1733 after 1773
Interrupted probabilistic random walk after 147410 steps, run timeout after 3001 ms. (steps per millisecond=49 ) properties seen :0 out of 12
Probabilistic random walk after 147410 steps, saw 29011 distinct states, run finished after 3002 ms. (steps per millisecond=49 ) properties seen :0
[2025-05-29 20:23:03] [INFO ] Invariant cache hit.
SDD proceeding with computation,24 properties remain. new max is 1024
SDD size :1773 after 1873
[2025-05-29 20:23:03] [INFO ] State equation strengthened by 3585 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 1017/1029 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2025-05-29 20:23:03] [INFO ] Deduced a trap composed of 2 places in 58 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1029 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1029 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (OVERLAPS) 58/1087 variables, 29/31 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1087 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (OVERLAPS) 2/1089 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 12 unsolved
SDD proceeding with computation,24 properties remain. new max is 2048
SDD size :1873 after 2127
[2025-05-29 20:23:06] [INFO ] Deduced a trap composed of 51 places in 1058 ms of which 12 ms to minimize.
[2025-05-29 20:23:07] [INFO ] Deduced a trap composed of 38 places in 1240 ms of which 10 ms to minimize.
[2025-05-29 20:23:08] [INFO ] Deduced a trap composed of 35 places in 1204 ms of which 14 ms to minimize.
SDD proceeding with computation,24 properties remain. new max is 4096
SDD size :2127 after 2508
At refinement iteration 7 (INCLUDED_ONLY) 0/1089 variables, 3/36 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1089 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 12 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 3704/4793 variables, 1089/1125 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4793 variables, 3585/4710 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/4793 variables, 0/4710 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 12 (OVERLAPS) 2/4795 variables, 2/4712 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/4795 variables, 0/4712 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 14 (OVERLAPS) 0/4795 variables, 0/4712 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4795/4795 variables, and 4712 constraints, problems are : Problem set: 0 solved, 12 unsolved in 12695 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1091/1091 constraints, ReadFeed: 3585/3585 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 1017/1029 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1029 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1029 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (OVERLAPS) 58/1087 variables, 29/31 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1087 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (OVERLAPS) 2/1089 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1089 variables, 3/36 constraints. Problems are: Problem set: 0 solved, 12 unsolved
SDD proceeding with computation,24 properties remain. new max is 8192
SDD size :2508 after 3015
[2025-05-29 20:23:18] [INFO ] Deduced a trap composed of 47 places in 1208 ms of which 10 ms to minimize.
[2025-05-29 20:23:19] [INFO ] Deduced a trap composed of 47 places in 1071 ms of which 9 ms to minimize.
[2025-05-29 20:23:20] [INFO ] Deduced a trap composed of 46 places in 1187 ms of which 13 ms to minimize.
[2025-05-29 20:23:21] [INFO ] Deduced a trap composed of 46 places in 1163 ms of which 9 ms to minimize.
[2025-05-29 20:23:22] [INFO ] Deduced a trap composed of 45 places in 1080 ms of which 10 ms to minimize.
[2025-05-29 20:23:23] [INFO ] Deduced a trap composed of 52 places in 1074 ms of which 8 ms to minimize.
[2025-05-29 20:23:24] [INFO ] Deduced a trap composed of 49 places in 1058 ms of which 9 ms to minimize.
[2025-05-29 20:23:25] [INFO ] Deduced a trap composed of 46 places in 1039 ms of which 9 ms to minimize.
[2025-05-29 20:23:27] [INFO ] Deduced a trap composed of 48 places in 1167 ms of which 8 ms to minimize.
[2025-05-29 20:23:28] [INFO ] Deduced a trap composed of 44 places in 1029 ms of which 9 ms to minimize.
[2025-05-29 20:23:29] [INFO ] Deduced a trap composed of 47 places in 1034 ms of which 9 ms to minimize.
[2025-05-29 20:23:30] [INFO ] Deduced a trap composed of 47 places in 1133 ms of which 14 ms to minimize.
[2025-05-29 20:23:31] [INFO ] Deduced a trap composed of 41 places in 1155 ms of which 9 ms to minimize.
[2025-05-29 20:23:32] [INFO ] Deduced a trap composed of 45 places in 997 ms of which 8 ms to minimize.
[2025-05-29 20:23:33] [INFO ] Deduced a trap composed of 45 places in 996 ms of which 9 ms to minimize.
[2025-05-29 20:23:34] [INFO ] Deduced a trap composed of 40 places in 1129 ms of which 9 ms to minimize.
[2025-05-29 20:23:35] [INFO ] Deduced a trap composed of 39 places in 1056 ms of which 12 ms to minimize.
[2025-05-29 20:23:37] [INFO ] Deduced a trap composed of 71 places in 1223 ms of which 8 ms to minimize.
[2025-05-29 20:23:38] [INFO ] Deduced a trap composed of 41 places in 1090 ms of which 8 ms to minimize.
[2025-05-29 20:23:39] [INFO ] Deduced a trap composed of 38 places in 1065 ms of which 8 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1089 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2025-05-29 20:23:40] [INFO ] Deduced a trap composed of 36 places in 1173 ms of which 9 ms to minimize.
[2025-05-29 20:23:41] [INFO ] Deduced a trap composed of 35 places in 1083 ms of which 8 ms to minimize.
Detected timeout of ITS tools.
[2025-05-29 20:23:42] [INFO ] Deduced a trap composed of 44 places in 1074 ms of which 12 ms to minimize.
[2025-05-29 20:23:42] [INFO ] Flatten gal took : 231 ms
[2025-05-29 20:23:42] [INFO ] Applying decomposition
[2025-05-29 20:23:42] [INFO ] Flatten gal took : 180 ms
[2025-05-29 20:23:43] [INFO ] Deduced a trap composed of 44 places in 742 ms of which 8 ms to minimize.
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/graph11509759657496845911.txt' '-o' '/tmp/graph11509759657496845911.bin' '-w' '/tmp/graph11509759657496845911.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph11509759657496845911.bin' '-l' '-1' '-v' '-w' '/tmp/graph11509759657496845911.weights' '-q' '0' '-e' '0.001'
[2025-05-29 20:23:43] [INFO ] Decomposing Gal with order
[2025-05-29 20:23:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-29 20:23:44] [INFO ] Deduced a trap composed of 46 places in 782 ms of which 9 ms to minimize.
[2025-05-29 20:23:44] [INFO ] Removed a total of 2801 redundant transitions.
[2025-05-29 20:23:44] [INFO ] Flatten gal took : 891 ms
[2025-05-29 20:23:45] [INFO ] Deduced a trap composed of 43 places in 749 ms of which 8 ms to minimize.
[2025-05-29 20:23:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 2900 labels/synchronizations in 420 ms.
[2025-05-29 20:23:45] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14994100230719471766.gal : 51 ms
[2025-05-29 20:23:45] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11551378561072327175.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/ReachabilityCardinality14994100230719471766.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11551378561072327175.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
[2025-05-29 20:23:45] [INFO ] Deduced a trap composed of 48 places in 885 ms of which 11 ms to minimize.
Loading property file /tmp/ReachabilityCardinality11551378561072327175.prop.
[2025-05-29 20:23:46] [INFO ] Deduced a trap composed of 44 places in 780 ms of which 8 ms to minimize.
SDD proceeding with computation,12 properties remain. new max is 4
SDD size :1 after 122
SDD proceeding with computation,12 properties remain. new max is 8
SDD size :122 after 122
SDD proceeding with computation,12 properties remain. new max is 16
SDD size :122 after 122
SDD proceeding with computation,12 properties remain. new max is 32
SDD size :122 after 122
SDD proceeding with computation,12 properties remain. new max is 64
SDD size :122 after 122
SDD proceeding with computation,12 properties remain. new max is 128
SDD size :122 after 122
SDD proceeding with computation,12 properties remain. new max is 256
SDD size :122 after 122
SDD proceeding with computation,12 properties remain. new max is 512
SDD size :122 after 122
SDD proceeding with computation,12 properties remain. new max is 1024
SDD size :122 after 122
SDD proceeding with computation,12 properties remain. new max is 2048
SDD size :122 after 122
SDD proceeding with computation,12 properties remain. new max is 4096
SDD size :122 after 5830
[2025-05-29 20:23:48] [INFO ] Deduced a trap composed of 44 places in 1403 ms of which 13 ms to minimize.
[2025-05-29 20:23:49] [INFO ] Deduced a trap composed of 44 places in 1404 ms of which 12 ms to minimize.
[2025-05-29 20:23:51] [INFO ] Deduced a trap composed of 45 places in 1344 ms of which 11 ms to minimize.
[2025-05-29 20:23:52] [INFO ] Deduced a trap composed of 41 places in 1040 ms of which 7 ms to minimize.
SDD proceeding with computation,12 properties remain. new max is 8192
SDD size :5830 after 566015
[2025-05-29 20:23:53] [INFO ] Deduced a trap composed of 48 places in 1208 ms of which 13 ms to minimize.
[2025-05-29 20:23:54] [INFO ] Deduced a trap composed of 47 places in 1166 ms of which 13 ms to minimize.
[2025-05-29 20:23:55] [INFO ] Deduced a trap composed of 44 places in 1297 ms of which 12 ms to minimize.
[2025-05-29 20:23:57] [INFO ] Deduced a trap composed of 47 places in 1294 ms of which 26 ms to minimize.
[2025-05-29 20:23:58] [INFO ] Deduced a trap composed of 39 places in 1352 ms of which 12 ms to minimize.
[2025-05-29 20:23:59] [INFO ] Deduced a trap composed of 35 places in 1247 ms of which 11 ms to minimize.
[2025-05-29 20:24:01] [INFO ] Deduced a trap composed of 46 places in 1182 ms of which 11 ms to minimize.
SMT process timed out in 57855ms, After SMT, problems are : Problem set: 0 solved, 12 unsolved
Fused 12 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 12 out of 1091 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1091/1091 places, 3704/3704 transitions.
Applied a total of 0 rules in 155 ms. Remains 1091 /1091 variables (removed 0) and now considering 3704/3704 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 156 ms. Remains : 1091/1091 places, 3704/3704 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1091/1091 places, 3704/3704 transitions.
Applied a total of 0 rules in 151 ms. Remains 1091 /1091 variables (removed 0) and now considering 3704/3704 (removed 0) transitions.
[2025-05-29 20:24:01] [INFO ] Invariant cache hit.
[2025-05-29 20:24:03] [INFO ] Implicit Places using invariants in 2041 ms returned []
[2025-05-29 20:24:03] [INFO ] Invariant cache hit.
[2025-05-29 20:24:05] [INFO ] State equation strengthened by 3585 read => feed constraints.
SDD proceeding with computation,12 properties remain. new max is 16384
SDD size :566015 after 2.46756e+07
SDD proceeding with computation,12 properties remain. new max is 32768
SDD size :2.46756e+07 after 2.80617e+07
[2025-05-29 20:24:32] [INFO ] Implicit Places using invariants and state equation in 29169 ms returned []
Implicit Place search using SMT with State Equation took 31213 ms to find 0 implicit places.
[2025-05-29 20:24:32] [INFO ] Redundant transitions in 173 ms returned []
Running 3674 sub problems to find dead transitions.
[2025-05-29 20:24:32] [INFO ] Invariant cache hit.
[2025-05-29 20:24:33] [INFO ] State equation strengthened by 3585 read => feed constraints.
Detected timeout of ITS tools.
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 1.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 1.0)
(s7 0.0)
(s8 1.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 1.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 1.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 1.0)
(s25 0.0)
(s26 1.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 1.0)
(s31 0.0)
(s32 1.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 1.0)
(s37 0.0)
(s38 1.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 1.0)
(s43 0.0)
(s44 1.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 1.0)
(s49 0.0)
(s50 1.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 1.0)
(s55 0.0)
(s56 1.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 1.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 1.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 1.0)
(s73 0.0)
(s74 1.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 1.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 1.0)
(s84 1.0)
(s85 0.0)
(s86 1.0)
(s87 0.0)
(s88 0.0)
(s89 1.0)
(s90 1.0)
(s91 0.0)
(s92 1.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 1.0)
(s97 0.0)
(s98 0.0)
(s99 1.0)
(s100 0.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 0.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 0.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 0.0)
(s152 0.0)
(s153 0.0)
(s154 1.0)
(s155 0.0)
(s156 0.0)
(s157 0.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 0.0)
(s170 0.0)
(s171 0.0)
(s172 1.0)
(s173 1.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 1.0)
(s179 0.0)
(s180 1.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 1.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 0.0)
(s429 0.0)
(s430 0.0)
(s431 0.0)
(s432 0.0)
(s433 0.0)
(s434 0.0)
(s435 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1090 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 3674 unsolved
SMT process timed out in 33025ms, After SMT, problems are : Problem set: 0 solved, 3674 unsolved
Search for dead transitions found 0 dead transitions in 33087ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64647 ms. Remains : 1091/1091 places, 3704/3704 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] Max Struct:[30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30]
Starting property specific reduction for CANInsertWithFailure-PT-030-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:[30]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[30]
[2025-05-29 20:25:05] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[30]
RANDOM walk for 10000 steps (71 resets) in 105 ms. (94 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 16 ms. (588 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[30]
[2025-05-29 20:25:06] [INFO ] Invariant cache hit.
[2025-05-29 20:25:06] [INFO ] [Real]Absence check using 30 positive place invariants in 39 ms returned sat
[2025-05-29 20:25:06] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 23 ms returned sat
[2025-05-29 20:25:07] [INFO ] [Real]Absence check using state equation in 1106 ms returned sat
[2025-05-29 20:25:07] [INFO ] State equation strengthened by 3585 read => feed constraints.
[2025-05-29 20:25:08] [INFO ] [Real]Added 3585 Read/Feed constraints in 542 ms returned sat
[2025-05-29 20:25:08] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 20:25:08] [INFO ] [Nat]Absence check using 30 positive place invariants in 37 ms returned sat
[2025-05-29 20:25:08] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 16 ms returned sat
[2025-05-29 20:25:09] [INFO ] [Nat]Absence check using state equation in 1177 ms returned sat
[2025-05-29 20:25:10] [INFO ] [Nat]Added 3585 Read/Feed constraints in 591 ms returned sat
[2025-05-29 20:25:10] [INFO ] Computed and/alt/rep : 2632/6936/2632 causal constraints (skipped 1042 transitions) in 402 ms.
[2025-05-29 20:25:11] [INFO ] Added : 1 causal constraints over 1 iterations in 1091 ms. Result :sat
Minimization took 930 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[30]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[30]
Support contains 1 out of 1091 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1091/1091 places, 3704/3704 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 16 place count 1083 transition count 3696
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 19 place count 1083 transition count 3696
Applied a total of 19 rules in 365 ms. Remains 1083 /1091 variables (removed 8) and now considering 3696/3704 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 367 ms. Remains : 1083/1091 places, 3696/3704 transitions.
// Phase 1: matrix 3696 rows 1083 cols
[2025-05-29 20:25:13] [INFO ] Computed 32 invariants in 90 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[30]
RANDOM walk for 1000000 steps (7157 resets) in 9081 ms. (110 steps per ms)
BEST_FIRST walk for 1000001 steps (205 resets) in 1403 ms. (712 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[30]
[2025-05-29 20:25:23] [INFO ] Invariant cache hit.
[2025-05-29 20:25:23] [INFO ] [Real]Absence check using 30 positive place invariants in 22 ms returned sat
[2025-05-29 20:25:23] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 11 ms returned sat
[2025-05-29 20:25:25] [INFO ] [Real]Absence check using state equation in 1314 ms returned sat
[2025-05-29 20:25:25] [INFO ] State equation strengthened by 3604 read => feed constraints.
[2025-05-29 20:25:25] [INFO ] [Real]Added 3604 Read/Feed constraints in 557 ms returned sat
[2025-05-29 20:25:25] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 20:25:26] [INFO ] [Nat]Absence check using 30 positive place invariants in 22 ms returned sat
[2025-05-29 20:25:26] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 11 ms returned sat
[2025-05-29 20:25:27] [INFO ] [Nat]Absence check using state equation in 1166 ms returned sat
[2025-05-29 20:25:27] [INFO ] [Nat]Added 3604 Read/Feed constraints in 449 ms returned sat
[2025-05-29 20:25:28] [INFO ] Computed and/alt/rep : 2622/6957/2622 causal constraints (skipped 1044 transitions) in 397 ms.
[2025-05-29 20:25:29] [INFO ] Added : 7 causal constraints over 2 iterations in 1440 ms. Result :sat
Minimization took 4532 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[30]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[30]
Support contains 1 out of 1083 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1083/1083 places, 3696/3696 transitions.
Applied a total of 0 rules in 94 ms. Remains 1083 /1083 variables (removed 0) and now considering 3696/3696 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 95 ms. Remains : 1083/1083 places, 3696/3696 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1083/1083 places, 3696/3696 transitions.
Applied a total of 0 rules in 146 ms. Remains 1083 /1083 variables (removed 0) and now considering 3696/3696 (removed 0) transitions.
[2025-05-29 20:25:34] [INFO ] Invariant cache hit.
[2025-05-29 20:25:36] [INFO ] Implicit Places using invariants in 2469 ms returned []
[2025-05-29 20:25:36] [INFO ] Invariant cache hit.
[2025-05-29 20:25:38] [INFO ] State equation strengthened by 3604 read => feed constraints.
[2025-05-29 20:26:08] [INFO ] Implicit Places using invariants and state equation in 32065 ms returned []
Implicit Place search using SMT with State Equation took 34538 ms to find 0 implicit places.
[2025-05-29 20:26:08] [INFO ] Redundant transitions in 270 ms returned []
Running 3666 sub problems to find dead transitions.
[2025-05-29 20:26:08] [INFO ] Invariant cache hit.
[2025-05-29 20:26:09] [INFO ] State equation strengthened by 3604 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 1.0)
(s3 0.0)
(s4 1.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 1.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 1.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 1.0)
(s23 0.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 1.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 1.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 1.0)
(s47 1.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 1.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 1.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 0.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 1.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 1.0)
(s119 1.0)
(s120 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1082 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 3666 unsolved
SMT process timed out in 32933ms, After SMT, problems are : Problem set: 0 solved, 3666 unsolved
Search for dead transitions found 0 dead transitions in 33002ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 67979 ms. Remains : 1083/1083 places, 3696/3696 transitions.
[2025-05-29 20:26:41] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[30]
RANDOM walk for 1000000 steps (7144 resets) in 9294 ms. (107 steps per ms)
BEST_FIRST walk for 1000000 steps (204 resets) in 1239 ms. (806 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[30]
[2025-05-29 20:26:52] [INFO ] Invariant cache hit.
[2025-05-29 20:26:52] [INFO ] [Real]Absence check using 30 positive place invariants in 24 ms returned sat
[2025-05-29 20:26:52] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 11 ms returned sat
[2025-05-29 20:26:53] [INFO ] [Real]Absence check using state equation in 1345 ms returned sat
[2025-05-29 20:26:54] [INFO ] State equation strengthened by 3604 read => feed constraints.
[2025-05-29 20:26:54] [INFO ] [Real]Added 3604 Read/Feed constraints in 421 ms returned sat
[2025-05-29 20:26:54] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 20:26:54] [INFO ] [Nat]Absence check using 30 positive place invariants in 24 ms returned sat
[2025-05-29 20:26:54] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 10 ms returned sat
[2025-05-29 20:26:55] [INFO ] [Nat]Absence check using state equation in 1083 ms returned sat
[2025-05-29 20:26:56] [INFO ] [Nat]Added 3604 Read/Feed constraints in 449 ms returned sat
[2025-05-29 20:26:56] [INFO ] Computed and/alt/rep : 2622/6957/2622 causal constraints (skipped 1044 transitions) in 427 ms.
[2025-05-29 20:26:58] [INFO ] Added : 7 causal constraints over 2 iterations in 1677 ms. Result :sat
Minimization took 4508 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[30]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[30]
Support contains 1 out of 1083 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1083/1083 places, 3696/3696 transitions.
Applied a total of 0 rules in 96 ms. Remains 1083 /1083 variables (removed 0) and now considering 3696/3696 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 97 ms. Remains : 1083/1083 places, 3696/3696 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1083/1083 places, 3696/3696 transitions.
Applied a total of 0 rules in 101 ms. Remains 1083 /1083 variables (removed 0) and now considering 3696/3696 (removed 0) transitions.
[2025-05-29 20:27:02] [INFO ] Invariant cache hit.
[2025-05-29 20:27:05] [INFO ] Implicit Places using invariants in 2170 ms returned []
[2025-05-29 20:27:05] [INFO ] Invariant cache hit.
[2025-05-29 20:27:06] [INFO ] State equation strengthened by 3604 read => feed constraints.
[2025-05-29 20:27:36] [INFO ] Implicit Places using invariants and state equation in 31285 ms returned []
Implicit Place search using SMT with State Equation took 33456 ms to find 0 implicit places.
[2025-05-29 20:27:36] [INFO ] Redundant transitions in 247 ms returned []
Running 3666 sub problems to find dead transitions.
[2025-05-29 20:27:36] [INFO ] Invariant cache hit.
[2025-05-29 20:27:36] [INFO ] State equation strengthened by 3604 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1082 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 3666 unsolved
SMT process timed out in 33113ms, After SMT, problems are : Problem set: 0 solved, 3666 unsolved
Search for dead transitions found 0 dead transitions in 33172ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66996 ms. Remains : 1083/1083 places, 3696/3696 transitions.
[2025-05-29 20:28:10] [INFO ] Flatten gal took : 340 ms
RANDOM walk for 40000 steps (283 resets) in 1310 ms. (30 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 185 ms. (215 steps per ms) remains 2/2 properties
[2025-05-29 20:28:10] [INFO ] Flatten gal took : 147 ms
BEST_FIRST walk for 40004 steps (8 resets) in 137 ms. (289 steps per ms) remains 2/2 properties
[2025-05-29 20:28:10] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7863561156093342243.gal : 33 ms
[2025-05-29 20:28:10] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6802036346923693792.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/ReachabilityCardinality7863561156093342243.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6802036346923693792.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/ReachabilityCardinality6802036346923693792.prop.
Interrupted probabilistic random walk after 150323 steps, run timeout after 3001 ms. (steps per millisecond=50 ) properties seen :0 out of 2
Probabilistic random walk after 150323 steps, saw 28997 distinct states, run finished after 3001 ms. (steps per millisecond=50 ) properties seen :0
[2025-05-29 20:28:13] [INFO ] Invariant cache hit.
[2025-05-29 20:28:13] [INFO ] State equation strengthened by 3604 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) 1020/1021 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-05-29 20:28:13] [INFO ] Deduced a trap composed of 2 places in 57 ms of which 2 ms to minimize.
Problem MAX0 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/1021 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1021 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 58/1079 variables, 29/31 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1079 variables, 0/31 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/1081 variables, 2/33 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2025-05-29 20:28:15] [INFO ] Deduced a trap composed of 47 places in 1110 ms of which 10 ms to minimize.
[2025-05-29 20:28:16] [INFO ] Deduced a trap composed of 41 places in 1029 ms of which 10 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1081 variables, 2/35 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1081 variables, 0/35 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 3696/4777 variables, 1081/1116 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4777 variables, 3604/4720 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/4777 variables, 0/4720 constraints. Problems are: Problem set: 1 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 2/4779 variables, 2/4722 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/4779 variables, 0/4722 constraints. Problems are: Problem set: 1 solved, 1 unsolved
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 963
At refinement iteration 14 (OVERLAPS) 0/4779 variables, 0/4722 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4779/4779 variables, and 4722 constraints, problems are : Problem set: 1 solved, 1 unsolved in 4777 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1083/1083 constraints, ReadFeed: 3604/3604 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1020/1021 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1021 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2025-05-29 20:28:18] [INFO ] Deduced a trap composed of 2 places in 56 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1021 variables, 1/3 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1021 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 58/1079 variables, 29/32 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1079 variables, 0/32 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/1081 variables, 2/34 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1081 variables, 2/36 constraints. Problems are: Problem set: 1 solved, 1 unsolved
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :963 after 1043
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :1043 after 1171
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :1171 after 1367
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :1367 after 1563
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :1563 after 1718
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :1718 after 1731
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :1731 after 1771
[2025-05-29 20:28:19] [INFO ] Deduced a trap composed of 60 places in 1217 ms of which 10 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :1771 after 1871
[2025-05-29 20:28:21] [INFO ] Deduced a trap composed of 42 places in 1211 ms of which 10 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :1871 after 2123
[2025-05-29 20:28:22] [INFO ] Deduced a trap composed of 37 places in 1134 ms of which 10 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/1081 variables, 3/39 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1081 variables, 0/39 constraints. Problems are: Problem set: 1 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 4777/4779 variables, and 1120 constraints, problems are : Problem set: 1 solved, 1 unsolved in 5009 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1081/1083 constraints, ReadFeed: 0/3604 constraints, PredecessorRefiner: 0/2 constraints, Known Traps: 7/7 constraints]
After SMT, in 9845ms problems are : Problem set: 1 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 1083 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1083/1083 places, 3696/3696 transitions.
Applied a total of 0 rules in 98 ms. Remains 1083 /1083 variables (removed 0) and now considering 3696/3696 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 99 ms. Remains : 1083/1083 places, 3696/3696 transitions.
RANDOM walk for 40000 steps (285 resets) in 652 ms. (61 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 62 ms. (634 steps per ms) remains 1/1 properties
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :2123 after 2503
Interrupted probabilistic random walk after 179226 steps, run timeout after 3001 ms. (steps per millisecond=59 ) properties seen :0 out of 1
Probabilistic random walk after 179226 steps, saw 32252 distinct states, run finished after 3003 ms. (steps per millisecond=59 ) properties seen :0
[2025-05-29 20:28:26] [INFO ] Invariant cache hit.
[2025-05-29 20:28:26] [INFO ] State equation strengthened by 3604 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) 1020/1021 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-29 20:28:26] [INFO ] Deduced a trap composed of 2 places in 46 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1021 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1021 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 58/1079 variables, 29/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1079 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/1081 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-29 20:28:28] [INFO ] Deduced a trap composed of 38 places in 1060 ms of which 9 ms to minimize.
[2025-05-29 20:28:29] [INFO ] Deduced a trap composed of 39 places in 1012 ms of which 8 ms to minimize.
[2025-05-29 20:28:30] [INFO ] Deduced a trap composed of 36 places in 1014 ms of which 9 ms to minimize.
[2025-05-29 20:28:31] [INFO ] Deduced a trap composed of 35 places in 1010 ms of which 9 ms to minimize.
[2025-05-29 20:28:32] [INFO ] Deduced a trap composed of 40 places in 967 ms of which 8 ms to minimize.
[2025-05-29 20:28:33] [INFO ] Deduced a trap composed of 63 places in 943 ms of which 8 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :2503 after 3060
[2025-05-29 20:28:34] [INFO ] Deduced a trap composed of 37 places in 884 ms of which 8 ms to minimize.
[2025-05-29 20:28:34] [INFO ] Deduced a trap composed of 35 places in 878 ms of which 8 ms to minimize.
[2025-05-29 20:28:35] [INFO ] Deduced a trap composed of 39 places in 844 ms of which 8 ms to minimize.
[2025-05-29 20:28:36] [INFO ] Deduced a trap composed of 38 places in 838 ms of which 8 ms to minimize.
[2025-05-29 20:28:37] [INFO ] Deduced a trap composed of 36 places in 835 ms of which 7 ms to minimize.
[2025-05-29 20:28:38] [INFO ] Deduced a trap composed of 42 places in 811 ms of which 7 ms to minimize.
[2025-05-29 20:28:39] [INFO ] Deduced a trap composed of 44 places in 801 ms of which 7 ms to minimize.
[2025-05-29 20:28:39] [INFO ] Deduced a trap composed of 35 places in 756 ms of which 7 ms to minimize.
[2025-05-29 20:28:40] [INFO ] Deduced a trap composed of 39 places in 702 ms of which 6 ms to minimize.
[2025-05-29 20:28:41] [INFO ] Deduced a trap composed of 58 places in 698 ms of which 7 ms to minimize.
[2025-05-29 20:28:42] [INFO ] Deduced a trap composed of 41 places in 696 ms of which 7 ms to minimize.
[2025-05-29 20:28:42] [INFO ] Deduced a trap composed of 38 places in 689 ms of which 6 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1081 variables, 18/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1081 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 3696/4777 variables, 1081/1132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4777 variables, 3604/4736 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/4777 variables, 0/4736 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 2/4779 variables, 2/4738 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/4779 variables, 0/4738 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/4779 variables, 0/4738 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4779/4779 variables, and 4738 constraints, problems are : Problem set: 0 solved, 1 unsolved in 18580 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1083/1083 constraints, ReadFeed: 3604/3604 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 19/19 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) 1020/1021 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1021 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-29 20:28:45] [INFO ] Deduced a trap composed of 2 places in 46 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1021 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1021 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 58/1079 variables, 29/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1079 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/1081 variables, 2/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1081 variables, 18/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-29 20:28:46] [INFO ] Deduced a trap composed of 60 places in 1141 ms of which 10 ms to minimize.
[2025-05-29 20:28:47] [INFO ] Deduced a trap composed of 52 places in 1142 ms of which 10 ms to minimize.
[2025-05-29 20:28:48] [INFO ] Deduced a trap composed of 38 places in 1086 ms of which 9 ms to minimize.
[2025-05-29 20:28:50] [INFO ] Deduced a trap composed of 40 places in 1106 ms of which 10 ms to minimize.
[2025-05-29 20:28:51] [INFO ] Deduced a trap composed of 39 places in 1082 ms of which 10 ms to minimize.
[2025-05-29 20:28:52] [INFO ] Deduced a trap composed of 38 places in 978 ms of which 9 ms to minimize.
[2025-05-29 20:28:53] [INFO ] Deduced a trap composed of 44 places in 982 ms of which 9 ms to minimize.
[2025-05-29 20:28:54] [INFO ] Deduced a trap composed of 44 places in 943 ms of which 9 ms to minimize.
[2025-05-29 20:28:55] [INFO ] Deduced a trap composed of 55 places in 1039 ms of which 9 ms to minimize.
[2025-05-29 20:28:56] [INFO ] Deduced a trap composed of 53 places in 957 ms of which 7 ms to minimize.
[2025-05-29 20:28:57] [INFO ] Deduced a trap composed of 45 places in 952 ms of which 8 ms to minimize.
[2025-05-29 20:28:58] [INFO ] Deduced a trap composed of 38 places in 808 ms of which 11 ms to minimize.
[2025-05-29 20:28:58] [INFO ] Deduced a trap composed of 41 places in 764 ms of which 8 ms to minimize.
[2025-05-29 20:28:59] [INFO ] Deduced a trap composed of 34 places in 1177 ms of which 11 ms to minimize.
Detected timeout of ITS tools.
[2025-05-29 20:29:00] [INFO ] Flatten gal took : 147 ms
[2025-05-29 20:29:00] [INFO ] Applying decomposition
[2025-05-29 20:29:00] [INFO ] Flatten gal took : 154 ms
[2025-05-29 20:29:00] [INFO ] Deduced a trap composed of 38 places in 901 ms of which 11 ms to minimize.
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/graph18355450544299281743.txt' '-o' '/tmp/graph18355450544299281743.bin' '-w' '/tmp/graph18355450544299281743.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph18355450544299281743.bin' '-l' '-1' '-v' '-w' '/tmp/graph18355450544299281743.weights' '-q' '0' '-e' '0.001'
[2025-05-29 20:29:01] [INFO ] Decomposing Gal with order
[2025-05-29 20:29:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-29 20:29:01] [INFO ] Removed a total of 2827 redundant transitions.
[2025-05-29 20:29:01] [INFO ] Flatten gal took : 358 ms
[2025-05-29 20:29:01] [INFO ] Deduced a trap composed of 36 places in 861 ms of which 7 ms to minimize.
[2025-05-29 20:29:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 3398 labels/synchronizations in 241 ms.
[2025-05-29 20:29:02] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10451233652063241140.gal : 41 ms
[2025-05-29 20:29:02] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3407071378424222567.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/ReachabilityCardinality10451233652063241140.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3407071378424222567.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
[2025-05-29 20:29:02] [INFO ] Deduced a trap composed of 36 places in 612 ms of which 7 ms to minimize.
Loading property file /tmp/ReachabilityCardinality3407071378424222567.prop.
[2025-05-29 20:29:03] [INFO ] Deduced a trap composed of 36 places in 629 ms of which 7 ms to minimize.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 2215
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :2215 after 2215
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :2215 after 2215
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :2215 after 2215
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :2215 after 2215
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :2215 after 2215
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :2215 after 2215
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :2215 after 2241
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :2241 after 2254
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :2254 after 2268
[2025-05-29 20:29:03] [INFO ] Deduced a trap composed of 38 places in 665 ms of which 7 ms to minimize.
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :2268 after 2512
[2025-05-29 20:29:04] [INFO ] Deduced a trap composed of 53 places in 732 ms of which 7 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/1081 variables, 20/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-29 20:29:05] [INFO ] Deduced a trap composed of 45 places in 722 ms of which 6 ms to minimize.
[2025-05-29 20:29:06] [INFO ] Deduced a trap composed of 44 places in 728 ms of which 8 ms to minimize.
[2025-05-29 20:29:06] [INFO ] Deduced a trap composed of 41 places in 672 ms of which 7 ms to minimize.
[2025-05-29 20:29:07] [INFO ] Deduced a trap composed of 41 places in 687 ms of which 7 ms to minimize.
[2025-05-29 20:29:08] [INFO ] Deduced a trap composed of 43 places in 691 ms of which 6 ms to minimize.
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :2512 after 364918
[2025-05-29 20:29:08] [INFO ] Deduced a trap composed of 38 places in 704 ms of which 7 ms to minimize.
[2025-05-29 20:29:09] [INFO ] Deduced a trap composed of 45 places in 828 ms of which 10 ms to minimize.
[2025-05-29 20:29:10] [INFO ] Deduced a trap composed of 41 places in 936 ms of which 9 ms to minimize.
[2025-05-29 20:29:11] [INFO ] Deduced a trap composed of 41 places in 971 ms of which 10 ms to minimize.
[2025-05-29 20:29:12] [INFO ] Deduced a trap composed of 38 places in 970 ms of which 9 ms to minimize.
[2025-05-29 20:29:13] [INFO ] Deduced a trap composed of 38 places in 941 ms of which 9 ms to minimize.
[2025-05-29 20:29:14] [INFO ] Deduced a trap composed of 38 places in 919 ms of which 10 ms to minimize.
[2025-05-29 20:29:15] [INFO ] Deduced a trap composed of 38 places in 969 ms of which 10 ms to minimize.
[2025-05-29 20:29:16] [INFO ] Deduced a trap composed of 38 places in 898 ms of which 9 ms to minimize.
[2025-05-29 20:29:17] [INFO ] Deduced a trap composed of 39 places in 924 ms of which 9 ms to minimize.
[2025-05-29 20:29:18] [INFO ] Deduced a trap composed of 37 places in 841 ms of which 8 ms to minimize.
[2025-05-29 20:29:19] [INFO ] Deduced a trap composed of 38 places in 772 ms of which 8 ms to minimize.
[2025-05-29 20:29:20] [INFO ] Deduced a trap composed of 37 places in 754 ms of which 8 ms to minimize.
[2025-05-29 20:29:20] [INFO ] Deduced a trap composed of 39 places in 688 ms of which 8 ms to minimize.
[2025-05-29 20:29:21] [INFO ] Deduced a trap composed of 39 places in 720 ms of which 7 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/1081 variables, 20/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-29 20:29:22] [INFO ] Deduced a trap composed of 37 places in 700 ms of which 7 ms to minimize.
[2025-05-29 20:29:23] [INFO ] Deduced a trap composed of 36 places in 691 ms of which 7 ms to minimize.
[2025-05-29 20:29:23] [INFO ] Deduced a trap composed of 35 places in 695 ms of which 7 ms to minimize.
[2025-05-29 20:29:24] [INFO ] Deduced a trap composed of 37 places in 655 ms of which 5 ms to minimize.
[2025-05-29 20:29:25] [INFO ] Deduced a trap composed of 35 places in 611 ms of which 9 ms to minimize.
[2025-05-29 20:29:25] [INFO ] Deduced a trap composed of 37 places in 810 ms of which 8 ms to minimize.
[2025-05-29 20:29:26] [INFO ] Deduced a trap composed of 46 places in 748 ms of which 8 ms to minimize.
[2025-05-29 20:29:27] [INFO ] Deduced a trap composed of 44 places in 711 ms of which 5 ms to minimize.
[2025-05-29 20:29:27] [INFO ] Deduced a trap composed of 40 places in 477 ms of which 5 ms to minimize.
[2025-05-29 20:29:28] [INFO ] Deduced a trap composed of 41 places in 480 ms of which 5 ms to minimize.
[2025-05-29 20:29:28] [INFO ] Deduced a trap composed of 37 places in 449 ms of which 5 ms to minimize.
[2025-05-29 20:29:29] [INFO ] Deduced a trap composed of 38 places in 414 ms of which 4 ms to minimize.
[2025-05-29 20:29:29] [INFO ] Deduced a trap composed of 38 places in 626 ms of which 7 ms to minimize.
[2025-05-29 20:29:30] [INFO ] Deduced a trap composed of 35 places in 659 ms of which 8 ms to minimize.
SMT process timed out in 64098ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 1083 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1083/1083 places, 3696/3696 transitions.
Applied a total of 0 rules in 143 ms. Remains 1083 /1083 variables (removed 0) and now considering 3696/3696 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 143 ms. Remains : 1083/1083 places, 3696/3696 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1083/1083 places, 3696/3696 transitions.
Applied a total of 0 rules in 141 ms. Remains 1083 /1083 variables (removed 0) and now considering 3696/3696 (removed 0) transitions.
[2025-05-29 20:29:30] [INFO ] Invariant cache hit.
[2025-05-29 20:29:33] [INFO ] Implicit Places using invariants in 2395 ms returned []
[2025-05-29 20:29:33] [INFO ] Invariant cache hit.
[2025-05-29 20:29:34] [INFO ] State equation strengthened by 3604 read => feed constraints.
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :364918 after 4.95302e+07
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :4.95302e+07 after 5.17443e+07
Detected timeout of ITS tools.
[2025-05-29 20:30:01] [INFO ] Implicit Places using invariants and state equation in 28244 ms returned []
Implicit Place search using SMT with State Equation took 30642 ms to find 0 implicit places.
[2025-05-29 20:30:01] [INFO ] Redundant transitions in 159 ms returned []
Running 3666 sub problems to find dead transitions.
[2025-05-29 20:30:01] [INFO ] Invariant cache hit.
[2025-05-29 20:30:01] [INFO ] State equation strengthened by 3604 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1082 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 3666 unsolved
SMT process timed out in 32711ms, After SMT, problems are : Problem set: 0 solved, 3666 unsolved
Search for dead transitions found 0 dead transitions in 32749ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63710 ms. Remains : 1083/1083 places, 3696/3696 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[1] Max Struct:[30]
Ending property specific reduction for CANInsertWithFailure-PT-030-UpperBounds-01 in 328553 ms.
Starting property specific reduction for CANInsertWithFailure-PT-030-UpperBounds-02
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:[30]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[30]
// Phase 1: matrix 3704 rows 1091 cols
[2025-05-29 20:30:34] [INFO ] Computed 32 invariants in 77 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[30]
RANDOM walk for 10000 steps (70 resets) in 146 ms. (68 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 22 ms. (434 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[30]
[2025-05-29 20:30:34] [INFO ] Invariant cache hit.
[2025-05-29 20:30:35] [INFO ] [Real]Absence check using 30 positive place invariants in 40 ms returned sat
[2025-05-29 20:30:35] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 18 ms returned sat
[2025-05-29 20:30:36] [INFO ] [Real]Absence check using state equation in 1231 ms returned sat
[2025-05-29 20:30:36] [INFO ] State equation strengthened by 3585 read => feed constraints.
[2025-05-29 20:30:36] [INFO ] [Real]Added 3585 Read/Feed constraints in 405 ms returned sat
[2025-05-29 20:30:37] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 20:30:37] [INFO ] [Nat]Absence check using 30 positive place invariants in 38 ms returned sat
[2025-05-29 20:30:37] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 17 ms returned sat
[2025-05-29 20:30:38] [INFO ] [Nat]Absence check using state equation in 1159 ms returned sat
[2025-05-29 20:30:39] [INFO ] SMT solver returned unknown. Retrying;
[2025-05-29 20:30:39] [INFO ] [Nat]Added 3585 Read/Feed constraints in 827 ms returned sat
[2025-05-29 20:30:39] [INFO ] Computed and/alt/rep : 2632/6936/2632 causal constraints (skipped 1042 transitions) in 252 ms.
[2025-05-29 20:30:40] [INFO ] Added : 14 causal constraints over 3 iterations in 1454 ms. Result :sat
Minimization took 764 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[30]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[30]
Support contains 1 out of 1091 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1091/1091 places, 3704/3704 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 16 place count 1083 transition count 3696
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 19 place count 1083 transition count 3696
Applied a total of 19 rules in 210 ms. Remains 1083 /1091 variables (removed 8) and now considering 3696/3704 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 211 ms. Remains : 1083/1091 places, 3696/3704 transitions.
// Phase 1: matrix 3696 rows 1083 cols
[2025-05-29 20:30:41] [INFO ] Computed 32 invariants in 75 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[30]
RANDOM walk for 1000000 steps (7155 resets) in 9679 ms. (103 steps per ms)
BEST_FIRST walk for 1000001 steps (202 resets) in 1246 ms. (801 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[30]
[2025-05-29 20:30:52] [INFO ] Invariant cache hit.
[2025-05-29 20:30:53] [INFO ] [Real]Absence check using 30 positive place invariants in 21 ms returned sat
[2025-05-29 20:30:53] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 10 ms returned sat
[2025-05-29 20:30:54] [INFO ] [Real]Absence check using state equation in 1116 ms returned sat
[2025-05-29 20:30:54] [INFO ] State equation strengthened by 3604 read => feed constraints.
[2025-05-29 20:30:54] [INFO ] [Real]Added 3604 Read/Feed constraints in 450 ms returned sat
[2025-05-29 20:30:54] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 20:30:55] [INFO ] [Nat]Absence check using 30 positive place invariants in 22 ms returned sat
[2025-05-29 20:30:55] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 10 ms returned sat
[2025-05-29 20:30:56] [INFO ] [Nat]Absence check using state equation in 955 ms returned sat
[2025-05-29 20:30:56] [INFO ] [Nat]Added 3604 Read/Feed constraints in 473 ms returned sat
[2025-05-29 20:30:56] [INFO ] Computed and/alt/rep : 2622/6957/2622 causal constraints (skipped 1044 transitions) in 263 ms.
[2025-05-29 20:30:57] [INFO ] Added : 10 causal constraints over 2 iterations in 1287 ms. Result :sat
Minimization took 4559 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[30]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[30]
Support contains 1 out of 1083 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1083/1083 places, 3696/3696 transitions.
Applied a total of 0 rules in 85 ms. Remains 1083 /1083 variables (removed 0) and now considering 3696/3696 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 85 ms. Remains : 1083/1083 places, 3696/3696 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1083/1083 places, 3696/3696 transitions.
Applied a total of 0 rules in 83 ms. Remains 1083 /1083 variables (removed 0) and now considering 3696/3696 (removed 0) transitions.
[2025-05-29 20:31:02] [INFO ] Invariant cache hit.
[2025-05-29 20:31:05] [INFO ] Implicit Places using invariants in 2493 ms returned []
[2025-05-29 20:31:05] [INFO ] Invariant cache hit.
[2025-05-29 20:31:06] [INFO ] State equation strengthened by 3604 read => feed constraints.
[2025-05-29 20:31:35] [INFO ] Implicit Places using invariants and state equation in 29940 ms returned []
Implicit Place search using SMT with State Equation took 32434 ms to find 0 implicit places.
[2025-05-29 20:31:35] [INFO ] Redundant transitions in 162 ms returned []
Running 3666 sub problems to find dead transitions.
[2025-05-29 20:31:35] [INFO ] Invariant cache hit.
[2025-05-29 20:31:35] [INFO ] State equation strengthened by 3604 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1082 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 3666 unsolved
SMT process timed out in 32766ms, After SMT, problems are : Problem set: 0 solved, 3666 unsolved
Search for dead transitions found 0 dead transitions in 32804ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65497 ms. Remains : 1083/1083 places, 3696/3696 transitions.
[2025-05-29 20:32:08] [INFO ] Flatten gal took : 144 ms
[2025-05-29 20:32:08] [INFO ] Flatten gal took : 156 ms
[2025-05-29 20:32:08] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15425375140132636740.gal : 35 ms
[2025-05-29 20:32:08] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12902982596233528587.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/ReachabilityCardinality15425375140132636740.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12902982596233528587.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
RANDOM walk for 40000 steps (283 resets) in 1128 ms. (35 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 147 ms. (270 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 158 ms. (251 steps per ms) remains 2/2 properties
Loading property file /tmp/ReachabilityCardinality12902982596233528587.prop.
Interrupted probabilistic random walk after 133330 steps, run timeout after 3001 ms. (steps per millisecond=44 ) properties seen :0 out of 2
Probabilistic random walk after 133330 steps, saw 27007 distinct states, run finished after 3001 ms. (steps per millisecond=44 ) properties seen :0
[2025-05-29 20:32:11] [INFO ] Invariant cache hit.
[2025-05-29 20:32:11] [INFO ] State equation strengthened by 3604 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) 1020/1021 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-05-29 20:32:11] [INFO ] Deduced a trap composed of 2 places in 49 ms of which 1 ms to minimize.
Problem MAX0 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/1021 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1021 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 58/1079 variables, 29/31 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1079 variables, 0/31 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/1081 variables, 2/33 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2025-05-29 20:32:13] [INFO ] Deduced a trap composed of 51 places in 1136 ms of which 10 ms to minimize.
[2025-05-29 20:32:14] [INFO ] Deduced a trap composed of 38 places in 1136 ms of which 9 ms to minimize.
[2025-05-29 20:32:15] [INFO ] Deduced a trap composed of 38 places in 1141 ms of which 10 ms to minimize.
[2025-05-29 20:32:16] [INFO ] Deduced a trap composed of 41 places in 1049 ms of which 9 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 963
[2025-05-29 20:32:17] [INFO ] Deduced a trap composed of 52 places in 979 ms of which 9 ms to minimize.
SMT process timed out in 5983ms, After SMT, problems are : Problem set: 1 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 1083 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1083/1083 places, 3696/3696 transitions.
Applied a total of 0 rules in 85 ms. Remains 1083 /1083 variables (removed 0) and now considering 3696/3696 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 86 ms. Remains : 1083/1083 places, 3696/3696 transitions.
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :963 after 1043
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :1043 after 1171
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :1171 after 1367
RANDOM walk for 40000 steps (284 resets) in 506 ms. (78 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 69 ms. (571 steps per ms) remains 1/1 properties
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :1367 after 1563
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :1563 after 1718
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :1718 after 1731
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :1731 after 1771
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :1771 after 1871
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :1871 after 2123
Interrupted probabilistic random walk after 181166 steps, run timeout after 3001 ms. (steps per millisecond=60 ) properties seen :0 out of 1
Probabilistic random walk after 181166 steps, saw 32449 distinct states, run finished after 3001 ms. (steps per millisecond=60 ) properties seen :0
[2025-05-29 20:32:20] [INFO ] Invariant cache hit.
[2025-05-29 20:32:20] [INFO ] State equation strengthened by 3604 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) 1020/1021 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-29 20:32:21] [INFO ] Deduced a trap composed of 2 places in 57 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1021 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1021 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 58/1079 variables, 29/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1079 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/1081 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-29 20:32:22] [INFO ] Deduced a trap composed of 55 places in 1101 ms of which 9 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :2123 after 2503
[2025-05-29 20:32:23] [INFO ] Deduced a trap composed of 38 places in 1140 ms of which 9 ms to minimize.
[2025-05-29 20:32:24] [INFO ] Deduced a trap composed of 37 places in 1043 ms of which 9 ms to minimize.
[2025-05-29 20:32:25] [INFO ] Deduced a trap composed of 34 places in 1009 ms of which 10 ms to minimize.
[2025-05-29 20:32:26] [INFO ] Deduced a trap composed of 38 places in 947 ms of which 9 ms to minimize.
[2025-05-29 20:32:27] [INFO ] Deduced a trap composed of 38 places in 939 ms of which 8 ms to minimize.
[2025-05-29 20:32:28] [INFO ] Deduced a trap composed of 38 places in 950 ms of which 9 ms to minimize.
[2025-05-29 20:32:29] [INFO ] Deduced a trap composed of 38 places in 893 ms of which 8 ms to minimize.
[2025-05-29 20:32:30] [INFO ] Deduced a trap composed of 58 places in 919 ms of which 8 ms to minimize.
[2025-05-29 20:32:31] [INFO ] Deduced a trap composed of 43 places in 865 ms of which 8 ms to minimize.
[2025-05-29 20:32:32] [INFO ] Deduced a trap composed of 38 places in 855 ms of which 8 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :2503 after 3047
[2025-05-29 20:32:33] [INFO ] Deduced a trap composed of 37 places in 900 ms of which 8 ms to minimize.
[2025-05-29 20:32:33] [INFO ] Deduced a trap composed of 38 places in 860 ms of which 8 ms to minimize.
[2025-05-29 20:32:34] [INFO ] Deduced a trap composed of 35 places in 852 ms of which 8 ms to minimize.
[2025-05-29 20:32:35] [INFO ] Deduced a trap composed of 49 places in 891 ms of which 8 ms to minimize.
[2025-05-29 20:32:36] [INFO ] Deduced a trap composed of 36 places in 889 ms of which 8 ms to minimize.
[2025-05-29 20:32:37] [INFO ] Deduced a trap composed of 39 places in 889 ms of which 9 ms to minimize.
[2025-05-29 20:32:38] [INFO ] Deduced a trap composed of 39 places in 868 ms of which 8 ms to minimize.
[2025-05-29 20:32:39] [INFO ] Deduced a trap composed of 36 places in 807 ms of which 8 ms to minimize.
[2025-05-29 20:32:40] [INFO ] Deduced a trap composed of 41 places in 815 ms of which 7 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1081 variables, 20/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-29 20:32:41] [INFO ] Deduced a trap composed of 41 places in 824 ms of which 7 ms to minimize.
[2025-05-29 20:32:41] [INFO ] Deduced a trap composed of 48 places in 787 ms of which 7 ms to minimize.
[2025-05-29 20:32:42] [INFO ] Deduced a trap composed of 43 places in 825 ms of which 8 ms to minimize.
[2025-05-29 20:32:43] [INFO ] Deduced a trap composed of 37 places in 745 ms of which 7 ms to minimize.
[2025-05-29 20:32:44] [INFO ] Deduced a trap composed of 46 places in 677 ms of which 7 ms to minimize.
[2025-05-29 20:32:44] [INFO ] Deduced a trap composed of 40 places in 701 ms of which 7 ms to minimize.
[2025-05-29 20:32:45] [INFO ] Deduced a trap composed of 37 places in 700 ms of which 7 ms to minimize.
[2025-05-29 20:32:46] [INFO ] Deduced a trap composed of 36 places in 694 ms of which 7 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1081 variables, 8/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/1081 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 3696/4777 variables, 1081/1142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/4777 variables, 3604/4746 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/4777 variables, 0/4746 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 2/4779 variables, 2/4748 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/4779 variables, 0/4748 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/4779 variables, 0/4748 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4779/4779 variables, and 4748 constraints, problems are : Problem set: 0 solved, 1 unsolved in 27408 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1083/1083 constraints, ReadFeed: 3604/3604 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 29/29 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) 1020/1021 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1021 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-29 20:32:48] [INFO ] Deduced a trap composed of 2 places in 41 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1021 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1021 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 58/1079 variables, 29/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1079 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/1081 variables, 2/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1081 variables, 28/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-29 20:32:49] [INFO ] Deduced a trap composed of 60 places in 1020 ms of which 9 ms to minimize.
[2025-05-29 20:32:50] [INFO ] Deduced a trap composed of 41 places in 1044 ms of which 9 ms to minimize.
[2025-05-29 20:32:51] [INFO ] Deduced a trap composed of 42 places in 1061 ms of which 9 ms to minimize.
[2025-05-29 20:32:52] [INFO ] Deduced a trap composed of 36 places in 1017 ms of which 8 ms to minimize.
[2025-05-29 20:32:53] [INFO ] Deduced a trap composed of 48 places in 965 ms of which 8 ms to minimize.
[2025-05-29 20:32:54] [INFO ] Deduced a trap composed of 51 places in 964 ms of which 8 ms to minimize.
[2025-05-29 20:32:55] [INFO ] Deduced a trap composed of 43 places in 924 ms of which 7 ms to minimize.
[2025-05-29 20:32:56] [INFO ] Deduced a trap composed of 43 places in 962 ms of which 8 ms to minimize.
[2025-05-29 20:32:57] [INFO ] Deduced a trap composed of 41 places in 980 ms of which 9 ms to minimize.
Detected timeout of ITS tools.
[2025-05-29 20:32:58] [INFO ] Flatten gal took : 83 ms
[2025-05-29 20:32:58] [INFO ] Applying decomposition
[2025-05-29 20:32:58] [INFO ] Flatten gal took : 87 ms
[2025-05-29 20:32:58] [INFO ] Deduced a trap composed of 36 places in 1025 ms of which 65 ms to minimize.
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/graph3507384802943798179.txt' '-o' '/tmp/graph3507384802943798179.bin' '-w' '/tmp/graph3507384802943798179.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3507384802943798179.bin' '-l' '-1' '-v' '-w' '/tmp/graph3507384802943798179.weights' '-q' '0' '-e' '0.001'
[2025-05-29 20:32:59] [INFO ] Decomposing Gal with order
[2025-05-29 20:32:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-29 20:32:59] [INFO ] Removed a total of 2827 redundant transitions.
[2025-05-29 20:32:59] [INFO ] Flatten gal took : 346 ms
[2025-05-29 20:32:59] [INFO ] Deduced a trap composed of 51 places in 827 ms of which 9 ms to minimize.
[2025-05-29 20:32:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 3510 labels/synchronizations in 134 ms.
[2025-05-29 20:32:59] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality18052645179487656782.gal : 37 ms
[2025-05-29 20:32:59] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12166092546163641357.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/ReachabilityCardinality18052645179487656782.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12166092546163641357.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/ReachabilityCardinality12166092546163641357.prop.
[2025-05-29 20:33:00] [INFO ] Deduced a trap composed of 39 places in 771 ms of which 9 ms to minimize.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 1366
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :1366 after 1366
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :1366 after 1366
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :1366 after 1366
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :1366 after 1366
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :1366 after 1366
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :1366 after 1366
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :1366 after 1391
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :1391 after 1405
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :1405 after 1421
[2025-05-29 20:33:01] [INFO ] Deduced a trap composed of 41 places in 959 ms of which 8 ms to minimize.
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :1421 after 1956
[2025-05-29 20:33:02] [INFO ] Deduced a trap composed of 47 places in 959 ms of which 8 ms to minimize.
[2025-05-29 20:33:03] [INFO ] Deduced a trap composed of 39 places in 930 ms of which 8 ms to minimize.
[2025-05-29 20:33:04] [INFO ] Deduced a trap composed of 36 places in 861 ms of which 7 ms to minimize.
[2025-05-29 20:33:05] [INFO ] Deduced a trap composed of 37 places in 861 ms of which 8 ms to minimize.
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :1956 after 379278
[2025-05-29 20:33:06] [INFO ] Deduced a trap composed of 37 places in 835 ms of which 8 ms to minimize.
[2025-05-29 20:33:06] [INFO ] Deduced a trap composed of 37 places in 832 ms of which 8 ms to minimize.
[2025-05-29 20:33:07] [INFO ] Deduced a trap composed of 47 places in 795 ms of which 8 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/1081 variables, 20/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-29 20:33:08] [INFO ] Deduced a trap composed of 57 places in 818 ms of which 8 ms to minimize.
[2025-05-29 20:33:09] [INFO ] Deduced a trap composed of 38 places in 805 ms of which 7 ms to minimize.
[2025-05-29 20:33:10] [INFO ] Deduced a trap composed of 38 places in 804 ms of which 7 ms to minimize.
[2025-05-29 20:33:11] [INFO ] Deduced a trap composed of 39 places in 803 ms of which 7 ms to minimize.
[2025-05-29 20:33:11] [INFO ] Deduced a trap composed of 60 places in 819 ms of which 7 ms to minimize.
[2025-05-29 20:33:12] [INFO ] Deduced a trap composed of 36 places in 803 ms of which 8 ms to minimize.
[2025-05-29 20:33:13] [INFO ] Deduced a trap composed of 36 places in 795 ms of which 8 ms to minimize.
[2025-05-29 20:33:14] [INFO ] Deduced a trap composed of 36 places in 795 ms of which 7 ms to minimize.
[2025-05-29 20:33:15] [INFO ] Deduced a trap composed of 45 places in 735 ms of which 7 ms to minimize.
[2025-05-29 20:33:15] [INFO ] Deduced a trap composed of 38 places in 676 ms of which 6 ms to minimize.
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :379278 after 1.78098e+07
[2025-05-29 20:33:16] [INFO ] Deduced a trap composed of 45 places in 688 ms of which 6 ms to minimize.
[2025-05-29 20:33:17] [INFO ] Deduced a trap composed of 39 places in 685 ms of which 7 ms to minimize.
[2025-05-29 20:33:17] [INFO ] Deduced a trap composed of 41 places in 677 ms of which 6 ms to minimize.
[2025-05-29 20:33:18] [INFO ] Deduced a trap composed of 41 places in 679 ms of which 6 ms to minimize.
[2025-05-29 20:33:19] [INFO ] Deduced a trap composed of 38 places in 675 ms of which 6 ms to minimize.
[2025-05-29 20:33:20] [INFO ] Deduced a trap composed of 38 places in 703 ms of which 6 ms to minimize.
[2025-05-29 20:33:20] [INFO ] Deduced a trap composed of 37 places in 709 ms of which 7 ms to minimize.
[2025-05-29 20:33:21] [INFO ] Deduced a trap composed of 44 places in 705 ms of which 7 ms to minimize.
[2025-05-29 20:33:22] [INFO ] Deduced a trap composed of 38 places in 716 ms of which 6 ms to minimize.
[2025-05-29 20:33:22] [INFO ] Deduced a trap composed of 38 places in 703 ms of which 7 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/1081 variables, 20/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-29 20:33:23] [INFO ] Deduced a trap composed of 39 places in 749 ms of which 6 ms to minimize.
[2025-05-29 20:33:24] [INFO ] Deduced a trap composed of 37 places in 767 ms of which 7 ms to minimize.
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :1.78098e+07 after 2.04652e+07
[2025-05-29 20:33:25] [INFO ] Deduced a trap composed of 39 places in 762 ms of which 7 ms to minimize.
[2025-05-29 20:33:26] [INFO ] Deduced a trap composed of 41 places in 762 ms of which 7 ms to minimize.
[2025-05-29 20:33:26] [INFO ] Deduced a trap composed of 37 places in 722 ms of which 6 ms to minimize.
[2025-05-29 20:33:27] [INFO ] Deduced a trap composed of 38 places in 643 ms of which 6 ms to minimize.
[2025-05-29 20:33:28] [INFO ] Deduced a trap composed of 35 places in 560 ms of which 6 ms to minimize.
[2025-05-29 20:33:28] [INFO ] Deduced a trap composed of 38 places in 525 ms of which 6 ms to minimize.
[2025-05-29 20:33:29] [INFO ] Deduced a trap composed of 46 places in 503 ms of which 5 ms to minimize.
[2025-05-29 20:33:29] [INFO ] Deduced a trap composed of 38 places in 459 ms of which 5 ms to minimize.
[2025-05-29 20:33:30] [INFO ] Deduced a trap composed of 39 places in 495 ms of which 6 ms to minimize.
[2025-05-29 20:33:30] [INFO ] Deduced a trap composed of 39 places in 470 ms of which 5 ms to minimize.
[2025-05-29 20:33:31] [INFO ] Deduced a trap composed of 38 places in 458 ms of which 5 ms to minimize.
[2025-05-29 20:33:31] [INFO ] Deduced a trap composed of 37 places in 498 ms of which 4 ms to minimize.
[2025-05-29 20:33:32] [INFO ] Deduced a trap composed of 37 places in 463 ms of which 5 ms to minimize.
[2025-05-29 20:33:32] [INFO ] Deduced a trap composed of 37 places in 433 ms of which 4 ms to minimize.
[2025-05-29 20:33:32] [INFO ] Deduced a trap composed of 37 places in 427 ms of which 4 ms to minimize.
[2025-05-29 20:33:33] [INFO ] Deduced a trap composed of 41 places in 429 ms of which 5 ms to minimize.
SMT process timed out in 72567ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 1083 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1083/1083 places, 3696/3696 transitions.
Applied a total of 0 rules in 84 ms. Remains 1083 /1083 variables (removed 0) and now considering 3696/3696 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 84 ms. Remains : 1083/1083 places, 3696/3696 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1083/1083 places, 3696/3696 transitions.
Applied a total of 0 rules in 84 ms. Remains 1083 /1083 variables (removed 0) and now considering 3696/3696 (removed 0) transitions.
[2025-05-29 20:33:33] [INFO ] Invariant cache hit.
[2025-05-29 20:33:35] [INFO ] Implicit Places using invariants in 1567 ms returned []
[2025-05-29 20:33:35] [INFO ] Invariant cache hit.
[2025-05-29 20:33:36] [INFO ] State equation strengthened by 3604 read => feed constraints.
Detected timeout of ITS tools.
[2025-05-29 20:34:05] [INFO ] Implicit Places using invariants and state equation in 30640 ms returned []
Implicit Place search using SMT with State Equation took 32209 ms to find 0 implicit places.
[2025-05-29 20:34:05] [INFO ] Redundant transitions in 158 ms returned []
Running 3666 sub problems to find dead transitions.
[2025-05-29 20:34:06] [INFO ] Invariant cache hit.
[2025-05-29 20:34:06] [INFO ] State equation strengthened by 3604 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1082 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 3666 unsolved
SMT process timed out in 32733ms, After SMT, problems are : Problem set: 0 solved, 3666 unsolved
Search for dead transitions found 0 dead transitions in 32771ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65237 ms. Remains : 1083/1083 places, 3696/3696 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[1] Max Struct:[30]
Ending property specific reduction for CANInsertWithFailure-PT-030-UpperBounds-02 in 244238 ms.
Starting property specific reduction for CANInsertWithFailure-PT-030-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:[30]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[30]
// Phase 1: matrix 3704 rows 1091 cols
[2025-05-29 20:34:38] [INFO ] Computed 32 invariants in 74 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[30]
RANDOM walk for 10000 steps (71 resets) in 147 ms. (67 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 22 ms. (434 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[30]
[2025-05-29 20:34:39] [INFO ] Invariant cache hit.
[2025-05-29 20:34:39] [INFO ] [Real]Absence check using 30 positive place invariants in 42 ms returned sat
[2025-05-29 20:34:39] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 17 ms returned sat
[2025-05-29 20:34:40] [INFO ] [Real]Absence check using state equation in 1232 ms returned sat
[2025-05-29 20:34:40] [INFO ] State equation strengthened by 3585 read => feed constraints.
[2025-05-29 20:34:41] [INFO ] [Real]Added 3585 Read/Feed constraints in 636 ms returned sat
[2025-05-29 20:34:41] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 20:34:41] [INFO ] [Nat]Absence check using 30 positive place invariants in 25 ms returned sat
[2025-05-29 20:34:41] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 10 ms returned sat
[2025-05-29 20:34:42] [INFO ] [Nat]Absence check using state equation in 1159 ms returned sat
[2025-05-29 20:34:43] [INFO ] [Nat]Added 3585 Read/Feed constraints in 502 ms returned sat
[2025-05-29 20:34:43] [INFO ] Computed and/alt/rep : 2632/6936/2632 causal constraints (skipped 1042 transitions) in 267 ms.
[2025-05-29 20:34:44] [INFO ] Added : 9 causal constraints over 2 iterations in 1244 ms. Result :sat
Minimization took 790 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[30]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[30]
Support contains 1 out of 1091 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1091/1091 places, 3704/3704 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 16 place count 1083 transition count 3696
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 19 place count 1083 transition count 3696
Applied a total of 19 rules in 294 ms. Remains 1083 /1091 variables (removed 8) and now considering 3696/3704 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 294 ms. Remains : 1083/1091 places, 3696/3704 transitions.
// Phase 1: matrix 3696 rows 1083 cols
[2025-05-29 20:34:45] [INFO ] Computed 32 invariants in 65 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[30]
RANDOM walk for 1000000 steps (7151 resets) in 10027 ms. (99 steps per ms)
BEST_FIRST walk for 1000001 steps (209 resets) in 1234 ms. (809 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[30]
[2025-05-29 20:34:57] [INFO ] Invariant cache hit.
[2025-05-29 20:34:57] [INFO ] [Real]Absence check using 30 positive place invariants in 22 ms returned sat
[2025-05-29 20:34:57] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 14 ms returned sat
[2025-05-29 20:34:58] [INFO ] [Real]Absence check using state equation in 1328 ms returned sat
[2025-05-29 20:34:58] [INFO ] State equation strengthened by 3604 read => feed constraints.
[2025-05-29 20:34:59] [INFO ] [Real]Added 3604 Read/Feed constraints in 607 ms returned sat
[2025-05-29 20:34:59] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 20:34:59] [INFO ] [Nat]Absence check using 30 positive place invariants in 22 ms returned sat
[2025-05-29 20:34:59] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 11 ms returned sat
[2025-05-29 20:35:00] [INFO ] [Nat]Absence check using state equation in 1225 ms returned sat
[2025-05-29 20:35:01] [INFO ] [Nat]Added 3604 Read/Feed constraints in 643 ms returned sat
[2025-05-29 20:35:02] [INFO ] Computed and/alt/rep : 2624/6963/2624 causal constraints (skipped 1042 transitions) in 354 ms.
[2025-05-29 20:35:03] [INFO ] Added : 9 causal constraints over 2 iterations in 1405 ms. Result :sat
Minimization took 5293 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[30]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[30]
Support contains 1 out of 1083 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1083/1083 places, 3696/3696 transitions.
Applied a total of 0 rules in 86 ms. Remains 1083 /1083 variables (removed 0) and now considering 3696/3696 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 87 ms. Remains : 1083/1083 places, 3696/3696 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1083/1083 places, 3696/3696 transitions.
Applied a total of 0 rules in 84 ms. Remains 1083 /1083 variables (removed 0) and now considering 3696/3696 (removed 0) transitions.
[2025-05-29 20:35:08] [INFO ] Invariant cache hit.
[2025-05-29 20:35:11] [INFO ] Implicit Places using invariants in 2424 ms returned []
[2025-05-29 20:35:11] [INFO ] Invariant cache hit.
[2025-05-29 20:35:12] [INFO ] State equation strengthened by 3604 read => feed constraints.
[2025-05-29 20:35:40] [INFO ] Implicit Places using invariants and state equation in 29330 ms returned []
Implicit Place search using SMT with State Equation took 31760 ms to find 0 implicit places.
[2025-05-29 20:35:40] [INFO ] Redundant transitions in 161 ms returned []
Running 3666 sub problems to find dead transitions.
[2025-05-29 20:35:40] [INFO ] Invariant cache hit.
[2025-05-29 20:35:40] [INFO ] State equation strengthened by 3604 read => feed constraints.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/1082 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 3666 unsolved
SMT process timed out in 33097ms, After SMT, problems are : Problem set: 0 solved, 3666 unsolved
Search for dead transitions found 0 dead transitions in 33135ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65222 ms. Remains : 1083/1083 places, 3696/3696 transitions.
[2025-05-29 20:36:13] [INFO ] Flatten gal took : 151 ms
[2025-05-29 20:36:14] [INFO ] Flatten gal took : 206 ms
RANDOM walk for 40000 steps (282 resets) in 1576 ms. (25 steps per ms) remains 2/2 properties
[2025-05-29 20:36:14] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15445352387088335898.gal : 45 ms
[2025-05-29 20:36:14] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5175938757096512751.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/ReachabilityCardinality15445352387088335898.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5175938757096512751.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
BEST_FIRST walk for 40004 steps (8 resets) in 150 ms. (264 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 124 ms. (320 steps per ms) remains 2/2 properties
Loading property file /tmp/ReachabilityCardinality5175938757096512751.prop.
Interrupted probabilistic random walk after 156270 steps, run timeout after 3001 ms. (steps per millisecond=52 ) properties seen :0 out of 2
Probabilistic random walk after 156270 steps, saw 29702 distinct states, run finished after 3001 ms. (steps per millisecond=52 ) properties seen :0
[2025-05-29 20:36:17] [INFO ] Invariant cache hit.
[2025-05-29 20:36:17] [INFO ] State equation strengthened by 3604 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) 1020/1021 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-05-29 20:36:17] [INFO ] Deduced a trap composed of 2 places in 71 ms of which 2 ms to minimize.
Problem MAX0 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/1021 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1021 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 58/1079 variables, 29/31 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1079 variables, 0/31 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/1081 variables, 2/33 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2025-05-29 20:36:19] [INFO ] Deduced a trap composed of 52 places in 1710 ms of which 13 ms to minimize.
[2025-05-29 20:36:21] [INFO ] Deduced a trap composed of 39 places in 1372 ms of which 9 ms to minimize.
[2025-05-29 20:36:22] [INFO ] Deduced a trap composed of 40 places in 1219 ms of which 14 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 963
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :963 after 1043
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :1043 after 1171
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :1171 after 1367
[2025-05-29 20:36:23] [INFO ] Deduced a trap composed of 37 places in 1567 ms of which 13 ms to minimize.
SMT process timed out in 6612ms, After SMT, problems are : Problem set: 1 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 1083 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1083/1083 places, 3696/3696 transitions.
Applied a total of 0 rules in 117 ms. Remains 1083 /1083 variables (removed 0) and now considering 3696/3696 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 117 ms. Remains : 1083/1083 places, 3696/3696 transitions.
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :1367 after 1563
RANDOM walk for 40000 steps (284 resets) in 832 ms. (48 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 98 ms. (404 steps per ms) remains 1/1 properties
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :1563 after 1718
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :1718 after 1731
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :1731 after 1771
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :1771 after 1871
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :1871 after 2123
Interrupted probabilistic random walk after 144927 steps, run timeout after 3001 ms. (steps per millisecond=48 ) properties seen :0 out of 1
Probabilistic random walk after 144927 steps, saw 28404 distinct states, run finished after 3001 ms. (steps per millisecond=48 ) properties seen :0
[2025-05-29 20:36:27] [INFO ] Invariant cache hit.
[2025-05-29 20:36:27] [INFO ] State equation strengthened by 3604 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) 1020/1021 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-29 20:36:27] [INFO ] Deduced a trap composed of 2 places in 70 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1021 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1021 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 58/1079 variables, 29/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1079 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/1081 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-29 20:36:29] [INFO ] Deduced a trap composed of 59 places in 1892 ms of which 16 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :2123 after 2503
[2025-05-29 20:36:31] [INFO ] Deduced a trap composed of 62 places in 1892 ms of which 15 ms to minimize.
[2025-05-29 20:36:33] [INFO ] Deduced a trap composed of 43 places in 1778 ms of which 15 ms to minimize.
[2025-05-29 20:36:35] [INFO ] Deduced a trap composed of 44 places in 1763 ms of which 14 ms to minimize.
[2025-05-29 20:36:37] [INFO ] Deduced a trap composed of 43 places in 1778 ms of which 15 ms to minimize.
[2025-05-29 20:36:39] [INFO ] Deduced a trap composed of 44 places in 1788 ms of which 15 ms to minimize.
[2025-05-29 20:36:40] [INFO ] Deduced a trap composed of 44 places in 1705 ms of which 15 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :2503 after 3060
[2025-05-29 20:36:42] [INFO ] Deduced a trap composed of 45 places in 1619 ms of which 14 ms to minimize.
[2025-05-29 20:36:43] [INFO ] Deduced a trap composed of 42 places in 1440 ms of which 12 ms to minimize.
[2025-05-29 20:36:45] [INFO ] Deduced a trap composed of 38 places in 1233 ms of which 9 ms to minimize.
[2025-05-29 20:36:46] [INFO ] Deduced a trap composed of 39 places in 1543 ms of which 14 ms to minimize.
[2025-05-29 20:36:48] [INFO ] Deduced a trap composed of 47 places in 1552 ms of which 14 ms to minimize.
[2025-05-29 20:36:49] [INFO ] Deduced a trap composed of 43 places in 1553 ms of which 14 ms to minimize.
[2025-05-29 20:36:51] [INFO ] Deduced a trap composed of 36 places in 1144 ms of which 9 ms to minimize.
[2025-05-29 20:36:52] [INFO ] Deduced a trap composed of 43 places in 993 ms of which 9 ms to minimize.
[2025-05-29 20:36:53] [INFO ] Deduced a trap composed of 35 places in 981 ms of which 9 ms to minimize.
[2025-05-29 20:36:53] [INFO ] Deduced a trap composed of 43 places in 853 ms of which 8 ms to minimize.
[2025-05-29 20:36:54] [INFO ] Deduced a trap composed of 41 places in 931 ms of which 9 ms to minimize.
[2025-05-29 20:36:55] [INFO ] Deduced a trap composed of 41 places in 939 ms of which 8 ms to minimize.
[2025-05-29 20:36:56] [INFO ] Deduced a trap composed of 40 places in 940 ms of which 9 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1081 variables, 20/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-29 20:36:57] [INFO ] Deduced a trap composed of 40 places in 940 ms of which 10 ms to minimize.
[2025-05-29 20:36:58] [INFO ] Deduced a trap composed of 35 places in 856 ms of which 8 ms to minimize.
[2025-05-29 20:36:59] [INFO ] Deduced a trap composed of 52 places in 816 ms of which 8 ms to minimize.
[2025-05-29 20:37:00] [INFO ] Deduced a trap composed of 49 places in 833 ms of which 8 ms to minimize.
[2025-05-29 20:37:01] [INFO ] Deduced a trap composed of 50 places in 841 ms of which 7 ms to minimize.
[2025-05-29 20:37:02] [INFO ] Deduced a trap composed of 52 places in 847 ms of which 8 ms to minimize.
[2025-05-29 20:37:02] [INFO ] Deduced a trap composed of 35 places in 808 ms of which 7 ms to minimize.
[2025-05-29 20:37:03] [INFO ] Deduced a trap composed of 42 places in 793 ms of which 28 ms to minimize.
Detected timeout of ITS tools.
[2025-05-29 20:37:04] [INFO ] Flatten gal took : 82 ms
[2025-05-29 20:37:04] [INFO ] Applying decomposition
[2025-05-29 20:37:04] [INFO ] Flatten gal took : 86 ms
[2025-05-29 20:37:04] [INFO ] Deduced a trap composed of 43 places in 730 ms of which 12 ms to minimize.
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/graph993169766682884528.txt' '-o' '/tmp/graph993169766682884528.bin' '-w' '/tmp/graph993169766682884528.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph993169766682884528.bin' '-l' '-1' '-v' '-w' '/tmp/graph993169766682884528.weights' '-q' '0' '-e' '0.001'
[2025-05-29 20:37:04] [INFO ] Decomposing Gal with order
[2025-05-29 20:37:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-29 20:37:04] [INFO ] Removed a total of 2827 redundant transitions.
[2025-05-29 20:37:05] [INFO ] Flatten gal took : 256 ms
[2025-05-29 20:37:05] [INFO ] Deduced a trap composed of 42 places in 635 ms of which 7 ms to minimize.
[2025-05-29 20:37:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 3456 labels/synchronizations in 136 ms.
[2025-05-29 20:37:05] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12263212033337224025.gal : 36 ms
[2025-05-29 20:37:05] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7849294707409844480.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/ReachabilityCardinality12263212033337224025.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7849294707409844480.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
[2025-05-29 20:37:05] [INFO ] Deduced a trap composed of 46 places in 606 ms of which 7 ms to minimize.
Loading property file /tmp/ReachabilityCardinality7849294707409844480.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 101
[2025-05-29 20:37:06] [INFO ] Deduced a trap composed of 46 places in 695 ms of which 7 ms to minimize.
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :101 after 101
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :101 after 101
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :101 after 101
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :101 after 101
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :101 after 101
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :101 after 101
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :101 after 101
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :101 after 101
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :101 after 101
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :101 after 5819
[2025-05-29 20:37:07] [INFO ] Deduced a trap composed of 47 places in 758 ms of which 7 ms to minimize.
[2025-05-29 20:37:08] [INFO ] Deduced a trap composed of 44 places in 762 ms of which 7 ms to minimize.
[2025-05-29 20:37:08] [INFO ] Deduced a trap composed of 45 places in 754 ms of which 8 ms to minimize.
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :5819 after 415622
[2025-05-29 20:37:09] [INFO ] Deduced a trap composed of 44 places in 751 ms of which 7 ms to minimize.
[2025-05-29 20:37:10] [INFO ] Deduced a trap composed of 47 places in 761 ms of which 7 ms to minimize.
[2025-05-29 20:37:11] [INFO ] Deduced a trap composed of 36 places in 689 ms of which 7 ms to minimize.
[2025-05-29 20:37:11] [INFO ] Deduced a trap composed of 35 places in 653 ms of which 7 ms to minimize.
[2025-05-29 20:37:12] [INFO ] Deduced a trap composed of 35 places in 601 ms of which 6 ms to minimize.
SMT process timed out in 45187ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 1083 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1083/1083 places, 3696/3696 transitions.
Applied a total of 0 rules in 85 ms. Remains 1083 /1083 variables (removed 0) and now considering 3696/3696 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 89 ms. Remains : 1083/1083 places, 3696/3696 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1083/1083 places, 3696/3696 transitions.
Applied a total of 0 rules in 83 ms. Remains 1083 /1083 variables (removed 0) and now considering 3696/3696 (removed 0) transitions.
[2025-05-29 20:37:12] [INFO ] Invariant cache hit.
[2025-05-29 20:37:14] [INFO ] Implicit Places using invariants in 1789 ms returned []
[2025-05-29 20:37:14] [INFO ] Invariant cache hit.
[2025-05-29 20:37:15] [INFO ] State equation strengthened by 3604 read => feed constraints.
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :415622 after 2.98885e+07
[2025-05-29 20:37:44] [INFO ] Implicit Places using invariants and state equation in 29990 ms returned []
Implicit Place search using SMT with State Equation took 31798 ms to find 0 implicit places.
[2025-05-29 20:37:44] [INFO ] Redundant transitions in 162 ms returned []
Running 3666 sub problems to find dead transitions.
[2025-05-29 20:37:44] [INFO ] Invariant cache hit.
[2025-05-29 20:37:44] [INFO ] State equation strengthened by 3604 read => feed constraints.
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :2.98885e+07 after 3.22535e+07
Detected timeout of ITS tools.
At refinement iteration 0 (INCLUDED_ONLY) 0/1082 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 3666 unsolved
SMT process timed out in 32633ms, After SMT, problems are : Problem set: 0 solved, 3666 unsolved
Search for dead transitions found 0 dead transitions in 32670ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64725 ms. Remains : 1083/1083 places, 3696/3696 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[1] Max Struct:[30]
Ending property specific reduction for CANInsertWithFailure-PT-030-UpperBounds-03 in 218580 ms.
Starting property specific reduction for CANInsertWithFailure-PT-030-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:[30]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[30]
// Phase 1: matrix 3704 rows 1091 cols
[2025-05-29 20:38:17] [INFO ] Computed 32 invariants in 73 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[30]
RANDOM walk for 10000 steps (71 resets) in 99 ms. (100 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 14 ms. (666 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[30]
[2025-05-29 20:38:17] [INFO ] Invariant cache hit.
[2025-05-29 20:38:17] [INFO ] [Real]Absence check using 30 positive place invariants in 37 ms returned sat
[2025-05-29 20:38:17] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 18 ms returned sat
[2025-05-29 20:38:18] [INFO ] [Real]Absence check using state equation in 1112 ms returned sat
[2025-05-29 20:38:19] [INFO ] State equation strengthened by 3585 read => feed constraints.
[2025-05-29 20:38:19] [INFO ] [Real]Added 3585 Read/Feed constraints in 490 ms returned sat
[2025-05-29 20:38:19] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 20:38:20] [INFO ] [Nat]Absence check using 30 positive place invariants in 40 ms returned sat
[2025-05-29 20:38:20] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 17 ms returned sat
[2025-05-29 20:38:21] [INFO ] [Nat]Absence check using state equation in 1413 ms returned sat
[2025-05-29 20:38:22] [INFO ] SMT solver returned unknown. Retrying;
[2025-05-29 20:38:22] [INFO ] [Nat]Added 3585 Read/Feed constraints in 1246 ms returned sat
[2025-05-29 20:38:23] [INFO ] Computed and/alt/rep : 2632/6936/2632 causal constraints (skipped 1042 transitions) in 383 ms.
Maximisation of solution failed !
Minimization took 1 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[30]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[30]
Support contains 1 out of 1091 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1091/1091 places, 3704/3704 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 2 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 0 with 18 rules applied. Total rules applied 18 place count 1082 transition count 3695
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 1082 transition count 3695
Applied a total of 20 rules in 341 ms. Remains 1082 /1091 variables (removed 9) and now considering 3695/3704 (removed 9) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 341 ms. Remains : 1082/1091 places, 3695/3704 transitions.
// Phase 1: matrix 3695 rows 1082 cols
[2025-05-29 20:38:25] [INFO ] Computed 32 invariants in 81 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[30]
RANDOM walk for 1000000 steps (7128 resets) in 9391 ms. (106 steps per ms)
BEST_FIRST walk for 1000001 steps (205 resets) in 1216 ms. (821 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[30]
[2025-05-29 20:38:35] [INFO ] Invariant cache hit.
[2025-05-29 20:38:36] [INFO ] [Real]Absence check using 30 positive place invariants in 42 ms returned sat
[2025-05-29 20:38:36] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 17 ms returned sat
[2025-05-29 20:38:37] [INFO ] [Real]Absence check using state equation in 1260 ms returned sat
[2025-05-29 20:38:37] [INFO ] State equation strengthened by 3605 read => feed constraints.
[2025-05-29 20:38:38] [INFO ] [Real]Added 3605 Read/Feed constraints in 676 ms returned sat
[2025-05-29 20:38:38] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 20:38:38] [INFO ] [Nat]Absence check using 30 positive place invariants in 37 ms returned sat
[2025-05-29 20:38:38] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 17 ms returned sat
[2025-05-29 20:38:39] [INFO ] [Nat]Absence check using state equation in 1240 ms returned sat
[2025-05-29 20:38:40] [INFO ] [Nat]Added 3605 Read/Feed constraints in 723 ms returned sat
[2025-05-29 20:38:41] [INFO ] Computed and/alt/rep : 2621/6959/2621 causal constraints (skipped 1044 transitions) in 447 ms.
[2025-05-29 20:38:42] [INFO ] Added : 5 causal constraints over 1 iterations in 1201 ms. Result :sat
Minimization took 4501 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[30]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[30]
Support contains 1 out of 1082 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1082/1082 places, 3695/3695 transitions.
Applied a total of 0 rules in 82 ms. Remains 1082 /1082 variables (removed 0) and now considering 3695/3695 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 82 ms. Remains : 1082/1082 places, 3695/3695 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1082/1082 places, 3695/3695 transitions.
Applied a total of 0 rules in 82 ms. Remains 1082 /1082 variables (removed 0) and now considering 3695/3695 (removed 0) transitions.
[2025-05-29 20:38:46] [INFO ] Invariant cache hit.
[2025-05-29 20:38:49] [INFO ] Implicit Places using invariants in 2570 ms returned []
[2025-05-29 20:38:49] [INFO ] Invariant cache hit.
[2025-05-29 20:38:50] [INFO ] State equation strengthened by 3605 read => feed constraints.
[2025-05-29 20:39:19] [INFO ] Implicit Places using invariants and state equation in 30441 ms returned []
Implicit Place search using SMT with State Equation took 33013 ms to find 0 implicit places.
[2025-05-29 20:39:19] [INFO ] Redundant transitions in 159 ms returned []
Running 3665 sub problems to find dead transitions.
[2025-05-29 20:39:19] [INFO ] Invariant cache hit.
[2025-05-29 20:39:19] [INFO ] State equation strengthened by 3605 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/1081 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 3665 unsolved
SMT process timed out in 32607ms, After SMT, problems are : Problem set: 0 solved, 3665 unsolved
Search for dead transitions found 0 dead transitions in 32644ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65913 ms. Remains : 1082/1082 places, 3695/3695 transitions.
[2025-05-29 20:39:52] [INFO ] Flatten gal took : 340 ms
RANDOM walk for 40000 steps (284 resets) in 1796 ms. (22 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 166 ms. (239 steps per ms) remains 2/2 properties
[2025-05-29 20:39:53] [INFO ] Flatten gal took : 139 ms
BEST_FIRST walk for 40004 steps (8 resets) in 145 ms. (274 steps per ms) remains 2/2 properties
[2025-05-29 20:39:53] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6085728779078524917.gal : 23 ms
[2025-05-29 20:39:53] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7247277751092897647.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/ReachabilityCardinality6085728779078524917.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7247277751092897647.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/ReachabilityCardinality7247277751092897647.prop.
Interrupted probabilistic random walk after 155334 steps, run timeout after 3001 ms. (steps per millisecond=51 ) properties seen :0 out of 2
Probabilistic random walk after 155334 steps, saw 29562 distinct states, run finished after 3001 ms. (steps per millisecond=51 ) properties seen :0
[2025-05-29 20:39:56] [INFO ] Invariant cache hit.
[2025-05-29 20:39:56] [INFO ] State equation strengthened by 3605 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) 1019/1020 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-05-29 20:39:56] [INFO ] Deduced a trap composed of 2 places in 46 ms of which 2 ms to minimize.
Problem MAX0 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/1020 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1020 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 58/1078 variables, 29/31 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1078 variables, 0/31 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/1080 variables, 2/33 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2025-05-29 20:39:57] [INFO ] Deduced a trap composed of 35 places in 1415 ms of which 13 ms to minimize.
[2025-05-29 20:39:59] [INFO ] Deduced a trap composed of 36 places in 1536 ms of which 9 ms to minimize.
[2025-05-29 20:39:59] [INFO ] Deduced a trap composed of 39 places in 65 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1080 variables, 3/36 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1080 variables, 0/36 constraints. Problems are: Problem set: 1 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 3695/4775 variables, 1080/1116 constraints. Problems are: Problem set: 1 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 4775/4777 variables, and 4721 constraints, problems are : Problem set: 1 solved, 1 unsolved in 5007 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1080/1082 constraints, ReadFeed: 3605/3605 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1019/1020 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1020 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2025-05-29 20:40:01] [INFO ] Deduced a trap composed of 2 places in 44 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1020 variables, 1/3 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1020 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 58/1078 variables, 29/32 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1078 variables, 0/32 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/1080 variables, 2/34 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1080 variables, 3/37 constraints. Problems are: Problem set: 1 solved, 1 unsolved
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 963
[2025-05-29 20:40:03] [INFO ] Deduced a trap composed of 41 places in 1552 ms of which 9 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :963 after 1043
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :1043 after 1171
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :1171 after 1367
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :1367 after 1563
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :1563 after 1719
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :1719 after 1732
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :1732 after 1772
SDD proceeding with computation,2 properties remain. new max is 1024
[2025-05-29 20:40:04] [INFO ] Deduced a trap composed of 42 places in 1259 ms of which 10 ms to minimize.
SDD size :1772 after 1872
[2025-05-29 20:40:05] [INFO ] Deduced a trap composed of 51 places in 1109 ms of which 9 ms to minimize.
[2025-05-29 20:40:06] [INFO ] Deduced a trap composed of 39 places in 1039 ms of which 8 ms to minimize.
SMT process timed out in 10477ms, After SMT, problems are : Problem set: 1 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 1082 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1082/1082 places, 3695/3695 transitions.
Applied a total of 0 rules in 83 ms. Remains 1082 /1082 variables (removed 0) and now considering 3695/3695 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 84 ms. Remains : 1082/1082 places, 3695/3695 transitions.
RANDOM walk for 40000 steps (284 resets) in 534 ms. (74 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 70 ms. (563 steps per ms) remains 1/1 properties
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :1872 after 2124
Interrupted probabilistic random walk after 175662 steps, run timeout after 3001 ms. (steps per millisecond=58 ) properties seen :0 out of 1
Probabilistic random walk after 175662 steps, saw 31858 distinct states, run finished after 3001 ms. (steps per millisecond=58 ) properties seen :0
[2025-05-29 20:40:09] [INFO ] Invariant cache hit.
[2025-05-29 20:40:09] [INFO ] State equation strengthened by 3605 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :2124 after 2504
At refinement iteration 1 (OVERLAPS) 1019/1020 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-29 20:40:10] [INFO ] Deduced a trap composed of 2 places in 51 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1020 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1020 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 58/1078 variables, 29/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1078 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/1080 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-29 20:40:11] [INFO ] Deduced a trap composed of 46 places in 1179 ms of which 10 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1080 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1080 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 3695/4775 variables, 1080/1114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4775 variables, 3605/4719 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/4775 variables, 0/4719 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 2/4777 variables, 2/4721 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/4777 variables, 0/4721 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/4777 variables, 0/4721 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4777/4777 variables, and 4721 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3532 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1082/1082 constraints, ReadFeed: 3605/3605 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 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) 1019/1020 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1020 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-29 20:40:13] [INFO ] Deduced a trap composed of 2 places in 47 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1020 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1020 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 58/1078 variables, 29/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1078 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/1080 variables, 2/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1080 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-29 20:40:14] [INFO ] Deduced a trap composed of 41 places in 1158 ms of which 10 ms to minimize.
[2025-05-29 20:40:16] [INFO ] Deduced a trap composed of 42 places in 1164 ms of which 10 ms to minimize.
[2025-05-29 20:40:17] [INFO ] Deduced a trap composed of 51 places in 1169 ms of which 10 ms to minimize.
[2025-05-29 20:40:18] [INFO ] Deduced a trap composed of 39 places in 1131 ms of which 9 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :2504 after 3061
[2025-05-29 20:40:19] [INFO ] Deduced a trap composed of 45 places in 1098 ms of which 9 ms to minimize.
[2025-05-29 20:40:20] [INFO ] Deduced a trap composed of 41 places in 1111 ms of which 10 ms to minimize.
[2025-05-29 20:40:21] [INFO ] Deduced a trap composed of 42 places in 1102 ms of which 9 ms to minimize.
[2025-05-29 20:40:22] [INFO ] Deduced a trap composed of 47 places in 1118 ms of which 9 ms to minimize.
[2025-05-29 20:40:24] [INFO ] Deduced a trap composed of 43 places in 1109 ms of which 10 ms to minimize.
[2025-05-29 20:40:25] [INFO ] Deduced a trap composed of 42 places in 1092 ms of which 10 ms to minimize.
[2025-05-29 20:40:26] [INFO ] Deduced a trap composed of 46 places in 1114 ms of which 9 ms to minimize.
[2025-05-29 20:40:27] [INFO ] Deduced a trap composed of 48 places in 1071 ms of which 10 ms to minimize.
[2025-05-29 20:40:28] [INFO ] Deduced a trap composed of 39 places in 1067 ms of which 9 ms to minimize.
[2025-05-29 20:40:29] [INFO ] Deduced a trap composed of 41 places in 1066 ms of which 8 ms to minimize.
[2025-05-29 20:40:30] [INFO ] Deduced a trap composed of 42 places in 1048 ms of which 9 ms to minimize.
[2025-05-29 20:40:31] [INFO ] Deduced a trap composed of 43 places in 1058 ms of which 9 ms to minimize.
[2025-05-29 20:40:32] [INFO ] Deduced a trap composed of 46 places in 1049 ms of which 9 ms to minimize.
[2025-05-29 20:40:33] [INFO ] Deduced a trap composed of 45 places in 1028 ms of which 9 ms to minimize.
[2025-05-29 20:40:34] [INFO ] Deduced a trap composed of 44 places in 1022 ms of which 9 ms to minimize.
[2025-05-29 20:40:35] [INFO ] Deduced a trap composed of 44 places in 1037 ms of which 9 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/1080 variables, 20/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-29 20:40:37] [INFO ] Deduced a trap composed of 43 places in 1036 ms of which 10 ms to minimize.
[2025-05-29 20:40:38] [INFO ] Deduced a trap composed of 43 places in 1037 ms of which 9 ms to minimize.
[2025-05-29 20:40:39] [INFO ] Deduced a trap composed of 43 places in 1055 ms of which 11 ms to minimize.
[2025-05-29 20:40:40] [INFO ] Deduced a trap composed of 41 places in 1045 ms of which 8 ms to minimize.
[2025-05-29 20:40:41] [INFO ] Deduced a trap composed of 40 places in 1061 ms of which 9 ms to minimize.
[2025-05-29 20:40:42] [INFO ] Deduced a trap composed of 42 places in 1046 ms of which 9 ms to minimize.
Detected timeout of ITS tools.
[2025-05-29 20:40:43] [INFO ] Flatten gal took : 82 ms
[2025-05-29 20:40:43] [INFO ] Applying decomposition
[2025-05-29 20:40:43] [INFO ] Flatten gal took : 87 ms
[2025-05-29 20:40:43] [INFO ] Deduced a trap composed of 42 places in 1039 ms of which 14 ms to minimize.
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/graph9211519686039608670.txt' '-o' '/tmp/graph9211519686039608670.bin' '-w' '/tmp/graph9211519686039608670.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph9211519686039608670.bin' '-l' '-1' '-v' '-w' '/tmp/graph9211519686039608670.weights' '-q' '0' '-e' '0.001'
[2025-05-29 20:40:43] [INFO ] Decomposing Gal with order
[2025-05-29 20:40:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-29 20:40:43] [INFO ] Removed a total of 2828 redundant transitions.
[2025-05-29 20:40:43] [INFO ] Flatten gal took : 225 ms
[2025-05-29 20:40:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 3396 labels/synchronizations in 119 ms.
[2025-05-29 20:40:44] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12574855065824891738.gal : 144 ms
[2025-05-29 20:40:44] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8132433625073973756.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/ReachabilityCardinality12574855065824891738.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8132433625073973756.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
[2025-05-29 20:40:44] [INFO ] Deduced a trap composed of 44 places in 956 ms of which 8 ms to minimize.
Loading property file /tmp/ReachabilityCardinality8132433625073973756.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 733
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :733 after 733
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :733 after 733
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :733 after 740
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :740 after 743
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :743 after 746
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :746 after 749
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :749 after 755
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :755 after 767
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :767 after 781
[2025-05-29 20:40:45] [INFO ] Deduced a trap composed of 43 places in 1342 ms of which 14 ms to minimize.
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :781 after 71590
[2025-05-29 20:40:47] [INFO ] Deduced a trap composed of 44 places in 1548 ms of which 13 ms to minimize.
[2025-05-29 20:40:48] [INFO ] Deduced a trap composed of 42 places in 1331 ms of which 12 ms to minimize.
[2025-05-29 20:40:50] [INFO ] Deduced a trap composed of 37 places in 1213 ms of which 9 ms to minimize.
[2025-05-29 20:40:50] [INFO ] Deduced a trap composed of 43 places in 940 ms of which 8 ms to minimize.
[2025-05-29 20:40:51] [INFO ] Deduced a trap composed of 41 places in 974 ms of which 8 ms to minimize.
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :71590 after 3.7079e+06
[2025-05-29 20:40:53] [INFO ] Deduced a trap composed of 45 places in 1172 ms of which 12 ms to minimize.
[2025-05-29 20:40:54] [INFO ] Deduced a trap composed of 43 places in 1392 ms of which 11 ms to minimize.
[2025-05-29 20:40:55] [INFO ] Deduced a trap composed of 42 places in 1244 ms of which 11 ms to minimize.
[2025-05-29 20:40:57] [INFO ] Deduced a trap composed of 39 places in 1105 ms of which 12 ms to minimize.
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :3.7079e+06 after 7.95763e+06
[2025-05-29 20:40:58] [INFO ] Deduced a trap composed of 42 places in 1335 ms of which 13 ms to minimize.
[2025-05-29 20:40:59] [INFO ] Deduced a trap composed of 41 places in 1364 ms of which 12 ms to minimize.
SMT process timed out in 49904ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 1082 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1082/1082 places, 3695/3695 transitions.
Applied a total of 0 rules in 131 ms. Remains 1082 /1082 variables (removed 0) and now considering 3695/3695 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 131 ms. Remains : 1082/1082 places, 3695/3695 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1082/1082 places, 3695/3695 transitions.
Applied a total of 0 rules in 136 ms. Remains 1082 /1082 variables (removed 0) and now considering 3695/3695 (removed 0) transitions.
[2025-05-29 20:41:00] [INFO ] Invariant cache hit.
[2025-05-29 20:41:02] [INFO ] Implicit Places using invariants in 2617 ms returned []
[2025-05-29 20:41:02] [INFO ] Invariant cache hit.
[2025-05-29 20:41:04] [INFO ] State equation strengthened by 3605 read => feed constraints.
Detected timeout of ITS tools.
[2025-05-29 20:41:34] [INFO ] Performed 1081/1082 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2025-05-29 20:41:34] [INFO ] Implicit Places using invariants and state equation in 31944 ms returned []
Implicit Place search using SMT with State Equation took 34563 ms to find 0 implicit places.
[2025-05-29 20:41:34] [INFO ] Redundant transitions in 162 ms returned []
Running 3665 sub problems to find dead transitions.
[2025-05-29 20:41:34] [INFO ] Invariant cache hit.
[2025-05-29 20:41:34] [INFO ] State equation strengthened by 3605 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 1.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 1.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 1.0)
(s13 0.0)
(s14 1.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 1.0)
(s19 0.0)
(s20 1.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 1.0)
(s25 0.0)
(s26 1.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 1.0)
(s31 0.0)
(s32 1.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 1.0)
(s37 0.0)
(s38 1.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 1.0)
(s43 0.0)
(s44 1.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 1.0)
(s49 0.0)
(s50 1.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 1.0)
(s55 0.0)
(s56 1.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 1.0)
(s61 0.0)
(s62 1.0)
(s63 0.0)
(s64 0.0)
(s65 1.0)
(s66 1.0)
(s67 0.0)
(s68 1.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 1.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 1.0)
(s78 1.0)
(s79 0.0)
(s80 1.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 1.0)
(s85 0.0)
(s86 1.0)
(s87 0.0)
(s88 0.0)
(s89 1.0)
(s90 1.0)
(s91 0.0)
(s92 1.0)
(s93 1.0)
(s94 0.0)
(s95 1.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 1.0)
(s101 1.0)
(s102 0.0)
(s103 0.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 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 1.0)
(s138 0.0)
(s139 0.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 1.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 1.0)
(s155 0.0)
(s156 0.0)
(s157 0.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 0.0)
(s170 0.0)
(s171 0.0)
(s172 1.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 1.0)
(s179 0.0)
(s180 1.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1081 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 3665 unsolved
SMT process timed out in 32931ms, After SMT, problems are : Problem set: 0 solved, 3665 unsolved
Search for dead transitions found 0 dead transitions in 32969ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 67845 ms. Remains : 1082/1082 places, 3695/3695 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[1] Max Struct:[30]
Ending property specific reduction for CANInsertWithFailure-PT-030-UpperBounds-04 in 230402 ms.
Starting property specific reduction for CANInsertWithFailure-PT-030-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:[30]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[30]
// Phase 1: matrix 3704 rows 1091 cols
[2025-05-29 20:42:07] [INFO ] Computed 32 invariants in 73 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[30]
RANDOM walk for 10000 steps (71 resets) in 97 ms. (102 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 14 ms. (666 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[30]
[2025-05-29 20:42:07] [INFO ] Invariant cache hit.
[2025-05-29 20:42:08] [INFO ] [Real]Absence check using 30 positive place invariants in 37 ms returned sat
[2025-05-29 20:42:08] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 18 ms returned sat
[2025-05-29 20:42:09] [INFO ] [Real]Absence check using state equation in 1148 ms returned sat
[2025-05-29 20:42:09] [INFO ] State equation strengthened by 3585 read => feed constraints.
[2025-05-29 20:42:09] [INFO ] [Real]Added 3585 Read/Feed constraints in 428 ms returned sat
[2025-05-29 20:42:10] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 20:42:10] [INFO ] [Nat]Absence check using 30 positive place invariants in 27 ms returned sat
[2025-05-29 20:42:10] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 12 ms returned sat
[2025-05-29 20:42:11] [INFO ] [Nat]Absence check using state equation in 1105 ms returned sat
[2025-05-29 20:42:11] [INFO ] [Nat]Added 3585 Read/Feed constraints in 504 ms returned sat
[2025-05-29 20:42:12] [INFO ] Computed and/alt/rep : 2632/6936/2632 causal constraints (skipped 1042 transitions) in 272 ms.
[2025-05-29 20:42:13] [INFO ] Added : 8 causal constraints over 2 iterations in 1096 ms. Result :sat
Minimization took 843 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[30]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[30]
Support contains 1 out of 1091 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1091/1091 places, 3704/3704 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 0 with 18 rules applied. Total rules applied 18 place count 1082 transition count 3695
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 1082 transition count 3695
Applied a total of 20 rules in 226 ms. Remains 1082 /1091 variables (removed 9) and now considering 3695/3704 (removed 9) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 231 ms. Remains : 1082/1091 places, 3695/3704 transitions.
// Phase 1: matrix 3695 rows 1082 cols
[2025-05-29 20:42:14] [INFO ] Computed 32 invariants in 49 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[30]
RANDOM walk for 1000000 steps (7142 resets) in 9368 ms. (106 steps per ms)
BEST_FIRST walk for 1000001 steps (203 resets) in 1282 ms. (779 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[30]
[2025-05-29 20:42:24] [INFO ] Invariant cache hit.
[2025-05-29 20:42:25] [INFO ] [Real]Absence check using 30 positive place invariants in 38 ms returned sat
[2025-05-29 20:42:25] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 18 ms returned sat
[2025-05-29 20:42:26] [INFO ] [Real]Absence check using state equation in 1164 ms returned sat
[2025-05-29 20:42:26] [INFO ] State equation strengthened by 3605 read => feed constraints.
[2025-05-29 20:42:26] [INFO ] [Real]Added 3605 Read/Feed constraints in 432 ms returned sat
[2025-05-29 20:42:26] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 20:42:27] [INFO ] [Nat]Absence check using 30 positive place invariants in 27 ms returned sat
[2025-05-29 20:42:27] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 12 ms returned sat
[2025-05-29 20:42:28] [INFO ] [Nat]Absence check using state equation in 1120 ms returned sat
[2025-05-29 20:42:28] [INFO ] [Nat]Added 3605 Read/Feed constraints in 514 ms returned sat
[2025-05-29 20:42:29] [INFO ] Computed and/alt/rep : 2621/6959/2621 causal constraints (skipped 1044 transitions) in 279 ms.
[2025-05-29 20:42:30] [INFO ] Added : 6 causal constraints over 2 iterations in 1103 ms. Result :sat
Minimization took 4502 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[30]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[30]
Support contains 1 out of 1082 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1082/1082 places, 3695/3695 transitions.
Applied a total of 0 rules in 99 ms. Remains 1082 /1082 variables (removed 0) and now considering 3695/3695 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 99 ms. Remains : 1082/1082 places, 3695/3695 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1082/1082 places, 3695/3695 transitions.
Applied a total of 0 rules in 85 ms. Remains 1082 /1082 variables (removed 0) and now considering 3695/3695 (removed 0) transitions.
[2025-05-29 20:42:34] [INFO ] Invariant cache hit.
[2025-05-29 20:42:37] [INFO ] Implicit Places using invariants in 2288 ms returned []
[2025-05-29 20:42:37] [INFO ] Invariant cache hit.
[2025-05-29 20:42:38] [INFO ] State equation strengthened by 3605 read => feed constraints.
[2025-05-29 20:43:08] [INFO ] Performed 926/1082 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2025-05-29 20:43:13] [INFO ] Implicit Places using invariants and state equation in 36561 ms returned []
Implicit Place search using SMT with State Equation took 38858 ms to find 0 implicit places.
[2025-05-29 20:43:13] [INFO ] Redundant transitions in 163 ms returned []
Running 3665 sub problems to find dead transitions.
[2025-05-29 20:43:13] [INFO ] Invariant cache hit.
[2025-05-29 20:43:13] [INFO ] State equation strengthened by 3605 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1081 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 3665 unsolved
SMT process timed out in 33183ms, After SMT, problems are : Problem set: 0 solved, 3665 unsolved
Search for dead transitions found 0 dead transitions in 33224ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 72347 ms. Remains : 1082/1082 places, 3695/3695 transitions.
[2025-05-29 20:43:47] [INFO ] Flatten gal took : 201 ms
[2025-05-29 20:43:47] [INFO ] Flatten gal took : 134 ms
[2025-05-29 20:43:47] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6723836243216010732.gal : 62 ms
[2025-05-29 20:43:47] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6927733033417682841.prop : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality6723836243216010732.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6927733033417682841.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
RANDOM walk for 40000 steps (284 resets) in 1767 ms. (22 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 129 ms. (307 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 136 ms. (292 steps per ms) remains 2/2 properties
Loading property file /tmp/ReachabilityCardinality6927733033417682841.prop.
Interrupted probabilistic random walk after 142394 steps, run timeout after 3001 ms. (steps per millisecond=47 ) properties seen :0 out of 2
Probabilistic random walk after 142394 steps, saw 28036 distinct states, run finished after 3001 ms. (steps per millisecond=47 ) properties seen :0
[2025-05-29 20:43:50] [INFO ] Invariant cache hit.
[2025-05-29 20:43:50] [INFO ] State equation strengthened by 3605 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) 1019/1020 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-05-29 20:43:50] [INFO ] Deduced a trap composed of 2 places in 45 ms of which 1 ms to minimize.
Problem MAX0 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/1020 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1020 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 58/1078 variables, 29/31 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1078 variables, 0/31 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/1080 variables, 2/33 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2025-05-29 20:43:52] [INFO ] Deduced a trap composed of 38 places in 1725 ms of which 16 ms to minimize.
[2025-05-29 20:43:54] [INFO ] Deduced a trap composed of 39 places in 1707 ms of which 13 ms to minimize.
[2025-05-29 20:43:55] [INFO ] Deduced a trap composed of 38 places in 1332 ms of which 10 ms to minimize.
SMT process timed out in 5284ms, After SMT, problems are : Problem set: 1 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 1082 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1082/1082 places, 3695/3695 transitions.
Applied a total of 0 rules in 88 ms. Remains 1082 /1082 variables (removed 0) and now considering 3695/3695 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 89 ms. Remains : 1082/1082 places, 3695/3695 transitions.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 963
RANDOM walk for 40000 steps (283 resets) in 512 ms. (77 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 56 ms. (701 steps per ms) remains 1/1 properties
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :963 after 1043
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :1043 after 1171
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :1171 after 1367
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :1367 after 1563
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :1563 after 1718
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :1718 after 1731
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :1731 after 1771
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :1771 after 1871
Interrupted probabilistic random walk after 186108 steps, run timeout after 3001 ms. (steps per millisecond=62 ) properties seen :0 out of 1
Probabilistic random walk after 186108 steps, saw 32964 distinct states, run finished after 3001 ms. (steps per millisecond=62 ) properties seen :0
[2025-05-29 20:43:59] [INFO ] Invariant cache hit.
[2025-05-29 20:43:59] [INFO ] State equation strengthened by 3605 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) 1019/1020 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-29 20:43:59] [INFO ] Deduced a trap composed of 2 places in 69 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1020 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1020 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 58/1078 variables, 29/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1078 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/1080 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :1871 after 2123
[2025-05-29 20:44:01] [INFO ] Deduced a trap composed of 37 places in 1812 ms of which 15 ms to minimize.
[2025-05-29 20:44:03] [INFO ] Deduced a trap composed of 35 places in 1694 ms of which 14 ms to minimize.
[2025-05-29 20:44:03] [INFO ] Deduced a trap composed of 35 places in 99 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1080 variables, 3/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1080 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :2123 after 2504
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 3695/4775 variables, 1080/1116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4775 variables, 3605/4721 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/4775 variables, 0/4721 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 2/4777 variables, 2/4723 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/4777 variables, 0/4723 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/4777 variables, 0/4723 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4777/4777 variables, and 4723 constraints, problems are : Problem set: 0 solved, 1 unsolved in 6679 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1082/1082 constraints, ReadFeed: 3605/3605 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 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) 1019/1020 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1020 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-29 20:44:06] [INFO ] Deduced a trap composed of 2 places in 44 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1020 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1020 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 58/1078 variables, 29/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1078 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/1080 variables, 2/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1080 variables, 3/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-29 20:44:07] [INFO ] Deduced a trap composed of 35 places in 1583 ms of which 14 ms to minimize.
[2025-05-29 20:44:09] [INFO ] Deduced a trap composed of 42 places in 1364 ms of which 13 ms to minimize.
[2025-05-29 20:44:10] [INFO ] Deduced a trap composed of 37 places in 1317 ms of which 8 ms to minimize.
[2025-05-29 20:44:11] [INFO ] Deduced a trap composed of 35 places in 1281 ms of which 8 ms to minimize.
[2025-05-29 20:44:13] [INFO ] Deduced a trap composed of 36 places in 1197 ms of which 13 ms to minimize.
[2025-05-29 20:44:14] [INFO ] Deduced a trap composed of 46 places in 1380 ms of which 12 ms to minimize.
[2025-05-29 20:44:15] [INFO ] Deduced a trap composed of 39 places in 1103 ms of which 8 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :2504 after 3061
[2025-05-29 20:44:16] [INFO ] Deduced a trap composed of 37 places in 1213 ms of which 8 ms to minimize.
[2025-05-29 20:44:18] [INFO ] Deduced a trap composed of 37 places in 1117 ms of which 12 ms to minimize.
[2025-05-29 20:44:19] [INFO ] Deduced a trap composed of 37 places in 1066 ms of which 8 ms to minimize.
[2025-05-29 20:44:20] [INFO ] Deduced a trap composed of 40 places in 1102 ms of which 12 ms to minimize.
[2025-05-29 20:44:21] [INFO ] Deduced a trap composed of 38 places in 1091 ms of which 10 ms to minimize.
[2025-05-29 20:44:22] [INFO ] Deduced a trap composed of 38 places in 952 ms of which 9 ms to minimize.
[2025-05-29 20:44:23] [INFO ] Deduced a trap composed of 48 places in 840 ms of which 8 ms to minimize.
[2025-05-29 20:44:24] [INFO ] Deduced a trap composed of 39 places in 757 ms of which 7 ms to minimize.
[2025-05-29 20:44:24] [INFO ] Deduced a trap composed of 35 places in 914 ms of which 10 ms to minimize.
[2025-05-29 20:44:25] [INFO ] Deduced a trap composed of 39 places in 970 ms of which 11 ms to minimize.
[2025-05-29 20:44:27] [INFO ] Deduced a trap composed of 42 places in 1037 ms of which 10 ms to minimize.
[2025-05-29 20:44:27] [INFO ] Deduced a trap composed of 46 places in 918 ms of which 6 ms to minimize.
[2025-05-29 20:44:28] [INFO ] Deduced a trap composed of 40 places in 672 ms of which 6 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/1080 variables, 20/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-29 20:44:29] [INFO ] Deduced a trap composed of 40 places in 913 ms of which 9 ms to minimize.
[2025-05-29 20:44:30] [INFO ] Deduced a trap composed of 38 places in 979 ms of which 11 ms to minimize.
[2025-05-29 20:44:31] [INFO ] Deduced a trap composed of 38 places in 1008 ms of which 9 ms to minimize.
[2025-05-29 20:44:32] [INFO ] Deduced a trap composed of 38 places in 882 ms of which 6 ms to minimize.
[2025-05-29 20:44:33] [INFO ] Deduced a trap composed of 51 places in 820 ms of which 11 ms to minimize.
[2025-05-29 20:44:34] [INFO ] Deduced a trap composed of 43 places in 907 ms of which 9 ms to minimize.
[2025-05-29 20:44:35] [INFO ] Deduced a trap composed of 42 places in 831 ms of which 9 ms to minimize.
[2025-05-29 20:44:36] [INFO ] Deduced a trap composed of 35 places in 826 ms of which 9 ms to minimize.
[2025-05-29 20:44:36] [INFO ] Deduced a trap composed of 39 places in 694 ms of which 8 ms to minimize.
[2025-05-29 20:44:37] [INFO ] Deduced a trap composed of 41 places in 650 ms of which 7 ms to minimize.
Detected timeout of ITS tools.
[2025-05-29 20:44:37] [INFO ] Flatten gal took : 80 ms
[2025-05-29 20:44:37] [INFO ] Applying decomposition
[2025-05-29 20:44:37] [INFO ] Flatten gal took : 86 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/graph656065373759082967.txt' '-o' '/tmp/graph656065373759082967.bin' '-w' '/tmp/graph656065373759082967.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph656065373759082967.bin' '-l' '-1' '-v' '-w' '/tmp/graph656065373759082967.weights' '-q' '0' '-e' '0.001'
[2025-05-29 20:44:37] [INFO ] Decomposing Gal with order
[2025-05-29 20:44:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-29 20:44:38] [INFO ] Deduced a trap composed of 49 places in 571 ms of which 8 ms to minimize.
[2025-05-29 20:44:38] [INFO ] Removed a total of 2831 redundant transitions.
[2025-05-29 20:44:38] [INFO ] Flatten gal took : 221 ms
[2025-05-29 20:44:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 3510 labels/synchronizations in 121 ms.
[2025-05-29 20:44:38] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4161280790837202761.gal : 33 ms
[2025-05-29 20:44:38] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4315980700162091884.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/ReachabilityCardinality4161280790837202761.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4315980700162091884.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
[2025-05-29 20:44:38] [INFO ] Deduced a trap composed of 36 places in 592 ms of which 7 ms to minimize.
Loading property file /tmp/ReachabilityCardinality4315980700162091884.prop.
[2025-05-29 20:44:39] [INFO ] Deduced a trap composed of 36 places in 561 ms of which 7 ms to minimize.
[2025-05-29 20:44:39] [INFO ] Deduced a trap composed of 36 places in 365 ms of which 5 ms to minimize.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 121
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :121 after 121
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :121 after 121
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :121 after 121
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :121 after 121
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :121 after 121
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :121 after 121
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :121 after 121
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :121 after 121
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :121 after 121
[2025-05-29 20:44:40] [INFO ] Deduced a trap composed of 41 places in 606 ms of which 8 ms to minimize.
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :121 after 9227
[2025-05-29 20:44:40] [INFO ] Deduced a trap composed of 38 places in 564 ms of which 5 ms to minimize.
[2025-05-29 20:44:41] [INFO ] Deduced a trap composed of 42 places in 417 ms of which 5 ms to minimize.
[2025-05-29 20:44:41] [INFO ] Deduced a trap composed of 45 places in 410 ms of which 4 ms to minimize.
[2025-05-29 20:44:42] [INFO ] Deduced a trap composed of 35 places in 586 ms of which 7 ms to minimize.
[2025-05-29 20:44:43] [INFO ] Deduced a trap composed of 39 places in 600 ms of which 7 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/1080 variables, 20/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-29 20:44:43] [INFO ] Deduced a trap composed of 44 places in 629 ms of which 8 ms to minimize.
[2025-05-29 20:44:44] [INFO ] Deduced a trap composed of 39 places in 564 ms of which 7 ms to minimize.
[2025-05-29 20:44:44] [INFO ] Deduced a trap composed of 37 places in 563 ms of which 6 ms to minimize.
[2025-05-29 20:44:45] [INFO ] Deduced a trap composed of 38 places in 554 ms of which 7 ms to minimize.
[2025-05-29 20:44:46] [INFO ] Deduced a trap composed of 37 places in 522 ms of which 6 ms to minimize.
[2025-05-29 20:44:46] [INFO ] Deduced a trap composed of 36 places in 526 ms of which 6 ms to minimize.
[2025-05-29 20:44:47] [INFO ] Deduced a trap composed of 36 places in 525 ms of which 7 ms to minimize.
[2025-05-29 20:44:47] [INFO ] Deduced a trap composed of 39 places in 475 ms of which 6 ms to minimize.
[2025-05-29 20:44:48] [INFO ] Deduced a trap composed of 37 places in 428 ms of which 6 ms to minimize.
[2025-05-29 20:44:48] [INFO ] Deduced a trap composed of 37 places in 424 ms of which 6 ms to minimize.
[2025-05-29 20:44:49] [INFO ] Deduced a trap composed of 42 places in 470 ms of which 6 ms to minimize.
[2025-05-29 20:44:49] [INFO ] Deduced a trap composed of 36 places in 420 ms of which 6 ms to minimize.
[2025-05-29 20:44:49] [INFO ] Deduced a trap composed of 40 places in 429 ms of which 5 ms to minimize.
[2025-05-29 20:44:50] [INFO ] Deduced a trap composed of 39 places in 578 ms of which 7 ms to minimize.
[2025-05-29 20:44:51] [INFO ] Deduced a trap composed of 36 places in 582 ms of which 7 ms to minimize.
SMT process timed out in 52013ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 1082 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1082/1082 places, 3695/3695 transitions.
Applied a total of 0 rules in 137 ms. Remains 1082 /1082 variables (removed 0) and now considering 3695/3695 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 137 ms. Remains : 1082/1082 places, 3695/3695 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1082/1082 places, 3695/3695 transitions.
Applied a total of 0 rules in 137 ms. Remains 1082 /1082 variables (removed 0) and now considering 3695/3695 (removed 0) transitions.
[2025-05-29 20:44:51] [INFO ] Invariant cache hit.
[2025-05-29 20:44:54] [INFO ] Implicit Places using invariants in 2574 ms returned []
[2025-05-29 20:44:54] [INFO ] Invariant cache hit.
[2025-05-29 20:44:55] [INFO ] State equation strengthened by 3605 read => feed constraints.
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :9227 after 828882
[2025-05-29 20:45:26] [INFO ] Performed 1080/1082 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2025-05-29 20:45:26] [INFO ] Implicit Places using invariants and state equation in 32151 ms returned []
Implicit Place search using SMT with State Equation took 34731 ms to find 0 implicit places.
[2025-05-29 20:45:26] [INFO ] Redundant transitions in 183 ms returned []
Running 3665 sub problems to find dead transitions.
[2025-05-29 20:45:26] [INFO ] Invariant cache hit.
[2025-05-29 20:45:26] [INFO ] State equation strengthened by 3605 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/1081 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 3665 unsolved
SMT process timed out in 32951ms, After SMT, problems are : Problem set: 0 solved, 3665 unsolved
Search for dead transitions found 0 dead transitions in 33014ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 68083 ms. Remains : 1082/1082 places, 3695/3695 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[1] Max Struct:[30]
Ending property specific reduction for CANInsertWithFailure-PT-030-UpperBounds-07 in 231714 ms.
Starting property specific reduction for CANInsertWithFailure-PT-030-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:[30]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[30]
// Phase 1: matrix 3704 rows 1091 cols
[2025-05-29 20:45:59] [INFO ] Computed 32 invariants in 72 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[30]
RANDOM walk for 10000 steps (70 resets) in 146 ms. (68 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 22 ms. (434 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[30]
[2025-05-29 20:45:59] [INFO ] Invariant cache hit.
[2025-05-29 20:46:00] [INFO ] [Real]Absence check using 30 positive place invariants in 38 ms returned sat
[2025-05-29 20:46:00] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 17 ms returned sat
[2025-05-29 20:46:01] [INFO ] [Real]Absence check using state equation in 1259 ms returned sat
[2025-05-29 20:46:01] [INFO ] State equation strengthened by 3585 read => feed constraints.
[2025-05-29 20:46:02] [INFO ] [Real]Added 3585 Read/Feed constraints in 618 ms returned sat
[2025-05-29 20:46:02] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 20:46:02] [INFO ] [Nat]Absence check using 30 positive place invariants in 34 ms returned sat
[2025-05-29 20:46:02] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 14 ms returned sat
[2025-05-29 20:46:03] [INFO ] [Nat]Absence check using state equation in 1254 ms returned sat
[2025-05-29 20:46:04] [INFO ] SMT solver returned unknown. Retrying;
[2025-05-29 20:46:05] [INFO ] [Nat]Added 3585 Read/Feed constraints in 1286 ms returned unknown
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[30]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[30]
Support contains 1 out of 1091 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1091/1091 places, 3704/3704 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 16 place count 1083 transition count 3696
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 19 place count 1083 transition count 3696
Applied a total of 19 rules in 362 ms. Remains 1083 /1091 variables (removed 8) and now considering 3696/3704 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 362 ms. Remains : 1083/1091 places, 3696/3704 transitions.
// Phase 1: matrix 3696 rows 1083 cols
[2025-05-29 20:46:05] [INFO ] Computed 32 invariants in 70 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[30]
RANDOM walk for 1000000 steps (7147 resets) in 9744 ms. (102 steps per ms)
BEST_FIRST walk for 1000001 steps (206 resets) in 1242 ms. (804 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[30]
[2025-05-29 20:46:16] [INFO ] Invariant cache hit.
[2025-05-29 20:46:16] [INFO ] [Real]Absence check using 30 positive place invariants in 21 ms returned sat
[2025-05-29 20:46:16] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 11 ms returned sat
[2025-05-29 20:46:17] [INFO ] [Real]Absence check using state equation in 1086 ms returned sat
[2025-05-29 20:46:17] [INFO ] State equation strengthened by 3604 read => feed constraints.
[2025-05-29 20:46:18] [INFO ] [Real]Added 3604 Read/Feed constraints in 601 ms returned sat
[2025-05-29 20:46:18] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 20:46:18] [INFO ] [Nat]Absence check using 30 positive place invariants in 22 ms returned sat
[2025-05-29 20:46:18] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 11 ms returned sat
[2025-05-29 20:46:19] [INFO ] [Nat]Absence check using state equation in 1175 ms returned sat
[2025-05-29 20:46:20] [INFO ] [Nat]Added 3604 Read/Feed constraints in 515 ms returned sat
[2025-05-29 20:46:20] [INFO ] Computed and/alt/rep : 2622/6957/2622 causal constraints (skipped 1044 transitions) in 264 ms.
[2025-05-29 20:46:21] [INFO ] Added : 10 causal constraints over 2 iterations in 1055 ms. Result :sat
Minimization took 4512 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[30]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[30]
Support contains 1 out of 1083 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1083/1083 places, 3696/3696 transitions.
Applied a total of 0 rules in 87 ms. Remains 1083 /1083 variables (removed 0) and now considering 3696/3696 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 87 ms. Remains : 1083/1083 places, 3696/3696 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1083/1083 places, 3696/3696 transitions.
Applied a total of 0 rules in 83 ms. Remains 1083 /1083 variables (removed 0) and now considering 3696/3696 (removed 0) transitions.
[2025-05-29 20:46:26] [INFO ] Invariant cache hit.
[2025-05-29 20:46:28] [INFO ] Implicit Places using invariants in 2660 ms returned []
[2025-05-29 20:46:28] [INFO ] Invariant cache hit.
[2025-05-29 20:46:30] [INFO ] State equation strengthened by 3604 read => feed constraints.
[2025-05-29 20:47:00] [INFO ] Implicit Places using invariants and state equation in 31776 ms returned []
Implicit Place search using SMT with State Equation took 34438 ms to find 0 implicit places.
[2025-05-29 20:47:00] [INFO ] Redundant transitions in 167 ms returned []
Running 3666 sub problems to find dead transitions.
[2025-05-29 20:47:00] [INFO ] Invariant cache hit.
[2025-05-29 20:47:01] [INFO ] State equation strengthened by 3604 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1082 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 3666 unsolved
SMT process timed out in 32872ms, After SMT, problems are : Problem set: 0 solved, 3666 unsolved
Search for dead transitions found 0 dead transitions in 32910ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 67612 ms. Remains : 1083/1083 places, 3696/3696 transitions.
[2025-05-29 20:47:34] [INFO ] Flatten gal took : 297 ms
RANDOM walk for 40000 steps (282 resets) in 1400 ms. (28 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 87 ms. (454 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
[2025-05-29 20:47:34] [INFO ] Flatten gal took : 111 ms
[2025-05-29 20:47:34] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6184320022640152674.gal : 17 ms
[2025-05-29 20:47:34] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14831444011343830673.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/ReachabilityCardinality6184320022640152674.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14831444011343830673.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/ReachabilityCardinality14831444011343830673.prop.
Interrupted probabilistic random walk after 141648 steps, run timeout after 3001 ms. (steps per millisecond=47 ) properties seen :0 out of 2
Probabilistic random walk after 141648 steps, saw 27927 distinct states, run finished after 3001 ms. (steps per millisecond=47 ) properties seen :0
[2025-05-29 20:47:37] [INFO ] Invariant cache hit.
[2025-05-29 20:47:37] [INFO ] State equation strengthened by 3604 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) 1020/1021 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-05-29 20:47:37] [INFO ] Deduced a trap composed of 2 places in 51 ms of which 1 ms to minimize.
Problem MAX0 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/1021 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1021 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 58/1079 variables, 29/31 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1079 variables, 0/31 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/1081 variables, 2/33 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2025-05-29 20:47:39] [INFO ] Deduced a trap composed of 52 places in 1248 ms of which 10 ms to minimize.
[2025-05-29 20:47:40] [INFO ] Deduced a trap composed of 37 places in 1112 ms of which 10 ms to minimize.
[2025-05-29 20:47:41] [INFO ] Deduced a trap composed of 40 places in 1100 ms of which 9 ms to minimize.
[2025-05-29 20:47:42] [INFO ] Deduced a trap composed of 36 places in 1050 ms of which 9 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 1.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 1.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 1.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 1.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 1.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 1.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 1.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 1.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 1.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 1.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 1.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 1.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 1.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 1.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 1.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 1.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 1.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 1.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 1.0)
(s114 1.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 1.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 1.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 1.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 1.0)
(s138 1.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 1.0)
(s145 0.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 0.0)
(s155 0.0)
(s156 1.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 1.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 1.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 1.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 1.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 25.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 0.0)
(s429 0.0)
(s430 0.0)
(s431 0.0)
(s432 0.0)
(s433 0.0)
(s434 0.0)
(s435 0.0)
(s436 0.0)
(s437 0.0)
(s438 0.0)
(s439 0.0)
(s440 0.0)
(s441 0.0)
(s442 0.0)
(s443 0.0)
(s444 0.0)
(s445 0.0)
(s446 0.0)
(s447 0.0)
(s448 0.0)
(s449 0.0)
(s450 0.0)
(s451 0.0)
(s452 0.0)
(s453 0.0)
(s454 0.0)
(s455 0.0)
(s456 0.0)
(s457 0.0)
(s458 0.0)
(s459 0.0)
(s460 0.0)
(s461 0.0)
(s462 0.0)
(s463 0.0)
(s464 0.0)
(s465 0.0)
(s466 0.0)
(s467 0.0)
(s468 0.0)
(s469 0.0)
(s470 0.0)
(s471 0.0)
(s472 0.0)
(s473 0.0)
(s474 0.0)
(s475 0.0)
(s476 0.0)
(s477 0.0)
(s478 0.0)
(s479 0.0)
(s480 0.0)
(s481 0.0)
(s482 0.0)
(s483 0.0)
(s484 0.0)
(s485 0.0)
(s486 0.0)
(s487 0.0)
(s488 0.0)
(s489 0.0)
(s490 0.0)
(s491 0.0)
(s492 0.0)
(s493 0.0)
(s494 0.0)
(s495 0.0)
(s496 0.0)
(s497 0.0)
(s498 0.0)
(s499 0.0)
(s500 0.0)
(s501 0.0)
(s502 0.0)
(s503 0.0)
(s504 0.0)
(s505 0.0)
(s506 0.0)
(s507 0.0)
(s508 0.0)
(s509 0.0)
(s510 0.0)
(s511 0.0)
(s512 0.0)
(s513 0.0)
(s514 0.0)
(s515 0.0)
(s516 0.0)
(s517 0.0)
(s518 0.0)
(s519 0.0)
(s520 0.0)
(s521 0.0)
(s522 0.0)
(s523 0.0)
(s524 0.0)
(s525 0.0)
(s526 0.0)
(s527 0.0)
(s528 0.0)
(s529 0.0)
(s530 0.0)
(s531 0.0)
(s532 0.0)
(s533 0.0)
(s534 0.0)
(s535 0.0)
(s536 0.0)
(s537 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1081/4779 variables, and 37 constraints, problems are : Problem set: 1 solved, 1 unsolved in 5010 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 0/1083 constraints, ReadFeed: 0/3604 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 963
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1020/1021 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1021 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2025-05-29 20:47:42] [INFO ] Deduced a trap composed of 2 places in 46 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1021 variables, 1/3 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1021 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 58/1079 variables, 29/32 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1079 variables, 0/32 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/1081 variables, 2/34 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1081 variables, 4/38 constraints. Problems are: Problem set: 1 solved, 1 unsolved
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :963 after 1043
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :1043 after 1171
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :1171 after 1367
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :1367 after 1563
[2025-05-29 20:47:43] [INFO ] Deduced a trap composed of 38 places in 1149 ms of which 10 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :1563 after 1718
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :1718 after 1731
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :1731 after 1771
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :1771 after 1871
[2025-05-29 20:47:45] [INFO ] Deduced a trap composed of 50 places in 1104 ms of which 9 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :1871 after 2124
[2025-05-29 20:47:46] [INFO ] Deduced a trap composed of 44 places in 1101 ms of which 9 ms to minimize.
[2025-05-29 20:47:47] [INFO ] Deduced a trap composed of 47 places in 1046 ms of which 10 ms to minimize.
[2025-05-29 20:47:48] [INFO ] Deduced a trap composed of 38 places in 1005 ms of which 9 ms to minimize.
SMT process timed out in 10914ms, After SMT, problems are : Problem set: 1 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 1083 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1083/1083 places, 3696/3696 transitions.
Applied a total of 0 rules in 84 ms. Remains 1083 /1083 variables (removed 0) and now considering 3696/3696 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 84 ms. Remains : 1083/1083 places, 3696/3696 transitions.
RANDOM walk for 40000 steps (284 resets) in 490 ms. (81 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 72 ms. (548 steps per ms) remains 1/1 properties
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :2124 after 2504
Interrupted probabilistic random walk after 174791 steps, run timeout after 3001 ms. (steps per millisecond=58 ) properties seen :0 out of 1
Probabilistic random walk after 174791 steps, saw 31758 distinct states, run finished after 3001 ms. (steps per millisecond=58 ) properties seen :0
[2025-05-29 20:47:51] [INFO ] Invariant cache hit.
[2025-05-29 20:47:51] [INFO ] State equation strengthened by 3604 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) 1020/1021 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-29 20:47:51] [INFO ] Deduced a trap composed of 2 places in 59 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1021 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1021 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 58/1079 variables, 29/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1079 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/1081 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-29 20:47:53] [INFO ] Deduced a trap composed of 55 places in 1185 ms of which 10 ms to minimize.
[2025-05-29 20:47:54] [INFO ] Deduced a trap composed of 38 places in 1117 ms of which 9 ms to minimize.
[2025-05-29 20:47:55] [INFO ] Deduced a trap composed of 37 places in 1072 ms of which 9 ms to minimize.
[2025-05-29 20:47:56] [INFO ] Deduced a trap composed of 34 places in 1060 ms of which 9 ms to minimize.
[2025-05-29 20:47:57] [INFO ] Deduced a trap composed of 38 places in 986 ms of which 9 ms to minimize.
[2025-05-29 20:47:58] [INFO ] Deduced a trap composed of 38 places in 948 ms of which 9 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :2504 after 3061
[2025-05-29 20:47:59] [INFO ] Deduced a trap composed of 38 places in 947 ms of which 8 ms to minimize.
[2025-05-29 20:48:00] [INFO ] Deduced a trap composed of 38 places in 936 ms of which 8 ms to minimize.
[2025-05-29 20:48:01] [INFO ] Deduced a trap composed of 58 places in 952 ms of which 8 ms to minimize.
[2025-05-29 20:48:02] [INFO ] Deduced a trap composed of 43 places in 906 ms of which 8 ms to minimize.
[2025-05-29 20:48:03] [INFO ] Deduced a trap composed of 38 places in 906 ms of which 8 ms to minimize.
[2025-05-29 20:48:04] [INFO ] Deduced a trap composed of 37 places in 915 ms of which 9 ms to minimize.
[2025-05-29 20:48:05] [INFO ] Deduced a trap composed of 38 places in 900 ms of which 8 ms to minimize.
[2025-05-29 20:48:06] [INFO ] Deduced a trap composed of 35 places in 908 ms of which 9 ms to minimize.
[2025-05-29 20:48:07] [INFO ] Deduced a trap composed of 49 places in 909 ms of which 8 ms to minimize.
[2025-05-29 20:48:07] [INFO ] Deduced a trap composed of 36 places in 953 ms of which 8 ms to minimize.
[2025-05-29 20:48:08] [INFO ] Deduced a trap composed of 39 places in 983 ms of which 8 ms to minimize.
[2025-05-29 20:48:09] [INFO ] Deduced a trap composed of 39 places in 903 ms of which 8 ms to minimize.
[2025-05-29 20:48:10] [INFO ] Deduced a trap composed of 36 places in 965 ms of which 8 ms to minimize.
[2025-05-29 20:48:11] [INFO ] Deduced a trap composed of 41 places in 881 ms of which 8 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1081 variables, 20/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-29 20:48:12] [INFO ] Deduced a trap composed of 41 places in 1030 ms of which 8 ms to minimize.
[2025-05-29 20:48:13] [INFO ] Deduced a trap composed of 48 places in 843 ms of which 7 ms to minimize.
[2025-05-29 20:48:14] [INFO ] Deduced a trap composed of 43 places in 883 ms of which 8 ms to minimize.
[2025-05-29 20:48:15] [INFO ] Deduced a trap composed of 37 places in 817 ms of which 7 ms to minimize.
[2025-05-29 20:48:16] [INFO ] Deduced a trap composed of 46 places in 780 ms of which 7 ms to minimize.
[2025-05-29 20:48:17] [INFO ] Deduced a trap composed of 40 places in 775 ms of which 7 ms to minimize.
[2025-05-29 20:48:17] [INFO ] Deduced a trap composed of 37 places in 908 ms of which 7 ms to minimize.
[2025-05-29 20:48:18] [INFO ] Deduced a trap composed of 42 places in 886 ms of which 6 ms to minimize.
[2025-05-29 20:48:19] [INFO ] Deduced a trap composed of 39 places in 708 ms of which 7 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1081 variables, 9/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/1081 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 3696/4777 variables, 1081/1143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/4777 variables, 3604/4747 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/4777 variables, 0/4747 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 2/4779 variables, 2/4749 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/4779 variables, 0/4749 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/4779 variables, 0/4749 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4779/4779 variables, and 4749 constraints, problems are : Problem set: 0 solved, 1 unsolved in 30166 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1083/1083 constraints, ReadFeed: 3604/3604 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 30/30 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) 1020/1021 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1021 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-29 20:48:21] [INFO ] Deduced a trap composed of 2 places in 44 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1021 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1021 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 58/1079 variables, 29/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1079 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/1081 variables, 2/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1081 variables, 29/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-29 20:48:23] [INFO ] Deduced a trap composed of 38 places in 1124 ms of which 9 ms to minimize.
[2025-05-29 20:48:24] [INFO ] Deduced a trap composed of 37 places in 1079 ms of which 9 ms to minimize.
Detected timeout of ITS tools.
[2025-05-29 20:48:24] [INFO ] Flatten gal took : 130 ms
[2025-05-29 20:48:24] [INFO ] Applying decomposition
[2025-05-29 20:48:24] [INFO ] Flatten gal took : 133 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/graph137066270060877170.txt' '-o' '/tmp/graph137066270060877170.bin' '-w' '/tmp/graph137066270060877170.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph137066270060877170.bin' '-l' '-1' '-v' '-w' '/tmp/graph137066270060877170.weights' '-q' '0' '-e' '0.001'
[2025-05-29 20:48:24] [INFO ] Decomposing Gal with order
[2025-05-29 20:48:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-29 20:48:25] [INFO ] Removed a total of 2823 redundant transitions.
[2025-05-29 20:48:25] [INFO ] Flatten gal took : 306 ms
[2025-05-29 20:48:25] [INFO ] Deduced a trap composed of 36 places in 1207 ms of which 12 ms to minimize.
[2025-05-29 20:48:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 3280 labels/synchronizations in 145 ms.
[2025-05-29 20:48:25] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14459679042818137121.gal : 33 ms
[2025-05-29 20:48:25] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7131147688162005120.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/ReachabilityCardinality14459679042818137121.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7131147688162005120.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/ReachabilityCardinality7131147688162005120.prop.
[2025-05-29 20:48:26] [INFO ] Deduced a trap composed of 35 places in 1109 ms of which 9 ms to minimize.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 75
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :75 after 75
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :75 after 75
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :75 after 75
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :75 after 75
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :75 after 75
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :75 after 75
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :75 after 75
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :75 after 75
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :75 after 75
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :75 after 3185
[2025-05-29 20:48:27] [INFO ] Deduced a trap composed of 37 places in 1196 ms of which 8 ms to minimize.
[2025-05-29 20:48:28] [INFO ] Deduced a trap composed of 41 places in 1001 ms of which 8 ms to minimize.
[2025-05-29 20:48:29] [INFO ] Deduced a trap composed of 39 places in 1014 ms of which 13 ms to minimize.
[2025-05-29 20:48:31] [INFO ] Deduced a trap composed of 51 places in 1051 ms of which 8 ms to minimize.
[2025-05-29 20:48:31] [INFO ] Deduced a trap composed of 47 places in 897 ms of which 8 ms to minimize.
[2025-05-29 20:48:32] [INFO ] Deduced a trap composed of 41 places in 926 ms of which 8 ms to minimize.
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :3185 after 392732
[2025-05-29 20:48:34] [INFO ] Deduced a trap composed of 41 places in 1482 ms of which 13 ms to minimize.
[2025-05-29 20:48:35] [INFO ] Deduced a trap composed of 47 places in 1414 ms of which 13 ms to minimize.
[2025-05-29 20:48:37] [INFO ] Deduced a trap composed of 43 places in 1227 ms of which 11 ms to minimize.
[2025-05-29 20:48:38] [INFO ] Deduced a trap composed of 55 places in 1184 ms of which 11 ms to minimize.
[2025-05-29 20:48:39] [INFO ] Deduced a trap composed of 39 places in 1381 ms of which 13 ms to minimize.
[2025-05-29 20:48:41] [INFO ] Deduced a trap composed of 52 places in 1430 ms of which 12 ms to minimize.
[2025-05-29 20:48:42] [INFO ] Deduced a trap composed of 37 places in 1234 ms of which 10 ms to minimize.
[2025-05-29 20:48:43] [INFO ] Deduced a trap composed of 40 places in 1077 ms of which 8 ms to minimize.
[2025-05-29 20:48:44] [INFO ] Deduced a trap composed of 58 places in 1168 ms of which 13 ms to minimize.
[2025-05-29 20:48:46] [INFO ] Deduced a trap composed of 37 places in 1285 ms of which 11 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/1081 variables, 20/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-29 20:48:47] [INFO ] Deduced a trap composed of 42 places in 1217 ms of which 12 ms to minimize.
[2025-05-29 20:48:48] [INFO ] Deduced a trap composed of 40 places in 1232 ms of which 11 ms to minimize.
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :392732 after 1.95099e+07
[2025-05-29 20:48:49] [INFO ] Deduced a trap composed of 40 places in 1241 ms of which 13 ms to minimize.
[2025-05-29 20:48:51] [INFO ] Deduced a trap composed of 40 places in 1292 ms of which 13 ms to minimize.
[2025-05-29 20:48:52] [INFO ] Deduced a trap composed of 45 places in 1265 ms of which 11 ms to minimize.
[2025-05-29 20:48:53] [INFO ] Deduced a trap composed of 43 places in 1172 ms of which 11 ms to minimize.
[2025-05-29 20:48:54] [INFO ] Deduced a trap composed of 47 places in 1117 ms of which 10 ms to minimize.
[2025-05-29 20:48:55] [INFO ] Deduced a trap composed of 47 places in 1041 ms of which 9 ms to minimize.
[2025-05-29 20:48:56] [INFO ] Deduced a trap composed of 38 places in 886 ms of which 8 ms to minimize.
[2025-05-29 20:48:57] [INFO ] Deduced a trap composed of 37 places in 872 ms of which 11 ms to minimize.
[2025-05-29 20:48:58] [INFO ] Deduced a trap composed of 38 places in 1097 ms of which 10 ms to minimize.
[2025-05-29 20:48:59] [INFO ] Deduced a trap composed of 38 places in 1038 ms of which 10 ms to minimize.
[2025-05-29 20:49:00] [INFO ] Deduced a trap composed of 43 places in 1128 ms of which 11 ms to minimize.
[2025-05-29 20:49:02] [INFO ] Deduced a trap composed of 37 places in 1038 ms of which 7 ms to minimize.
[2025-05-29 20:49:02] [INFO ] Deduced a trap composed of 38 places in 882 ms of which 7 ms to minimize.
[2025-05-29 20:49:03] [INFO ] Deduced a trap composed of 36 places in 695 ms of which 7 ms to minimize.
[2025-05-29 20:49:04] [INFO ] Deduced a trap composed of 37 places in 706 ms of which 7 ms to minimize.
[2025-05-29 20:49:05] [INFO ] Deduced a trap composed of 38 places in 754 ms of which 7 ms to minimize.
[2025-05-29 20:49:05] [INFO ] Deduced a trap composed of 47 places in 704 ms of which 7 ms to minimize.
[2025-05-29 20:49:06] [INFO ] Deduced a trap composed of 49 places in 840 ms of which 12 ms to minimize.
SMT process timed out in 75220ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 1083 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1083/1083 places, 3696/3696 transitions.
Applied a total of 0 rules in 138 ms. Remains 1083 /1083 variables (removed 0) and now considering 3696/3696 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 138 ms. Remains : 1083/1083 places, 3696/3696 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1083/1083 places, 3696/3696 transitions.
Applied a total of 0 rules in 156 ms. Remains 1083 /1083 variables (removed 0) and now considering 3696/3696 (removed 0) transitions.
[2025-05-29 20:49:07] [INFO ] Invariant cache hit.
[2025-05-29 20:49:09] [INFO ] Implicit Places using invariants in 2584 ms returned []
[2025-05-29 20:49:09] [INFO ] Invariant cache hit.
[2025-05-29 20:49:11] [INFO ] State equation strengthened by 3604 read => feed constraints.
Detected timeout of ITS tools.
[2025-05-29 20:49:40] [INFO ] Implicit Places using invariants and state equation in 30710 ms returned []
Implicit Place search using SMT with State Equation took 33296 ms to find 0 implicit places.
[2025-05-29 20:49:40] [INFO ] Redundant transitions in 162 ms returned []
Running 3666 sub problems to find dead transitions.
[2025-05-29 20:49:40] [INFO ] Invariant cache hit.
[2025-05-29 20:49:40] [INFO ] State equation strengthened by 3604 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/1082 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 3666 unsolved
SMT process timed out in 32661ms, After SMT, problems are : Problem set: 0 solved, 3666 unsolved
Search for dead transitions found 0 dead transitions in 32700ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66330 ms. Remains : 1083/1083 places, 3696/3696 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[1] Max Struct:[30]
Ending property specific reduction for CANInsertWithFailure-PT-030-UpperBounds-09 in 253745 ms.
Starting property specific reduction for CANInsertWithFailure-PT-030-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:[30]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[30]
// Phase 1: matrix 3704 rows 1091 cols
[2025-05-29 20:50:13] [INFO ] Computed 32 invariants in 46 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[30]
RANDOM walk for 10000 steps (72 resets) in 146 ms. (68 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 22 ms. (434 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[30]
[2025-05-29 20:50:13] [INFO ] Invariant cache hit.
[2025-05-29 20:50:13] [INFO ] [Real]Absence check using 30 positive place invariants in 38 ms returned sat
[2025-05-29 20:50:13] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 18 ms returned sat
[2025-05-29 20:50:14] [INFO ] [Real]Absence check using state equation in 1249 ms returned sat
[2025-05-29 20:50:15] [INFO ] State equation strengthened by 3585 read => feed constraints.
[2025-05-29 20:50:15] [INFO ] [Real]Added 3585 Read/Feed constraints in 641 ms returned sat
[2025-05-29 20:50:15] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 20:50:16] [INFO ] [Nat]Absence check using 30 positive place invariants in 27 ms returned sat
[2025-05-29 20:50:16] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 10 ms returned sat
[2025-05-29 20:50:17] [INFO ] [Nat]Absence check using state equation in 1357 ms returned sat
[2025-05-29 20:50:18] [INFO ] [Nat]Added 3585 Read/Feed constraints in 428 ms returned sat
[2025-05-29 20:50:18] [INFO ] Computed and/alt/rep : 2632/6936/2632 causal constraints (skipped 1042 transitions) in 277 ms.
[2025-05-29 20:50:19] [INFO ] Added : 1 causal constraints over 1 iterations in 908 ms. Result :sat
Minimization took 863 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[30]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[30]
Support contains 1 out of 1091 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1091/1091 places, 3704/3704 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 16 place count 1083 transition count 3696
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 19 place count 1083 transition count 3696
Applied a total of 19 rules in 215 ms. Remains 1083 /1091 variables (removed 8) and now considering 3696/3704 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 215 ms. Remains : 1083/1091 places, 3696/3704 transitions.
// Phase 1: matrix 3696 rows 1083 cols
[2025-05-29 20:50:20] [INFO ] Computed 32 invariants in 46 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[30]
RANDOM walk for 1000000 steps (7153 resets) in 9542 ms. (104 steps per ms)
BEST_FIRST walk for 1000001 steps (201 resets) in 1266 ms. (789 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[30]
[2025-05-29 20:50:30] [INFO ] Invariant cache hit.
[2025-05-29 20:50:31] [INFO ] [Real]Absence check using 30 positive place invariants in 35 ms returned sat
[2025-05-29 20:50:31] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 17 ms returned sat
[2025-05-29 20:50:32] [INFO ] [Real]Absence check using state equation in 1093 ms returned sat
[2025-05-29 20:50:32] [INFO ] State equation strengthened by 3604 read => feed constraints.
[2025-05-29 20:50:32] [INFO ] [Real]Added 3604 Read/Feed constraints in 432 ms returned sat
[2025-05-29 20:50:33] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 20:50:33] [INFO ] [Nat]Absence check using 30 positive place invariants in 37 ms returned sat
[2025-05-29 20:50:33] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 17 ms returned sat
[2025-05-29 20:50:34] [INFO ] [Nat]Absence check using state equation in 1282 ms returned sat
[2025-05-29 20:50:35] [INFO ] [Nat]Added 3604 Read/Feed constraints in 651 ms returned sat
[2025-05-29 20:50:35] [INFO ] Computed and/alt/rep : 2622/6957/2622 causal constraints (skipped 1044 transitions) in 264 ms.
[2025-05-29 20:50:36] [INFO ] Added : 7 causal constraints over 2 iterations in 1078 ms. Result :sat
Minimization took 4510 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[30]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[30]
Support contains 1 out of 1083 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1083/1083 places, 3696/3696 transitions.
Applied a total of 0 rules in 83 ms. Remains 1083 /1083 variables (removed 0) and now considering 3696/3696 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 84 ms. Remains : 1083/1083 places, 3696/3696 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1083/1083 places, 3696/3696 transitions.
Applied a total of 0 rules in 89 ms. Remains 1083 /1083 variables (removed 0) and now considering 3696/3696 (removed 0) transitions.
[2025-05-29 20:50:41] [INFO ] Invariant cache hit.
[2025-05-29 20:50:43] [INFO ] Implicit Places using invariants in 2370 ms returned []
[2025-05-29 20:50:43] [INFO ] Invariant cache hit.
[2025-05-29 20:50:44] [INFO ] State equation strengthened by 3604 read => feed constraints.
[2025-05-29 20:51:15] [INFO ] Performed 1052/1083 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2025-05-29 20:51:16] [INFO ] Implicit Places using invariants and state equation in 32705 ms returned []
Implicit Place search using SMT with State Equation took 35077 ms to find 0 implicit places.
[2025-05-29 20:51:16] [INFO ] Redundant transitions in 157 ms returned []
Running 3666 sub problems to find dead transitions.
[2025-05-29 20:51:16] [INFO ] Invariant cache hit.
[2025-05-29 20:51:16] [INFO ] State equation strengthened by 3604 read => feed constraints.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/1082 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 3666 unsolved
SMT process timed out in 32996ms, After SMT, problems are : Problem set: 0 solved, 3666 unsolved
Search for dead transitions found 0 dead transitions in 33063ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 68408 ms. Remains : 1083/1083 places, 3696/3696 transitions.
[2025-05-29 20:51:49] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[30]
RANDOM walk for 1000000 steps (7149 resets) in 9711 ms. (102 steps per ms)
BEST_FIRST walk for 1000001 steps (204 resets) in 1496 ms. (668 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[30]
[2025-05-29 20:52:00] [INFO ] Invariant cache hit.
[2025-05-29 20:52:00] [INFO ] [Real]Absence check using 30 positive place invariants in 35 ms returned sat
[2025-05-29 20:52:00] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 17 ms returned sat
[2025-05-29 20:52:02] [INFO ] [Real]Absence check using state equation in 1230 ms returned sat
[2025-05-29 20:52:02] [INFO ] State equation strengthened by 3604 read => feed constraints.
[2025-05-29 20:52:02] [INFO ] [Real]Added 3604 Read/Feed constraints in 537 ms returned sat
[2025-05-29 20:52:03] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 20:52:03] [INFO ] [Nat]Absence check using 30 positive place invariants in 26 ms returned sat
[2025-05-29 20:52:03] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 11 ms returned sat
[2025-05-29 20:52:04] [INFO ] [Nat]Absence check using state equation in 1132 ms returned sat
[2025-05-29 20:52:04] [INFO ] [Nat]Added 3604 Read/Feed constraints in 531 ms returned sat
[2025-05-29 20:52:05] [INFO ] Computed and/alt/rep : 2622/6957/2622 causal constraints (skipped 1044 transitions) in 400 ms.
[2025-05-29 20:52:06] [INFO ] Added : 7 causal constraints over 2 iterations in 1220 ms. Result :sat
Minimization took 4509 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[30]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[30]
Support contains 1 out of 1083 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1083/1083 places, 3696/3696 transitions.
Applied a total of 0 rules in 140 ms. Remains 1083 /1083 variables (removed 0) and now considering 3696/3696 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 141 ms. Remains : 1083/1083 places, 3696/3696 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1083/1083 places, 3696/3696 transitions.
Applied a total of 0 rules in 139 ms. Remains 1083 /1083 variables (removed 0) and now considering 3696/3696 (removed 0) transitions.
[2025-05-29 20:52:11] [INFO ] Invariant cache hit.
[2025-05-29 20:52:13] [INFO ] Implicit Places using invariants in 2178 ms returned []
[2025-05-29 20:52:13] [INFO ] Invariant cache hit.
[2025-05-29 20:52:14] [INFO ] State equation strengthened by 3604 read => feed constraints.
[2025-05-29 20:52:45] [INFO ] Performed 1037/1083 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2025-05-29 20:52:46] [INFO ] Implicit Places using invariants and state equation in 33068 ms returned []
Implicit Place search using SMT with State Equation took 35248 ms to find 0 implicit places.
[2025-05-29 20:52:46] [INFO ] Redundant transitions in 161 ms returned []
Running 3666 sub problems to find dead transitions.
[2025-05-29 20:52:46] [INFO ] Invariant cache hit.
[2025-05-29 20:52:46] [INFO ] State equation strengthened by 3604 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1082 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 3666 unsolved
SMT process timed out in 32882ms, After SMT, problems are : Problem set: 0 solved, 3666 unsolved
Search for dead transitions found 0 dead transitions in 32919ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 68482 ms. Remains : 1083/1083 places, 3696/3696 transitions.
[2025-05-29 20:53:19] [INFO ] Flatten gal took : 127 ms
RANDOM walk for 40000 steps (281 resets) in 817 ms. (48 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
[2025-05-29 20:53:19] [INFO ] Flatten gal took : 159 ms
[2025-05-29 20:53:19] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4584734958559774284.gal : 25 ms
[2025-05-29 20:53:19] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality485927827106964225.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/ReachabilityCardinality4584734958559774284.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality485927827106964225.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 ...327
BEST_FIRST walk for 40004 steps (8 resets) in 155 ms. (256 steps per ms) remains 2/2 properties
Loading property file /tmp/ReachabilityCardinality485927827106964225.prop.
Interrupted probabilistic random walk after 147044 steps, run timeout after 3001 ms. (steps per millisecond=48 ) properties seen :0 out of 2
Probabilistic random walk after 147044 steps, saw 28610 distinct states, run finished after 3001 ms. (steps per millisecond=48 ) properties seen :0
[2025-05-29 20:53:22] [INFO ] Invariant cache hit.
[2025-05-29 20:53:22] [INFO ] State equation strengthened by 3604 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) 1020/1021 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-05-29 20:53:23] [INFO ] Deduced a trap composed of 2 places in 43 ms of which 1 ms to minimize.
Problem MAX0 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/1021 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1021 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 58/1079 variables, 29/31 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1079 variables, 0/31 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/1081 variables, 2/33 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2025-05-29 20:53:24] [INFO ] Deduced a trap composed of 52 places in 1129 ms of which 9 ms to minimize.
[2025-05-29 20:53:25] [INFO ] Deduced a trap composed of 37 places in 1068 ms of which 9 ms to minimize.
[2025-05-29 20:53:26] [INFO ] Deduced a trap composed of 40 places in 1083 ms of which 9 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 963
[2025-05-29 20:53:27] [INFO ] Deduced a trap composed of 36 places in 1032 ms of which 9 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :963 after 1043
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :1043 after 1171
[2025-05-29 20:53:28] [INFO ] Deduced a trap composed of 35 places in 1028 ms of which 9 ms to minimize.
SMT process timed out in 5878ms, After SMT, problems are : Problem set: 1 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 1083 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1083/1083 places, 3696/3696 transitions.
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :1171 after 1367
Applied a total of 0 rules in 85 ms. Remains 1083 /1083 variables (removed 0) and now considering 3696/3696 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 86 ms. Remains : 1083/1083 places, 3696/3696 transitions.
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :1367 after 1563
RANDOM walk for 40000 steps (284 resets) in 796 ms. (50 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 64 ms. (615 steps per ms) remains 1/1 properties
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :1563 after 1718
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :1718 after 1731
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :1731 after 1771
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :1771 after 1871
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :1871 after 2123
Interrupted probabilistic random walk after 187426 steps, run timeout after 3001 ms. (steps per millisecond=62 ) properties seen :0 out of 1
Probabilistic random walk after 187426 steps, saw 33099 distinct states, run finished after 3001 ms. (steps per millisecond=62 ) properties seen :0
[2025-05-29 20:53:32] [INFO ] Invariant cache hit.
[2025-05-29 20:53:32] [INFO ] State equation strengthened by 3604 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) 1020/1021 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-29 20:53:32] [INFO ] Deduced a trap composed of 2 places in 47 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1021 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1021 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 58/1079 variables, 29/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1079 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/1081 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-29 20:53:33] [INFO ] Deduced a trap composed of 35 places in 1109 ms of which 9 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :2123 after 2503
[2025-05-29 20:53:34] [INFO ] Deduced a trap composed of 35 places in 1051 ms of which 9 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1081 variables, 2/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1081 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 3696/4777 variables, 1081/1116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4777 variables, 3604/4720 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/4777 variables, 0/4720 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 2/4779 variables, 2/4722 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/4779 variables, 0/4722 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/4779 variables, 0/4722 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4779/4779 variables, and 4722 constraints, problems are : Problem set: 0 solved, 1 unsolved in 4868 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1083/1083 constraints, ReadFeed: 3604/3604 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 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) 1020/1021 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1021 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-29 20:53:37] [INFO ] Deduced a trap composed of 2 places in 42 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1021 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1021 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 58/1079 variables, 29/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1079 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/1081 variables, 2/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1081 variables, 2/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-29 20:53:38] [INFO ] Deduced a trap composed of 41 places in 1130 ms of which 9 ms to minimize.
[2025-05-29 20:53:38] [INFO ] Deduced a trap composed of 39 places in 66 ms of which 2 ms to minimize.
[2025-05-29 20:53:38] [INFO ] Deduced a trap composed of 36 places in 67 ms of which 1 ms to minimize.
[2025-05-29 20:53:38] [INFO ] Deduced a trap composed of 37 places in 66 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/1081 variables, 4/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1081 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 3696/4777 variables, 1081/1121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/4777 variables, 3604/4725 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/4777 variables, 1/4726 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/4777 variables, 0/4726 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 2/4779 variables, 2/4728 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/4779 variables, 0/4728 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/4779 variables, 0/4728 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4779/4779 variables, and 4728 constraints, problems are : Problem set: 0 solved, 1 unsolved in 4728 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1083/1083 constraints, ReadFeed: 3604/3604 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 8/8 constraints]
After SMT, in 9642ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 31 ms.
Support contains 1 out of 1083 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1083/1083 places, 3696/3696 transitions.
Applied a total of 0 rules in 84 ms. Remains 1083 /1083 variables (removed 0) and now considering 3696/3696 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 84 ms. Remains : 1083/1083 places, 3696/3696 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1083/1083 places, 3696/3696 transitions.
Applied a total of 0 rules in 84 ms. Remains 1083 /1083 variables (removed 0) and now considering 3696/3696 (removed 0) transitions.
[2025-05-29 20:53:41] [INFO ] Invariant cache hit.
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :2503 after 3050
[2025-05-29 20:53:43] [INFO ] Implicit Places using invariants in 1542 ms returned []
[2025-05-29 20:53:43] [INFO ] Invariant cache hit.
[2025-05-29 20:53:44] [INFO ] State equation strengthened by 3604 read => feed constraints.
Detected timeout of ITS tools.
[2025-05-29 20:54:09] [INFO ] Flatten gal took : 75 ms
[2025-05-29 20:54:09] [INFO ] Applying decomposition
[2025-05-29 20:54:10] [INFO ] Flatten gal took : 80 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/graph1627012994161581072.txt' '-o' '/tmp/graph1627012994161581072.bin' '-w' '/tmp/graph1627012994161581072.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph1627012994161581072.bin' '-l' '-1' '-v' '-w' '/tmp/graph1627012994161581072.weights' '-q' '0' '-e' '0.001'
[2025-05-29 20:54:10] [INFO ] Decomposing Gal with order
[2025-05-29 20:54:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-29 20:54:10] [INFO ] Removed a total of 2822 redundant transitions.
[2025-05-29 20:54:10] [INFO ] Flatten gal took : 203 ms
[2025-05-29 20:54:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 3226 labels/synchronizations in 103 ms.
[2025-05-29 20:54:10] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1987280988008603813.gal : 28 ms
[2025-05-29 20:54:10] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16012308992696981339.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/ReachabilityCardinality1987280988008603813.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16012308992696981339.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/ReachabilityCardinality16012308992696981339.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 135
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :135 after 135
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :135 after 135
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :135 after 135
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :135 after 135
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :135 after 135
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :135 after 135
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :135 after 135
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :135 after 135
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :135 after 135
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :135 after 8390
[2025-05-29 20:54:14] [INFO ] Implicit Places using invariants and state equation in 30673 ms returned []
Implicit Place search using SMT with State Equation took 32217 ms to find 0 implicit places.
[2025-05-29 20:54:14] [INFO ] Redundant transitions in 162 ms returned []
Running 3666 sub problems to find dead transitions.
[2025-05-29 20:54:14] [INFO ] Invariant cache hit.
[2025-05-29 20:54:14] [INFO ] State equation strengthened by 3604 read => feed constraints.
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :8390 after 689218
At refinement iteration 0 (INCLUDED_ONLY) 0/1082 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 3666 unsolved
SMT process timed out in 32727ms, After SMT, problems are : Problem set: 0 solved, 3666 unsolved
Search for dead transitions found 0 dead transitions in 32767ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65247 ms. Remains : 1083/1083 places, 3696/3696 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 3513 edges and 1083 vertex of which 959 / 1083 are part of one of the 2 SCC in 13 ms
Free SCC test removed 957 places
Drop transitions (Empty/Sink Transition effects.) removed 2645 transitions
Ensure Unique test removed 922 transitions
Reduce isomorphic transitions removed 3567 transitions.
Graph (complete) has 311 edges and 126 vertex of which 35 are kept as prefixes of interest. Removing 91 places using SCC suffix rule.0 ms
Discarding 91 places :
Also discarding 29 output transitions
Drop transitions (Output transitions of discarded places.) removed 29 transitions
Drop transitions (Empty/Sink Transition effects.) removed 61 transitions
Reduce isomorphic transitions removed 61 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 62 rules applied. Total rules applied 64 place count 35 transition count 38
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 65 place count 34 transition count 38
Discarding 28 places :
Symmetric choice reduction at 2 with 28 rule applications. Total rules 93 place count 6 transition count 10
Iterating global reduction 2 with 28 rules applied. Total rules applied 121 place count 6 transition count 10
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 123 place count 6 transition count 8
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 124 place count 6 transition count 7
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 126 place count 5 transition count 6
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 127 place count 4 transition count 5
Applied a total of 127 rules in 44 ms. Remains 4 /1083 variables (removed 1079) and now considering 5/3696 (removed 3691) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 5 rows 4 cols
[2025-05-29 20:54:47] [INFO ] Computed 0 invariants in 0 ms
[2025-05-29 20:54:47] [INFO ] After 21ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2025-05-29 20:54:47] [INFO ] After 4ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-05-29 20:54:47] [INFO ] After 6ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-05-29 20:54:47] [INFO ] After 25ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2025-05-29 20:54:47] [INFO ] Flatten gal took : 0 ms
[2025-05-29 20:54:47] [INFO ] Flatten gal took : 0 ms
[2025-05-29 20:54:47] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8740564276112145408.gal : 0 ms
[2025-05-29 20:54:47] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10154126346459881784.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/ReachabilityCardinality8740564276112145408.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10154126346459881784.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/ReachabilityCardinality10154126346459881784.prop.
Invariant property MIN0 does not hold.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 3 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,6,0.002883,3516,2,7,6,33,6,0,21,18,0
Total reachable state count : 6
Verifying 1 reachability properties.
Invariant property MIN0 does not hold.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN0,1,0.003244,3888,2,5,6,33,7,0,24,18,0
Over-approximation ignoring read arcs solved 0 properties in 125 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[1] Max Struct:[30]
Ending property specific reduction for CANInsertWithFailure-PT-030-UpperBounds-10 in 274047 ms.
Starting property specific reduction for CANInsertWithFailure-PT-030-UpperBounds-11
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:[30]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[30]
// Phase 1: matrix 3704 rows 1091 cols
[2025-05-29 20:54:47] [INFO ] Computed 32 invariants in 44 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[30]
RANDOM walk for 10000 steps (71 resets) in 108 ms. (91 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 23 ms. (416 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[30]
[2025-05-29 20:54:47] [INFO ] Invariant cache hit.
[2025-05-29 20:54:47] [INFO ] [Real]Absence check using 30 positive place invariants in 38 ms returned sat
[2025-05-29 20:54:47] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 20 ms returned sat
[2025-05-29 20:54:49] [INFO ] [Real]Absence check using state equation in 1276 ms returned sat
[2025-05-29 20:54:49] [INFO ] State equation strengthened by 3585 read => feed constraints.
[2025-05-29 20:54:49] [INFO ] [Real]Added 3585 Read/Feed constraints in 558 ms returned sat
[2025-05-29 20:54:49] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 20:54:50] [INFO ] [Nat]Absence check using 30 positive place invariants in 38 ms returned sat
[2025-05-29 20:54:50] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 18 ms returned sat
[2025-05-29 20:54:51] [INFO ] [Nat]Absence check using state equation in 1238 ms returned sat
[2025-05-29 20:54:52] [INFO ] [Nat]Added 3585 Read/Feed constraints in 588 ms returned sat
[2025-05-29 20:54:52] [INFO ] Computed and/alt/rep : 2632/6936/2632 causal constraints (skipped 1042 transitions) in 256 ms.
[2025-05-29 20:54:53] [INFO ] Added : 8 causal constraints over 2 iterations in 1164 ms. Result :sat
Minimization took 766 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[30]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[30]
Support contains 1 out of 1091 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1091/1091 places, 3704/3704 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 16 place count 1083 transition count 3696
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 19 place count 1083 transition count 3696
Applied a total of 19 rules in 270 ms. Remains 1083 /1091 variables (removed 8) and now considering 3696/3704 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 270 ms. Remains : 1083/1091 places, 3696/3704 transitions.
// Phase 1: matrix 3696 rows 1083 cols
[2025-05-29 20:54:54] [INFO ] Computed 32 invariants in 73 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[30]
RANDOM walk for 1000000 steps (7149 resets) in 9754 ms. (102 steps per ms)
BEST_FIRST walk for 1000001 steps (201 resets) in 1225 ms. (815 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[30]
[2025-05-29 20:55:05] [INFO ] Invariant cache hit.
[2025-05-29 20:55:05] [INFO ] [Real]Absence check using 30 positive place invariants in 21 ms returned sat
[2025-05-29 20:55:05] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 11 ms returned sat
[2025-05-29 20:55:06] [INFO ] [Real]Absence check using state equation in 1274 ms returned sat
[2025-05-29 20:55:07] [INFO ] State equation strengthened by 3604 read => feed constraints.
[2025-05-29 20:55:07] [INFO ] [Real]Added 3604 Read/Feed constraints in 482 ms returned sat
[2025-05-29 20:55:07] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 20:55:07] [INFO ] [Nat]Absence check using 30 positive place invariants in 36 ms returned sat
[2025-05-29 20:55:07] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 17 ms returned sat
[2025-05-29 20:55:09] [INFO ] [Nat]Absence check using state equation in 1274 ms returned sat
[2025-05-29 20:55:09] [INFO ] [Nat]Added 3604 Read/Feed constraints in 424 ms returned sat
[2025-05-29 20:55:10] [INFO ] Computed and/alt/rep : 2622/6957/2622 causal constraints (skipped 1044 transitions) in 331 ms.
[2025-05-29 20:55:10] [INFO ] Added : 7 causal constraints over 2 iterations in 1198 ms. Result :sat
Minimization took 4513 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[30]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[30]
Support contains 1 out of 1083 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1083/1083 places, 3696/3696 transitions.
Applied a total of 0 rules in 98 ms. Remains 1083 /1083 variables (removed 0) and now considering 3696/3696 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 98 ms. Remains : 1083/1083 places, 3696/3696 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1083/1083 places, 3696/3696 transitions.
Applied a total of 0 rules in 99 ms. Remains 1083 /1083 variables (removed 0) and now considering 3696/3696 (removed 0) transitions.
[2025-05-29 20:55:15] [INFO ] Invariant cache hit.
[2025-05-29 20:55:17] [INFO ] Implicit Places using invariants in 1912 ms returned []
[2025-05-29 20:55:17] [INFO ] Invariant cache hit.
[2025-05-29 20:55:19] [INFO ] State equation strengthened by 3604 read => feed constraints.
[2025-05-29 20:55:45] [INFO ] Implicit Places using invariants and state equation in 27389 ms returned []
Implicit Place search using SMT with State Equation took 29308 ms to find 0 implicit places.
[2025-05-29 20:55:45] [INFO ] Redundant transitions in 158 ms returned []
Running 3666 sub problems to find dead transitions.
[2025-05-29 20:55:45] [INFO ] Invariant cache hit.
[2025-05-29 20:55:45] [INFO ] State equation strengthened by 3604 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1082 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 3666 unsolved
SMT process timed out in 33628ms, After SMT, problems are : Problem set: 0 solved, 3666 unsolved
Search for dead transitions found 0 dead transitions in 33663ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63244 ms. Remains : 1083/1083 places, 3696/3696 transitions.
[2025-05-29 20:56:19] [INFO ] Flatten gal took : 407 ms
RANDOM walk for 40000 steps (279 resets) in 1942 ms. (20 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
[2025-05-29 20:56:19] [INFO ] Flatten gal took : 144 ms
[2025-05-29 20:56:19] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13572187684814704793.gal : 16 ms
BEST_FIRST walk for 40004 steps (8 resets) in 74 ms. (533 steps per ms) remains 2/2 properties
[2025-05-29 20:56:19] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10217336255720497958.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/ReachabilityCardinality13572187684814704793.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10217336255720497958.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/ReachabilityCardinality10217336255720497958.prop.
Interrupted probabilistic random walk after 158676 steps, run timeout after 3001 ms. (steps per millisecond=52 ) properties seen :0 out of 2
Probabilistic random walk after 158676 steps, saw 29887 distinct states, run finished after 3001 ms. (steps per millisecond=52 ) properties seen :0
[2025-05-29 20:56:22] [INFO ] Invariant cache hit.
[2025-05-29 20:56:22] [INFO ] State equation strengthened by 3604 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) 1020/1021 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-05-29 20:56:22] [INFO ] Deduced a trap composed of 2 places in 43 ms of which 1 ms to minimize.
Problem MAX0 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/1021 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1021 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 58/1079 variables, 29/31 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1079 variables, 0/31 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/1081 variables, 2/33 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2025-05-29 20:56:23] [INFO ] Deduced a trap composed of 51 places in 1077 ms of which 9 ms to minimize.
[2025-05-29 20:56:25] [INFO ] Deduced a trap composed of 38 places in 1023 ms of which 9 ms to minimize.
[2025-05-29 20:56:25] [INFO ] Deduced a trap composed of 37 places in 86 ms of which 1 ms to minimize.
[2025-05-29 20:56:25] [INFO ] Deduced a trap composed of 37 places in 84 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1081 variables, 4/37 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1081 variables, 0/37 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 3696/4777 variables, 1081/1118 constraints. Problems are: Problem set: 1 solved, 1 unsolved
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 963
At refinement iteration 10 (INCLUDED_ONLY) 0/4777 variables, 3604/4722 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/4777 variables, 0/4722 constraints. Problems are: Problem set: 1 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 2/4779 variables, 2/4724 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/4779 variables, 0/4724 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/4779 variables, 0/4724 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4779/4779 variables, and 4724 constraints, problems are : Problem set: 1 solved, 1 unsolved in 4778 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1083/1083 constraints, ReadFeed: 3604/3604 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1020/1021 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1021 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2025-05-29 20:56:27] [INFO ] Deduced a trap composed of 2 places in 52 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1021 variables, 1/3 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1021 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 58/1079 variables, 29/32 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1079 variables, 0/32 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/1081 variables, 2/34 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1081 variables, 4/38 constraints. Problems are: Problem set: 1 solved, 1 unsolved
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :963 after 1043
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :1043 after 1171
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :1171 after 1367
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :1367 after 1563
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :1563 after 1718
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :1718 after 1731
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :1731 after 1771
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :1771 after 1871
[2025-05-29 20:56:28] [INFO ] Deduced a trap composed of 40 places in 1086 ms of which 9 ms to minimize.
[2025-05-29 20:56:29] [INFO ] Deduced a trap composed of 39 places in 1034 ms of which 8 ms to minimize.
[2025-05-29 20:56:29] [INFO ] Deduced a trap composed of 34 places in 75 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/1081 variables, 3/41 constraints. Problems are: Problem set: 1 solved, 1 unsolved
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :1871 after 2123
At refinement iteration 10 (INCLUDED_ONLY) 0/1081 variables, 0/41 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 3696/4777 variables, 1081/1122 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/4777 variables, 3604/4726 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/4777 variables, 1/4727 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/4777 variables, 0/4727 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 2/4779 variables, 2/4729 constraints. Problems are: Problem set: 1 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 4779/4779 variables, and 4729 constraints, problems are : Problem set: 1 solved, 1 unsolved in 5016 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1083/1083 constraints, ReadFeed: 3604/3604 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 9/9 constraints]
After SMT, in 9841ms problems are : Problem set: 1 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 1083 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1083/1083 places, 3696/3696 transitions.
Applied a total of 0 rules in 97 ms. Remains 1083 /1083 variables (removed 0) and now considering 3696/3696 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 97 ms. Remains : 1083/1083 places, 3696/3696 transitions.
RANDOM walk for 40000 steps (287 resets) in 644 ms. (62 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 80 ms. (493 steps per ms) remains 1/1 properties
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :2123 after 2503
Interrupted probabilistic random walk after 182766 steps, run timeout after 3001 ms. (steps per millisecond=60 ) properties seen :0 out of 1
Probabilistic random walk after 182766 steps, saw 32620 distinct states, run finished after 3001 ms. (steps per millisecond=60 ) properties seen :0
[2025-05-29 20:56:35] [INFO ] Invariant cache hit.
[2025-05-29 20:56:35] [INFO ] State equation strengthened by 3604 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) 1020/1021 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-29 20:56:35] [INFO ] Deduced a trap composed of 2 places in 48 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1021 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1021 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 58/1079 variables, 29/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1079 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/1081 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-29 20:56:37] [INFO ] Deduced a trap composed of 35 places in 1136 ms of which 10 ms to minimize.
[2025-05-29 20:56:38] [INFO ] Deduced a trap composed of 35 places in 1195 ms of which 10 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1081 variables, 2/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1081 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 3696/4777 variables, 1081/1116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4777 variables, 3604/4720 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/4777 variables, 0/4720 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 2/4779 variables, 2/4722 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/4779 variables, 0/4722 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/4779 variables, 0/4722 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4779/4779 variables, and 4722 constraints, problems are : Problem set: 0 solved, 1 unsolved in 4840 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1083/1083 constraints, ReadFeed: 3604/3604 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 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) 1020/1021 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1021 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-29 20:56:40] [INFO ] Deduced a trap composed of 2 places in 49 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1021 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1021 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 58/1079 variables, 29/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1079 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/1081 variables, 2/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1081 variables, 2/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :2503 after 3061
[2025-05-29 20:56:42] [INFO ] Deduced a trap composed of 40 places in 1257 ms of which 10 ms to minimize.
[2025-05-29 20:56:43] [INFO ] Deduced a trap composed of 35 places in 1291 ms of which 9 ms to minimize.
[2025-05-29 20:56:44] [INFO ] Deduced a trap composed of 41 places in 1111 ms of which 10 ms to minimize.
[2025-05-29 20:56:45] [INFO ] Deduced a trap composed of 38 places in 1195 ms of which 8 ms to minimize.
[2025-05-29 20:56:46] [INFO ] Deduced a trap composed of 39 places in 1170 ms of which 9 ms to minimize.
[2025-05-29 20:56:48] [INFO ] Deduced a trap composed of 38 places in 1056 ms of which 9 ms to minimize.
[2025-05-29 20:56:49] [INFO ] Deduced a trap composed of 39 places in 1184 ms of which 9 ms to minimize.
[2025-05-29 20:56:50] [INFO ] Deduced a trap composed of 36 places in 1050 ms of which 8 ms to minimize.
[2025-05-29 20:56:51] [INFO ] Deduced a trap composed of 55 places in 1019 ms of which 9 ms to minimize.
[2025-05-29 20:56:52] [INFO ] Deduced a trap composed of 36 places in 953 ms of which 8 ms to minimize.
[2025-05-29 20:56:53] [INFO ] Deduced a trap composed of 35 places in 932 ms of which 8 ms to minimize.
[2025-05-29 20:56:54] [INFO ] Deduced a trap composed of 38 places in 878 ms of which 8 ms to minimize.
[2025-05-29 20:56:55] [INFO ] Deduced a trap composed of 37 places in 839 ms of which 8 ms to minimize.
[2025-05-29 20:56:55] [INFO ] Deduced a trap composed of 40 places in 803 ms of which 7 ms to minimize.
[2025-05-29 20:56:56] [INFO ] Deduced a trap composed of 36 places in 780 ms of which 7 ms to minimize.
[2025-05-29 20:56:57] [INFO ] Deduced a trap composed of 39 places in 915 ms of which 7 ms to minimize.
[2025-05-29 20:56:58] [INFO ] Deduced a trap composed of 35 places in 744 ms of which 7 ms to minimize.
[2025-05-29 20:56:59] [INFO ] Deduced a trap composed of 39 places in 692 ms of which 7 ms to minimize.
[2025-05-29 20:56:59] [INFO ] Deduced a trap composed of 53 places in 683 ms of which 6 ms to minimize.
[2025-05-29 20:57:00] [INFO ] Deduced a trap composed of 36 places in 661 ms of which 12 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/1081 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-29 20:57:01] [INFO ] Deduced a trap composed of 36 places in 625 ms of which 6 ms to minimize.
[2025-05-29 20:57:01] [INFO ] Deduced a trap composed of 37 places in 734 ms of which 5 ms to minimize.
[2025-05-29 20:57:02] [INFO ] Deduced a trap composed of 37 places in 599 ms of which 9 ms to minimize.
[2025-05-29 20:57:03] [INFO ] Deduced a trap composed of 36 places in 753 ms of which 9 ms to minimize.
[2025-05-29 20:57:03] [INFO ] Deduced a trap composed of 40 places in 524 ms of which 5 ms to minimize.
[2025-05-29 20:57:04] [INFO ] Deduced a trap composed of 35 places in 489 ms of which 6 ms to minimize.
[2025-05-29 20:57:04] [INFO ] Deduced a trap composed of 35 places in 476 ms of which 5 ms to minimize.
[2025-05-29 20:57:05] [INFO ] Deduced a trap composed of 41 places in 483 ms of which 5 ms to minimize.
[2025-05-29 20:57:05] [INFO ] Deduced a trap composed of 35 places in 478 ms of which 5 ms to minimize.
[2025-05-29 20:57:06] [INFO ] Deduced a trap composed of 41 places in 487 ms of which 5 ms to minimize.
[2025-05-29 20:57:06] [INFO ] Deduced a trap composed of 41 places in 480 ms of which 5 ms to minimize.
[2025-05-29 20:57:07] [INFO ] Deduced a trap composed of 36 places in 442 ms of which 5 ms to minimize.
[2025-05-29 20:57:07] [INFO ] Deduced a trap composed of 35 places in 452 ms of which 5 ms to minimize.
[2025-05-29 20:57:08] [INFO ] Deduced a trap composed of 37 places in 462 ms of which 8 ms to minimize.
[2025-05-29 20:57:08] [INFO ] Deduced a trap composed of 36 places in 555 ms of which 5 ms to minimize.
[2025-05-29 20:57:09] [INFO ] Deduced a trap composed of 37 places in 449 ms of which 5 ms to minimize.
Detected timeout of ITS tools.
[2025-05-29 20:57:09] [INFO ] Flatten gal took : 78 ms
[2025-05-29 20:57:09] [INFO ] Applying decomposition
[2025-05-29 20:57:09] [INFO ] Flatten gal took : 82 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/graph17085324395053157912.txt' '-o' '/tmp/graph17085324395053157912.bin' '-w' '/tmp/graph17085324395053157912.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17085324395053157912.bin' '-l' '-1' '-v' '-w' '/tmp/graph17085324395053157912.weights' '-q' '0' '-e' '0.001'
[2025-05-29 20:57:09] [INFO ] Decomposing Gal with order
[2025-05-29 20:57:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-29 20:57:09] [INFO ] Deduced a trap composed of 36 places in 438 ms of which 5 ms to minimize.
[2025-05-29 20:57:10] [INFO ] Removed a total of 2827 redundant transitions.
[2025-05-29 20:57:10] [INFO ] Flatten gal took : 255 ms
[2025-05-29 20:57:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 3398 labels/synchronizations in 110 ms.
[2025-05-29 20:57:10] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9415822918287807064.gal : 25 ms
[2025-05-29 20:57:10] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10777339930139643364.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/ReachabilityCardinality9415822918287807064.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10777339930139643364.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
[2025-05-29 20:57:10] [INFO ] Deduced a trap composed of 36 places in 559 ms of which 7 ms to minimize.
Loading property file /tmp/ReachabilityCardinality10777339930139643364.prop.
[2025-05-29 20:57:11] [INFO ] Deduced a trap composed of 35 places in 573 ms of which 7 ms to minimize.
[2025-05-29 20:57:11] [INFO ] Deduced a trap composed of 37 places in 516 ms of which 5 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/1081 variables, 20/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 1649
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :1649 after 1649
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :1649 after 1649
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :1649 after 1649
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :1649 after 1649
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :1649 after 1649
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :1649 after 1649
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :1649 after 1649
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :1649 after 1649
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :1649 after 1649
[2025-05-29 20:57:12] [INFO ] Deduced a trap composed of 40 places in 467 ms of which 5 ms to minimize.
[2025-05-29 20:57:12] [INFO ] Deduced a trap composed of 36 places in 423 ms of which 4 ms to minimize.
[2025-05-29 20:57:13] [INFO ] Deduced a trap composed of 35 places in 424 ms of which 5 ms to minimize.
[2025-05-29 20:57:13] [INFO ] Deduced a trap composed of 36 places in 401 ms of which 4 ms to minimize.
[2025-05-29 20:57:13] [INFO ] Deduced a trap composed of 36 places in 361 ms of which 4 ms to minimize.
[2025-05-29 20:57:14] [INFO ] Deduced a trap composed of 42 places in 328 ms of which 3 ms to minimize.
[2025-05-29 20:57:14] [INFO ] Deduced a trap composed of 37 places in 291 ms of which 3 ms to minimize.
[2025-05-29 20:57:14] [INFO ] Deduced a trap composed of 41 places in 352 ms of which 4 ms to minimize.
[2025-05-29 20:57:15] [INFO ] Deduced a trap composed of 36 places in 352 ms of which 4 ms to minimize.
[2025-05-29 20:57:15] [INFO ] Deduced a trap composed of 36 places in 356 ms of which 4 ms to minimize.
[2025-05-29 20:57:15] [INFO ] Deduced a trap composed of 38 places in 282 ms of which 3 ms to minimize.
[2025-05-29 20:57:16] [INFO ] Deduced a trap composed of 35 places in 194 ms of which 3 ms to minimize.
[2025-05-29 20:57:16] [INFO ] Deduced a trap composed of 35 places in 171 ms of which 3 ms to minimize.
[2025-05-29 20:57:16] [INFO ] Deduced a trap composed of 37 places in 236 ms of which 4 ms to minimize.
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :1649 after 250108
[2025-05-29 20:57:16] [INFO ] Deduced a trap composed of 40 places in 241 ms of which 3 ms to minimize.
[2025-05-29 20:57:17] [INFO ] Deduced a trap composed of 37 places in 206 ms of which 3 ms to minimize.
[2025-05-29 20:57:17] [INFO ] Deduced a trap composed of 37 places in 302 ms of which 5 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/1081 variables, 17/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1081 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 3696/4777 variables, 1081/1174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/4777 variables, 3604/4778 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/4777 variables, 1/4779 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/4777 variables, 0/4779 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/4779 variables, 2/4781 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/4779 variables, 0/4781 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/4779 variables, 0/4781 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4779/4779 variables, and 4781 constraints, problems are : Problem set: 0 solved, 1 unsolved in 40353 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1083/1083 constraints, ReadFeed: 3604/3604 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 61/61 constraints]
After SMT, in 45238ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 1083 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1083/1083 places, 3696/3696 transitions.
Applied a total of 0 rules in 104 ms. Remains 1083 /1083 variables (removed 0) and now considering 3696/3696 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 105 ms. Remains : 1083/1083 places, 3696/3696 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1083/1083 places, 3696/3696 transitions.
Applied a total of 0 rules in 94 ms. Remains 1083 /1083 variables (removed 0) and now considering 3696/3696 (removed 0) transitions.
[2025-05-29 20:57:21] [INFO ] Invariant cache hit.
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :250108 after 542235
[2025-05-29 20:57:22] [INFO ] Implicit Places using invariants in 1491 ms returned []
[2025-05-29 20:57:22] [INFO ] Invariant cache hit.
[2025-05-29 20:57:23] [INFO ] State equation strengthened by 3604 read => feed constraints.
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :542235 after 4.8091e+07
[2025-05-29 20:57:52] [INFO ] Implicit Places using invariants and state equation in 29715 ms returned []
Implicit Place search using SMT with State Equation took 31212 ms to find 0 implicit places.
[2025-05-29 20:57:52] [INFO ] Redundant transitions in 208 ms returned []
Running 3666 sub problems to find dead transitions.
[2025-05-29 20:57:52] [INFO ] Invariant cache hit.
[2025-05-29 20:57:52] [INFO ] State equation strengthened by 3604 read => feed constraints.
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :4.8091e+07 after 4.90697e+07
Detected timeout of ITS tools.
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/1082 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 3666 unsolved
SMT process timed out in 33024ms, After SMT, problems are : Problem set: 0 solved, 3666 unsolved
Search for dead transitions found 0 dead transitions in 33078ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64608 ms. Remains : 1083/1083 places, 3696/3696 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[1] Max Struct:[30]
Ending property specific reduction for CANInsertWithFailure-PT-030-UpperBounds-11 in 218315 ms.
Starting property specific reduction for CANInsertWithFailure-PT-030-UpperBounds-12
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:[30]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[30]
// Phase 1: matrix 3704 rows 1091 cols
[2025-05-29 20:58:25] [INFO ] Computed 32 invariants in 71 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[30]
RANDOM walk for 10000 steps (70 resets) in 144 ms. (68 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 22 ms. (434 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[30]
[2025-05-29 20:58:25] [INFO ] Invariant cache hit.
[2025-05-29 20:58:26] [INFO ] [Real]Absence check using 30 positive place invariants in 41 ms returned sat
[2025-05-29 20:58:26] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 18 ms returned sat
[2025-05-29 20:58:27] [INFO ] [Real]Absence check using state equation in 1257 ms returned sat
[2025-05-29 20:58:27] [INFO ] State equation strengthened by 3585 read => feed constraints.
[2025-05-29 20:58:27] [INFO ] [Real]Added 3585 Read/Feed constraints in 441 ms returned sat
[2025-05-29 20:58:28] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 20:58:28] [INFO ] [Nat]Absence check using 30 positive place invariants in 39 ms returned sat
[2025-05-29 20:58:28] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 18 ms returned sat
[2025-05-29 20:58:29] [INFO ] [Nat]Absence check using state equation in 1181 ms returned sat
[2025-05-29 20:58:30] [INFO ] [Nat]Added 3585 Read/Feed constraints in 605 ms returned sat
[2025-05-29 20:58:30] [INFO ] Computed and/alt/rep : 2632/6936/2632 causal constraints (skipped 1042 transitions) in 402 ms.
[2025-05-29 20:58:31] [INFO ] Added : 8 causal constraints over 2 iterations in 1215 ms. Result :sat
Minimization took 758 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[30]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[30]
Support contains 1 out of 1091 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1091/1091 places, 3704/3704 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 16 place count 1083 transition count 3696
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 19 place count 1083 transition count 3696
Applied a total of 19 rules in 389 ms. Remains 1083 /1091 variables (removed 8) and now considering 3696/3704 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 389 ms. Remains : 1083/1091 places, 3696/3704 transitions.
// Phase 1: matrix 3696 rows 1083 cols
[2025-05-29 20:58:32] [INFO ] Computed 32 invariants in 73 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[30]
RANDOM walk for 1000000 steps (7142 resets) in 9558 ms. (104 steps per ms)
BEST_FIRST walk for 1000001 steps (206 resets) in 1234 ms. (809 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[30]
[2025-05-29 20:58:43] [INFO ] Invariant cache hit.
[2025-05-29 20:58:43] [INFO ] [Real]Absence check using 30 positive place invariants in 22 ms returned sat
[2025-05-29 20:58:43] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 11 ms returned sat
[2025-05-29 20:58:44] [INFO ] [Real]Absence check using state equation in 1151 ms returned sat
[2025-05-29 20:58:45] [INFO ] State equation strengthened by 3604 read => feed constraints.
[2025-05-29 20:58:45] [INFO ] [Real]Added 3604 Read/Feed constraints in 541 ms returned sat
[2025-05-29 20:58:45] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 20:58:46] [INFO ] [Nat]Absence check using 30 positive place invariants in 38 ms returned sat
[2025-05-29 20:58:46] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 18 ms returned sat
[2025-05-29 20:58:47] [INFO ] [Nat]Absence check using state equation in 1235 ms returned sat
[2025-05-29 20:58:47] [INFO ] [Nat]Added 3604 Read/Feed constraints in 473 ms returned sat
[2025-05-29 20:58:48] [INFO ] Computed and/alt/rep : 2622/6957/2622 causal constraints (skipped 1044 transitions) in 268 ms.
[2025-05-29 20:58:49] [INFO ] Added : 10 causal constraints over 2 iterations in 1287 ms. Result :sat
Minimization took 4516 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[30]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[30]
Support contains 1 out of 1083 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1083/1083 places, 3696/3696 transitions.
Applied a total of 0 rules in 91 ms. Remains 1083 /1083 variables (removed 0) and now considering 3696/3696 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 92 ms. Remains : 1083/1083 places, 3696/3696 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1083/1083 places, 3696/3696 transitions.
Applied a total of 0 rules in 90 ms. Remains 1083 /1083 variables (removed 0) and now considering 3696/3696 (removed 0) transitions.
[2025-05-29 20:58:54] [INFO ] Invariant cache hit.
[2025-05-29 20:58:56] [INFO ] Implicit Places using invariants in 2143 ms returned []
[2025-05-29 20:58:56] [INFO ] Invariant cache hit.
[2025-05-29 20:58:57] [INFO ] State equation strengthened by 3604 read => feed constraints.
[2025-05-29 20:59:27] [INFO ] Performed 1073/1083 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2025-05-29 20:59:28] [INFO ] Implicit Places using invariants and state equation in 31880 ms returned []
Implicit Place search using SMT with State Equation took 34024 ms to find 0 implicit places.
[2025-05-29 20:59:28] [INFO ] Redundant transitions in 160 ms returned []
Running 3666 sub problems to find dead transitions.
[2025-05-29 20:59:28] [INFO ] Invariant cache hit.
[2025-05-29 20:59:28] [INFO ] State equation strengthened by 3604 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 1.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 1.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 1.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 1.0)
(s19 0.0)
(s20 1.0)
(s21 0.0)
(s22 0.0)
(s23 1.0)
(s24 1.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 1.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 1.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 1.0)
(s43 0.0)
(s44 1.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 1.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 1.0)
(s54 1.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 1.0)
(s61 0.0)
(s62 1.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 1.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 1.0)
(s73 0.0)
(s74 1.0)
(s75 0.0)
(s76 0.0)
(s77 1.0)
(s78 1.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 1.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 1.0)
(s91 0.0)
(s92 1.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 1.0)
(s97 0.0)
(s98 1.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 1.0)
(s103 0.0)
(s104 1.0)
(s105 0.0)
(s106 0.0)
(s107 1.0)
(s108 1.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 1.0)
(s115 0.0)
(s116 1.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 1.0)
(s121 0.0)
(s122 1.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 1.0)
(s127 0.0)
(s128 1.0)
(s129 0.0)
(s130 0.0)
(s131 1.0)
(s132 1.0)
(s133 0.0)
(s134 1.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 1.0)
(s139 0.0)
(s140 1.0)
(s141 0.0)
(s142 1.0)
(s143 1.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 1.0)
(s149 1.0)
(s150 0.0)
(s151 1.0)
(s152 0.0)
(s153 0.0)
(s154 1.0)
(s155 1.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 1.0)
(s161 1.0)
(s162 0.0)
(s163 0.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 0.0)
(s176 0.0)
(s177 0.0)
(s178 1.0)
(s179 0.0)
(s180 1.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1082 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 3666 unsolved
SMT process timed out in 32946ms, After SMT, problems are : Problem set: 0 solved, 3666 unsolved
Search for dead transitions found 0 dead transitions in 32981ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 67265 ms. Remains : 1083/1083 places, 3696/3696 transitions.
[2025-05-29 21:00:01] [INFO ] Flatten gal took : 263 ms
[2025-05-29 21:00:01] [INFO ] Flatten gal took : 169 ms
[2025-05-29 21:00:01] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality18432784512269835352.gal : 25 ms
[2025-05-29 21:00:01] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2653109695719233405.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/ReachabilityCardinality18432784512269835352.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2653109695719233405.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
RANDOM walk for 40000 steps (284 resets) in 1773 ms. (22 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 125 ms. (317 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 129 ms. (307 steps per ms) remains 2/2 properties
Loading property file /tmp/ReachabilityCardinality2653109695719233405.prop.
Interrupted probabilistic random walk after 128002 steps, run timeout after 3001 ms. (steps per millisecond=42 ) properties seen :0 out of 2
Probabilistic random walk after 128002 steps, saw 26374 distinct states, run finished after 3001 ms. (steps per millisecond=42 ) properties seen :0
[2025-05-29 21:00:04] [INFO ] Invariant cache hit.
[2025-05-29 21:00:04] [INFO ] State equation strengthened by 3604 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) 1020/1021 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-05-29 21:00:05] [INFO ] Deduced a trap composed of 2 places in 46 ms of which 2 ms to minimize.
Problem MAX0 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/1021 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1021 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 58/1079 variables, 29/31 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1079 variables, 0/31 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/1081 variables, 2/33 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2025-05-29 21:00:07] [INFO ] Deduced a trap composed of 47 places in 1734 ms of which 14 ms to minimize.
[2025-05-29 21:00:08] [INFO ] Deduced a trap composed of 41 places in 1280 ms of which 8 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1081 variables, 2/35 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1081 variables, 0/35 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 3696/4777 variables, 1081/1116 constraints. Problems are: Problem set: 1 solved, 1 unsolved
SMT process timed out in 5049ms, After SMT, problems are : Problem set: 1 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 1083 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1083/1083 places, 3696/3696 transitions.
Applied a total of 0 rules in 90 ms. Remains 1083 /1083 variables (removed 0) and now considering 3696/3696 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 90 ms. Remains : 1083/1083 places, 3696/3696 transitions.
SDD proceeding with computation,2 properties remain. new max is 4
RANDOM walk for 40000 steps (284 resets) in 543 ms. (73 steps per ms) remains 1/1 properties
SDD size :1 after 963
BEST_FIRST walk for 40003 steps (8 resets) in 59 ms. (666 steps per ms) remains 1/1 properties
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :963 after 1043
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :1043 after 1171
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :1171 after 1328
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :1328 after 1552
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :1552 after 1719
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :1719 after 1732
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :1732 after 1772
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :1772 after 1872
Interrupted probabilistic random walk after 183633 steps, run timeout after 3001 ms. (steps per millisecond=61 ) properties seen :0 out of 1
Probabilistic random walk after 183633 steps, saw 32716 distinct states, run finished after 3001 ms. (steps per millisecond=61 ) properties seen :0
[2025-05-29 21:00:13] [INFO ] Invariant cache hit.
[2025-05-29 21:00:13] [INFO ] State equation strengthened by 3604 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) 1020/1021 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-29 21:00:13] [INFO ] Deduced a trap composed of 2 places in 66 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1021 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1021 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 58/1079 variables, 29/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1079 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/1081 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :1872 after 2124
[2025-05-29 21:00:15] [INFO ] Deduced a trap composed of 59 places in 1498 ms of which 9 ms to minimize.
[2025-05-29 21:00:16] [INFO ] Deduced a trap composed of 62 places in 1458 ms of which 9 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :2124 after 2504
[2025-05-29 21:00:18] [INFO ] Deduced a trap composed of 43 places in 1390 ms of which 8 ms to minimize.
[2025-05-29 21:00:19] [INFO ] Deduced a trap composed of 44 places in 1389 ms of which 8 ms to minimize.
[2025-05-29 21:00:21] [INFO ] Deduced a trap composed of 43 places in 1440 ms of which 13 ms to minimize.
[2025-05-29 21:00:22] [INFO ] Deduced a trap composed of 44 places in 1284 ms of which 9 ms to minimize.
[2025-05-29 21:00:23] [INFO ] Deduced a trap composed of 44 places in 1158 ms of which 9 ms to minimize.
[2025-05-29 21:00:24] [INFO ] Deduced a trap composed of 45 places in 985 ms of which 9 ms to minimize.
[2025-05-29 21:00:25] [INFO ] Deduced a trap composed of 42 places in 1330 ms of which 13 ms to minimize.
[2025-05-29 21:00:27] [INFO ] Deduced a trap composed of 38 places in 1276 ms of which 13 ms to minimize.
[2025-05-29 21:00:28] [INFO ] Deduced a trap composed of 39 places in 1328 ms of which 13 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :2504 after 3061
[2025-05-29 21:00:29] [INFO ] Deduced a trap composed of 47 places in 1229 ms of which 9 ms to minimize.
[2025-05-29 21:00:31] [INFO ] Deduced a trap composed of 43 places in 1229 ms of which 9 ms to minimize.
[2025-05-29 21:00:32] [INFO ] Deduced a trap composed of 36 places in 1063 ms of which 9 ms to minimize.
[2025-05-29 21:00:33] [INFO ] Deduced a trap composed of 43 places in 1075 ms of which 9 ms to minimize.
[2025-05-29 21:00:34] [INFO ] Deduced a trap composed of 35 places in 1033 ms of which 9 ms to minimize.
[2025-05-29 21:00:35] [INFO ] Deduced a trap composed of 43 places in 987 ms of which 8 ms to minimize.
[2025-05-29 21:00:36] [INFO ] Deduced a trap composed of 41 places in 980 ms of which 8 ms to minimize.
[2025-05-29 21:00:37] [INFO ] Deduced a trap composed of 41 places in 992 ms of which 9 ms to minimize.
[2025-05-29 21:00:38] [INFO ] Deduced a trap composed of 40 places in 983 ms of which 9 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1081 variables, 20/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-29 21:00:39] [INFO ] Deduced a trap composed of 40 places in 997 ms of which 8 ms to minimize.
[2025-05-29 21:00:40] [INFO ] Deduced a trap composed of 35 places in 890 ms of which 8 ms to minimize.
[2025-05-29 21:00:41] [INFO ] Deduced a trap composed of 52 places in 883 ms of which 8 ms to minimize.
[2025-05-29 21:00:42] [INFO ] Deduced a trap composed of 49 places in 906 ms of which 8 ms to minimize.
[2025-05-29 21:00:42] [INFO ] Deduced a trap composed of 48 places in 818 ms of which 8 ms to minimize.
[2025-05-29 21:00:43] [INFO ] Deduced a trap composed of 35 places in 938 ms of which 11 ms to minimize.
[2025-05-29 21:00:44] [INFO ] Deduced a trap composed of 46 places in 823 ms of which 7 ms to minimize.
[2025-05-29 21:00:45] [INFO ] Deduced a trap composed of 44 places in 816 ms of which 7 ms to minimize.
[2025-05-29 21:00:46] [INFO ] Deduced a trap composed of 45 places in 780 ms of which 7 ms to minimize.
[2025-05-29 21:00:47] [INFO ] Deduced a trap composed of 46 places in 783 ms of which 7 ms to minimize.
[2025-05-29 21:00:47] [INFO ] Deduced a trap composed of 48 places in 759 ms of which 7 ms to minimize.
[2025-05-29 21:00:48] [INFO ] Deduced a trap composed of 50 places in 754 ms of which 7 ms to minimize.
[2025-05-29 21:00:49] [INFO ] Deduced a trap composed of 45 places in 702 ms of which 7 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1081 variables, 13/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/1081 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 3696/4777 variables, 1081/1147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/4777 variables, 3604/4751 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/4777 variables, 0/4751 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 2/4779 variables, 2/4753 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/4779 variables, 0/4753 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/4779 variables, 0/4753 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4779/4779 variables, and 4753 constraints, problems are : Problem set: 0 solved, 1 unsolved in 38327 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1083/1083 constraints, ReadFeed: 3604/3604 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 34/34 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) 1020/1021 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1021 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Detected timeout of ITS tools.
[2025-05-29 21:00:51] [INFO ] Deduced a trap composed of 2 places in 48 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1021 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-29 21:00:51] [INFO ] Flatten gal took : 84 ms
[2025-05-29 21:00:51] [INFO ] Applying decomposition
At refinement iteration 4 (INCLUDED_ONLY) 0/1021 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 58/1079 variables, 29/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1079 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/1081 variables, 2/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1081 variables, 33/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-29 21:00:51] [INFO ] Flatten gal took : 85 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/graph11250562972940729457.txt' '-o' '/tmp/graph11250562972940729457.bin' '-w' '/tmp/graph11250562972940729457.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph11250562972940729457.bin' '-l' '-1' '-v' '-w' '/tmp/graph11250562972940729457.weights' '-q' '0' '-e' '0.001'
[2025-05-29 21:00:52] [INFO ] Decomposing Gal with order
[2025-05-29 21:00:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-29 21:00:52] [INFO ] Removed a total of 2827 redundant transitions.
[2025-05-29 21:00:52] [INFO ] Flatten gal took : 232 ms
[2025-05-29 21:00:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 3398 labels/synchronizations in 160 ms.
[2025-05-29 21:00:52] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3731427842329026493.gal : 38 ms
[2025-05-29 21:00:52] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5845747477331636543.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/ReachabilityCardinality3731427842329026493.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5845747477331636543.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
[2025-05-29 21:00:53] [INFO ] Deduced a trap composed of 41 places in 1258 ms of which 13 ms to minimize.
Loading property file /tmp/ReachabilityCardinality5845747477331636543.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 114
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :114 after 114
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :114 after 114
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :114 after 114
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :114 after 114
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :114 after 114
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :114 after 114
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :114 after 114
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :114 after 114
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :114 after 114
[2025-05-29 21:00:54] [INFO ] Deduced a trap composed of 41 places in 1245 ms of which 9 ms to minimize.
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :114 after 6564
[2025-05-29 21:00:55] [INFO ] Deduced a trap composed of 38 places in 1145 ms of which 10 ms to minimize.
[2025-05-29 21:00:56] [INFO ] Deduced a trap composed of 43 places in 1130 ms of which 9 ms to minimize.
[2025-05-29 21:00:57] [INFO ] Deduced a trap composed of 34 places in 1046 ms of which 9 ms to minimize.
[2025-05-29 21:00:58] [INFO ] Deduced a trap composed of 40 places in 1009 ms of which 9 ms to minimize.
[2025-05-29 21:01:00] [INFO ] Deduced a trap composed of 41 places in 1027 ms of which 8 ms to minimize.
[2025-05-29 21:01:01] [INFO ] Deduced a trap composed of 42 places in 983 ms of which 8 ms to minimize.
[2025-05-29 21:01:02] [INFO ] Deduced a trap composed of 42 places in 995 ms of which 9 ms to minimize.
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :6564 after 623355
[2025-05-29 21:01:03] [INFO ] Deduced a trap composed of 42 places in 1028 ms of which 8 ms to minimize.
[2025-05-29 21:01:04] [INFO ] Deduced a trap composed of 39 places in 949 ms of which 8 ms to minimize.
[2025-05-29 21:01:04] [INFO ] Deduced a trap composed of 39 places in 852 ms of which 8 ms to minimize.
[2025-05-29 21:01:05] [INFO ] Deduced a trap composed of 41 places in 938 ms of which 8 ms to minimize.
[2025-05-29 21:01:06] [INFO ] Deduced a trap composed of 38 places in 945 ms of which 8 ms to minimize.
[2025-05-29 21:01:07] [INFO ] Deduced a trap composed of 38 places in 939 ms of which 8 ms to minimize.
[2025-05-29 21:01:08] [INFO ] Deduced a trap composed of 37 places in 930 ms of which 8 ms to minimize.
[2025-05-29 21:01:09] [INFO ] Deduced a trap composed of 42 places in 930 ms of which 9 ms to minimize.
[2025-05-29 21:01:10] [INFO ] Deduced a trap composed of 41 places in 938 ms of which 9 ms to minimize.
[2025-05-29 21:01:11] [INFO ] Deduced a trap composed of 37 places in 945 ms of which 9 ms to minimize.
[2025-05-29 21:01:12] [INFO ] Deduced a trap composed of 38 places in 1012 ms of which 8 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/1081 variables, 20/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-29 21:01:13] [INFO ] Deduced a trap composed of 40 places in 1057 ms of which 9 ms to minimize.
[2025-05-29 21:01:14] [INFO ] Deduced a trap composed of 39 places in 1058 ms of which 12 ms to minimize.
[2025-05-29 21:01:15] [INFO ] Deduced a trap composed of 41 places in 941 ms of which 9 ms to minimize.
[2025-05-29 21:01:16] [INFO ] Deduced a trap composed of 37 places in 1037 ms of which 8 ms to minimize.
[2025-05-29 21:01:17] [INFO ] Deduced a trap composed of 37 places in 928 ms of which 9 ms to minimize.
[2025-05-29 21:01:18] [INFO ] Deduced a trap composed of 36 places in 936 ms of which 9 ms to minimize.
[2025-05-29 21:01:19] [INFO ] Deduced a trap composed of 39 places in 931 ms of which 9 ms to minimize.
[2025-05-29 21:01:20] [INFO ] Deduced a trap composed of 38 places in 996 ms of which 8 ms to minimize.
[2025-05-29 21:01:21] [INFO ] Deduced a trap composed of 37 places in 1012 ms of which 9 ms to minimize.
[2025-05-29 21:01:22] [INFO ] Deduced a trap composed of 41 places in 952 ms of which 8 ms to minimize.
[2025-05-29 21:01:23] [INFO ] Deduced a trap composed of 50 places in 1031 ms of which 8 ms to minimize.
[2025-05-29 21:01:24] [INFO ] Deduced a trap composed of 45 places in 904 ms of which 8 ms to minimize.
[2025-05-29 21:01:25] [INFO ] Deduced a trap composed of 47 places in 964 ms of which 12 ms to minimize.
[2025-05-29 21:01:26] [INFO ] Deduced a trap composed of 43 places in 1103 ms of which 10 ms to minimize.
[2025-05-29 21:01:27] [INFO ] Deduced a trap composed of 44 places in 1010 ms of which 8 ms to minimize.
[2025-05-29 21:01:28] [INFO ] Deduced a trap composed of 46 places in 893 ms of which 8 ms to minimize.
[2025-05-29 21:01:29] [INFO ] Deduced a trap composed of 42 places in 1074 ms of which 8 ms to minimize.
[2025-05-29 21:01:30] [INFO ] Deduced a trap composed of 42 places in 969 ms of which 11 ms to minimize.
[2025-05-29 21:01:31] [INFO ] Deduced a trap composed of 46 places in 944 ms of which 11 ms to minimize.
[2025-05-29 21:01:32] [INFO ] Deduced a trap composed of 47 places in 980 ms of which 10 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/1081 variables, 20/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-29 21:01:33] [INFO ] Deduced a trap composed of 43 places in 944 ms of which 9 ms to minimize.
[2025-05-29 21:01:34] [INFO ] Deduced a trap composed of 35 places in 871 ms of which 8 ms to minimize.
[2025-05-29 21:01:35] [INFO ] Deduced a trap composed of 35 places in 904 ms of which 8 ms to minimize.
[2025-05-29 21:01:36] [INFO ] Deduced a trap composed of 44 places in 878 ms of which 7 ms to minimize.
[2025-05-29 21:01:37] [INFO ] Deduced a trap composed of 44 places in 875 ms of which 7 ms to minimize.
SMT process timed out in 84208ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 1083 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1083/1083 places, 3696/3696 transitions.
Applied a total of 0 rules in 95 ms. Remains 1083 /1083 variables (removed 0) and now considering 3696/3696 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 96 ms. Remains : 1083/1083 places, 3696/3696 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1083/1083 places, 3696/3696 transitions.
Applied a total of 0 rules in 95 ms. Remains 1083 /1083 variables (removed 0) and now considering 3696/3696 (removed 0) transitions.
[2025-05-29 21:01:37] [INFO ] Invariant cache hit.
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :623355 after 6.16237e+07
[2025-05-29 21:01:39] [INFO ] Implicit Places using invariants in 2016 ms returned []
[2025-05-29 21:01:39] [INFO ] Invariant cache hit.
[2025-05-29 21:01:40] [INFO ] State equation strengthened by 3604 read => feed constraints.
Detected timeout of ITS tools.
[2025-05-29 21:02:07] [INFO ] Implicit Places using invariants and state equation in 27609 ms returned []
Implicit Place search using SMT with State Equation took 29627 ms to find 0 implicit places.
[2025-05-29 21:02:07] [INFO ] Redundant transitions in 167 ms returned []
Running 3666 sub problems to find dead transitions.
[2025-05-29 21:02:07] [INFO ] Invariant cache hit.
[2025-05-29 21:02:07] [INFO ] State equation strengthened by 3604 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1082 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 3666 unsolved
SMT process timed out in 32955ms, After SMT, problems are : Problem set: 0 solved, 3666 unsolved
Search for dead transitions found 0 dead transitions in 32998ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62899 ms. Remains : 1083/1083 places, 3696/3696 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[1] Max Struct:[30]
Ending property specific reduction for CANInsertWithFailure-PT-030-UpperBounds-12 in 254840 ms.
Starting property specific reduction for CANInsertWithFailure-PT-030-UpperBounds-13
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:[30]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[30]
// Phase 1: matrix 3704 rows 1091 cols
[2025-05-29 21:02:40] [INFO ] Computed 32 invariants in 48 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[30]
RANDOM walk for 10000 steps (70 resets) in 144 ms. (68 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 22 ms. (434 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[30]
[2025-05-29 21:02:40] [INFO ] Invariant cache hit.
[2025-05-29 21:02:40] [INFO ] [Real]Absence check using 30 positive place invariants in 27 ms returned sat
[2025-05-29 21:02:40] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 11 ms returned sat
[2025-05-29 21:02:42] [INFO ] [Real]Absence check using state equation in 1258 ms returned sat
[2025-05-29 21:02:42] [INFO ] State equation strengthened by 3585 read => feed constraints.
[2025-05-29 21:02:42] [INFO ] [Real]Added 3585 Read/Feed constraints in 541 ms returned sat
[2025-05-29 21:02:43] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 21:02:43] [INFO ] [Nat]Absence check using 30 positive place invariants in 39 ms returned sat
[2025-05-29 21:02:43] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 17 ms returned sat
[2025-05-29 21:02:44] [INFO ] [Nat]Absence check using state equation in 1204 ms returned sat
[2025-05-29 21:02:45] [INFO ] [Nat]Added 3585 Read/Feed constraints in 485 ms returned sat
[2025-05-29 21:02:45] [INFO ] Computed and/alt/rep : 2632/6936/2632 causal constraints (skipped 1042 transitions) in 312 ms.
[2025-05-29 21:02:47] [INFO ] Added : 11 causal constraints over 3 iterations in 1892 ms. Result :sat
Minimization took 852 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[30]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[30]
Support contains 1 out of 1091 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1091/1091 places, 3704/3704 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 16 place count 1083 transition count 3696
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 19 place count 1083 transition count 3696
Applied a total of 19 rules in 236 ms. Remains 1083 /1091 variables (removed 8) and now considering 3696/3704 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 237 ms. Remains : 1083/1091 places, 3696/3704 transitions.
// Phase 1: matrix 3696 rows 1083 cols
[2025-05-29 21:02:48] [INFO ] Computed 32 invariants in 46 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[30]
RANDOM walk for 1000000 steps (7149 resets) in 9258 ms. (108 steps per ms)
BEST_FIRST walk for 1000001 steps (203 resets) in 1317 ms. (758 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[30]
[2025-05-29 21:02:58] [INFO ] Invariant cache hit.
[2025-05-29 21:02:58] [INFO ] [Real]Absence check using 30 positive place invariants in 20 ms returned sat
[2025-05-29 21:02:58] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 10 ms returned sat
[2025-05-29 21:02:59] [INFO ] [Real]Absence check using state equation in 927 ms returned sat
[2025-05-29 21:03:00] [INFO ] State equation strengthened by 3604 read => feed constraints.
[2025-05-29 21:03:00] [INFO ] [Real]Added 3604 Read/Feed constraints in 440 ms returned sat
[2025-05-29 21:03:00] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 21:03:00] [INFO ] [Nat]Absence check using 30 positive place invariants in 36 ms returned sat
[2025-05-29 21:03:00] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 29 ms returned sat
[2025-05-29 21:03:02] [INFO ] [Nat]Absence check using state equation in 1275 ms returned sat
[2025-05-29 21:03:02] [INFO ] [Nat]Added 3604 Read/Feed constraints in 432 ms returned sat
[2025-05-29 21:03:03] [INFO ] Computed and/alt/rep : 2622/6957/2622 causal constraints (skipped 1044 transitions) in 251 ms.
[2025-05-29 21:03:03] [INFO ] Added : 7 causal constraints over 2 iterations in 1036 ms. Result :sat
Minimization took 4514 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[30]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[30]
Support contains 1 out of 1083 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1083/1083 places, 3696/3696 transitions.
Applied a total of 0 rules in 118 ms. Remains 1083 /1083 variables (removed 0) and now considering 3696/3696 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 120 ms. Remains : 1083/1083 places, 3696/3696 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1083/1083 places, 3696/3696 transitions.
Applied a total of 0 rules in 147 ms. Remains 1083 /1083 variables (removed 0) and now considering 3696/3696 (removed 0) transitions.
[2025-05-29 21:03:08] [INFO ] Invariant cache hit.
[2025-05-29 21:03:11] [INFO ] Implicit Places using invariants in 2493 ms returned []
[2025-05-29 21:03:11] [INFO ] Invariant cache hit.
[2025-05-29 21:03:12] [INFO ] State equation strengthened by 3604 read => feed constraints.
[2025-05-29 21:03:39] [INFO ] Implicit Places using invariants and state equation in 28549 ms returned []
Implicit Place search using SMT with State Equation took 31043 ms to find 0 implicit places.
[2025-05-29 21:03:39] [INFO ] Redundant transitions in 160 ms returned []
Running 3666 sub problems to find dead transitions.
[2025-05-29 21:03:39] [INFO ] Invariant cache hit.
[2025-05-29 21:03:39] [INFO ] State equation strengthened by 3604 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1082 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 3666 unsolved
SMT process timed out in 32704ms, After SMT, problems are : Problem set: 0 solved, 3666 unsolved
Search for dead transitions found 0 dead transitions in 32741ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64102 ms. Remains : 1083/1083 places, 3696/3696 transitions.
[2025-05-29 21:04:12] [INFO ] Flatten gal took : 128 ms
[2025-05-29 21:04:13] [INFO ] Flatten gal took : 341 ms
[2025-05-29 21:04:13] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14383929992101567264.gal : 34 ms
[2025-05-29 21:04:13] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12427747195560249721.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/ReachabilityCardinality14383929992101567264.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12427747195560249721.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
RANDOM walk for 40000 steps (283 resets) in 1937 ms. (20 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 159 ms. (250 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 174 ms. (228 steps per ms) remains 2/2 properties
Loading property file /tmp/ReachabilityCardinality12427747195560249721.prop.
Interrupted probabilistic random walk after 155736 steps, run timeout after 3001 ms. (steps per millisecond=51 ) properties seen :0 out of 2
Probabilistic random walk after 155736 steps, saw 29604 distinct states, run finished after 3003 ms. (steps per millisecond=51 ) properties seen :0
[2025-05-29 21:04:16] [INFO ] Invariant cache hit.
[2025-05-29 21:04:16] [INFO ] State equation strengthened by 3604 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) 1020/1021 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-05-29 21:04:16] [INFO ] Deduced a trap composed of 2 places in 61 ms of which 1 ms to minimize.
Problem MAX0 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/1021 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1021 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 58/1079 variables, 29/31 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1079 variables, 0/31 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/1081 variables, 2/33 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2025-05-29 21:04:17] [INFO ] Deduced a trap composed of 52 places in 1082 ms of which 9 ms to minimize.
[2025-05-29 21:04:18] [INFO ] Deduced a trap composed of 37 places in 1026 ms of which 9 ms to minimize.
[2025-05-29 21:04:19] [INFO ] Deduced a trap composed of 40 places in 1036 ms of which 8 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 963
[2025-05-29 21:04:20] [INFO ] Deduced a trap composed of 36 places in 972 ms of which 9 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :963 after 1043
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :1043 after 1171
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :1171 after 1367
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :1367 after 1563
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :1563 after 1718
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :1718 after 1731
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :1731 after 1771
[2025-05-29 21:04:22] [INFO ] Deduced a trap composed of 35 places in 1291 ms of which 10 ms to minimize.
SMT process timed out in 5958ms, After SMT, problems are : Problem set: 1 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 1083 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1083/1083 places, 3696/3696 transitions.
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :1771 after 1871
Applied a total of 0 rules in 91 ms. Remains 1083 /1083 variables (removed 0) and now considering 3696/3696 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 91 ms. Remains : 1083/1083 places, 3696/3696 transitions.
RANDOM walk for 40000 steps (287 resets) in 609 ms. (65 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 75 ms. (526 steps per ms) remains 1/1 properties
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :1871 after 2123
Interrupted probabilistic random walk after 181109 steps, run timeout after 3001 ms. (steps per millisecond=60 ) properties seen :0 out of 1
Probabilistic random walk after 181109 steps, saw 32443 distinct states, run finished after 3001 ms. (steps per millisecond=60 ) properties seen :0
[2025-05-29 21:04:25] [INFO ] Invariant cache hit.
[2025-05-29 21:04:25] [INFO ] State equation strengthened by 3604 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) 1020/1021 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-29 21:04:25] [INFO ] Deduced a trap composed of 2 places in 70 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1021 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1021 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 58/1079 variables, 29/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1079 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/1081 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :2123 after 2503
[2025-05-29 21:04:27] [INFO ] Deduced a trap composed of 38 places in 1376 ms of which 10 ms to minimize.
[2025-05-29 21:04:28] [INFO ] Deduced a trap composed of 39 places in 1231 ms of which 10 ms to minimize.
[2025-05-29 21:04:29] [INFO ] Deduced a trap composed of 38 places in 1269 ms of which 10 ms to minimize.
[2025-05-29 21:04:31] [INFO ] Deduced a trap composed of 36 places in 1229 ms of which 10 ms to minimize.
[2025-05-29 21:04:32] [INFO ] Deduced a trap composed of 47 places in 1187 ms of which 9 ms to minimize.
[2025-05-29 21:04:33] [INFO ] Deduced a trap composed of 44 places in 1270 ms of which 9 ms to minimize.
[2025-05-29 21:04:34] [INFO ] Deduced a trap composed of 40 places in 1051 ms of which 9 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :2503 after 3061
[2025-05-29 21:04:35] [INFO ] Deduced a trap composed of 39 places in 1061 ms of which 9 ms to minimize.
[2025-05-29 21:04:37] [INFO ] Deduced a trap composed of 41 places in 1249 ms of which 10 ms to minimize.
[2025-05-29 21:04:38] [INFO ] Deduced a trap composed of 43 places in 1041 ms of which 9 ms to minimize.
[2025-05-29 21:04:39] [INFO ] Deduced a trap composed of 39 places in 1001 ms of which 8 ms to minimize.
[2025-05-29 21:04:40] [INFO ] Deduced a trap composed of 43 places in 928 ms of which 8 ms to minimize.
[2025-05-29 21:04:41] [INFO ] Deduced a trap composed of 43 places in 1063 ms of which 8 ms to minimize.
[2025-05-29 21:04:42] [INFO ] Deduced a trap composed of 41 places in 1050 ms of which 8 ms to minimize.
[2025-05-29 21:04:43] [INFO ] Deduced a trap composed of 42 places in 938 ms of which 8 ms to minimize.
[2025-05-29 21:04:44] [INFO ] Deduced a trap composed of 40 places in 1043 ms of which 8 ms to minimize.
[2025-05-29 21:04:45] [INFO ] Deduced a trap composed of 35 places in 875 ms of which 8 ms to minimize.
[2025-05-29 21:04:46] [INFO ] Deduced a trap composed of 37 places in 829 ms of which 8 ms to minimize.
[2025-05-29 21:04:46] [INFO ] Deduced a trap composed of 36 places in 832 ms of which 8 ms to minimize.
[2025-05-29 21:04:47] [INFO ] Deduced a trap composed of 35 places in 801 ms of which 8 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1081 variables, 20/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-29 21:04:48] [INFO ] Deduced a trap composed of 46 places in 766 ms of which 7 ms to minimize.
[2025-05-29 21:04:49] [INFO ] Deduced a trap composed of 35 places in 707 ms of which 6 ms to minimize.
[2025-05-29 21:04:49] [INFO ] Deduced a trap composed of 35 places in 663 ms of which 6 ms to minimize.
[2025-05-29 21:04:50] [INFO ] Deduced a trap composed of 41 places in 633 ms of which 6 ms to minimize.
[2025-05-29 21:04:51] [INFO ] Deduced a trap composed of 40 places in 634 ms of which 6 ms to minimize.
[2025-05-29 21:04:51] [INFO ] Deduced a trap composed of 44 places in 595 ms of which 6 ms to minimize.
[2025-05-29 21:04:52] [INFO ] Deduced a trap composed of 45 places in 594 ms of which 6 ms to minimize.
[2025-05-29 21:04:53] [INFO ] Deduced a trap composed of 42 places in 585 ms of which 6 ms to minimize.
[2025-05-29 21:04:53] [INFO ] Deduced a trap composed of 43 places in 591 ms of which 6 ms to minimize.
[2025-05-29 21:04:54] [INFO ] Deduced a trap composed of 43 places in 589 ms of which 6 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1081 variables, 10/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/1081 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 3696/4777 variables, 1081/1144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/4777 variables, 3604/4748 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/4777 variables, 0/4748 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 2/4779 variables, 2/4750 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/4779 variables, 0/4750 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/4779 variables, 0/4750 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4779/4779 variables, and 4750 constraints, problems are : Problem set: 0 solved, 1 unsolved in 30863 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1083/1083 constraints, ReadFeed: 3604/3604 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 31/31 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) 1020/1021 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1021 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-29 21:04:56] [INFO ] Deduced a trap composed of 2 places in 46 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1021 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1021 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 58/1079 variables, 29/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1079 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/1081 variables, 2/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1081 variables, 30/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-29 21:04:57] [INFO ] Deduced a trap composed of 38 places in 1185 ms of which 9 ms to minimize.
[2025-05-29 21:04:59] [INFO ] Deduced a trap composed of 37 places in 1273 ms of which 10 ms to minimize.
[2025-05-29 21:04:59] [INFO ] Deduced a trap composed of 35 places in 79 ms of which 3 ms to minimize.
[2025-05-29 21:04:59] [INFO ] Deduced a trap composed of 34 places in 84 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/1081 variables, 4/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1081 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 3696/4777 variables, 1081/1149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/4777 variables, 3604/4753 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/4777 variables, 1/4754 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/4777 variables, 0/4754 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 2/4779 variables, 2/4756 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/4779 variables, 0/4756 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Detected timeout of ITS tools.
At refinement iteration 17 (OVERLAPS) 0/4779 variables, 0/4756 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
[2025-05-29 21:05:03] [INFO ] Flatten gal took : 79 ms
[2025-05-29 21:05:03] [INFO ] Applying decomposition
[2025-05-29 21:05:03] [INFO ] Flatten gal took : 78 ms
After SMT solving in domain Int declared 4779/4779 variables, and 4756 constraints, problems are : Problem set: 0 solved, 1 unsolved in 6957 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1083/1083 constraints, ReadFeed: 3604/3604 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 36/36 constraints]
After SMT, in 37879ms problems are : Problem set: 0 solved, 1 unsolved
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/graph12537891614431607422.txt' '-o' '/tmp/graph12537891614431607422.bin' '-w' '/tmp/graph12537891614431607422.weights'
Parikh walk visited 0 properties in 153 ms.
Support contains 1 out of 1083 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1083/1083 places, 3696/3696 transitions.
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12537891614431607422.bin' '-l' '-1' '-v' '-w' '/tmp/graph12537891614431607422.weights' '-q' '0' '-e' '0.001'
[2025-05-29 21:05:03] [INFO ] Decomposing Gal with order
[2025-05-29 21:05:03] [INFO ] Rewriting arrays to variables to allow decomposition.
Applied a total of 0 rules in 92 ms. Remains 1083 /1083 variables (removed 0) and now considering 3696/3696 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 92 ms. Remains : 1083/1083 places, 3696/3696 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1083/1083 places, 3696/3696 transitions.
Applied a total of 0 rules in 93 ms. Remains 1083 /1083 variables (removed 0) and now considering 3696/3696 (removed 0) transitions.
[2025-05-29 21:05:03] [INFO ] Invariant cache hit.
[2025-05-29 21:05:03] [INFO ] Removed a total of 2827 redundant transitions.
[2025-05-29 21:05:03] [INFO ] Flatten gal took : 217 ms
[2025-05-29 21:05:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 3398 labels/synchronizations in 163 ms.
[2025-05-29 21:05:04] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13794847447526327859.gal : 37 ms
[2025-05-29 21:05:04] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16796367422263684752.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/ReachabilityCardinality13794847447526327859.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16796367422263684752.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/ReachabilityCardinality16796367422263684752.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 1649
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :1649 after 1649
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :1649 after 1649
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :1649 after 1649
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :1649 after 1649
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :1649 after 1649
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :1649 after 1649
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :1649 after 1674
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :1674 after 1689
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :1689 after 1703
[2025-05-29 21:05:05] [INFO ] Implicit Places using invariants in 2065 ms returned []
[2025-05-29 21:05:05] [INFO ] Invariant cache hit.
[2025-05-29 21:05:07] [INFO ] State equation strengthened by 3604 read => feed constraints.
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :1703 after 6085
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :6085 after 472074
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :472074 after 4.04029e+07
[2025-05-29 21:05:34] [INFO ] Implicit Places using invariants and state equation in 28722 ms returned []
Implicit Place search using SMT with State Equation took 30801 ms to find 0 implicit places.
[2025-05-29 21:05:34] [INFO ] Redundant transitions in 158 ms returned []
Running 3666 sub problems to find dead transitions.
[2025-05-29 21:05:34] [INFO ] Invariant cache hit.
[2025-05-29 21:05:34] [INFO ] State equation strengthened by 3604 read => feed constraints.
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :4.04029e+07 after 5.05411e+07
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/1082 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 3666 unsolved
SMT process timed out in 32880ms, After SMT, problems are : Problem set: 0 solved, 3666 unsolved
Search for dead transitions found 0 dead transitions in 32916ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63984 ms. Remains : 1083/1083 places, 3696/3696 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[1] Max Struct:[30]
Ending property specific reduction for CANInsertWithFailure-PT-030-UpperBounds-13 in 207190 ms.
Starting property specific reduction for CANInsertWithFailure-PT-030-UpperBounds-14
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:[30]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[30]
// Phase 1: matrix 3704 rows 1091 cols
[2025-05-29 21:06:07] [INFO ] Computed 32 invariants in 71 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[30]
RANDOM walk for 10000 steps (71 resets) in 144 ms. (68 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 22 ms. (434 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[30]
[2025-05-29 21:06:07] [INFO ] Invariant cache hit.
[2025-05-29 21:06:08] [INFO ] [Real]Absence check using 30 positive place invariants in 39 ms returned sat
[2025-05-29 21:06:08] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 17 ms returned sat
[2025-05-29 21:06:09] [INFO ] [Real]Absence check using state equation in 1219 ms returned sat
[2025-05-29 21:06:09] [INFO ] State equation strengthened by 3585 read => feed constraints.
[2025-05-29 21:06:09] [INFO ] [Real]Added 3585 Read/Feed constraints in 462 ms returned sat
[2025-05-29 21:06:10] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 21:06:10] [INFO ] [Nat]Absence check using 30 positive place invariants in 39 ms returned sat
[2025-05-29 21:06:10] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 17 ms returned sat
[2025-05-29 21:06:11] [INFO ] [Nat]Absence check using state equation in 1114 ms returned sat
[2025-05-29 21:06:12] [INFO ] [Nat]Added 3585 Read/Feed constraints in 588 ms returned sat
[2025-05-29 21:06:12] [INFO ] Computed and/alt/rep : 2632/6936/2632 causal constraints (skipped 1042 transitions) in 253 ms.
[2025-05-29 21:06:13] [INFO ] Added : 6 causal constraints over 2 iterations in 1063 ms. Result :sat
Minimization took 746 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[30]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[30]
Support contains 1 out of 1091 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1091/1091 places, 3704/3704 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 0 with 18 rules applied. Total rules applied 18 place count 1082 transition count 3695
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 1082 transition count 3695
Applied a total of 20 rules in 223 ms. Remains 1082 /1091 variables (removed 9) and now considering 3695/3704 (removed 9) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 224 ms. Remains : 1082/1091 places, 3695/3704 transitions.
// Phase 1: matrix 3695 rows 1082 cols
[2025-05-29 21:06:14] [INFO ] Computed 32 invariants in 48 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[30]
RANDOM walk for 1000000 steps (7143 resets) in 9832 ms. (101 steps per ms)
BEST_FIRST walk for 1000001 steps (205 resets) in 1268 ms. (788 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[30]
[2025-05-29 21:06:25] [INFO ] Invariant cache hit.
[2025-05-29 21:06:25] [INFO ] [Real]Absence check using 30 positive place invariants in 24 ms returned sat
[2025-05-29 21:06:25] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 11 ms returned sat
[2025-05-29 21:06:26] [INFO ] [Real]Absence check using state equation in 953 ms returned sat
[2025-05-29 21:06:26] [INFO ] State equation strengthened by 3605 read => feed constraints.
[2025-05-29 21:06:27] [INFO ] [Real]Added 3605 Read/Feed constraints in 456 ms returned sat
[2025-05-29 21:06:27] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 21:06:27] [INFO ] [Nat]Absence check using 30 positive place invariants in 23 ms returned sat
[2025-05-29 21:06:27] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 11 ms returned sat
[2025-05-29 21:06:28] [INFO ] [Nat]Absence check using state equation in 966 ms returned sat
[2025-05-29 21:06:29] [INFO ] [Nat]Added 3605 Read/Feed constraints in 529 ms returned sat
[2025-05-29 21:06:29] [INFO ] Computed and/alt/rep : 2621/6959/2621 causal constraints (skipped 1044 transitions) in 268 ms.
[2025-05-29 21:06:30] [INFO ] Added : 8 causal constraints over 2 iterations in 1303 ms. Result :sat
Minimization took 4508 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[30]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[30]
Support contains 1 out of 1082 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1082/1082 places, 3695/3695 transitions.
Applied a total of 0 rules in 88 ms. Remains 1082 /1082 variables (removed 0) and now considering 3695/3695 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 88 ms. Remains : 1082/1082 places, 3695/3695 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1082/1082 places, 3695/3695 transitions.
Applied a total of 0 rules in 87 ms. Remains 1082 /1082 variables (removed 0) and now considering 3695/3695 (removed 0) transitions.
[2025-05-29 21:06:35] [INFO ] Invariant cache hit.
[2025-05-29 21:06:37] [INFO ] Implicit Places using invariants in 2073 ms returned []
[2025-05-29 21:06:37] [INFO ] Invariant cache hit.
[2025-05-29 21:06:38] [INFO ] State equation strengthened by 3605 read => feed constraints.
[2025-05-29 21:07:06] [INFO ] Implicit Places using invariants and state equation in 29635 ms returned []
Implicit Place search using SMT with State Equation took 31710 ms to find 0 implicit places.
[2025-05-29 21:07:06] [INFO ] Redundant transitions in 160 ms returned []
Running 3665 sub problems to find dead transitions.
[2025-05-29 21:07:07] [INFO ] Invariant cache hit.
[2025-05-29 21:07:07] [INFO ] State equation strengthened by 3605 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1081 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 3665 unsolved
SMT process timed out in 32951ms, After SMT, problems are : Problem set: 0 solved, 3665 unsolved
Search for dead transitions found 0 dead transitions in 32987ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64951 ms. Remains : 1082/1082 places, 3695/3695 transitions.
[2025-05-29 21:07:40] [INFO ] Flatten gal took : 150 ms
[2025-05-29 21:07:40] [INFO ] Flatten gal took : 192 ms
[2025-05-29 21:07:40] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14223416860702259877.gal : 33 ms
[2025-05-29 21:07:40] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17798053125325222295.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/ReachabilityCardinality14223416860702259877.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17798053125325222295.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
RANDOM walk for 40000 steps (283 resets) in 1915 ms. (20 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 129 ms. (307 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 166 ms. (239 steps per ms) remains 2/2 properties
Loading property file /tmp/ReachabilityCardinality17798053125325222295.prop.
Interrupted probabilistic random walk after 131042 steps, run timeout after 3001 ms. (steps per millisecond=43 ) properties seen :0 out of 2
Probabilistic random walk after 131042 steps, saw 26732 distinct states, run finished after 3001 ms. (steps per millisecond=43 ) properties seen :0
[2025-05-29 21:07:43] [INFO ] Invariant cache hit.
[2025-05-29 21:07:43] [INFO ] State equation strengthened by 3605 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) 1019/1020 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-05-29 21:07:43] [INFO ] Deduced a trap composed of 2 places in 61 ms of which 2 ms to minimize.
Problem MAX0 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/1020 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1020 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 58/1078 variables, 29/31 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1078 variables, 0/31 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/1080 variables, 2/33 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2025-05-29 21:07:45] [INFO ] Deduced a trap composed of 37 places in 1396 ms of which 10 ms to minimize.
[2025-05-29 21:07:46] [INFO ] Deduced a trap composed of 38 places in 1118 ms of which 9 ms to minimize.
[2025-05-29 21:07:47] [INFO ] Deduced a trap composed of 38 places in 1114 ms of which 9 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 963
[2025-05-29 21:07:48] [INFO ] Deduced a trap composed of 46 places in 1109 ms of which 9 ms to minimize.
SMT process timed out in 5242ms, After SMT, problems are : Problem set: 1 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 1082 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1082/1082 places, 3695/3695 transitions.
Applied a total of 0 rules in 90 ms. Remains 1082 /1082 variables (removed 0) and now considering 3695/3695 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 91 ms. Remains : 1082/1082 places, 3695/3695 transitions.
RANDOM walk for 40000 steps (283 resets) in 500 ms. (79 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 74 ms. (533 steps per ms) remains 1/1 properties
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :963 after 1043
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :1043 after 1171
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :1171 after 1367
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :1367 after 1563
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :1563 after 1718
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :1718 after 1731
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :1731 after 1771
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :1771 after 1871
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :1871 after 2123
Interrupted probabilistic random walk after 173013 steps, run timeout after 3001 ms. (steps per millisecond=57 ) properties seen :0 out of 1
Probabilistic random walk after 173013 steps, saw 31512 distinct states, run finished after 3001 ms. (steps per millisecond=57 ) properties seen :0
[2025-05-29 21:07:52] [INFO ] Invariant cache hit.
[2025-05-29 21:07:52] [INFO ] State equation strengthened by 3605 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) 1019/1020 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-29 21:07:52] [INFO ] Deduced a trap composed of 2 places in 46 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1020 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1020 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 58/1078 variables, 29/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1078 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/1080 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-29 21:07:53] [INFO ] Deduced a trap composed of 38 places in 1191 ms of which 10 ms to minimize.
[2025-05-29 21:07:55] [INFO ] Deduced a trap composed of 37 places in 1180 ms of which 9 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1080 variables, 2/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1080 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :2123 after 2503
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 3695/4775 variables, 1080/1115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4775 variables, 3605/4720 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/4775 variables, 0/4720 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 2/4777 variables, 2/4722 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/4777 variables, 0/4722 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/4777 variables, 0/4722 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4777/4777 variables, and 4722 constraints, problems are : Problem set: 0 solved, 1 unsolved in 4713 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1082/1082 constraints, ReadFeed: 3605/3605 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 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) 1019/1020 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1020 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-29 21:07:57] [INFO ] Deduced a trap composed of 2 places in 49 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1020 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1020 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 58/1078 variables, 29/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1078 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/1080 variables, 2/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1080 variables, 2/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-29 21:07:58] [INFO ] Deduced a trap composed of 41 places in 1217 ms of which 10 ms to minimize.
[2025-05-29 21:07:59] [INFO ] Deduced a trap composed of 43 places in 1145 ms of which 10 ms to minimize.
[2025-05-29 21:08:00] [INFO ] Deduced a trap composed of 40 places in 1162 ms of which 10 ms to minimize.
[2025-05-29 21:08:02] [INFO ] Deduced a trap composed of 46 places in 1149 ms of which 9 ms to minimize.
[2025-05-29 21:08:03] [INFO ] Deduced a trap composed of 38 places in 1151 ms of which 10 ms to minimize.
[2025-05-29 21:08:04] [INFO ] Deduced a trap composed of 52 places in 1124 ms of which 9 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :2503 after 3060
[2025-05-29 21:08:05] [INFO ] Deduced a trap composed of 43 places in 1077 ms of which 10 ms to minimize.
[2025-05-29 21:08:06] [INFO ] Deduced a trap composed of 46 places in 1073 ms of which 9 ms to minimize.
[2025-05-29 21:08:07] [INFO ] Deduced a trap composed of 44 places in 1069 ms of which 9 ms to minimize.
[2025-05-29 21:08:08] [INFO ] Deduced a trap composed of 44 places in 1050 ms of which 9 ms to minimize.
[2025-05-29 21:08:09] [INFO ] Deduced a trap composed of 43 places in 940 ms of which 8 ms to minimize.
[2025-05-29 21:08:10] [INFO ] Deduced a trap composed of 47 places in 983 ms of which 8 ms to minimize.
[2025-05-29 21:08:11] [INFO ] Deduced a trap composed of 41 places in 902 ms of which 8 ms to minimize.
[2025-05-29 21:08:12] [INFO ] Deduced a trap composed of 41 places in 894 ms of which 9 ms to minimize.
[2025-05-29 21:08:13] [INFO ] Deduced a trap composed of 43 places in 904 ms of which 8 ms to minimize.
[2025-05-29 21:08:14] [INFO ] Deduced a trap composed of 43 places in 898 ms of which 8 ms to minimize.
[2025-05-29 21:08:15] [INFO ] Deduced a trap composed of 44 places in 833 ms of which 8 ms to minimize.
[2025-05-29 21:08:16] [INFO ] Deduced a trap composed of 43 places in 833 ms of which 7 ms to minimize.
[2025-05-29 21:08:16] [INFO ] Deduced a trap composed of 44 places in 838 ms of which 7 ms to minimize.
[2025-05-29 21:08:17] [INFO ] Deduced a trap composed of 44 places in 824 ms of which 7 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/1080 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-29 21:08:18] [INFO ] Deduced a trap composed of 44 places in 816 ms of which 8 ms to minimize.
[2025-05-29 21:08:19] [INFO ] Deduced a trap composed of 38 places in 778 ms of which 7 ms to minimize.
[2025-05-29 21:08:20] [INFO ] Deduced a trap composed of 42 places in 765 ms of which 7 ms to minimize.
[2025-05-29 21:08:20] [INFO ] Deduced a trap composed of 43 places in 768 ms of which 7 ms to minimize.
[2025-05-29 21:08:21] [INFO ] Deduced a trap composed of 40 places in 728 ms of which 7 ms to minimize.
[2025-05-29 21:08:22] [INFO ] Deduced a trap composed of 39 places in 731 ms of which 7 ms to minimize.
[2025-05-29 21:08:23] [INFO ] Deduced a trap composed of 38 places in 733 ms of which 7 ms to minimize.
[2025-05-29 21:08:23] [INFO ] Deduced a trap composed of 38 places in 731 ms of which 7 ms to minimize.
[2025-05-29 21:08:24] [INFO ] Deduced a trap composed of 38 places in 729 ms of which 6 ms to minimize.
[2025-05-29 21:08:25] [INFO ] Deduced a trap composed of 43 places in 724 ms of which 7 ms to minimize.
[2025-05-29 21:08:26] [INFO ] Deduced a trap composed of 38 places in 735 ms of which 7 ms to minimize.
[2025-05-29 21:08:26] [INFO ] Deduced a trap composed of 37 places in 726 ms of which 7 ms to minimize.
[2025-05-29 21:08:27] [INFO ] Deduced a trap composed of 37 places in 689 ms of which 7 ms to minimize.
[2025-05-29 21:08:28] [INFO ] Deduced a trap composed of 37 places in 696 ms of which 6 ms to minimize.
[2025-05-29 21:08:29] [INFO ] Deduced a trap composed of 40 places in 683 ms of which 6 ms to minimize.
[2025-05-29 21:08:29] [INFO ] Deduced a trap composed of 41 places in 681 ms of which 6 ms to minimize.
Detected timeout of ITS tools.
[2025-05-29 21:08:30] [INFO ] Flatten gal took : 72 ms
[2025-05-29 21:08:30] [INFO ] Applying decomposition
[2025-05-29 21:08:30] [INFO ] Deduced a trap composed of 43 places in 716 ms of which 7 ms to minimize.
[2025-05-29 21:08:30] [INFO ] Flatten gal took : 75 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/graph954480120061501763.txt' '-o' '/tmp/graph954480120061501763.bin' '-w' '/tmp/graph954480120061501763.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph954480120061501763.bin' '-l' '-1' '-v' '-w' '/tmp/graph954480120061501763.weights' '-q' '0' '-e' '0.001'
[2025-05-29 21:08:30] [INFO ] Decomposing Gal with order
[2025-05-29 21:08:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-29 21:08:31] [INFO ] Removed a total of 2826 redundant transitions.
[2025-05-29 21:08:31] [INFO ] Flatten gal took : 311 ms
[2025-05-29 21:08:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 3394 labels/synchronizations in 155 ms.
[2025-05-29 21:08:31] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5723702378526040143.gal : 35 ms
[2025-05-29 21:08:31] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7980166029560001366.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/ReachabilityCardinality5723702378526040143.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7980166029560001366.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
[2025-05-29 21:08:31] [INFO ] Deduced a trap composed of 42 places in 868 ms of which 10 ms to minimize.
Loading property file /tmp/ReachabilityCardinality7980166029560001366.prop.
[2025-05-29 21:08:32] [INFO ] Deduced a trap composed of 39 places in 873 ms of which 8 ms to minimize.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 2130
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :2130 after 2130
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :2130 after 2130
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :2130 after 2130
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :2130 after 2130
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :2130 after 2130
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :2130 after 2130
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :2130 after 2130
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :2130 after 2130
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :2130 after 2130
[2025-05-29 21:08:33] [INFO ] Deduced a trap composed of 42 places in 736 ms of which 7 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/1080 variables, 20/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :2130 after 2573
[2025-05-29 21:08:33] [INFO ] Deduced a trap composed of 40 places in 728 ms of which 7 ms to minimize.
[2025-05-29 21:08:34] [INFO ] Deduced a trap composed of 35 places in 808 ms of which 7 ms to minimize.
[2025-05-29 21:08:35] [INFO ] Deduced a trap composed of 46 places in 700 ms of which 7 ms to minimize.
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :2573 after 631817
[2025-05-29 21:08:36] [INFO ] Deduced a trap composed of 55 places in 837 ms of which 8 ms to minimize.
[2025-05-29 21:08:37] [INFO ] Deduced a trap composed of 44 places in 707 ms of which 6 ms to minimize.
[2025-05-29 21:08:37] [INFO ] Deduced a trap composed of 41 places in 640 ms of which 6 ms to minimize.
[2025-05-29 21:08:38] [INFO ] Deduced a trap composed of 41 places in 628 ms of which 6 ms to minimize.
[2025-05-29 21:08:39] [INFO ] Deduced a trap composed of 44 places in 615 ms of which 6 ms to minimize.
[2025-05-29 21:08:39] [INFO ] Deduced a trap composed of 47 places in 601 ms of which 6 ms to minimize.
[2025-05-29 21:08:40] [INFO ] Deduced a trap composed of 46 places in 611 ms of which 12 ms to minimize.
[2025-05-29 21:08:40] [INFO ] Deduced a trap composed of 44 places in 596 ms of which 6 ms to minimize.
[2025-05-29 21:08:41] [INFO ] Deduced a trap composed of 44 places in 609 ms of which 6 ms to minimize.
[2025-05-29 21:08:42] [INFO ] Deduced a trap composed of 43 places in 593 ms of which 6 ms to minimize.
SMT process timed out in 49967ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 1082 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1082/1082 places, 3695/3695 transitions.
Applied a total of 0 rules in 132 ms. Remains 1082 /1082 variables (removed 0) and now considering 3695/3695 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 133 ms. Remains : 1082/1082 places, 3695/3695 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1082/1082 places, 3695/3695 transitions.
Applied a total of 0 rules in 94 ms. Remains 1082 /1082 variables (removed 0) and now considering 3695/3695 (removed 0) transitions.
[2025-05-29 21:08:42] [INFO ] Invariant cache hit.
[2025-05-29 21:08:44] [INFO ] Implicit Places using invariants in 1806 ms returned []
[2025-05-29 21:08:44] [INFO ] Invariant cache hit.
[2025-05-29 21:08:45] [INFO ] State equation strengthened by 3605 read => feed constraints.
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :631817 after 4.93828e+07
[2025-05-29 21:09:15] [INFO ] Performed 1073/1082 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2025-05-29 21:09:16] [INFO ] Implicit Places using invariants and state equation in 31948 ms returned []
Implicit Place search using SMT with State Equation took 33755 ms to find 0 implicit places.
[2025-05-29 21:09:16] [INFO ] Redundant transitions in 161 ms returned []
Running 3665 sub problems to find dead transitions.
[2025-05-29 21:09:16] [INFO ] Invariant cache hit.
[2025-05-29 21:09:16] [INFO ] State equation strengthened by 3605 read => feed constraints.
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :4.93828e+07 after 6.05111e+07
Detected timeout of ITS tools.
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/1081 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 3665 unsolved
SMT process timed out in 32714ms, After SMT, problems are : Problem set: 0 solved, 3665 unsolved
Search for dead transitions found 0 dead transitions in 32751ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66781 ms. Remains : 1082/1082 places, 3695/3695 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[1] Max Struct:[30]
Ending property specific reduction for CANInsertWithFailure-PT-030-UpperBounds-14 in 221438 ms.
Starting property specific reduction for CANInsertWithFailure-PT-030-UpperBounds-15
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:[30]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[30]
// Phase 1: matrix 3704 rows 1091 cols
[2025-05-29 21:09:49] [INFO ] Computed 32 invariants in 71 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[30]
RANDOM walk for 10000 steps (70 resets) in 152 ms. (65 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 22 ms. (434 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[30]
[2025-05-29 21:09:49] [INFO ] Invariant cache hit.
[2025-05-29 21:09:49] [INFO ] [Real]Absence check using 30 positive place invariants in 39 ms returned sat
[2025-05-29 21:09:49] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 17 ms returned sat
[2025-05-29 21:09:50] [INFO ] [Real]Absence check using state equation in 1373 ms returned sat
[2025-05-29 21:09:51] [INFO ] State equation strengthened by 3585 read => feed constraints.
[2025-05-29 21:09:51] [INFO ] [Real]Added 3585 Read/Feed constraints in 553 ms returned sat
[2025-05-29 21:09:51] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 21:09:52] [INFO ] [Nat]Absence check using 30 positive place invariants in 40 ms returned sat
[2025-05-29 21:09:52] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 17 ms returned sat
[2025-05-29 21:09:53] [INFO ] [Nat]Absence check using state equation in 1250 ms returned sat
[2025-05-29 21:09:54] [INFO ] SMT solver returned unknown. Retrying;
[2025-05-29 21:09:54] [INFO ] [Nat]Added 3585 Read/Feed constraints in 1303 ms returned unknown
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[30]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[30]
Support contains 1 out of 1091 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1091/1091 places, 3704/3704 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 16 place count 1083 transition count 3696
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 19 place count 1083 transition count 3696
Applied a total of 19 rules in 389 ms. Remains 1083 /1091 variables (removed 8) and now considering 3696/3704 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 389 ms. Remains : 1083/1091 places, 3696/3704 transitions.
// Phase 1: matrix 3696 rows 1083 cols
[2025-05-29 21:09:55] [INFO ] Computed 32 invariants in 73 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[30]
RANDOM walk for 1000000 steps (7148 resets) in 9170 ms. (109 steps per ms)
BEST_FIRST walk for 1000000 steps (202 resets) in 1301 ms. (768 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[30]
[2025-05-29 21:10:05] [INFO ] Invariant cache hit.
[2025-05-29 21:10:05] [INFO ] [Real]Absence check using 30 positive place invariants in 35 ms returned sat
[2025-05-29 21:10:05] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 11 ms returned sat
[2025-05-29 21:10:07] [INFO ] [Real]Absence check using state equation in 1150 ms returned sat
[2025-05-29 21:10:07] [INFO ] State equation strengthened by 3604 read => feed constraints.
[2025-05-29 21:10:07] [INFO ] [Real]Added 3604 Read/Feed constraints in 592 ms returned sat
[2025-05-29 21:10:07] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 21:10:08] [INFO ] [Nat]Absence check using 30 positive place invariants in 23 ms returned sat
[2025-05-29 21:10:08] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 10 ms returned sat
[2025-05-29 21:10:09] [INFO ] [Nat]Absence check using state equation in 1149 ms returned sat
[2025-05-29 21:10:09] [INFO ] [Nat]Added 3604 Read/Feed constraints in 487 ms returned sat
[2025-05-29 21:10:10] [INFO ] Computed and/alt/rep : 2622/6957/2622 causal constraints (skipped 1044 transitions) in 417 ms.
[2025-05-29 21:10:11] [INFO ] Added : 8 causal constraints over 2 iterations in 1678 ms. Result :sat
Minimization took 4582 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[30]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[30]
Support contains 1 out of 1083 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1083/1083 places, 3696/3696 transitions.
Applied a total of 0 rules in 88 ms. Remains 1083 /1083 variables (removed 0) and now considering 3696/3696 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 88 ms. Remains : 1083/1083 places, 3696/3696 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1083/1083 places, 3696/3696 transitions.
Applied a total of 0 rules in 87 ms. Remains 1083 /1083 variables (removed 0) and now considering 3696/3696 (removed 0) transitions.
[2025-05-29 21:10:16] [INFO ] Invariant cache hit.
[2025-05-29 21:10:18] [INFO ] Implicit Places using invariants in 2083 ms returned []
[2025-05-29 21:10:18] [INFO ] Invariant cache hit.
[2025-05-29 21:10:19] [INFO ] State equation strengthened by 3604 read => feed constraints.
[2025-05-29 21:10:47] [INFO ] Implicit Places using invariants and state equation in 29021 ms returned []
Implicit Place search using SMT with State Equation took 31104 ms to find 0 implicit places.
[2025-05-29 21:10:47] [INFO ] Redundant transitions in 158 ms returned []
Running 3666 sub problems to find dead transitions.
[2025-05-29 21:10:47] [INFO ] Invariant cache hit.
[2025-05-29 21:10:47] [INFO ] State equation strengthened by 3604 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 1.0)
(s3 0.0)
(s4 1.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 1.0)
(s11 0.0)
(s12 0.0)
(s13 0.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 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 1.0)
(s29 0.0)
(s30 0.0)
(s31 0.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 0.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 1.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 1.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 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 1.0)
(s102 0.0)
(s103 0.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 1.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 1.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 1.0)
(s137 1.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 1.0)
(s143 1.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 1.0)
(s149 1.0)
(s150 0.0)
(s151 1.0)
(s152 0.0)
(s153 0.0)
(s154 1.0)
(s155 1.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 1.0)
(s161 1.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 1.0)
(s167 1.0)
(s168 0.0)
(s169 1.0)
(s170 0.0)
(s171 0.0)
(s172 1.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 1.0)
(s179 0.0)
(s180 1.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 0.0)
(s429 0.0)
(s430 0.0)
(s431 0.0)
(s432 0.0)
(s433 0.0)
(s434 0.0)
(s435 0.0)
(s436 0.0)
(s437 0.0)
(s438 0.0)
(s439 0.0)
(s440 0.0)
(s441 0.0)
(s442 1.0)
(s443 0.0)
(s444 0.0)
(s445 0.0)
(s446 1.0)
(s447 0.0)
(s448 0.0)
(s449 0.0)
(s450 0.0)
(s451 0.0)
(s452 0.0)
(s453 0.0)
(s454 0.0)
(s455 0.0)
(s456 0.0)
(s457 0.0)
(s458 0.0)
(s459 0.0)
(s460 0.0)
(s461 0.0)
(s462 0.0)
(s463 0.0)
(s464 0.0)
(s465 0.0)
(s466 0.0)
(s467 0.0)
(s468 0.0)
(s469 0.0)
(s470 0.0)
(s471 0.0)
(s472 0.0)
(s473 0.0)
(s474 0.0)
(s475 0.0)
(s476 0.0)
(s477 0.0)
(s478 0.0)
(s479 0.0)
(s480 1.0)
(s481 0.0)
(s482 0.0)
(s483 0.0)
(s484 0.0)
(s485 0.0)
(s486 0.0)
(s487 0.0)
(s488 0.0)
(s489 0.0)
(s490 0.0)
(s491 0.0)
(s492 0.0)
(s493 0.0)
(s494 0.0)
(s495 0.0)
(s496 0.0)
(s497 0.0)
(s498 0.0)
(s499 0.0)
(s500 0.0)
(s501 0.0)
(s502 0.0)
(s503 0.0)
(s504 0.0)
(s505 0.0)
(s506 0.0)
(s507 0.0)
(s508 0.0)
(s509 0.0)
(s510 0.0)
(s511 0.0)
(s512 0.0)
(s513 0.0)
(s514 0.0)
(s515 0.0)
(s516 0.0)
(s517 0.0)
(s518 0.0)
(s519 0.0)
(s520 0.0)
(s521 0.0)
(s522 0.0)
(s523 0.0)
(s524 0.0)
(s525 0.0)
(s526 0.0)
(s527 0.0)
(s528 0.0)
(s529 0.0)
(s530 0.0)
(s531 0.0)
(s532 0.0)
(s533 0.0)
(s534 0.0)
(s535 0.0)
(s536 0.0)
(s537 0.0)
(s538 0.0)
(s539 0.0)
(s540 0.0)
(s541 0.0)
(s542 0.0)
(s543 0.0)
(s544 0.0)
(s545 0.0)
(s546 0.0)
(s547 0.0)
(s548 0.0)
(s549 0.0)
(s550 0.0)
(s551 0.0)
(s552 0.0)
(s553 0.0)
(s554 0.0)
(s555 0.0)
(s556 0.0)
(s557 0.0)
(s558 0.0)
(s559 0.0)
(s560 0.0)
(s561 0.0)
(s562 0.0)
(s563 0.0)
(s564 0.0)
(s565 0.0)
(s566 0.0)
(s567 0.0)
(s568 0.0)
(s569 0.0)
(s570 0.0)
(s571 0.0)
(s572 0.0)
(s573 0.0)
(s574 0.0)
(s575 0.0)
(s576 0.0)
(s577 0.0)
(s578 0.0)
(s579 0.0)
(s580 0.0)
(s581 0.0)
(s582 0.0)
(s583 0.0)
(s584 0.0)
(s585 0.0)
(s586 0.0)
(s587 0.0)
(s588 0.0)
(s589 0.0)
(s590 0.0)
(s591 0.0)
(s592 0.0)
(s593 0.0)
(s594 0.0)
(s595 0.0)
(s596 0.0)
(s597 0.0)
(s598 0.0)
(s599 0.0)
(s600 0.0)
(s601 0.0)
(s602 0.0)
(s603 0.0)
(s604 0.0)
(s605 0.0)
(s606 0.0)
(s607 0.0)
(s608 0.0)
(s609 0.0)
(s610 0.0)
(s611 0.0)
(s612 0.0)
(s613 0.0)
(s614 0.0)
(s615 0.0)
(s616 0.0)
(s617 0.0)
(s618 0.0)
(s619 0.0)
(s620 0.0)
(s621 0.0)
(s622 0.0)
(s623 0.0)
(s624 0.0)
(s625 0.0)
(s626 0.0)
(s627 0.0)
(s628 0.0)
(s629 0.0)
(s630 0.0)
(s631 0.0)
(s632 0.0)
(s633 0.0)
(s634 0.0)
(s635 0.0)
(s636 0.0)
(s637 0.0)
(s638 0.0)
(s639 0.0)
(s640 0.0)
(s641 0.0)
(s642 0.0)
(s643 0.0)
(s644 0.0)
(s645 0.0)
(s646 0.0)
(s647 0.0)
(s648 0.0)
(s649 0.0)
(s650 0.0)
(s651 0.0)
(s652 0.0)
(s653 0.0)
(s654 0.0)
(s655 0.0)
(s656 0.0)
(s657 0.0)
(s658 0.0)
(s659 0.0)
(s660 0.0)
(s661 0.0)
(s662 0.0)
(s663 0.0)
(s664 0.0)
(s665 0.0)
(s666 0.0)
(s667 0.0)
(s668 0.0)
(s669 0.0)
(s670 0.0)
(s671 0.0)
(s672 0.0)
(s673 0.0)
(s674 0.0)
(s675 0.0)
(s676 0.0)
(s677 0.0)
(s678 0.0)
(s679 0.0)
(s680 0.0)
(s681 0.0)
(s682 0.0)
(s683 0.0)
(s684 0.0)
(s685 0.0)
(s686 0.0)
(s687 0.0)
(s688 0.0)
(s689 0.0)
(s690 0.0)
(s691 0.0)
(s692 0.0)
(s693 0.0)
(s694 0.0)
(s695 0.0)
(s696 0.0)
(s697 0.0)
(s698 0.0)
(s699 0.0)
(s700 0.0)
(s701 0.0)
(s702 0.0)
(s703 0.0)
(s704 0.0)
(s705 0.0)
(s706 0.0)
(s707 0.0)
(s708 0.0)
(s709 0.0)
(s710 0.0)
(s711 0.0)
(s712 0.0)
(s713 0.0)
(s714 0.0)
(s715 0.0)
(s716 0.0)
(s717 0.0)
(s718 0.0)
(s719 0.0)
(s720 0.0)
(s721 0.0)
(s722 0.0)
(s723 0.0)
(s724 0.0)
(s725 0.0)
(s726 0.0)
(s727 0.0)
(s728 0.0)
(s729 0.0)
(s730 0.0)
(s731 0.0)
(s732 0.0)
(s733 0.0)
(s734 0.0)
(s735 0.0)
(s736 0.0)
(s737 0.0)
(s738 0.0)
(s739 0.0)
(s740 0.0)
(s741 0.0)
(s742 0.0)
(s743 0.0)
(s744 0.0)
(s745 0.0)
(s746 0.0)
(s747 0.0)
(s748 0.0)
(s749 0.0)
(s750 0.0)
(s751 0.0)
(s752 0.0)
(s753 0.0)
(s754 0.0)
(s755 0.0)
(s756 0.0)
(s757 0.0)
(s758 0.0)
(s759 0.0)
(s760 0.0)
(s761 0.0)
(s762 0.0)
(s763 0.0)
(s764 0.0)
(s765 0.0)
(s766 0.0)
(s767 0.0)
(s768 0.0)
(s769 0.0)
(s770 0.0)
(s771 0.0)
(s772 0.0)
(s773 0.0)
(s774 0.0)
(s775 0.0)
(s776 0.0)
(s777 0.0)
(s778 0.0)
(s779 0.0)
(s780 0.0)
(s781 0.0)
(s782 0.0)
(s783 0.0)
(s784 0.0)
(s785 0.0)
(s786 0.0)
(s787 0.0)
(s788 0.0)
(s789 0.0)
(s790 0.0)
(s791 0.0)
(s792 0.0)
(s793 0.0)
(s794 0.0)
(s795 0.0)
(s796 0.0)
(s797 0.0)
(s798 0.0)
(s799 0.0)
(s800 0.0)
(s801 0.0)
(s802 0.0)
(s803 0.0)
(s804 0.0)
(s805 0.0)
(s806 0.0)
(s807 0.0)
(s808 0.0)
(s809 0.0)
(s810 0.0)
(s811 0.0)
(s812 0.0)
(s813 0.0)
(s814 0.0)
(s815 0.0)
(s816 0.0)
(s817 0.0)
(s818 0.0)
(s819 0.0)
(s820 0.0)
(s821 0.0)
(s822 0.0)
(s823 0.0)
(s824 0.0)
(s825 0.0)
(s826 0.0)
(s827 0.0)
(s828 0.0)
(s829 0.0)
(s830 0.0)
(s831 0.0)
(s832 0.0)
(s833 0.0)
(s834 0.0)
(s835 0.0)
(s836 0.0)
(s837 0.0)
(s838 0.0)
(s839 0.0)
(s840 0.0)
(s841 0.0)
(s842 0.0)
(s843 0.0)
(s844 0.0)
(s845 0.0)
(s846 0.0)
(s847 0.0)
(s848 0.0)
(s849 0.0)
(s850 0.0)
(s851 0.0)
(s852 0.0)
(s853 0.0)
(s854 0.0)
(s855 0.0)
(s856 0.0)
(s857 0.0)
(s858 0.0)
(s859 0.0)
(s860 0.0)
(s861 0.0)
(s862 0.0)
(s863 0.0)
(s864 0.0)
(s865 0.0)
(s866 0.0)
(s867 0.0)
(s868 0.0)
(s869 0.0)
(s870 0.0)
(s871 0.0)
(s872 0.0)
(s873 0.0)
(s874 0.0)
(s875 0.0)
(s876 0.0)
(s877 0.0)
(s878 0.0)
(s879 0.0)
(s880 0.0)
(s881 0.0)
(s882 0.0)
(s883 0.0)
(s884 0.0)
(s885 0.0)
(s886 0.0)
(s887 0.0)
(s888 0.0)
(s889 0.0)
(s890 0.0)
(s891 0.0)
(s892 0.0)
(s893 0.0)
(s894 0.0)
(s895 0.0)
(s896 0.0)
(s897 0.0)
(s898 0.0)
(s899 0.0)
(s900 0.0)
(s901 0.0)
(s902 0.0)
(s903 0.0)
(s904 0.0)
(s905 0.0)
(s906 0.0)
(s907 0.0)
(s908 0.0)
(s909 0.0)
(s910 0.0)
(s911 0.0)
(s912 0.0)
(s913 0.0)
(s914 0.0)
(s915 0.0)
(s916 0.0)
(s917 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1082 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 3666 unsolved
SMT process timed out in 32854ms, After SMT, problems are : Problem set: 0 solved, 3666 unsolved
Search for dead transitions found 0 dead transitions in 32890ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64250 ms. Remains : 1083/1083 places, 3696/3696 transitions.
[2025-05-29 21:11:20] [INFO ] Flatten gal took : 160 ms
RANDOM walk for 40000 steps (285 resets) in 668 ms. (59 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 123 ms. (322 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 124 ms. (320 steps per ms) remains 2/2 properties
[2025-05-29 21:11:20] [INFO ] Flatten gal took : 214 ms
[2025-05-29 21:11:20] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11833763771290676285.gal : 37 ms
[2025-05-29 21:11:20] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10909118520789654771.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/ReachabilityCardinality11833763771290676285.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10909118520789654771.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/ReachabilityCardinality10909118520789654771.prop.
Interrupted probabilistic random walk after 139538 steps, run timeout after 3001 ms. (steps per millisecond=46 ) properties seen :0 out of 2
Probabilistic random walk after 139538 steps, saw 27982 distinct states, run finished after 3001 ms. (steps per millisecond=46 ) properties seen :0
[2025-05-29 21:11:23] [INFO ] Invariant cache hit.
[2025-05-29 21:11:23] [INFO ] State equation strengthened by 3604 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) 1020/1021 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-05-29 21:11:24] [INFO ] Deduced a trap composed of 2 places in 46 ms of which 1 ms to minimize.
Problem MAX0 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/1021 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1021 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 58/1079 variables, 29/31 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1079 variables, 0/31 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/1081 variables, 2/33 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2025-05-29 21:11:25] [INFO ] Deduced a trap composed of 52 places in 1127 ms of which 10 ms to minimize.
[2025-05-29 21:11:26] [INFO ] Deduced a trap composed of 37 places in 1071 ms of which 9 ms to minimize.
[2025-05-29 21:11:27] [INFO ] Deduced a trap composed of 40 places in 1077 ms of which 9 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 963
[2025-05-29 21:11:28] [INFO ] Deduced a trap composed of 42 places in 1022 ms of which 8 ms to minimize.
[2025-05-29 21:11:29] [INFO ] Deduced a trap composed of 42 places in 967 ms of which 8 ms to minimize.
SMT process timed out in 5823ms, After SMT, problems are : Problem set: 1 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 1083 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1083/1083 places, 3696/3696 transitions.
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :963 after 1043
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :1043 after 1171
Applied a total of 0 rules in 87 ms. Remains 1083 /1083 variables (removed 0) and now considering 3696/3696 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 88 ms. Remains : 1083/1083 places, 3696/3696 transitions.
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :1171 after 1367
RANDOM walk for 40000 steps (284 resets) in 560 ms. (71 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 88 ms. (449 steps per ms) remains 1/1 properties
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :1367 after 1563
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :1563 after 1718
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :1718 after 1731
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :1731 after 1771
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :1771 after 1871
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :1871 after 2124
Interrupted probabilistic random walk after 164623 steps, run timeout after 3001 ms. (steps per millisecond=54 ) properties seen :0 out of 1
Probabilistic random walk after 164623 steps, saw 30915 distinct states, run finished after 3001 ms. (steps per millisecond=54 ) properties seen :0
[2025-05-29 21:11:32] [INFO ] Invariant cache hit.
[2025-05-29 21:11:32] [INFO ] State equation strengthened by 3604 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) 1020/1021 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-29 21:11:33] [INFO ] Deduced a trap composed of 2 places in 50 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1021 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1021 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 58/1079 variables, 29/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1079 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/1081 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-29 21:11:34] [INFO ] Deduced a trap composed of 35 places in 1138 ms of which 9 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :2124 after 2504
[2025-05-29 21:11:35] [INFO ] Deduced a trap composed of 34 places in 1061 ms of which 9 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1081 variables, 2/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1081 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 3696/4777 variables, 1081/1116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4777 variables, 3604/4720 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/4777 variables, 0/4720 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 2/4779 variables, 2/4722 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/4779 variables, 0/4722 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/4779 variables, 0/4722 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4779/4779 variables, and 4722 constraints, problems are : Problem set: 0 solved, 1 unsolved in 4666 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1083/1083 constraints, ReadFeed: 3604/3604 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 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) 1020/1021 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1021 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-29 21:11:37] [INFO ] Deduced a trap composed of 2 places in 43 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1021 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1021 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 58/1079 variables, 29/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1079 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/1081 variables, 2/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1081 variables, 2/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-29 21:11:39] [INFO ] Deduced a trap composed of 60 places in 1122 ms of which 9 ms to minimize.
[2025-05-29 21:11:40] [INFO ] Deduced a trap composed of 37 places in 1069 ms of which 9 ms to minimize.
[2025-05-29 21:11:40] [INFO ] Deduced a trap composed of 35 places in 75 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/1081 variables, 3/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1081 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 3696/4777 variables, 1081/1120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/4777 variables, 3604/4724 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/4777 variables, 1/4725 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/4777 variables, 0/4725 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 2/4779 variables, 2/4727 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/4779 variables, 0/4727 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/4779 variables, 0/4727 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4779/4779 variables, and 4727 constraints, problems are : Problem set: 0 solved, 1 unsolved in 5848 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1083/1083 constraints, ReadFeed: 3604/3604 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 7/7 constraints]
After SMT, in 10562ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 84 ms.
Support contains 1 out of 1083 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1083/1083 places, 3696/3696 transitions.
Applied a total of 0 rules in 90 ms. Remains 1083 /1083 variables (removed 0) and now considering 3696/3696 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 90 ms. Remains : 1083/1083 places, 3696/3696 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1083/1083 places, 3696/3696 transitions.
Applied a total of 0 rules in 91 ms. Remains 1083 /1083 variables (removed 0) and now considering 3696/3696 (removed 0) transitions.
[2025-05-29 21:11:43] [INFO ] Invariant cache hit.
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :2504 after 3061
[2025-05-29 21:11:45] [INFO ] Implicit Places using invariants in 1612 ms returned []
[2025-05-29 21:11:45] [INFO ] Invariant cache hit.
[2025-05-29 21:11:46] [INFO ] State equation strengthened by 3604 read => feed constraints.
Detected timeout of ITS tools.
[2025-05-29 21:12:11] [INFO ] Flatten gal took : 74 ms
[2025-05-29 21:12:11] [INFO ] Applying decomposition
[2025-05-29 21:12:11] [INFO ] Flatten gal took : 76 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/graph9167122020321794432.txt' '-o' '/tmp/graph9167122020321794432.bin' '-w' '/tmp/graph9167122020321794432.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph9167122020321794432.bin' '-l' '-1' '-v' '-w' '/tmp/graph9167122020321794432.weights' '-q' '0' '-e' '0.001'
[2025-05-29 21:12:11] [INFO ] Decomposing Gal with order
[2025-05-29 21:12:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-29 21:12:11] [INFO ] Removed a total of 2827 redundant transitions.
[2025-05-29 21:12:11] [INFO ] Flatten gal took : 204 ms
[2025-05-29 21:12:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 3398 labels/synchronizations in 106 ms.
[2025-05-29 21:12:11] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12260578495796044923.gal : 27 ms
[2025-05-29 21:12:11] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4890536443938755294.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/ReachabilityCardinality12260578495796044923.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4890536443938755294.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/ReachabilityCardinality4890536443938755294.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 150
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :150 after 150
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :150 after 150
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :150 after 150
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :150 after 150
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :150 after 150
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :150 after 150
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :150 after 150
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :150 after 150
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :150 after 150
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :150 after 10038
[2025-05-29 21:12:15] [INFO ] Implicit Places using invariants and state equation in 30103 ms returned []
Implicit Place search using SMT with State Equation took 31717 ms to find 0 implicit places.
[2025-05-29 21:12:15] [INFO ] Redundant transitions in 151 ms returned []
Running 3666 sub problems to find dead transitions.
[2025-05-29 21:12:15] [INFO ] Invariant cache hit.
[2025-05-29 21:12:15] [INFO ] State equation strengthened by 3604 read => feed constraints.
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :10038 after 17493
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/1082 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 3666 unsolved
SMT process timed out in 32999ms, After SMT, problems are : Problem set: 0 solved, 3666 unsolved
Search for dead transitions found 0 dead transitions in 33034ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65001 ms. Remains : 1083/1083 places, 3696/3696 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 3513 edges and 1083 vertex of which 959 / 1083 are part of one of the 2 SCC in 1 ms
Free SCC test removed 957 places
Drop transitions (Empty/Sink Transition effects.) removed 2645 transitions
Ensure Unique test removed 922 transitions
Reduce isomorphic transitions removed 3567 transitions.
Graph (complete) has 311 edges and 126 vertex of which 35 are kept as prefixes of interest. Removing 91 places using SCC suffix rule.0 ms
Discarding 91 places :
Also discarding 29 output transitions
Drop transitions (Output transitions of discarded places.) removed 29 transitions
Drop transitions (Empty/Sink Transition effects.) removed 61 transitions
Reduce isomorphic transitions removed 61 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 62 rules applied. Total rules applied 64 place count 35 transition count 38
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 65 place count 34 transition count 38
Discarding 28 places :
Symmetric choice reduction at 2 with 28 rule applications. Total rules 93 place count 6 transition count 10
Iterating global reduction 2 with 28 rules applied. Total rules applied 121 place count 6 transition count 10
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 123 place count 6 transition count 8
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 124 place count 6 transition count 7
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 126 place count 5 transition count 6
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 127 place count 4 transition count 5
Applied a total of 127 rules in 17 ms. Remains 4 /1083 variables (removed 1079) and now considering 5/3696 (removed 3691) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 5 rows 4 cols
[2025-05-29 21:12:48] [INFO ] Computed 0 invariants in 0 ms
[2025-05-29 21:12:48] [INFO ] After 19ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2025-05-29 21:12:48] [INFO ] After 4ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-05-29 21:12:48] [INFO ] After 6ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-05-29 21:12:48] [INFO ] After 27ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2025-05-29 21:12:48] [INFO ] Flatten gal took : 0 ms
[2025-05-29 21:12:48] [INFO ] Flatten gal took : 0 ms
[2025-05-29 21:12:48] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13277932399307806059.gal : 1 ms
[2025-05-29 21:12:48] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1000475286926988603.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/ReachabilityCardinality13277932399307806059.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1000475286926988603.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/ReachabilityCardinality1000475286926988603.prop.
Invariant property MIN0 does not hold.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 3 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,6,0.002025,3520,2,7,6,33,6,0,21,18,0
Total reachable state count : 6
Verifying 1 reachability properties.
Invariant property MIN0 does not hold.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN0,1,0.002409,3896,2,5,6,33,7,0,24,18,0
Over-approximation ignoring read arcs solved 0 properties in 78 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[1] Max Struct:[30]
Ending property specific reduction for CANInsertWithFailure-PT-030-UpperBounds-15 in 179695 ms.
[2025-05-29 21:12:48] [INFO ] Flatten gal took : 70 ms
[2025-05-29 21:12:48] [INFO ] Applying decomposition
[2025-05-29 21:12:48] [INFO ] Flatten gal took : 125 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/graph8466695930001838873.txt' '-o' '/tmp/graph8466695930001838873.bin' '-w' '/tmp/graph8466695930001838873.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8466695930001838873.bin' '-l' '-1' '-v' '-w' '/tmp/graph8466695930001838873.weights' '-q' '0' '-e' '0.001'
[2025-05-29 21:12:49] [INFO ] Decomposing Gal with order
[2025-05-29 21:12:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-29 21:12:49] [INFO ] Removed a total of 2801 redundant transitions.
[2025-05-29 21:12:49] [INFO ] Flatten gal took : 221 ms
[2025-05-29 21:12:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 2956 labels/synchronizations in 112 ms.
[2025-05-29 21:12:49] [INFO ] Time to serialize gal into /tmp/UpperBounds9098764960683997803.gal : 30 ms
[2025-05-29 21:12:49] [INFO ] Time to serialize properties into /tmp/UpperBounds2118258230590241401.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/UpperBounds9098764960683997803.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds2118258230590241401.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 ...283
Loading property file /tmp/UpperBounds2118258230590241401.prop.
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//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination 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-030"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2024"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5832"
echo " Executing tool gold2024"
echo " Input is CANInsertWithFailure-PT-030, 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 r041-smll-174853822500035"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/CANInsertWithFailure-PT-030.tgz
mv CANInsertWithFailure-PT-030 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.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 ;