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.r341-tall-167889213600148.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 lolaxred
Input is RERS2020-PT-pb103, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r341-tall-167889213600148
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 18M
-rw-r--r-- 1 mcc users 7.2K Feb 26 08:33 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K Feb 26 08:33 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Feb 26 08:31 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Feb 26 08:31 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:40 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 16:40 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 16:40 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:40 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 26 08:36 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 130K Feb 26 08:36 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.8K Feb 26 08:35 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 64K Feb 26 08:35 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:40 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:40 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 18M 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

FORMULA_NAME StableMarking

=== Now, execution of the tool begins

BK_START 1679102955028

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=lolaxred
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=RERS2020-PT-pb103
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-18 01:29:16] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2023-03-18 01:29:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 01:29:17] [INFO ] Load time of PNML (sax parser for PT used): 677 ms
[2023-03-18 01:29:17] [INFO ] Transformed 520 places.
[2023-03-18 01:29:17] [INFO ] Transformed 31658 transitions.
[2023-03-18 01:29:17] [INFO ] Found NUPN structural information;
[2023-03-18 01:29:17] [INFO ] Parsed PT model containing 520 places and 31658 transitions and 125892 arcs in 859 ms.
Ensure Unique test removed 3229 transitions
Reduce redundant transitions removed 3229 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 801 ms. (steps per millisecond=12 ) properties (out of 520) seen :218
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=12 ) properties (out of 302) seen :1
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=12 ) properties (out of 301) seen :1
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=14 ) properties (out of 300) seen :1
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=20 ) properties (out of 299) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=16 ) properties (out of 299) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=20 ) properties (out of 299) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=14 ) properties (out of 299) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=16 ) properties (out of 299) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=10 ) properties (out of 299) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 299) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 299) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 299) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 299) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 299) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 299) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 299) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 299) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 299) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 299) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 299) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=11 ) properties (out of 299) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 299) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=16 ) properties (out of 299) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=20 ) properties (out of 299) seen :1
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 298) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=20 ) properties (out of 298) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 298) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 298) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 298) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 298) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 298) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 298) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 298) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 298) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=20 ) properties (out of 298) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 298) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 298) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 298) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 298) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 298) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 298) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 298) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 298) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 298) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 298) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 298) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 298) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 298) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=20 ) properties (out of 298) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 298) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 298) seen :1
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 297) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 297) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 297) seen :1
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 296) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 296) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 296) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 296) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 296) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=16 ) properties (out of 296) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 296) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 296) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 296) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 296) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 296) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 296) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 296) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 296) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 296) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 296) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 296) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 296) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 296) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 296) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 296) seen :1
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 295) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 295) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 295) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 295) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 295) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 295) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 295) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 295) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 295) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 295) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 295) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 295) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 295) seen :1
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 294) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 294) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 294) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 294) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 294) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 294) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 294) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 294) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 294) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 294) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 294) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=20 ) properties (out of 294) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 294) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 294) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=20 ) properties (out of 294) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 294) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 294) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 294) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 294) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 294) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 294) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 294) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 294) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 294) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 294) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 294) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 294) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 294) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 294) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 294) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 294) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 294) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 294) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 294) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 294) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 294) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 294) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 294) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 294) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 294) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 294) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 294) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 294) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 294) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 294) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 294) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 294) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 294) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 294) seen :0
Running SMT prover for 294 properties.
[2023-03-18 01:29:18] [INFO ] Flow matrix only has 18674 transitions (discarded 9755 similar events)
// Phase 1: matrix 18674 rows 520 cols
[2023-03-18 01:29:19] [INFO ] Computed 15 place invariants in 118 ms
[2023-03-18 01:29:24] [INFO ] After 3406ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:294
[2023-03-18 01:29:27] [INFO ] [Nat]Absence check using 8 positive place invariants in 9 ms returned sat
[2023-03-18 01:29:27] [INFO ] [Nat]Absence check using 8 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-18 01:29:49] [INFO ] After 20848ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :294
[2023-03-18 01:29:50] [INFO ] State equation strengthened by 1379 read => feed constraints.
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.verifyPossible(DeadlockTester.java:642)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.applyReachabilitySolver(GlobalPropertySolver.java:724)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:558)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preSolveLiveness(GlobalPropertySolver.java:412)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preStableMarking(GlobalPropertySolver.java:321)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:294)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:386)
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-18 01:29:50] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-18 01:29:50] [INFO ] After 25267ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:294
Fused 294 Parikh solutions to 58 different solutions.
Parikh walk visited 0 properties in 220 ms.
Support contains 294 out of 520 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 520/520 places, 28429/28429 transitions.
Ensure Unique test removed 7 places
Drop transitions removed 1062 transitions
Reduce isomorphic transitions removed 1062 transitions.
Iterating post reduction 0 with 1069 rules applied. Total rules applied 1069 place count 513 transition count 27367
Free-agglomeration rule applied 8 times.
Iterating global reduction 1 with 8 rules applied. Total rules applied 1077 place count 513 transition count 27359
Reduce places removed 8 places and 0 transitions.
Drop transitions removed 1 transitions
Ensure Unique test removed 86 transitions
Reduce isomorphic transitions removed 87 transitions.
Iterating post reduction 1 with 95 rules applied. Total rules applied 1172 place count 505 transition count 27272
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 1173 place count 504 transition count 27271
Applied a total of 1173 rules in 576 ms. Remains 504 /520 variables (removed 16) and now considering 27271/28429 (removed 1158) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 581 ms. Remains : 504/520 places, 27271/28429 transitions.
Interrupted random walk after 582884 steps, including 1 resets, run timeout after 30001 ms. (steps per millisecond=19 ) properties seen 14
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 280) seen :12
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 268) seen :24
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 244) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 243) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 238) seen :7
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 231) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 231) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 227) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 226) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 225) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 225) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 225) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 225) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 225) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 225) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 225) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 224) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 224) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 224) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 221) seen :0
Running SMT prover for 221 properties.
[2023-03-18 01:30:25] [INFO ] Flow matrix only has 18594 transitions (discarded 8677 similar events)
// Phase 1: matrix 18594 rows 504 cols
[2023-03-18 01:30:26] [INFO ] Computed 8 place invariants in 92 ms
[2023-03-18 01:30:28] [INFO ] After 2100ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:221
[2023-03-18 01:30:30] [INFO ] [Nat]Absence check using 8 positive place invariants in 7 ms returned sat
[2023-03-18 01:31:40] [INFO ] After 68028ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :221
[2023-03-18 01:31:40] [INFO ] State equation strengthened by 1370 read => feed constraints.
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.checkResults(DeadlockTester.java:797)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:644)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.applyReachabilitySolver(GlobalPropertySolver.java:724)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:558)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preSolveLiveness(GlobalPropertySolver.java:412)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preStableMarking(GlobalPropertySolver.java:321)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:294)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:386)
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-18 01:34:14] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-18 01:34:14] [INFO ] After 225037ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:221
Parikh walk visited 0 properties in 598 ms.
Support contains 221 out of 504 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 504/504 places, 27271/27271 transitions.
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 504 transition count 27270
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 503 transition count 27270
Applied a total of 2 rules in 267 ms. Remains 503 /504 variables (removed 1) and now considering 27270/27271 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 267 ms. Remains : 503/504 places, 27270/27271 transitions.
Interrupted random walk after 576728 steps, including 1 resets, run timeout after 30001 ms. (steps per millisecond=19 ) properties seen 0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 221) seen :0
Interrupted probabilistic random walk after 1086597 steps, run timeout after 99001 ms. (steps per millisecond=10 ) properties seen :{}
Probabilistic random walk after 1086597 steps, saw 557932 distinct states, run finished after 99004 ms. (steps per millisecond=10 ) properties seen :0
Running SMT prover for 221 properties.
[2023-03-18 01:36:27] [INFO ] Flow matrix only has 18593 transitions (discarded 8677 similar events)
// Phase 1: matrix 18593 rows 503 cols
[2023-03-18 01:36:27] [INFO ] Computed 8 place invariants in 60 ms
[2023-03-18 01:36:30] [INFO ] After 2173ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:221
[2023-03-18 01:36:31] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned sat
[2023-03-18 01:37:41] [INFO ] After 68277ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :221
[2023-03-18 01:37:41] [INFO ] State equation strengthened by 1370 read => feed constraints.
[2023-03-18 01:39:49] [INFO ] After 128092ms SMT Verify possible using 1370 Read/Feed constraints in natural domain returned unsat :0 sat :221
[2023-03-18 01:39:55] [INFO ] Deduced a trap composed of 19 places in 2092 ms of which 5 ms to minimize.
[2023-03-18 01:39:57] [INFO ] Deduced a trap composed of 57 places in 2021 ms of which 1 ms to minimize.
[2023-03-18 01:40:00] [INFO ] Deduced a trap composed of 123 places in 1921 ms of which 1 ms to minimize.
[2023-03-18 01:40:02] [INFO ] Deduced a trap composed of 147 places in 1902 ms of which 2 ms to minimize.
[2023-03-18 01:40:05] [INFO ] Deduced a trap composed of 135 places in 1974 ms of which 1 ms to minimize.
[2023-03-18 01:40:06] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 13423 ms
[2023-03-18 01:40:11] [INFO ] Deduced a trap composed of 90 places in 1278 ms of which 0 ms to minimize.
[2023-03-18 01:40:13] [INFO ] Deduced a trap composed of 60 places in 1265 ms of which 0 ms to minimize.
[2023-03-18 01:40:15] [INFO ] Deduced a trap composed of 25 places in 1291 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.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.applyReachabilitySolver(GlobalPropertySolver.java:724)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:558)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preSolveLiveness(GlobalPropertySolver.java:412)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preStableMarking(GlobalPropertySolver.java:321)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:294)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:386)
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-18 01:40:15] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-18 01:40:15] [INFO ] After 225535ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:221
Fused 221 Parikh solutions to 220 different solutions.
Parikh walk visited 0 properties in 612 ms.
Support contains 221 out of 503 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 503/503 places, 27270/27270 transitions.
Applied a total of 0 rules in 117 ms. Remains 503 /503 variables (removed 0) and now considering 27270/27270 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 117 ms. Remains : 503/503 places, 27270/27270 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 503/503 places, 27270/27270 transitions.
Applied a total of 0 rules in 112 ms. Remains 503 /503 variables (removed 0) and now considering 27270/27270 (removed 0) transitions.
[2023-03-18 01:40:16] [INFO ] Flow matrix only has 18593 transitions (discarded 8677 similar events)
[2023-03-18 01:40:16] [INFO ] Invariant cache hit.
[2023-03-18 01:40:17] [INFO ] Implicit Places using invariants in 528 ms returned []
Implicit Place search using SMT only with invariants took 530 ms to find 0 implicit places.
[2023-03-18 01:40:17] [INFO ] Flow matrix only has 18593 transitions (discarded 8677 similar events)
[2023-03-18 01:40:17] [INFO ] Invariant cache hit.
[2023-03-18 01:40:24] [INFO ] Dead Transitions using invariants and state equation in 7555 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8203 ms. Remains : 503/503 places, 27270/27270 transitions.
Incomplete random walk after 100000 steps, including 2 resets, run finished after 5250 ms. (steps per millisecond=19 ) properties (out of 221) seen :0
Running SMT prover for 221 properties.
[2023-03-18 01:40:29] [INFO ] Flow matrix only has 18593 transitions (discarded 8677 similar events)
[2023-03-18 01:40:29] [INFO ] Invariant cache hit.
[2023-03-18 01:40:30] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-18 01:40:38] [INFO ] After 7510ms SMT Verify possible using state equation in real domain returned unsat :0 sat :221
[2023-03-18 01:40:38] [INFO ] State equation strengthened by 1370 read => feed constraints.
[2023-03-18 01:40:54] [INFO ] After 15166ms SMT Verify possible using 1370 Read/Feed constraints in real domain returned unsat :0 sat :221
[2023-03-18 01:40:56] [INFO ] Deduced a trap composed of 51 places in 1801 ms of which 0 ms to minimize.
[2023-03-18 01:40:58] [INFO ] Deduced a trap composed of 11 places in 1813 ms of which 1 ms to minimize.
[2023-03-18 01:41:00] [INFO ] Deduced a trap composed of 58 places in 1836 ms of which 1 ms to minimize.
[2023-03-18 01:41:02] [INFO ] Deduced a trap composed of 60 places in 1794 ms of which 0 ms to minimize.
[2023-03-18 01:41:05] [INFO ] Deduced a trap composed of 101 places in 1821 ms of which 1 ms to minimize.
[2023-03-18 01:41:07] [INFO ] Deduced a trap composed of 11 places in 1677 ms of which 1 ms to minimize.
[2023-03-18 01:41:07] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 13310 ms
[2023-03-18 01:41:11] [INFO ] Deduced a trap composed of 85 places in 1566 ms of which 1 ms to minimize.
[2023-03-18 01:41:13] [INFO ] Deduced a trap composed of 92 places in 1457 ms of which 1 ms to minimize.
[2023-03-18 01:41:13] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 4099 ms
[2023-03-18 01:41:18] [INFO ] Deduced a trap composed of 125 places in 1370 ms of which 1 ms to minimize.
[2023-03-18 01:41:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 2111 ms
[2023-03-18 01:41:21] [INFO ] Deduced a trap composed of 149 places in 1396 ms of which 0 ms to minimize.
[2023-03-18 01:41:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 2130 ms
[2023-03-18 01:41:24] [INFO ] Deduced a trap composed of 49 places in 1316 ms of which 2 ms to minimize.
[2023-03-18 01:41:25] [INFO ] Deduced a trap composed of 72 places in 1307 ms of which 0 ms to minimize.
[2023-03-18 01:41:26] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 3775 ms
[2023-03-18 01:41:29] [INFO ] Deduced a trap composed of 93 places in 1729 ms of which 1 ms to minimize.
[2023-03-18 01:41:31] [INFO ] Deduced a trap composed of 129 places in 1364 ms of which 1 ms to minimize.
[2023-03-18 01:41:32] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 4252 ms
[2023-03-18 01:41:34] [INFO ] Deduced a trap composed of 95 places in 1221 ms of which 1 ms to minimize.
[2023-03-18 01:41:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 2013 ms
[2023-03-18 01:41:39] [INFO ] Deduced a trap composed of 90 places in 1880 ms of which 1 ms to minimize.
[2023-03-18 01:41:41] [INFO ] Deduced a trap composed of 84 places in 1828 ms of which 1 ms to minimize.
[2023-03-18 01:41:41] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 4791 ms
[2023-03-18 01:41:47] [INFO ] Deduced a trap composed of 187 places in 1693 ms of which 1 ms to minimize.
[2023-03-18 01:41:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 2422 ms
[2023-03-18 01:41:51] [INFO ] Deduced a trap composed of 56 places in 1693 ms of which 1 ms to minimize.
[2023-03-18 01:41:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 2500 ms
[2023-03-18 01:41:54] [INFO ] Deduced a trap composed of 19 places in 1557 ms of which 1 ms to minimize.
[2023-03-18 01:41:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 2289 ms
[2023-03-18 01:41:57] [INFO ] Deduced a trap composed of 79 places in 1607 ms of which 0 ms to minimize.
[2023-03-18 01:41:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 2334 ms
[2023-03-18 01:42:01] [INFO ] Deduced a trap composed of 13 places in 1640 ms of which 1 ms to minimize.
[2023-03-18 01:42:02] [INFO ] Deduced a trap composed of 61 places in 1368 ms of which 0 ms to minimize.
[2023-03-18 01:42:03] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 4123 ms
[2023-03-18 01:42:05] [INFO ] Deduced a trap composed of 48 places in 719 ms of which 1 ms to minimize.
[2023-03-18 01:42:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1533 ms
[2023-03-18 01:42:07] [INFO ] Deduced a trap composed of 163 places in 1151 ms of which 1 ms to minimize.
[2023-03-18 01:42:09] [INFO ] Deduced a trap composed of 123 places in 1570 ms of which 1 ms to minimize.
[2023-03-18 01:42:10] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 3828 ms
[2023-03-18 01:42:10] [INFO ] After 91949ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :179 real:42
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-03-18 01:42:10] [INFO ] After 100072ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :179 real:42
[2023-03-18 01:42:11] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-18 01:42:18] [INFO ] After 7110ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :221
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.checkResults(DeadlockTester.java:797)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:644)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:215)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositions(AtomicReducerSR.java:267)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:46)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:225)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.applyReachabilitySolver(GlobalPropertySolver.java:724)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:558)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preSolveLiveness(GlobalPropertySolver.java:412)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preStableMarking(GlobalPropertySolver.java:321)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:294)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:386)
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-18 01:43:50] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-18 01:43:50] [INFO ] After 100042ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :179 real:42
Interrupted random walk after 596577 steps, including 1 resets, run timeout after 30001 ms. (steps per millisecond=19 ) properties seen 0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 221) seen :0
Interrupted probabilistic random walk after 1092423 steps, run timeout after 99001 ms. (steps per millisecond=11 ) properties seen :{}
Probabilistic random walk after 1092423 steps, saw 560559 distinct states, run finished after 99002 ms. (steps per millisecond=11 ) properties seen :0
Running SMT prover for 221 properties.
[2023-03-18 01:46:03] [INFO ] Flow matrix only has 18593 transitions (discarded 8677 similar events)
[2023-03-18 01:46:03] [INFO ] Invariant cache hit.
[2023-03-18 01:46:06] [INFO ] After 2168ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:221
[2023-03-18 01:46:07] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned sat
[2023-03-18 01:47:19] [INFO ] After 69540ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :221
[2023-03-18 01:47:19] [INFO ] State equation strengthened by 1370 read => feed constraints.
[2023-03-18 01:49:51] [INFO ] After 152249ms SMT Verify possible using 1370 Read/Feed constraints in natural domain returned unsat :0 sat :220
[2023-03-18 01:49:51] [INFO ] After 152250ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :220
Attempting to minimize the solution found.
Minimization took 9 ms.
[2023-03-18 01:49:51] [INFO ] After 225048ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :220
Fused 221 Parikh solutions to 220 different solutions.
Parikh walk visited 0 properties in 716 ms.
Support contains 221 out of 503 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 503/503 places, 27270/27270 transitions.
Applied a total of 0 rules in 123 ms. Remains 503 /503 variables (removed 0) and now considering 27270/27270 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 123 ms. Remains : 503/503 places, 27270/27270 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 503/503 places, 27270/27270 transitions.
Applied a total of 0 rules in 123 ms. Remains 503 /503 variables (removed 0) and now considering 27270/27270 (removed 0) transitions.
[2023-03-18 01:49:52] [INFO ] Flow matrix only has 18593 transitions (discarded 8677 similar events)
[2023-03-18 01:49:52] [INFO ] Invariant cache hit.
[2023-03-18 01:49:52] [INFO ] Implicit Places using invariants in 562 ms returned []
Implicit Place search using SMT only with invariants took 563 ms to find 0 implicit places.
[2023-03-18 01:49:52] [INFO ] Flow matrix only has 18593 transitions (discarded 8677 similar events)
[2023-03-18 01:49:52] [INFO ] Invariant cache hit.
[2023-03-18 01:50:00] [INFO ] Dead Transitions using invariants and state equation in 7443 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8132 ms. Remains : 503/503 places, 27270/27270 transitions.
Incomplete random walk after 100000 steps, including 2 resets, run finished after 5111 ms. (steps per millisecond=19 ) properties (out of 221) seen :0
Running SMT prover for 221 properties.
[2023-03-18 01:50:05] [INFO ] Flow matrix only has 18593 transitions (discarded 8677 similar events)
[2023-03-18 01:50:05] [INFO ] Invariant cache hit.
[2023-03-18 01:50:06] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-18 01:50:13] [INFO ] After 7226ms SMT Verify possible using state equation in real domain returned unsat :0 sat :221
[2023-03-18 01:50:13] [INFO ] State equation strengthened by 1370 read => feed constraints.
[2023-03-18 01:50:28] [INFO ] After 14226ms SMT Verify possible using 1370 Read/Feed constraints in real domain returned unsat :0 sat :221
[2023-03-18 01:50:30] [INFO ] Deduced a trap composed of 51 places in 1952 ms of which 4 ms to minimize.
[2023-03-18 01:50:32] [INFO ] Deduced a trap composed of 11 places in 1861 ms of which 1 ms to minimize.
[2023-03-18 01:50:34] [INFO ] Deduced a trap composed of 58 places in 1857 ms of which 0 ms to minimize.
[2023-03-18 01:50:37] [INFO ] Deduced a trap composed of 60 places in 1822 ms of which 1 ms to minimize.
[2023-03-18 01:50:39] [INFO ] Deduced a trap composed of 101 places in 1719 ms of which 0 ms to minimize.
[2023-03-18 01:50:41] [INFO ] Deduced a trap composed of 11 places in 1839 ms of which 1 ms to minimize.
[2023-03-18 01:50:41] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 13596 ms
[2023-03-18 01:50:45] [INFO ] Deduced a trap composed of 85 places in 1594 ms of which 0 ms to minimize.
[2023-03-18 01:50:47] [INFO ] Deduced a trap composed of 92 places in 1531 ms of which 1 ms to minimize.
[2023-03-18 01:50:47] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 4227 ms
[2023-03-18 01:50:53] [INFO ] Deduced a trap composed of 125 places in 1384 ms of which 0 ms to minimize.
[2023-03-18 01:50:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 2115 ms
[2023-03-18 01:50:56] [INFO ] Deduced a trap composed of 149 places in 1430 ms of which 1 ms to minimize.
[2023-03-18 01:50:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 2162 ms
[2023-03-18 01:50:58] [INFO ] Deduced a trap composed of 49 places in 1305 ms of which 0 ms to minimize.
[2023-03-18 01:51:00] [INFO ] Deduced a trap composed of 72 places in 1309 ms of which 1 ms to minimize.
[2023-03-18 01:51:00] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 3754 ms
[2023-03-18 01:51:04] [INFO ] Deduced a trap composed of 93 places in 1679 ms of which 1 ms to minimize.
[2023-03-18 01:51:05] [INFO ] Deduced a trap composed of 129 places in 1337 ms of which 0 ms to minimize.
[2023-03-18 01:51:06] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 4133 ms
[2023-03-18 01:51:08] [INFO ] Deduced a trap composed of 95 places in 1212 ms of which 1 ms to minimize.
[2023-03-18 01:51:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1984 ms
[2023-03-18 01:51:13] [INFO ] Deduced a trap composed of 90 places in 1887 ms of which 0 ms to minimize.
[2023-03-18 01:51:15] [INFO ] Deduced a trap composed of 84 places in 1842 ms of which 1 ms to minimize.
[2023-03-18 01:51:16] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 4811 ms
[2023-03-18 01:51:22] [INFO ] Deduced a trap composed of 187 places in 1715 ms of which 1 ms to minimize.
[2023-03-18 01:51:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 2457 ms
[2023-03-18 01:51:25] [INFO ] Deduced a trap composed of 56 places in 1661 ms of which 1 ms to minimize.
[2023-03-18 01:51:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 2454 ms
[2023-03-18 01:51:28] [INFO ] Deduced a trap composed of 19 places in 1576 ms of which 1 ms to minimize.
[2023-03-18 01:51:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 2292 ms
[2023-03-18 01:51:32] [INFO ] Deduced a trap composed of 79 places in 1648 ms of which 1 ms to minimize.
[2023-03-18 01:51:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 2363 ms
[2023-03-18 01:51:35] [INFO ] Deduced a trap composed of 13 places in 1657 ms of which 1 ms to minimize.
[2023-03-18 01:51:37] [INFO ] Deduced a trap composed of 61 places in 1348 ms of which 0 ms to minimize.
[2023-03-18 01:51:37] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 4075 ms
[2023-03-18 01:51:39] [INFO ] Deduced a trap composed of 48 places in 708 ms of which 0 ms to minimize.
[2023-03-18 01:51:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1496 ms
[2023-03-18 01:51:42] [INFO ] Deduced a trap composed of 163 places in 1146 ms of which 0 ms to minimize.
[2023-03-18 01:51:44] [INFO ] Deduced a trap composed of 123 places in 1595 ms of which 0 ms to minimize.
[2023-03-18 01:51:44] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 3823 ms
[2023-03-18 01:51:47] [INFO ] Deduced a trap composed of 82 places in 1773 ms of which 0 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.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:339)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:215)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositions(AtomicReducerSR.java:267)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:253)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.applyReachabilitySolver(GlobalPropertySolver.java:724)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:558)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preSolveLiveness(GlobalPropertySolver.java:412)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preStableMarking(GlobalPropertySolver.java:321)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:294)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:386)
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-18 01:51:47] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-18 01:51:47] [INFO ] After 101166ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Incomplete random walk after 10000 steps, including 4 resets, run finished after 191 ms. (steps per millisecond=52 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 38585 steps, run timeout after 3001 ms. (steps per millisecond=12 ) properties seen :{}
Probabilistic random walk after 38585 steps, saw 27293 distinct states, run finished after 3001 ms. (steps per millisecond=12 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-18 01:51:50] [INFO ] Flow matrix only has 18593 transitions (discarded 8677 similar events)
[2023-03-18 01:51:50] [INFO ] Invariant cache hit.
[2023-03-18 01:51:50] [INFO ] After 87ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 01:51:50] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-18 01:51:54] [INFO ] After 3430ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 01:51:54] [INFO ] State equation strengthened by 1370 read => feed constraints.
[2023-03-18 01:52:04] [INFO ] After 9884ms SMT Verify possible using 1370 Read/Feed constraints in natural domain returned unsat :0 sat :0
[2023-03-18 01:52:04] [INFO ] After 13497ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 9 ms.
Support contains 1 out of 503 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 503/503 places, 27270/27270 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 8 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 502 transition count 27269
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 1 places in 9 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 501 transition count 27280
Free-agglomeration rule applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 7 place count 501 transition count 27277
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 11 place count 498 transition count 27276
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 498 transition count 27456
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 13 place count 497 transition count 27456
Applied a total of 13 rules in 511 ms. Remains 497 /503 variables (removed 6) and now considering 27456/27270 (removed -186) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 513 ms. Remains : 497/503 places, 27456/27270 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 210 ms. (steps per millisecond=47 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 37960 steps, run timeout after 3001 ms. (steps per millisecond=12 ) properties seen :{}
Probabilistic random walk after 37960 steps, saw 26881 distinct states, run finished after 3001 ms. (steps per millisecond=12 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-18 01:52:08] [INFO ] Flow matrix only has 18727 transitions (discarded 8729 similar events)
// Phase 1: matrix 18727 rows 497 cols
[2023-03-18 01:52:08] [INFO ] Computed 8 place invariants in 63 ms
[2023-03-18 01:52:08] [INFO ] After 81ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 01:52:08] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-18 01:52:11] [INFO ] After 3627ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 01:52:12] [INFO ] State equation strengthened by 1374 read => feed constraints.
[2023-03-18 01:52:19] [INFO ] After 7691ms SMT Verify possible using 1374 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-18 01:52:21] [INFO ] Deduced a trap composed of 92 places in 1457 ms of which 1 ms to minimize.
[2023-03-18 01:52:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 2276 ms
[2023-03-18 01:52:22] [INFO ] After 10565ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 532 ms.
[2023-03-18 01:52:23] [INFO ] After 14908ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 1 out of 497 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 497/497 places, 27456/27456 transitions.
Applied a total of 0 rules in 125 ms. Remains 497 /497 variables (removed 0) and now considering 27456/27456 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 125 ms. Remains : 497/497 places, 27456/27456 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 497/497 places, 27456/27456 transitions.
Applied a total of 0 rules in 105 ms. Remains 497 /497 variables (removed 0) and now considering 27456/27456 (removed 0) transitions.
[2023-03-18 01:52:23] [INFO ] Flow matrix only has 18727 transitions (discarded 8729 similar events)
[2023-03-18 01:52:23] [INFO ] Invariant cache hit.
[2023-03-18 01:52:24] [INFO ] Implicit Places using invariants in 884 ms returned []
Implicit Place search using SMT only with invariants took 885 ms to find 0 implicit places.
[2023-03-18 01:52:24] [INFO ] Flow matrix only has 18727 transitions (discarded 8729 similar events)
[2023-03-18 01:52:24] [INFO ] Invariant cache hit.
[2023-03-18 01:52:31] [INFO ] Dead Transitions using invariants and state equation in 7557 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8551 ms. Remains : 497/497 places, 27456/27456 transitions.
Graph (trivial) has 10356 edges and 497 vertex of which 381 / 497 are part of one of the 62 SCC in 6 ms
Free SCC test removed 319 places
Drop transitions removed 11224 transitions
Ensure Unique test removed 13923 transitions
Reduce isomorphic transitions removed 25147 transitions.
Graph (complete) has 2322 edges and 178 vertex of which 170 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.2 ms
Discarding 8 places :
Also discarding 0 output transitions
Drop transitions removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 14 rules applied. Total rules applied 16 place count 170 transition count 2295
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 18 place count 168 transition count 2295
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 19 place count 167 transition count 2285
Iterating global reduction 2 with 1 rules applied. Total rules applied 20 place count 167 transition count 2285
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 24 place count 165 transition count 2283
Ensure Unique test removed 33 transitions
Reduce isomorphic transitions removed 33 transitions.
Iterating post reduction 2 with 33 rules applied. Total rules applied 57 place count 165 transition count 2250
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 59 place count 164 transition count 2260
Drop transitions removed 1196 transitions
Redundant transition composition rules discarded 1196 transitions
Iterating global reduction 3 with 1196 rules applied. Total rules applied 1255 place count 164 transition count 1064
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1223 edges and 162 vertex of which 143 are kept as prefixes of interest. Removing 19 places using SCC suffix rule.1 ms
Discarding 19 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Iterating post reduction 3 with 11 rules applied. Total rules applied 1266 place count 143 transition count 1053
Drop transitions removed 114 transitions
Reduce isomorphic transitions removed 114 transitions.
Iterating post reduction 4 with 114 rules applied. Total rules applied 1380 place count 143 transition count 939
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 1382 place count 141 transition count 929
Iterating global reduction 5 with 2 rules applied. Total rules applied 1384 place count 141 transition count 929
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1385 place count 141 transition count 928
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 1387 place count 140 transition count 927
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 6 with 6 rules applied. Total rules applied 1393 place count 140 transition count 921
Free-agglomeration rule applied 12 times with reduction of 7 identical transitions.
Iterating global reduction 6 with 12 rules applied. Total rules applied 1405 place count 140 transition count 902
Reduce places removed 12 places and 0 transitions.
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 6 with 32 rules applied. Total rules applied 1437 place count 128 transition count 882
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1438 place count 127 transition count 880
Iterating global reduction 7 with 1 rules applied. Total rules applied 1439 place count 127 transition count 880
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 7 with 8 rules applied. Total rules applied 1447 place count 127 transition count 872
Drop transitions removed 58 transitions
Redundant transition composition rules discarded 58 transitions
Iterating global reduction 8 with 58 rules applied. Total rules applied 1505 place count 127 transition count 814
Free-agglomeration rule applied 5 times.
Iterating global reduction 8 with 5 rules applied. Total rules applied 1510 place count 127 transition count 809
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 8 with 9 rules applied. Total rules applied 1519 place count 122 transition count 805
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 9 with 4 rules applied. Total rules applied 1523 place count 122 transition count 801
Free-agglomeration rule applied 1 times.
Iterating global reduction 9 with 1 rules applied. Total rules applied 1524 place count 122 transition count 800
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 9 with 3 rules applied. Total rules applied 1527 place count 121 transition count 798
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 10 with 2 rules applied. Total rules applied 1529 place count 121 transition count 796
Free-agglomeration rule applied 1 times.
Iterating global reduction 10 with 1 rules applied. Total rules applied 1530 place count 121 transition count 795
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 10 with 3 rules applied. Total rules applied 1533 place count 120 transition count 793
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 11 with 2 rules applied. Total rules applied 1535 place count 120 transition count 791
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 11 with 5 rules applied. Total rules applied 1540 place count 120 transition count 875
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 11 with 21 rules applied. Total rules applied 1561 place count 115 transition count 859
Discarding 1 places :
Symmetric choice reduction at 12 with 1 rule applications. Total rules 1562 place count 114 transition count 855
Iterating global reduction 12 with 1 rules applied. Total rules applied 1563 place count 114 transition count 855
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 12 with 9 rules applied. Total rules applied 1572 place count 114 transition count 846
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 13 with 19 rules applied. Total rules applied 1591 place count 114 transition count 827
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 13 with 2 rules applied. Total rules applied 1593 place count 114 transition count 827
Applied a total of 1593 rules in 325 ms. Remains 114 /497 variables (removed 383) and now considering 827/27456 (removed 26629) transitions.
Running SMT prover for 1 properties.
[2023-03-18 01:52:32] [INFO ] Flow matrix only has 786 transitions (discarded 41 similar events)
// Phase 1: matrix 786 rows 114 cols
[2023-03-18 01:52:32] [INFO ] Computed 0 place invariants in 7 ms
[2023-03-18 01:52:32] [INFO ] After 24ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 01:52:32] [INFO ] After 108ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 01:52:32] [INFO ] State equation strengthened by 15 read => feed constraints.
[2023-03-18 01:52:32] [INFO ] After 21ms SMT Verify possible using 15 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-18 01:52:32] [INFO ] After 47ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 18 ms.
[2023-03-18 01:52:32] [INFO ] After 205ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 3 resets, run finished after 189 ms. (steps per millisecond=52 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 38743 steps, run timeout after 3001 ms. (steps per millisecond=12 ) properties seen :{}
Probabilistic random walk after 38743 steps, saw 27413 distinct states, run finished after 3001 ms. (steps per millisecond=12 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-18 01:52:35] [INFO ] Flow matrix only has 18593 transitions (discarded 8677 similar events)
// Phase 1: matrix 18593 rows 503 cols
[2023-03-18 01:52:35] [INFO ] Computed 8 place invariants in 65 ms
[2023-03-18 01:52:35] [INFO ] After 80ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 01:52:36] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned sat
[2023-03-18 01:52:39] [INFO ] After 3356ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 01:52:39] [INFO ] State equation strengthened by 1370 read => feed constraints.
[2023-03-18 01:52:47] [INFO ] After 7895ms SMT Verify possible using 1370 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-18 01:52:49] [INFO ] Deduced a trap composed of 60 places in 1587 ms of which 2 ms to minimize.
[2023-03-18 01:52:51] [INFO ] Deduced a trap composed of 51 places in 1205 ms of which 1 ms to minimize.
[2023-03-18 01:52:51] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 3998 ms
[2023-03-18 01:52:51] [INFO ] After 12353ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 385 ms.
[2023-03-18 01:52:52] [INFO ] After 16277ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 1 out of 503 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 503/503 places, 27270/27270 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 8 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 502 transition count 27269
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 1 places in 8 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 501 transition count 27280
Free-agglomeration rule applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 7 place count 501 transition count 27277
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 11 place count 498 transition count 27276
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 498 transition count 27456
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 13 place count 497 transition count 27456
Applied a total of 13 rules in 523 ms. Remains 497 /503 variables (removed 6) and now considering 27456/27270 (removed -186) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 524 ms. Remains : 497/503 places, 27456/27270 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 187 ms. (steps per millisecond=53 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 39090 steps, run timeout after 3001 ms. (steps per millisecond=13 ) properties seen :{}
Probabilistic random walk after 39090 steps, saw 27677 distinct states, run finished after 3001 ms. (steps per millisecond=13 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-18 01:52:55] [INFO ] Flow matrix only has 18727 transitions (discarded 8729 similar events)
// Phase 1: matrix 18727 rows 497 cols
[2023-03-18 01:52:56] [INFO ] Computed 8 place invariants in 58 ms
[2023-03-18 01:52:56] [INFO ] After 83ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 01:52:56] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-18 01:52:59] [INFO ] After 3339ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 01:52:59] [INFO ] State equation strengthened by 1374 read => feed constraints.
[2023-03-18 01:53:08] [INFO ] After 8943ms SMT Verify possible using 1374 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-18 01:53:10] [INFO ] Deduced a trap composed of 49 places in 1711 ms of which 1 ms to minimize.
[2023-03-18 01:53:13] [INFO ] Deduced a trap composed of 93 places in 1997 ms of which 1 ms to minimize.
[2023-03-18 01:53:15] [INFO ] Deduced a trap composed of 60 places in 1713 ms of which 0 ms to minimize.
[2023-03-18 01:53:17] [INFO ] Deduced a trap composed of 167 places in 1335 ms of which 0 ms to minimize.
[2023-03-18 01:53:19] [INFO ] Deduced a trap composed of 92 places in 1286 ms of which 1 ms to minimize.
[2023-03-18 01:53:20] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 11402 ms
[2023-03-18 01:53:20] [INFO ] After 20654ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 794 ms.
[2023-03-18 01:53:21] [INFO ] After 24969ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 1 out of 497 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 497/497 places, 27456/27456 transitions.
Applied a total of 0 rules in 100 ms. Remains 497 /497 variables (removed 0) and now considering 27456/27456 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 100 ms. Remains : 497/497 places, 27456/27456 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 497/497 places, 27456/27456 transitions.
Applied a total of 0 rules in 96 ms. Remains 497 /497 variables (removed 0) and now considering 27456/27456 (removed 0) transitions.
[2023-03-18 01:53:21] [INFO ] Flow matrix only has 18727 transitions (discarded 8729 similar events)
[2023-03-18 01:53:21] [INFO ] Invariant cache hit.
[2023-03-18 01:53:22] [INFO ] Implicit Places using invariants in 903 ms returned []
Implicit Place search using SMT only with invariants took 903 ms to find 0 implicit places.
[2023-03-18 01:53:22] [INFO ] Flow matrix only has 18727 transitions (discarded 8729 similar events)
[2023-03-18 01:53:22] [INFO ] Invariant cache hit.
[2023-03-18 01:53:29] [INFO ] Dead Transitions using invariants and state equation in 7410 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8413 ms. Remains : 497/497 places, 27456/27456 transitions.
Graph (trivial) has 10311 edges and 497 vertex of which 381 / 497 are part of one of the 62 SCC in 2 ms
Free SCC test removed 319 places
Drop transitions removed 11224 transitions
Ensure Unique test removed 13923 transitions
Reduce isomorphic transitions removed 25147 transitions.
Graph (complete) has 2322 edges and 178 vertex of which 171 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.1 ms
Discarding 7 places :
Also discarding 0 output transitions
Drop transitions removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 13 rules applied. Total rules applied 15 place count 171 transition count 2296
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 17 place count 169 transition count 2296
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 18 place count 168 transition count 2286
Iterating global reduction 2 with 1 rules applied. Total rules applied 19 place count 168 transition count 2286
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 23 place count 166 transition count 2284
Ensure Unique test removed 33 transitions
Reduce isomorphic transitions removed 33 transitions.
Iterating post reduction 2 with 33 rules applied. Total rules applied 56 place count 166 transition count 2251
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 58 place count 165 transition count 2261
Drop transitions removed 1202 transitions
Redundant transition composition rules discarded 1202 transitions
Iterating global reduction 3 with 1202 rules applied. Total rules applied 1260 place count 165 transition count 1059
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (complete) has 1220 edges and 162 vertex of which 2 are kept as prefixes of interest. Removing 160 places using SCC suffix rule.0 ms
Discarding 160 places :
Also discarding 1034 output transitions
Drop transitions removed 1034 transitions
Iterating post reduction 3 with 15 rules applied. Total rules applied 1275 place count 2 transition count 14
Drop transitions removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 4 with 13 rules applied. Total rules applied 1288 place count 2 transition count 1
Applied a total of 1288 rules in 141 ms. Remains 2 /497 variables (removed 495) and now considering 1/27456 (removed 27455) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 1 rows 2 cols
[2023-03-18 01:53:29] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-18 01:53:29] [INFO ] After 16ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 01:53:29] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-18 01:53:29] [INFO ] After 1ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 01:53:29] [INFO ] After 3ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 1 ms.
[2023-03-18 01:53:29] [INFO ] After 20ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 2 resets, run finished after 190 ms. (steps per millisecond=52 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 39171 steps, run timeout after 3001 ms. (steps per millisecond=13 ) properties seen :{}
Probabilistic random walk after 39171 steps, saw 27724 distinct states, run finished after 3001 ms. (steps per millisecond=13 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-18 01:53:33] [INFO ] Flow matrix only has 18593 transitions (discarded 8677 similar events)
// Phase 1: matrix 18593 rows 503 cols
[2023-03-18 01:53:33] [INFO ] Computed 8 place invariants in 67 ms
[2023-03-18 01:53:33] [INFO ] After 80ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 01:53:33] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-18 01:53:36] [INFO ] After 3409ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 01:53:36] [INFO ] State equation strengthened by 1370 read => feed constraints.
[2023-03-18 01:53:44] [INFO ] After 7305ms SMT Verify possible using 1370 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-18 01:53:46] [INFO ] Deduced a trap composed of 13 places in 1722 ms of which 1 ms to minimize.
[2023-03-18 01:53:48] [INFO ] Deduced a trap composed of 51 places in 1564 ms of which 1 ms to minimize.
[2023-03-18 01:53:50] [INFO ] Deduced a trap composed of 49 places in 1584 ms of which 0 ms to minimize.
[2023-03-18 01:53:52] [INFO ] Deduced a trap composed of 72 places in 1369 ms of which 0 ms to minimize.
[2023-03-18 01:53:53] [INFO ] Deduced a trap composed of 60 places in 725 ms of which 1 ms to minimize.
[2023-03-18 01:53:55] [INFO ] Deduced a trap composed of 125 places in 1082 ms of which 0 ms to minimize.
[2023-03-18 01:53:55] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 11201 ms
[2023-03-18 01:53:56] [INFO ] After 19209ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2234 ms.
[2023-03-18 01:53:58] [INFO ] After 25037ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 7 ms.
Support contains 1 out of 503 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 503/503 places, 27270/27270 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 8 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 502 transition count 27269
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 1 places in 7 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 501 transition count 27280
Free-agglomeration rule applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 7 place count 501 transition count 27277
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 11 place count 498 transition count 27276
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 498 transition count 27456
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 13 place count 497 transition count 27456
Applied a total of 13 rules in 456 ms. Remains 497 /503 variables (removed 6) and now considering 27456/27270 (removed -186) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 457 ms. Remains : 497/503 places, 27456/27270 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 207 ms. (steps per millisecond=48 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 38646 steps, run timeout after 3001 ms. (steps per millisecond=12 ) properties seen :{}
Probabilistic random walk after 38646 steps, saw 27336 distinct states, run finished after 3001 ms. (steps per millisecond=12 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-18 01:54:01] [INFO ] Flow matrix only has 18727 transitions (discarded 8729 similar events)
// Phase 1: matrix 18727 rows 497 cols
[2023-03-18 01:54:02] [INFO ] Computed 8 place invariants in 50 ms
[2023-03-18 01:54:02] [INFO ] After 86ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 01:54:02] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-18 01:54:05] [INFO ] After 3390ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 01:54:05] [INFO ] State equation strengthened by 1374 read => feed constraints.
[2023-03-18 01:54:11] [INFO ] After 5501ms SMT Verify possible using 1374 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-18 01:54:13] [INFO ] Deduced a trap composed of 13 places in 1511 ms of which 1 ms to minimize.
[2023-03-18 01:54:14] [INFO ] Deduced a trap composed of 60 places in 1360 ms of which 0 ms to minimize.
[2023-03-18 01:54:16] [INFO ] Deduced a trap composed of 121 places in 1247 ms of which 0 ms to minimize.
[2023-03-18 01:54:18] [INFO ] Deduced a trap composed of 92 places in 1075 ms of which 0 ms to minimize.
[2023-03-18 01:54:18] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 7092 ms
[2023-03-18 01:54:18] [INFO ] After 12989ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 1248 ms.
[2023-03-18 01:54:20] [INFO ] After 17873ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 1 out of 497 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 497/497 places, 27456/27456 transitions.
Applied a total of 0 rules in 101 ms. Remains 497 /497 variables (removed 0) and now considering 27456/27456 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 101 ms. Remains : 497/497 places, 27456/27456 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 497/497 places, 27456/27456 transitions.
Applied a total of 0 rules in 102 ms. Remains 497 /497 variables (removed 0) and now considering 27456/27456 (removed 0) transitions.
[2023-03-18 01:54:20] [INFO ] Flow matrix only has 18727 transitions (discarded 8729 similar events)
[2023-03-18 01:54:20] [INFO ] Invariant cache hit.
[2023-03-18 01:54:21] [INFO ] Implicit Places using invariants in 918 ms returned []
Implicit Place search using SMT only with invariants took 920 ms to find 0 implicit places.
[2023-03-18 01:54:21] [INFO ] Flow matrix only has 18727 transitions (discarded 8729 similar events)
[2023-03-18 01:54:21] [INFO ] Invariant cache hit.
[2023-03-18 01:54:28] [INFO ] Dead Transitions using invariants and state equation in 7597 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8621 ms. Remains : 497/497 places, 27456/27456 transitions.
Graph (trivial) has 10249 edges and 497 vertex of which 378 / 497 are part of one of the 61 SCC in 4 ms
Free SCC test removed 317 places
Drop transitions removed 10913 transitions
Ensure Unique test removed 14180 transitions
Reduce isomorphic transitions removed 25093 transitions.
Graph (complete) has 2405 edges and 180 vertex of which 172 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 0 output transitions
Drop transitions removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 14 rules applied. Total rules applied 16 place count 172 transition count 2349
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 18 place count 170 transition count 2349
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 19 place count 169 transition count 2339
Iterating global reduction 2 with 1 rules applied. Total rules applied 20 place count 169 transition count 2339
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 24 place count 167 transition count 2337
Ensure Unique test removed 33 transitions
Reduce isomorphic transitions removed 33 transitions.
Iterating post reduction 2 with 33 rules applied. Total rules applied 57 place count 167 transition count 2304
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 59 place count 166 transition count 2314
Drop transitions removed 1204 transitions
Redundant transition composition rules discarded 1204 transitions
Iterating global reduction 3 with 1204 rules applied. Total rules applied 1263 place count 166 transition count 1110
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1292 edges and 164 vertex of which 146 are kept as prefixes of interest. Removing 18 places using SCC suffix rule.0 ms
Discarding 18 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Iterating post reduction 3 with 11 rules applied. Total rules applied 1274 place count 146 transition count 1099
Drop transitions removed 113 transitions
Reduce isomorphic transitions removed 113 transitions.
Iterating post reduction 4 with 113 rules applied. Total rules applied 1387 place count 146 transition count 986
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 1389 place count 144 transition count 976
Iterating global reduction 5 with 2 rules applied. Total rules applied 1391 place count 144 transition count 976
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1392 place count 144 transition count 975
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 1394 place count 143 transition count 974
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 6 with 5 rules applied. Total rules applied 1399 place count 143 transition count 969
Free-agglomeration rule applied 12 times with reduction of 7 identical transitions.
Iterating global reduction 6 with 12 rules applied. Total rules applied 1411 place count 143 transition count 950
Reduce places removed 12 places and 0 transitions.
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 6 with 32 rules applied. Total rules applied 1443 place count 131 transition count 930
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1444 place count 130 transition count 926
Iterating global reduction 7 with 1 rules applied. Total rules applied 1445 place count 130 transition count 926
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 7 with 8 rules applied. Total rules applied 1453 place count 130 transition count 918
Drop transitions removed 58 transitions
Redundant transition composition rules discarded 58 transitions
Iterating global reduction 8 with 58 rules applied. Total rules applied 1511 place count 130 transition count 860
Free-agglomeration rule applied 6 times.
Iterating global reduction 8 with 6 rules applied. Total rules applied 1517 place count 130 transition count 854
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 8 with 10 rules applied. Total rules applied 1527 place count 124 transition count 850
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 9 with 7 rules applied. Total rules applied 1534 place count 124 transition count 843
Free-agglomeration rule applied 2 times.
Iterating global reduction 9 with 2 rules applied. Total rules applied 1536 place count 124 transition count 841
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 9 with 4 rules applied. Total rules applied 1540 place count 122 transition count 839
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 10 with 4 rules applied. Total rules applied 1544 place count 122 transition count 835
Free-agglomeration rule applied 2 times.
Iterating global reduction 10 with 2 rules applied. Total rules applied 1546 place count 122 transition count 833
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 10 with 4 rules applied. Total rules applied 1550 place count 120 transition count 831
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 11 with 3 rules applied. Total rules applied 1553 place count 120 transition count 828
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 11 with 4 rules applied. Total rules applied 1557 place count 120 transition count 912
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 11 with 19 rules applied. Total rules applied 1576 place count 116 transition count 897
Discarding 1 places :
Symmetric choice reduction at 12 with 1 rule applications. Total rules 1577 place count 115 transition count 893
Iterating global reduction 12 with 1 rules applied. Total rules applied 1578 place count 115 transition count 893
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 12 with 9 rules applied. Total rules applied 1587 place count 115 transition count 884
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 13 with 19 rules applied. Total rules applied 1606 place count 115 transition count 865
Applied a total of 1606 rules in 242 ms. Remains 115 /497 variables (removed 382) and now considering 865/27456 (removed 26591) transitions.
Running SMT prover for 1 properties.
[2023-03-18 01:54:29] [INFO ] Flow matrix only has 824 transitions (discarded 41 similar events)
// Phase 1: matrix 824 rows 115 cols
[2023-03-18 01:54:29] [INFO ] Computed 0 place invariants in 4 ms
[2023-03-18 01:54:29] [INFO ] After 24ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 01:54:29] [INFO ] After 127ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 01:54:29] [INFO ] State equation strengthened by 15 read => feed constraints.
[2023-03-18 01:54:29] [INFO ] After 28ms SMT Verify possible using 15 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-18 01:54:29] [INFO ] After 56ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 18 ms.
[2023-03-18 01:54:29] [INFO ] After 232ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 2 resets, run finished after 192 ms. (steps per millisecond=52 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 38508 steps, run timeout after 3001 ms. (steps per millisecond=12 ) properties seen :{}
Probabilistic random walk after 38508 steps, saw 27246 distinct states, run finished after 3001 ms. (steps per millisecond=12 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-18 01:54:32] [INFO ] Flow matrix only has 18593 transitions (discarded 8677 similar events)
// Phase 1: matrix 18593 rows 503 cols
[2023-03-18 01:54:32] [INFO ] Computed 8 place invariants in 62 ms
[2023-03-18 01:54:32] [INFO ] After 85ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 01:54:32] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-18 01:54:36] [INFO ] After 3433ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 01:54:36] [INFO ] State equation strengthened by 1370 read => feed constraints.
[2023-03-18 01:54:40] [INFO ] After 4029ms SMT Verify possible using 1370 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-18 01:54:42] [INFO ] Deduced a trap composed of 21 places in 1946 ms of which 0 ms to minimize.
[2023-03-18 01:54:45] [INFO ] Deduced a trap composed of 19 places in 1983 ms of which 1 ms to minimize.
[2023-03-18 01:54:47] [INFO ] Deduced a trap composed of 72 places in 1884 ms of which 0 ms to minimize.
[2023-03-18 01:54:52] [INFO ] Deduced a trap composed of 11 places in 1638 ms of which 0 ms to minimize.
[2023-03-18 01:54:54] [INFO ] Deduced a trap composed of 91 places in 1593 ms of which 0 ms to minimize.
[2023-03-18 01:54:56] [INFO ] Deduced a trap composed of 84 places in 1656 ms of which 0 ms to minimize.
[2023-03-18 01:54:58] [INFO ] Deduced a trap composed of 25 places in 1573 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.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositions(AtomicReducerSR.java:365)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:253)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.applyReachabilitySolver(GlobalPropertySolver.java:724)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:558)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preSolveLiveness(GlobalPropertySolver.java:412)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preStableMarking(GlobalPropertySolver.java:321)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:294)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:386)
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-18 01:54:58] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-18 01:54:58] [INFO ] After 25849ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 3 ms.
Support contains 1 out of 503 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 503/503 places, 27270/27270 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 8 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 502 transition count 27269
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 1 places in 9 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 501 transition count 27280
Free-agglomeration rule applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 7 place count 501 transition count 27277
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 11 place count 498 transition count 27276
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 498 transition count 27456
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 13 place count 497 transition count 27456
Applied a total of 13 rules in 530 ms. Remains 497 /503 variables (removed 6) and now considering 27456/27270 (removed -186) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 531 ms. Remains : 497/503 places, 27456/27270 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 201 ms. (steps per millisecond=49 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 38726 steps, run timeout after 3001 ms. (steps per millisecond=12 ) properties seen :{}
Probabilistic random walk after 38726 steps, saw 27398 distinct states, run finished after 3001 ms. (steps per millisecond=12 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-18 01:55:02] [INFO ] Flow matrix only has 18727 transitions (discarded 8729 similar events)
// Phase 1: matrix 18727 rows 497 cols
[2023-03-18 01:55:02] [INFO ] Computed 8 place invariants in 63 ms
[2023-03-18 01:55:02] [INFO ] After 82ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 01:55:02] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-18 01:55:05] [INFO ] After 3347ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 01:55:06] [INFO ] State equation strengthened by 1374 read => feed constraints.
[2023-03-18 01:55:10] [INFO ] After 4447ms SMT Verify possible using 1374 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-18 01:55:12] [INFO ] Deduced a trap composed of 91 places in 1885 ms of which 1 ms to minimize.
[2023-03-18 01:55:15] [INFO ] Deduced a trap composed of 105 places in 1779 ms of which 0 ms to minimize.
[2023-03-18 01:55:17] [INFO ] Deduced a trap composed of 51 places in 1844 ms of which 1 ms to minimize.
[2023-03-18 01:55:19] [INFO ] Deduced a trap composed of 147 places in 1919 ms of which 1 ms to minimize.
[2023-03-18 01:55:21] [INFO ] Deduced a trap composed of 19 places in 1958 ms of which 0 ms to minimize.
[2023-03-18 01:55:24] [INFO ] Deduced a trap composed of 47 places in 1945 ms of which 1 ms to minimize.
[2023-03-18 01:55:26] [INFO ] Deduced a trap composed of 90 places in 1614 ms of which 0 ms to minimize.
[2023-03-18 01:55:28] [INFO ] Deduced a trap composed of 49 places in 1742 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.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositions(AtomicReducerSR.java:365)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:253)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.applyReachabilitySolver(GlobalPropertySolver.java:724)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:558)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preSolveLiveness(GlobalPropertySolver.java:412)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preStableMarking(GlobalPropertySolver.java:321)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:294)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:386)
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-18 01:55:28] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-18 01:55:28] [INFO ] After 26188ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 3 ms.
Support contains 1 out of 497 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 497/497 places, 27456/27456 transitions.
Applied a total of 0 rules in 101 ms. Remains 497 /497 variables (removed 0) and now considering 27456/27456 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 101 ms. Remains : 497/497 places, 27456/27456 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 497/497 places, 27456/27456 transitions.
Applied a total of 0 rules in 99 ms. Remains 497 /497 variables (removed 0) and now considering 27456/27456 (removed 0) transitions.
[2023-03-18 01:55:28] [INFO ] Flow matrix only has 18727 transitions (discarded 8729 similar events)
[2023-03-18 01:55:28] [INFO ] Invariant cache hit.
[2023-03-18 01:55:29] [INFO ] Implicit Places using invariants in 921 ms returned []
Implicit Place search using SMT only with invariants took 922 ms to find 0 implicit places.
[2023-03-18 01:55:29] [INFO ] Flow matrix only has 18727 transitions (discarded 8729 similar events)
[2023-03-18 01:55:29] [INFO ] Invariant cache hit.
[2023-03-18 01:55:37] [INFO ] Dead Transitions using invariants and state equation in 7439 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8463 ms. Remains : 497/497 places, 27456/27456 transitions.
Graph (trivial) has 10333 edges and 497 vertex of which 381 / 497 are part of one of the 62 SCC in 1 ms
Free SCC test removed 319 places
Drop transitions removed 11224 transitions
Ensure Unique test removed 13923 transitions
Reduce isomorphic transitions removed 25147 transitions.
Graph (complete) has 2322 edges and 178 vertex of which 170 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 0 output transitions
Drop transitions removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 14 rules applied. Total rules applied 16 place count 170 transition count 2295
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 18 place count 168 transition count 2295
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 19 place count 167 transition count 2285
Iterating global reduction 2 with 1 rules applied. Total rules applied 20 place count 167 transition count 2285
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 24 place count 165 transition count 2283
Ensure Unique test removed 33 transitions
Reduce isomorphic transitions removed 33 transitions.
Iterating post reduction 2 with 33 rules applied. Total rules applied 57 place count 165 transition count 2250
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 59 place count 164 transition count 2260
Drop transitions removed 1196 transitions
Redundant transition composition rules discarded 1196 transitions
Iterating global reduction 3 with 1196 rules applied. Total rules applied 1255 place count 164 transition count 1064
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1223 edges and 162 vertex of which 143 are kept as prefixes of interest. Removing 19 places using SCC suffix rule.0 ms
Discarding 19 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Iterating post reduction 3 with 11 rules applied. Total rules applied 1266 place count 143 transition count 1053
Drop transitions removed 115 transitions
Reduce isomorphic transitions removed 115 transitions.
Iterating post reduction 4 with 115 rules applied. Total rules applied 1381 place count 143 transition count 938
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 1383 place count 141 transition count 928
Iterating global reduction 5 with 2 rules applied. Total rules applied 1385 place count 141 transition count 928
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1386 place count 141 transition count 927
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 1388 place count 140 transition count 926
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 6 with 5 rules applied. Total rules applied 1393 place count 140 transition count 921
Free-agglomeration rule applied 12 times with reduction of 7 identical transitions.
Iterating global reduction 6 with 12 rules applied. Total rules applied 1405 place count 140 transition count 902
Reduce places removed 12 places and 0 transitions.
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 6 with 32 rules applied. Total rules applied 1437 place count 128 transition count 882
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1438 place count 127 transition count 880
Iterating global reduction 7 with 1 rules applied. Total rules applied 1439 place count 127 transition count 880
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 7 with 8 rules applied. Total rules applied 1447 place count 127 transition count 872
Drop transitions removed 58 transitions
Redundant transition composition rules discarded 58 transitions
Iterating global reduction 8 with 58 rules applied. Total rules applied 1505 place count 127 transition count 814
Free-agglomeration rule applied 6 times.
Iterating global reduction 8 with 6 rules applied. Total rules applied 1511 place count 127 transition count 808
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 8 with 10 rules applied. Total rules applied 1521 place count 121 transition count 804
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 9 with 6 rules applied. Total rules applied 1527 place count 121 transition count 798
Free-agglomeration rule applied 2 times.
Iterating global reduction 9 with 2 rules applied. Total rules applied 1529 place count 121 transition count 796
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 9 with 4 rules applied. Total rules applied 1533 place count 119 transition count 794
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 10 with 4 rules applied. Total rules applied 1537 place count 119 transition count 790
Free-agglomeration rule applied 2 times.
Iterating global reduction 10 with 2 rules applied. Total rules applied 1539 place count 119 transition count 788
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 10 with 4 rules applied. Total rules applied 1543 place count 117 transition count 786
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 11 with 2 rules applied. Total rules applied 1545 place count 117 transition count 784
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 11 with 5 rules applied. Total rules applied 1550 place count 117 transition count 868
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 11 with 21 rules applied. Total rules applied 1571 place count 112 transition count 852
Discarding 1 places :
Symmetric choice reduction at 12 with 1 rule applications. Total rules 1572 place count 111 transition count 848
Iterating global reduction 12 with 1 rules applied. Total rules applied 1573 place count 111 transition count 848
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 12 with 9 rules applied. Total rules applied 1582 place count 111 transition count 839
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 13 with 19 rules applied. Total rules applied 1601 place count 111 transition count 820
Applied a total of 1601 rules in 229 ms. Remains 111 /497 variables (removed 386) and now considering 820/27456 (removed 26636) transitions.
Running SMT prover for 1 properties.
[2023-03-18 01:55:37] [INFO ] Flow matrix only has 779 transitions (discarded 41 similar events)
// Phase 1: matrix 779 rows 111 cols
[2023-03-18 01:55:37] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-18 01:55:37] [INFO ] After 33ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 01:55:37] [INFO ] After 112ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 01:55:37] [INFO ] State equation strengthened by 16 read => feed constraints.
[2023-03-18 01:55:37] [INFO ] After 23ms SMT Verify possible using 16 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-18 01:55:37] [INFO ] After 55ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 21 ms.
[2023-03-18 01:55:37] [INFO ] After 215ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 2 resets, run finished after 192 ms. (steps per millisecond=52 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 38705 steps, run timeout after 3001 ms. (steps per millisecond=12 ) properties seen :{}
Probabilistic random walk after 38705 steps, saw 27384 distinct states, run finished after 3001 ms. (steps per millisecond=12 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-18 01:55:41] [INFO ] Flow matrix only has 18593 transitions (discarded 8677 similar events)
// Phase 1: matrix 18593 rows 503 cols
[2023-03-18 01:55:41] [INFO ] Computed 8 place invariants in 56 ms
[2023-03-18 01:55:41] [INFO ] After 82ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 01:55:41] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-18 01:55:44] [INFO ] After 3308ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 01:55:44] [INFO ] State equation strengthened by 1370 read => feed constraints.
[2023-03-18 01:55:54] [INFO ] After 9900ms SMT Verify possible using 1370 Read/Feed constraints in natural domain returned unsat :0 sat :0
[2023-03-18 01:55:54] [INFO ] After 13398ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 8 ms.
Support contains 1 out of 503 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 503/503 places, 27270/27270 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 8 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 502 transition count 27269
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 1 places in 8 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 501 transition count 27280
Free-agglomeration rule applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 7 place count 501 transition count 27277
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 11 place count 498 transition count 27276
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 498 transition count 27456
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 13 place count 497 transition count 27456
Applied a total of 13 rules in 428 ms. Remains 497 /503 variables (removed 6) and now considering 27456/27270 (removed -186) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 428 ms. Remains : 497/503 places, 27456/27270 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 204 ms. (steps per millisecond=49 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 38705 steps, run timeout after 3001 ms. (steps per millisecond=12 ) properties seen :{}
Probabilistic random walk after 38705 steps, saw 27384 distinct states, run finished after 3002 ms. (steps per millisecond=12 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-18 01:55:58] [INFO ] Flow matrix only has 18727 transitions (discarded 8729 similar events)
// Phase 1: matrix 18727 rows 497 cols
[2023-03-18 01:55:58] [INFO ] Computed 8 place invariants in 56 ms
[2023-03-18 01:55:58] [INFO ] After 87ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 01:55:58] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-18 01:56:01] [INFO ] After 3449ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 01:56:02] [INFO ] State equation strengthened by 1374 read => feed constraints.
[2023-03-18 01:56:11] [INFO ] After 9224ms SMT Verify possible using 1374 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-18 01:56:13] [INFO ] Deduced a trap composed of 127 places in 1910 ms of which 0 ms to minimize.
[2023-03-18 01:56:16] [INFO ] Deduced a trap composed of 101 places in 1943 ms of which 0 ms to minimize.
[2023-03-18 01:56:18] [INFO ] Deduced a trap composed of 12 places in 1902 ms of which 1 ms to minimize.
[2023-03-18 01:56:20] [INFO ] Deduced a trap composed of 121 places in 2029 ms of which 1 ms to minimize.
[2023-03-18 01:56:23] [INFO ] Deduced a trap composed of 37 places in 2072 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.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositions(AtomicReducerSR.java:365)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:253)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.applyReachabilitySolver(GlobalPropertySolver.java:724)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:558)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preSolveLiveness(GlobalPropertySolver.java:412)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preStableMarking(GlobalPropertySolver.java:321)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:294)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:386)
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-18 01:56:23] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-18 01:56:23] [INFO ] After 25144ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 3 ms.
Support contains 1 out of 497 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 497/497 places, 27456/27456 transitions.
Applied a total of 0 rules in 110 ms. Remains 497 /497 variables (removed 0) and now considering 27456/27456 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 110 ms. Remains : 497/497 places, 27456/27456 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 497/497 places, 27456/27456 transitions.
Applied a total of 0 rules in 108 ms. Remains 497 /497 variables (removed 0) and now considering 27456/27456 (removed 0) transitions.
[2023-03-18 01:56:23] [INFO ] Flow matrix only has 18727 transitions (discarded 8729 similar events)
[2023-03-18 01:56:23] [INFO ] Invariant cache hit.
[2023-03-18 01:56:24] [INFO ] Implicit Places using invariants in 944 ms returned []
Implicit Place search using SMT only with invariants took 945 ms to find 0 implicit places.
[2023-03-18 01:56:24] [INFO ] Flow matrix only has 18727 transitions (discarded 8729 similar events)
[2023-03-18 01:56:24] [INFO ] Invariant cache hit.
[2023-03-18 01:56:32] [INFO ] Dead Transitions using invariants and state equation in 7776 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8834 ms. Remains : 497/497 places, 27456/27456 transitions.
Graph (trivial) has 10360 edges and 497 vertex of which 381 / 497 are part of one of the 62 SCC in 2 ms
Free SCC test removed 319 places
Drop transitions removed 11224 transitions
Ensure Unique test removed 13923 transitions
Reduce isomorphic transitions removed 25147 transitions.
Graph (complete) has 2322 edges and 178 vertex of which 171 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.1 ms
Discarding 7 places :
Also discarding 0 output transitions
Drop transitions removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 13 rules applied. Total rules applied 15 place count 171 transition count 2296
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 17 place count 169 transition count 2296
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 18 place count 168 transition count 2286
Iterating global reduction 2 with 1 rules applied. Total rules applied 19 place count 168 transition count 2286
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 23 place count 166 transition count 2284
Ensure Unique test removed 33 transitions
Reduce isomorphic transitions removed 33 transitions.
Iterating post reduction 2 with 33 rules applied. Total rules applied 56 place count 166 transition count 2251
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 58 place count 165 transition count 2261
Drop transitions removed 1201 transitions
Redundant transition composition rules discarded 1201 transitions
Iterating global reduction 3 with 1201 rules applied. Total rules applied 1259 place count 165 transition count 1060
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1235 edges and 163 vertex of which 146 are kept as prefixes of interest. Removing 17 places using SCC suffix rule.0 ms
Discarding 17 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Iterating post reduction 3 with 11 rules applied. Total rules applied 1270 place count 146 transition count 1050
Drop transitions removed 107 transitions
Reduce isomorphic transitions removed 107 transitions.
Iterating post reduction 4 with 107 rules applied. Total rules applied 1377 place count 146 transition count 943
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 1380 place count 143 transition count 932
Iterating global reduction 5 with 3 rules applied. Total rules applied 1383 place count 143 transition count 932
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1384 place count 143 transition count 931
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1385 place count 142 transition count 929
Iterating global reduction 6 with 1 rules applied. Total rules applied 1386 place count 142 transition count 929
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 1388 place count 141 transition count 928
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 6 with 5 rules applied. Total rules applied 1393 place count 141 transition count 923
Free-agglomeration rule applied 12 times with reduction of 7 identical transitions.
Iterating global reduction 6 with 12 rules applied. Total rules applied 1405 place count 141 transition count 904
Reduce places removed 12 places and 0 transitions.
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 6 with 32 rules applied. Total rules applied 1437 place count 129 transition count 884
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1438 place count 128 transition count 882
Iterating global reduction 7 with 1 rules applied. Total rules applied 1439 place count 128 transition count 882
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 7 with 8 rules applied. Total rules applied 1447 place count 128 transition count 874
Drop transitions removed 58 transitions
Redundant transition composition rules discarded 58 transitions
Iterating global reduction 8 with 58 rules applied. Total rules applied 1505 place count 128 transition count 816
Free-agglomeration rule applied 6 times.
Iterating global reduction 8 with 6 rules applied. Total rules applied 1511 place count 128 transition count 810
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 8 with 10 rules applied. Total rules applied 1521 place count 122 transition count 806
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 9 with 6 rules applied. Total rules applied 1527 place count 122 transition count 800
Free-agglomeration rule applied 1 times.
Iterating global reduction 9 with 1 rules applied. Total rules applied 1528 place count 122 transition count 799
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 9 with 3 rules applied. Total rules applied 1531 place count 121 transition count 797
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 10 with 2 rules applied. Total rules applied 1533 place count 121 transition count 795
Free-agglomeration rule applied 1 times.
Iterating global reduction 10 with 1 rules applied. Total rules applied 1534 place count 121 transition count 794
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 10 with 3 rules applied. Total rules applied 1537 place count 120 transition count 792
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 11 with 2 rules applied. Total rules applied 1539 place count 120 transition count 790
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 11 with 5 rules applied. Total rules applied 1544 place count 120 transition count 874
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 11 with 21 rules applied. Total rules applied 1565 place count 115 transition count 858
Discarding 1 places :
Symmetric choice reduction at 12 with 1 rule applications. Total rules 1566 place count 114 transition count 854
Iterating global reduction 12 with 1 rules applied. Total rules applied 1567 place count 114 transition count 854
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 12 with 9 rules applied. Total rules applied 1576 place count 114 transition count 845
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 13 with 19 rules applied. Total rules applied 1595 place count 114 transition count 826
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 13 with 5 rules applied. Total rules applied 1600 place count 114 transition count 826
Applied a total of 1600 rules in 226 ms. Remains 114 /497 variables (removed 383) and now considering 826/27456 (removed 26630) transitions.
Running SMT prover for 1 properties.
[2023-03-18 01:56:32] [INFO ] Flow matrix only has 791 transitions (discarded 35 similar events)
// Phase 1: matrix 791 rows 114 cols
[2023-03-18 01:56:32] [INFO ] Computed 0 place invariants in 6 ms
[2023-03-18 01:56:32] [INFO ] After 28ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 01:56:32] [INFO ] After 112ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 01:56:32] [INFO ] State equation strengthened by 15 read => feed constraints.
[2023-03-18 01:56:32] [INFO ] After 27ms SMT Verify possible using 15 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-18 01:56:33] [INFO ] After 55ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 16 ms.
[2023-03-18 01:56:33] [INFO ] After 213ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 2 resets, run finished after 195 ms. (steps per millisecond=51 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 39329 steps, run timeout after 3001 ms. (steps per millisecond=13 ) properties seen :{}
Probabilistic random walk after 39329 steps, saw 27821 distinct states, run finished after 3001 ms. (steps per millisecond=13 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-18 01:56:36] [INFO ] Flow matrix only has 18593 transitions (discarded 8677 similar events)
// Phase 1: matrix 18593 rows 503 cols
[2023-03-18 01:56:36] [INFO ] Computed 8 place invariants in 61 ms
[2023-03-18 01:56:36] [INFO ] After 89ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 01:56:36] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-18 01:56:40] [INFO ] After 3489ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 01:56:40] [INFO ] State equation strengthened by 1370 read => feed constraints.
[2023-03-18 01:56:49] [INFO ] After 9828ms SMT Verify possible using 1370 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-18 01:56:52] [INFO ] Deduced a trap composed of 84 places in 1837 ms of which 1 ms to minimize.
[2023-03-18 01:56:54] [INFO ] Deduced a trap composed of 51 places in 1823 ms of which 0 ms to minimize.
[2023-03-18 01:56:56] [INFO ] Deduced a trap composed of 49 places in 1653 ms of which 0 ms to minimize.
[2023-03-18 01:56:59] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 9484 ms
[2023-03-18 01:56:59] [INFO ] After 19546ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 1858 ms.
[2023-03-18 01:57:01] [INFO ] After 25086ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 503 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 503/503 places, 27270/27270 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 9 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 502 transition count 27269
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 1 places in 8 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 501 transition count 27280
Free-agglomeration rule applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 7 place count 501 transition count 27277
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 11 place count 498 transition count 27276
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 498 transition count 27456
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 13 place count 497 transition count 27456
Applied a total of 13 rules in 465 ms. Remains 497 /503 variables (removed 6) and now considering 27456/27270 (removed -186) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 466 ms. Remains : 497/503 places, 27456/27270 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 200 ms. (steps per millisecond=50 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 38073 steps, run timeout after 3001 ms. (steps per millisecond=12 ) properties seen :{}
Probabilistic random walk after 38073 steps, saw 26953 distinct states, run finished after 3001 ms. (steps per millisecond=12 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-18 01:57:05] [INFO ] Flow matrix only has 18727 transitions (discarded 8729 similar events)
// Phase 1: matrix 18727 rows 497 cols
[2023-03-18 01:57:05] [INFO ] Computed 8 place invariants in 54 ms
[2023-03-18 01:57:05] [INFO ] After 112ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 01:57:05] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-18 01:57:09] [INFO ] After 3530ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 01:57:09] [INFO ] State equation strengthened by 1374 read => feed constraints.
[2023-03-18 01:57:17] [INFO ] After 8718ms SMT Verify possible using 1374 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-18 01:57:21] [INFO ] Deduced a trap composed of 58 places in 1906 ms of which 0 ms to minimize.
[2023-03-18 01:57:23] [INFO ] Deduced a trap composed of 23 places in 1884 ms of which 1 ms to minimize.
[2023-03-18 01:57:26] [INFO ] Deduced a trap composed of 68 places in 1967 ms of which 0 ms to minimize.
[2023-03-18 01:57:28] [INFO ] Deduced a trap composed of 51 places in 1902 ms of which 0 ms to minimize.
[2023-03-18 01:57:30] [INFO ] Deduced a trap composed of 124 places in 1787 ms of which 1 ms to minimize.
[2023-03-18 01:57:30] [INFO ] Trap strengthening (SAT) tested/added 5/5 trap constraints in 11107 ms
[2023-03-18 01:57:30] [INFO ] After 21303ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-18 01:57:30] [INFO ] After 25031ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 4 ms.
Support contains 1 out of 497 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 497/497 places, 27456/27456 transitions.
Applied a total of 0 rules in 103 ms. Remains 497 /497 variables (removed 0) and now considering 27456/27456 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 104 ms. Remains : 497/497 places, 27456/27456 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 497/497 places, 27456/27456 transitions.
Applied a total of 0 rules in 96 ms. Remains 497 /497 variables (removed 0) and now considering 27456/27456 (removed 0) transitions.
[2023-03-18 01:57:30] [INFO ] Flow matrix only has 18727 transitions (discarded 8729 similar events)
[2023-03-18 01:57:30] [INFO ] Invariant cache hit.
[2023-03-18 01:57:31] [INFO ] Implicit Places using invariants in 908 ms returned []
Implicit Place search using SMT only with invariants took 909 ms to find 0 implicit places.
[2023-03-18 01:57:31] [INFO ] Flow matrix only has 18727 transitions (discarded 8729 similar events)
[2023-03-18 01:57:31] [INFO ] Invariant cache hit.
[2023-03-18 01:57:39] [INFO ] Dead Transitions using invariants and state equation in 7528 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8536 ms. Remains : 497/497 places, 27456/27456 transitions.
Graph (trivial) has 10360 edges and 497 vertex of which 379 / 497 are part of one of the 62 SCC in 1 ms
Free SCC test removed 317 places
Drop transitions removed 11151 transitions
Ensure Unique test removed 13967 transitions
Reduce isomorphic transitions removed 25118 transitions.
Graph (complete) has 2352 edges and 180 vertex of which 172 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 0 output transitions
Drop transitions removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 14 rules applied. Total rules applied 16 place count 172 transition count 2324
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 18 place count 170 transition count 2324
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 19 place count 169 transition count 2314
Iterating global reduction 2 with 1 rules applied. Total rules applied 20 place count 169 transition count 2314
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 24 place count 167 transition count 2312
Ensure Unique test removed 33 transitions
Reduce isomorphic transitions removed 33 transitions.
Iterating post reduction 2 with 33 rules applied. Total rules applied 57 place count 167 transition count 2279
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 59 place count 166 transition count 2289
Drop transitions removed 1214 transitions
Redundant transition composition rules discarded 1214 transitions
Iterating global reduction 3 with 1214 rules applied. Total rules applied 1273 place count 166 transition count 1075
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1238 edges and 164 vertex of which 146 are kept as prefixes of interest. Removing 18 places using SCC suffix rule.1 ms
Discarding 18 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Iterating post reduction 3 with 11 rules applied. Total rules applied 1284 place count 146 transition count 1064
Drop transitions removed 112 transitions
Reduce isomorphic transitions removed 112 transitions.
Iterating post reduction 4 with 112 rules applied. Total rules applied 1396 place count 146 transition count 952
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 1398 place count 144 transition count 942
Iterating global reduction 5 with 2 rules applied. Total rules applied 1400 place count 144 transition count 942
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1401 place count 144 transition count 941
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 1403 place count 143 transition count 940
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 6 with 5 rules applied. Total rules applied 1408 place count 143 transition count 935
Free-agglomeration rule applied 12 times with reduction of 7 identical transitions.
Iterating global reduction 6 with 12 rules applied. Total rules applied 1420 place count 143 transition count 916
Reduce places removed 12 places and 0 transitions.
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 6 with 32 rules applied. Total rules applied 1452 place count 131 transition count 896
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1453 place count 130 transition count 894
Iterating global reduction 7 with 1 rules applied. Total rules applied 1454 place count 130 transition count 894
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 7 with 8 rules applied. Total rules applied 1462 place count 130 transition count 886
Drop transitions removed 58 transitions
Redundant transition composition rules discarded 58 transitions
Iterating global reduction 8 with 58 rules applied. Total rules applied 1520 place count 130 transition count 828
Free-agglomeration rule applied 6 times.
Iterating global reduction 8 with 6 rules applied. Total rules applied 1526 place count 130 transition count 822
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 8 with 10 rules applied. Total rules applied 1536 place count 124 transition count 818
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 9 with 6 rules applied. Total rules applied 1542 place count 124 transition count 812
Free-agglomeration rule applied 2 times.
Iterating global reduction 9 with 2 rules applied. Total rules applied 1544 place count 124 transition count 810
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 9 with 4 rules applied. Total rules applied 1548 place count 122 transition count 808
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 10 with 4 rules applied. Total rules applied 1552 place count 122 transition count 804
Free-agglomeration rule applied 2 times.
Iterating global reduction 10 with 2 rules applied. Total rules applied 1554 place count 122 transition count 802
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 10 with 4 rules applied. Total rules applied 1558 place count 120 transition count 800
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 11 with 2 rules applied. Total rules applied 1560 place count 120 transition count 798
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 11 with 5 rules applied. Total rules applied 1565 place count 120 transition count 885
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 11 with 21 rules applied. Total rules applied 1586 place count 115 transition count 869
Discarding 1 places :
Symmetric choice reduction at 12 with 1 rule applications. Total rules 1587 place count 114 transition count 865
Iterating global reduction 12 with 1 rules applied. Total rules applied 1588 place count 114 transition count 865
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 12 with 9 rules applied. Total rules applied 1597 place count 114 transition count 856
Drop transitions removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 13 with 20 rules applied. Total rules applied 1617 place count 114 transition count 836
Applied a total of 1617 rules in 201 ms. Remains 114 /497 variables (removed 383) and now considering 836/27456 (removed 26620) transitions.
Running SMT prover for 1 properties.
[2023-03-18 01:57:39] [INFO ] Flow matrix only has 794 transitions (discarded 42 similar events)
// Phase 1: matrix 794 rows 114 cols
[2023-03-18 01:57:39] [INFO ] Computed 0 place invariants in 5 ms
[2023-03-18 01:57:39] [INFO ] After 32ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 01:57:39] [INFO ] After 114ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 01:57:39] [INFO ] State equation strengthened by 16 read => feed constraints.
[2023-03-18 01:57:39] [INFO ] After 18ms SMT Verify possible using 16 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-18 01:57:39] [INFO ] After 47ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 16 ms.
[2023-03-18 01:57:39] [INFO ] After 211ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 2 resets, run finished after 188 ms. (steps per millisecond=53 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 38806 steps, run timeout after 3001 ms. (steps per millisecond=12 ) properties seen :{}
Probabilistic random walk after 38806 steps, saw 27460 distinct states, run finished after 3001 ms. (steps per millisecond=12 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-18 01:57:42] [INFO ] Flow matrix only has 18593 transitions (discarded 8677 similar events)
// Phase 1: matrix 18593 rows 503 cols
[2023-03-18 01:57:42] [INFO ] Computed 8 place invariants in 63 ms
[2023-03-18 01:57:43] [INFO ] After 85ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 01:57:43] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-18 01:57:46] [INFO ] After 3446ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 01:57:46] [INFO ] State equation strengthened by 1370 read => feed constraints.
[2023-03-18 01:57:50] [INFO ] After 4183ms SMT Verify possible using 1370 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-18 01:57:52] [INFO ] Deduced a trap composed of 149 places in 1443 ms of which 1 ms to minimize.
[2023-03-18 01:57:54] [INFO ] Deduced a trap composed of 19 places in 1403 ms of which 1 ms to minimize.
[2023-03-18 01:57:56] [INFO ] Deduced a trap composed of 47 places in 1817 ms of which 0 ms to minimize.
[2023-03-18 01:57:59] [INFO ] Deduced a trap composed of 49 places in 1913 ms of which 1 ms to minimize.
[2023-03-18 01:57:59] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 8580 ms
[2023-03-18 01:57:59] [INFO ] After 13156ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 322 ms.
[2023-03-18 01:58:00] [INFO ] After 17115ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 1 out of 503 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 503/503 places, 27270/27270 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 8 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 502 transition count 27269
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 1 places in 8 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 501 transition count 27280
Free-agglomeration rule applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 7 place count 501 transition count 27277
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 11 place count 498 transition count 27276
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 498 transition count 27456
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 13 place count 497 transition count 27456
Applied a total of 13 rules in 423 ms. Remains 497 /503 variables (removed 6) and now considering 27456/27270 (removed -186) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 424 ms. Remains : 497/503 places, 27456/27270 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 207 ms. (steps per millisecond=48 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 37890 steps, run timeout after 3001 ms. (steps per millisecond=12 ) properties seen :{}
Probabilistic random walk after 37890 steps, saw 26834 distinct states, run finished after 3001 ms. (steps per millisecond=12 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-18 01:58:03] [INFO ] Flow matrix only has 18727 transitions (discarded 8729 similar events)
// Phase 1: matrix 18727 rows 497 cols
[2023-03-18 01:58:03] [INFO ] Computed 8 place invariants in 53 ms
[2023-03-18 01:58:03] [INFO ] After 87ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 01:58:04] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-18 01:58:07] [INFO ] After 3395ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 01:58:07] [INFO ] State equation strengthened by 1374 read => feed constraints.
[2023-03-18 01:58:11] [INFO ] After 3773ms SMT Verify possible using 1374 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-18 01:58:13] [INFO ] Deduced a trap composed of 19 places in 1289 ms of which 1 ms to minimize.
[2023-03-18 01:58:14] [INFO ] Deduced a trap composed of 147 places in 1147 ms of which 0 ms to minimize.
[2023-03-18 01:58:15] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 3491 ms
[2023-03-18 01:58:15] [INFO ] After 7640ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 574 ms.
[2023-03-18 01:58:15] [INFO ] After 11795ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 1 out of 497 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 497/497 places, 27456/27456 transitions.
Applied a total of 0 rules in 94 ms. Remains 497 /497 variables (removed 0) and now considering 27456/27456 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 95 ms. Remains : 497/497 places, 27456/27456 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 497/497 places, 27456/27456 transitions.
Applied a total of 0 rules in 91 ms. Remains 497 /497 variables (removed 0) and now considering 27456/27456 (removed 0) transitions.
[2023-03-18 01:58:15] [INFO ] Flow matrix only has 18727 transitions (discarded 8729 similar events)
[2023-03-18 01:58:15] [INFO ] Invariant cache hit.
[2023-03-18 01:58:16] [INFO ] Implicit Places using invariants in 907 ms returned []
Implicit Place search using SMT only with invariants took 907 ms to find 0 implicit places.
[2023-03-18 01:58:16] [INFO ] Flow matrix only has 18727 transitions (discarded 8729 similar events)
[2023-03-18 01:58:16] [INFO ] Invariant cache hit.
[2023-03-18 01:58:24] [INFO ] Dead Transitions using invariants and state equation in 7497 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8497 ms. Remains : 497/497 places, 27456/27456 transitions.
Graph (trivial) has 10360 edges and 497 vertex of which 381 / 497 are part of one of the 62 SCC in 2 ms
Free SCC test removed 319 places
Drop transitions removed 11224 transitions
Ensure Unique test removed 13923 transitions
Reduce isomorphic transitions removed 25147 transitions.
Graph (complete) has 2322 edges and 178 vertex of which 171 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.1 ms
Discarding 7 places :
Also discarding 0 output transitions
Drop transitions removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 13 rules applied. Total rules applied 15 place count 171 transition count 2296
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 17 place count 169 transition count 2296
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 18 place count 168 transition count 2286
Iterating global reduction 2 with 1 rules applied. Total rules applied 19 place count 168 transition count 2286
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 23 place count 166 transition count 2284
Ensure Unique test removed 33 transitions
Reduce isomorphic transitions removed 33 transitions.
Iterating post reduction 2 with 33 rules applied. Total rules applied 56 place count 166 transition count 2251
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 58 place count 165 transition count 2261
Drop transitions removed 1200 transitions
Redundant transition composition rules discarded 1200 transitions
Iterating global reduction 3 with 1200 rules applied. Total rules applied 1258 place count 165 transition count 1061
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1228 edges and 163 vertex of which 144 are kept as prefixes of interest. Removing 19 places using SCC suffix rule.1 ms
Discarding 19 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Iterating post reduction 3 with 11 rules applied. Total rules applied 1269 place count 144 transition count 1050
Drop transitions removed 113 transitions
Reduce isomorphic transitions removed 113 transitions.
Iterating post reduction 4 with 113 rules applied. Total rules applied 1382 place count 144 transition count 937
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 1384 place count 142 transition count 927
Iterating global reduction 5 with 2 rules applied. Total rules applied 1386 place count 142 transition count 927
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1387 place count 142 transition count 926
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 1389 place count 141 transition count 925
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 6 with 5 rules applied. Total rules applied 1394 place count 141 transition count 920
Free-agglomeration rule applied 12 times with reduction of 7 identical transitions.
Iterating global reduction 6 with 12 rules applied. Total rules applied 1406 place count 141 transition count 901
Reduce places removed 12 places and 0 transitions.
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 6 with 32 rules applied. Total rules applied 1438 place count 129 transition count 881
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1439 place count 128 transition count 879
Iterating global reduction 7 with 1 rules applied. Total rules applied 1440 place count 128 transition count 879
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 7 with 8 rules applied. Total rules applied 1448 place count 128 transition count 871
Drop transitions removed 58 transitions
Redundant transition composition rules discarded 58 transitions
Iterating global reduction 8 with 58 rules applied. Total rules applied 1506 place count 128 transition count 813
Free-agglomeration rule applied 6 times.
Iterating global reduction 8 with 6 rules applied. Total rules applied 1512 place count 128 transition count 807
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 8 with 10 rules applied. Total rules applied 1522 place count 122 transition count 803
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 9 with 6 rules applied. Total rules applied 1528 place count 122 transition count 797
Free-agglomeration rule applied 2 times.
Iterating global reduction 9 with 2 rules applied. Total rules applied 1530 place count 122 transition count 795
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 9 with 4 rules applied. Total rules applied 1534 place count 120 transition count 793
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 10 with 4 rules applied. Total rules applied 1538 place count 120 transition count 789
Free-agglomeration rule applied 2 times.
Iterating global reduction 10 with 2 rules applied. Total rules applied 1540 place count 120 transition count 787
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 10 with 4 rules applied. Total rules applied 1544 place count 118 transition count 785
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 11 with 2 rules applied. Total rules applied 1546 place count 118 transition count 783
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 11 with 5 rules applied. Total rules applied 1551 place count 118 transition count 867
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 11 with 21 rules applied. Total rules applied 1572 place count 113 transition count 851
Discarding 1 places :
Symmetric choice reduction at 12 with 1 rule applications. Total rules 1573 place count 112 transition count 847
Iterating global reduction 12 with 1 rules applied. Total rules applied 1574 place count 112 transition count 847
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 12 with 9 rules applied. Total rules applied 1583 place count 112 transition count 838
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 13 with 19 rules applied. Total rules applied 1602 place count 112 transition count 819
Applied a total of 1602 rules in 219 ms. Remains 112 /497 variables (removed 385) and now considering 819/27456 (removed 26637) transitions.
Running SMT prover for 1 properties.
[2023-03-18 01:58:24] [INFO ] Flow matrix only has 781 transitions (discarded 38 similar events)
// Phase 1: matrix 781 rows 112 cols
[2023-03-18 01:58:24] [INFO ] Computed 0 place invariants in 7 ms
[2023-03-18 01:58:24] [INFO ] After 33ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 01:58:24] [INFO ] After 110ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 01:58:24] [INFO ] State equation strengthened by 15 read => feed constraints.
[2023-03-18 01:58:24] [INFO ] After 20ms SMT Verify possible using 15 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-18 01:58:24] [INFO ] After 47ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 15 ms.
[2023-03-18 01:58:24] [INFO ] After 202ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 2 resets, run finished after 203 ms. (steps per millisecond=49 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 38671 steps, run timeout after 3001 ms. (steps per millisecond=12 ) properties seen :{}
Probabilistic random walk after 38671 steps, saw 27359 distinct states, run finished after 3001 ms. (steps per millisecond=12 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-18 01:58:28] [INFO ] Flow matrix only has 18593 transitions (discarded 8677 similar events)
// Phase 1: matrix 18593 rows 503 cols
[2023-03-18 01:58:28] [INFO ] Computed 8 place invariants in 60 ms
[2023-03-18 01:58:28] [INFO ] After 88ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 01:58:28] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-18 01:58:31] [INFO ] After 3591ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 01:58:32] [INFO ] State equation strengthened by 1370 read => feed constraints.
[2023-03-18 01:58:41] [INFO ] After 8944ms SMT Verify possible using 1370 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-18 01:58:43] [INFO ] Deduced a trap composed of 81 places in 1924 ms of which 1 ms to minimize.
[2023-03-18 01:58:45] [INFO ] Deduced a trap composed of 32 places in 1924 ms of which 1 ms to minimize.
[2023-03-18 01:58:48] [INFO ] Deduced a trap composed of 11 places in 1925 ms of which 0 ms to minimize.
[2023-03-18 01:58:50] [INFO ] Deduced a trap composed of 91 places in 1867 ms of which 0 ms to minimize.
[2023-03-18 01:58:52] [INFO ] Deduced a trap composed of 19 places in 1886 ms of which 1 ms to minimize.
[2023-03-18 01:58:55] [INFO ] Deduced a trap composed of 104 places in 1900 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.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositions(AtomicReducerSR.java:365)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:253)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.applyReachabilitySolver(GlobalPropertySolver.java:724)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:558)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preSolveLiveness(GlobalPropertySolver.java:412)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preStableMarking(GlobalPropertySolver.java:321)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:294)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:386)
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-18 01:58:55] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-18 01:58:55] [INFO ] After 26791ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 4 ms.
Support contains 1 out of 503 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 503/503 places, 27270/27270 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 9 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 502 transition count 27269
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 1 places in 8 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 501 transition count 27280
Free-agglomeration rule applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 7 place count 501 transition count 27277
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 11 place count 498 transition count 27276
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 498 transition count 27456
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 13 place count 497 transition count 27456
Applied a total of 13 rules in 455 ms. Remains 497 /503 variables (removed 6) and now considering 27456/27270 (removed -186) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 456 ms. Remains : 497/503 places, 27456/27270 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 186 ms. (steps per millisecond=53 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 39301 steps, run timeout after 3001 ms. (steps per millisecond=13 ) properties seen :{}
Probabilistic random walk after 39301 steps, saw 27802 distinct states, run finished after 3001 ms. (steps per millisecond=13 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-18 01:58:58] [INFO ] Flow matrix only has 18727 transitions (discarded 8729 similar events)
// Phase 1: matrix 18727 rows 497 cols
[2023-03-18 01:58:58] [INFO ] Computed 8 place invariants in 50 ms
[2023-03-18 01:58:58] [INFO ] After 76ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 01:58:58] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-18 01:59:02] [INFO ] After 3351ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 01:59:02] [INFO ] State equation strengthened by 1374 read => feed constraints.
[2023-03-18 01:59:07] [INFO ] After 5254ms SMT Verify possible using 1374 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-18 01:59:10] [INFO ] Deduced a trap composed of 11 places in 1650 ms of which 0 ms to minimize.
[2023-03-18 01:59:12] [INFO ] Deduced a trap composed of 19 places in 1647 ms of which 1 ms to minimize.
[2023-03-18 01:59:14] [INFO ] Deduced a trap composed of 91 places in 1578 ms of which 1 ms to minimize.
TIME LIMIT: Killed by timeout after 1800 seconds
MemTotal: 16393216 kB
MemFree: 12929824 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16147240 kB

BK_TIME_CONFINEMENT_REACHED

--------------------
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 StableMarking -timeout 180 -rebuildPNML

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="RERS2020-PT-pb103"
export BK_EXAMINATION="StableMarking"
export BK_TOOL="lolaxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
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 lolaxred"
echo " Input is RERS2020-PT-pb103, examination is StableMarking"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r341-tall-167889213600148"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/RERS2020-PT-pb103.tgz
mv RERS2020-PT-pb103 execution
cd execution
if [ "StableMarking" = "ReachabilityDeadlock" ] || [ "StableMarking" = "UpperBounds" ] || [ "StableMarking" = "QuasiLiveness" ] || [ "StableMarking" = "StableMarking" ] || [ "StableMarking" = "Liveness" ] || [ "StableMarking" = "OneSafe" ] || [ "StableMarking" = "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 [ "StableMarking" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "StableMarking" != "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 "StableMarking.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property StableMarking.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "StableMarking.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 '' StableMarking.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "StableMarking" = "ReachabilityDeadlock" ] || [ "StableMarking" = "QuasiLiveness" ] || [ "StableMarking" = "StableMarking" ] || [ "StableMarking" = "Liveness" ] || [ "StableMarking" = "OneSafe" ] ; then
echo "FORMULA_NAME StableMarking"
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 ;