fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r297-tall-167873950600524
Last Updated
May 14, 2023

About the Execution of LTSMin+red for PolyORBLF-PT-S02J06T08

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
723.424 226393.00 267866.00 957.00 ?FFFFT?FFFT?FTFF normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r297-tall-167873950600524.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is PolyORBLF-PT-S02J06T08, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r297-tall-167873950600524
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.7M
-rw-r--r-- 1 mcc users 21K Feb 26 14:05 CTLCardinality.txt
-rw-r--r-- 1 mcc users 127K Feb 26 14:05 CTLCardinality.xml
-rw-r--r-- 1 mcc users 29K Feb 26 14:03 CTLFireability.txt
-rw-r--r-- 1 mcc users 157K Feb 26 14:03 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 9.7K Feb 25 16:34 LTLCardinality.txt
-rw-r--r-- 1 mcc users 43K Feb 25 16:34 LTLCardinality.xml
-rw-r--r-- 1 mcc users 7.8K Feb 25 16:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 37K Feb 25 16:34 LTLFireability.xml
-rw-r--r-- 1 mcc users 21K Feb 26 14:08 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 125K Feb 26 14:08 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 36K Feb 26 14:07 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 175K Feb 26 14:07 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.8K Feb 25 16:34 UpperBounds.txt
-rw-r--r-- 1 mcc users 6.0K Feb 25 16:34 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 10 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 807K Mar 5 18:23 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1679553393295

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-PT-S02J06T08
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-23 06:36:35] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-23 06:36:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-23 06:36:35] [INFO ] Load time of PNML (sax parser for PT used): 108 ms
[2023-03-23 06:36:35] [INFO ] Transformed 690 places.
[2023-03-23 06:36:35] [INFO ] Transformed 1434 transitions.
[2023-03-23 06:36:35] [INFO ] Parsed PT model containing 690 places and 1434 transitions and 6564 arcs in 194 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
Ensure Unique test removed 128 transitions
Reduce redundant transitions removed 128 transitions.
FORMULA PolyORBLF-PT-S02J06T08-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S02J06T08-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S02J06T08-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S02J06T08-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S02J06T08-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 122 out of 690 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 690/690 places, 1306/1306 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 682 transition count 1298
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 682 transition count 1298
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 24 place count 674 transition count 1290
Iterating global reduction 0 with 8 rules applied. Total rules applied 32 place count 674 transition count 1290
Applied a total of 32 rules in 122 ms. Remains 674 /690 variables (removed 16) and now considering 1290/1306 (removed 16) transitions.
[2023-03-23 06:36:35] [INFO ] Flow matrix only has 1274 transitions (discarded 16 similar events)
// Phase 1: matrix 1274 rows 674 cols
[2023-03-23 06:36:35] [INFO ] Computed 54 place invariants in 88 ms
[2023-03-23 06:36:37] [INFO ] Dead Transitions using invariants and state equation in 1817 ms found 88 transitions.
Found 88 dead transitions using SMT.
Drop transitions removed 88 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 88 transitions.
[2023-03-23 06:36:37] [INFO ] Flow matrix only has 1186 transitions (discarded 16 similar events)
// Phase 1: matrix 1186 rows 674 cols
[2023-03-23 06:36:37] [INFO ] Computed 54 place invariants in 50 ms
[2023-03-23 06:36:38] [INFO ] Implicit Places using invariants in 791 ms returned [68, 179, 343, 459, 483, 563, 570]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 797 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 667/690 places, 1202/1306 transitions.
Reduce places removed 2 places and 16 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 665 transition count 1186
Reduce places removed 16 places and 16 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 18 place count 649 transition count 1170
Applied a total of 18 rules in 26 ms. Remains 649 /667 variables (removed 18) and now considering 1170/1202 (removed 32) transitions.
[2023-03-23 06:36:38] [INFO ] Flow matrix only has 1154 transitions (discarded 16 similar events)
// Phase 1: matrix 1154 rows 649 cols
[2023-03-23 06:36:38] [INFO ] Computed 47 place invariants in 28 ms
[2023-03-23 06:36:38] [INFO ] Implicit Places using invariants in 509 ms returned []
[2023-03-23 06:36:38] [INFO ] Flow matrix only has 1154 transitions (discarded 16 similar events)
[2023-03-23 06:36:38] [INFO ] Invariant cache hit.
[2023-03-23 06:36:39] [INFO ] State equation strengthened by 96 read => feed constraints.
[2023-03-23 06:36:47] [INFO ] Implicit Places using invariants and state equation in 8749 ms returned []
Implicit Place search using SMT with State Equation took 9269 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 649/690 places, 1170/1306 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 12066 ms. Remains : 649/690 places, 1170/1306 transitions.
Support contains 122 out of 649 places after structural reductions.
[2023-03-23 06:36:48] [INFO ] Flatten gal took : 122 ms
[2023-03-23 06:36:48] [INFO ] Flatten gal took : 75 ms
[2023-03-23 06:36:48] [INFO ] Input system was already deterministic with 1170 transitions.
Incomplete random walk after 10000 steps, including 4 resets, run finished after 405 ms. (steps per millisecond=24 ) properties (out of 20) seen :17
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 124 ms. (steps per millisecond=80 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=136 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-23 06:36:48] [INFO ] Flow matrix only has 1154 transitions (discarded 16 similar events)
[2023-03-23 06:36:48] [INFO ] Invariant cache hit.
[2023-03-23 06:36:49] [INFO ] [Real]Absence check using 13 positive place invariants in 4 ms returned sat
[2023-03-23 06:36:49] [INFO ] [Real]Absence check using 13 positive and 34 generalized place invariants in 30 ms returned sat
[2023-03-23 06:36:49] [INFO ] After 176ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 3 ms.
Successfully simplified 2 atomic propositions for a total of 11 simplifications.
Computed a total of 0 stabilizing places and 0 stable transitions
FORMULA PolyORBLF-PT-S02J06T08-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(p0))||F(G(F((F(G(p1))||!p0))))))'
Support contains 14 out of 649 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 649/649 places, 1170/1170 transitions.
Applied a total of 0 rules in 22 ms. Remains 649 /649 variables (removed 0) and now considering 1170/1170 (removed 0) transitions.
[2023-03-23 06:36:49] [INFO ] Flow matrix only has 1154 transitions (discarded 16 similar events)
[2023-03-23 06:36:49] [INFO ] Invariant cache hit.
[2023-03-23 06:36:50] [INFO ] Dead Transitions using invariants and state equation in 1341 ms found 0 transitions.
[2023-03-23 06:36:50] [INFO ] Flow matrix only has 1154 transitions (discarded 16 similar events)
[2023-03-23 06:36:50] [INFO ] Invariant cache hit.
[2023-03-23 06:36:51] [INFO ] Implicit Places using invariants in 566 ms returned [281]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 569 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 648/649 places, 1170/1170 transitions.
Applied a total of 0 rules in 9 ms. Remains 648 /648 variables (removed 0) and now considering 1170/1170 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1943 ms. Remains : 648/649 places, 1170/1170 transitions.
Stuttering acceptance computed with spot in 344 ms :[false, (AND p0 (NOT p1)), (AND p0 (NOT p1)), false, false]
Running random walk in product with property : PolyORBLF-PT-S02J06T08-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(AND p0 p1), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 0}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p0:(OR (AND (GEQ s26 1) (GEQ s120 1) (GEQ s306 1) (GEQ s446 1)) (AND (GEQ s26 1) (GEQ s120 1) (GEQ s376 1) (GEQ s542 1))), p1:(AND (LT s594 1) (LT s494 1)...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 175 reset in 523 ms.
Product exploration explored 100000 steps with 205 reset in 460 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 2 factoid took 95 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 219 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), false]
Finished random walk after 436 steps, including 1 resets, run visited all 3 properties in 4 ms. (steps per millisecond=109 )
Knowledge obtained : [(AND p0 p1), (X (X (NOT p0)))]
False Knowledge obtained : [(F (AND (NOT p1) p0)), (F (NOT p0)), (F (NOT (AND p1 p0)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 2 factoid took 163 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter insensitive) to 5 states, 8 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 228 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), false]
Stuttering acceptance computed with spot in 202 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), false]
Support contains 14 out of 648 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 648/648 places, 1170/1170 transitions.
Drop transitions removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 0 with 40 rules applied. Total rules applied 40 place count 648 transition count 1130
Reduce places removed 40 places and 0 transitions.
Iterating post reduction 1 with 40 rules applied. Total rules applied 80 place count 608 transition count 1130
Performed 80 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 80 Pre rules applied. Total rules applied 80 place count 608 transition count 1050
Deduced a syphon composed of 80 places in 1 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 2 with 160 rules applied. Total rules applied 240 place count 528 transition count 1050
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 64 rules applied. Total rules applied 304 place count 496 transition count 1018
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 307 place count 493 transition count 1015
Iterating global reduction 2 with 3 rules applied. Total rules applied 310 place count 493 transition count 1015
Applied a total of 310 rules in 145 ms. Remains 493 /648 variables (removed 155) and now considering 1015/1170 (removed 155) transitions.
[2023-03-23 06:36:53] [INFO ] Flow matrix only has 999 transitions (discarded 16 similar events)
// Phase 1: matrix 999 rows 493 cols
[2023-03-23 06:36:53] [INFO ] Computed 46 place invariants in 13 ms
[2023-03-23 06:36:54] [INFO ] Dead Transitions using invariants and state equation in 826 ms found 0 transitions.
[2023-03-23 06:36:54] [INFO ] Flow matrix only has 999 transitions (discarded 16 similar events)
[2023-03-23 06:36:54] [INFO ] Invariant cache hit.
[2023-03-23 06:36:55] [INFO ] Implicit Places using invariants in 583 ms returned []
[2023-03-23 06:36:55] [INFO ] Flow matrix only has 999 transitions (discarded 16 similar events)
[2023-03-23 06:36:55] [INFO ] Invariant cache hit.
[2023-03-23 06:36:55] [INFO ] State equation strengthened by 96 read => feed constraints.
[2023-03-23 06:37:05] [INFO ] Implicit Places using invariants and state equation in 10186 ms returned []
Implicit Place search using SMT with State Equation took 10791 ms to find 0 implicit places.
[2023-03-23 06:37:05] [INFO ] Redundant transitions in 67 ms returned []
[2023-03-23 06:37:05] [INFO ] Flow matrix only has 999 transitions (discarded 16 similar events)
[2023-03-23 06:37:05] [INFO ] Invariant cache hit.
[2023-03-23 06:37:06] [INFO ] Dead Transitions using invariants and state equation in 885 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 493/648 places, 1015/1170 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 12729 ms. Remains : 493/648 places, 1015/1170 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0), (X p0), true, (X (X (NOT (AND (NOT p1) p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 141 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 96 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Finished random walk after 185 steps, including 0 resets, run visited all 2 properties in 4 ms. (steps per millisecond=46 )
Knowledge obtained : [(AND p1 p0), (X p0), true, (X (X (NOT (AND (NOT p1) p0))))]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F (NOT (AND p0 p1)))]
Knowledge based reduction with 4 factoid took 190 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 101 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 119 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 176 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Product exploration explored 100000 steps with 579 reset in 439 ms.
Product exploration explored 100000 steps with 552 reset in 453 ms.
Support contains 14 out of 493 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 493/493 places, 1015/1015 transitions.
Applied a total of 0 rules in 32 ms. Remains 493 /493 variables (removed 0) and now considering 1015/1015 (removed 0) transitions.
[2023-03-23 06:37:08] [INFO ] Flow matrix only has 999 transitions (discarded 16 similar events)
[2023-03-23 06:37:08] [INFO ] Invariant cache hit.
[2023-03-23 06:37:09] [INFO ] Dead Transitions using invariants and state equation in 797 ms found 0 transitions.
[2023-03-23 06:37:09] [INFO ] Flow matrix only has 999 transitions (discarded 16 similar events)
[2023-03-23 06:37:09] [INFO ] Invariant cache hit.
[2023-03-23 06:37:09] [INFO ] Implicit Places using invariants in 536 ms returned []
[2023-03-23 06:37:09] [INFO ] Flow matrix only has 999 transitions (discarded 16 similar events)
[2023-03-23 06:37:09] [INFO ] Invariant cache hit.
[2023-03-23 06:37:10] [INFO ] State equation strengthened by 96 read => feed constraints.
[2023-03-23 06:37:20] [INFO ] Implicit Places using invariants and state equation in 10684 ms returned []
Implicit Place search using SMT with State Equation took 11223 ms to find 0 implicit places.
[2023-03-23 06:37:20] [INFO ] Redundant transitions in 20 ms returned []
[2023-03-23 06:37:20] [INFO ] Flow matrix only has 999 transitions (discarded 16 similar events)
[2023-03-23 06:37:20] [INFO ] Invariant cache hit.
[2023-03-23 06:37:21] [INFO ] Dead Transitions using invariants and state equation in 887 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 12984 ms. Remains : 493/493 places, 1015/1015 transitions.
Treatment of property PolyORBLF-PT-S02J06T08-LTLFireability-00 finished in 32004 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(p1))))'
Support contains 19 out of 649 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 649/649 places, 1170/1170 transitions.
Ensure Unique test removed 2 places
Drop transitions removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 0 with 40 rules applied. Total rules applied 40 place count 647 transition count 1130
Reduce places removed 40 places and 0 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 1 with 48 rules applied. Total rules applied 88 place count 607 transition count 1122
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 96 place count 599 transition count 1122
Performed 88 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 88 Pre rules applied. Total rules applied 96 place count 599 transition count 1034
Deduced a syphon composed of 88 places in 1 ms
Reduce places removed 88 places and 0 transitions.
Iterating global reduction 3 with 176 rules applied. Total rules applied 272 place count 511 transition count 1034
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 3 with 96 rules applied. Total rules applied 368 place count 463 transition count 986
Applied a total of 368 rules in 119 ms. Remains 463 /649 variables (removed 186) and now considering 986/1170 (removed 184) transitions.
[2023-03-23 06:37:21] [INFO ] Flow matrix only has 970 transitions (discarded 16 similar events)
// Phase 1: matrix 970 rows 463 cols
[2023-03-23 06:37:21] [INFO ] Computed 45 place invariants in 14 ms
[2023-03-23 06:37:22] [INFO ] Dead Transitions using invariants and state equation in 1082 ms found 0 transitions.
[2023-03-23 06:37:22] [INFO ] Flow matrix only has 970 transitions (discarded 16 similar events)
[2023-03-23 06:37:22] [INFO ] Invariant cache hit.
[2023-03-23 06:37:23] [INFO ] Implicit Places using invariants in 487 ms returned [200]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 494 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 462/649 places, 986/1170 transitions.
Applied a total of 0 rules in 24 ms. Remains 462 /462 variables (removed 0) and now considering 986/986 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1723 ms. Remains : 462/649 places, 986/1170 transitions.
Stuttering acceptance computed with spot in 101 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : PolyORBLF-PT-S02J06T08-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p0:(AND (OR (LT s306 1) (LT s334 1)) (OR (LT s182 1) (LT s306 1)) (OR (LT s306 1) (LT s377 1)) (OR (LT s65 1) (LT s306 1)) (OR (LT s120 1) (LT s306 1)) (O...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 53 reset in 727 ms.
Stack based approach found an accepted trace after 503 steps with 0 reset with depth 504 and stack size 504 in 4 ms.
FORMULA PolyORBLF-PT-S02J06T08-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property PolyORBLF-PT-S02J06T08-LTLFireability-01 finished in 2599 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 16 out of 649 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 649/649 places, 1170/1170 transitions.
Ensure Unique test removed 2 places
Drop transitions removed 56 transitions
Trivial Post-agglo rules discarded 56 transitions
Performed 56 trivial Post agglomeration. Transition count delta: 56
Iterating post reduction 0 with 56 rules applied. Total rules applied 56 place count 647 transition count 1114
Reduce places removed 56 places and 0 transitions.
Iterating post reduction 1 with 56 rules applied. Total rules applied 112 place count 591 transition count 1114
Performed 80 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 80 Pre rules applied. Total rules applied 112 place count 591 transition count 1034
Deduced a syphon composed of 80 places in 0 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 2 with 160 rules applied. Total rules applied 272 place count 511 transition count 1034
Performed 64 Post agglomeration using F-continuation condition.Transition count delta: 64
Deduced a syphon composed of 64 places in 0 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 2 with 128 rules applied. Total rules applied 400 place count 447 transition count 970
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 403 place count 444 transition count 967
Iterating global reduction 2 with 3 rules applied. Total rules applied 406 place count 444 transition count 967
Applied a total of 406 rules in 92 ms. Remains 444 /649 variables (removed 205) and now considering 967/1170 (removed 203) transitions.
[2023-03-23 06:37:24] [INFO ] Flow matrix only has 951 transitions (discarded 16 similar events)
// Phase 1: matrix 951 rows 444 cols
[2023-03-23 06:37:24] [INFO ] Computed 45 place invariants in 14 ms
[2023-03-23 06:37:24] [INFO ] Dead Transitions using invariants and state equation in 777 ms found 0 transitions.
[2023-03-23 06:37:24] [INFO ] Flow matrix only has 951 transitions (discarded 16 similar events)
[2023-03-23 06:37:24] [INFO ] Invariant cache hit.
[2023-03-23 06:37:25] [INFO ] Implicit Places using invariants in 457 ms returned [191]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 487 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 443/649 places, 967/1170 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 442 transition count 966
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 442 transition count 966
Applied a total of 2 rules in 26 ms. Remains 442 /443 variables (removed 1) and now considering 966/967 (removed 1) transitions.
[2023-03-23 06:37:25] [INFO ] Flow matrix only has 950 transitions (discarded 16 similar events)
// Phase 1: matrix 950 rows 442 cols
[2023-03-23 06:37:25] [INFO ] Computed 44 place invariants in 12 ms
[2023-03-23 06:37:25] [INFO ] Implicit Places using invariants in 517 ms returned []
[2023-03-23 06:37:25] [INFO ] Flow matrix only has 950 transitions (discarded 16 similar events)
[2023-03-23 06:37:25] [INFO ] Invariant cache hit.
[2023-03-23 06:37:26] [INFO ] State equation strengthened by 96 read => feed constraints.
[2023-03-23 06:37:31] [INFO ] Implicit Places using invariants and state equation in 5328 ms returned []
Implicit Place search using SMT with State Equation took 5860 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 442/649 places, 966/1170 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 7251 ms. Remains : 442/649 places, 966/1170 transitions.
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Running random walk in product with property : PolyORBLF-PT-S02J06T08-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (OR (LT s231 1) (LT s239 1) (LT s389 1)) (OR (LT s93 1) (LT s239 1) (LT s356 1)) (OR (LT s56 1) (LT s90 1) (LT s239 1)) (OR (LT s239 1) (LT s353 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 36 reset in 1076 ms.
Stack based approach found an accepted trace after 735 steps with 0 reset with depth 736 and stack size 736 in 9 ms.
FORMULA PolyORBLF-PT-S02J06T08-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property PolyORBLF-PT-S02J06T08-LTLFireability-02 finished in 8406 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 27 out of 649 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 649/649 places, 1170/1170 transitions.
Ensure Unique test removed 2 places
Drop transitions removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 0 with 48 rules applied. Total rules applied 48 place count 647 transition count 1122
Reduce places removed 48 places and 0 transitions.
Iterating post reduction 1 with 48 rules applied. Total rules applied 96 place count 599 transition count 1122
Performed 72 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 72 Pre rules applied. Total rules applied 96 place count 599 transition count 1050
Deduced a syphon composed of 72 places in 1 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 240 place count 527 transition count 1050
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 1 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 2 with 112 rules applied. Total rules applied 352 place count 471 transition count 994
Applied a total of 352 rules in 100 ms. Remains 471 /649 variables (removed 178) and now considering 994/1170 (removed 176) transitions.
[2023-03-23 06:37:32] [INFO ] Flow matrix only has 978 transitions (discarded 16 similar events)
// Phase 1: matrix 978 rows 471 cols
[2023-03-23 06:37:32] [INFO ] Computed 45 place invariants in 12 ms
[2023-03-23 06:37:33] [INFO ] Dead Transitions using invariants and state equation in 939 ms found 0 transitions.
[2023-03-23 06:37:33] [INFO ] Flow matrix only has 978 transitions (discarded 16 similar events)
[2023-03-23 06:37:33] [INFO ] Invariant cache hit.
[2023-03-23 06:37:34] [INFO ] Implicit Places using invariants in 506 ms returned [204]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 524 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 470/649 places, 994/1170 transitions.
Applied a total of 0 rules in 23 ms. Remains 470 /470 variables (removed 0) and now considering 994/994 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1618 ms. Remains : 470/649 places, 994/1170 transitions.
Stuttering acceptance computed with spot in 61 ms :[(NOT p0)]
Running random walk in product with property : PolyORBLF-PT-S02J06T08-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (AND (GEQ s59 1) (GEQ s192 1) (GEQ s418 1)) (AND (GEQ s32 1) (GEQ s192 1) (GEQ s418 1)) (AND (GEQ s192 1) (GEQ s322 1) (GEQ s418 1)) (AND (GEQ s192...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 2947 steps with 0 reset in 20 ms.
FORMULA PolyORBLF-PT-S02J06T08-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S02J06T08-LTLFireability-03 finished in 1742 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(X(G(X(p0)))) U p1)))'
Support contains 17 out of 649 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 649/649 places, 1170/1170 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 647 transition count 1170
Applied a total of 2 rules in 35 ms. Remains 647 /649 variables (removed 2) and now considering 1170/1170 (removed 0) transitions.
[2023-03-23 06:37:34] [INFO ] Flow matrix only has 1154 transitions (discarded 16 similar events)
// Phase 1: matrix 1154 rows 647 cols
[2023-03-23 06:37:34] [INFO ] Computed 45 place invariants in 15 ms
[2023-03-23 06:37:35] [INFO ] Dead Transitions using invariants and state equation in 1418 ms found 0 transitions.
[2023-03-23 06:37:35] [INFO ] Flow matrix only has 1154 transitions (discarded 16 similar events)
[2023-03-23 06:37:35] [INFO ] Invariant cache hit.
[2023-03-23 06:37:36] [INFO ] Implicit Places using invariants in 621 ms returned [281]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 641 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 646/649 places, 1170/1170 transitions.
Applied a total of 0 rules in 7 ms. Remains 646 /646 variables (removed 0) and now considering 1170/1170 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2116 ms. Remains : 646/649 places, 1170/1170 transitions.
Stuttering acceptance computed with spot in 216 ms :[(NOT p1), (NOT p1), (OR (NOT p0) (NOT p1)), (NOT p0), true]
Running random walk in product with property : PolyORBLF-PT-S02J06T08-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=true, acceptance={0} source=2 dest: 3}], [{ cond=p0, acceptance={} source=3 dest: 3}, { cond=(NOT p0), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(OR (AND (GEQ s513 1) (GEQ s632 1)) (AND (GEQ s342 1) (GEQ s513 1)) (AND (GEQ s275 1) (GEQ s513 1)) (AND (GEQ s47 1) (GEQ s513 1)) (AND (GEQ s164 1) (G...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA PolyORBLF-PT-S02J06T08-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S02J06T08-LTLFireability-04 finished in 2381 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)||F((p0&&F(p1)))))'
Support contains 24 out of 649 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 649/649 places, 1170/1170 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 647 transition count 1170
Applied a total of 2 rules in 9 ms. Remains 647 /649 variables (removed 2) and now considering 1170/1170 (removed 0) transitions.
[2023-03-23 06:37:36] [INFO ] Flow matrix only has 1154 transitions (discarded 16 similar events)
[2023-03-23 06:37:36] [INFO ] Invariant cache hit.
[2023-03-23 06:37:38] [INFO ] Dead Transitions using invariants and state equation in 1468 ms found 0 transitions.
[2023-03-23 06:37:38] [INFO ] Flow matrix only has 1154 transitions (discarded 16 similar events)
[2023-03-23 06:37:38] [INFO ] Invariant cache hit.
[2023-03-23 06:37:38] [INFO ] Implicit Places using invariants in 614 ms returned [281]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 616 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 646/649 places, 1170/1170 transitions.
Applied a total of 0 rules in 12 ms. Remains 646 /646 variables (removed 0) and now considering 1170/1170 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2110 ms. Remains : 646/649 places, 1170/1170 transitions.
Stuttering acceptance computed with spot in 293 ms :[(NOT p0), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : PolyORBLF-PT-S02J06T08-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=4 dest: 1}, { cond=(NOT p0), acceptance={0} source=4 dest: 4}]], initial=3, aps=[p0:(OR (GEQ s94 1) (GEQ s520 1) (GEQ s220 1) (GEQ s640 1) (GEQ s40 1) (GEQ s346 1) (GEQ s433 1) (GEQ s459 1) (GEQ s173 1) (GEQ s296 1) (GEQ s378 1) (GEQ s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 1690 reset in 475 ms.
Product exploration explored 100000 steps with 1689 reset in 530 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (AND (NOT p0) (NOT p1))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 6 factoid took 257 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 185 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Finished random walk after 53 steps, including 0 resets, run visited all 3 properties in 3 ms. (steps per millisecond=17 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (AND (NOT p0) (NOT p1))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(F p1), (F p0), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 6 factoid took 268 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 104 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 103 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
[2023-03-23 06:37:40] [INFO ] Flow matrix only has 1154 transitions (discarded 16 similar events)
// Phase 1: matrix 1154 rows 646 cols
[2023-03-23 06:37:40] [INFO ] Computed 44 place invariants in 15 ms
[2023-03-23 06:37:41] [INFO ] [Real]Absence check using 16 positive place invariants in 14 ms returned sat
[2023-03-23 06:37:41] [INFO ] [Real]Absence check using 16 positive and 28 generalized place invariants in 66 ms returned sat
[2023-03-23 06:37:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 06:37:43] [INFO ] [Real]Absence check using state equation in 1770 ms returned sat
[2023-03-23 06:37:43] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 06:37:44] [INFO ] [Nat]Absence check using 16 positive place invariants in 56 ms returned sat
[2023-03-23 06:37:44] [INFO ] [Nat]Absence check using 16 positive and 28 generalized place invariants in 93 ms returned sat
[2023-03-23 06:37:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 06:37:49] [INFO ] [Nat]Absence check using state equation in 4764 ms returned sat
[2023-03-23 06:37:49] [INFO ] State equation strengthened by 96 read => feed constraints.
[2023-03-23 06:37:49] [INFO ] [Nat]Added 96 Read/Feed constraints in 376 ms returned sat
[2023-03-23 06:37:50] [INFO ] Deduced a trap composed of 175 places in 412 ms of which 6 ms to minimize.
[2023-03-23 06:37:50] [INFO ] Deduced a trap composed of 70 places in 433 ms of which 2 ms to minimize.
[2023-03-23 06:37:51] [INFO ] Deduced a trap composed of 70 places in 477 ms of which 1 ms to minimize.
[2023-03-23 06:37:51] [INFO ] Deduced a trap composed of 144 places in 436 ms of which 2 ms to minimize.
[2023-03-23 06:37:52] [INFO ] Deduced a trap composed of 70 places in 135 ms of which 10 ms to minimize.
[2023-03-23 06:37:52] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 2601 ms
[2023-03-23 06:37:52] [INFO ] Computed and/alt/rep : 824/3181/816 causal constraints (skipped 336 transitions) in 128 ms.
[2023-03-23 06:37:59] [INFO ] Deduced a trap composed of 335 places in 563 ms of which 5 ms to minimize.
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:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:520)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:605)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:580)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
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:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-23 06:37:59] [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 EG (NOT p0)
Could not prove EG (NOT p0)
[2023-03-23 06:37:59] [INFO ] Flow matrix only has 1154 transitions (discarded 16 similar events)
[2023-03-23 06:37:59] [INFO ] Invariant cache hit.
[2023-03-23 06:37:59] [INFO ] [Real]Absence check using 16 positive place invariants in 34 ms returned sat
[2023-03-23 06:38:00] [INFO ] [Real]Absence check using 16 positive and 28 generalized place invariants in 122 ms returned sat
[2023-03-23 06:38:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 06:38:01] [INFO ] [Real]Absence check using state equation in 1718 ms returned sat
[2023-03-23 06:38:01] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 06:38:02] [INFO ] [Nat]Absence check using 16 positive place invariants in 129 ms returned sat
[2023-03-23 06:38:02] [INFO ] [Nat]Absence check using 16 positive and 28 generalized place invariants in 131 ms returned sat
[2023-03-23 06:38:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 06:38:05] [INFO ] [Nat]Absence check using state equation in 2628 ms returned sat
[2023-03-23 06:38:05] [INFO ] State equation strengthened by 96 read => feed constraints.
[2023-03-23 06:38:05] [INFO ] [Nat]Added 96 Read/Feed constraints in 437 ms returned sat
[2023-03-23 06:38:06] [INFO ] Deduced a trap composed of 70 places in 499 ms of which 0 ms to minimize.
[2023-03-23 06:38:07] [INFO ] Deduced a trap composed of 238 places in 623 ms of which 2 ms to minimize.
[2023-03-23 06:38:07] [INFO ] Deduced a trap composed of 267 places in 357 ms of which 1 ms to minimize.
[2023-03-23 06:38:08] [INFO ] Deduced a trap composed of 140 places in 377 ms of which 1 ms to minimize.
[2023-03-23 06:38:08] [INFO ] Deduced a trap composed of 218 places in 336 ms of which 1 ms to minimize.
[2023-03-23 06:38:08] [INFO ] Deduced a trap composed of 70 places in 347 ms of which 1 ms to minimize.
[2023-03-23 06:38:09] [INFO ] Deduced a trap composed of 70 places in 368 ms of which 2 ms to minimize.
[2023-03-23 06:38:10] [INFO ] Deduced a trap composed of 203 places in 693 ms of which 0 ms to minimize.
[2023-03-23 06:38:10] [INFO ] Deduced a trap composed of 70 places in 614 ms of which 1 ms to minimize.
[2023-03-23 06:38:11] [INFO ] Deduced a trap composed of 80 places in 333 ms of which 1 ms to minimize.
[2023-03-23 06:38:11] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 5479 ms
[2023-03-23 06:38:11] [INFO ] Computed and/alt/rep : 824/3181/816 causal constraints (skipped 336 transitions) in 111 ms.
[2023-03-23 06:38:17] [INFO ] Deduced a trap composed of 335 places in 377 ms of which 1 ms to minimize.
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:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:520)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:605)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:580)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
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:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-23 06:38:17] [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 EG (NOT p1)
Could not prove EG (NOT p1)
Support contains 24 out of 646 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 646/646 places, 1170/1170 transitions.
Applied a total of 0 rules in 6 ms. Remains 646 /646 variables (removed 0) and now considering 1170/1170 (removed 0) transitions.
[2023-03-23 06:38:17] [INFO ] Flow matrix only has 1154 transitions (discarded 16 similar events)
[2023-03-23 06:38:17] [INFO ] Invariant cache hit.
[2023-03-23 06:38:18] [INFO ] Dead Transitions using invariants and state equation in 1495 ms found 0 transitions.
[2023-03-23 06:38:18] [INFO ] Flow matrix only has 1154 transitions (discarded 16 similar events)
[2023-03-23 06:38:18] [INFO ] Invariant cache hit.
[2023-03-23 06:38:19] [INFO ] Implicit Places using invariants in 618 ms returned []
[2023-03-23 06:38:19] [INFO ] Flow matrix only has 1154 transitions (discarded 16 similar events)
[2023-03-23 06:38:19] [INFO ] Invariant cache hit.
[2023-03-23 06:38:19] [INFO ] State equation strengthened by 96 read => feed constraints.
[2023-03-23 06:38:29] [INFO ] Implicit Places using invariants and state equation in 9896 ms returned []
Implicit Place search using SMT with State Equation took 10516 ms to find 0 implicit places.
[2023-03-23 06:38:29] [INFO ] Flow matrix only has 1154 transitions (discarded 16 similar events)
[2023-03-23 06:38:29] [INFO ] Invariant cache hit.
[2023-03-23 06:38:30] [INFO ] Dead Transitions using invariants and state equation in 1382 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13434 ms. Remains : 646/646 places, 1170/1170 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 195 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 134 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Finished random walk after 58 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=29 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(F p1), (F p0), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 6 factoid took 268 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 93 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 145 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
[2023-03-23 06:38:31] [INFO ] Flow matrix only has 1154 transitions (discarded 16 similar events)
[2023-03-23 06:38:31] [INFO ] Invariant cache hit.
[2023-03-23 06:38:32] [INFO ] [Real]Absence check using 16 positive place invariants in 10 ms returned sat
[2023-03-23 06:38:32] [INFO ] [Real]Absence check using 16 positive and 28 generalized place invariants in 64 ms returned sat
[2023-03-23 06:38:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 06:38:33] [INFO ] [Real]Absence check using state equation in 1417 ms returned sat
[2023-03-23 06:38:33] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 06:38:34] [INFO ] [Nat]Absence check using 16 positive place invariants in 16 ms returned sat
[2023-03-23 06:38:34] [INFO ] [Nat]Absence check using 16 positive and 28 generalized place invariants in 46 ms returned sat
[2023-03-23 06:38:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 06:38:39] [INFO ] [Nat]Absence check using state equation in 5117 ms returned sat
[2023-03-23 06:38:39] [INFO ] State equation strengthened by 96 read => feed constraints.
[2023-03-23 06:38:40] [INFO ] [Nat]Added 96 Read/Feed constraints in 630 ms returned sat
[2023-03-23 06:38:40] [INFO ] Deduced a trap composed of 165 places in 407 ms of which 1 ms to minimize.
[2023-03-23 06:38:41] [INFO ] Deduced a trap composed of 147 places in 284 ms of which 0 ms to minimize.
[2023-03-23 06:38:41] [INFO ] Deduced a trap composed of 70 places in 115 ms of which 0 ms to minimize.
[2023-03-23 06:38:41] [INFO ] Deduced a trap composed of 71 places in 73 ms of which 0 ms to minimize.
[2023-03-23 06:38:41] [INFO ] Deduced a trap composed of 71 places in 239 ms of which 1 ms to minimize.
[2023-03-23 06:38:42] [INFO ] Deduced a trap composed of 71 places in 71 ms of which 0 ms to minimize.
[2023-03-23 06:38:42] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1877 ms
[2023-03-23 06:38:42] [INFO ] Computed and/alt/rep : 824/3181/816 causal constraints (skipped 336 transitions) in 73 ms.
[2023-03-23 06:38:49] [INFO ] Deduced a trap composed of 335 places in 372 ms of which 1 ms to minimize.
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:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:520)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:605)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:580)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
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:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-23 06:38:49] [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 EG (NOT p0)
Could not prove EG (NOT p0)
[2023-03-23 06:38:49] [INFO ] Flow matrix only has 1154 transitions (discarded 16 similar events)
[2023-03-23 06:38:49] [INFO ] Invariant cache hit.
[2023-03-23 06:38:49] [INFO ] [Real]Absence check using 16 positive place invariants in 11 ms returned sat
[2023-03-23 06:38:49] [INFO ] [Real]Absence check using 16 positive and 28 generalized place invariants in 65 ms returned sat
[2023-03-23 06:38:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 06:38:51] [INFO ] [Real]Absence check using state equation in 1748 ms returned sat
[2023-03-23 06:38:51] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 06:38:52] [INFO ] [Nat]Absence check using 16 positive place invariants in 37 ms returned sat
[2023-03-23 06:38:52] [INFO ] [Nat]Absence check using 16 positive and 28 generalized place invariants in 75 ms returned sat
[2023-03-23 06:38:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 06:38:55] [INFO ] [Nat]Absence check using state equation in 2685 ms returned sat
[2023-03-23 06:38:55] [INFO ] State equation strengthened by 96 read => feed constraints.
[2023-03-23 06:38:55] [INFO ] [Nat]Added 96 Read/Feed constraints in 434 ms returned sat
[2023-03-23 06:38:55] [INFO ] Deduced a trap composed of 70 places in 369 ms of which 1 ms to minimize.
[2023-03-23 06:38:56] [INFO ] Deduced a trap composed of 238 places in 339 ms of which 1 ms to minimize.
[2023-03-23 06:38:56] [INFO ] Deduced a trap composed of 267 places in 335 ms of which 0 ms to minimize.
[2023-03-23 06:38:57] [INFO ] Deduced a trap composed of 140 places in 330 ms of which 1 ms to minimize.
[2023-03-23 06:38:57] [INFO ] Deduced a trap composed of 218 places in 371 ms of which 0 ms to minimize.
[2023-03-23 06:38:58] [INFO ] Deduced a trap composed of 70 places in 325 ms of which 3 ms to minimize.
[2023-03-23 06:38:58] [INFO ] Deduced a trap composed of 70 places in 353 ms of which 0 ms to minimize.
[2023-03-23 06:38:58] [INFO ] Deduced a trap composed of 203 places in 312 ms of which 1 ms to minimize.
[2023-03-23 06:38:59] [INFO ] Deduced a trap composed of 70 places in 362 ms of which 0 ms to minimize.
[2023-03-23 06:38:59] [INFO ] Deduced a trap composed of 80 places in 315 ms of which 1 ms to minimize.
[2023-03-23 06:38:59] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 4259 ms
[2023-03-23 06:38:59] [INFO ] Computed and/alt/rep : 824/3181/816 causal constraints (skipped 336 transitions) in 73 ms.
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:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1186)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:520)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:605)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:580)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
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:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-23 06:39:06] [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 EG (NOT p1)
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 123 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 1685 reset in 493 ms.
Product exploration explored 100000 steps with 1684 reset in 549 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 99 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Support contains 24 out of 646 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 646/646 places, 1170/1170 transitions.
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 40 rules applied. Total rules applied 40 place count 646 transition count 1170
Performed 88 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 88 Pre rules applied. Total rules applied 40 place count 646 transition count 1258
Deduced a syphon composed of 128 places in 0 ms
Iterating global reduction 1 with 88 rules applied. Total rules applied 128 place count 646 transition count 1258
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 168 places in 1 ms
Iterating global reduction 1 with 40 rules applied. Total rules applied 168 place count 646 transition count 1258
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 188 place count 626 transition count 1238
Deduced a syphon composed of 152 places in 1 ms
Iterating global reduction 1 with 20 rules applied. Total rules applied 208 place count 626 transition count 1238
Deduced a syphon composed of 152 places in 1 ms
Applied a total of 208 rules in 91 ms. Remains 626 /646 variables (removed 20) and now considering 1238/1170 (removed -68) transitions.
[2023-03-23 06:39:08] [INFO ] Flow matrix only has 1222 transitions (discarded 16 similar events)
// Phase 1: matrix 1222 rows 626 cols
[2023-03-23 06:39:08] [INFO ] Computed 44 place invariants in 19 ms
[2023-03-23 06:39:09] [INFO ] Dead Transitions using invariants and state equation in 1212 ms found 0 transitions.
[2023-03-23 06:39:09] [INFO ] Redundant transitions in 26 ms returned []
[2023-03-23 06:39:09] [INFO ] Flow matrix only has 1222 transitions (discarded 16 similar events)
[2023-03-23 06:39:09] [INFO ] Invariant cache hit.
[2023-03-23 06:39:10] [INFO ] Dead Transitions using invariants and state equation in 1246 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 626/646 places, 1238/1170 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2591 ms. Remains : 626/646 places, 1238/1170 transitions.
Support contains 24 out of 646 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 646/646 places, 1170/1170 transitions.
Applied a total of 0 rules in 15 ms. Remains 646 /646 variables (removed 0) and now considering 1170/1170 (removed 0) transitions.
[2023-03-23 06:39:10] [INFO ] Flow matrix only has 1154 transitions (discarded 16 similar events)
// Phase 1: matrix 1154 rows 646 cols
[2023-03-23 06:39:10] [INFO ] Computed 44 place invariants in 20 ms
[2023-03-23 06:39:12] [INFO ] Dead Transitions using invariants and state equation in 1458 ms found 0 transitions.
[2023-03-23 06:39:12] [INFO ] Flow matrix only has 1154 transitions (discarded 16 similar events)
[2023-03-23 06:39:12] [INFO ] Invariant cache hit.
[2023-03-23 06:39:12] [INFO ] Implicit Places using invariants in 643 ms returned []
[2023-03-23 06:39:12] [INFO ] Flow matrix only has 1154 transitions (discarded 16 similar events)
[2023-03-23 06:39:12] [INFO ] Invariant cache hit.
[2023-03-23 06:39:13] [INFO ] State equation strengthened by 96 read => feed constraints.
[2023-03-23 06:39:25] [INFO ] Implicit Places using invariants and state equation in 12500 ms returned []
Implicit Place search using SMT with State Equation took 13144 ms to find 0 implicit places.
[2023-03-23 06:39:25] [INFO ] Flow matrix only has 1154 transitions (discarded 16 similar events)
[2023-03-23 06:39:25] [INFO ] Invariant cache hit.
[2023-03-23 06:39:26] [INFO ] Dead Transitions using invariants and state equation in 1362 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15983 ms. Remains : 646/646 places, 1170/1170 transitions.
Treatment of property PolyORBLF-PT-S02J06T08-LTLFireability-06 finished in 110251 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 649 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 649/649 places, 1170/1170 transitions.
Ensure Unique test removed 2 places
Drop transitions removed 56 transitions
Trivial Post-agglo rules discarded 56 transitions
Performed 56 trivial Post agglomeration. Transition count delta: 56
Iterating post reduction 0 with 56 rules applied. Total rules applied 56 place count 647 transition count 1114
Reduce places removed 56 places and 0 transitions.
Iterating post reduction 1 with 56 rules applied. Total rules applied 112 place count 591 transition count 1114
Performed 80 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 80 Pre rules applied. Total rules applied 112 place count 591 transition count 1034
Deduced a syphon composed of 80 places in 0 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 2 with 160 rules applied. Total rules applied 272 place count 511 transition count 1034
Performed 64 Post agglomeration using F-continuation condition.Transition count delta: 64
Deduced a syphon composed of 64 places in 1 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 2 with 128 rules applied. Total rules applied 400 place count 447 transition count 970
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 403 place count 444 transition count 967
Iterating global reduction 2 with 3 rules applied. Total rules applied 406 place count 444 transition count 967
Applied a total of 406 rules in 53 ms. Remains 444 /649 variables (removed 205) and now considering 967/1170 (removed 203) transitions.
[2023-03-23 06:39:26] [INFO ] Flow matrix only has 951 transitions (discarded 16 similar events)
// Phase 1: matrix 951 rows 444 cols
[2023-03-23 06:39:26] [INFO ] Computed 45 place invariants in 11 ms
[2023-03-23 06:39:27] [INFO ] Dead Transitions using invariants and state equation in 780 ms found 0 transitions.
[2023-03-23 06:39:27] [INFO ] Flow matrix only has 951 transitions (discarded 16 similar events)
[2023-03-23 06:39:27] [INFO ] Invariant cache hit.
[2023-03-23 06:39:28] [INFO ] Implicit Places using invariants in 482 ms returned [191]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 484 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 443/649 places, 967/1170 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 442 transition count 966
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 442 transition count 966
Applied a total of 2 rules in 25 ms. Remains 442 /443 variables (removed 1) and now considering 966/967 (removed 1) transitions.
[2023-03-23 06:39:28] [INFO ] Flow matrix only has 950 transitions (discarded 16 similar events)
// Phase 1: matrix 950 rows 442 cols
[2023-03-23 06:39:28] [INFO ] Computed 44 place invariants in 17 ms
[2023-03-23 06:39:28] [INFO ] Implicit Places using invariants in 528 ms returned []
[2023-03-23 06:39:28] [INFO ] Flow matrix only has 950 transitions (discarded 16 similar events)
[2023-03-23 06:39:28] [INFO ] Invariant cache hit.
[2023-03-23 06:39:29] [INFO ] State equation strengthened by 96 read => feed constraints.
[2023-03-23 06:39:35] [INFO ] Implicit Places using invariants and state equation in 6909 ms returned []
Implicit Place search using SMT with State Equation took 7437 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 442/649 places, 966/1170 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 8780 ms. Remains : 442/649 places, 966/1170 transitions.
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Running random walk in product with property : PolyORBLF-PT-S02J06T08-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s47 1) (GEQ s272 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 384 steps with 0 reset in 2 ms.
FORMULA PolyORBLF-PT-S02J06T08-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S02J06T08-LTLFireability-08 finished in 8835 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 3 out of 649 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 649/649 places, 1170/1170 transitions.
Ensure Unique test removed 2 places
Drop transitions removed 54 transitions
Trivial Post-agglo rules discarded 54 transitions
Performed 54 trivial Post agglomeration. Transition count delta: 54
Iterating post reduction 0 with 54 rules applied. Total rules applied 54 place count 647 transition count 1116
Reduce places removed 54 places and 0 transitions.
Iterating post reduction 1 with 54 rules applied. Total rules applied 108 place count 593 transition count 1116
Performed 81 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 81 Pre rules applied. Total rules applied 108 place count 593 transition count 1035
Deduced a syphon composed of 81 places in 1 ms
Reduce places removed 81 places and 0 transitions.
Iterating global reduction 2 with 162 rules applied. Total rules applied 270 place count 512 transition count 1035
Performed 63 Post agglomeration using F-continuation condition.Transition count delta: 63
Deduced a syphon composed of 63 places in 0 ms
Reduce places removed 63 places and 0 transitions.
Iterating global reduction 2 with 126 rules applied. Total rules applied 396 place count 449 transition count 972
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 399 place count 446 transition count 969
Iterating global reduction 2 with 3 rules applied. Total rules applied 402 place count 446 transition count 969
Applied a total of 402 rules in 52 ms. Remains 446 /649 variables (removed 203) and now considering 969/1170 (removed 201) transitions.
[2023-03-23 06:39:35] [INFO ] Flow matrix only has 953 transitions (discarded 16 similar events)
// Phase 1: matrix 953 rows 446 cols
[2023-03-23 06:39:35] [INFO ] Computed 45 place invariants in 18 ms
[2023-03-23 06:39:36] [INFO ] Dead Transitions using invariants and state equation in 804 ms found 0 transitions.
[2023-03-23 06:39:36] [INFO ] Flow matrix only has 953 transitions (discarded 16 similar events)
[2023-03-23 06:39:36] [INFO ] Invariant cache hit.
[2023-03-23 06:39:36] [INFO ] Implicit Places using invariants in 474 ms returned [191]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 488 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 445/649 places, 969/1170 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 444 transition count 968
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 444 transition count 968
Applied a total of 2 rules in 26 ms. Remains 444 /445 variables (removed 1) and now considering 968/969 (removed 1) transitions.
[2023-03-23 06:39:37] [INFO ] Flow matrix only has 952 transitions (discarded 16 similar events)
// Phase 1: matrix 952 rows 444 cols
[2023-03-23 06:39:37] [INFO ] Computed 44 place invariants in 12 ms
[2023-03-23 06:39:37] [INFO ] Implicit Places using invariants in 639 ms returned []
[2023-03-23 06:39:37] [INFO ] Flow matrix only has 952 transitions (discarded 16 similar events)
[2023-03-23 06:39:37] [INFO ] Invariant cache hit.
[2023-03-23 06:39:38] [INFO ] State equation strengthened by 96 read => feed constraints.
[2023-03-23 06:39:49] [INFO ] Implicit Places using invariants and state equation in 12066 ms returned []
Implicit Place search using SMT with State Equation took 12717 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 444/649 places, 968/1170 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 14089 ms. Remains : 444/649 places, 968/1170 transitions.
Stuttering acceptance computed with spot in 98 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : PolyORBLF-PT-S02J06T08-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s30 1) (GEQ s349 1)), p1:(GEQ s429 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 2167 steps with 0 reset in 10 ms.
FORMULA PolyORBLF-PT-S02J06T08-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S02J06T08-LTLFireability-09 finished in 14214 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 3 out of 649 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 649/649 places, 1170/1170 transitions.
Ensure Unique test removed 2 places
Drop transitions removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 0 with 40 rules applied. Total rules applied 40 place count 647 transition count 1130
Reduce places removed 40 places and 0 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 1 with 48 rules applied. Total rules applied 88 place count 607 transition count 1122
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 96 place count 599 transition count 1122
Performed 88 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 88 Pre rules applied. Total rules applied 96 place count 599 transition count 1034
Deduced a syphon composed of 88 places in 1 ms
Reduce places removed 88 places and 0 transitions.
Iterating global reduction 3 with 176 rules applied. Total rules applied 272 place count 511 transition count 1034
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 3 with 80 rules applied. Total rules applied 352 place count 471 transition count 994
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 355 place count 468 transition count 991
Iterating global reduction 3 with 3 rules applied. Total rules applied 358 place count 468 transition count 991
Applied a total of 358 rules in 59 ms. Remains 468 /649 variables (removed 181) and now considering 991/1170 (removed 179) transitions.
[2023-03-23 06:39:49] [INFO ] Flow matrix only has 975 transitions (discarded 16 similar events)
// Phase 1: matrix 975 rows 468 cols
[2023-03-23 06:39:49] [INFO ] Computed 45 place invariants in 11 ms
[2023-03-23 06:39:50] [INFO ] Dead Transitions using invariants and state equation in 936 ms found 0 transitions.
[2023-03-23 06:39:50] [INFO ] Flow matrix only has 975 transitions (discarded 16 similar events)
[2023-03-23 06:39:50] [INFO ] Invariant cache hit.
[2023-03-23 06:39:51] [INFO ] Implicit Places using invariants in 520 ms returned []
[2023-03-23 06:39:51] [INFO ] Flow matrix only has 975 transitions (discarded 16 similar events)
[2023-03-23 06:39:51] [INFO ] Invariant cache hit.
[2023-03-23 06:39:51] [INFO ] State equation strengthened by 96 read => feed constraints.
[2023-03-23 06:39:56] [INFO ] Implicit Places using invariants and state equation in 4741 ms returned []
Implicit Place search using SMT with State Equation took 5288 ms to find 0 implicit places.
[2023-03-23 06:39:56] [INFO ] Redundant transitions in 15 ms returned []
[2023-03-23 06:39:56] [INFO ] Flow matrix only has 975 transitions (discarded 16 similar events)
[2023-03-23 06:39:56] [INFO ] Invariant cache hit.
[2023-03-23 06:39:56] [INFO ] Dead Transitions using invariants and state equation in 818 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 468/649 places, 991/1170 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7153 ms. Remains : 468/649 places, 991/1170 transitions.
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBLF-PT-S02J06T08-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LT s181 1) (LT s200 1) (LT s351 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 486 reset in 388 ms.
Product exploration explored 100000 steps with 547 reset in 417 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 99 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 55 ms :[(NOT p0), (NOT p0)]
Finished random walk after 118 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=59 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 130 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 60 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
Support contains 3 out of 468 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 468/468 places, 991/991 transitions.
Applied a total of 0 rules in 16 ms. Remains 468 /468 variables (removed 0) and now considering 991/991 (removed 0) transitions.
[2023-03-23 06:39:58] [INFO ] Flow matrix only has 975 transitions (discarded 16 similar events)
[2023-03-23 06:39:58] [INFO ] Invariant cache hit.
[2023-03-23 06:39:59] [INFO ] Dead Transitions using invariants and state equation in 930 ms found 0 transitions.
[2023-03-23 06:39:59] [INFO ] Flow matrix only has 975 transitions (discarded 16 similar events)
[2023-03-23 06:39:59] [INFO ] Invariant cache hit.
[2023-03-23 06:39:59] [INFO ] Implicit Places using invariants in 539 ms returned []
[2023-03-23 06:39:59] [INFO ] Flow matrix only has 975 transitions (discarded 16 similar events)
[2023-03-23 06:39:59] [INFO ] Invariant cache hit.
[2023-03-23 06:40:00] [INFO ] State equation strengthened by 96 read => feed constraints.
[2023-03-23 06:40:04] [INFO ] Implicit Places using invariants and state equation in 4911 ms returned []
Implicit Place search using SMT with State Equation took 5494 ms to find 0 implicit places.
[2023-03-23 06:40:04] [INFO ] Redundant transitions in 15 ms returned []
[2023-03-23 06:40:04] [INFO ] Flow matrix only has 975 transitions (discarded 16 similar events)
[2023-03-23 06:40:04] [INFO ] Invariant cache hit.
[2023-03-23 06:40:05] [INFO ] Dead Transitions using invariants and state equation in 792 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7278 ms. Remains : 468/468 places, 991/991 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 109 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Finished random walk after 87 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=43 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 116 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 57 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 505 reset in 395 ms.
Product exploration explored 100000 steps with 549 reset in 406 ms.
Support contains 3 out of 468 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 468/468 places, 991/991 transitions.
Applied a total of 0 rules in 15 ms. Remains 468 /468 variables (removed 0) and now considering 991/991 (removed 0) transitions.
[2023-03-23 06:40:06] [INFO ] Flow matrix only has 975 transitions (discarded 16 similar events)
[2023-03-23 06:40:06] [INFO ] Invariant cache hit.
[2023-03-23 06:40:07] [INFO ] Dead Transitions using invariants and state equation in 800 ms found 0 transitions.
[2023-03-23 06:40:07] [INFO ] Flow matrix only has 975 transitions (discarded 16 similar events)
[2023-03-23 06:40:07] [INFO ] Invariant cache hit.
[2023-03-23 06:40:08] [INFO ] Implicit Places using invariants in 527 ms returned []
[2023-03-23 06:40:08] [INFO ] Flow matrix only has 975 transitions (discarded 16 similar events)
[2023-03-23 06:40:08] [INFO ] Invariant cache hit.
[2023-03-23 06:40:08] [INFO ] State equation strengthened by 96 read => feed constraints.
[2023-03-23 06:40:14] [INFO ] Implicit Places using invariants and state equation in 6005 ms returned []
Implicit Place search using SMT with State Equation took 6541 ms to find 0 implicit places.
[2023-03-23 06:40:14] [INFO ] Redundant transitions in 18 ms returned []
[2023-03-23 06:40:14] [INFO ] Flow matrix only has 975 transitions (discarded 16 similar events)
[2023-03-23 06:40:14] [INFO ] Invariant cache hit.
[2023-03-23 06:40:15] [INFO ] Dead Transitions using invariants and state equation in 799 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8196 ms. Remains : 468/468 places, 991/991 transitions.
Treatment of property PolyORBLF-PT-S02J06T08-LTLFireability-11 finished in 25322 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 2 out of 649 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 649/649 places, 1170/1170 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 647 transition count 1170
Applied a total of 2 rules in 16 ms. Remains 647 /649 variables (removed 2) and now considering 1170/1170 (removed 0) transitions.
[2023-03-23 06:40:15] [INFO ] Flow matrix only has 1154 transitions (discarded 16 similar events)
// Phase 1: matrix 1154 rows 647 cols
[2023-03-23 06:40:15] [INFO ] Computed 45 place invariants in 21 ms
[2023-03-23 06:40:16] [INFO ] Dead Transitions using invariants and state equation in 1383 ms found 0 transitions.
[2023-03-23 06:40:16] [INFO ] Flow matrix only has 1154 transitions (discarded 16 similar events)
[2023-03-23 06:40:16] [INFO ] Invariant cache hit.
[2023-03-23 06:40:17] [INFO ] Implicit Places using invariants in 637 ms returned [281]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 640 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 646/649 places, 1170/1170 transitions.
Applied a total of 0 rules in 12 ms. Remains 646 /646 variables (removed 0) and now considering 1170/1170 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2052 ms. Remains : 646/649 places, 1170/1170 transitions.
Stuttering acceptance computed with spot in 121 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBLF-PT-S02J06T08-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(OR (LT s543 1) (LT s638 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 342 steps with 1 reset in 4 ms.
FORMULA PolyORBLF-PT-S02J06T08-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S02J06T08-LTLFireability-15 finished in 2198 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(p0))||F(G(F((F(G(p1))||!p0))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)||F((p0&&F(p1)))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
[2023-03-23 06:40:17] [INFO ] Flatten gal took : 79 ms
[2023-03-23 06:40:17] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2023-03-23 06:40:17] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 649 places, 1170 transitions and 5006 arcs took 10 ms.
Total runtime 222497 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1439/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1439/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1439/ltl_2_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : PolyORBLF-PT-S02J06T08-LTLFireability-00
Could not compute solution for formula : PolyORBLF-PT-S02J06T08-LTLFireability-06
Could not compute solution for formula : PolyORBLF-PT-S02J06T08-LTLFireability-11

BK_STOP 1679553619688

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2023
ltl formula name PolyORBLF-PT-S02J06T08-LTLFireability-00
ltl formula formula --ltl=/tmp/1439/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 649 places, 1170 transitions and 5006 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.130 real 0.030 user 0.040 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1439/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1439/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1439/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1439/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 6 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
malloc_consolidate(): invalid chunk size
ltl formula name PolyORBLF-PT-S02J06T08-LTLFireability-06
ltl formula formula --ltl=/tmp/1439/ltl_1_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 649 places, 1170 transitions and 5006 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.130 real 0.030 user 0.050 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1439/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1439/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1439/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1439/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
free(): double free detected in tcache 2
ltl formula name PolyORBLF-PT-S02J06T08-LTLFireability-11
ltl formula formula --ltl=/tmp/1439/ltl_2_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 649 places, 1170 transitions and 5006 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.140 real 0.030 user 0.050 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1439/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1439/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1439/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1439/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)

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="PolyORBLF-PT-S02J06T08"
export BK_EXAMINATION="LTLFireability"
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-5348"
echo " Executing tool ltsminxred"
echo " Input is PolyORBLF-PT-S02J06T08, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r297-tall-167873950600524"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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