MCC'2024- Execution of r464-smll-171620117800093

About the Execution of LTSMin+red for ASLink-PT-06a

Execution Summary
Max Memory Used (MB)	Time wait (ms)	CPU Usage (ms)	I/O Wait (ms)	Computed Result	Execution Status
1358.907	501406.00	591775.00	1161.30	1 1 1 1 1 1 1 1 1 1 1 1 1 ? 1 1	normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r464-smll-171620117800093.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is ASLink-PT-06a, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r464-smll-171620117800093
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 6.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.3K May 19 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 19 15:23 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:11 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 17:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 132K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.7K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.4K May 19 07:09 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 19 15:22 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 597K May 18 16:42 model.pnml

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

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

The expected result is a vector of positive values
NUM_VECTOR

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

=== Now, execution of the tool begins

BK_START 1717207395335

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ASLink-PT-06a
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 02:03:17] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-06-01 02:03:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 02:03:17] [INFO ] Load time of PNML (sax parser for PT used): 314 ms
[2024-06-01 02:03:17] [INFO ] Transformed 1406 places.
[2024-06-01 02:03:17] [INFO ] Transformed 2100 transitions.
[2024-06-01 02:03:17] [INFO ] Found NUPN structural information;
[2024-06-01 02:03:17] [INFO ] Parsed PT model containing 1406 places and 2100 transitions and 7896 arcs in 493 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 12 ms.
Ensure Unique test removed 22 transitions
Reduce redundant transitions removed 22 transitions.
Current structural bounds on expressions (Initiallly, because the net is safe) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 2078 rows 1406 cols
[2024-06-01 02:03:17] [INFO ] Computed 270 invariants in 268 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 10000 steps (54 resets) in 104 ms. (95 steps per ms)
FORMULA ASLink-PT-06a-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-06a-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-06a-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-06a-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-06a-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-06a-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-06a-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 90007 steps (66 resets) in 285 ms. (314 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-01 02:03:18] [INFO ] Invariant cache hit.
[2024-06-01 02:03:19] [INFO ] [Real]Absence check using 66 positive place invariants in 73 ms returned sat
[2024-06-01 02:03:19] [INFO ] [Real]Absence check using 66 positive and 204 generalized place invariants in 124 ms returned sat
[2024-06-01 02:03:20] [INFO ] [Real]Absence check using state equation in 1178 ms returned sat
[2024-06-01 02:03:20] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 02:03:21] [INFO ] [Nat]Absence check using 66 positive place invariants in 54 ms returned sat
[2024-06-01 02:03:21] [INFO ] [Nat]Absence check using 66 positive and 204 generalized place invariants in 89 ms returned sat
[2024-06-01 02:03:22] [INFO ] [Nat]Absence check using state equation in 1494 ms returned sat
[2024-06-01 02:03:23] [INFO ] Computed and/alt/rep : 858/3058/858 causal constraints (skipped 1219 transitions) in 248 ms.
Maximisation of solution failed !
Minimization took 1 ms.
[2024-06-01 02:03:26] [INFO ] [Real]Absence check using 66 positive place invariants in 51 ms returned sat
[2024-06-01 02:03:26] [INFO ] [Real]Absence check using 66 positive and 204 generalized place invariants in 73 ms returned sat
[2024-06-01 02:03:27] [INFO ] [Real]Absence check using state equation in 1133 ms returned sat
[2024-06-01 02:03:27] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 02:03:27] [INFO ] [Nat]Absence check using 66 positive place invariants in 51 ms returned sat
[2024-06-01 02:03:27] [INFO ] [Nat]Absence check using 66 positive and 204 generalized place invariants in 92 ms returned sat
[2024-06-01 02:03:29] [INFO ] [Nat]Absence check using state equation in 1462 ms returned sat
[2024-06-01 02:03:29] [INFO ] Computed and/alt/rep : 858/3058/858 causal constraints (skipped 1219 transitions) in 201 ms.
[2024-06-01 02:03:30] [INFO ] Added : 25 causal constraints over 5 iterations in 1442 ms. Result :sat
Minimization took 635 ms.
[2024-06-01 02:03:31] [INFO ] [Real]Absence check using 66 positive place invariants in 54 ms returned sat
[2024-06-01 02:03:32] [INFO ] [Real]Absence check using 66 positive and 204 generalized place invariants in 102 ms returned sat
[2024-06-01 02:03:33] [INFO ] [Real]Absence check using state equation in 1173 ms returned sat
[2024-06-01 02:03:33] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 02:03:33] [INFO ] [Nat]Absence check using 66 positive place invariants in 51 ms returned sat
[2024-06-01 02:03:33] [INFO ] [Nat]Absence check using 66 positive and 204 generalized place invariants in 109 ms returned sat
[2024-06-01 02:03:35] [INFO ] [Nat]Absence check using state equation in 1496 ms returned sat
[2024-06-01 02:03:35] [INFO ] Computed and/alt/rep : 858/3058/858 causal constraints (skipped 1219 transitions) in 169 ms.
Maximisation of solution failed !
Minimization took 1 ms.
[2024-06-01 02:03:38] [INFO ] [Real]Absence check using 66 positive place invariants in 48 ms returned sat
[2024-06-01 02:03:38] [INFO ] [Real]Absence check using 66 positive and 204 generalized place invariants in 73 ms returned sat
[2024-06-01 02:03:40] [INFO ] [Real]Absence check using state equation in 1496 ms returned sat
[2024-06-01 02:03:40] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 02:03:40] [INFO ] [Nat]Absence check using 66 positive place invariants in 48 ms returned sat
[2024-06-01 02:03:40] [INFO ] [Nat]Absence check using 66 positive and 204 generalized place invariants in 91 ms returned sat
[2024-06-01 02:03:42] [INFO ] [Nat]Absence check using state equation in 1428 ms returned sat
[2024-06-01 02:03:42] [INFO ] Computed and/alt/rep : 858/3058/858 causal constraints (skipped 1219 transitions) in 174 ms.
[2024-06-01 02:03:45] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 3
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1137)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:875)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-06-01 02:03:45] [INFO ] [Real]Absence check using 66 positive place invariants in 47 ms returned sat
[2024-06-01 02:03:45] [INFO ] [Real]Absence check using 66 positive and 204 generalized place invariants in 94 ms returned sat
[2024-06-01 02:03:47] [INFO ] [Real]Absence check using state equation in 1217 ms returned sat
[2024-06-01 02:03:47] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 02:03:47] [INFO ] [Nat]Absence check using 66 positive place invariants in 48 ms returned sat
[2024-06-01 02:03:47] [INFO ] [Nat]Absence check using 66 positive and 204 generalized place invariants in 90 ms returned sat
[2024-06-01 02:03:49] [INFO ] [Nat]Absence check using state equation in 1433 ms returned sat
[2024-06-01 02:03:49] [INFO ] Computed and/alt/rep : 858/3058/858 causal constraints (skipped 1219 transitions) in 153 ms.
[2024-06-01 02:03:52] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 4
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1137)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:875)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-06-01 02:03:52] [INFO ] [Real]Absence check using 66 positive place invariants in 48 ms returned sat
[2024-06-01 02:03:52] [INFO ] [Real]Absence check using 66 positive and 204 generalized place invariants in 91 ms returned sat
[2024-06-01 02:03:53] [INFO ] [Real]Absence check using state equation in 1038 ms returned sat
[2024-06-01 02:03:53] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 02:03:54] [INFO ] [Nat]Absence check using 66 positive place invariants in 51 ms returned sat
[2024-06-01 02:03:54] [INFO ] [Nat]Absence check using 66 positive and 204 generalized place invariants in 89 ms returned sat
[2024-06-01 02:03:55] [INFO ] [Nat]Absence check using state equation in 1246 ms returned sat
[2024-06-01 02:03:55] [INFO ] Computed and/alt/rep : 858/3058/858 causal constraints (skipped 1219 transitions) in 169 ms.
[2024-06-01 02:03:56] [INFO ] Added : 5 causal constraints over 1 iterations in 902 ms. Result :sat
Minimization took 629 ms.
[2024-06-01 02:03:57] [INFO ] [Real]Absence check using 66 positive place invariants in 47 ms returned sat
[2024-06-01 02:03:57] [INFO ] [Real]Absence check using 66 positive and 204 generalized place invariants in 98 ms returned sat
[2024-06-01 02:03:58] [INFO ] [Real]Absence check using state equation in 1173 ms returned sat
[2024-06-01 02:03:58] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 02:03:59] [INFO ] [Nat]Absence check using 66 positive place invariants in 52 ms returned sat
[2024-06-01 02:03:59] [INFO ] [Nat]Absence check using 66 positive and 204 generalized place invariants in 93 ms returned sat
[2024-06-01 02:04:00] [INFO ] [Nat]Absence check using state equation in 1032 ms returned sat
[2024-06-01 02:04:00] [INFO ] Computed and/alt/rep : 858/3058/858 causal constraints (skipped 1219 transitions) in 168 ms.
[2024-06-01 02:04:03] [INFO ] Added : 115 causal constraints over 23 iterations in 3422 ms. Result :unknown
[2024-06-01 02:04:04] [INFO ] [Real]Absence check using 66 positive place invariants in 47 ms returned sat
[2024-06-01 02:04:04] [INFO ] [Real]Absence check using 66 positive and 204 generalized place invariants in 71 ms returned sat
[2024-06-01 02:04:05] [INFO ] [Real]Absence check using state equation in 1282 ms returned sat
[2024-06-01 02:04:05] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 02:04:06] [INFO ] [Nat]Absence check using 66 positive place invariants in 49 ms returned sat
[2024-06-01 02:04:06] [INFO ] [Nat]Absence check using 66 positive and 204 generalized place invariants in 92 ms returned sat
[2024-06-01 02:04:07] [INFO ] [Nat]Absence check using state equation in 1312 ms returned sat
[2024-06-01 02:04:07] [INFO ] Computed and/alt/rep : 858/3058/858 causal constraints (skipped 1219 transitions) in 158 ms.
0timeout
^^^^^^^^
(error "Invalid token: 0timeout")
Maximisation of solution failed !
Minimization took 1 ms.
[2024-06-01 02:04:11] [INFO ] [Real]Absence check using 66 positive place invariants in 47 ms returned sat
[2024-06-01 02:04:11] [INFO ] [Real]Absence check using 66 positive and 204 generalized place invariants in 70 ms returned sat
[2024-06-01 02:04:12] [INFO ] [Real]Absence check using state equation in 1041 ms returned sat
[2024-06-01 02:04:12] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 02:04:12] [INFO ] [Nat]Absence check using 66 positive place invariants in 50 ms returned sat
[2024-06-01 02:04:12] [INFO ] [Nat]Absence check using 66 positive and 204 generalized place invariants in 74 ms returned sat
[2024-06-01 02:04:14] [INFO ] [Nat]Absence check using state equation in 1291 ms returned sat
[2024-06-01 02:04:14] [INFO ] Computed and/alt/rep : 858/3058/858 causal constraints (skipped 1219 transitions) in 150 ms.
Maximisation of solution failed !
Minimization took 0 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 1, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1]
Support contains 9 out of 1406 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1406/1406 places, 2078/2078 transitions.
Ensure Unique test removed 24 places
Discarding 12 places :
Implicit places reduction removed 12 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 126 transitions
Trivial Post-agglo rules discarded 126 transitions
Performed 126 trivial Post agglomeration. Transition count delta: 126
Iterating post reduction 0 with 162 rules applied. Total rules applied 162 place count 1370 transition count 1952
Reduce places removed 126 places and 0 transitions.
Iterating post reduction 1 with 126 rules applied. Total rules applied 288 place count 1244 transition count 1952
Performed 128 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 128 Pre rules applied. Total rules applied 288 place count 1244 transition count 1824
Deduced a syphon composed of 128 places in 8 ms
Ensure Unique test removed 50 places
Reduce places removed 178 places and 0 transitions.
Iterating global reduction 2 with 306 rules applied. Total rules applied 594 place count 1066 transition count 1824
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 595 place count 1066 transition count 1823
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 596 place count 1065 transition count 1823
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 605 place count 1056 transition count 1776
Ensure Unique test removed 1 places
Iterating global reduction 4 with 10 rules applied. Total rules applied 615 place count 1055 transition count 1776
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 4 with 6 rules applied. Total rules applied 621 place count 1054 transition count 1771
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 624 place count 1051 transition count 1771
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 625 place count 1050 transition count 1763
Iterating global reduction 6 with 1 rules applied. Total rules applied 626 place count 1050 transition count 1763
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 627 place count 1049 transition count 1755
Iterating global reduction 6 with 1 rules applied. Total rules applied 628 place count 1049 transition count 1755
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 629 place count 1048 transition count 1747
Iterating global reduction 6 with 1 rules applied. Total rules applied 630 place count 1048 transition count 1747
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 631 place count 1047 transition count 1739
Iterating global reduction 6 with 1 rules applied. Total rules applied 632 place count 1047 transition count 1739
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 633 place count 1046 transition count 1731
Iterating global reduction 6 with 1 rules applied. Total rules applied 634 place count 1046 transition count 1731
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 635 place count 1045 transition count 1723
Iterating global reduction 6 with 1 rules applied. Total rules applied 636 place count 1045 transition count 1723
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 637 place count 1044 transition count 1715
Iterating global reduction 6 with 1 rules applied. Total rules applied 638 place count 1044 transition count 1715
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 639 place count 1043 transition count 1707
Iterating global reduction 6 with 1 rules applied. Total rules applied 640 place count 1043 transition count 1707
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 641 place count 1042 transition count 1699
Iterating global reduction 6 with 1 rules applied. Total rules applied 642 place count 1042 transition count 1699
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 643 place count 1041 transition count 1691
Iterating global reduction 6 with 1 rules applied. Total rules applied 644 place count 1041 transition count 1691
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 645 place count 1040 transition count 1683
Iterating global reduction 6 with 1 rules applied. Total rules applied 646 place count 1040 transition count 1683
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 647 place count 1039 transition count 1675
Iterating global reduction 6 with 1 rules applied. Total rules applied 648 place count 1039 transition count 1675
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 649 place count 1038 transition count 1667
Iterating global reduction 6 with 1 rules applied. Total rules applied 650 place count 1038 transition count 1667
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 651 place count 1037 transition count 1659
Iterating global reduction 6 with 1 rules applied. Total rules applied 652 place count 1037 transition count 1659
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 653 place count 1036 transition count 1651
Iterating global reduction 6 with 1 rules applied. Total rules applied 654 place count 1036 transition count 1651
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 655 place count 1035 transition count 1643
Iterating global reduction 6 with 1 rules applied. Total rules applied 656 place count 1035 transition count 1643
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: 41
Deduced a syphon composed of 41 places in 2 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 6 with 82 rules applied. Total rules applied 738 place count 994 transition count 1602
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 6 with 5 rules applied. Total rules applied 743 place count 994 transition count 1597
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 748 place count 989 transition count 1597
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 7 with 6 rules applied. Total rules applied 754 place count 989 transition count 1597
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 755 place count 988 transition count 1596
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 7 with 12 rules applied. Total rules applied 767 place count 976 transition count 1596
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 24 Pre rules applied. Total rules applied 767 place count 976 transition count 1572
Deduced a syphon composed of 24 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 8 with 49 rules applied. Total rules applied 816 place count 951 transition count 1572
Discarding 8 places :
Implicit places reduction removed 8 places
Iterating post reduction 8 with 8 rules applied. Total rules applied 824 place count 943 transition count 1572
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 1 Pre rules applied. Total rules applied 824 place count 943 transition count 1571
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 826 place count 942 transition count 1571
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 2 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 9 with 14 rules applied. Total rules applied 840 place count 935 transition count 1564
Discarding 6 places :
Symmetric choice reduction at 9 with 6 rule applications. Total rules 846 place count 929 transition count 1558
Iterating global reduction 9 with 6 rules applied. Total rules applied 852 place count 929 transition count 1558
Free-agglomeration rule applied 7 times.
Iterating global reduction 9 with 7 rules applied. Total rules applied 859 place count 929 transition count 1551
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 9 with 7 rules applied. Total rules applied 866 place count 922 transition count 1551
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 10 with 6 rules applied. Total rules applied 872 place count 922 transition count 1551
Applied a total of 872 rules in 2038 ms. Remains 922 /1406 variables (removed 484) and now considering 1551/2078 (removed 527) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2056 ms. Remains : 922/1406 places, 1551/2078 transitions.
// Phase 1: matrix 1551 rows 922 cols
[2024-06-01 02:04:22] [INFO ] Computed 161 invariants in 134 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 1, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1]
FORMULA ASLink-PT-06a-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 1000000 steps (11402 resets) in 3517 ms. (284 steps per ms)
FORMULA ASLink-PT-06a-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-06a-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-06a-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-06a-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 4000003 steps (7476 resets) in 6022 ms. (664 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
[2024-06-01 02:04:31] [INFO ] Invariant cache hit.
[2024-06-01 02:04:31] [INFO ] [Real]Absence check using 41 positive place invariants in 22 ms returned sat
[2024-06-01 02:04:31] [INFO ] [Real]Absence check using 41 positive and 120 generalized place invariants in 49 ms returned sat
[2024-06-01 02:04:32] [INFO ] [Real]Absence check using state equation in 663 ms returned sat
[2024-06-01 02:04:32] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 02:04:32] [INFO ] [Nat]Absence check using 41 positive place invariants in 23 ms returned sat
[2024-06-01 02:04:32] [INFO ] [Nat]Absence check using 41 positive and 120 generalized place invariants in 45 ms returned sat
[2024-06-01 02:04:33] [INFO ] [Nat]Absence check using state equation in 795 ms returned sat
[2024-06-01 02:04:33] [INFO ] Computed and/alt/rep : 611/2323/611 causal constraints (skipped 907 transitions) in 111 ms.
[2024-06-01 02:04:37] [INFO ] Added : 156 causal constraints over 32 iterations in 3949 ms. Result :sat
Minimization took 1453 ms.
[2024-06-01 02:04:39] [INFO ] [Real]Absence check using 41 positive place invariants in 21 ms returned sat
[2024-06-01 02:04:39] [INFO ] [Real]Absence check using 41 positive and 120 generalized place invariants in 48 ms returned sat
[2024-06-01 02:04:40] [INFO ] [Real]Absence check using state equation in 707 ms returned sat
[2024-06-01 02:04:40] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 02:04:40] [INFO ] [Nat]Absence check using 41 positive place invariants in 22 ms returned sat
[2024-06-01 02:04:40] [INFO ] [Nat]Absence check using 41 positive and 120 generalized place invariants in 50 ms returned sat
[2024-06-01 02:04:41] [INFO ] [Nat]Absence check using state equation in 804 ms returned sat
[2024-06-01 02:04:41] [INFO ] Computed and/alt/rep : 611/2323/611 causal constraints (skipped 907 transitions) in 119 ms.
[2024-06-01 02:04:51] [INFO ] Added : 475 causal constraints over 95 iterations in 10000 ms. Result :sat
Minimization took 1623 ms.
[2024-06-01 02:04:53] [INFO ] [Real]Absence check using 41 positive place invariants in 21 ms returned sat
[2024-06-01 02:04:53] [INFO ] [Real]Absence check using 41 positive and 120 generalized place invariants in 47 ms returned sat
[2024-06-01 02:04:53] [INFO ] [Real]Absence check using state equation in 679 ms returned sat
[2024-06-01 02:04:53] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 02:04:54] [INFO ] [Nat]Absence check using 41 positive place invariants in 23 ms returned sat
[2024-06-01 02:04:54] [INFO ] [Nat]Absence check using 41 positive and 120 generalized place invariants in 36 ms returned sat
[2024-06-01 02:04:54] [INFO ] [Nat]Absence check using state equation in 766 ms returned sat
[2024-06-01 02:04:55] [INFO ] Computed and/alt/rep : 611/2323/611 causal constraints (skipped 907 transitions) in 119 ms.
[2024-06-01 02:05:04] [INFO ] Added : 461 causal constraints over 93 iterations in 9286 ms. Result :sat
Minimization took 1672 ms.
[2024-06-01 02:05:06] [INFO ] [Real]Absence check using 41 positive place invariants in 21 ms returned sat
[2024-06-01 02:05:06] [INFO ] [Real]Absence check using 41 positive and 120 generalized place invariants in 47 ms returned sat
[2024-06-01 02:05:06] [INFO ] [Real]Absence check using state equation in 669 ms returned sat
[2024-06-01 02:05:06] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 02:05:07] [INFO ] [Nat]Absence check using 41 positive place invariants in 23 ms returned sat
[2024-06-01 02:05:07] [INFO ] [Nat]Absence check using 41 positive and 120 generalized place invariants in 48 ms returned sat
[2024-06-01 02:05:07] [INFO ] [Nat]Absence check using state equation in 665 ms returned sat
[2024-06-01 02:05:07] [INFO ] Computed and/alt/rep : 611/2323/611 causal constraints (skipped 907 transitions) in 115 ms.
[2024-06-01 02:05:16] [INFO ] Added : 459 causal constraints over 92 iterations in 9147 ms. Result :sat
Minimization took 1465 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
Support contains 4 out of 922 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 922/922 places, 1551/1551 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 921 transition count 1550
Applied a total of 2 rules in 81 ms. Remains 921 /922 variables (removed 1) and now considering 1550/1551 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 81 ms. Remains : 921/922 places, 1550/1551 transitions.
// Phase 1: matrix 1550 rows 921 cols
[2024-06-01 02:05:21] [INFO ] Computed 161 invariants in 25 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
RANDOM walk for 1000000 steps (11353 resets) in 3374 ms. (296 steps per ms)
BEST_FIRST walk for 4000003 steps (7507 resets) in 5883 ms. (679 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
[2024-06-01 02:05:30] [INFO ] Invariant cache hit.
[2024-06-01 02:05:30] [INFO ] [Real]Absence check using 39 positive place invariants in 21 ms returned sat
[2024-06-01 02:05:30] [INFO ] [Real]Absence check using 39 positive and 122 generalized place invariants in 48 ms returned sat
[2024-06-01 02:05:31] [INFO ] [Real]Absence check using state equation in 647 ms returned sat
[2024-06-01 02:05:31] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 02:05:31] [INFO ] [Nat]Absence check using 39 positive place invariants in 21 ms returned sat
[2024-06-01 02:05:31] [INFO ] [Nat]Absence check using 39 positive and 122 generalized place invariants in 48 ms returned sat
[2024-06-01 02:05:32] [INFO ] [Nat]Absence check using state equation in 777 ms returned sat
[2024-06-01 02:05:32] [INFO ] Computed and/alt/rep : 610/2322/610 causal constraints (skipped 907 transitions) in 120 ms.
[2024-06-01 02:05:44] [INFO ] Added : 457 causal constraints over 92 iterations in 12268 ms. Result :sat
Minimization took 3433 ms.
[2024-06-01 02:05:48] [INFO ] [Real]Absence check using 39 positive place invariants in 20 ms returned sat
[2024-06-01 02:05:48] [INFO ] [Real]Absence check using 39 positive and 122 generalized place invariants in 46 ms returned sat
[2024-06-01 02:05:49] [INFO ] [Real]Absence check using state equation in 674 ms returned sat
[2024-06-01 02:05:49] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 02:05:49] [INFO ] [Nat]Absence check using 39 positive place invariants in 21 ms returned sat
[2024-06-01 02:05:49] [INFO ] [Nat]Absence check using 39 positive and 122 generalized place invariants in 38 ms returned sat
[2024-06-01 02:05:50] [INFO ] [Nat]Absence check using state equation in 711 ms returned sat
[2024-06-01 02:05:50] [INFO ] Computed and/alt/rep : 610/2322/610 causal constraints (skipped 907 transitions) in 113 ms.
[2024-06-01 02:06:02] [INFO ] Deduced a trap composed of 99 places in 600 ms of which 65 ms to minimize.
[2024-06-01 02:06:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 800 ms
[2024-06-01 02:06:03] [INFO ] Added : 478 causal constraints over 96 iterations in 12849 ms. Result :sat
Minimization took 1353 ms.
[2024-06-01 02:06:04] [INFO ] [Real]Absence check using 39 positive place invariants in 20 ms returned sat
[2024-06-01 02:06:04] [INFO ] [Real]Absence check using 39 positive and 122 generalized place invariants in 46 ms returned sat
[2024-06-01 02:06:05] [INFO ] [Real]Absence check using state equation in 726 ms returned sat
[2024-06-01 02:06:05] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 02:06:05] [INFO ] [Nat]Absence check using 39 positive place invariants in 20 ms returned sat
[2024-06-01 02:06:05] [INFO ] [Nat]Absence check using 39 positive and 122 generalized place invariants in 43 ms returned sat
[2024-06-01 02:06:06] [INFO ] [Nat]Absence check using state equation in 688 ms returned sat
[2024-06-01 02:06:06] [INFO ] Computed and/alt/rep : 610/2322/610 causal constraints (skipped 907 transitions) in 114 ms.
[2024-06-01 02:06:15] [INFO ] Added : 446 causal constraints over 90 iterations in 9361 ms. Result :sat
Minimization took 1339 ms.
[2024-06-01 02:06:17] [INFO ] [Real]Absence check using 39 positive place invariants in 22 ms returned sat
[2024-06-01 02:06:17] [INFO ] [Real]Absence check using 39 positive and 122 generalized place invariants in 47 ms returned sat
[2024-06-01 02:06:18] [INFO ] [Real]Absence check using state equation in 759 ms returned sat
[2024-06-01 02:06:18] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 02:06:18] [INFO ] [Nat]Absence check using 39 positive place invariants in 20 ms returned sat
[2024-06-01 02:06:18] [INFO ] [Nat]Absence check using 39 positive and 122 generalized place invariants in 47 ms returned sat
[2024-06-01 02:06:19] [INFO ] [Nat]Absence check using state equation in 777 ms returned sat
[2024-06-01 02:06:19] [INFO ] Computed and/alt/rep : 610/2322/610 causal constraints (skipped 907 transitions) in 119 ms.
[2024-06-01 02:06:28] [INFO ] Added : 400 causal constraints over 81 iterations in 8988 ms. Result :sat
Minimization took 1310 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
Support contains 4 out of 921 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 921/921 places, 1550/1550 transitions.
Applied a total of 0 rules in 38 ms. Remains 921 /921 variables (removed 0) and now considering 1550/1550 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39 ms. Remains : 921/921 places, 1550/1550 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 921/921 places, 1550/1550 transitions.
Applied a total of 0 rules in 38 ms. Remains 921 /921 variables (removed 0) and now considering 1550/1550 (removed 0) transitions.
[2024-06-01 02:06:32] [INFO ] Invariant cache hit.
[2024-06-01 02:06:33] [INFO ] Implicit Places using invariants in 1151 ms returned [0, 18, 19, 30, 48, 66, 137, 146, 147, 148, 166, 184, 253, 257, 258, 269, 270, 271, 289, 307, 376, 380, 381, 392, 393, 394, 412, 430, 499, 503, 504, 515, 516, 517, 535, 553, 588, 625, 629, 630, 641, 642, 643, 661, 679, 748, 752, 753, 756, 767, 768, 769, 787, 789, 792, 810, 811, 812, 813, 825, 831, 837, 843, 849, 855, 861, 867, 873, 879, 885]
[2024-06-01 02:06:33] [INFO ] Actually due to overlaps returned [787, 769, 48, 148, 166, 271, 289, 394, 412, 517, 535, 643, 661, 792, 30, 147, 270, 393, 516, 642, 768, 811, 146, 269, 392, 515, 641, 767, 789, 810, 0, 257, 258, 380, 381, 503, 504, 629, 630, 752, 753, 18, 19, 66, 184, 307, 430, 553, 679, 813, 855, 873, 885, 756, 812, 825, 831, 837, 843, 849, 861, 867, 879]
Discarding 63 places :
Implicit Place search using SMT only with invariants took 1159 ms to find 63 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 858/921 places, 1550/1550 transitions.
Discarding 6 places :
Implicit places reduction removed 6 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 119 transitions
Trivial Post-agglo rules discarded 119 transitions
Performed 119 trivial Post agglomeration. Transition count delta: 119
Iterating post reduction 0 with 125 rules applied. Total rules applied 125 place count 852 transition count 1431
Reduce places removed 119 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 120 rules applied. Total rules applied 245 place count 733 transition count 1430
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 246 place count 732 transition count 1430
Performed 31 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 31 Pre rules applied. Total rules applied 246 place count 732 transition count 1399
Deduced a syphon composed of 31 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 3 with 63 rules applied. Total rules applied 309 place count 700 transition count 1399
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 3 with 12 rules applied. Total rules applied 321 place count 696 transition count 1391
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 329 place count 688 transition count 1391
Discarding 15 places :
Symmetric choice reduction at 5 with 15 rule applications. Total rules 344 place count 673 transition count 1376
Iterating global reduction 5 with 15 rules applied. Total rules applied 359 place count 673 transition count 1376
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 362 place count 673 transition count 1373
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 362 place count 673 transition count 1372
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 364 place count 672 transition count 1372
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 367 place count 669 transition count 1369
Iterating global reduction 6 with 3 rules applied. Total rules applied 370 place count 669 transition count 1369
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 371 place count 668 transition count 1368
Iterating global reduction 6 with 1 rules applied. Total rules applied 372 place count 668 transition count 1368
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 373 place count 667 transition count 1367
Iterating global reduction 6 with 1 rules applied. Total rules applied 374 place count 667 transition count 1367
Performed 53 Post agglomeration using F-continuation condition.Transition count delta: 53
Deduced a syphon composed of 53 places in 2 ms
Reduce places removed 53 places and 0 transitions.
Iterating global reduction 6 with 106 rules applied. Total rules applied 480 place count 614 transition count 1314
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 486 place count 614 transition count 1308
Discarding 5 places :
Symmetric choice reduction at 7 with 5 rule applications. Total rules 491 place count 609 transition count 1303
Iterating global reduction 7 with 5 rules applied. Total rules applied 496 place count 609 transition count 1303
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 7 with 5 rules applied. Total rules applied 501 place count 609 transition count 1298
Free-agglomeration rule (complex) applied 12 times.
Iterating global reduction 8 with 12 rules applied. Total rules applied 513 place count 609 transition count 1286
Ensure Unique test removed 1 places
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 8 with 13 rules applied. Total rules applied 526 place count 596 transition count 1286
Partial Free-agglomeration rule applied 19 times.
Drop transitions (Partial Free agglomeration) removed 19 transitions
Iterating global reduction 9 with 19 rules applied. Total rules applied 545 place count 596 transition count 1286
Applied a total of 545 rules in 739 ms. Remains 596 /858 variables (removed 262) and now considering 1286/1550 (removed 264) transitions.
// Phase 1: matrix 1286 rows 596 cols
[2024-06-01 02:06:34] [INFO ] Computed 86 invariants in 15 ms
[2024-06-01 02:06:35] [INFO ] Implicit Places using invariants in 725 ms returned [89, 95, 98, 100, 103, 106, 107, 159, 176, 182, 185, 187, 192, 193, 245, 262, 268, 271, 273, 278, 279, 331, 348, 354, 357, 359, 364, 365, 417, 436, 442, 445, 447, 452, 453, 505, 522, 528, 531, 533]
[2024-06-01 02:06:35] [INFO ] Actually due to overlaps returned [106, 192, 278, 364, 452, 107, 193, 279, 365, 453, 89, 95, 100, 103, 176, 182, 187, 262, 268, 273, 348, 354, 359, 436, 442, 447, 522, 528, 533, 159, 245, 331, 417, 505]
Discarding 34 places :
Implicit Place search using SMT only with invariants took 728 ms to find 34 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 562/921 places, 1286/1550 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 538 transition count 1262
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 538 transition count 1262
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 54 place count 532 transition count 1256
Iterating global reduction 0 with 6 rules applied. Total rules applied 60 place count 532 transition count 1256
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 0 with 22 rules applied. Total rules applied 82 place count 521 transition count 1245
Free-agglomeration rule applied 18 times.
Iterating global reduction 0 with 18 rules applied. Total rules applied 100 place count 521 transition count 1227
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 118 place count 503 transition count 1227
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 1 with 5 rules applied. Total rules applied 123 place count 503 transition count 1222
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 128 place count 498 transition count 1222
Applied a total of 128 rules in 98 ms. Remains 498 /562 variables (removed 64) and now considering 1222/1286 (removed 64) transitions.
// Phase 1: matrix 1222 rows 498 cols
[2024-06-01 02:06:35] [INFO ] Computed 52 invariants in 12 ms
[2024-06-01 02:06:35] [INFO ] Implicit Places using invariants in 510 ms returned []
[2024-06-01 02:06:35] [INFO ] Invariant cache hit.
[2024-06-01 02:06:37] [INFO ] Implicit Places using invariants and state equation in 1331 ms returned []
Implicit Place search using SMT with State Equation took 1848 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 498/921 places, 1222/1550 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 4616 ms. Remains : 498/921 places, 1222/1550 transitions.
[2024-06-01 02:06:37] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
RANDOM walk for 1000000 steps (17820 resets) in 2417 ms. (413 steps per ms)
BEST_FIRST walk for 4000002 steps (15904 resets) in 3738 ms. (1069 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
[2024-06-01 02:06:43] [INFO ] Invariant cache hit.
[2024-06-01 02:06:43] [INFO ] [Real]Absence check using 11 positive place invariants in 9 ms returned sat
[2024-06-01 02:06:43] [INFO ] [Real]Absence check using 11 positive and 41 generalized place invariants in 20 ms returned sat
[2024-06-01 02:06:43] [INFO ] [Real]Absence check using state equation in 448 ms returned sat
[2024-06-01 02:06:43] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 02:06:43] [INFO ] [Nat]Absence check using 11 positive place invariants in 8 ms returned sat
[2024-06-01 02:06:44] [INFO ] [Nat]Absence check using 11 positive and 41 generalized place invariants in 21 ms returned sat
[2024-06-01 02:06:44] [INFO ] [Nat]Absence check using state equation in 432 ms returned sat
[2024-06-01 02:06:44] [INFO ] Computed and/alt/rep : 269/1211/269 causal constraints (skipped 923 transitions) in 89 ms.
[2024-06-01 02:06:45] [INFO ] Added : 30 causal constraints over 10 iterations in 838 ms. Result :sat
Minimization took 593 ms.
[2024-06-01 02:06:46] [INFO ] [Real]Absence check using 11 positive place invariants in 9 ms returned sat
[2024-06-01 02:06:46] [INFO ] [Real]Absence check using 11 positive and 41 generalized place invariants in 20 ms returned sat
[2024-06-01 02:06:46] [INFO ] [Real]Absence check using state equation in 418 ms returned sat
[2024-06-01 02:06:46] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 02:06:46] [INFO ] [Nat]Absence check using 11 positive place invariants in 9 ms returned sat
[2024-06-01 02:06:46] [INFO ] [Nat]Absence check using 11 positive and 41 generalized place invariants in 20 ms returned sat
[2024-06-01 02:06:47] [INFO ] [Nat]Absence check using state equation in 459 ms returned sat
[2024-06-01 02:06:47] [INFO ] Computed and/alt/rep : 269/1211/269 causal constraints (skipped 923 transitions) in 89 ms.
[2024-06-01 02:06:48] [INFO ] Added : 35 causal constraints over 7 iterations in 971 ms. Result :sat
Minimization took 599 ms.
[2024-06-01 02:06:48] [INFO ] [Real]Absence check using 11 positive place invariants in 9 ms returned sat
[2024-06-01 02:06:48] [INFO ] [Real]Absence check using 11 positive and 41 generalized place invariants in 21 ms returned sat
[2024-06-01 02:06:49] [INFO ] [Real]Absence check using state equation in 477 ms returned sat
[2024-06-01 02:06:49] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 02:06:49] [INFO ] [Nat]Absence check using 11 positive place invariants in 9 ms returned sat
[2024-06-01 02:06:49] [INFO ] [Nat]Absence check using 11 positive and 41 generalized place invariants in 21 ms returned sat
[2024-06-01 02:06:49] [INFO ] [Nat]Absence check using state equation in 446 ms returned sat
[2024-06-01 02:06:50] [INFO ] Deduced a trap composed of 13 places in 87 ms of which 2 ms to minimize.
[2024-06-01 02:06:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 161 ms
[2024-06-01 02:06:50] [INFO ] Computed and/alt/rep : 269/1211/269 causal constraints (skipped 923 transitions) in 89 ms.
[2024-06-01 02:06:50] [INFO ] Added : 23 causal constraints over 5 iterations in 605 ms. Result :sat
Minimization took 636 ms.
[2024-06-01 02:06:51] [INFO ] [Real]Absence check using 11 positive place invariants in 9 ms returned sat
[2024-06-01 02:06:51] [INFO ] [Real]Absence check using 11 positive and 41 generalized place invariants in 19 ms returned sat
[2024-06-01 02:06:52] [INFO ] [Real]Absence check using state equation in 456 ms returned sat
[2024-06-01 02:06:52] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 02:06:52] [INFO ] [Nat]Absence check using 11 positive place invariants in 9 ms returned sat
[2024-06-01 02:06:52] [INFO ] [Nat]Absence check using 11 positive and 41 generalized place invariants in 21 ms returned sat
[2024-06-01 02:06:52] [INFO ] [Nat]Absence check using state equation in 467 ms returned sat
[2024-06-01 02:06:52] [INFO ] Computed and/alt/rep : 269/1211/269 causal constraints (skipped 923 transitions) in 87 ms.
[2024-06-01 02:06:53] [INFO ] Added : 39 causal constraints over 8 iterations in 789 ms. Result :sat
Minimization took 656 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
FORMULA ASLink-PT-06a-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
Support contains 3 out of 498 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 498/498 places, 1222/1222 transitions.
Applied a total of 0 rules in 27 ms. Remains 498 /498 variables (removed 0) and now considering 1222/1222 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 498/498 places, 1222/1222 transitions.
[2024-06-01 02:06:55] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
RANDOM walk for 1000000 steps (17895 resets) in 2388 ms. (418 steps per ms)
BEST_FIRST walk for 3000003 steps (11946 resets) in 2791 ms. (1074 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
[2024-06-01 02:07:00] [INFO ] Invariant cache hit.
[2024-06-01 02:07:00] [INFO ] [Real]Absence check using 11 positive place invariants in 8 ms returned sat
[2024-06-01 02:07:00] [INFO ] [Real]Absence check using 11 positive and 41 generalized place invariants in 20 ms returned sat
[2024-06-01 02:07:00] [INFO ] [Real]Absence check using state equation in 448 ms returned sat
[2024-06-01 02:07:01] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 02:07:01] [INFO ] [Nat]Absence check using 11 positive place invariants in 8 ms returned sat
[2024-06-01 02:07:01] [INFO ] [Nat]Absence check using 11 positive and 41 generalized place invariants in 21 ms returned sat
[2024-06-01 02:07:01] [INFO ] [Nat]Absence check using state equation in 455 ms returned sat
[2024-06-01 02:07:01] [INFO ] Computed and/alt/rep : 269/1211/269 causal constraints (skipped 923 transitions) in 91 ms.
[2024-06-01 02:07:02] [INFO ] Added : 35 causal constraints over 7 iterations in 971 ms. Result :sat
Minimization took 601 ms.
[2024-06-01 02:07:03] [INFO ] [Real]Absence check using 11 positive place invariants in 8 ms returned sat
[2024-06-01 02:07:03] [INFO ] [Real]Absence check using 11 positive and 41 generalized place invariants in 19 ms returned sat
[2024-06-01 02:07:03] [INFO ] [Real]Absence check using state equation in 447 ms returned sat
[2024-06-01 02:07:03] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 02:07:03] [INFO ] [Nat]Absence check using 11 positive place invariants in 9 ms returned sat
[2024-06-01 02:07:03] [INFO ] [Nat]Absence check using 11 positive and 41 generalized place invariants in 19 ms returned sat
[2024-06-01 02:07:04] [INFO ] [Nat]Absence check using state equation in 454 ms returned sat
[2024-06-01 02:07:04] [INFO ] Deduced a trap composed of 13 places in 85 ms of which 1 ms to minimize.
[2024-06-01 02:07:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 159 ms
[2024-06-01 02:07:04] [INFO ] Computed and/alt/rep : 269/1211/269 causal constraints (skipped 923 transitions) in 89 ms.
[2024-06-01 02:07:05] [INFO ] Added : 23 causal constraints over 5 iterations in 594 ms. Result :sat
Minimization took 644 ms.
[2024-06-01 02:07:05] [INFO ] [Real]Absence check using 11 positive place invariants in 8 ms returned sat
[2024-06-01 02:07:05] [INFO ] [Real]Absence check using 11 positive and 41 generalized place invariants in 25 ms returned sat
[2024-06-01 02:07:06] [INFO ] [Real]Absence check using state equation in 436 ms returned sat
[2024-06-01 02:07:06] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 02:07:06] [INFO ] [Nat]Absence check using 11 positive place invariants in 8 ms returned sat
[2024-06-01 02:07:06] [INFO ] [Nat]Absence check using 11 positive and 41 generalized place invariants in 22 ms returned sat
[2024-06-01 02:07:07] [INFO ] [Nat]Absence check using state equation in 478 ms returned sat
[2024-06-01 02:07:07] [INFO ] Computed and/alt/rep : 269/1211/269 causal constraints (skipped 923 transitions) in 89 ms.
[2024-06-01 02:07:07] [INFO ] Added : 39 causal constraints over 8 iterations in 784 ms. Result :sat
Minimization took 645 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
Support contains 3 out of 498 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 498/498 places, 1222/1222 transitions.
Applied a total of 0 rules in 17 ms. Remains 498 /498 variables (removed 0) and now considering 1222/1222 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 498/498 places, 1222/1222 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 498/498 places, 1222/1222 transitions.
Applied a total of 0 rules in 17 ms. Remains 498 /498 variables (removed 0) and now considering 1222/1222 (removed 0) transitions.
[2024-06-01 02:07:09] [INFO ] Invariant cache hit.
[2024-06-01 02:07:10] [INFO ] Implicit Places using invariants in 643 ms returned []
[2024-06-01 02:07:10] [INFO ] Invariant cache hit.
[2024-06-01 02:07:11] [INFO ] Implicit Places using invariants and state equation in 1314 ms returned []
Implicit Place search using SMT with State Equation took 1960 ms to find 0 implicit places.
[2024-06-01 02:07:11] [INFO ] Redundant transitions in 107 ms returned []
Running 1192 sub problems to find dead transitions.
[2024-06-01 02:07:11] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/497 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1192 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/497 variables, 38/46 constraints. Problems are: Problem set: 0 solved, 1192 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 497/1720 variables, and 46 constraints, problems are : Problem set: 0 solved, 1192 unsolved in 30054 ms.
Refiners :[Positive P Invariants (semi-flows): 8/11 constraints, Generalized P Invariants (flows): 38/41 constraints, State Equation: 0/498 constraints, PredecessorRefiner: 1192/1192 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1192 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/497 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1192 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/497 variables, 38/46 constraints. Problems are: Problem set: 0 solved, 1192 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/497 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1192 unsolved
At refinement iteration 3 (OVERLAPS) 1/498 variables, 3/49 constraints. Problems are: Problem set: 0 solved, 1192 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/498 variables, 3/52 constraints. Problems are: Problem set: 0 solved, 1192 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 498/1720 variables, and 52 constraints, problems are : Problem set: 0 solved, 1192 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 41/41 constraints, State Equation: 0/498 constraints, PredecessorRefiner: 0/1192 constraints, Known Traps: 0/0 constraints]
After SMT, in 61057ms problems are : Problem set: 0 solved, 1192 unsolved
Search for dead transitions found 0 dead transitions in 61093ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63207 ms. Remains : 498/498 places, 1222/1222 transitions.
RANDOM walk for 40000 steps (711 resets) in 1360 ms. (29 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (156 resets) in 250 ms. (159 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (155 resets) in 197 ms. (202 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (155 resets) in 189 ms. (210 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (159 resets) in 143 ms. (277 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (153 resets) in 165 ms. (240 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (154 resets) in 132 ms. (300 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 140048 steps, run timeout after 3001 ms. (steps per millisecond=46 ) properties seen :0 out of 6
Probabilistic random walk after 140048 steps, saw 88661 distinct states, run finished after 3006 ms. (steps per millisecond=46 ) properties seen :0
[2024-06-01 02:08:16] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 188/191 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/191 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 29/220 variables, 8/17 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/220 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 231/451 variables, 26/43 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/451 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 18/469 variables, 3/46 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/469 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 29/498 variables, 6/52 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/498 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 1222/1720 variables, 498/550 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1720 variables, 0/550 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 0/1720 variables, 0/550 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1720/1720 variables, and 550 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1877 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 41/41 constraints, State Equation: 498/498 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 188/191 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/191 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 29/220 variables, 8/17 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/220 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 231/451 variables, 26/43 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/451 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 18/469 variables, 3/46 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 02:08:18] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/469 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/469 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 29/498 variables, 6/53 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/498 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 1222/1720 variables, 498/551 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1720 variables, 6/557 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1720 variables, 0/557 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 0/1720 variables, 0/557 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1720/1720 variables, and 557 constraints, problems are : Problem set: 0 solved, 6 unsolved in 4215 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 41/41 constraints, State Equation: 498/498 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 1/1 constraints]
After SMT, in 6111ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1606 ms.
Support contains 3 out of 498 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 498/498 places, 1222/1222 transitions.
Applied a total of 0 rules in 17 ms. Remains 498 /498 variables (removed 0) and now considering 1222/1222 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 498/498 places, 1222/1222 transitions.
RANDOM walk for 40000 steps (709 resets) in 148 ms. (268 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (162 resets) in 107 ms. (370 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (169 resets) in 110 ms. (360 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (164 resets) in 106 ms. (373 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (155 resets) in 117 ms. (339 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (161 resets) in 102 ms. (388 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (168 resets) in 100 ms. (396 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 152568 steps, run timeout after 3001 ms. (steps per millisecond=50 ) properties seen :0 out of 6
Probabilistic random walk after 152568 steps, saw 98161 distinct states, run finished after 3001 ms. (steps per millisecond=50 ) properties seen :0
[2024-06-01 02:08:27] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 188/191 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/191 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 29/220 variables, 8/17 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/220 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 231/451 variables, 26/43 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/451 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 18/469 variables, 3/46 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/469 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 29/498 variables, 6/52 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/498 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 1222/1720 variables, 498/550 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1720 variables, 0/550 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 0/1720 variables, 0/550 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1720/1720 variables, and 550 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1700 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 41/41 constraints, State Equation: 498/498 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 188/191 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/191 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 29/220 variables, 8/17 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/220 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 231/451 variables, 26/43 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/451 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 18/469 variables, 3/46 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 02:08:29] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/469 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/469 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 29/498 variables, 6/53 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/498 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 1222/1720 variables, 498/551 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1720 variables, 6/557 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1720 variables, 0/557 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 0/1720 variables, 0/557 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1720/1720 variables, and 557 constraints, problems are : Problem set: 0 solved, 6 unsolved in 8651 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 41/41 constraints, State Equation: 498/498 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 1/1 constraints]
After SMT, in 10368ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 2 different solutions.
Parikh walk visited 4 properties in 2855 ms.
Support contains 1 out of 498 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 498/498 places, 1222/1222 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 498 transition count 1221
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 497 transition count 1221
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 3 place count 496 transition count 1220
Iterating global reduction 2 with 1 rules applied. Total rules applied 4 place count 496 transition count 1220
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 5 place count 496 transition count 1219
Applied a total of 5 rules in 48 ms. Remains 496 /498 variables (removed 2) and now considering 1219/1222 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 49 ms. Remains : 496/498 places, 1219/1222 transitions.
RANDOM walk for 40000 steps (744 resets) in 169 ms. (235 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (161 resets) in 60 ms. (655 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (156 resets) in 61 ms. (645 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 205533 steps, run timeout after 3001 ms. (steps per millisecond=68 ) properties seen :0 out of 2
Probabilistic random walk after 205533 steps, saw 136562 distinct states, run finished after 3001 ms. (steps per millisecond=68 ) properties seen :0
// Phase 1: matrix 1219 rows 496 cols
[2024-06-01 02:08:43] [INFO ] Computed 52 invariants in 13 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 107/108 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 23/131 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/131 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 195/326 variables, 17/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/326 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 22/348 variables, 5/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 02:08:44] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/348 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/348 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 101/449 variables, 15/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/449 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 4/453 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/453 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 43/496 variables, 4/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/496 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 1219/1715 variables, 496/549 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1715 variables, 0/549 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 18 (OVERLAPS) 0/1715 variables, 0/549 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1715/1715 variables, and 549 constraints, problems are : Problem set: 0 solved, 2 unsolved in 937 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 41/41 constraints, State Equation: 496/496 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 107/108 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 23/131 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/131 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 195/326 variables, 17/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/326 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 22/348 variables, 5/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/348 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/348 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 101/449 variables, 15/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/449 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 4/453 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/453 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 43/496 variables, 4/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/496 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 1219/1715 variables, 496/549 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1715 variables, 2/551 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1715 variables, 0/551 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 0/1715 variables, 0/551 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1715/1715 variables, and 551 constraints, problems are : Problem set: 0 solved, 2 unsolved in 912 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 41/41 constraints, State Equation: 496/496 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 1888ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 283 ms.
Support contains 1 out of 496 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 496/496 places, 1219/1219 transitions.
Applied a total of 0 rules in 16 ms. Remains 496 /496 variables (removed 0) and now considering 1219/1219 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 496/496 places, 1219/1219 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 496/496 places, 1219/1219 transitions.
Applied a total of 0 rules in 20 ms. Remains 496 /496 variables (removed 0) and now considering 1219/1219 (removed 0) transitions.
[2024-06-01 02:08:46] [INFO ] Invariant cache hit.
[2024-06-01 02:08:46] [INFO ] Implicit Places using invariants in 684 ms returned [72]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 686 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 495/496 places, 1219/1219 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 494 transition count 1218
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 494 transition count 1217
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 4 place count 493 transition count 1217
Applied a total of 4 rules in 43 ms. Remains 493 /495 variables (removed 2) and now considering 1217/1219 (removed 2) transitions.
// Phase 1: matrix 1217 rows 493 cols
[2024-06-01 02:08:46] [INFO ] Computed 51 invariants in 12 ms
[2024-06-01 02:08:47] [INFO ] Implicit Places using invariants in 832 ms returned []
[2024-06-01 02:08:47] [INFO ] Invariant cache hit.
[2024-06-01 02:08:49] [INFO ] Implicit Places using invariants and state equation in 1611 ms returned []
Implicit Place search using SMT with State Equation took 2446 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 493/496 places, 1217/1219 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 3195 ms. Remains : 493/496 places, 1217/1219 transitions.
RANDOM walk for 40000 steps (736 resets) in 144 ms. (275 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (160 resets) in 51 ms. (769 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (154 resets) in 48 ms. (816 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 206691 steps, run timeout after 3001 ms. (steps per millisecond=68 ) properties seen :0 out of 2
Probabilistic random walk after 206691 steps, saw 137428 distinct states, run finished after 3001 ms. (steps per millisecond=68 ) properties seen :0
[2024-06-01 02:08:52] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 107/108 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 23/131 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/131 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 195/326 variables, 17/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/326 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 22/348 variables, 5/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/348 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 130/478 variables, 16/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/478 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 4/482 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/482 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 11/493 variables, 2/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/493 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 1217/1710 variables, 493/544 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1710 variables, 0/544 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 0/1710 variables, 0/544 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1710/1710 variables, and 544 constraints, problems are : Problem set: 0 solved, 2 unsolved in 941 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 40/40 constraints, State Equation: 493/493 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 107/108 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 23/131 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/131 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 195/326 variables, 17/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/326 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 22/348 variables, 5/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/348 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 130/478 variables, 16/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/478 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 4/482 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/482 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 11/493 variables, 2/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/493 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 1217/1710 variables, 493/544 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1710 variables, 2/546 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1710 variables, 0/546 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 0/1710 variables, 0/546 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1710/1710 variables, and 546 constraints, problems are : Problem set: 0 solved, 2 unsolved in 801 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 40/40 constraints, State Equation: 493/493 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 1751ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 214 ms.
Support contains 1 out of 493 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 493/493 places, 1217/1217 transitions.
Applied a total of 0 rules in 16 ms. Remains 493 /493 variables (removed 0) and now considering 1217/1217 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 493/493 places, 1217/1217 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 493/493 places, 1217/1217 transitions.
Applied a total of 0 rules in 16 ms. Remains 493 /493 variables (removed 0) and now considering 1217/1217 (removed 0) transitions.
[2024-06-01 02:08:54] [INFO ] Invariant cache hit.
[2024-06-01 02:08:55] [INFO ] Implicit Places using invariants in 646 ms returned []
[2024-06-01 02:08:55] [INFO ] Invariant cache hit.
[2024-06-01 02:08:56] [INFO ] Implicit Places using invariants and state equation in 1612 ms returned []
Implicit Place search using SMT with State Equation took 2260 ms to find 0 implicit places.
[2024-06-01 02:08:56] [INFO ] Redundant transitions in 29 ms returned []
Running 1187 sub problems to find dead transitions.
[2024-06-01 02:08:56] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/492 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1187 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/492 variables, 37/45 constraints. Problems are: Problem set: 0 solved, 1187 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 492/1710 variables, and 45 constraints, problems are : Problem set: 0 solved, 1187 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 8/11 constraints, Generalized P Invariants (flows): 37/40 constraints, State Equation: 0/493 constraints, PredecessorRefiner: 1187/1187 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1187 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/492 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1187 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/492 variables, 37/45 constraints. Problems are: Problem set: 0 solved, 1187 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/492 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1187 unsolved
At refinement iteration 3 (OVERLAPS) 1/493 variables, 3/48 constraints. Problems are: Problem set: 0 solved, 1187 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/493 variables, 3/51 constraints. Problems are: Problem set: 0 solved, 1187 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 493/1710 variables, and 51 constraints, problems are : Problem set: 0 solved, 1187 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 40/40 constraints, State Equation: 0/493 constraints, PredecessorRefiner: 0/1187 constraints, Known Traps: 0/0 constraints]
After SMT, in 60853ms problems are : Problem set: 0 solved, 1187 unsolved
Search for dead transitions found 0 dead transitions in 60869ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63186 ms. Remains : 493/493 places, 1217/1217 transitions.
FORMULA ASLink-PT-06a-UpperBounds-05 1 TECHNIQUES REACHABILITY_MAX
FORMULA ASLink-PT-06a-UpperBounds-03 1 TECHNIQUES REACHABILITY_MAX
Current structural bounds on expressions (After reachability solving 2 queries.) : Max Seen:[0] Max Struct:[1]
Starting property specific reduction for ASLink-PT-06a-UpperBounds-13
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[1]
// Phase 1: matrix 1222 rows 498 cols
[2024-06-01 02:09:57] [INFO ] Computed 52 invariants in 15 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 10000 steps (181 resets) in 25 ms. (384 steps per ms)
BEST_FIRST walk for 10001 steps (42 resets) in 10 ms. (909 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-06-01 02:09:57] [INFO ] Invariant cache hit.
[2024-06-01 02:09:57] [INFO ] [Real]Absence check using 11 positive place invariants in 9 ms returned sat
[2024-06-01 02:09:57] [INFO ] [Real]Absence check using 11 positive and 41 generalized place invariants in 21 ms returned sat
[2024-06-01 02:09:58] [INFO ] [Real]Absence check using state equation in 458 ms returned sat
[2024-06-01 02:09:58] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 02:09:58] [INFO ] [Nat]Absence check using 11 positive place invariants in 8 ms returned sat
[2024-06-01 02:09:58] [INFO ] [Nat]Absence check using 11 positive and 41 generalized place invariants in 21 ms returned sat
[2024-06-01 02:09:58] [INFO ] [Nat]Absence check using state equation in 479 ms returned sat
[2024-06-01 02:09:59] [INFO ] Computed and/alt/rep : 269/1211/269 causal constraints (skipped 923 transitions) in 87 ms.
[2024-06-01 02:09:59] [INFO ] Added : 39 causal constraints over 8 iterations in 787 ms. Result :sat
Minimization took 528 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 498 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p899) removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 498/498 places, 1221/1221 transitions.
Reduce places removed 1 places and 1 transitions.
Graph (complete) has 3038 edges and 497 vertex of which 496 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 496 transition count 1219
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 4 place count 495 transition count 1219
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 5 place count 494 transition count 1218
Iterating global reduction 2 with 1 rules applied. Total rules applied 6 place count 494 transition count 1218
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 7 place count 494 transition count 1217
Applied a total of 7 rules in 39 ms. Remains 494 /498 variables (removed 4) and now considering 1217/1221 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39 ms. Remains : 494/498 places, 1217/1221 transitions.
// Phase 1: matrix 1217 rows 494 cols
[2024-06-01 02:10:00] [INFO ] Computed 51 invariants in 11 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (17912 resets) in 2381 ms. (419 steps per ms)
BEST_FIRST walk for 1000001 steps (4016 resets) in 915 ms. (1091 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-06-01 02:10:03] [INFO ] Invariant cache hit.
[2024-06-01 02:10:03] [INFO ] [Real]Absence check using 13 positive place invariants in 11 ms returned sat
[2024-06-01 02:10:03] [INFO ] [Real]Absence check using 13 positive and 38 generalized place invariants in 21 ms returned sat
[2024-06-01 02:10:04] [INFO ] [Real]Absence check using state equation in 427 ms returned sat
[2024-06-01 02:10:04] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 02:10:04] [INFO ] [Nat]Absence check using 13 positive place invariants in 9 ms returned sat
[2024-06-01 02:10:04] [INFO ] [Nat]Absence check using 13 positive and 38 generalized place invariants in 20 ms returned sat
[2024-06-01 02:10:04] [INFO ] [Nat]Absence check using state equation in 454 ms returned sat
[2024-06-01 02:10:04] [INFO ] Computed and/alt/rep : 271/1252/271 causal constraints (skipped 916 transitions) in 91 ms.
[2024-06-01 02:10:05] [INFO ] Added : 41 causal constraints over 9 iterations in 802 ms. Result :sat
Minimization took 887 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 494 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 494/494 places, 1217/1217 transitions.
Applied a total of 0 rules in 17 ms. Remains 494 /494 variables (removed 0) and now considering 1217/1217 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 494/494 places, 1217/1217 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 494/494 places, 1217/1217 transitions.
Applied a total of 0 rules in 16 ms. Remains 494 /494 variables (removed 0) and now considering 1217/1217 (removed 0) transitions.
[2024-06-01 02:10:06] [INFO ] Invariant cache hit.
[2024-06-01 02:10:07] [INFO ] Implicit Places using invariants in 698 ms returned [72]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 700 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 493/494 places, 1217/1217 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 492 transition count 1216
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 492 transition count 1215
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 4 place count 491 transition count 1215
Applied a total of 4 rules in 67 ms. Remains 491 /493 variables (removed 2) and now considering 1215/1217 (removed 2) transitions.
// Phase 1: matrix 1215 rows 491 cols
[2024-06-01 02:10:07] [INFO ] Computed 50 invariants in 16 ms
[2024-06-01 02:10:08] [INFO ] Implicit Places using invariants in 773 ms returned []
[2024-06-01 02:10:08] [INFO ] Invariant cache hit.
[2024-06-01 02:10:10] [INFO ] Implicit Places using invariants and state equation in 1719 ms returned []
Implicit Place search using SMT with State Equation took 2494 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 491/494 places, 1215/1217 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 3280 ms. Remains : 491/494 places, 1215/1217 transitions.
[2024-06-01 02:10:10] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (17786 resets) in 2329 ms. (429 steps per ms)
BEST_FIRST walk for 1000001 steps (3987 resets) in 913 ms. (1094 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-06-01 02:10:13] [INFO ] Invariant cache hit.
[2024-06-01 02:10:13] [INFO ] [Real]Absence check using 15 positive place invariants in 10 ms returned sat
[2024-06-01 02:10:13] [INFO ] [Real]Absence check using 15 positive and 35 generalized place invariants in 17 ms returned sat
[2024-06-01 02:10:14] [INFO ] [Real]Absence check using state equation in 477 ms returned sat
[2024-06-01 02:10:14] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 02:10:14] [INFO ] [Nat]Absence check using 15 positive place invariants in 10 ms returned sat
[2024-06-01 02:10:14] [INFO ] [Nat]Absence check using 15 positive and 35 generalized place invariants in 17 ms returned sat
[2024-06-01 02:10:14] [INFO ] [Nat]Absence check using state equation in 482 ms returned sat
[2024-06-01 02:10:14] [INFO ] Computed and/alt/rep : 262/1179/262 causal constraints (skipped 923 transitions) in 94 ms.
[2024-06-01 02:10:15] [INFO ] Added : 38 causal constraints over 8 iterations in 716 ms. Result :sat
Minimization took 1563 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 491 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 491/491 places, 1215/1215 transitions.
Applied a total of 0 rules in 16 ms. Remains 491 /491 variables (removed 0) and now considering 1215/1215 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 491/491 places, 1215/1215 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 491/491 places, 1215/1215 transitions.
Applied a total of 0 rules in 16 ms. Remains 491 /491 variables (removed 0) and now considering 1215/1215 (removed 0) transitions.
[2024-06-01 02:10:17] [INFO ] Invariant cache hit.
[2024-06-01 02:10:17] [INFO ] Implicit Places using invariants in 668 ms returned []
[2024-06-01 02:10:17] [INFO ] Invariant cache hit.
[2024-06-01 02:10:19] [INFO ] Implicit Places using invariants and state equation in 1740 ms returned []
Implicit Place search using SMT with State Equation took 2409 ms to find 0 implicit places.
[2024-06-01 02:10:19] [INFO ] Redundant transitions in 18 ms returned []
Running 1185 sub problems to find dead transitions.
[2024-06-01 02:10:19] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/489 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1185 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/489 variables, 31/41 constraints. Problems are: Problem set: 0 solved, 1185 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/489 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1185 unsolved
SMT process timed out in 30723ms, After SMT, problems are : Problem set: 0 solved, 1185 unsolved
Search for dead transitions found 0 dead transitions in 30738ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33191 ms. Remains : 491/491 places, 1215/1215 transitions.
RANDOM walk for 40000 steps (744 resets) in 190 ms. (209 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (148 resets) in 48 ms. (816 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (157 resets) in 49 ms. (800 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 209974 steps, run timeout after 3001 ms. (steps per millisecond=69 ) properties seen :0 out of 2
Probabilistic random walk after 209974 steps, saw 139841 distinct states, run finished after 3001 ms. (steps per millisecond=69 ) properties seen :0
[2024-06-01 02:10:53] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 36/37 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 11/48 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 6/54 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/54 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 13/67 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/67 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 33/100 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/100 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 156/256 variables, 13/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/256 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 22/278 variables, 5/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 02:10:53] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/278 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/278 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 150/428 variables, 14/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/428 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 5/433 variables, 2/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/433 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 57/490 variables, 8/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/490 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 1215/1705 variables, 490/541 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1705 variables, 0/541 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 1/1706 variables, 1/542 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1706 variables, 0/542 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (OVERLAPS) 0/1706 variables, 0/542 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1706/1706 variables, and 542 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1245 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 35/35 constraints, State Equation: 491/491 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 36/37 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 11/48 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 6/54 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/54 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 13/67 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/67 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 33/100 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/100 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 156/256 variables, 13/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/256 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 22/278 variables, 5/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/278 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/278 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 150/428 variables, 14/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/428 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 5/433 variables, 2/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/433 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 57/490 variables, 8/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/490 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 1215/1705 variables, 490/541 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1705 variables, 2/543 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1705 variables, 0/543 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 1/1706 variables, 1/544 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1706 variables, 0/544 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (OVERLAPS) 0/1706 variables, 0/544 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1706/1706 variables, and 544 constraints, problems are : Problem set: 0 solved, 2 unsolved in 839 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 35/35 constraints, State Equation: 491/491 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 2095ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 238 ms.
Support contains 1 out of 491 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 491/491 places, 1215/1215 transitions.
Applied a total of 0 rules in 17 ms. Remains 491 /491 variables (removed 0) and now considering 1215/1215 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 491/491 places, 1215/1215 transitions.
RANDOM walk for 40000 steps (703 resets) in 228 ms. (174 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (157 resets) in 51 ms. (769 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (154 resets) in 48 ms. (816 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 203408 steps, run timeout after 3001 ms. (steps per millisecond=67 ) properties seen :0 out of 2
Probabilistic random walk after 203408 steps, saw 135038 distinct states, run finished after 3001 ms. (steps per millisecond=67 ) properties seen :0
[2024-06-01 02:10:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 36/37 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 11/48 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 6/54 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/54 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 13/67 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/67 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 33/100 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/100 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 156/256 variables, 13/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/256 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 22/278 variables, 5/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 02:10:59] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/278 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/278 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 150/428 variables, 14/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/428 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 5/433 variables, 2/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/433 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 57/490 variables, 8/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/490 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 1215/1705 variables, 490/541 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1705 variables, 0/541 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 1/1706 variables, 1/542 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1706 variables, 0/542 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (OVERLAPS) 0/1706 variables, 0/542 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1706/1706 variables, and 542 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1077 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 35/35 constraints, State Equation: 491/491 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 36/37 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 11/48 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 6/54 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/54 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 13/67 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/67 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 33/100 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/100 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 156/256 variables, 13/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/256 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 22/278 variables, 5/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/278 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/278 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 150/428 variables, 14/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/428 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 5/433 variables, 2/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/433 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 57/490 variables, 8/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/490 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 1215/1705 variables, 490/541 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1705 variables, 2/543 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1705 variables, 0/543 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 1/1706 variables, 1/544 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1706 variables, 0/544 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (OVERLAPS) 0/1706 variables, 0/544 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1706/1706 variables, and 544 constraints, problems are : Problem set: 0 solved, 2 unsolved in 851 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 35/35 constraints, State Equation: 491/491 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 1938ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 346 ms.
Support contains 1 out of 491 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 491/491 places, 1215/1215 transitions.
Applied a total of 0 rules in 16 ms. Remains 491 /491 variables (removed 0) and now considering 1215/1215 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 491/491 places, 1215/1215 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 491/491 places, 1215/1215 transitions.
Applied a total of 0 rules in 16 ms. Remains 491 /491 variables (removed 0) and now considering 1215/1215 (removed 0) transitions.
[2024-06-01 02:11:01] [INFO ] Invariant cache hit.
[2024-06-01 02:11:01] [INFO ] Implicit Places using invariants in 684 ms returned []
[2024-06-01 02:11:01] [INFO ] Invariant cache hit.
[2024-06-01 02:11:03] [INFO ] Implicit Places using invariants and state equation in 1552 ms returned []
Implicit Place search using SMT with State Equation took 2238 ms to find 0 implicit places.
[2024-06-01 02:11:03] [INFO ] Redundant transitions in 18 ms returned []
Running 1185 sub problems to find dead transitions.
[2024-06-01 02:11:03] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/489 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1185 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/489 variables, 31/41 constraints. Problems are: Problem set: 0 solved, 1185 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/489 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1185 unsolved
SMT process timed out in 30704ms, After SMT, problems are : Problem set: 0 solved, 1185 unsolved
Search for dead transitions found 0 dead transitions in 30717ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32997 ms. Remains : 491/491 places, 1215/1215 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 20 ms. Remains 491 /491 variables (removed 0) and now considering 1215/1215 (removed 0) transitions.
Running SMT prover for 2 properties.
[2024-06-01 02:11:34] [INFO ] Invariant cache hit.
[2024-06-01 02:11:34] [INFO ] [Real]Absence check using 15 positive place invariants in 9 ms returned sat
[2024-06-01 02:11:34] [INFO ] [Real]Absence check using 15 positive and 35 generalized place invariants in 24 ms returned sat
[2024-06-01 02:11:35] [INFO ] After 720ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-06-01 02:11:35] [INFO ] [Nat]Absence check using 15 positive place invariants in 8 ms returned sat
[2024-06-01 02:11:35] [INFO ] [Nat]Absence check using 15 positive and 35 generalized place invariants in 25 ms returned sat
[2024-06-01 02:11:35] [INFO ] After 540ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-06-01 02:11:35] [INFO ] After 665ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-06-01 02:11:35] [INFO ] After 895ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 1660 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[1]
Ending property specific reduction for ASLink-PT-06a-UpperBounds-13 in 98347 ms.
[2024-06-01 02:11:36] [INFO ] Flatten gal took : 222 ms
[2024-06-01 02:11:36] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/UpperBounds.sr.xml took 3 ms.
[2024-06-01 02:11:36] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 498 places, 1222 transitions and 4981 arcs took 13 ms.
Total runtime 499434 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : ASLink-PT-06a-UpperBounds-13

BK_STOP 1717207896741

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML
mcc2024
ub formula name ASLink-PT-06a-UpperBounds-13
ub formula formula --maxsum=/tmp/882/ub_0_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc

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="ASLink-PT-06a"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is ASLink-PT-06a, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r464-smll-171620117800093"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ASLink-PT-06a.tgz
mv ASLink-PT-06a execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;