fond
Model Checking Contest 2025
15th edition, Paris, France, June 24, 2025
Execution of r072-tall-174860068200811
Last Updated
June 24, 2025

About the Execution of ITS-Tools for EisenbergMcGuire-PT-10

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
0.000 3600000.00 0.00 0.00 TTTFFFTTTFFTTF?F normal

Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r072-tall-174860068200811.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5832
Executing tool itstools
Input is EisenbergMcGuire-PT-10, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r072-tall-174860068200811
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.6M
-rw-r--r-- 1 mcc users 8.5K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.6K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 64K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 21K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 156K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 10K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 64K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.2K 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 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 3.1M May 29 14:32 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

echo here is the order used to build the result vector(from xml file)
FORMULA_NAME EisenbergMcGuire-PT-10-LTLCardinality-00
FORMULA_NAME EisenbergMcGuire-PT-10-LTLCardinality-01
FORMULA_NAME EisenbergMcGuire-PT-10-LTLCardinality-02
FORMULA_NAME EisenbergMcGuire-PT-10-LTLCardinality-03
FORMULA_NAME EisenbergMcGuire-PT-10-LTLCardinality-04
FORMULA_NAME EisenbergMcGuire-PT-10-LTLCardinality-05
FORMULA_NAME EisenbergMcGuire-PT-10-LTLCardinality-06
FORMULA_NAME EisenbergMcGuire-PT-10-LTLCardinality-07
FORMULA_NAME EisenbergMcGuire-PT-10-LTLCardinality-08
FORMULA_NAME EisenbergMcGuire-PT-10-LTLCardinality-09
FORMULA_NAME EisenbergMcGuire-PT-10-LTLCardinality-10
FORMULA_NAME EisenbergMcGuire-PT-10-LTLCardinality-11
FORMULA_NAME EisenbergMcGuire-PT-10-LTLCardinality-12
FORMULA_NAME EisenbergMcGuire-PT-10-LTLCardinality-13
FORMULA_NAME EisenbergMcGuire-PT-10-LTLCardinality-14
FORMULA_NAME EisenbergMcGuire-PT-10-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1748856505280

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=EisenbergMcGuire-PT-10
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202505121319
[2025-06-02 09:28:26] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-02 09:28:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 09:28:26] [INFO ] Load time of PNML (sax parser for PT used): 233 ms
[2025-06-02 09:28:26] [INFO ] Transformed 1090 places.
[2025-06-02 09:28:26] [INFO ] Transformed 5200 transitions.
[2025-06-02 09:28:26] [INFO ] Found NUPN structural information;
[2025-06-02 09:28:26] [INFO ] Parsed PT model containing 1090 places and 5200 transitions and 25400 arcs in 348 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Initial state reduction rules removed 1 formulas.
FORMULA EisenbergMcGuire-PT-10-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EisenbergMcGuire-PT-10-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EisenbergMcGuire-PT-10-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EisenbergMcGuire-PT-10-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EisenbergMcGuire-PT-10-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EisenbergMcGuire-PT-10-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EisenbergMcGuire-PT-10-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 29 out of 1090 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1090/1090 places, 5200/5200 transitions.
Discarding 89 places :
Symmetric choice reduction at 0 with 89 rule applications. Total rules 89 place count 1001 transition count 4310
Iterating global reduction 0 with 89 rules applied. Total rules applied 178 place count 1001 transition count 4310
Applied a total of 178 rules in 233 ms. Remains 1001 /1090 variables (removed 89) and now considering 4310/5200 (removed 890) transitions.
[2025-06-02 09:28:27] [INFO ] Flow matrix only has 1440 transitions (discarded 2870 similar events)
// Phase 1: matrix 1440 rows 1001 cols
[2025-06-02 09:28:27] [INFO ] Computed 31 invariants in 34 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:28:29] [INFO ] Implicit Places using invariants in 1834 ms returned []
[2025-06-02 09:28:29] [INFO ] Flow matrix only has 1440 transitions (discarded 2870 similar events)
[2025-06-02 09:28:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:28:29] [INFO ] State equation strengthened by 445 read => feed constraints.
[2025-06-02 09:28:38] [INFO ] Implicit Places using invariants and state equation in 9631 ms returned []
Implicit Place search using SMT with State Equation took 11504 ms to find 0 implicit places.
Running 4300 sub problems to find dead transitions.
[2025-06-02 09:28:38] [INFO ] Flow matrix only has 1440 transitions (discarded 2870 similar events)
[2025-06-02 09:28:38] [INFO ] Invariant cache hit.
[2025-06-02 09:28:38] [INFO ] State equation strengthened by 445 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1001 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 4300 unsolved
SMT process timed out in 32148ms, After SMT, problems are : Problem set: 0 solved, 4300 unsolved
Search for dead transitions found 0 dead transitions in 32193ms
Starting structural reductions in LTL mode, iteration 1 : 1001/1090 places, 4310/5200 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 43977 ms. Remains : 1001/1090 places, 4310/5200 transitions.
Support contains 29 out of 1001 places after structural reductions.
[2025-06-02 09:29:11] [INFO ] Flatten gal took : 254 ms
[2025-06-02 09:29:11] [INFO ] Flatten gal took : 157 ms
[2025-06-02 09:29:11] [INFO ] Input system was already deterministic with 4310 transitions.
RANDOM walk for 40000 steps (8 resets) in 1751 ms. (22 steps per ms) remains 5/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 238 ms. (167 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 107 ms. (370 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 106 ms. (373 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 102 ms. (388 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 82 ms. (481 steps per ms) remains 5/5 properties
[2025-06-02 09:29:12] [INFO ] Flow matrix only has 1440 transitions (discarded 2870 similar events)
[2025-06-02 09:29:12] [INFO ] Invariant cache hit.
[2025-06-02 09:29:12] [INFO ] State equation strengthened by 445 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 570/582 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/582 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 1/583 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/583 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 12/595 variables, 6/18 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/595 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 868/1463 variables, 595/613 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1463 variables, 102/715 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1463 variables, 0/715 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 82/1545 variables, 10/725 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1545 variables, 1/726 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1545 variables, 79/805 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1545 variables, 0/805 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 104/1649 variables, 48/853 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1649 variables, 32/885 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1649 variables, 0/885 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (OVERLAPS) 340/1989 variables, 8/893 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1989 variables, 0/893 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 19 (OVERLAPS) 8/1997 variables, 4/897 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1997 variables, 0/897 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 21 (OVERLAPS) 444/2441 variables, 348/1245 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/2441 variables, 232/1477 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/2441 variables, 0/1477 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 24 (OVERLAPS) 0/2441 variables, 0/1477 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2441/2441 variables, and 1477 constraints, problems are : Problem set: 0 solved, 5 unsolved in 3145 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 1001/1001 constraints, ReadFeed: 445/445 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 570/582 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/582 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 1/583 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/583 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 12/595 variables, 6/18 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:29:16] [INFO ] Deduced a trap composed of 3 places in 214 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:29:17] [INFO ] Deduced a trap composed of 3 places in 232 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:29:17] [INFO ] Deduced a trap composed of 3 places in 218 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:29:17] [INFO ] Deduced a trap composed of 3 places in 165 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:29:17] [INFO ] Deduced a trap composed of 47 places in 175 ms of which 26 ms to minimize.
Problem AtomicPropp1 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:29:17] [INFO ] Deduced a trap composed of 50 places in 172 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:29:17] [INFO ] Deduced a trap composed of 53 places in 109 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:29:18] [INFO ] Deduced a trap composed of 56 places in 176 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:29:18] [INFO ] Deduced a trap composed of 62 places in 119 ms of which 12 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/595 variables, 9/27 constraints. Problems are: Problem set: 1 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:29:18] [INFO ] Deduced a trap composed of 59 places in 136 ms of which 20 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/595 variables, 1/28 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/595 variables, 0/28 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 868/1463 variables, 595/623 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1463 variables, 102/725 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1463 variables, 0/725 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 82/1545 variables, 10/735 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1545 variables, 1/736 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1545 variables, 79/815 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1545 variables, 1/816 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1545 variables, 0/816 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 104/1649 variables, 48/864 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1649 variables, 32/896 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1649 variables, 0/896 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 20 (OVERLAPS) 340/1989 variables, 8/904 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1989 variables, 0/904 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 22 (OVERLAPS) 8/1997 variables, 4/908 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1997 variables, 3/911 constraints. Problems are: Problem set: 1 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:29:21] [INFO ] Deduced a trap composed of 3 places in 380 ms of which 18 ms to minimize.
SMT process timed out in 8563ms, After SMT, problems are : Problem set: 1 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 1 properties in 533 ms.
Support contains 6 out of 1001 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1001/1001 places, 4310/4310 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 1001 transition count 4300
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 991 transition count 4300
Performed 307 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 307 Pre rules applied. Total rules applied 20 place count 991 transition count 3993
Deduced a syphon composed of 307 places in 3 ms
Reduce places removed 307 places and 0 transitions.
Iterating global reduction 2 with 614 rules applied. Total rules applied 634 place count 684 transition count 3993
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 635 place count 683 transition count 3983
Iterating global reduction 2 with 1 rules applied. Total rules applied 636 place count 683 transition count 3983
Performed 89 Post agglomeration using F-continuation condition.Transition count delta: 89
Deduced a syphon composed of 89 places in 4 ms
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 2 with 178 rules applied. Total rules applied 814 place count 594 transition count 3894
Applied a total of 814 rules in 494 ms. Remains 594 /1001 variables (removed 407) and now considering 3894/4310 (removed 416) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 496 ms. Remains : 594/1001 places, 3894/4310 transitions.
RANDOM walk for 40000 steps (8 resets) in 269 ms. (148 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 75 ms. (526 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 85 ms. (465 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 75 ms. (526 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 211035 steps, run timeout after 3001 ms. (steps per millisecond=70 ) properties seen :1 out of 3
Probabilistic random walk after 211035 steps, saw 147666 distinct states, run finished after 3005 ms. (steps per millisecond=70 ) properties seen :1
[2025-06-02 09:29:25] [INFO ] Flow matrix only has 1024 transitions (discarded 2870 similar events)
// Phase 1: matrix 1024 rows 594 cols
[2025-06-02 09:29:25] [INFO ] Computed 31 invariants in 6 ms
[2025-06-02 09:29:25] [INFO ] State equation strengthened by 436 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 221/225 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/225 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2/227 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/227 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 8/235 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/235 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 411/646 variables, 235/247 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/646 variables, 44/291 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/646 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 118/764 variables, 10/301 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/764 variables, 1/302 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/764 variables, 48/350 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/764 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 156/920 variables, 72/422 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/920 variables, 39/461 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/920 variables, 0/461 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 265/1185 variables, 12/473 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1185 variables, 0/473 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 12/1197 variables, 6/479 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1197 variables, 0/479 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 421/1618 variables, 277/756 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1618 variables, 305/1061 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1618 variables, 0/1061 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 0/1618 variables, 0/1061 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1618/1618 variables, and 1061 constraints, problems are : Problem set: 0 solved, 2 unsolved in 798 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 594/594 constraints, ReadFeed: 436/436 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 221/225 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/225 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2/227 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/227 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 8/235 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/235 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 411/646 variables, 235/247 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/646 variables, 44/291 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/646 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 118/764 variables, 10/301 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/764 variables, 1/302 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/764 variables, 48/350 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/764 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 156/920 variables, 72/422 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/920 variables, 39/461 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/920 variables, 0/461 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 265/1185 variables, 12/473 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1185 variables, 0/473 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 12/1197 variables, 6/479 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1197 variables, 2/481 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:29:27] [INFO ] Deduced a trap composed of 3 places in 191 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:29:27] [INFO ] Deduced a trap composed of 3 places in 192 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:29:27] [INFO ] Deduced a trap composed of 3 places in 163 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:29:27] [INFO ] Deduced a trap composed of 3 places in 189 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:29:28] [INFO ] Deduced a trap composed of 3 places in 104 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:29:28] [INFO ] Deduced a trap composed of 3 places in 57 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:29:28] [INFO ] Deduced a trap composed of 3 places in 65 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:29:28] [INFO ] Deduced a trap composed of 3 places in 365 ms of which 18 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/1197 variables, 8/489 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1197 variables, 0/489 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 421/1618 variables, 277/766 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1618 variables, 305/1071 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:29:29] [INFO ] Deduced a trap composed of 15 places in 115 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:29:29] [INFO ] Deduced a trap composed of 19 places in 117 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:29:29] [INFO ] Deduced a trap composed of 29 places in 101 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:29:29] [INFO ] Deduced a trap composed of 21 places in 92 ms of which 6 ms to minimize.
At refinement iteration 25 (INCLUDED_ONLY) 0/1618 variables, 4/1075 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1618 variables, 0/1075 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (OVERLAPS) 0/1618 variables, 0/1075 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1618/1618 variables, and 1075 constraints, problems are : Problem set: 0 solved, 2 unsolved in 3720 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 594/594 constraints, ReadFeed: 436/436 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4553ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 1 properties in 74 ms.
Support contains 2 out of 594 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 594/594 places, 3894/3894 transitions.
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 0 place count 594 transition count 3891
Deduced a syphon composed of 3 places in 3 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 591 transition count 3891
Applied a total of 6 rules in 246 ms. Remains 591 /594 variables (removed 3) and now considering 3891/3894 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 246 ms. Remains : 591/594 places, 3891/3894 transitions.
RANDOM walk for 40000 steps (8 resets) in 248 ms. (160 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 54 ms. (727 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 167726 steps, run visited all 1 properties in 1502 ms. (steps per millisecond=111 )
Probabilistic random walk after 167726 steps, saw 119138 distinct states, run finished after 1510 ms. (steps per millisecond=111 ) properties seen :1
Successfully simplified 1 atomic propositions for a total of 9 simplifications.
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 1001 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1001/1001 places, 4310/4310 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1000 transition count 4300
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1000 transition count 4300
Applied a total of 2 rules in 75 ms. Remains 1000 /1001 variables (removed 1) and now considering 4300/4310 (removed 10) transitions.
[2025-06-02 09:29:32] [INFO ] Flow matrix only has 1430 transitions (discarded 2870 similar events)
// Phase 1: matrix 1430 rows 1000 cols
[2025-06-02 09:29:32] [INFO ] Computed 31 invariants in 7 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:29:34] [INFO ] Implicit Places using invariants in 1867 ms returned []
[2025-06-02 09:29:34] [INFO ] Flow matrix only has 1430 transitions (discarded 2870 similar events)
[2025-06-02 09:29:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:29:34] [INFO ] State equation strengthened by 436 read => feed constraints.
[2025-06-02 09:29:44] [INFO ] Implicit Places using invariants and state equation in 10456 ms returned []
Implicit Place search using SMT with State Equation took 12328 ms to find 0 implicit places.
Running 4290 sub problems to find dead transitions.
[2025-06-02 09:29:44] [INFO ] Flow matrix only has 1430 transitions (discarded 2870 similar events)
[2025-06-02 09:29:44] [INFO ] Invariant cache hit.
[2025-06-02 09:29:44] [INFO ] State equation strengthened by 436 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1000 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 4290 unsolved
SMT process timed out in 31948ms, After SMT, problems are : Problem set: 0 solved, 4290 unsolved
Search for dead transitions found 0 dead transitions in 31963ms
Starting structural reductions in LTL mode, iteration 1 : 1000/1001 places, 4300/4310 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 44400 ms. Remains : 1000/1001 places, 4300/4310 transitions.
Stuttering acceptance computed with spot in 185 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : EisenbergMcGuire-PT-10-LTLCardinality-00
Product exploration explored 100000 steps with 50000 reset in 756 ms.
Product exploration explored 100000 steps with 50000 reset in 738 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 19 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA EisenbergMcGuire-PT-10-LTLCardinality-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property EisenbergMcGuire-PT-10-LTLCardinality-00 finished in 46222 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 1001 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1001/1001 places, 4310/4310 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 1001 transition count 4300
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 991 transition count 4300
Performed 310 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 310 Pre rules applied. Total rules applied 20 place count 991 transition count 3990
Deduced a syphon composed of 310 places in 3 ms
Reduce places removed 310 places and 0 transitions.
Iterating global reduction 2 with 620 rules applied. Total rules applied 640 place count 681 transition count 3990
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 641 place count 680 transition count 3980
Iterating global reduction 2 with 1 rules applied. Total rules applied 642 place count 680 transition count 3980
Performed 89 Post agglomeration using F-continuation condition.Transition count delta: 89
Deduced a syphon composed of 89 places in 3 ms
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 2 with 178 rules applied. Total rules applied 820 place count 591 transition count 3891
Applied a total of 820 rules in 335 ms. Remains 591 /1001 variables (removed 410) and now considering 3891/4310 (removed 419) transitions.
[2025-06-02 09:30:18] [INFO ] Flow matrix only has 1021 transitions (discarded 2870 similar events)
// Phase 1: matrix 1021 rows 591 cols
[2025-06-02 09:30:18] [INFO ] Computed 31 invariants in 7 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:30:20] [INFO ] Implicit Places using invariants in 1159 ms returned []
[2025-06-02 09:30:20] [INFO ] Flow matrix only has 1021 transitions (discarded 2870 similar events)
[2025-06-02 09:30:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:30:20] [INFO ] State equation strengthened by 436 read => feed constraints.
[2025-06-02 09:30:25] [INFO ] Implicit Places using invariants and state equation in 5212 ms returned []
Implicit Place search using SMT with State Equation took 6373 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 09:30:25] [INFO ] Redundant transitions in 275 ms returned []
Running 3881 sub problems to find dead transitions.
[2025-06-02 09:30:25] [INFO ] Flow matrix only has 1021 transitions (discarded 2870 similar events)
[2025-06-02 09:30:25] [INFO ] Invariant cache hit.
[2025-06-02 09:30:25] [INFO ] State equation strengthened by 436 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/591 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 3881 unsolved
SMT process timed out in 31621ms, After SMT, problems are : Problem set: 0 solved, 3881 unsolved
Search for dead transitions found 0 dead transitions in 31630ms
Starting structural reductions in SI_LTL mode, iteration 1 : 591/1001 places, 3891/4310 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 38632 ms. Remains : 591/1001 places, 3891/4310 transitions.
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
Running random walk in product with property : EisenbergMcGuire-PT-10-LTLCardinality-03
Product exploration explored 100000 steps with 0 reset in 277 ms.
Stack based approach found an accepted trace after 5 steps with 0 reset with depth 6 and stack size 6 in 1 ms.
FORMULA EisenbergMcGuire-PT-10-LTLCardinality-03 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-10-LTLCardinality-03 finished in 38986 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 1001 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1001/1001 places, 4310/4310 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 1001 transition count 4300
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 991 transition count 4300
Performed 309 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 309 Pre rules applied. Total rules applied 20 place count 991 transition count 3991
Deduced a syphon composed of 309 places in 3 ms
Reduce places removed 309 places and 0 transitions.
Iterating global reduction 2 with 618 rules applied. Total rules applied 638 place count 682 transition count 3991
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 639 place count 681 transition count 3981
Iterating global reduction 2 with 1 rules applied. Total rules applied 640 place count 681 transition count 3981
Performed 89 Post agglomeration using F-continuation condition.Transition count delta: 89
Deduced a syphon composed of 89 places in 3 ms
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 2 with 178 rules applied. Total rules applied 818 place count 592 transition count 3892
Applied a total of 818 rules in 310 ms. Remains 592 /1001 variables (removed 409) and now considering 3892/4310 (removed 418) transitions.
[2025-06-02 09:30:57] [INFO ] Flow matrix only has 1022 transitions (discarded 2870 similar events)
// Phase 1: matrix 1022 rows 592 cols
[2025-06-02 09:30:57] [INFO ] Computed 31 invariants in 10 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:30:58] [INFO ] Implicit Places using invariants in 984 ms returned []
[2025-06-02 09:30:58] [INFO ] Flow matrix only has 1022 transitions (discarded 2870 similar events)
[2025-06-02 09:30:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:30:59] [INFO ] State equation strengthened by 436 read => feed constraints.
[2025-06-02 09:31:04] [INFO ] Implicit Places using invariants and state equation in 5394 ms returned []
Implicit Place search using SMT with State Equation took 6380 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 09:31:04] [INFO ] Redundant transitions in 276 ms returned []
Running 3882 sub problems to find dead transitions.
[2025-06-02 09:31:04] [INFO ] Flow matrix only has 1022 transitions (discarded 2870 similar events)
[2025-06-02 09:31:04] [INFO ] Invariant cache hit.
[2025-06-02 09:31:04] [INFO ] State equation strengthened by 436 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/592 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 3882 unsolved
SMT process timed out in 31560ms, After SMT, problems are : Problem set: 0 solved, 3882 unsolved
Search for dead transitions found 0 dead transitions in 31567ms
Starting structural reductions in SI_LTL mode, iteration 1 : 592/1001 places, 3892/4310 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 38549 ms. Remains : 592/1001 places, 3892/4310 transitions.
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : EisenbergMcGuire-PT-10-LTLCardinality-05
Product exploration explored 100000 steps with 506 reset in 399 ms.
Stack based approach found an accepted trace after 237 steps with 1 reset with depth 24 and stack size 24 in 2 ms.
FORMULA EisenbergMcGuire-PT-10-LTLCardinality-05 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-10-LTLCardinality-05 finished in 39060 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(X(F(p0)))))))'
Support contains 2 out of 1001 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1001/1001 places, 4310/4310 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1000 transition count 4300
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1000 transition count 4300
Applied a total of 2 rules in 62 ms. Remains 1000 /1001 variables (removed 1) and now considering 4300/4310 (removed 10) transitions.
[2025-06-02 09:31:36] [INFO ] Flow matrix only has 1430 transitions (discarded 2870 similar events)
// Phase 1: matrix 1430 rows 1000 cols
[2025-06-02 09:31:36] [INFO ] Computed 31 invariants in 13 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:31:38] [INFO ] Implicit Places using invariants in 1522 ms returned []
[2025-06-02 09:31:38] [INFO ] Flow matrix only has 1430 transitions (discarded 2870 similar events)
[2025-06-02 09:31:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:31:38] [INFO ] State equation strengthened by 436 read => feed constraints.
[2025-06-02 09:31:48] [INFO ] Implicit Places using invariants and state equation in 10592 ms returned []
Implicit Place search using SMT with State Equation took 12116 ms to find 0 implicit places.
Running 4290 sub problems to find dead transitions.
[2025-06-02 09:31:48] [INFO ] Flow matrix only has 1430 transitions (discarded 2870 similar events)
[2025-06-02 09:31:48] [INFO ] Invariant cache hit.
[2025-06-02 09:31:48] [INFO ] State equation strengthened by 436 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1000 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 4290 unsolved
SMT process timed out in 31957ms, After SMT, problems are : Problem set: 0 solved, 4290 unsolved
Search for dead transitions found 0 dead transitions in 31966ms
Starting structural reductions in LTL mode, iteration 1 : 1000/1001 places, 4300/4310 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 44165 ms. Remains : 1000/1001 places, 4300/4310 transitions.
Stuttering acceptance computed with spot in 244 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : EisenbergMcGuire-PT-10-LTLCardinality-06
Product exploration explored 100000 steps with 16666 reset in 603 ms.
Product exploration explored 100000 steps with 16666 reset in 617 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 76 ms. Reduced automaton from 6 states, 6 edges and 1 AP (stutter sensitive) to 6 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 222 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 5901 steps (0 resets) in 53 ms. (109 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 98 ms. Reduced automaton from 6 states, 6 edges and 1 AP (stutter sensitive) to 6 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 234 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 221 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 1000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1000/1000 places, 4300/4300 transitions.
Applied a total of 0 rules in 36 ms. Remains 1000 /1000 variables (removed 0) and now considering 4300/4300 (removed 0) transitions.
[2025-06-02 09:32:23] [INFO ] Flow matrix only has 1430 transitions (discarded 2870 similar events)
[2025-06-02 09:32:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:32:24] [INFO ] Implicit Places using invariants in 1538 ms returned []
[2025-06-02 09:32:24] [INFO ] Flow matrix only has 1430 transitions (discarded 2870 similar events)
[2025-06-02 09:32:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:32:25] [INFO ] State equation strengthened by 436 read => feed constraints.
[2025-06-02 09:32:35] [INFO ] Implicit Places using invariants and state equation in 10563 ms returned []
Implicit Place search using SMT with State Equation took 12104 ms to find 0 implicit places.
Running 4290 sub problems to find dead transitions.
[2025-06-02 09:32:35] [INFO ] Flow matrix only has 1430 transitions (discarded 2870 similar events)
[2025-06-02 09:32:35] [INFO ] Invariant cache hit.
[2025-06-02 09:32:35] [INFO ] State equation strengthened by 436 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1000 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 4290 unsolved
SMT process timed out in 31876ms, After SMT, problems are : Problem set: 0 solved, 4290 unsolved
Search for dead transitions found 0 dead transitions in 31884ms
Finished structural reductions in LTL mode , in 1 iterations and 44045 ms. Remains : 1000/1000 places, 4300/4300 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 98 ms. Reduced automaton from 6 states, 6 edges and 1 AP (stutter sensitive) to 6 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 234 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 5739 steps (0 resets) in 52 ms. (108 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 102 ms. Reduced automaton from 6 states, 6 edges and 1 AP (stutter sensitive) to 6 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 233 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 258 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 226 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 16666 reset in 660 ms.
Product exploration explored 100000 steps with 16666 reset in 695 ms.
Applying partial POR strategy [true, false, false, false, false, false]
Stuttering acceptance computed with spot in 263 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 1000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1000/1000 places, 4300/4300 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 1000 transition count 4300
Performed 298 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 298 Pre rules applied. Total rules applied 10 place count 1000 transition count 4818
Deduced a syphon composed of 308 places in 3 ms
Iterating global reduction 1 with 298 rules applied. Total rules applied 308 place count 1000 transition count 4818
Performed 100 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 408 places in 3 ms
Iterating global reduction 1 with 100 rules applied. Total rules applied 408 place count 1000 transition count 4818
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 418 place count 990 transition count 4808
Deduced a syphon composed of 398 places in 3 ms
Iterating global reduction 1 with 10 rules applied. Total rules applied 428 place count 990 transition count 4808
Deduced a syphon composed of 398 places in 4 ms
Applied a total of 428 rules in 436 ms. Remains 990 /1000 variables (removed 10) and now considering 4808/4300 (removed -508) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 09:33:11] [INFO ] Redundant transitions in 328 ms returned []
Running 4798 sub problems to find dead transitions.
[2025-06-02 09:33:11] [INFO ] Flow matrix only has 1679 transitions (discarded 3129 similar events)
// Phase 1: matrix 1679 rows 990 cols
[2025-06-02 09:33:11] [INFO ] Computed 31 invariants in 14 ms
[2025-06-02 09:33:11] [INFO ] State equation strengthened by 723 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/990 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 4798 unsolved
SMT process timed out in 32213ms, After SMT, problems are : Problem set: 0 solved, 4798 unsolved
Search for dead transitions found 0 dead transitions in 32221ms
Starting structural reductions in SI_LTL mode, iteration 1 : 990/1000 places, 4808/4300 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 33007 ms. Remains : 990/1000 places, 4808/4300 transitions.
Built C files in :
/tmp/ltsmin8047463093974234980
[2025-06-02 09:33:43] [INFO ] Built C files in 71ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8047463093974234980
Running compilation step : cd /tmp/ltsmin8047463093974234980;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8047463093974234980;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8047463093974234980;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
Support contains 2 out of 1000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1000/1000 places, 4300/4300 transitions.
Applied a total of 0 rules in 27 ms. Remains 1000 /1000 variables (removed 0) and now considering 4300/4300 (removed 0) transitions.
[2025-06-02 09:33:46] [INFO ] Flow matrix only has 1430 transitions (discarded 2870 similar events)
// Phase 1: matrix 1430 rows 1000 cols
[2025-06-02 09:33:46] [INFO ] Computed 31 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:33:47] [INFO ] Implicit Places using invariants in 1502 ms returned []
[2025-06-02 09:33:47] [INFO ] Flow matrix only has 1430 transitions (discarded 2870 similar events)
[2025-06-02 09:33:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:33:48] [INFO ] State equation strengthened by 436 read => feed constraints.
[2025-06-02 09:33:58] [INFO ] Implicit Places using invariants and state equation in 10440 ms returned []
Implicit Place search using SMT with State Equation took 11947 ms to find 0 implicit places.
Running 4290 sub problems to find dead transitions.
[2025-06-02 09:33:58] [INFO ] Flow matrix only has 1430 transitions (discarded 2870 similar events)
[2025-06-02 09:33:58] [INFO ] Invariant cache hit.
[2025-06-02 09:33:58] [INFO ] State equation strengthened by 436 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1000 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 4290 unsolved
SMT process timed out in 31712ms, After SMT, problems are : Problem set: 0 solved, 4290 unsolved
Search for dead transitions found 0 dead transitions in 31719ms
Finished structural reductions in LTL mode , in 1 iterations and 43703 ms. Remains : 1000/1000 places, 4300/4300 transitions.
Built C files in :
/tmp/ltsmin16729360961269576629
[2025-06-02 09:34:30] [INFO ] Built C files in 39ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16729360961269576629
Running compilation step : cd /tmp/ltsmin16729360961269576629;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16729360961269576629;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16729360961269576629;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
[2025-06-02 09:34:33] [INFO ] Flatten gal took : 122 ms
[2025-06-02 09:34:33] [INFO ] Flatten gal took : 119 ms
[2025-06-02 09:34:33] [INFO ] Time to serialize gal into /tmp/LTL16789324050103701346.gal : 35 ms
[2025-06-02 09:34:33] [INFO ] Time to serialize properties into /tmp/LTL10575950058740520362.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16789324050103701346.gal' '-t' 'CGAL' '-hoa' '/tmp/aut1456075273602208953.hoa' '-atoms' '/tmp/LTL10575950058740520362.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL10575950058740520362.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut1456075273602208953.hoa
Detected timeout of ITS tools.
[2025-06-02 09:34:48] [INFO ] Flatten gal took : 123 ms
[2025-06-02 09:34:49] [INFO ] Flatten gal took : 106 ms
[2025-06-02 09:34:49] [INFO ] Time to serialize gal into /tmp/LTL14608279821212244042.gal : 23 ms
[2025-06-02 09:34:49] [INFO ] Time to serialize properties into /tmp/LTL1301019895848044581.ltl : 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.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14608279821212244042.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1301019895848044581.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(X(X(X(X(F("((p19_4_8==0)||(p19_4_3==1))"))))))))
Formula 0 simplified : XXXXXG!"((p19_4_8==0)||(p19_4_3==1))"
Detected timeout of ITS tools.
[2025-06-02 09:35:04] [INFO ] Flatten gal took : 102 ms
[2025-06-02 09:35:04] [INFO ] Applying decomposition
[2025-06-02 09:35:04] [INFO ] Flatten gal took : 104 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph14030105895012653140.txt' '-o' '/tmp/graph14030105895012653140.bin' '-w' '/tmp/graph14030105895012653140.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph14030105895012653140.bin' '-l' '-1' '-v' '-w' '/tmp/graph14030105895012653140.weights' '-q' '0' '-e' '0.001'
[2025-06-02 09:35:04] [INFO ] Decomposing Gal with order
[2025-06-02 09:35:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 09:35:05] [INFO ] Removed a total of 9066 redundant transitions.
[2025-06-02 09:35:05] [INFO ] Flatten gal took : 629 ms
[2025-06-02 09:35:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 870 labels/synchronizations in 202 ms.
[2025-06-02 09:35:05] [INFO ] Time to serialize gal into /tmp/LTL414561034138127610.gal : 32 ms
[2025-06-02 09:35:05] [INFO ] Time to serialize properties into /tmp/LTL13516820419418008138.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL414561034138127610.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13516820419418008138.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((X(X(X(X(X(F("((i18.u222.p19_4_8==0)||(i21.u219.p19_4_3==1))"))))))))
Formula 0 simplified : XXXXXG!"((i18.u222.p19_4_8==0)||(i21.u219.p19_4_3==1))"
Detected timeout of ITS tools.
Treatment of property EisenbergMcGuire-PT-10-LTLCardinality-06 finished in 224238 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((X(X(((p0 U p1) U X(X(p0)))))||F(p2)))))'
Support contains 6 out of 1001 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1001/1001 places, 4310/4310 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1000 transition count 4300
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1000 transition count 4300
Applied a total of 2 rules in 53 ms. Remains 1000 /1001 variables (removed 1) and now considering 4300/4310 (removed 10) transitions.
[2025-06-02 09:35:21] [INFO ] Flow matrix only has 1430 transitions (discarded 2870 similar events)
[2025-06-02 09:35:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:35:22] [INFO ] Implicit Places using invariants in 1523 ms returned []
[2025-06-02 09:35:22] [INFO ] Flow matrix only has 1430 transitions (discarded 2870 similar events)
[2025-06-02 09:35:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:35:23] [INFO ] State equation strengthened by 436 read => feed constraints.
[2025-06-02 09:35:33] [INFO ] Implicit Places using invariants and state equation in 10972 ms returned []
Implicit Place search using SMT with State Equation took 12500 ms to find 0 implicit places.
Running 4290 sub problems to find dead transitions.
[2025-06-02 09:35:33] [INFO ] Flow matrix only has 1430 transitions (discarded 2870 similar events)
[2025-06-02 09:35:33] [INFO ] Invariant cache hit.
[2025-06-02 09:35:33] [INFO ] State equation strengthened by 436 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1000 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 4290 unsolved
SMT process timed out in 31897ms, After SMT, problems are : Problem set: 0 solved, 4290 unsolved
Search for dead transitions found 0 dead transitions in 31908ms
Starting structural reductions in LTL mode, iteration 1 : 1000/1001 places, 4300/4310 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 44476 ms. Remains : 1000/1001 places, 4300/4310 transitions.
Stuttering acceptance computed with spot in 574 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p2)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p2)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p2)]
Running random walk in product with property : EisenbergMcGuire-PT-10-LTLCardinality-08
Product exploration explored 100000 steps with 0 reset in 308 ms.
Product exploration explored 100000 steps with 0 reset in 481 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p2 p1 p0), (X p2), (X (X p2))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 120 ms. Reduced automaton from 12 states, 18 edges and 3 AP (stutter sensitive) to 12 states, 18 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 480 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p2)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p2)), (AND (NOT p2) (NOT p0) (NOT p1)), (NOT p2)]
RANDOM walk for 40000 steps (8 resets) in 423 ms. (94 steps per ms) remains 7/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 439 ms. (90 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 98 ms. (404 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 115 ms. (344 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 100 ms. (396 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 102 ms. (388 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 102 ms. (388 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 70 ms. (563 steps per ms) remains 7/7 properties
[2025-06-02 09:36:07] [INFO ] Flow matrix only has 1430 transitions (discarded 2870 similar events)
[2025-06-02 09:36:07] [INFO ] Invariant cache hit.
[2025-06-02 09:36:07] [INFO ] State equation strengthened by 436 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 380/386 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/386 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 2/388 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/388 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 8/396 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/396 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 572/968 variables, 396/408 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/968 variables, 44/452 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/968 variables, 0/452 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (OVERLAPS) 118/1086 variables, 10/462 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1086 variables, 1/463 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1086 variables, 46/509 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1086 variables, 0/509 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (OVERLAPS) 156/1242 variables, 72/581 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1242 variables, 36/617 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1242 variables, 0/617 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 17 (OVERLAPS) 509/1751 variables, 11/628 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1751 variables, 0/628 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 19 (OVERLAPS) 2/1753 variables, 1/629 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1753 variables, 0/629 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 21 (OVERLAPS) 11/1764 variables, 6/635 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1764 variables, 0/635 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 23 (OVERLAPS) 666/2430 variables, 522/1157 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/2430 variables, 310/1467 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/2430 variables, 0/1467 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 26 (OVERLAPS) 0/2430 variables, 0/1467 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2430/2430 variables, and 1467 constraints, problems are : Problem set: 0 solved, 7 unsolved in 3116 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 1000/1000 constraints, ReadFeed: 436/436 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Problem apf1 is UNSAT
Problem apf3 is UNSAT
Problem apf4 is UNSAT
Problem apf5 is UNSAT
At refinement iteration 1 (OVERLAPS) 380/386 variables, 6/6 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/386 variables, 0/6 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 2/388 variables, 2/8 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/388 variables, 0/8 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 8/396 variables, 4/12 constraints. Problems are: Problem set: 4 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:36:11] [INFO ] Deduced a trap composed of 3 places in 140 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:36:11] [INFO ] Deduced a trap composed of 41 places in 103 ms of which 8 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/396 variables, 2/14 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/396 variables, 0/14 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 572/968 variables, 396/410 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/968 variables, 44/454 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/968 variables, 0/454 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 118/1086 variables, 10/464 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1086 variables, 1/465 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1086 variables, 46/511 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1086 variables, 0/511 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 156/1242 variables, 72/583 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1242 variables, 36/619 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1242 variables, 0/619 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 509/1751 variables, 11/630 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1751 variables, 0/630 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 20 (OVERLAPS) 2/1753 variables, 1/631 constraints. Problems are: Problem set: 4 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:36:13] [INFO ] Deduced a trap composed of 119 places in 180 ms of which 22 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/1753 variables, 1/632 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1753 variables, 0/632 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 23 (OVERLAPS) 11/1764 variables, 6/638 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1764 variables, 3/641 constraints. Problems are: Problem set: 4 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:36:13] [INFO ] Deduced a trap composed of 3 places in 235 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:36:14] [INFO ] Deduced a trap composed of 3 places in 166 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:36:14] [INFO ] Deduced a trap composed of 3 places in 211 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:36:14] [INFO ] Deduced a trap composed of 3 places in 98 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:36:14] [INFO ] Deduced a trap composed of 3 places in 65 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:36:14] [INFO ] Deduced a trap composed of 32 places in 153 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:36:15] [INFO ] Deduced a trap composed of 20 places in 188 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:36:15] [INFO ] Deduced a trap composed of 44 places in 113 ms of which 10 ms to minimize.
At refinement iteration 25 (INCLUDED_ONLY) 0/1764 variables, 8/649 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1764 variables, 0/649 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 27 (OVERLAPS) 666/2430 variables, 522/1171 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/2430 variables, 310/1481 constraints. Problems are: Problem set: 4 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:36:15] [INFO ] Deduced a trap composed of 3 places in 105 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:36:16] [INFO ] Deduced a trap composed of 3 places in 75 ms of which 4 ms to minimize.
SMT process timed out in 8181ms, After SMT, problems are : Problem set: 4 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 357 ms.
Support contains 6 out of 1000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1000/1000 places, 4300/4300 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 1000 transition count 4290
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 990 transition count 4290
Performed 307 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 307 Pre rules applied. Total rules applied 20 place count 990 transition count 3983
Deduced a syphon composed of 307 places in 3 ms
Reduce places removed 307 places and 0 transitions.
Iterating global reduction 2 with 614 rules applied. Total rules applied 634 place count 683 transition count 3983
Performed 89 Post agglomeration using F-continuation condition.Transition count delta: 89
Deduced a syphon composed of 89 places in 2 ms
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 2 with 178 rules applied. Total rules applied 812 place count 594 transition count 3894
Applied a total of 812 rules in 223 ms. Remains 594 /1000 variables (removed 406) and now considering 3894/4300 (removed 406) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 223 ms. Remains : 594/1000 places, 3894/4300 transitions.
RANDOM walk for 40000 steps (8 resets) in 222 ms. (179 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 56 ms. (701 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 34 ms. (1142 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 33 ms. (1176 steps per ms) remains 3/3 properties
Finished probabilistic random walk after 143306 steps, run visited all 3 properties in 1702 ms. (steps per millisecond=84 )
Probabilistic random walk after 143306 steps, saw 102763 distinct states, run finished after 1703 ms. (steps per millisecond=84 ) properties seen :3
Found 4 invariant AP formulas.
Knowledge obtained : [(AND p2 p1 p0), (X p2), (X (X p2)), (G (OR p0 p2)), (G (OR p0 p2 p1)), (G (OR p0 p2 (NOT p1))), (G (OR (NOT p0) p2 p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (AND (OR (NOT p0) p2) (OR p2 (NOT p1))))), (F (NOT p2)), (F (NOT p1))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 7 factoid took 14 ms. Reduced automaton from 12 states, 18 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA EisenbergMcGuire-PT-10-LTLCardinality-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property EisenbergMcGuire-PT-10-LTLCardinality-08 finished in 57654 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 1001 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1001/1001 places, 4310/4310 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 1001 transition count 4300
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 991 transition count 4300
Performed 309 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 309 Pre rules applied. Total rules applied 20 place count 991 transition count 3991
Deduced a syphon composed of 309 places in 3 ms
Reduce places removed 309 places and 0 transitions.
Iterating global reduction 2 with 618 rules applied. Total rules applied 638 place count 682 transition count 3991
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 639 place count 681 transition count 3981
Iterating global reduction 2 with 1 rules applied. Total rules applied 640 place count 681 transition count 3981
Performed 89 Post agglomeration using F-continuation condition.Transition count delta: 89
Deduced a syphon composed of 89 places in 3 ms
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 2 with 178 rules applied. Total rules applied 818 place count 592 transition count 3892
Applied a total of 818 rules in 241 ms. Remains 592 /1001 variables (removed 409) and now considering 3892/4310 (removed 418) transitions.
[2025-06-02 09:36:18] [INFO ] Flow matrix only has 1022 transitions (discarded 2870 similar events)
// Phase 1: matrix 1022 rows 592 cols
[2025-06-02 09:36:18] [INFO ] Computed 31 invariants in 8 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:36:19] [INFO ] Implicit Places using invariants in 982 ms returned []
[2025-06-02 09:36:19] [INFO ] Flow matrix only has 1022 transitions (discarded 2870 similar events)
[2025-06-02 09:36:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:36:20] [INFO ] State equation strengthened by 436 read => feed constraints.
[2025-06-02 09:36:24] [INFO ] Implicit Places using invariants and state equation in 4983 ms returned []
Implicit Place search using SMT with State Equation took 5969 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 09:36:25] [INFO ] Redundant transitions in 220 ms returned []
Running 3882 sub problems to find dead transitions.
[2025-06-02 09:36:25] [INFO ] Flow matrix only has 1022 transitions (discarded 2870 similar events)
[2025-06-02 09:36:25] [INFO ] Invariant cache hit.
[2025-06-02 09:36:25] [INFO ] State equation strengthened by 436 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/592 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 3882 unsolved
SMT process timed out in 31731ms, After SMT, problems are : Problem set: 0 solved, 3882 unsolved
Search for dead transitions found 0 dead transitions in 31741ms
Starting structural reductions in SI_LTL mode, iteration 1 : 592/1001 places, 3892/4310 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 38191 ms. Remains : 592/1001 places, 3892/4310 transitions.
Stuttering acceptance computed with spot in 56 ms :[(NOT p0)]
Running random walk in product with property : EisenbergMcGuire-PT-10-LTLCardinality-09
Product exploration explored 100000 steps with 0 reset in 326 ms.
Stack based approach found an accepted trace after 11 steps with 0 reset with depth 12 and stack size 12 in 0 ms.
FORMULA EisenbergMcGuire-PT-10-LTLCardinality-09 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-10-LTLCardinality-09 finished in 38594 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G(p0)))))'
Support contains 2 out of 1001 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1001/1001 places, 4310/4310 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1000 transition count 4300
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1000 transition count 4300
Applied a total of 2 rules in 62 ms. Remains 1000 /1001 variables (removed 1) and now considering 4300/4310 (removed 10) transitions.
[2025-06-02 09:36:57] [INFO ] Flow matrix only has 1430 transitions (discarded 2870 similar events)
// Phase 1: matrix 1430 rows 1000 cols
[2025-06-02 09:36:57] [INFO ] Computed 31 invariants in 13 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:36:58] [INFO ] Implicit Places using invariants in 1512 ms returned []
[2025-06-02 09:36:58] [INFO ] Flow matrix only has 1430 transitions (discarded 2870 similar events)
[2025-06-02 09:36:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:36:59] [INFO ] State equation strengthened by 436 read => feed constraints.
[2025-06-02 09:37:09] [INFO ] Implicit Places using invariants and state equation in 10589 ms returned []
Implicit Place search using SMT with State Equation took 12105 ms to find 0 implicit places.
Running 4290 sub problems to find dead transitions.
[2025-06-02 09:37:09] [INFO ] Flow matrix only has 1430 transitions (discarded 2870 similar events)
[2025-06-02 09:37:09] [INFO ] Invariant cache hit.
[2025-06-02 09:37:09] [INFO ] State equation strengthened by 436 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1000 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 4290 unsolved
SMT process timed out in 32039ms, After SMT, problems are : Problem set: 0 solved, 4290 unsolved
Search for dead transitions found 0 dead transitions in 32048ms
Starting structural reductions in LTL mode, iteration 1 : 1000/1001 places, 4300/4310 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 44231 ms. Remains : 1000/1001 places, 4300/4310 transitions.
Stuttering acceptance computed with spot in 164 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : EisenbergMcGuire-PT-10-LTLCardinality-10
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA EisenbergMcGuire-PT-10-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property EisenbergMcGuire-PT-10-LTLCardinality-10 finished in 44427 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(G(p0)) U p1)))'
Support contains 4 out of 1001 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1001/1001 places, 4310/4310 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1000 transition count 4300
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1000 transition count 4300
Applied a total of 2 rules in 56 ms. Remains 1000 /1001 variables (removed 1) and now considering 4300/4310 (removed 10) transitions.
[2025-06-02 09:37:41] [INFO ] Flow matrix only has 1430 transitions (discarded 2870 similar events)
[2025-06-02 09:37:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:37:43] [INFO ] Implicit Places using invariants in 1495 ms returned []
[2025-06-02 09:37:43] [INFO ] Flow matrix only has 1430 transitions (discarded 2870 similar events)
[2025-06-02 09:37:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:37:43] [INFO ] State equation strengthened by 436 read => feed constraints.
[2025-06-02 09:37:53] [INFO ] Implicit Places using invariants and state equation in 10526 ms returned []
Implicit Place search using SMT with State Equation took 12027 ms to find 0 implicit places.
Running 4290 sub problems to find dead transitions.
[2025-06-02 09:37:53] [INFO ] Flow matrix only has 1430 transitions (discarded 2870 similar events)
[2025-06-02 09:37:53] [INFO ] Invariant cache hit.
[2025-06-02 09:37:53] [INFO ] State equation strengthened by 436 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1000 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 4290 unsolved
SMT process timed out in 31957ms, After SMT, problems are : Problem set: 0 solved, 4290 unsolved
Search for dead transitions found 0 dead transitions in 31965ms
Starting structural reductions in LTL mode, iteration 1 : 1000/1001 places, 4300/4310 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 44066 ms. Remains : 1000/1001 places, 4300/4310 transitions.
Stuttering acceptance computed with spot in 92 ms :[(NOT p1), (NOT p1), (NOT p0)]
Running random walk in product with property : EisenbergMcGuire-PT-10-LTLCardinality-11
Product exploration explored 100000 steps with 50000 reset in 669 ms.
Product exploration explored 100000 steps with 50000 reset in 700 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0), (X p1), (X (X p1)), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 16 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA EisenbergMcGuire-PT-10-LTLCardinality-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property EisenbergMcGuire-PT-10-LTLCardinality-11 finished in 45575 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(p1)||p0))))'
Support contains 4 out of 1001 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1001/1001 places, 4310/4310 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 1001 transition count 4300
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 991 transition count 4300
Performed 308 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 308 Pre rules applied. Total rules applied 20 place count 991 transition count 3992
Deduced a syphon composed of 308 places in 3 ms
Reduce places removed 308 places and 0 transitions.
Iterating global reduction 2 with 616 rules applied. Total rules applied 636 place count 683 transition count 3992
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 637 place count 682 transition count 3982
Iterating global reduction 2 with 1 rules applied. Total rules applied 638 place count 682 transition count 3982
Performed 89 Post agglomeration using F-continuation condition.Transition count delta: 89
Deduced a syphon composed of 89 places in 13 ms
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 2 with 178 rules applied. Total rules applied 816 place count 593 transition count 3893
Applied a total of 816 rules in 284 ms. Remains 593 /1001 variables (removed 408) and now considering 3893/4310 (removed 417) transitions.
[2025-06-02 09:38:27] [INFO ] Flow matrix only has 1023 transitions (discarded 2870 similar events)
// Phase 1: matrix 1023 rows 593 cols
[2025-06-02 09:38:27] [INFO ] Computed 31 invariants in 20 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:38:28] [INFO ] Implicit Places using invariants in 956 ms returned []
[2025-06-02 09:38:28] [INFO ] Flow matrix only has 1023 transitions (discarded 2870 similar events)
[2025-06-02 09:38:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:38:28] [INFO ] State equation strengthened by 436 read => feed constraints.
[2025-06-02 09:38:33] [INFO ] Implicit Places using invariants and state equation in 5116 ms returned []
Implicit Place search using SMT with State Equation took 6074 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 09:38:33] [INFO ] Redundant transitions in 276 ms returned []
Running 3883 sub problems to find dead transitions.
[2025-06-02 09:38:33] [INFO ] Flow matrix only has 1023 transitions (discarded 2870 similar events)
[2025-06-02 09:38:33] [INFO ] Invariant cache hit.
[2025-06-02 09:38:33] [INFO ] State equation strengthened by 436 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/593 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 3883 unsolved
SMT process timed out in 31821ms, After SMT, problems are : Problem set: 0 solved, 3883 unsolved
Search for dead transitions found 0 dead transitions in 31828ms
Starting structural reductions in SI_LTL mode, iteration 1 : 593/1001 places, 3893/4310 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 38481 ms. Remains : 593/1001 places, 3893/4310 transitions.
Stuttering acceptance computed with spot in 88 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : EisenbergMcGuire-PT-10-LTLCardinality-14
Product exploration explored 100000 steps with 0 reset in 309 ms.
Product exploration explored 100000 steps with 0 reset in 395 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X p0), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 111 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (8 resets) in 739 ms. (54 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 323 ms. (123 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 100 ms. (396 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 70 ms. (563 steps per ms) remains 3/3 properties
[2025-06-02 09:39:07] [INFO ] Flow matrix only has 1023 transitions (discarded 2870 similar events)
[2025-06-02 09:39:07] [INFO ] Invariant cache hit.
[2025-06-02 09:39:07] [INFO ] State equation strengthened by 436 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 221/225 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/225 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 2/227 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/227 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 8/235 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/235 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 411/646 variables, 235/247 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/646 variables, 44/291 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/646 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 118/764 variables, 10/301 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/764 variables, 1/302 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/764 variables, 48/350 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/764 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 156/920 variables, 72/422 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/920 variables, 39/461 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/920 variables, 0/461 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 264/1184 variables, 12/473 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1184 variables, 0/473 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 12/1196 variables, 6/479 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1196 variables, 0/479 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (OVERLAPS) 420/1616 variables, 276/755 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1616 variables, 305/1060 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1616 variables, 0/1060 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (OVERLAPS) 0/1616 variables, 0/1060 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1616/1616 variables, and 1060 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1096 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 593/593 constraints, ReadFeed: 436/436 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 221/225 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/225 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 2/227 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/227 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 8/235 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:39:08] [INFO ] Deduced a trap composed of 3 places in 84 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:39:08] [INFO ] Deduced a trap composed of 3 places in 52 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/235 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/235 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 411/646 variables, 235/249 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/646 variables, 44/293 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/646 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 118/764 variables, 10/303 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/764 variables, 1/304 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/764 variables, 48/352 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/764 variables, 0/352 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 156/920 variables, 72/424 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/920 variables, 39/463 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/920 variables, 0/463 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 264/1184 variables, 12/475 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1184 variables, 0/475 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (OVERLAPS) 12/1196 variables, 6/481 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1196 variables, 3/484 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:39:09] [INFO ] Deduced a trap composed of 3 places in 190 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:39:09] [INFO ] Deduced a trap composed of 3 places in 155 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:39:09] [INFO ] Deduced a trap composed of 3 places in 86 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:39:09] [INFO ] Deduced a trap composed of 3 places in 67 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:39:09] [INFO ] Deduced a trap composed of 36 places in 78 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:39:10] [INFO ] Deduced a trap composed of 21 places in 70 ms of which 3 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/1196 variables, 6/490 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1196 variables, 0/490 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (OVERLAPS) 420/1616 variables, 276/766 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1616 variables, 305/1071 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1616 variables, 0/1071 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 27 (OVERLAPS) 0/1616 variables, 0/1071 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1616/1616 variables, and 1071 constraints, problems are : Problem set: 0 solved, 3 unsolved in 3115 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 593/593 constraints, ReadFeed: 436/436 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4237ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 2 properties in 256 ms.
Support contains 4 out of 593 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 593/593 places, 3893/3893 transitions.
Applied a total of 0 rules in 185 ms. Remains 593 /593 variables (removed 0) and now considering 3893/3893 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 185 ms. Remains : 593/593 places, 3893/3893 transitions.
RANDOM walk for 40000 steps (8 resets) in 214 ms. (186 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 71 ms. (555 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 334466 steps, run timeout after 3001 ms. (steps per millisecond=111 ) properties seen :0 out of 1
Probabilistic random walk after 334466 steps, saw 225192 distinct states, run finished after 3001 ms. (steps per millisecond=111 ) properties seen :0
[2025-06-02 09:39:14] [INFO ] Flow matrix only has 1023 transitions (discarded 2870 similar events)
[2025-06-02 09:39:14] [INFO ] Invariant cache hit.
[2025-06-02 09:39:14] [INFO ] State equation strengthened by 436 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 221/225 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/225 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/227 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/227 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 8/235 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/235 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 411/646 variables, 235/247 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/646 variables, 44/291 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/646 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 118/764 variables, 10/301 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/764 variables, 1/302 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/764 variables, 48/350 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/764 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 156/920 variables, 72/422 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/920 variables, 39/461 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/920 variables, 0/461 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 264/1184 variables, 12/473 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1184 variables, 0/473 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 12/1196 variables, 6/479 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1196 variables, 0/479 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 420/1616 variables, 276/755 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1616 variables, 305/1060 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1616 variables, 0/1060 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/1616 variables, 0/1060 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1616/1616 variables, and 1060 constraints, problems are : Problem set: 0 solved, 1 unsolved in 525 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 593/593 constraints, ReadFeed: 436/436 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 221/225 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/225 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/227 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/227 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 8/235 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/235 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 411/646 variables, 235/247 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/646 variables, 44/291 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:39:15] [INFO ] Deduced a trap composed of 3 places in 54 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/646 variables, 1/292 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/646 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 118/764 variables, 10/302 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/764 variables, 1/303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/764 variables, 48/351 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/764 variables, 0/351 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 156/920 variables, 72/423 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/920 variables, 39/462 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:39:15] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 2 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/920 variables, 1/463 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/920 variables, 0/463 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 264/1184 variables, 12/475 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1184 variables, 0/475 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 12/1196 variables, 6/481 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1196 variables, 1/482 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:39:16] [INFO ] Deduced a trap composed of 3 places in 287 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:39:16] [INFO ] Deduced a trap composed of 3 places in 241 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:39:16] [INFO ] Deduced a trap composed of 3 places in 157 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:39:16] [INFO ] Deduced a trap composed of 3 places in 214 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:39:17] [INFO ] Deduced a trap composed of 3 places in 150 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:39:17] [INFO ] Deduced a trap composed of 3 places in 100 ms of which 5 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/1196 variables, 6/488 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:39:17] [INFO ] Deduced a trap composed of 3 places in 170 ms of which 8 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/1196 variables, 1/489 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:39:17] [INFO ] Deduced a trap composed of 33 places in 109 ms of which 7 ms to minimize.
At refinement iteration 25 (INCLUDED_ONLY) 0/1196 variables, 1/490 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1196 variables, 0/490 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 420/1616 variables, 276/766 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1616 variables, 305/1071 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/1616 variables, 0/1071 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:39:18] [INFO ] Deduced a trap composed of 11 places in 134 ms of which 9 ms to minimize.
At refinement iteration 30 (OVERLAPS) 0/1616 variables, 1/1072 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/1616 variables, 0/1072 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (OVERLAPS) 0/1616 variables, 0/1072 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1616/1616 variables, and 1072 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3112 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 593/593 constraints, ReadFeed: 436/436 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3658ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 72 ms.
Support contains 4 out of 593 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 593/593 places, 3893/3893 transitions.
Applied a total of 0 rules in 143 ms. Remains 593 /593 variables (removed 0) and now considering 3893/3893 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 143 ms. Remains : 593/593 places, 3893/3893 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 593/593 places, 3893/3893 transitions.
Applied a total of 0 rules in 152 ms. Remains 593 /593 variables (removed 0) and now considering 3893/3893 (removed 0) transitions.
[2025-06-02 09:39:18] [INFO ] Flow matrix only has 1023 transitions (discarded 2870 similar events)
[2025-06-02 09:39:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:39:19] [INFO ] Implicit Places using invariants in 991 ms returned []
[2025-06-02 09:39:19] [INFO ] Flow matrix only has 1023 transitions (discarded 2870 similar events)
[2025-06-02 09:39:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:39:20] [INFO ] State equation strengthened by 436 read => feed constraints.
[2025-06-02 09:39:24] [INFO ] Implicit Places using invariants and state equation in 4960 ms returned []
Implicit Place search using SMT with State Equation took 5954 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 09:39:24] [INFO ] Redundant transitions in 214 ms returned []
Running 3883 sub problems to find dead transitions.
[2025-06-02 09:39:25] [INFO ] Flow matrix only has 1023 transitions (discarded 2870 similar events)
[2025-06-02 09:39:25] [INFO ] Invariant cache hit.
[2025-06-02 09:39:25] [INFO ] State equation strengthened by 436 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/593 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 3883 unsolved
SMT process timed out in 31801ms, After SMT, problems are : Problem set: 0 solved, 3883 unsolved
Search for dead transitions found 0 dead transitions in 31809ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38150 ms. Remains : 593/593 places, 3893/3893 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 3635 edges and 593 vertex of which 99 / 593 are part of one of the 10 SCC in 3 ms
Free SCC test removed 89 places
Drop transitions (Empty/Sink Transition effects.) removed 345 transitions
Ensure Unique test removed 2792 transitions
Reduce isomorphic transitions removed 3137 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 117 transitions
Trivial Post-agglo rules discarded 117 transitions
Performed 117 trivial Post agglomeration. Transition count delta: 117
Iterating post reduction 0 with 117 rules applied. Total rules applied 118 place count 504 transition count 639
Reduce places removed 117 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 118 rules applied. Total rules applied 236 place count 387 transition count 638
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 237 place count 386 transition count 638
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 19 Pre rules applied. Total rules applied 237 place count 386 transition count 619
Deduced a syphon composed of 19 places in 0 ms
Ensure Unique test removed 8 places
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 3 with 46 rules applied. Total rules applied 283 place count 359 transition count 619
Performed 178 Post agglomeration using F-continuation condition.Transition count delta: 178
Deduced a syphon composed of 178 places in 0 ms
Reduce places removed 178 places and 0 transitions.
Iterating global reduction 3 with 356 rules applied. Total rules applied 639 place count 181 transition count 441
Ensure Unique test removed 87 transitions
Reduce isomorphic transitions removed 87 transitions.
Iterating post reduction 3 with 87 rules applied. Total rules applied 726 place count 181 transition count 354
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 18 rules applied. Total rules applied 744 place count 172 transition count 355
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 752 place count 172 transition count 347
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 5 with 9 rules applied. Total rules applied 761 place count 172 transition count 338
Free-agglomeration rule applied 92 times.
Iterating global reduction 5 with 92 rules applied. Total rules applied 853 place count 172 transition count 246
Reduce places removed 92 places and 0 transitions.
Iterating post reduction 5 with 92 rules applied. Total rules applied 945 place count 80 transition count 246
Partial Free-agglomeration rule applied 10 times.
Drop transitions (Partial Free agglomeration) removed 10 transitions
Iterating global reduction 6 with 10 rules applied. Total rules applied 955 place count 80 transition count 246
Applied a total of 955 rules in 75 ms. Remains 80 /593 variables (removed 513) and now considering 246/3893 (removed 3647) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 246 rows 80 cols
[2025-06-02 09:39:56] [INFO ] Computed 23 invariants in 1 ms
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-02 09:39:56] [INFO ] After 38ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-02 09:39:56] [INFO ] [Nat]Absence check using 21 positive place invariants in 3 ms returned sat
[2025-06-02 09:39:56] [INFO ] [Nat]Absence check using 21 positive and 2 generalized place invariants in 3 ms returned sat
[2025-06-02 09:39:57] [INFO ] After 40ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2025-06-02 09:39:57] [INFO ] State equation strengthened by 8 read => feed constraints.
[2025-06-02 09:39:57] [INFO ] After 14ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:39:57] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 2 ms to minimize.
[2025-06-02 09:39:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 35 ms
TRAPS : Iteration 1
[2025-06-02 09:39:57] [INFO ] After 69ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-06-02 09:39:57] [INFO ] After 158ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 293 ms.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X p0), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR p0 (NOT p1)))), (F (NOT p0))]
Knowledge based reduction with 9 factoid took 198 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 88 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 593 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 593/593 places, 3893/3893 transitions.
Applied a total of 0 rules in 231 ms. Remains 593 /593 variables (removed 0) and now considering 3893/3893 (removed 0) transitions.
[2025-06-02 09:39:57] [INFO ] Flow matrix only has 1023 transitions (discarded 2870 similar events)
// Phase 1: matrix 1023 rows 593 cols
[2025-06-02 09:39:57] [INFO ] Computed 31 invariants in 12 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:39:58] [INFO ] Implicit Places using invariants in 988 ms returned []
[2025-06-02 09:39:58] [INFO ] Flow matrix only has 1023 transitions (discarded 2870 similar events)
[2025-06-02 09:39:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:39:59] [INFO ] State equation strengthened by 436 read => feed constraints.
[2025-06-02 09:40:03] [INFO ] Implicit Places using invariants and state equation in 4895 ms returned []
Implicit Place search using SMT with State Equation took 5886 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 09:40:03] [INFO ] Redundant transitions in 202 ms returned []
Running 3883 sub problems to find dead transitions.
[2025-06-02 09:40:03] [INFO ] Flow matrix only has 1023 transitions (discarded 2870 similar events)
[2025-06-02 09:40:03] [INFO ] Invariant cache hit.
[2025-06-02 09:40:03] [INFO ] State equation strengthened by 436 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/593 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 3883 unsolved
SMT process timed out in 31788ms, After SMT, problems are : Problem set: 0 solved, 3883 unsolved
Search for dead transitions found 0 dead transitions in 31793ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 38122 ms. Remains : 593/593 places, 3893/3893 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 110 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 62 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (8 resets) in 260 ms. (153 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 41 ms. (952 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 32 ms. (1212 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 30 ms. (1290 steps per ms) remains 3/3 properties
[2025-06-02 09:40:35] [INFO ] Flow matrix only has 1023 transitions (discarded 2870 similar events)
[2025-06-02 09:40:35] [INFO ] Invariant cache hit.
[2025-06-02 09:40:35] [INFO ] State equation strengthened by 436 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 221/225 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/225 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 2/227 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/227 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 8/235 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/235 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 411/646 variables, 235/247 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/646 variables, 44/291 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/646 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 118/764 variables, 10/301 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/764 variables, 1/302 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/764 variables, 48/350 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/764 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 156/920 variables, 72/422 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/920 variables, 39/461 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/920 variables, 0/461 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 264/1184 variables, 12/473 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1184 variables, 0/473 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 12/1196 variables, 6/479 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1196 variables, 0/479 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (OVERLAPS) 420/1616 variables, 276/755 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1616 variables, 305/1060 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1616 variables, 0/1060 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (OVERLAPS) 0/1616 variables, 0/1060 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1616/1616 variables, and 1060 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1050 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 593/593 constraints, ReadFeed: 436/436 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 221/225 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/225 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 2/227 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/227 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 8/235 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:40:37] [INFO ] Deduced a trap composed of 3 places in 79 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:40:37] [INFO ] Deduced a trap composed of 3 places in 58 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/235 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/235 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 411/646 variables, 235/249 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/646 variables, 44/293 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/646 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 118/764 variables, 10/303 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/764 variables, 1/304 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/764 variables, 48/352 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/764 variables, 0/352 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 156/920 variables, 72/424 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/920 variables, 39/463 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/920 variables, 0/463 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 264/1184 variables, 12/475 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1184 variables, 0/475 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (OVERLAPS) 12/1196 variables, 6/481 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1196 variables, 3/484 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:40:38] [INFO ] Deduced a trap composed of 3 places in 166 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:40:38] [INFO ] Deduced a trap composed of 3 places in 152 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:40:38] [INFO ] Deduced a trap composed of 3 places in 94 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:40:38] [INFO ] Deduced a trap composed of 3 places in 118 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:40:38] [INFO ] Deduced a trap composed of 36 places in 151 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:40:39] [INFO ] Deduced a trap composed of 21 places in 82 ms of which 3 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/1196 variables, 6/490 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1196 variables, 0/490 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (OVERLAPS) 420/1616 variables, 276/766 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1616 variables, 305/1071 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1616 variables, 0/1071 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 27 (OVERLAPS) 0/1616 variables, 0/1071 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1616/1616 variables, and 1071 constraints, problems are : Problem set: 0 solved, 3 unsolved in 3221 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 593/593 constraints, ReadFeed: 436/436 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4283ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 2 properties in 242 ms.
Support contains 4 out of 593 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 593/593 places, 3893/3893 transitions.
Applied a total of 0 rules in 159 ms. Remains 593 /593 variables (removed 0) and now considering 3893/3893 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 159 ms. Remains : 593/593 places, 3893/3893 transitions.
RANDOM walk for 40000 steps (8 resets) in 171 ms. (232 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 39 ms. (1000 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 327140 steps, run timeout after 3001 ms. (steps per millisecond=109 ) properties seen :0 out of 1
Probabilistic random walk after 327140 steps, saw 220562 distinct states, run finished after 3001 ms. (steps per millisecond=109 ) properties seen :0
[2025-06-02 09:40:43] [INFO ] Flow matrix only has 1023 transitions (discarded 2870 similar events)
[2025-06-02 09:40:43] [INFO ] Invariant cache hit.
[2025-06-02 09:40:43] [INFO ] State equation strengthened by 436 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 221/225 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/225 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/227 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/227 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 8/235 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/235 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 411/646 variables, 235/247 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/646 variables, 44/291 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/646 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 118/764 variables, 10/301 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/764 variables, 1/302 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/764 variables, 48/350 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/764 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 156/920 variables, 72/422 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/920 variables, 39/461 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/920 variables, 0/461 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 264/1184 variables, 12/473 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1184 variables, 0/473 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 12/1196 variables, 6/479 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1196 variables, 0/479 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 420/1616 variables, 276/755 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1616 variables, 305/1060 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1616 variables, 0/1060 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/1616 variables, 0/1060 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1616/1616 variables, and 1060 constraints, problems are : Problem set: 0 solved, 1 unsolved in 519 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 593/593 constraints, ReadFeed: 436/436 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 221/225 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/225 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/227 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/227 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 8/235 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/235 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 411/646 variables, 235/247 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/646 variables, 44/291 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:40:44] [INFO ] Deduced a trap composed of 3 places in 54 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/646 variables, 1/292 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/646 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 118/764 variables, 10/302 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/764 variables, 1/303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/764 variables, 48/351 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/764 variables, 0/351 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 156/920 variables, 72/423 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/920 variables, 39/462 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:40:44] [INFO ] Deduced a trap composed of 3 places in 57 ms of which 2 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/920 variables, 1/463 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/920 variables, 0/463 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 264/1184 variables, 12/475 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1184 variables, 0/475 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 12/1196 variables, 6/481 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1196 variables, 1/482 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:40:45] [INFO ] Deduced a trap composed of 3 places in 319 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:40:45] [INFO ] Deduced a trap composed of 3 places in 284 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:40:45] [INFO ] Deduced a trap composed of 3 places in 179 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:40:45] [INFO ] Deduced a trap composed of 3 places in 233 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:40:46] [INFO ] Deduced a trap composed of 3 places in 166 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:40:46] [INFO ] Deduced a trap composed of 3 places in 107 ms of which 5 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/1196 variables, 6/488 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:40:46] [INFO ] Deduced a trap composed of 3 places in 159 ms of which 7 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/1196 variables, 1/489 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:40:46] [INFO ] Deduced a trap composed of 33 places in 111 ms of which 7 ms to minimize.
At refinement iteration 25 (INCLUDED_ONLY) 0/1196 variables, 1/490 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1196 variables, 0/490 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 420/1616 variables, 276/766 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1616 variables, 305/1071 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/1616 variables, 0/1071 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:40:47] [INFO ] Deduced a trap composed of 11 places in 130 ms of which 9 ms to minimize.
At refinement iteration 30 (OVERLAPS) 0/1616 variables, 1/1072 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/1616 variables, 0/1072 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (OVERLAPS) 0/1616 variables, 0/1072 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1616/1616 variables, and 1072 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3280 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 593/593 constraints, ReadFeed: 436/436 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3812ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 56 ms.
Support contains 4 out of 593 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 593/593 places, 3893/3893 transitions.
Applied a total of 0 rules in 135 ms. Remains 593 /593 variables (removed 0) and now considering 3893/3893 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 135 ms. Remains : 593/593 places, 3893/3893 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 593/593 places, 3893/3893 transitions.
Applied a total of 0 rules in 141 ms. Remains 593 /593 variables (removed 0) and now considering 3893/3893 (removed 0) transitions.
[2025-06-02 09:40:47] [INFO ] Flow matrix only has 1023 transitions (discarded 2870 similar events)
[2025-06-02 09:40:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:40:48] [INFO ] Implicit Places using invariants in 955 ms returned []
[2025-06-02 09:40:48] [INFO ] Flow matrix only has 1023 transitions (discarded 2870 similar events)
[2025-06-02 09:40:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:40:49] [INFO ] State equation strengthened by 436 read => feed constraints.
[2025-06-02 09:40:53] [INFO ] Implicit Places using invariants and state equation in 4957 ms returned []
Implicit Place search using SMT with State Equation took 5922 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 09:40:53] [INFO ] Redundant transitions in 198 ms returned []
Running 3883 sub problems to find dead transitions.
[2025-06-02 09:40:53] [INFO ] Flow matrix only has 1023 transitions (discarded 2870 similar events)
[2025-06-02 09:40:53] [INFO ] Invariant cache hit.
[2025-06-02 09:40:53] [INFO ] State equation strengthened by 436 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/593 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 3883 unsolved
SMT process timed out in 31789ms, After SMT, problems are : Problem set: 0 solved, 3883 unsolved
Search for dead transitions found 0 dead transitions in 31794ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38072 ms. Remains : 593/593 places, 3893/3893 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 3635 edges and 593 vertex of which 99 / 593 are part of one of the 10 SCC in 2 ms
Free SCC test removed 89 places
Drop transitions (Empty/Sink Transition effects.) removed 345 transitions
Ensure Unique test removed 2792 transitions
Reduce isomorphic transitions removed 3137 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 117 transitions
Trivial Post-agglo rules discarded 117 transitions
Performed 117 trivial Post agglomeration. Transition count delta: 117
Iterating post reduction 0 with 117 rules applied. Total rules applied 118 place count 504 transition count 639
Reduce places removed 117 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 118 rules applied. Total rules applied 236 place count 387 transition count 638
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 237 place count 386 transition count 638
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 19 Pre rules applied. Total rules applied 237 place count 386 transition count 619
Deduced a syphon composed of 19 places in 0 ms
Ensure Unique test removed 8 places
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 3 with 46 rules applied. Total rules applied 283 place count 359 transition count 619
Performed 178 Post agglomeration using F-continuation condition.Transition count delta: 178
Deduced a syphon composed of 178 places in 0 ms
Reduce places removed 178 places and 0 transitions.
Iterating global reduction 3 with 356 rules applied. Total rules applied 639 place count 181 transition count 441
Ensure Unique test removed 87 transitions
Reduce isomorphic transitions removed 87 transitions.
Iterating post reduction 3 with 87 rules applied. Total rules applied 726 place count 181 transition count 354
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 18 rules applied. Total rules applied 744 place count 172 transition count 355
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 752 place count 172 transition count 347
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 5 with 9 rules applied. Total rules applied 761 place count 172 transition count 338
Free-agglomeration rule applied 92 times.
Iterating global reduction 5 with 92 rules applied. Total rules applied 853 place count 172 transition count 246
Reduce places removed 92 places and 0 transitions.
Iterating post reduction 5 with 92 rules applied. Total rules applied 945 place count 80 transition count 246
Partial Free-agglomeration rule applied 10 times.
Drop transitions (Partial Free agglomeration) removed 10 transitions
Iterating global reduction 6 with 10 rules applied. Total rules applied 955 place count 80 transition count 246
Applied a total of 955 rules in 39 ms. Remains 80 /593 variables (removed 513) and now considering 246/3893 (removed 3647) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 246 rows 80 cols
[2025-06-02 09:41:25] [INFO ] Computed 23 invariants in 2 ms
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-02 09:41:25] [INFO ] After 24ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-02 09:41:25] [INFO ] [Nat]Absence check using 21 positive place invariants in 3 ms returned sat
[2025-06-02 09:41:25] [INFO ] [Nat]Absence check using 21 positive and 2 generalized place invariants in 0 ms returned sat
[2025-06-02 09:41:25] [INFO ] After 48ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2025-06-02 09:41:25] [INFO ] State equation strengthened by 8 read => feed constraints.
[2025-06-02 09:41:25] [INFO ] After 7ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:41:25] [INFO ] Deduced a trap composed of 2 places in 27 ms of which 2 ms to minimize.
[2025-06-02 09:41:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 47 ms
TRAPS : Iteration 1
[2025-06-02 09:41:26] [INFO ] After 76ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-06-02 09:41:26] [INFO ] After 165ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 241 ms.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR p0 (NOT p1)))), (F (NOT p0))]
Knowledge based reduction with 9 factoid took 217 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 0 reset in 315 ms.
Product exploration explored 100000 steps with 0 reset in 367 ms.
Built C files in :
/tmp/ltsmin1786357580537787083
[2025-06-02 09:41:27] [INFO ] Too many transitions (3893) to apply POR reductions. Disabling POR matrices.
[2025-06-02 09:41:27] [INFO ] Built C files in 63ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1786357580537787083
Running compilation step : cd /tmp/ltsmin1786357580537787083;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1786357580537787083;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1786357580537787083;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
Support contains 4 out of 593 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 593/593 places, 3893/3893 transitions.
Applied a total of 0 rules in 153 ms. Remains 593 /593 variables (removed 0) and now considering 3893/3893 (removed 0) transitions.
[2025-06-02 09:41:30] [INFO ] Flow matrix only has 1023 transitions (discarded 2870 similar events)
// Phase 1: matrix 1023 rows 593 cols
[2025-06-02 09:41:30] [INFO ] Computed 31 invariants in 10 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:41:31] [INFO ] Implicit Places using invariants in 980 ms returned []
[2025-06-02 09:41:31] [INFO ] Flow matrix only has 1023 transitions (discarded 2870 similar events)
[2025-06-02 09:41:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:41:31] [INFO ] State equation strengthened by 436 read => feed constraints.
[2025-06-02 09:41:36] [INFO ] Implicit Places using invariants and state equation in 4900 ms returned []
Implicit Place search using SMT with State Equation took 5882 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 09:41:36] [INFO ] Redundant transitions in 203 ms returned []
Running 3883 sub problems to find dead transitions.
[2025-06-02 09:41:36] [INFO ] Flow matrix only has 1023 transitions (discarded 2870 similar events)
[2025-06-02 09:41:36] [INFO ] Invariant cache hit.
[2025-06-02 09:41:36] [INFO ] State equation strengthened by 436 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/593 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 3883 unsolved
SMT process timed out in 31731ms, After SMT, problems are : Problem set: 0 solved, 3883 unsolved
Search for dead transitions found 0 dead transitions in 31736ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 37990 ms. Remains : 593/593 places, 3893/3893 transitions.
Built C files in :
/tmp/ltsmin5688736294539429893
[2025-06-02 09:42:08] [INFO ] Too many transitions (3893) to apply POR reductions. Disabling POR matrices.
[2025-06-02 09:42:08] [INFO ] Built C files in 33ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5688736294539429893
Running compilation step : cd /tmp/ltsmin5688736294539429893;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5688736294539429893;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5688736294539429893;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
[2025-06-02 09:42:11] [INFO ] Flatten gal took : 293 ms
[2025-06-02 09:42:12] [INFO ] Flatten gal took : 171 ms
[2025-06-02 09:42:12] [INFO ] Time to serialize gal into /tmp/LTL10057260021012502721.gal : 31 ms
[2025-06-02 09:42:12] [INFO ] Time to serialize properties into /tmp/LTL17887446240388358681.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10057260021012502721.gal' '-t' 'CGAL' '-hoa' '/tmp/aut13435664067981497331.hoa' '-atoms' '/tmp/LTL17887446240388358681.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...320
Loading property file /tmp/LTL17887446240388358681.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut13435664067981497331.hoa
Detected timeout of ITS tools.
[2025-06-02 09:42:27] [INFO ] Flatten gal took : 109 ms
[2025-06-02 09:42:27] [INFO ] Flatten gal took : 111 ms
[2025-06-02 09:42:27] [INFO ] Time to serialize gal into /tmp/LTL12496617356728818967.gal : 18 ms
[2025-06-02 09:42:27] [INFO ] Time to serialize properties into /tmp/LTL12255125711456808.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12496617356728818967.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12255125711456808.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...274
Read 1 LTL properties
Checking formula 0 : !((G(F(("((p25_1_2==0)||(p09_8_9==1))")||(G("((p12_7_8==0)||(p18_4_9==1))"))))))
Formula 0 simplified : G(F!"((p12_7_8==0)||(p18_4_9==1))" & FG!"((p25_1_2==0)||(p09_8_9==1))")
Detected timeout of ITS tools.
[2025-06-02 09:42:42] [INFO ] Flatten gal took : 145 ms
[2025-06-02 09:42:42] [INFO ] Applying decomposition
[2025-06-02 09:42:42] [INFO ] Flatten gal took : 84 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph5219636872118688804.txt' '-o' '/tmp/graph5219636872118688804.bin' '-w' '/tmp/graph5219636872118688804.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph5219636872118688804.bin' '-l' '-1' '-v' '-w' '/tmp/graph5219636872118688804.weights' '-q' '0' '-e' '0.001'
[2025-06-02 09:42:42] [INFO ] Decomposing Gal with order
[2025-06-02 09:42:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 09:42:43] [INFO ] Removed a total of 8694 redundant transitions.
[2025-06-02 09:42:43] [INFO ] Flatten gal took : 390 ms
[2025-06-02 09:42:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 821 labels/synchronizations in 181 ms.
[2025-06-02 09:42:43] [INFO ] Time to serialize gal into /tmp/LTL4577620170258572695.gal : 24 ms
[2025-06-02 09:42:43] [INFO ] Time to serialize properties into /tmp/LTL1699526102193178636.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4577620170258572695.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1699526102193178636.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((G(F(("((i1.u1.p25_1_2==0)||(u17.p09_8_9==1))")||(G("((u16.p12_7_8==0)||(i2.u4.p18_4_9==1))"))))))
Formula 0 simplified : G(F!"((u16.p12_7_8==0)||(i2.u4.p18_4_9==1))" & FG!"((i1.u1.p25_1_2==0)||(u17.p09_8_9==1))")
Detected timeout of ITS tools.
Treatment of property EisenbergMcGuire-PT-10-LTLCardinality-14 finished in 271768 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(X(F(p0)))))))'
Found a Shortening insensitive property : EisenbergMcGuire-PT-10-LTLCardinality-06
Stuttering acceptance computed with spot in 207 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 1001 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1001/1001 places, 4310/4310 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 1001 transition count 4300
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 991 transition count 4300
Performed 308 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 308 Pre rules applied. Total rules applied 20 place count 991 transition count 3992
Deduced a syphon composed of 308 places in 3 ms
Reduce places removed 308 places and 0 transitions.
Iterating global reduction 2 with 616 rules applied. Total rules applied 636 place count 683 transition count 3992
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 637 place count 682 transition count 3982
Iterating global reduction 2 with 1 rules applied. Total rules applied 638 place count 682 transition count 3982
Performed 90 Post agglomeration using F-continuation condition.Transition count delta: 90
Deduced a syphon composed of 90 places in 3 ms
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 2 with 180 rules applied. Total rules applied 818 place count 592 transition count 3892
Applied a total of 818 rules in 148 ms. Remains 592 /1001 variables (removed 409) and now considering 3892/4310 (removed 418) transitions.
[2025-06-02 09:42:59] [INFO ] Flow matrix only has 1022 transitions (discarded 2870 similar events)
// Phase 1: matrix 1022 rows 592 cols
[2025-06-02 09:42:59] [INFO ] Computed 31 invariants in 8 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:43:00] [INFO ] Implicit Places using invariants in 1007 ms returned []
[2025-06-02 09:43:00] [INFO ] Flow matrix only has 1022 transitions (discarded 2870 similar events)
[2025-06-02 09:43:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:43:00] [INFO ] State equation strengthened by 436 read => feed constraints.
[2025-06-02 09:43:05] [INFO ] Implicit Places using invariants and state equation in 5295 ms returned []
Implicit Place search using SMT with State Equation took 6304 ms to find 0 implicit places.
Running 3882 sub problems to find dead transitions.
[2025-06-02 09:43:05] [INFO ] Flow matrix only has 1022 transitions (discarded 2870 similar events)
[2025-06-02 09:43:05] [INFO ] Invariant cache hit.
[2025-06-02 09:43:05] [INFO ] State equation strengthened by 436 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/592 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 3882 unsolved
SMT process timed out in 31757ms, After SMT, problems are : Problem set: 0 solved, 3882 unsolved
Search for dead transitions found 0 dead transitions in 31762ms
Starting structural reductions in LI_LTL mode, iteration 1 : 592/1001 places, 3892/4310 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 38224 ms. Remains : 592/1001 places, 3892/4310 transitions.
Running random walk in product with property : EisenbergMcGuire-PT-10-LTLCardinality-06
Product exploration explored 100000 steps with 16666 reset in 608 ms.
Product exploration explored 100000 steps with 16666 reset in 547 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 85 ms. Reduced automaton from 6 states, 6 edges and 1 AP (stutter sensitive) to 6 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 240 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 3233 steps (0 resets) in 24 ms. (129 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 102 ms. Reduced automaton from 6 states, 6 edges and 1 AP (stutter sensitive) to 6 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 240 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 242 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 592 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 592/592 places, 3892/3892 transitions.
Applied a total of 0 rules in 23 ms. Remains 592 /592 variables (removed 0) and now considering 3892/3892 (removed 0) transitions.
[2025-06-02 09:43:39] [INFO ] Flow matrix only has 1022 transitions (discarded 2870 similar events)
[2025-06-02 09:43:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:43:40] [INFO ] Implicit Places using invariants in 970 ms returned []
[2025-06-02 09:43:40] [INFO ] Flow matrix only has 1022 transitions (discarded 2870 similar events)
[2025-06-02 09:43:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:43:40] [INFO ] State equation strengthened by 436 read => feed constraints.
[2025-06-02 09:43:45] [INFO ] Implicit Places using invariants and state equation in 5320 ms returned []
Implicit Place search using SMT with State Equation took 6292 ms to find 0 implicit places.
Running 3882 sub problems to find dead transitions.
[2025-06-02 09:43:45] [INFO ] Flow matrix only has 1022 transitions (discarded 2870 similar events)
[2025-06-02 09:43:45] [INFO ] Invariant cache hit.
[2025-06-02 09:43:45] [INFO ] State equation strengthened by 436 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/592 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 3882 unsolved
SMT process timed out in 31678ms, After SMT, problems are : Problem set: 0 solved, 3882 unsolved
Search for dead transitions found 0 dead transitions in 31684ms
Finished structural reductions in LTL mode , in 1 iterations and 38008 ms. Remains : 592/592 places, 3892/3892 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 88 ms. Reduced automaton from 6 states, 6 edges and 1 AP (stutter sensitive) to 6 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 253 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 3763 steps (0 resets) in 22 ms. (163 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 115 ms. Reduced automaton from 6 states, 6 edges and 1 AP (stutter sensitive) to 6 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 231 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 204 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 238 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 16666 reset in 603 ms.
Product exploration explored 100000 steps with 16666 reset in 637 ms.
Applying partial POR strategy [true, false, false, false, false, false]
Stuttering acceptance computed with spot in 252 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 592 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 592/592 places, 3892/3892 transitions.
Applied a total of 0 rules in 147 ms. Remains 592 /592 variables (removed 0) and now considering 3892/3892 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 09:44:20] [INFO ] Redundant transitions in 203 ms returned []
Running 3882 sub problems to find dead transitions.
[2025-06-02 09:44:20] [INFO ] Flow matrix only has 1022 transitions (discarded 2870 similar events)
[2025-06-02 09:44:20] [INFO ] Invariant cache hit.
[2025-06-02 09:44:20] [INFO ] State equation strengthened by 436 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/592 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 3882 unsolved
SMT process timed out in 31798ms, After SMT, problems are : Problem set: 0 solved, 3882 unsolved
Search for dead transitions found 0 dead transitions in 31803ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 32166 ms. Remains : 592/592 places, 3892/3892 transitions.
Built C files in :
/tmp/ltsmin6546004531220405415
[2025-06-02 09:44:52] [INFO ] Built C files in 31ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6546004531220405415
Running compilation step : cd /tmp/ltsmin6546004531220405415;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6546004531220405415;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6546004531220405415;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
Support contains 2 out of 592 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 592/592 places, 3892/3892 transitions.
Applied a total of 0 rules in 20 ms. Remains 592 /592 variables (removed 0) and now considering 3892/3892 (removed 0) transitions.
[2025-06-02 09:44:55] [INFO ] Flow matrix only has 1022 transitions (discarded 2870 similar events)
[2025-06-02 09:44:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:44:56] [INFO ] Implicit Places using invariants in 997 ms returned []
[2025-06-02 09:44:56] [INFO ] Flow matrix only has 1022 transitions (discarded 2870 similar events)
[2025-06-02 09:44:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:44:56] [INFO ] State equation strengthened by 436 read => feed constraints.
[2025-06-02 09:45:02] [INFO ] Implicit Places using invariants and state equation in 5450 ms returned []
Implicit Place search using SMT with State Equation took 6451 ms to find 0 implicit places.
Running 3882 sub problems to find dead transitions.
[2025-06-02 09:45:02] [INFO ] Flow matrix only has 1022 transitions (discarded 2870 similar events)
[2025-06-02 09:45:02] [INFO ] Invariant cache hit.
[2025-06-02 09:45:02] [INFO ] State equation strengthened by 436 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/592 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 3882 unsolved
SMT process timed out in 31781ms, After SMT, problems are : Problem set: 0 solved, 3882 unsolved
Search for dead transitions found 0 dead transitions in 31787ms
Finished structural reductions in LTL mode , in 1 iterations and 38277 ms. Remains : 592/592 places, 3892/3892 transitions.
Built C files in :
/tmp/ltsmin213839172163216812
[2025-06-02 09:45:33] [INFO ] Built C files in 37ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin213839172163216812
Running compilation step : cd /tmp/ltsmin213839172163216812;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin213839172163216812;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin213839172163216812;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
[2025-06-02 09:45:37] [INFO ] Flatten gal took : 88 ms
[2025-06-02 09:45:37] [INFO ] Flatten gal took : 91 ms
[2025-06-02 09:45:37] [INFO ] Time to serialize gal into /tmp/LTL4999206971563691853.gal : 13 ms
[2025-06-02 09:45:37] [INFO ] Time to serialize properties into /tmp/LTL6289190744270286496.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4999206971563691853.gal' '-t' 'CGAL' '-hoa' '/tmp/aut954388362660649407.hoa' '-atoms' '/tmp/LTL6289190744270286496.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...316
Loading property file /tmp/LTL6289190744270286496.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut954388362660649407.hoa
Detected timeout of ITS tools.
[2025-06-02 09:45:52] [INFO ] Flatten gal took : 86 ms
[2025-06-02 09:45:52] [INFO ] Flatten gal took : 89 ms
[2025-06-02 09:45:52] [INFO ] Time to serialize gal into /tmp/LTL17597355060294785070.gal : 13 ms
[2025-06-02 09:45:52] [INFO ] Time to serialize properties into /tmp/LTL530826506256660305.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17597355060294785070.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL530826506256660305.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X(X(X(X(X(F("((p19_4_8==0)||(p19_4_3==1))"))))))))
Formula 0 simplified : XXXXXG!"((p19_4_8==0)||(p19_4_3==1))"
Detected timeout of ITS tools.
[2025-06-02 09:46:07] [INFO ] Flatten gal took : 106 ms
[2025-06-02 09:46:07] [INFO ] Applying decomposition
[2025-06-02 09:46:07] [INFO ] Flatten gal took : 108 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph1570006417471801896.txt' '-o' '/tmp/graph1570006417471801896.bin' '-w' '/tmp/graph1570006417471801896.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph1570006417471801896.bin' '-l' '-1' '-v' '-w' '/tmp/graph1570006417471801896.weights' '-q' '0' '-e' '0.001'
[2025-06-02 09:46:08] [INFO ] Decomposing Gal with order
[2025-06-02 09:46:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 09:46:08] [INFO ] Removed a total of 8781 redundant transitions.
[2025-06-02 09:46:08] [INFO ] Flatten gal took : 252 ms
[2025-06-02 09:46:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 760 labels/synchronizations in 125 ms.
[2025-06-02 09:46:08] [INFO ] Time to serialize gal into /tmp/LTL7212557514502413396.gal : 18 ms
[2025-06-02 09:46:08] [INFO ] Time to serialize properties into /tmp/LTL14933733576927615161.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7212557514502413396.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14933733576927615161.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X(X(X(X(X(F("((i2.u72.p19_4_8==0)||(i13.u65.p19_4_3==1))"))))))))
Formula 0 simplified : XXXXXG!"((i2.u72.p19_4_8==0)||(i13.u65.p19_4_3==1))"
Detected timeout of ITS tools.
Treatment of property EisenbergMcGuire-PT-10-LTLCardinality-06 finished in 204647 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(p1)||p0))))'
[2025-06-02 09:46:23] [INFO ] Flatten gal took : 99 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin2318160497819878184
[2025-06-02 09:46:23] [INFO ] Too many transitions (4310) to apply POR reductions. Disabling POR matrices.
[2025-06-02 09:46:23] [INFO ] Built C files in 37ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2318160497819878184
Running compilation step : cd /tmp/ltsmin2318160497819878184;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2025-06-02 09:46:23] [INFO ] Applying decomposition
[2025-06-02 09:46:24] [INFO ] Flatten gal took : 105 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph11894111749962543406.txt' '-o' '/tmp/graph11894111749962543406.bin' '-w' '/tmp/graph11894111749962543406.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph11894111749962543406.bin' '-l' '-1' '-v' '-w' '/tmp/graph11894111749962543406.weights' '-q' '0' '-e' '0.001'
[2025-06-02 09:46:24] [INFO ] Decomposing Gal with order
[2025-06-02 09:46:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 09:46:24] [INFO ] Removed a total of 9011 redundant transitions.
[2025-06-02 09:46:24] [INFO ] Flatten gal took : 272 ms
[2025-06-02 09:46:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 1036 labels/synchronizations in 110 ms.
[2025-06-02 09:46:24] [INFO ] Time to serialize gal into /tmp/LTLCardinality6468205297132186434.gal : 21 ms
[2025-06-02 09:46:24] [INFO ] Time to serialize properties into /tmp/LTLCardinality16681350822471016656.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality6468205297132186434.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality16681350822471016656.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 2 LTL properties
Checking formula 0 : !((X(X(X(X(X(F("((i19.i1.i1.u176.p19_4_8==0)||(i19.i0.i1.u222.p19_4_3==1))"))))))))
Formula 0 simplified : XXXXXG!"((i19.i1.i1.u176.p19_4_8==0)||(i19.i0.i1.u222.p19_4_3==1))"
Compilation finished in 12125 ms.
Running link step : cd /tmp/ltsmin2318160497819878184;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 79 ms.
Running LTSmin : cd /tmp/ltsmin2318160497819878184;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X(X(X(X(<>((LTLAPp0==true)))))))' '--buchi-type=spotba'
LTSmin run took 1578 ms.
FORMULA EisenbergMcGuire-PT-10-LTLCardinality-06 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Running LTSmin : cd /tmp/ltsmin2318160497819878184;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>(([]((LTLAPp2==true))||(LTLAPp1==true))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>900 s) on command cd /tmp/ltsmin2318160497819878184;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>(([]((LTLAPp2==true))||(LTLAPp1==true))))' '--buchi-type=spotba'
Retrying LTSmin with larger timeout 14400 s
Running LTSmin : cd /tmp/ltsmin2318160497819878184;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>(([]((LTLAPp2==true))||(LTLAPp1==true))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2025-06-02 10:12:25] [INFO ] Applying decomposition
[2025-06-02 10:12:25] [INFO ] Flatten gal took : 179 ms
[2025-06-02 10:12:25] [INFO ] Decomposing Gal with order
[2025-06-02 10:12:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 10:12:26] [INFO ] Removed a total of 10399 redundant transitions.
[2025-06-02 10:12:26] [INFO ] Flatten gal took : 726 ms
[2025-06-02 10:12:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 353 labels/synchronizations in 132 ms.
[2025-06-02 10:12:26] [INFO ] Time to serialize gal into /tmp/LTLCardinality2638885708066603043.gal : 26 ms
[2025-06-02 10:12:26] [INFO ] Time to serialize properties into /tmp/LTLCardinality5293971444245974438.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality2638885708066603043.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality5293971444245974438.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(F(("((u2.p25_1_2==0)||(u6.p09_8_9==1))")||(G("((u5.p12_7_8==0)||(i0.u24.p18_4_9==1))"))))))
Formula 0 simplified : G(F!"((u5.p12_7_8==0)||(i0.u24.p18_4_9==1))" & FG!"((u2.p25_1_2==0)||(u6.p09_8_9==1))")

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
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -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="EisenbergMcGuire-PT-10"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5832"
echo " Executing tool itstools"
echo " Input is EisenbergMcGuire-PT-10, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r072-tall-174860068200811"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/EisenbergMcGuire-PT-10.tgz
mv EisenbergMcGuire-PT-10 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;