MCC'2023- Execution of r298-tall-167873952100749

About the Execution of Marcie+red for PolyORBNT-PT-S05J80

Execution Summary
Max Memory Used (MB)	Time wait (ms)	CPU Usage (ms)	I/O Wait (ms)	Computed Result	Execution Status
6549.535	3600000.00	3659937.00	7710.50	4 ? 1 3 2 1 10 ? 1 ? 3 1 1 3 1 1	normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r298-tall-167873952100749.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 marciexred
Input is PolyORBNT-PT-S05J80, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r298-tall-167873952100749
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.6M
-rw-r--r-- 1 mcc users 50K Feb 25 23:48 CTLCardinality.txt
-rw-r--r-- 1 mcc users 257K Feb 25 23:48 CTLCardinality.xml
-rw-r--r-- 1 mcc users 50K Feb 25 23:45 CTLFireability.txt
-rw-r--r-- 1 mcc users 224K Feb 25 23:45 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 27K Feb 25 16:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 90K Feb 25 16:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 26K Feb 25 16:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 85K Feb 25 16:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 71K Feb 26 00:02 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 285K Feb 26 00:02 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 133K Feb 25 23:59 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 578K Feb 25 23:59 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.1K Feb 25 16:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 6.8K Feb 25 16:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 1.8M 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 positive values
NUM_VECTOR

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

=== Now, execution of the tool begins

BK_START 1679659134111

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=marciexred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBNT-PT-S05J80
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-24 11:58:55] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-24 11:58:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-24 11:58:55] [INFO ] Load time of PNML (sax parser for PT used): 164 ms
[2023-03-24 11:58:55] [INFO ] Transformed 1189 places.
[2023-03-24 11:58:55] [INFO ] Transformed 2350 transitions.
[2023-03-24 11:58:55] [INFO ] Parsed PT model containing 1189 places and 2350 transitions and 14464 arcs in 326 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
Ensure Unique test removed 655 transitions
Reduce redundant transitions removed 655 transitions.
Normalized transition count is 1691 out of 1695 initially.
// Phase 1: matrix 1691 rows 1189 cols
[2023-03-24 11:58:56] [INFO ] Computed 182 place invariants in 139 ms
FORMULA PolyORBNT-PT-S05J80-UpperBounds-13 3 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S05J80-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 681 resets, run finished after 148 ms. (steps per millisecond=67 ) properties (out of 14) seen :36
FORMULA PolyORBNT-PT-S05J80-UpperBounds-10 3 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBNT-PT-S05J80-UpperBounds-04 2 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBNT-PT-S05J80-UpperBounds-03 3 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 84 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 11) seen :22
Incomplete Best-First random walk after 10001 steps, including 99 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 11) seen :25
Incomplete Best-First random walk after 10001 steps, including 85 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 11) seen :26
Incomplete Best-First random walk after 10001 steps, including 128 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 11) seen :21
Incomplete Best-First random walk after 10000 steps, including 90 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 11) seen :25
Incomplete Best-First random walk after 10001 steps, including 256 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 11) seen :12
Incomplete Best-First random walk after 10001 steps, including 100 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 11) seen :23
Incomplete Best-First random walk after 10001 steps, including 98 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 11) seen :27
Incomplete Best-First random walk after 10001 steps, including 68 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 11) seen :28
Incomplete Best-First random walk after 10001 steps, including 118 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 11) seen :29
FORMULA PolyORBNT-PT-S05J80-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2023-03-24 11:58:56] [INFO ] Flow matrix only has 1691 transitions (discarded 4 similar events)
// Phase 1: matrix 1691 rows 1189 cols
[2023-03-24 11:58:56] [INFO ] Computed 182 place invariants in 83 ms
[2023-03-24 11:58:57] [INFO ] [Real]Absence check using 157 positive place invariants in 59 ms returned sat
[2023-03-24 11:58:57] [INFO ] [Real]Absence check using 157 positive and 25 generalized place invariants in 33 ms returned unsat
[2023-03-24 11:58:57] [INFO ] [Real]Absence check using 157 positive place invariants in 41 ms returned sat
[2023-03-24 11:58:57] [INFO ] [Real]Absence check using 157 positive and 25 generalized place invariants in 34 ms returned sat
[2023-03-24 11:58:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 11:58:58] [INFO ] [Real]Absence check using state equation in 1156 ms returned sat
[2023-03-24 11:58:58] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 11:58:58] [INFO ] [Nat]Absence check using 157 positive place invariants in 43 ms returned sat
[2023-03-24 11:58:58] [INFO ] [Nat]Absence check using 157 positive and 25 generalized place invariants in 41 ms returned sat
[2023-03-24 11:58:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 11:58:59] [INFO ] [Nat]Absence check using state equation in 916 ms returned sat
[2023-03-24 11:58:59] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 11:59:02] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-24 11:59:03] [INFO ] [Nat]Added 1 Read/Feed constraints in 3879 ms returned unknown
[2023-03-24 11:59:03] [INFO ] [Real]Absence check using 157 positive place invariants in 36 ms returned sat
[2023-03-24 11:59:03] [INFO ] [Real]Absence check using 157 positive and 25 generalized place invariants in 39 ms returned unsat
[2023-03-24 11:59:03] [INFO ] [Real]Absence check using 157 positive place invariants in 36 ms returned sat
[2023-03-24 11:59:03] [INFO ] [Real]Absence check using 157 positive and 25 generalized place invariants in 27 ms returned unsat
[2023-03-24 11:59:04] [INFO ] [Real]Absence check using 157 positive place invariants in 35 ms returned sat
[2023-03-24 11:59:04] [INFO ] [Real]Absence check using 157 positive and 25 generalized place invariants in 43 ms returned sat
[2023-03-24 11:59:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 11:59:05] [INFO ] [Real]Absence check using state equation in 1254 ms returned sat
[2023-03-24 11:59:05] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 11:59:05] [INFO ] [Nat]Absence check using 157 positive place invariants in 38 ms returned sat
[2023-03-24 11:59:05] [INFO ] [Nat]Absence check using 157 positive and 25 generalized place invariants in 42 ms returned sat
[2023-03-24 11:59:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 11:59:06] [INFO ] [Nat]Absence check using state equation in 765 ms returned sat
[2023-03-24 11:59:06] [INFO ] [Nat]Added 1 Read/Feed constraints in 127 ms returned sat
[2023-03-24 11:59:06] [INFO ] Computed and/alt/rep : 949/2209/949 causal constraints (skipped 736 transitions) in 152 ms.
[2023-03-24 11:59:07] [INFO ] Added : 17 causal constraints over 4 iterations in 963 ms. Result :sat
Minimization took 562 ms.
[2023-03-24 11:59:08] [INFO ] [Real]Absence check using 157 positive place invariants in 52 ms returned sat
[2023-03-24 11:59:08] [INFO ] [Real]Absence check using 157 positive and 25 generalized place invariants in 47 ms returned unsat
[2023-03-24 11:59:08] [INFO ] [Real]Absence check using 157 positive place invariants in 35 ms returned sat
[2023-03-24 11:59:08] [INFO ] [Real]Absence check using 157 positive and 25 generalized place invariants in 48 ms returned sat
[2023-03-24 11:59:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 11:59:09] [INFO ] [Real]Absence check using state equation in 1245 ms returned sat
[2023-03-24 11:59:10] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 11:59:10] [INFO ] [Nat]Absence check using 157 positive place invariants in 37 ms returned sat
[2023-03-24 11:59:10] [INFO ] [Nat]Absence check using 157 positive and 25 generalized place invariants in 40 ms returned sat
[2023-03-24 11:59:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 11:59:11] [INFO ] [Nat]Absence check using state equation in 763 ms returned sat
[2023-03-24 11:59:11] [INFO ] [Nat]Added 1 Read/Feed constraints in 120 ms returned sat
[2023-03-24 11:59:11] [INFO ] Computed and/alt/rep : 949/2209/949 causal constraints (skipped 736 transitions) in 102 ms.
[2023-03-24 11:59:12] [INFO ] Added : 17 causal constraints over 4 iterations in 910 ms. Result :sat
Minimization took 502 ms.
[2023-03-24 11:59:12] [INFO ] [Real]Absence check using 157 positive place invariants in 36 ms returned sat
[2023-03-24 11:59:12] [INFO ] [Real]Absence check using 157 positive and 25 generalized place invariants in 42 ms returned unsat
[2023-03-24 11:59:13] [INFO ] [Real]Absence check using 157 positive place invariants in 34 ms returned sat
[2023-03-24 11:59:13] [INFO ] [Real]Absence check using 157 positive and 25 generalized place invariants in 4 ms returned unsat
[2023-03-24 11:59:13] [INFO ] [Real]Absence check using 157 positive place invariants in 36 ms returned sat
[2023-03-24 11:59:13] [INFO ] [Real]Absence check using 157 positive and 25 generalized place invariants in 43 ms returned unsat
Current structural bounds on expressions (after SMT) : [4, 4, 1, 10, 988, 1, 988, 1, 1, 1] Max seen :[4, 3, 1, 10, 3, 1, 3, 1, 1, 1]
FORMULA PolyORBNT-PT-S05J80-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S05J80-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S05J80-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S05J80-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S05J80-UpperBounds-06 10 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S05J80-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S05J80-UpperBounds-00 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 2 out of 1189 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1189/1189 places, 1695/1695 transitions.
Ensure Unique test removed 5 places
Drop transitions removed 86 transitions
Trivial Post-agglo rules discarded 86 transitions
Performed 86 trivial Post agglomeration. Transition count delta: 86
Iterating post reduction 0 with 91 rules applied. Total rules applied 91 place count 1184 transition count 1609
Reduce places removed 86 places and 0 transitions.
Iterating post reduction 1 with 86 rules applied. Total rules applied 177 place count 1098 transition count 1609
Performed 84 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 84 Pre rules applied. Total rules applied 177 place count 1098 transition count 1525
Deduced a syphon composed of 84 places in 2 ms
Reduce places removed 84 places and 0 transitions.
Iterating global reduction 2 with 168 rules applied. Total rules applied 345 place count 1014 transition count 1525
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 346 place count 1013 transition count 1524
Iterating global reduction 2 with 1 rules applied. Total rules applied 347 place count 1013 transition count 1524
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 351 place count 1011 transition count 1522
Applied a total of 351 rules in 379 ms. Remains 1011 /1189 variables (removed 178) and now considering 1522/1695 (removed 173) transitions.
[2023-03-24 11:59:13] [INFO ] Flow matrix only has 1518 transitions (discarded 4 similar events)
// Phase 1: matrix 1518 rows 1011 cols
[2023-03-24 11:59:13] [INFO ] Computed 177 place invariants in 37 ms
[2023-03-24 11:59:15] [INFO ] Dead Transitions using invariants and state equation in 2100 ms found 95 transitions.
Found 95 dead transitions using SMT.
Drop transitions removed 95 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 95 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1011/1189 places, 1427/1695 transitions.
Applied a total of 0 rules in 60 ms. Remains 1011 /1011 variables (removed 0) and now considering 1427/1427 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2541 ms. Remains : 1011/1189 places, 1427/1695 transitions.
Normalized transition count is 1423 out of 1427 initially.
// Phase 1: matrix 1423 rows 1011 cols
[2023-03-24 11:59:15] [INFO ] Computed 177 place invariants in 33 ms
Incomplete random walk after 1000000 steps, including 47448 resets, run finished after 8314 ms. (steps per millisecond=120 ) properties (out of 3) seen :9
Incomplete Best-First random walk after 1000001 steps, including 2678 resets, run finished after 1654 ms. (steps per millisecond=604 ) properties (out of 3) seen :9
Incomplete Best-First random walk after 1000001 steps, including 2637 resets, run finished after 1644 ms. (steps per millisecond=608 ) properties (out of 3) seen :9
Incomplete Best-First random walk after 1000001 steps, including 2702 resets, run finished after 1657 ms. (steps per millisecond=603 ) properties (out of 3) seen :9
[2023-03-24 11:59:29] [INFO ] Flow matrix only has 1423 transitions (discarded 4 similar events)
// Phase 1: matrix 1423 rows 1011 cols
[2023-03-24 11:59:29] [INFO ] Computed 177 place invariants in 32 ms
[2023-03-24 11:59:29] [INFO ] [Real]Absence check using 156 positive place invariants in 31 ms returned sat
[2023-03-24 11:59:29] [INFO ] [Real]Absence check using 156 positive and 21 generalized place invariants in 34 ms returned sat
[2023-03-24 11:59:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 11:59:30] [INFO ] [Real]Absence check using state equation in 1083 ms returned sat
[2023-03-24 11:59:30] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 11:59:30] [INFO ] [Nat]Absence check using 156 positive place invariants in 33 ms returned sat
[2023-03-24 11:59:30] [INFO ] [Nat]Absence check using 156 positive and 21 generalized place invariants in 38 ms returned sat
[2023-03-24 11:59:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 11:59:32] [INFO ] [Nat]Absence check using state equation in 1409 ms returned sat
[2023-03-24 11:59:32] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 11:59:34] [INFO ] [Nat]Added 1 Read/Feed constraints in 2103 ms returned sat
[2023-03-24 11:59:34] [INFO ] Deduced a trap composed of 344 places in 349 ms of which 4 ms to minimize.
[2023-03-24 11:59:35] [INFO ] Deduced a trap composed of 332 places in 400 ms of which 2 ms to minimize.
[2023-03-24 11:59:35] [INFO ] Deduced a trap composed of 323 places in 337 ms of which 1 ms to minimize.
[2023-03-24 11:59:35] [INFO ] Deduced a trap composed of 327 places in 345 ms of which 2 ms to minimize.
[2023-03-24 11:59:36] [INFO ] Deduced a trap composed of 321 places in 367 ms of which 1 ms to minimize.
[2023-03-24 11:59:36] [INFO ] Deduced a trap composed of 336 places in 361 ms of which 1 ms to minimize.
[2023-03-24 11:59:37] [INFO ] Deduced a trap composed of 326 places in 327 ms of which 0 ms to minimize.
[2023-03-24 11:59:37] [INFO ] Deduced a trap composed of 324 places in 346 ms of which 1 ms to minimize.
[2023-03-24 11:59:37] [INFO ] Deduced a trap composed of 312 places in 338 ms of which 1 ms to minimize.
[2023-03-24 11:59:38] [INFO ] Deduced a trap composed of 321 places in 352 ms of which 1 ms to minimize.
[2023-03-24 11:59:38] [INFO ] Deduced a trap composed of 330 places in 367 ms of which 1 ms to minimize.
[2023-03-24 11:59:39] [INFO ] Deduced a trap composed of 308 places in 356 ms of which 1 ms to minimize.
[2023-03-24 11:59:39] [INFO ] Deduced a trap composed of 326 places in 365 ms of which 1 ms to minimize.
[2023-03-24 11:59:40] [INFO ] Deduced a trap composed of 323 places in 367 ms of which 1 ms to minimize.
[2023-03-24 11:59:40] [INFO ] Deduced a trap composed of 309 places in 362 ms of which 1 ms to minimize.
[2023-03-24 11:59:41] [INFO ] Deduced a trap composed of 320 places in 366 ms of which 1 ms to minimize.
[2023-03-24 11:59:41] [INFO ] Deduced a trap composed of 311 places in 338 ms of which 1 ms to minimize.
[2023-03-24 11:59:42] [INFO ] Deduced a trap composed of 320 places in 332 ms of which 1 ms to minimize.
[2023-03-24 11:59:42] [INFO ] Deduced a trap composed of 335 places in 373 ms of which 1 ms to minimize.
[2023-03-24 11:59:43] [INFO ] Deduced a trap composed of 330 places in 370 ms of which 1 ms to minimize.
[2023-03-24 11:59:43] [INFO ] Deduced a trap composed of 323 places in 341 ms of which 1 ms to minimize.
[2023-03-24 11:59:44] [INFO ] Deduced a trap composed of 314 places in 341 ms of which 1 ms to minimize.
[2023-03-24 11:59:44] [INFO ] Deduced a trap composed of 317 places in 348 ms of which 1 ms to minimize.
[2023-03-24 11:59:44] [INFO ] Deduced a trap composed of 335 places in 337 ms of which 0 ms to minimize.
[2023-03-24 11:59:45] [INFO ] Deduced a trap composed of 345 places in 338 ms of which 1 ms to minimize.
[2023-03-24 11:59:45] [INFO ] Deduced a trap composed of 329 places in 333 ms of which 1 ms to minimize.
[2023-03-24 11:59:46] [INFO ] Deduced a trap composed of 320 places in 338 ms of which 0 ms to minimize.
[2023-03-24 11:59:47] [INFO ] Deduced a trap composed of 320 places in 338 ms of which 1 ms to minimize.
[2023-03-24 11:59:47] [INFO ] Deduced a trap composed of 336 places in 345 ms of which 1 ms to minimize.
[2023-03-24 11:59:48] [INFO ] Deduced a trap composed of 305 places in 349 ms of which 1 ms to minimize.
[2023-03-24 11:59:48] [INFO ] Deduced a trap composed of 308 places in 335 ms of which 1 ms to minimize.
[2023-03-24 11:59:49] [INFO ] Deduced a trap composed of 315 places in 355 ms of which 1 ms to minimize.
[2023-03-24 11:59:50] [INFO ] Deduced a trap composed of 335 places in 346 ms of which 1 ms to minimize.
[2023-03-24 11:59:50] [INFO ] Deduced a trap composed of 356 places in 341 ms of which 2 ms to minimize.
[2023-03-24 11:59:51] [INFO ] Deduced a trap composed of 311 places in 357 ms of which 2 ms to minimize.
[2023-03-24 11:59:51] [INFO ] Deduced a trap composed of 323 places in 333 ms of which 0 ms to minimize.
[2023-03-24 11:59:51] [INFO ] Deduced a trap composed of 335 places in 325 ms of which 1 ms to minimize.
[2023-03-24 11:59:52] [INFO ] Deduced a trap composed of 335 places in 323 ms of which 1 ms to minimize.
[2023-03-24 11:59:53] [INFO ] Deduced a trap composed of 320 places in 333 ms of which 1 ms to minimize.
[2023-03-24 11:59:54] [INFO ] Deduced a trap composed of 312 places in 341 ms of which 2 ms to minimize.
[2023-03-24 11:59:55] [INFO ] Deduced a trap composed of 308 places in 352 ms of which 1 ms to minimize.
[2023-03-24 11:59:55] [INFO ] Deduced a trap composed of 317 places in 337 ms of which 1 ms to minimize.
[2023-03-24 11:59:56] [INFO ] Deduced a trap composed of 306 places in 338 ms of which 0 ms to minimize.
[2023-03-24 11:59:56] [INFO ] Deduced a trap composed of 315 places in 333 ms of which 1 ms to minimize.
[2023-03-24 11:59:59] [INFO ] Deduced a trap composed of 345 places in 340 ms of which 1 ms to minimize.
[2023-03-24 11:59:59] [INFO ] Deduced a trap composed of 303 places in 353 ms of which 1 ms to minimize.
[2023-03-24 12:00:02] [INFO ] Trap strengthening (SAT) tested/added 46/46 trap constraints in 28439 ms
[2023-03-24 12:00:02] [INFO ] [Real]Absence check using 156 positive place invariants in 31 ms returned sat
[2023-03-24 12:00:02] [INFO ] [Real]Absence check using 156 positive and 21 generalized place invariants in 33 ms returned sat
[2023-03-24 12:00:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 12:00:03] [INFO ] [Real]Absence check using state equation in 1012 ms returned sat
[2023-03-24 12:00:03] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 12:00:04] [INFO ] [Nat]Absence check using 156 positive place invariants in 34 ms returned sat
[2023-03-24 12:00:04] [INFO ] [Nat]Absence check using 156 positive and 21 generalized place invariants in 37 ms returned sat
[2023-03-24 12:00:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 12:00:04] [INFO ] [Nat]Absence check using state equation in 820 ms returned sat
[2023-03-24 12:00:05] [INFO ] [Nat]Added 1 Read/Feed constraints in 691 ms returned sat
[2023-03-24 12:00:05] [INFO ] Deduced a trap composed of 201 places in 377 ms of which 1 ms to minimize.
[2023-03-24 12:00:06] [INFO ] Deduced a trap composed of 320 places in 367 ms of which 1 ms to minimize.
[2023-03-24 12:00:06] [INFO ] Deduced a trap composed of 332 places in 366 ms of which 1 ms to minimize.
[2023-03-24 12:00:07] [INFO ] Deduced a trap composed of 291 places in 339 ms of which 1 ms to minimize.
[2023-03-24 12:00:07] [INFO ] Deduced a trap composed of 332 places in 349 ms of which 2 ms to minimize.
[2023-03-24 12:00:08] [INFO ] Deduced a trap composed of 376 places in 364 ms of which 1 ms to minimize.
[2023-03-24 12:00:08] [INFO ] Deduced a trap composed of 315 places in 343 ms of which 1 ms to minimize.
[2023-03-24 12:00:08] [INFO ] Deduced a trap composed of 323 places in 357 ms of which 1 ms to minimize.
[2023-03-24 12:00:09] [INFO ] Deduced a trap composed of 303 places in 359 ms of which 1 ms to minimize.
[2023-03-24 12:00:10] [INFO ] Deduced a trap composed of 336 places in 335 ms of which 1 ms to minimize.
[2023-03-24 12:00:10] [INFO ] Deduced a trap composed of 350 places in 335 ms of which 1 ms to minimize.
[2023-03-24 12:00:10] [INFO ] Deduced a trap composed of 314 places in 346 ms of which 1 ms to minimize.
[2023-03-24 12:00:11] [INFO ] Deduced a trap composed of 330 places in 330 ms of which 0 ms to minimize.
[2023-03-24 12:00:12] [INFO ] Deduced a trap composed of 396 places in 332 ms of which 1 ms to minimize.
[2023-03-24 12:00:13] [INFO ] Deduced a trap composed of 324 places in 353 ms of which 1 ms to minimize.
[2023-03-24 12:00:13] [INFO ] Deduced a trap composed of 329 places in 338 ms of which 1 ms to minimize.
[2023-03-24 12:00:14] [INFO ] Deduced a trap composed of 308 places in 335 ms of which 1 ms to minimize.
[2023-03-24 12:00:14] [INFO ] Deduced a trap composed of 308 places in 338 ms of which 0 ms to minimize.
[2023-03-24 12:00:14] [INFO ] Deduced a trap composed of 336 places in 339 ms of which 2 ms to minimize.
[2023-03-24 12:00:15] [INFO ] Deduced a trap composed of 312 places in 341 ms of which 1 ms to minimize.
[2023-03-24 12:00:16] [INFO ] Deduced a trap composed of 293 places in 328 ms of which 1 ms to minimize.
[2023-03-24 12:00:17] [INFO ] Deduced a trap composed of 332 places in 337 ms of which 5 ms to minimize.
[2023-03-24 12:00:17] [INFO ] Deduced a trap composed of 338 places in 333 ms of which 1 ms to minimize.
[2023-03-24 12:00:17] [INFO ] Deduced a trap composed of 332 places in 326 ms of which 1 ms to minimize.
[2023-03-24 12:00:18] [INFO ] Deduced a trap composed of 308 places in 326 ms of which 1 ms to minimize.
[2023-03-24 12:00:18] [INFO ] Deduced a trap composed of 321 places in 325 ms of which 1 ms to minimize.
[2023-03-24 12:00:19] [INFO ] Deduced a trap composed of 326 places in 328 ms of which 0 ms to minimize.
[2023-03-24 12:00:19] [INFO ] Deduced a trap composed of 326 places in 333 ms of which 0 ms to minimize.
[2023-03-24 12:00:19] [INFO ] Deduced a trap composed of 308 places in 339 ms of which 1 ms to minimize.
[2023-03-24 12:00:20] [INFO ] Deduced a trap composed of 314 places in 320 ms of which 1 ms to minimize.
[2023-03-24 12:00:20] [INFO ] Deduced a trap composed of 327 places in 334 ms of which 0 ms to minimize.
[2023-03-24 12:00:21] [INFO ] Deduced a trap composed of 305 places in 316 ms of which 1 ms to minimize.
[2023-03-24 12:00:21] [INFO ] Deduced a trap composed of 294 places in 342 ms of which 1 ms to minimize.
[2023-03-24 12:00:22] [INFO ] Deduced a trap composed of 299 places in 350 ms of which 1 ms to minimize.
[2023-03-24 12:00:22] [INFO ] Deduced a trap composed of 324 places in 341 ms of which 0 ms to minimize.
[2023-03-24 12:00:23] [INFO ] Deduced a trap composed of 335 places in 336 ms of which 1 ms to minimize.
[2023-03-24 12:00:23] [INFO ] Deduced a trap composed of 308 places in 343 ms of which 1 ms to minimize.
[2023-03-24 12:00:24] [INFO ] Deduced a trap composed of 335 places in 332 ms of which 1 ms to minimize.
[2023-03-24 12:00:26] [INFO ] Deduced a trap composed of 332 places in 350 ms of which 1 ms to minimize.
[2023-03-24 12:00:26] [INFO ] Deduced a trap composed of 330 places in 366 ms of which 1 ms to minimize.
[2023-03-24 12:00:27] [INFO ] Deduced a trap composed of 335 places in 337 ms of which 1 ms to minimize.
[2023-03-24 12:00:27] [INFO ] Deduced a trap composed of 323 places in 329 ms of which 1 ms to minimize.
[2023-03-24 12:00:28] [INFO ] Deduced a trap composed of 314 places in 322 ms of which 1 ms to minimize.
[2023-03-24 12:00:28] [INFO ] Deduced a trap composed of 314 places in 333 ms of which 1 ms to minimize.
[2023-03-24 12:00:30] [INFO ] Deduced a trap composed of 321 places in 336 ms of which 1 ms to minimize.
[2023-03-24 12:00:32] [INFO ] Deduced a trap composed of 339 places in 336 ms of which 5 ms to minimize.
[2023-03-24 12:00:34] [INFO ] Deduced a trap composed of 321 places in 340 ms of which 1 ms to minimize.
[2023-03-24 12:00:37] [INFO ] Deduced a trap composed of 314 places in 333 ms of which 1 ms to minimize.
[2023-03-24 12:00:37] [INFO ] Deduced a trap composed of 323 places in 331 ms of which 1 ms to minimize.
[2023-03-24 12:00:38] [INFO ] Deduced a trap composed of 314 places in 344 ms of which 1 ms to minimize.
[2023-03-24 12:00:38] [INFO ] Deduced a trap composed of 332 places in 327 ms of which 1 ms to minimize.
[2023-03-24 12:00:39] [INFO ] Deduced a trap composed of 317 places in 341 ms of which 1 ms to minimize.
[2023-03-24 12:00:41] [INFO ] Deduced a trap composed of 317 places in 329 ms of which 3 ms to minimize.
[2023-03-24 12:00:42] [INFO ] Deduced a trap composed of 341 places in 333 ms of which 1 ms to minimize.
[2023-03-24 12:00:43] [INFO ] Deduced a trap composed of 338 places in 334 ms of which 1 ms to minimize.
[2023-03-24 12:00:43] [INFO ] Deduced a trap composed of 311 places in 321 ms of which 1 ms to minimize.
[2023-03-24 12:00:43] [INFO ] Deduced a trap composed of 320 places in 332 ms of which 1 ms to minimize.
[2023-03-24 12:00:44] [INFO ] Deduced a trap composed of 311 places in 326 ms of which 0 ms to minimize.
[2023-03-24 12:00:44] [INFO ] Deduced a trap composed of 323 places in 337 ms of which 0 ms to minimize.
[2023-03-24 12:00:45] [INFO ] Deduced a trap composed of 342 places in 332 ms of which 1 ms to minimize.
[2023-03-24 12:00:48] [INFO ] Deduced a trap composed of 332 places in 321 ms of which 1 ms to minimize.
[2023-03-24 12:00:48] [INFO ] Deduced a trap composed of 321 places in 317 ms of which 1 ms to minimize.
[2023-03-24 12:00:48] [INFO ] Trap strengthening (SAT) tested/added 62/62 trap constraints in 43330 ms
[2023-03-24 12:00:49] [INFO ] [Real]Absence check using 156 positive place invariants in 31 ms returned sat
[2023-03-24 12:00:49] [INFO ] [Real]Absence check using 156 positive and 21 generalized place invariants in 42 ms returned sat
[2023-03-24 12:00:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 12:00:50] [INFO ] [Real]Absence check using state equation in 1009 ms returned sat
[2023-03-24 12:00:50] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 12:00:50] [INFO ] [Nat]Absence check using 156 positive place invariants in 33 ms returned sat
[2023-03-24 12:00:50] [INFO ] [Nat]Absence check using 156 positive and 21 generalized place invariants in 37 ms returned sat
[2023-03-24 12:00:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 12:00:51] [INFO ] [Nat]Absence check using state equation in 813 ms returned sat
[2023-03-24 12:00:51] [INFO ] [Nat]Added 1 Read/Feed constraints in 690 ms returned sat
[2023-03-24 12:00:52] [INFO ] Deduced a trap composed of 201 places in 382 ms of which 1 ms to minimize.
[2023-03-24 12:00:52] [INFO ] Deduced a trap composed of 320 places in 341 ms of which 1 ms to minimize.
[2023-03-24 12:00:53] [INFO ] Deduced a trap composed of 332 places in 370 ms of which 0 ms to minimize.
[2023-03-24 12:00:53] [INFO ] Deduced a trap composed of 291 places in 341 ms of which 1 ms to minimize.
[2023-03-24 12:00:53] [INFO ] Deduced a trap composed of 332 places in 357 ms of which 1 ms to minimize.
[2023-03-24 12:00:54] [INFO ] Deduced a trap composed of 376 places in 370 ms of which 1 ms to minimize.
[2023-03-24 12:00:54] [INFO ] Deduced a trap composed of 315 places in 348 ms of which 1 ms to minimize.
[2023-03-24 12:00:55] [INFO ] Deduced a trap composed of 323 places in 352 ms of which 1 ms to minimize.
[2023-03-24 12:00:55] [INFO ] Deduced a trap composed of 303 places in 354 ms of which 1 ms to minimize.
[2023-03-24 12:00:56] [INFO ] Deduced a trap composed of 336 places in 342 ms of which 1 ms to minimize.
[2023-03-24 12:00:56] [INFO ] Deduced a trap composed of 350 places in 337 ms of which 1 ms to minimize.
[2023-03-24 12:00:57] [INFO ] Deduced a trap composed of 314 places in 351 ms of which 1 ms to minimize.
[2023-03-24 12:00:57] [INFO ] Deduced a trap composed of 330 places in 345 ms of which 1 ms to minimize.
[2023-03-24 12:00:59] [INFO ] Deduced a trap composed of 396 places in 334 ms of which 0 ms to minimize.
[2023-03-24 12:00:59] [INFO ] Deduced a trap composed of 324 places in 340 ms of which 1 ms to minimize.
[2023-03-24 12:01:00] [INFO ] Deduced a trap composed of 329 places in 339 ms of which 0 ms to minimize.
[2023-03-24 12:01:00] [INFO ] Deduced a trap composed of 308 places in 339 ms of which 1 ms to minimize.
[2023-03-24 12:01:00] [INFO ] Deduced a trap composed of 308 places in 349 ms of which 1 ms to minimize.
[2023-03-24 12:01:01] [INFO ] Deduced a trap composed of 336 places in 340 ms of which 1 ms to minimize.
[2023-03-24 12:01:01] [INFO ] Deduced a trap composed of 312 places in 334 ms of which 1 ms to minimize.
[2023-03-24 12:01:02] [INFO ] Deduced a trap composed of 293 places in 335 ms of which 1 ms to minimize.
[2023-03-24 12:01:03] [INFO ] Deduced a trap composed of 332 places in 329 ms of which 1 ms to minimize.
[2023-03-24 12:01:03] [INFO ] Deduced a trap composed of 338 places in 333 ms of which 1 ms to minimize.
[2023-03-24 12:01:04] [INFO ] Deduced a trap composed of 332 places in 328 ms of which 1 ms to minimize.
[2023-03-24 12:01:04] [INFO ] Deduced a trap composed of 308 places in 322 ms of which 1 ms to minimize.
[2023-03-24 12:01:04] [INFO ] Deduced a trap composed of 321 places in 368 ms of which 1 ms to minimize.
[2023-03-24 12:01:05] [INFO ] Deduced a trap composed of 326 places in 330 ms of which 0 ms to minimize.
[2023-03-24 12:01:05] [INFO ] Deduced a trap composed of 326 places in 335 ms of which 1 ms to minimize.
[2023-03-24 12:01:06] [INFO ] Deduced a trap composed of 308 places in 333 ms of which 0 ms to minimize.
[2023-03-24 12:01:06] [INFO ] Deduced a trap composed of 314 places in 320 ms of which 1 ms to minimize.
[2023-03-24 12:01:07] [INFO ] Deduced a trap composed of 327 places in 336 ms of which 1 ms to minimize.
[2023-03-24 12:01:07] [INFO ] Deduced a trap composed of 305 places in 317 ms of which 1 ms to minimize.
[2023-03-24 12:01:08] [INFO ] Deduced a trap composed of 294 places in 336 ms of which 1 ms to minimize.
[2023-03-24 12:01:08] [INFO ] Deduced a trap composed of 299 places in 328 ms of which 1 ms to minimize.
[2023-03-24 12:01:08] [INFO ] Deduced a trap composed of 324 places in 331 ms of which 2 ms to minimize.
[2023-03-24 12:01:09] [INFO ] Deduced a trap composed of 335 places in 335 ms of which 1 ms to minimize.
[2023-03-24 12:01:09] [INFO ] Deduced a trap composed of 308 places in 335 ms of which 1 ms to minimize.
[2023-03-24 12:01:11] [INFO ] Deduced a trap composed of 335 places in 334 ms of which 0 ms to minimize.
[2023-03-24 12:01:12] [INFO ] Deduced a trap composed of 332 places in 328 ms of which 1 ms to minimize.
[2023-03-24 12:01:12] [INFO ] Deduced a trap composed of 330 places in 335 ms of which 1 ms to minimize.
[2023-03-24 12:01:13] [INFO ] Deduced a trap composed of 335 places in 328 ms of which 1 ms to minimize.
[2023-03-24 12:01:13] [INFO ] Deduced a trap composed of 323 places in 331 ms of which 1 ms to minimize.
[2023-03-24 12:01:14] [INFO ] Deduced a trap composed of 314 places in 327 ms of which 1 ms to minimize.
[2023-03-24 12:01:15] [INFO ] Deduced a trap composed of 314 places in 330 ms of which 1 ms to minimize.
[2023-03-24 12:01:16] [INFO ] Deduced a trap composed of 321 places in 331 ms of which 1 ms to minimize.
[2023-03-24 12:01:18] [INFO ] Deduced a trap composed of 339 places in 327 ms of which 1 ms to minimize.
[2023-03-24 12:01:20] [INFO ] Deduced a trap composed of 321 places in 324 ms of which 0 ms to minimize.
[2023-03-24 12:01:23] [INFO ] Deduced a trap composed of 314 places in 331 ms of which 1 ms to minimize.
[2023-03-24 12:01:24] [INFO ] Deduced a trap composed of 323 places in 329 ms of which 0 ms to minimize.
[2023-03-24 12:01:24] [INFO ] Deduced a trap composed of 314 places in 326 ms of which 1 ms to minimize.
[2023-03-24 12:01:24] [INFO ] Deduced a trap composed of 332 places in 332 ms of which 1 ms to minimize.
[2023-03-24 12:01:25] [INFO ] Deduced a trap composed of 317 places in 338 ms of which 1 ms to minimize.
[2023-03-24 12:01:27] [INFO ] Deduced a trap composed of 317 places in 322 ms of which 1 ms to minimize.
[2023-03-24 12:01:28] [INFO ] Deduced a trap composed of 341 places in 331 ms of which 1 ms to minimize.
[2023-03-24 12:01:29] [INFO ] Deduced a trap composed of 338 places in 330 ms of which 1 ms to minimize.
[2023-03-24 12:01:29] [INFO ] Deduced a trap composed of 311 places in 328 ms of which 1 ms to minimize.
[2023-03-24 12:01:29] [INFO ] Deduced a trap composed of 320 places in 339 ms of which 0 ms to minimize.
[2023-03-24 12:01:30] [INFO ] Deduced a trap composed of 311 places in 332 ms of which 1 ms to minimize.
[2023-03-24 12:01:31] [INFO ] Deduced a trap composed of 323 places in 341 ms of which 1 ms to minimize.
[2023-03-24 12:01:31] [INFO ] Deduced a trap composed of 342 places in 332 ms of which 1 ms to minimize.
[2023-03-24 12:01:34] [INFO ] Deduced a trap composed of 332 places in 324 ms of which 0 ms to minimize.
[2023-03-24 12:01:34] [INFO ] Deduced a trap composed of 321 places in 322 ms of which 1 ms to minimize.
[2023-03-24 12:01:35] [INFO ] Trap strengthening (SAT) tested/added 62/62 trap constraints in 43340 ms
Current structural bounds on expressions (after SMT) : [4, 988, 988] Max seen :[3, 3, 3]
Support contains 2 out of 1011 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1011/1011 places, 1427/1427 transitions.
Applied a total of 0 rules in 52 ms. Remains 1011 /1011 variables (removed 0) and now considering 1427/1427 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 53 ms. Remains : 1011/1011 places, 1427/1427 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1011/1011 places, 1427/1427 transitions.
Applied a total of 0 rules in 74 ms. Remains 1011 /1011 variables (removed 0) and now considering 1427/1427 (removed 0) transitions.
[2023-03-24 12:01:35] [INFO ] Flow matrix only has 1423 transitions (discarded 4 similar events)
[2023-03-24 12:01:35] [INFO ] Invariant cache hit.
[2023-03-24 12:01:37] [INFO ] Implicit Places using invariants in 2286 ms returned []
[2023-03-24 12:01:37] [INFO ] Flow matrix only has 1423 transitions (discarded 4 similar events)
[2023-03-24 12:01:37] [INFO ] Invariant cache hit.
[2023-03-24 12:01:38] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 12:02:05] [INFO ] Implicit Places using invariants and state equation in 27942 ms returned []
Implicit Place search using SMT with State Equation took 30231 ms to find 0 implicit places.
[2023-03-24 12:02:05] [INFO ] Redundant transitions in 99 ms returned []
[2023-03-24 12:02:05] [INFO ] Flow matrix only has 1423 transitions (discarded 4 similar events)
[2023-03-24 12:02:05] [INFO ] Invariant cache hit.
[2023-03-24 12:02:07] [INFO ] Dead Transitions using invariants and state equation in 1905 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32316 ms. Remains : 1011/1011 places, 1427/1427 transitions.
Starting property specific reduction for PolyORBNT-PT-S05J80-UpperBounds-01
Normalized transition count is 1423 out of 1427 initially.
// Phase 1: matrix 1423 rows 1011 cols
[2023-03-24 12:02:07] [INFO ] Computed 177 place invariants in 29 ms
Incomplete random walk after 10000 steps, including 484 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :3
[2023-03-24 12:02:07] [INFO ] Flow matrix only has 1423 transitions (discarded 4 similar events)
// Phase 1: matrix 1423 rows 1011 cols
[2023-03-24 12:02:07] [INFO ] Computed 177 place invariants in 35 ms
[2023-03-24 12:02:07] [INFO ] [Real]Absence check using 156 positive place invariants in 31 ms returned sat
[2023-03-24 12:02:07] [INFO ] [Real]Absence check using 156 positive and 21 generalized place invariants in 33 ms returned sat
[2023-03-24 12:02:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 12:02:08] [INFO ] [Real]Absence check using state equation in 1041 ms returned sat
[2023-03-24 12:02:08] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 12:02:09] [INFO ] [Nat]Absence check using 156 positive place invariants in 37 ms returned sat
[2023-03-24 12:02:09] [INFO ] [Nat]Absence check using 156 positive and 21 generalized place invariants in 37 ms returned sat
[2023-03-24 12:02:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 12:02:10] [INFO ] [Nat]Absence check using state equation in 1377 ms returned sat
[2023-03-24 12:02:10] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 12:02:12] [INFO ] [Nat]Added 1 Read/Feed constraints in 2074 ms returned sat
[2023-03-24 12:02:12] [INFO ] Deduced a trap composed of 344 places in 343 ms of which 1 ms to minimize.
[2023-03-24 12:02:13] [INFO ] Deduced a trap composed of 332 places in 340 ms of which 0 ms to minimize.
[2023-03-24 12:02:13] [INFO ] Deduced a trap composed of 323 places in 352 ms of which 1 ms to minimize.
[2023-03-24 12:02:14] [INFO ] Deduced a trap composed of 327 places in 333 ms of which 1 ms to minimize.
[2023-03-24 12:02:14] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
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.verifyPossible(DeadlockTester.java:916)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:733)
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)
Current structural bounds on expressions (after SMT) : [-1] Max seen :[3]
Support contains 1 out of 1011 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1011/1011 places, 1427/1427 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1011 transition count 1426
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1010 transition count 1426
Applied a total of 2 rules in 59 ms. Remains 1010 /1011 variables (removed 1) and now considering 1426/1427 (removed 1) transitions.
[2023-03-24 12:02:14] [INFO ] Flow matrix only has 1422 transitions (discarded 4 similar events)
// Phase 1: matrix 1422 rows 1010 cols
[2023-03-24 12:02:14] [INFO ] Computed 177 place invariants in 37 ms
[2023-03-24 12:02:16] [INFO ] Dead Transitions using invariants and state equation in 2110 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2170 ms. Remains : 1010/1011 places, 1426/1427 transitions.
Normalized transition count is 1422 out of 1426 initially.
// Phase 1: matrix 1422 rows 1010 cols
[2023-03-24 12:02:16] [INFO ] Computed 177 place invariants in 48 ms
Incomplete random walk after 1000000 steps, including 52069 resets, run finished after 8607 ms. (steps per millisecond=116 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 1000001 steps, including 2635 resets, run finished after 1590 ms. (steps per millisecond=628 ) properties (out of 1) seen :3
[2023-03-24 12:02:26] [INFO ] Flow matrix only has 1422 transitions (discarded 4 similar events)
// Phase 1: matrix 1422 rows 1010 cols
[2023-03-24 12:02:26] [INFO ] Computed 177 place invariants in 33 ms
[2023-03-24 12:02:26] [INFO ] [Real]Absence check using 155 positive place invariants in 30 ms returned sat
[2023-03-24 12:02:26] [INFO ] [Real]Absence check using 155 positive and 22 generalized place invariants in 33 ms returned sat
[2023-03-24 12:02:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 12:02:27] [INFO ] [Real]Absence check using state equation in 1019 ms returned sat
[2023-03-24 12:02:27] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 12:02:27] [INFO ] [Nat]Absence check using 155 positive place invariants in 31 ms returned sat
[2023-03-24 12:02:28] [INFO ] [Nat]Absence check using 155 positive and 22 generalized place invariants in 33 ms returned sat
[2023-03-24 12:02:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 12:02:29] [INFO ] [Nat]Absence check using state equation in 1118 ms returned sat
[2023-03-24 12:02:29] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 12:02:32] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-24 12:02:33] [INFO ] [Nat]Added 1 Read/Feed constraints in 4519 ms returned sat
[2023-03-24 12:02:34] [INFO ] Deduced a trap composed of 305 places in 347 ms of which 1 ms to minimize.
[2023-03-24 12:02:34] [INFO ] Deduced a trap composed of 323 places in 332 ms of which 1 ms to minimize.
[2023-03-24 12:02:34] [INFO ] Deduced a trap composed of 311 places in 366 ms of which 1 ms to minimize.
[2023-03-24 12:02:35] [INFO ] Deduced a trap composed of 335 places in 332 ms of which 1 ms to minimize.
[2023-03-24 12:02:35] [INFO ] Deduced a trap composed of 329 places in 339 ms of which 1 ms to minimize.
[2023-03-24 12:02:36] [INFO ] Deduced a trap composed of 297 places in 321 ms of which 1 ms to minimize.
[2023-03-24 12:02:36] [INFO ] Deduced a trap composed of 323 places in 339 ms of which 1 ms to minimize.
[2023-03-24 12:02:36] [INFO ] Deduced a trap composed of 308 places in 328 ms of which 1 ms to minimize.
[2023-03-24 12:02:37] [INFO ] Deduced a trap composed of 318 places in 325 ms of which 1 ms to minimize.
[2023-03-24 12:02:37] [INFO ] Deduced a trap composed of 320 places in 333 ms of which 0 ms to minimize.
[2023-03-24 12:02:38] [INFO ] Deduced a trap composed of 321 places in 333 ms of which 1 ms to minimize.
[2023-03-24 12:02:38] [INFO ] Deduced a trap composed of 329 places in 335 ms of which 0 ms to minimize.
[2023-03-24 12:02:38] [INFO ] Deduced a trap composed of 317 places in 344 ms of which 1 ms to minimize.
[2023-03-24 12:02:39] [INFO ] Deduced a trap composed of 329 places in 334 ms of which 1 ms to minimize.
[2023-03-24 12:02:39] [INFO ] Deduced a trap composed of 314 places in 322 ms of which 0 ms to minimize.
[2023-03-24 12:02:40] [INFO ] Deduced a trap composed of 338 places in 322 ms of which 1 ms to minimize.
[2023-03-24 12:02:40] [INFO ] Deduced a trap composed of 323 places in 335 ms of which 1 ms to minimize.
[2023-03-24 12:02:41] [INFO ] Deduced a trap composed of 324 places in 328 ms of which 1 ms to minimize.
[2023-03-24 12:02:41] [INFO ] Deduced a trap composed of 326 places in 331 ms of which 1 ms to minimize.
[2023-03-24 12:02:44] [INFO ] Trap strengthening (SAT) tested/added 19/19 trap constraints in 11010 ms
Current structural bounds on expressions (after SMT) : [-1] Max seen :[3]
Support contains 1 out of 1010 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1010/1010 places, 1426/1426 transitions.
Applied a total of 0 rules in 48 ms. Remains 1010 /1010 variables (removed 0) and now considering 1426/1426 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 49 ms. Remains : 1010/1010 places, 1426/1426 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1010/1010 places, 1426/1426 transitions.
Applied a total of 0 rules in 42 ms. Remains 1010 /1010 variables (removed 0) and now considering 1426/1426 (removed 0) transitions.
[2023-03-24 12:02:44] [INFO ] Flow matrix only has 1422 transitions (discarded 4 similar events)
[2023-03-24 12:02:44] [INFO ] Invariant cache hit.
[2023-03-24 12:02:47] [INFO ] Implicit Places using invariants in 2479 ms returned []
[2023-03-24 12:02:47] [INFO ] Flow matrix only has 1422 transitions (discarded 4 similar events)
[2023-03-24 12:02:47] [INFO ] Invariant cache hit.
[2023-03-24 12:02:47] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 12:03:17] [INFO ] Performed 918/1010 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2023-03-24 12:03:20] [INFO ] Implicit Places using invariants and state equation in 33394 ms returned []
Implicit Place search using SMT with State Equation took 35874 ms to find 0 implicit places.
[2023-03-24 12:03:20] [INFO ] Redundant transitions in 70 ms returned []
[2023-03-24 12:03:20] [INFO ] Flow matrix only has 1422 transitions (discarded 4 similar events)
[2023-03-24 12:03:20] [INFO ] Invariant cache hit.
[2023-03-24 12:03:22] [INFO ] Dead Transitions using invariants and state equation in 1987 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37985 ms. Remains : 1010/1010 places, 1426/1426 transitions.
Ending property specific reduction for PolyORBNT-PT-S05J80-UpperBounds-01 in 75175 ms.
Starting property specific reduction for PolyORBNT-PT-S05J80-UpperBounds-07
Normalized transition count is 1423 out of 1427 initially.
// Phase 1: matrix 1423 rows 1011 cols
[2023-03-24 12:03:22] [INFO ] Computed 177 place invariants in 27 ms
Incomplete random walk after 10000 steps, including 456 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :3
[2023-03-24 12:03:22] [INFO ] Flow matrix only has 1423 transitions (discarded 4 similar events)
// Phase 1: matrix 1423 rows 1011 cols
[2023-03-24 12:03:22] [INFO ] Computed 177 place invariants in 28 ms
[2023-03-24 12:03:23] [INFO ] [Real]Absence check using 156 positive place invariants in 29 ms returned sat
[2023-03-24 12:03:23] [INFO ] [Real]Absence check using 156 positive and 21 generalized place invariants in 32 ms returned sat
[2023-03-24 12:03:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 12:03:24] [INFO ] [Real]Absence check using state equation in 997 ms returned sat
[2023-03-24 12:03:24] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 12:03:24] [INFO ] [Nat]Absence check using 156 positive place invariants in 35 ms returned sat
[2023-03-24 12:03:24] [INFO ] [Nat]Absence check using 156 positive and 21 generalized place invariants in 38 ms returned sat
[2023-03-24 12:03:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 12:03:25] [INFO ] [Nat]Absence check using state equation in 874 ms returned sat
[2023-03-24 12:03:25] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 12:03:25] [INFO ] [Nat]Added 1 Read/Feed constraints in 744 ms returned sat
[2023-03-24 12:03:26] [INFO ] Deduced a trap composed of 201 places in 379 ms of which 1 ms to minimize.
[2023-03-24 12:03:26] [INFO ] Deduced a trap composed of 320 places in 354 ms of which 1 ms to minimize.
[2023-03-24 12:03:27] [INFO ] Deduced a trap composed of 332 places in 373 ms of which 0 ms to minimize.
[2023-03-24 12:03:27] [INFO ] Deduced a trap composed of 291 places in 346 ms of which 1 ms to minimize.
[2023-03-24 12:03:27] [INFO ] Deduced a trap composed of 332 places in 352 ms of which 1 ms to minimize.
[2023-03-24 12:03:28] [INFO ] Deduced a trap composed of 376 places in 363 ms of which 1 ms to minimize.
[2023-03-24 12:03:28] [INFO ] Deduced a trap composed of 315 places in 344 ms of which 1 ms to minimize.
[2023-03-24 12:03:29] [INFO ] Deduced a trap composed of 323 places in 347 ms of which 1 ms to minimize.
[2023-03-24 12:03:29] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
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.verifyPossible(DeadlockTester.java:916)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:733)
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)
Current structural bounds on expressions (after SMT) : [-1] Max seen :[3]
Support contains 1 out of 1011 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1011/1011 places, 1427/1427 transitions.
Applied a total of 0 rules in 70 ms. Remains 1011 /1011 variables (removed 0) and now considering 1427/1427 (removed 0) transitions.
[2023-03-24 12:03:29] [INFO ] Flow matrix only has 1423 transitions (discarded 4 similar events)
[2023-03-24 12:03:29] [INFO ] Invariant cache hit.
[2023-03-24 12:03:31] [INFO ] Dead Transitions using invariants and state equation in 1927 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1998 ms. Remains : 1011/1011 places, 1427/1427 transitions.
Normalized transition count is 1423 out of 1427 initially.
// Phase 1: matrix 1423 rows 1011 cols
[2023-03-24 12:03:31] [INFO ] Computed 177 place invariants in 29 ms
Incomplete random walk after 1000000 steps, including 47371 resets, run finished after 7959 ms. (steps per millisecond=125 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 1000001 steps, including 2636 resets, run finished after 1585 ms. (steps per millisecond=630 ) properties (out of 1) seen :3
[2023-03-24 12:03:40] [INFO ] Flow matrix only has 1423 transitions (discarded 4 similar events)
// Phase 1: matrix 1423 rows 1011 cols
[2023-03-24 12:03:40] [INFO ] Computed 177 place invariants in 32 ms
[2023-03-24 12:03:40] [INFO ] [Real]Absence check using 156 positive place invariants in 30 ms returned sat
[2023-03-24 12:03:40] [INFO ] [Real]Absence check using 156 positive and 21 generalized place invariants in 31 ms returned sat
[2023-03-24 12:03:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 12:03:41] [INFO ] [Real]Absence check using state equation in 984 ms returned sat
[2023-03-24 12:03:42] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 12:03:42] [INFO ] [Nat]Absence check using 156 positive place invariants in 34 ms returned sat
[2023-03-24 12:03:42] [INFO ] [Nat]Absence check using 156 positive and 21 generalized place invariants in 39 ms returned sat
[2023-03-24 12:03:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 12:03:43] [INFO ] [Nat]Absence check using state equation in 809 ms returned sat
[2023-03-24 12:03:43] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 12:03:43] [INFO ] [Nat]Added 1 Read/Feed constraints in 699 ms returned sat
[2023-03-24 12:03:44] [INFO ] Deduced a trap composed of 201 places in 370 ms of which 1 ms to minimize.
[2023-03-24 12:03:44] [INFO ] Deduced a trap composed of 320 places in 347 ms of which 0 ms to minimize.
[2023-03-24 12:03:44] [INFO ] Deduced a trap composed of 332 places in 372 ms of which 1 ms to minimize.
[2023-03-24 12:03:45] [INFO ] Deduced a trap composed of 291 places in 341 ms of which 1 ms to minimize.
[2023-03-24 12:03:45] [INFO ] Deduced a trap composed of 332 places in 352 ms of which 1 ms to minimize.
[2023-03-24 12:03:46] [INFO ] Deduced a trap composed of 376 places in 369 ms of which 1 ms to minimize.
[2023-03-24 12:03:46] [INFO ] Deduced a trap composed of 315 places in 348 ms of which 1 ms to minimize.
[2023-03-24 12:03:46] [INFO ] Deduced a trap composed of 323 places in 341 ms of which 1 ms to minimize.
[2023-03-24 12:03:47] [INFO ] Deduced a trap composed of 303 places in 367 ms of which 1 ms to minimize.
[2023-03-24 12:03:48] [INFO ] Deduced a trap composed of 336 places in 351 ms of which 1 ms to minimize.
[2023-03-24 12:03:48] [INFO ] Deduced a trap composed of 350 places in 338 ms of which 1 ms to minimize.
[2023-03-24 12:03:49] [INFO ] Deduced a trap composed of 314 places in 348 ms of which 1 ms to minimize.
[2023-03-24 12:03:49] [INFO ] Deduced a trap composed of 330 places in 334 ms of which 1 ms to minimize.
[2023-03-24 12:03:51] [INFO ] Deduced a trap composed of 396 places in 340 ms of which 0 ms to minimize.
[2023-03-24 12:03:51] [INFO ] Deduced a trap composed of 324 places in 361 ms of which 1 ms to minimize.
[2023-03-24 12:03:52] [INFO ] Deduced a trap composed of 329 places in 332 ms of which 1 ms to minimize.
[2023-03-24 12:03:52] [INFO ] Deduced a trap composed of 308 places in 342 ms of which 0 ms to minimize.
[2023-03-24 12:03:52] [INFO ] Deduced a trap composed of 308 places in 339 ms of which 1 ms to minimize.
[2023-03-24 12:03:53] [INFO ] Deduced a trap composed of 336 places in 349 ms of which 1 ms to minimize.
[2023-03-24 12:03:53] [INFO ] Deduced a trap composed of 312 places in 342 ms of which 1 ms to minimize.
[2023-03-24 12:03:54] [INFO ] Deduced a trap composed of 293 places in 345 ms of which 1 ms to minimize.
[2023-03-24 12:03:55] [INFO ] Deduced a trap composed of 332 places in 330 ms of which 1 ms to minimize.
[2023-03-24 12:03:55] [INFO ] Deduced a trap composed of 338 places in 336 ms of which 1 ms to minimize.
[2023-03-24 12:03:56] [INFO ] Deduced a trap composed of 332 places in 339 ms of which 1 ms to minimize.
[2023-03-24 12:03:56] [INFO ] Deduced a trap composed of 308 places in 334 ms of which 1 ms to minimize.
[2023-03-24 12:03:56] [INFO ] Deduced a trap composed of 321 places in 332 ms of which 1 ms to minimize.
[2023-03-24 12:03:57] [INFO ] Deduced a trap composed of 326 places in 337 ms of which 1 ms to minimize.
[2023-03-24 12:03:57] [INFO ] Deduced a trap composed of 326 places in 335 ms of which 1 ms to minimize.
[2023-03-24 12:03:58] [INFO ] Deduced a trap composed of 308 places in 353 ms of which 1 ms to minimize.
[2023-03-24 12:03:58] [INFO ] Deduced a trap composed of 314 places in 321 ms of which 1 ms to minimize.
[2023-03-24 12:03:59] [INFO ] Deduced a trap composed of 327 places in 340 ms of which 2 ms to minimize.
[2023-03-24 12:03:59] [INFO ] Deduced a trap composed of 305 places in 311 ms of which 1 ms to minimize.
[2023-03-24 12:04:00] [INFO ] Deduced a trap composed of 294 places in 338 ms of which 0 ms to minimize.
[2023-03-24 12:04:00] [INFO ] Deduced a trap composed of 299 places in 338 ms of which 0 ms to minimize.
[2023-03-24 12:04:01] [INFO ] Deduced a trap composed of 324 places in 336 ms of which 0 ms to minimize.
[2023-03-24 12:04:01] [INFO ] Deduced a trap composed of 335 places in 333 ms of which 1 ms to minimize.
[2023-03-24 12:04:01] [INFO ] Deduced a trap composed of 308 places in 333 ms of which 1 ms to minimize.
[2023-03-24 12:04:03] [INFO ] Deduced a trap composed of 335 places in 338 ms of which 1 ms to minimize.
[2023-03-24 12:04:04] [INFO ] Deduced a trap composed of 332 places in 330 ms of which 1 ms to minimize.
[2023-03-24 12:04:05] [INFO ] Deduced a trap composed of 330 places in 331 ms of which 1 ms to minimize.
[2023-03-24 12:04:05] [INFO ] Deduced a trap composed of 335 places in 338 ms of which 1 ms to minimize.
[2023-03-24 12:04:06] [INFO ] Deduced a trap composed of 323 places in 337 ms of which 0 ms to minimize.
[2023-03-24 12:04:06] [INFO ] Deduced a trap composed of 314 places in 321 ms of which 1 ms to minimize.
[2023-03-24 12:04:07] [INFO ] Deduced a trap composed of 314 places in 329 ms of which 0 ms to minimize.
[2023-03-24 12:04:08] [INFO ] Deduced a trap composed of 321 places in 332 ms of which 1 ms to minimize.
[2023-03-24 12:04:10] [INFO ] Deduced a trap composed of 339 places in 335 ms of which 1 ms to minimize.
[2023-03-24 12:04:12] [INFO ] Deduced a trap composed of 321 places in 330 ms of which 0 ms to minimize.
[2023-03-24 12:04:15] [INFO ] Deduced a trap composed of 314 places in 322 ms of which 1 ms to minimize.
[2023-03-24 12:04:16] [INFO ] Deduced a trap composed of 323 places in 319 ms of which 0 ms to minimize.
[2023-03-24 12:04:16] [INFO ] Deduced a trap composed of 314 places in 320 ms of which 0 ms to minimize.
[2023-03-24 12:04:16] [INFO ] Deduced a trap composed of 332 places in 320 ms of which 0 ms to minimize.
[2023-03-24 12:04:17] [INFO ] Deduced a trap composed of 317 places in 317 ms of which 1 ms to minimize.
[2023-03-24 12:04:19] [INFO ] Deduced a trap composed of 317 places in 319 ms of which 1 ms to minimize.
[2023-03-24 12:04:20] [INFO ] Deduced a trap composed of 341 places in 330 ms of which 1 ms to minimize.
[2023-03-24 12:04:21] [INFO ] Deduced a trap composed of 338 places in 323 ms of which 3 ms to minimize.
[2023-03-24 12:04:21] [INFO ] Deduced a trap composed of 311 places in 326 ms of which 1 ms to minimize.
[2023-03-24 12:04:22] [INFO ] Deduced a trap composed of 320 places in 328 ms of which 1 ms to minimize.
[2023-03-24 12:04:22] [INFO ] Deduced a trap composed of 311 places in 330 ms of which 1 ms to minimize.
[2023-03-24 12:04:23] [INFO ] Deduced a trap composed of 323 places in 338 ms of which 1 ms to minimize.
[2023-03-24 12:04:23] [INFO ] Deduced a trap composed of 342 places in 323 ms of which 0 ms to minimize.
[2023-03-24 12:04:26] [INFO ] Deduced a trap composed of 332 places in 314 ms of which 0 ms to minimize.
[2023-03-24 12:04:26] [INFO ] Deduced a trap composed of 321 places in 322 ms of which 1 ms to minimize.
[2023-03-24 12:04:27] [INFO ] Trap strengthening (SAT) tested/added 62/62 trap constraints in 43328 ms
Current structural bounds on expressions (after SMT) : [-1] Max seen :[3]
Support contains 1 out of 1011 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1011/1011 places, 1427/1427 transitions.
Applied a total of 0 rules in 42 ms. Remains 1011 /1011 variables (removed 0) and now considering 1427/1427 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42 ms. Remains : 1011/1011 places, 1427/1427 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1011/1011 places, 1427/1427 transitions.
Applied a total of 0 rules in 42 ms. Remains 1011 /1011 variables (removed 0) and now considering 1427/1427 (removed 0) transitions.
[2023-03-24 12:04:27] [INFO ] Flow matrix only has 1423 transitions (discarded 4 similar events)
[2023-03-24 12:04:27] [INFO ] Invariant cache hit.
[2023-03-24 12:04:29] [INFO ] Implicit Places using invariants in 2328 ms returned []
[2023-03-24 12:04:29] [INFO ] Flow matrix only has 1423 transitions (discarded 4 similar events)
[2023-03-24 12:04:29] [INFO ] Invariant cache hit.
[2023-03-24 12:04:30] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 12:05:00] [INFO ] Performed 659/1011 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2023-03-24 12:05:16] [INFO ] Implicit Places using invariants and state equation in 47266 ms returned []
Implicit Place search using SMT with State Equation took 49598 ms to find 0 implicit places.
[2023-03-24 12:05:16] [INFO ] Redundant transitions in 26 ms returned []
[2023-03-24 12:05:16] [INFO ] Flow matrix only has 1423 transitions (discarded 4 similar events)
[2023-03-24 12:05:16] [INFO ] Invariant cache hit.
[2023-03-24 12:05:18] [INFO ] Dead Transitions using invariants and state equation in 1914 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51599 ms. Remains : 1011/1011 places, 1427/1427 transitions.
Ending property specific reduction for PolyORBNT-PT-S05J80-UpperBounds-07 in 115982 ms.
Starting property specific reduction for PolyORBNT-PT-S05J80-UpperBounds-09
Normalized transition count is 1423 out of 1427 initially.
// Phase 1: matrix 1423 rows 1011 cols
[2023-03-24 12:05:18] [INFO ] Computed 177 place invariants in 25 ms
Incomplete random walk after 10000 steps, including 483 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :3
[2023-03-24 12:05:18] [INFO ] Flow matrix only has 1423 transitions (discarded 4 similar events)
// Phase 1: matrix 1423 rows 1011 cols
[2023-03-24 12:05:18] [INFO ] Computed 177 place invariants in 34 ms
[2023-03-24 12:05:19] [INFO ] [Real]Absence check using 156 positive place invariants in 35 ms returned sat
[2023-03-24 12:05:19] [INFO ] [Real]Absence check using 156 positive and 21 generalized place invariants in 33 ms returned sat
[2023-03-24 12:05:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 12:05:20] [INFO ] [Real]Absence check using state equation in 997 ms returned sat
[2023-03-24 12:05:20] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 12:05:20] [INFO ] [Nat]Absence check using 156 positive place invariants in 33 ms returned sat
[2023-03-24 12:05:20] [INFO ] [Nat]Absence check using 156 positive and 21 generalized place invariants in 37 ms returned sat
[2023-03-24 12:05:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 12:05:21] [INFO ] [Nat]Absence check using state equation in 830 ms returned sat
[2023-03-24 12:05:21] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 12:05:21] [INFO ] [Nat]Added 1 Read/Feed constraints in 700 ms returned sat
[2023-03-24 12:05:22] [INFO ] Deduced a trap composed of 201 places in 382 ms of which 1 ms to minimize.
[2023-03-24 12:05:22] [INFO ] Deduced a trap composed of 320 places in 341 ms of which 1 ms to minimize.
[2023-03-24 12:05:23] [INFO ] Deduced a trap composed of 332 places in 367 ms of which 1 ms to minimize.
[2023-03-24 12:05:23] [INFO ] Deduced a trap composed of 291 places in 344 ms of which 1 ms to minimize.
[2023-03-24 12:05:23] [INFO ] Deduced a trap composed of 332 places in 352 ms of which 1 ms to minimize.
[2023-03-24 12:05:24] [INFO ] Deduced a trap composed of 376 places in 364 ms of which 1 ms to minimize.
[2023-03-24 12:05:24] [INFO ] Deduced a trap composed of 315 places in 339 ms of which 1 ms to minimize.
[2023-03-24 12:05:25] [INFO ] Deduced a trap composed of 323 places in 348 ms of which 1 ms to minimize.
[2023-03-24 12:05:25] [INFO ] Deduced a trap composed of 303 places in 361 ms of which 1 ms to minimize.
[2023-03-24 12:05:25] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
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.verifyPossible(DeadlockTester.java:916)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:733)
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)
Current structural bounds on expressions (after SMT) : [-1] Max seen :[3]
Support contains 1 out of 1011 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1011/1011 places, 1427/1427 transitions.
Applied a total of 0 rules in 44 ms. Remains 1011 /1011 variables (removed 0) and now considering 1427/1427 (removed 0) transitions.
[2023-03-24 12:05:25] [INFO ] Flow matrix only has 1423 transitions (discarded 4 similar events)
[2023-03-24 12:05:25] [INFO ] Invariant cache hit.
[2023-03-24 12:05:27] [INFO ] Dead Transitions using invariants and state equation in 1857 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1901 ms. Remains : 1011/1011 places, 1427/1427 transitions.
Normalized transition count is 1423 out of 1427 initially.
// Phase 1: matrix 1423 rows 1011 cols
[2023-03-24 12:05:27] [INFO ] Computed 177 place invariants in 24 ms
Incomplete random walk after 1000000 steps, including 47351 resets, run finished after 7989 ms. (steps per millisecond=125 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 1000001 steps, including 2703 resets, run finished after 1596 ms. (steps per millisecond=626 ) properties (out of 1) seen :3
[2023-03-24 12:05:36] [INFO ] Flow matrix only has 1423 transitions (discarded 4 similar events)
// Phase 1: matrix 1423 rows 1011 cols
[2023-03-24 12:05:36] [INFO ] Computed 177 place invariants in 30 ms
[2023-03-24 12:05:37] [INFO ] [Real]Absence check using 156 positive place invariants in 31 ms returned sat
[2023-03-24 12:05:37] [INFO ] [Real]Absence check using 156 positive and 21 generalized place invariants in 35 ms returned sat
[2023-03-24 12:05:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 12:05:38] [INFO ] [Real]Absence check using state equation in 1007 ms returned sat
[2023-03-24 12:05:38] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 12:05:38] [INFO ] [Nat]Absence check using 156 positive place invariants in 33 ms returned sat
[2023-03-24 12:05:38] [INFO ] [Nat]Absence check using 156 positive and 21 generalized place invariants in 37 ms returned sat
[2023-03-24 12:05:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 12:05:39] [INFO ] [Nat]Absence check using state equation in 832 ms returned sat
[2023-03-24 12:05:39] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 12:05:39] [INFO ] [Nat]Added 1 Read/Feed constraints in 718 ms returned sat
[2023-03-24 12:05:40] [INFO ] Deduced a trap composed of 201 places in 368 ms of which 1 ms to minimize.
[2023-03-24 12:05:40] [INFO ] Deduced a trap composed of 320 places in 354 ms of which 1 ms to minimize.
[2023-03-24 12:05:41] [INFO ] Deduced a trap composed of 332 places in 388 ms of which 0 ms to minimize.
[2023-03-24 12:05:41] [INFO ] Deduced a trap composed of 291 places in 346 ms of which 1 ms to minimize.
[2023-03-24 12:05:41] [INFO ] Deduced a trap composed of 332 places in 357 ms of which 0 ms to minimize.
[2023-03-24 12:05:42] [INFO ] Deduced a trap composed of 376 places in 352 ms of which 1 ms to minimize.
[2023-03-24 12:05:42] [INFO ] Deduced a trap composed of 315 places in 352 ms of which 0 ms to minimize.
[2023-03-24 12:05:43] [INFO ] Deduced a trap composed of 323 places in 341 ms of which 0 ms to minimize.
[2023-03-24 12:05:43] [INFO ] Deduced a trap composed of 303 places in 358 ms of which 1 ms to minimize.
[2023-03-24 12:05:44] [INFO ] Deduced a trap composed of 336 places in 336 ms of which 1 ms to minimize.
[2023-03-24 12:05:44] [INFO ] Deduced a trap composed of 350 places in 332 ms of which 1 ms to minimize.
[2023-03-24 12:05:45] [INFO ] Deduced a trap composed of 314 places in 348 ms of which 1 ms to minimize.
[2023-03-24 12:05:45] [INFO ] Deduced a trap composed of 330 places in 338 ms of which 1 ms to minimize.
[2023-03-24 12:05:47] [INFO ] Deduced a trap composed of 396 places in 337 ms of which 1 ms to minimize.
[2023-03-24 12:05:47] [INFO ] Deduced a trap composed of 324 places in 334 ms of which 1 ms to minimize.
[2023-03-24 12:05:48] [INFO ] Deduced a trap composed of 329 places in 342 ms of which 1 ms to minimize.
[2023-03-24 12:05:48] [INFO ] Deduced a trap composed of 308 places in 336 ms of which 1 ms to minimize.
[2023-03-24 12:05:49] [INFO ] Deduced a trap composed of 308 places in 346 ms of which 0 ms to minimize.
[2023-03-24 12:05:49] [INFO ] Deduced a trap composed of 336 places in 343 ms of which 0 ms to minimize.
[2023-03-24 12:05:49] [INFO ] Deduced a trap composed of 312 places in 333 ms of which 1 ms to minimize.
[2023-03-24 12:05:50] [INFO ] Deduced a trap composed of 293 places in 344 ms of which 1 ms to minimize.
[2023-03-24 12:05:51] [INFO ] Deduced a trap composed of 332 places in 346 ms of which 1 ms to minimize.
[2023-03-24 12:05:51] [INFO ] Deduced a trap composed of 338 places in 327 ms of which 1 ms to minimize.
[2023-03-24 12:05:52] [INFO ] Deduced a trap composed of 332 places in 331 ms of which 1 ms to minimize.
[2023-03-24 12:05:52] [INFO ] Deduced a trap composed of 308 places in 339 ms of which 1 ms to minimize.
[2023-03-24 12:05:53] [INFO ] Deduced a trap composed of 321 places in 333 ms of which 1 ms to minimize.
[2023-03-24 12:05:53] [INFO ] Deduced a trap composed of 326 places in 333 ms of which 1 ms to minimize.
[2023-03-24 12:05:53] [INFO ] Deduced a trap composed of 326 places in 338 ms of which 1 ms to minimize.
[2023-03-24 12:05:54] [INFO ] Deduced a trap composed of 308 places in 338 ms of which 1 ms to minimize.
[2023-03-24 12:05:54] [INFO ] Deduced a trap composed of 314 places in 329 ms of which 1 ms to minimize.
[2023-03-24 12:05:55] [INFO ] Deduced a trap composed of 327 places in 337 ms of which 0 ms to minimize.
[2023-03-24 12:05:56] [INFO ] Deduced a trap composed of 305 places in 329 ms of which 1 ms to minimize.
[2023-03-24 12:05:56] [INFO ] Deduced a trap composed of 294 places in 353 ms of which 1 ms to minimize.
[2023-03-24 12:05:56] [INFO ] Deduced a trap composed of 299 places in 344 ms of which 1 ms to minimize.
[2023-03-24 12:05:57] [INFO ] Deduced a trap composed of 324 places in 340 ms of which 1 ms to minimize.
[2023-03-24 12:05:57] [INFO ] Deduced a trap composed of 335 places in 347 ms of which 1 ms to minimize.
[2023-03-24 12:05:58] [INFO ] Deduced a trap composed of 308 places in 337 ms of which 1 ms to minimize.
[2023-03-24 12:05:59] [INFO ] Deduced a trap composed of 335 places in 333 ms of which 1 ms to minimize.
[2023-03-24 12:06:00] [INFO ] Deduced a trap composed of 332 places in 341 ms of which 0 ms to minimize.
[2023-03-24 12:06:01] [INFO ] Deduced a trap composed of 330 places in 342 ms of which 1 ms to minimize.
[2023-03-24 12:06:01] [INFO ] Deduced a trap composed of 335 places in 338 ms of which 1 ms to minimize.
[2023-03-24 12:06:02] [INFO ] Deduced a trap composed of 323 places in 336 ms of which 1 ms to minimize.
[2023-03-24 12:06:02] [INFO ] Deduced a trap composed of 314 places in 326 ms of which 1 ms to minimize.
[2023-03-24 12:06:03] [INFO ] Deduced a trap composed of 314 places in 337 ms of which 1 ms to minimize.
[2023-03-24 12:06:04] [INFO ] Deduced a trap composed of 321 places in 350 ms of which 1 ms to minimize.
[2023-03-24 12:06:06] [INFO ] Deduced a trap composed of 339 places in 338 ms of which 1 ms to minimize.
[2023-03-24 12:06:09] [INFO ] Deduced a trap composed of 321 places in 345 ms of which 1 ms to minimize.
[2023-03-24 12:06:12] [INFO ] Deduced a trap composed of 314 places in 340 ms of which 1 ms to minimize.
[2023-03-24 12:06:12] [INFO ] Deduced a trap composed of 323 places in 323 ms of which 1 ms to minimize.
[2023-03-24 12:06:13] [INFO ] Deduced a trap composed of 314 places in 324 ms of which 0 ms to minimize.
[2023-03-24 12:06:13] [INFO ] Deduced a trap composed of 332 places in 327 ms of which 1 ms to minimize.
[2023-03-24 12:06:14] [INFO ] Deduced a trap composed of 317 places in 336 ms of which 1 ms to minimize.
[2023-03-24 12:06:16] [INFO ] Deduced a trap composed of 317 places in 338 ms of which 1 ms to minimize.
[2023-03-24 12:06:17] [INFO ] Deduced a trap composed of 341 places in 332 ms of which 1 ms to minimize.
[2023-03-24 12:06:17] [INFO ] Deduced a trap composed of 338 places in 320 ms of which 0 ms to minimize.
[2023-03-24 12:06:18] [INFO ] Deduced a trap composed of 311 places in 329 ms of which 0 ms to minimize.
[2023-03-24 12:06:18] [INFO ] Deduced a trap composed of 320 places in 324 ms of which 1 ms to minimize.
[2023-03-24 12:06:19] [INFO ] Deduced a trap composed of 311 places in 327 ms of which 1 ms to minimize.
[2023-03-24 12:06:19] [INFO ] Deduced a trap composed of 323 places in 329 ms of which 1 ms to minimize.
[2023-03-24 12:06:20] [INFO ] Deduced a trap composed of 342 places in 333 ms of which 1 ms to minimize.
[2023-03-24 12:06:23] [INFO ] Deduced a trap composed of 332 places in 308 ms of which 1 ms to minimize.
[2023-03-24 12:06:23] [INFO ] Deduced a trap composed of 321 places in 306 ms of which 1 ms to minimize.
[2023-03-24 12:06:23] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
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.verifyPossible(DeadlockTester.java:916)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:733)
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)
Current structural bounds on expressions (after SMT) : [-1] Max seen :[3]
Support contains 1 out of 1011 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1011/1011 places, 1427/1427 transitions.
Applied a total of 0 rules in 52 ms. Remains 1011 /1011 variables (removed 0) and now considering 1427/1427 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52 ms. Remains : 1011/1011 places, 1427/1427 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1011/1011 places, 1427/1427 transitions.
Applied a total of 0 rules in 41 ms. Remains 1011 /1011 variables (removed 0) and now considering 1427/1427 (removed 0) transitions.
[2023-03-24 12:06:23] [INFO ] Flow matrix only has 1423 transitions (discarded 4 similar events)
[2023-03-24 12:06:23] [INFO ] Invariant cache hit.
[2023-03-24 12:06:25] [INFO ] Implicit Places using invariants in 2297 ms returned []
[2023-03-24 12:06:25] [INFO ] Flow matrix only has 1423 transitions (discarded 4 similar events)
[2023-03-24 12:06:25] [INFO ] Invariant cache hit.
[2023-03-24 12:06:26] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 12:06:53] [INFO ] Implicit Places using invariants and state equation in 27897 ms returned []
Implicit Place search using SMT with State Equation took 30199 ms to find 0 implicit places.
[2023-03-24 12:06:53] [INFO ] Redundant transitions in 27 ms returned []
[2023-03-24 12:06:53] [INFO ] Flow matrix only has 1423 transitions (discarded 4 similar events)
[2023-03-24 12:06:53] [INFO ] Invariant cache hit.
[2023-03-24 12:06:55] [INFO ] Dead Transitions using invariants and state equation in 1850 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32134 ms. Remains : 1011/1011 places, 1427/1427 transitions.
Ending property specific reduction for PolyORBNT-PT-S05J80-UpperBounds-09 in 96896 ms.
[2023-03-24 12:06:55] [INFO ] Flatten gal took : 167 ms
[2023-03-24 12:06:55] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/UpperBounds.sr.xml took 2 ms.
[2023-03-24 12:06:55] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1011 places, 1427 transitions and 7211 arcs took 9 ms.
Total runtime 480439 ms.
There are residual formulas that ITS could not solve within timeout
timeout --kill-after=10s --signal=SIGINT 1m for testing only

Marcie built on Linux at 2019-11-18.
A model checker for Generalized Stochastic Petri nets

authors: Alex Tovchigrechko (IDD package and CTL model checking)

Martin Schwarick (Symbolic numerical analysis and CSL model checking)

Christian Rohr (Simulative and approximative numerical model checking)

marcie@informatik.tu-cottbus.de

called as: /home/mcc/BenchKit/bin//../reducer/bin//../../marcie/bin/marcie --net-file=model.pnml --mcc-file=UpperBounds.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: PolyORBNT_PT_S05J80
(NrP: 1011 NrTr: 1427 NrArc: 7211)

parse formulas
formulas created successfully
place and transition orderings generation:0m 0.155sec

net check time: 0m 0.000sec

init dd package: 0m 2.756sec

TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393232 kB
MemFree: 9600140 kB
After kill :
MemTotal: 16393232 kB
MemFree: 16092604 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:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok

initing FirstDep: 0m 0.014sec

3387380

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool marciexred"
echo " Input is PolyORBNT-PT-S05J80, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r298-tall-167873952100749"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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