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

About the Execution of ITS-Tools for PolyORBLF-PT-S04J06T08

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
16224.584 3600000.00 8702080.00 349549.00 FFFTFFTFTFFFF?FF 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.r293-tall-167873945600574.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 itstools
Input is PolyORBLF-PT-S04J06T08, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r293-tall-167873945600574
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 5.0M
-rw-r--r-- 1 mcc users 20K Feb 26 14:13 CTLCardinality.txt
-rw-r--r-- 1 mcc users 115K Feb 26 14:13 CTLCardinality.xml
-rw-r--r-- 1 mcc users 74K Feb 26 14:10 CTLFireability.txt
-rw-r--r-- 1 mcc users 338K Feb 26 14:10 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 11K Feb 25 16:35 LTLCardinality.txt
-rw-r--r-- 1 mcc users 44K Feb 25 16:35 LTLCardinality.xml
-rw-r--r-- 1 mcc users 26K Feb 25 16:35 LTLFireability.txt
-rw-r--r-- 1 mcc users 92K Feb 25 16:35 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 26 14:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 67K Feb 26 14:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 133K Feb 26 14:20 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 583K Feb 26 14:20 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 16:35 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.3K Feb 25 16:35 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 10 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 3.5M Mar 5 18:23 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1678902288534

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=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-PT-S04J06T08
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202303021504
[2023-03-15 17:44:50] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-15 17:44:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-15 17:44:51] [INFO ] Load time of PNML (sax parser for PT used): 381 ms
[2023-03-15 17:44:51] [INFO ] Transformed 792 places.
[2023-03-15 17:44:51] [INFO ] Transformed 4268 transitions.
[2023-03-15 17:44:51] [INFO ] Parsed PT model containing 792 places and 4268 transitions and 28832 arcs in 635 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 2168 transitions
Reduce redundant transitions removed 2168 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 922 ms. (steps per millisecond=10 ) properties (out of 16) seen :4
FORMULA PolyORBLF-PT-S04J06T08-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-PT-S04J06T08-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-PT-S04J06T08-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-PT-S04J06T08-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 184 ms. (steps per millisecond=54 ) properties (out of 12) seen :0
[2023-03-15 17:44:53] [INFO ] Flatten gal took : 947 ms
[2023-03-15 17:44:53] [INFO ] Flatten gal took : 179 ms
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 403 ms. (steps per millisecond=24 ) properties (out of 12) seen :0
[2023-03-15 17:44:53] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6101827073096640122.gal : 124 ms
[2023-03-15 17:44:53] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13840804668668738961.prop : 19 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality6101827073096640122.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13840804668668738961.prop' '--nowitness' '--gen-order' 'FOLLOW'
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 300 ms. (steps per millisecond=33 ) properties (out of 12) seen :0

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 243 ms. (steps per millisecond=41 ) properties (out of 12) seen :0
Loading property file /tmp/ReachabilityCardinality13840804668668738961.prop.
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 350 ms. (steps per millisecond=28 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 281 ms. (steps per millisecond=35 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 245 ms. (steps per millisecond=40 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 257 ms. (steps per millisecond=38 ) properties (out of 12) seen :0
SDD proceeding with computation,12 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,12 properties remain. new max is 8
SDD size :3 after 6
SDD proceeding with computation,12 properties remain. new max is 16
SDD size :6 after 7
SDD proceeding with computation,12 properties remain. new max is 32
SDD size :7 after 12
SDD proceeding with computation,12 properties remain. new max is 64
SDD size :12 after 13
SDD proceeding with computation,12 properties remain. new max is 128
SDD size :13 after 14
SDD proceeding with computation,12 properties remain. new max is 256
SDD size :14 after 24
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 269 ms. (steps per millisecond=37 ) properties (out of 12) seen :0
SDD proceeding with computation,12 properties remain. new max is 512
SDD size :24 after 27
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 188 ms. (steps per millisecond=53 ) properties (out of 12) seen :0
SDD proceeding with computation,12 properties remain. new max is 1024
SDD size :27 after 31
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 212 ms. (steps per millisecond=47 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 190 ms. (steps per millisecond=52 ) properties (out of 12) seen :0
Running SMT prover for 12 properties.
[2023-03-15 17:44:56] [INFO ] Flow matrix only has 2068 transitions (discarded 32 similar events)
// Phase 1: matrix 2068 rows 792 cols
[2023-03-15 17:44:56] [INFO ] Computed 58 place invariants in 128 ms
[2023-03-15 17:44:57] [INFO ] [Real]Absence check using 16 positive place invariants in 23 ms returned sat
[2023-03-15 17:44:57] [INFO ] [Real]Absence check using 16 positive and 42 generalized place invariants in 100 ms returned sat
[2023-03-15 17:44:57] [INFO ] After 920ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:11
[2023-03-15 17:44:58] [INFO ] [Nat]Absence check using 16 positive place invariants in 17 ms returned sat
[2023-03-15 17:44:58] [INFO ] [Nat]Absence check using 16 positive and 42 generalized place invariants in 67 ms returned sat
SDD proceeding with computation,12 properties remain. new max is 2048
SDD size :31 after 185040
[2023-03-15 17:45:05] [INFO ] After 6948ms SMT Verify possible using state equation in natural domain returned unsat :11 sat :1
[2023-03-15 17:45:05] [INFO ] State equation strengthened by 160 read => feed constraints.
SDD proceeding with computation,12 properties remain. new max is 4096
SDD size :185040 after 205664
[2023-03-15 17:45:11] [INFO ] After 5844ms SMT Verify possible using 160 Read/Feed constraints in natural domain returned unsat :11 sat :1
[2023-03-15 17:45:11] [INFO ] Deduced a trap composed of 83 places in 204 ms of which 5 ms to minimize.
[2023-03-15 17:45:12] [INFO ] Deduced a trap composed of 83 places in 76 ms of which 1 ms to minimize.
[2023-03-15 17:45:12] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1581 ms
[2023-03-15 17:45:12] [INFO ] After 7481ms SMT Verify possible using trap constraints in natural domain returned unsat :11 sat :1
Attempting to minimize the solution found.
Minimization took 67 ms.
[2023-03-15 17:45:12] [INFO ] After 15080ms SMT Verify possible using all constraints in natural domain returned unsat :11 sat :1
FORMULA PolyORBLF-PT-S04J06T08-ReachabilityCardinality-15 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA PolyORBLF-PT-S04J06T08-ReachabilityCardinality-14 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA PolyORBLF-PT-S04J06T08-ReachabilityCardinality-12 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA PolyORBLF-PT-S04J06T08-ReachabilityCardinality-10 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA PolyORBLF-PT-S04J06T08-ReachabilityCardinality-09 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA PolyORBLF-PT-S04J06T08-ReachabilityCardinality-07 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA PolyORBLF-PT-S04J06T08-ReachabilityCardinality-05 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA PolyORBLF-PT-S04J06T08-ReachabilityCardinality-04 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA PolyORBLF-PT-S04J06T08-ReachabilityCardinality-03 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA PolyORBLF-PT-S04J06T08-ReachabilityCardinality-01 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA PolyORBLF-PT-S04J06T08-ReachabilityCardinality-00 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 12 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 3 ms.
Support contains 1 out of 792 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 792/792 places, 2100/2100 transitions.
Ensure Unique test removed 4 places
Drop transitions removed 71 transitions
Trivial Post-agglo rules discarded 71 transitions
Performed 71 trivial Post agglomeration. Transition count delta: 71
Iterating post reduction 0 with 75 rules applied. Total rules applied 75 place count 788 transition count 2029
Reduce places removed 71 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 72 rules applied. Total rules applied 147 place count 717 transition count 2028
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 148 place count 716 transition count 2028
Performed 95 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 95 Pre rules applied. Total rules applied 148 place count 716 transition count 1933
Deduced a syphon composed of 95 places in 3 ms
Reduce places removed 95 places and 0 transitions.
Iterating global reduction 3 with 190 rules applied. Total rules applied 338 place count 621 transition count 1933
Performed 80 Post agglomeration using F-continuation condition.Transition count delta: 80
Deduced a syphon composed of 80 places in 3 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 3 with 160 rules applied. Total rules applied 498 place count 541 transition count 1853
Free-agglomeration rule (complex) applied 16 times.
Iterating global reduction 3 with 16 rules applied. Total rules applied 514 place count 541 transition count 1837
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 3 with 16 rules applied. Total rules applied 530 place count 525 transition count 1837
Applied a total of 530 rules in 343 ms. Remains 525 /792 variables (removed 267) and now considering 1837/2100 (removed 263) transitions.
[2023-03-15 17:45:13] [INFO ] Flow matrix only has 1805 transitions (discarded 32 similar events)
// Phase 1: matrix 1805 rows 525 cols
[2023-03-15 17:45:13] [INFO ] Computed 54 place invariants in 40 ms
[2023-03-15 17:45:14] [INFO ] Dead Transitions using invariants and state equation in 1329 ms found 432 transitions.
Found 432 dead transitions using SMT.
Drop transitions removed 432 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 432 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 525/792 places, 1405/2100 transitions.
Applied a total of 0 rules in 37 ms. Remains 525 /525 variables (removed 0) and now considering 1405/1405 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1711 ms. Remains : 525/792 places, 1405/2100 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
SDD proceeding with computation,12 properties remain. new max is 8192
SDD size :205664 after 1.51122e+06
Interrupted probabilistic random walk after 163004 steps, run timeout after 3001 ms. (steps per millisecond=54 ) properties seen :{}
Probabilistic random walk after 163004 steps, saw 121610 distinct states, run finished after 3003 ms. (steps per millisecond=54 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 17:45:17] [INFO ] Flow matrix only has 1373 transitions (discarded 32 similar events)
// Phase 1: matrix 1373 rows 525 cols
[2023-03-15 17:45:17] [INFO ] Computed 54 place invariants in 33 ms
[2023-03-15 17:45:17] [INFO ] [Real]Absence check using 16 positive place invariants in 12 ms returned sat
[2023-03-15 17:45:17] [INFO ] [Real]Absence check using 16 positive and 38 generalized place invariants in 30 ms returned sat
SDD proceeding with computation,12 properties remain. new max is 16384
SDD size :1.51122e+06 after 1.5978e+06
SDD proceeding with computation,12 properties remain. new max is 32768
SDD size :1.5978e+06 after 1.6261e+06
SDD proceeding with computation,12 properties remain. new max is 65536
SDD size :1.6261e+06 after 1.65708e+06
[2023-03-15 17:45:42] [INFO ] After 25018ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 525 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 525/525 places, 1405/1405 transitions.
Applied a total of 0 rules in 33 ms. Remains 525 /525 variables (removed 0) and now considering 1405/1405 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 525/525 places, 1405/1405 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 525/525 places, 1405/1405 transitions.
Applied a total of 0 rules in 29 ms. Remains 525 /525 variables (removed 0) and now considering 1405/1405 (removed 0) transitions.
[2023-03-15 17:45:42] [INFO ] Flow matrix only has 1373 transitions (discarded 32 similar events)
[2023-03-15 17:45:42] [INFO ] Invariant cache hit.
[2023-03-15 17:45:43] [INFO ] Implicit Places using invariants in 665 ms returned [2, 89, 99, 145, 196, 232, 257, 386]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 671 ms to find 8 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 517/525 places, 1405/1405 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 511 transition count 1399
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 511 transition count 1399
Applied a total of 12 rules in 44 ms. Remains 511 /517 variables (removed 6) and now considering 1399/1405 (removed 6) transitions.
[2023-03-15 17:45:43] [INFO ] Flow matrix only has 1367 transitions (discarded 32 similar events)
// Phase 1: matrix 1367 rows 511 cols
[2023-03-15 17:45:43] [INFO ] Computed 46 place invariants in 23 ms
[2023-03-15 17:45:44] [INFO ] Implicit Places using invariants in 615 ms returned []
[2023-03-15 17:45:44] [INFO ] Flow matrix only has 1367 transitions (discarded 32 similar events)
[2023-03-15 17:45:44] [INFO ] Invariant cache hit.
[2023-03-15 17:45:45] [INFO ] State equation strengthened by 160 read => feed constraints.
SDD proceeding with computation,12 properties remain. new max is 131072
SDD size :1.65708e+06 after 4.74987e+06
[2023-03-15 17:46:15] [INFO ] Performed 438/511 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2023-03-15 17:46:18] [INFO ] Implicit Places using invariants and state equation in 34775 ms returned []
Implicit Place search using SMT with State Equation took 35392 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 511/525 places, 1399/1405 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 36138 ms. Remains : 511/525 places, 1399/1405 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 169914 steps, run timeout after 3001 ms. (steps per millisecond=56 ) properties seen :{}
Probabilistic random walk after 169914 steps, saw 119328 distinct states, run finished after 3001 ms. (steps per millisecond=56 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 17:46:21] [INFO ] Flow matrix only has 1367 transitions (discarded 32 similar events)
[2023-03-15 17:46:22] [INFO ] Invariant cache hit.
[2023-03-15 17:46:22] [INFO ] [Real]Absence check using 16 positive place invariants in 4 ms returned sat
[2023-03-15 17:46:22] [INFO ] [Real]Absence check using 16 positive and 30 generalized place invariants in 29 ms returned sat
[2023-03-15 17:46:22] [INFO ] After 118ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 17:46:22] [INFO ] [Nat]Absence check using 16 positive place invariants in 19 ms returned sat
[2023-03-15 17:46:22] [INFO ] [Nat]Absence check using 16 positive and 30 generalized place invariants in 30 ms returned sat
[2023-03-15 17:46:47] [INFO ] After 25015ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 511 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 511/511 places, 1399/1399 transitions.
Applied a total of 0 rules in 34 ms. Remains 511 /511 variables (removed 0) and now considering 1399/1399 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 511/511 places, 1399/1399 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 511/511 places, 1399/1399 transitions.
Applied a total of 0 rules in 32 ms. Remains 511 /511 variables (removed 0) and now considering 1399/1399 (removed 0) transitions.
[2023-03-15 17:46:47] [INFO ] Flow matrix only has 1367 transitions (discarded 32 similar events)
[2023-03-15 17:46:47] [INFO ] Invariant cache hit.
[2023-03-15 17:46:47] [INFO ] Implicit Places using invariants in 583 ms returned []
[2023-03-15 17:46:47] [INFO ] Flow matrix only has 1367 transitions (discarded 32 similar events)
[2023-03-15 17:46:47] [INFO ] Invariant cache hit.
[2023-03-15 17:46:48] [INFO ] State equation strengthened by 160 read => feed constraints.
SDD proceeding with computation,12 properties remain. new max is 262144
SDD size :4.74987e+06 after 8.82937e+06
[2023-03-15 17:47:17] [INFO ] Implicit Places using invariants and state equation in 29989 ms returned []
Implicit Place search using SMT with State Equation took 30575 ms to find 0 implicit places.
[2023-03-15 17:47:17] [INFO ] Redundant transitions in 90 ms returned []
[2023-03-15 17:47:17] [INFO ] Flow matrix only has 1367 transitions (discarded 32 similar events)
[2023-03-15 17:47:17] [INFO ] Invariant cache hit.
[2023-03-15 17:47:18] [INFO ] Dead Transitions using invariants and state equation in 996 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31712 ms. Remains : 511/511 places, 1399/1399 transitions.
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 511 transition count 1367
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -80
Deduced a syphon composed of 8 places in 2 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 1 with 16 rules applied. Total rules applied 48 place count 503 transition count 1447
Drop transitions removed 64 transitions
Redundant transition composition rules discarded 64 transitions
Iterating global reduction 1 with 64 rules applied. Total rules applied 112 place count 503 transition count 1383
Free-agglomeration rule applied 8 times.
Iterating global reduction 1 with 8 rules applied. Total rules applied 120 place count 503 transition count 1375
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 128 place count 495 transition count 1375
Free-agglomeration rule (complex) applied 12 times.
Iterating global reduction 2 with 12 rules applied. Total rules applied 140 place count 495 transition count 1363
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 152 place count 483 transition count 1363
Applied a total of 152 rules in 122 ms. Remains 483 /511 variables (removed 28) and now considering 1363/1399 (removed 36) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 1363 rows 483 cols
[2023-03-15 17:47:19] [INFO ] Computed 46 place invariants in 21 ms
[2023-03-15 17:47:19] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-15 17:47:19] [INFO ] [Real]Absence check using 16 positive and 30 generalized place invariants in 29 ms returned sat
[2023-03-15 17:47:26] [INFO ] After 7340ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 17:47:26] [INFO ] [Nat]Absence check using 16 positive place invariants in 4 ms returned sat
[2023-03-15 17:47:26] [INFO ] [Nat]Absence check using 16 positive and 30 generalized place invariants in 28 ms returned sat
[2023-03-15 17:47:31] [INFO ] After 5259ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 17:47:31] [INFO ] Deduced a trap composed of 47 places in 73 ms of which 9 ms to minimize.
[2023-03-15 17:47:33] [INFO ] Deduced a trap composed of 48 places in 79 ms of which 1 ms to minimize.
[2023-03-15 17:47:34] [INFO ] Deduced a trap composed of 98 places in 259 ms of which 1 ms to minimize.
[2023-03-15 17:47:34] [INFO ] Deduced a trap composed of 85 places in 236 ms of which 1 ms to minimize.
[2023-03-15 17:47:34] [INFO ] Deduced a trap composed of 83 places in 226 ms of which 1 ms to minimize.
[2023-03-15 17:47:35] [INFO ] Deduced a trap composed of 91 places in 234 ms of which 1 ms to minimize.
[2023-03-15 17:47:35] [INFO ] Deduced a trap composed of 69 places in 253 ms of which 1 ms to minimize.
[2023-03-15 17:47:36] [INFO ] Deduced a trap composed of 85 places in 223 ms of which 0 ms to minimize.
[2023-03-15 17:47:38] [INFO ] Deduced a trap composed of 47 places in 62 ms of which 0 ms to minimize.
[2023-03-15 17:47:39] [INFO ] Deduced a trap composed of 47 places in 53 ms of which 0 ms to minimize.
[2023-03-15 17:47:39] [INFO ] Deduced a trap composed of 47 places in 47 ms of which 0 ms to minimize.
[2023-03-15 17:47:39] [INFO ] Deduced a trap composed of 69 places in 225 ms of which 1 ms to minimize.
[2023-03-15 17:47:40] [INFO ] Deduced a trap composed of 186 places in 239 ms of which 1 ms to minimize.
[2023-03-15 17:47:40] [INFO ] Deduced a trap composed of 129 places in 248 ms of which 1 ms to minimize.
[2023-03-15 17:47:41] [INFO ] Deduced a trap composed of 213 places in 244 ms of which 1 ms to minimize.
[2023-03-15 17:47:41] [INFO ] Deduced a trap composed of 154 places in 238 ms of which 1 ms to minimize.
[2023-03-15 17:47:42] [INFO ] Deduced a trap composed of 132 places in 237 ms of which 1 ms to minimize.
[2023-03-15 17:47:42] [INFO ] Deduced a trap composed of 47 places in 243 ms of which 1 ms to minimize.
[2023-03-15 17:47:42] [INFO ] Deduced a trap composed of 144 places in 254 ms of which 1 ms to minimize.
[2023-03-15 17:47:43] [INFO ] Deduced a trap composed of 47 places in 243 ms of which 0 ms to minimize.
[2023-03-15 17:47:43] [INFO ] Deduced a trap composed of 147 places in 246 ms of which 12 ms to minimize.
[2023-03-15 17:47:43] [INFO ] Deduced a trap composed of 179 places in 230 ms of which 0 ms to minimize.
[2023-03-15 17:47:44] [INFO ] Deduced a trap composed of 195 places in 224 ms of which 0 ms to minimize.
[2023-03-15 17:47:44] [INFO ] Deduced a trap composed of 142 places in 239 ms of which 0 ms to minimize.
[2023-03-15 17:47:44] [INFO ] Deduced a trap composed of 153 places in 223 ms of which 1 ms to minimize.
[2023-03-15 17:47:45] [INFO ] Deduced a trap composed of 157 places in 226 ms of which 0 ms to minimize.
[2023-03-15 17:47:45] [INFO ] Deduced a trap composed of 203 places in 243 ms of which 0 ms to minimize.
[2023-03-15 17:47:45] [INFO ] Deduced a trap composed of 142 places in 240 ms of which 1 ms to minimize.
[2023-03-15 17:47:45] [INFO ] Deduced a trap composed of 146 places in 240 ms of which 0 ms to minimize.
[2023-03-15 17:47:46] [INFO ] Deduced a trap composed of 181 places in 228 ms of which 1 ms to minimize.
[2023-03-15 17:47:46] [INFO ] Deduced a trap composed of 158 places in 240 ms of which 5 ms to minimize.
[2023-03-15 17:47:47] [INFO ] Deduced a trap composed of 169 places in 245 ms of which 1 ms to minimize.
[2023-03-15 17:47:47] [INFO ] Deduced a trap composed of 200 places in 249 ms of which 1 ms to minimize.
[2023-03-15 17:47:47] [INFO ] Deduced a trap composed of 69 places in 244 ms of which 1 ms to minimize.
[2023-03-15 17:47:48] [INFO ] Deduced a trap composed of 83 places in 249 ms of which 0 ms to minimize.
[2023-03-15 17:47:48] [INFO ] Deduced a trap composed of 155 places in 243 ms of which 1 ms to minimize.
[2023-03-15 17:47:48] [INFO ] Deduced a trap composed of 69 places in 241 ms of which 2 ms to minimize.
[2023-03-15 17:47:49] [INFO ] Deduced a trap composed of 221 places in 233 ms of which 1 ms to minimize.
[2023-03-15 17:47:49] [INFO ] Deduced a trap composed of 69 places in 246 ms of which 1 ms to minimize.
[2023-03-15 17:47:49] [INFO ] Deduced a trap composed of 158 places in 256 ms of which 1 ms to minimize.
[2023-03-15 17:47:50] [INFO ] Deduced a trap composed of 153 places in 243 ms of which 1 ms to minimize.
[2023-03-15 17:47:50] [INFO ] Deduced a trap composed of 69 places in 250 ms of which 1 ms to minimize.
[2023-03-15 17:47:51] [INFO ] Deduced a trap composed of 108 places in 248 ms of which 1 ms to minimize.
[2023-03-15 17:47:51] [INFO ] Deduced a trap composed of 69 places in 238 ms of which 0 ms to minimize.
[2023-03-15 17:47:51] [INFO ] Deduced a trap composed of 114 places in 258 ms of which 1 ms to minimize.
[2023-03-15 17:47:52] [INFO ] Deduced a trap composed of 111 places in 249 ms of which 1 ms to minimize.
[2023-03-15 17:47:52] [INFO ] Deduced a trap composed of 110 places in 240 ms of which 1 ms to minimize.
[2023-03-15 17:47:52] [INFO ] Deduced a trap composed of 193 places in 244 ms of which 1 ms to minimize.
[2023-03-15 17:47:53] [INFO ] Deduced a trap composed of 130 places in 245 ms of which 1 ms to minimize.
[2023-03-15 17:47:53] [INFO ] Deduced a trap composed of 143 places in 260 ms of which 2 ms to minimize.
[2023-03-15 17:47:53] [INFO ] Deduced a trap composed of 158 places in 248 ms of which 0 ms to minimize.
[2023-03-15 17:47:54] [INFO ] Deduced a trap composed of 137 places in 245 ms of which 0 ms to minimize.
[2023-03-15 17:47:54] [INFO ] Deduced a trap composed of 113 places in 254 ms of which 9 ms to minimize.
[2023-03-15 17:47:54] [INFO ] Deduced a trap composed of 178 places in 241 ms of which 1 ms to minimize.
[2023-03-15 17:47:55] [INFO ] Deduced a trap composed of 151 places in 236 ms of which 0 ms to minimize.
[2023-03-15 17:47:55] [INFO ] Deduced a trap composed of 156 places in 233 ms of which 0 ms to minimize.
[2023-03-15 17:47:55] [INFO ] Deduced a trap composed of 139 places in 235 ms of which 1 ms to minimize.
[2023-03-15 17:47:56] [INFO ] Deduced a trap composed of 125 places in 249 ms of which 0 ms to minimize.
[2023-03-15 17:47:56] [INFO ] Deduced a trap composed of 184 places in 245 ms of which 0 ms to minimize.
[2023-03-15 17:47:56] [INFO ] Deduced a trap composed of 201 places in 247 ms of which 1 ms to minimize.
[2023-03-15 17:47:57] [INFO ] Deduced a trap composed of 221 places in 251 ms of which 1 ms to minimize.
[2023-03-15 17:47:57] [INFO ] Deduced a trap composed of 215 places in 244 ms of which 1 ms to minimize.
[2023-03-15 17:47:57] [INFO ] Deduced a trap composed of 185 places in 236 ms of which 1 ms to minimize.
[2023-03-15 17:47:58] [INFO ] Deduced a trap composed of 206 places in 239 ms of which 3 ms to minimize.
[2023-03-15 17:47:58] [INFO ] Deduced a trap composed of 223 places in 241 ms of which 2 ms to minimize.
[2023-03-15 17:47:58] [INFO ] Deduced a trap composed of 205 places in 254 ms of which 11 ms to minimize.
[2023-03-15 17:47:59] [INFO ] Deduced a trap composed of 205 places in 232 ms of which 2 ms to minimize.
[2023-03-15 17:47:59] [INFO ] Deduced a trap composed of 184 places in 236 ms of which 1 ms to minimize.
[2023-03-15 17:47:59] [INFO ] Deduced a trap composed of 167 places in 229 ms of which 1 ms to minimize.
[2023-03-15 17:48:00] [INFO ] Deduced a trap composed of 140 places in 238 ms of which 1 ms to minimize.
[2023-03-15 17:48:00] [INFO ] Deduced a trap composed of 186 places in 241 ms of which 1 ms to minimize.
[2023-03-15 17:48:00] [INFO ] Deduced a trap composed of 149 places in 236 ms of which 1 ms to minimize.
[2023-03-15 17:48:00] [INFO ] Deduced a trap composed of 147 places in 226 ms of which 1 ms to minimize.
[2023-03-15 17:48:01] [INFO ] Deduced a trap composed of 157 places in 235 ms of which 0 ms to minimize.
[2023-03-15 17:48:01] [INFO ] Deduced a trap composed of 193 places in 236 ms of which 1 ms to minimize.
[2023-03-15 17:48:01] [INFO ] Deduced a trap composed of 204 places in 236 ms of which 0 ms to minimize.
[2023-03-15 17:48:02] [INFO ] Deduced a trap composed of 165 places in 233 ms of which 1 ms to minimize.
[2023-03-15 17:48:02] [INFO ] Deduced a trap composed of 166 places in 227 ms of which 0 ms to minimize.
[2023-03-15 17:48:02] [INFO ] Deduced a trap composed of 157 places in 229 ms of which 1 ms to minimize.
[2023-03-15 17:48:03] [INFO ] Deduced a trap composed of 244 places in 230 ms of which 1 ms to minimize.
[2023-03-15 17:48:03] [INFO ] Deduced a trap composed of 161 places in 235 ms of which 0 ms to minimize.
[2023-03-15 17:48:03] [INFO ] Deduced a trap composed of 147 places in 243 ms of which 0 ms to minimize.
[2023-03-15 17:48:04] [INFO ] Deduced a trap composed of 139 places in 231 ms of which 0 ms to minimize.
[2023-03-15 17:48:04] [INFO ] Deduced a trap composed of 192 places in 237 ms of which 0 ms to minimize.
[2023-03-15 17:48:04] [INFO ] Deduced a trap composed of 148 places in 230 ms of which 0 ms to minimize.
[2023-03-15 17:48:05] [INFO ] Deduced a trap composed of 177 places in 241 ms of which 1 ms to minimize.
[2023-03-15 17:48:05] [INFO ] Deduced a trap composed of 232 places in 249 ms of which 1 ms to minimize.
[2023-03-15 17:48:05] [INFO ] Deduced a trap composed of 223 places in 245 ms of which 0 ms to minimize.
[2023-03-15 17:48:06] [INFO ] Deduced a trap composed of 166 places in 249 ms of which 1 ms to minimize.
[2023-03-15 17:48:06] [INFO ] Deduced a trap composed of 161 places in 248 ms of which 0 ms to minimize.
[2023-03-15 17:48:07] [INFO ] Deduced a trap composed of 143 places in 247 ms of which 1 ms to minimize.
[2023-03-15 17:48:07] [INFO ] Deduced a trap composed of 212 places in 242 ms of which 1 ms to minimize.
[2023-03-15 17:48:07] [INFO ] Deduced a trap composed of 224 places in 244 ms of which 1 ms to minimize.
[2023-03-15 17:48:08] [INFO ] Deduced a trap composed of 236 places in 240 ms of which 1 ms to minimize.
[2023-03-15 17:48:08] [INFO ] Deduced a trap composed of 69 places in 254 ms of which 0 ms to minimize.
[2023-03-15 17:48:09] [INFO ] Deduced a trap composed of 152 places in 240 ms of which 0 ms to minimize.
[2023-03-15 17:48:09] [INFO ] Deduced a trap composed of 224 places in 250 ms of which 0 ms to minimize.
[2023-03-15 17:48:10] [INFO ] Deduced a trap composed of 149 places in 240 ms of which 0 ms to minimize.
[2023-03-15 17:48:11] [INFO ] Deduced a trap composed of 150 places in 237 ms of which 0 ms to minimize.
[2023-03-15 17:48:11] [INFO ] Deduced a trap composed of 174 places in 239 ms of which 0 ms to minimize.
[2023-03-15 17:48:11] [INFO ] Deduced a trap composed of 205 places in 246 ms of which 1 ms to minimize.
[2023-03-15 17:48:12] [INFO ] Deduced a trap composed of 218 places in 248 ms of which 0 ms to minimize.
[2023-03-15 17:48:12] [INFO ] Deduced a trap composed of 160 places in 238 ms of which 0 ms to minimize.
[2023-03-15 17:48:13] [INFO ] Deduced a trap composed of 69 places in 244 ms of which 0 ms to minimize.
[2023-03-15 17:48:13] [INFO ] Deduced a trap composed of 97 places in 233 ms of which 0 ms to minimize.
[2023-03-15 17:48:13] [INFO ] Deduced a trap composed of 159 places in 241 ms of which 1 ms to minimize.
[2023-03-15 17:48:13] [INFO ] Deduced a trap composed of 158 places in 242 ms of which 0 ms to minimize.
[2023-03-15 17:48:14] [INFO ] Deduced a trap composed of 152 places in 241 ms of which 0 ms to minimize.
[2023-03-15 17:48:14] [INFO ] Deduced a trap composed of 173 places in 247 ms of which 1 ms to minimize.
[2023-03-15 17:48:14] [INFO ] Deduced a trap composed of 148 places in 242 ms of which 1 ms to minimize.
[2023-03-15 17:48:15] [INFO ] Deduced a trap composed of 149 places in 242 ms of which 1 ms to minimize.
[2023-03-15 17:48:15] [INFO ] Deduced a trap composed of 204 places in 244 ms of which 1 ms to minimize.
[2023-03-15 17:48:16] [INFO ] Deduced a trap composed of 187 places in 242 ms of which 1 ms to minimize.
[2023-03-15 17:48:16] [INFO ] Deduced a trap composed of 134 places in 251 ms of which 1 ms to minimize.
[2023-03-15 17:48:16] [INFO ] Deduced a trap composed of 83 places in 255 ms of which 1 ms to minimize.
[2023-03-15 17:48:16] [INFO ] Deduced a trap composed of 207 places in 241 ms of which 0 ms to minimize.
[2023-03-15 17:48:17] [INFO ] Deduced a trap composed of 164 places in 247 ms of which 0 ms to minimize.
[2023-03-15 17:48:17] [INFO ] Deduced a trap composed of 188 places in 241 ms of which 1 ms to minimize.
[2023-03-15 17:48:18] [INFO ] Deduced a trap composed of 158 places in 241 ms of which 0 ms to minimize.
[2023-03-15 17:48:19] [INFO ] Deduced a trap composed of 153 places in 242 ms of which 1 ms to minimize.
[2023-03-15 17:48:19] [INFO ] Deduced a trap composed of 200 places in 248 ms of which 1 ms to minimize.
[2023-03-15 17:48:19] [INFO ] Deduced a trap composed of 194 places in 237 ms of which 0 ms to minimize.
[2023-03-15 17:48:20] [INFO ] Deduced a trap composed of 224 places in 240 ms of which 1 ms to minimize.
[2023-03-15 17:48:20] [INFO ] Deduced a trap composed of 169 places in 244 ms of which 0 ms to minimize.
[2023-03-15 17:48:21] [INFO ] Deduced a trap composed of 69 places in 239 ms of which 0 ms to minimize.
[2023-03-15 17:48:21] [INFO ] Deduced a trap composed of 156 places in 247 ms of which 1 ms to minimize.
[2023-03-15 17:48:21] [INFO ] Deduced a trap composed of 143 places in 240 ms of which 0 ms to minimize.
[2023-03-15 17:48:22] [INFO ] Deduced a trap composed of 207 places in 230 ms of which 0 ms to minimize.
[2023-03-15 17:48:23] [INFO ] Deduced a trap composed of 159 places in 244 ms of which 1 ms to minimize.
[2023-03-15 17:48:23] [INFO ] Deduced a trap composed of 174 places in 241 ms of which 0 ms to minimize.
[2023-03-15 17:48:24] [INFO ] Deduced a trap composed of 146 places in 245 ms of which 1 ms to minimize.
[2023-03-15 17:48:24] [INFO ] Deduced a trap composed of 171 places in 238 ms of which 1 ms to minimize.
[2023-03-15 17:48:24] [INFO ] Deduced a trap composed of 157 places in 246 ms of which 0 ms to minimize.
[2023-03-15 17:48:25] [INFO ] Deduced a trap composed of 173 places in 241 ms of which 0 ms to minimize.
[2023-03-15 17:48:25] [INFO ] Deduced a trap composed of 159 places in 240 ms of which 0 ms to minimize.
[2023-03-15 17:48:26] [INFO ] Deduced a trap composed of 224 places in 241 ms of which 0 ms to minimize.
[2023-03-15 17:48:26] [INFO ] Deduced a trap composed of 85 places in 238 ms of which 0 ms to minimize.
[2023-03-15 17:48:26] [INFO ] Deduced a trap composed of 165 places in 239 ms of which 1 ms to minimize.
[2023-03-15 17:48:27] [INFO ] Deduced a trap composed of 177 places in 235 ms of which 1 ms to minimize.
[2023-03-15 17:48:27] [INFO ] Deduced a trap composed of 139 places in 240 ms of which 0 ms to minimize.
[2023-03-15 17:48:28] [INFO ] Deduced a trap composed of 166 places in 231 ms of which 0 ms to minimize.
[2023-03-15 17:48:28] [INFO ] Deduced a trap composed of 157 places in 229 ms of which 1 ms to minimize.
[2023-03-15 17:48:29] [INFO ] Deduced a trap composed of 211 places in 237 ms of which 0 ms to minimize.
[2023-03-15 17:48:29] [INFO ] Deduced a trap composed of 228 places in 230 ms of which 1 ms to minimize.
[2023-03-15 17:48:29] [INFO ] Deduced a trap composed of 167 places in 241 ms of which 1 ms to minimize.
[2023-03-15 17:48:30] [INFO ] Deduced a trap composed of 201 places in 231 ms of which 0 ms to minimize.
[2023-03-15 17:48:30] [INFO ] Deduced a trap composed of 166 places in 220 ms of which 1 ms to minimize.
[2023-03-15 17:48:30] [INFO ] Deduced a trap composed of 69 places in 222 ms of which 1 ms to minimize.
[2023-03-15 17:48:31] [INFO ] Deduced a trap composed of 145 places in 233 ms of which 0 ms to minimize.
[2023-03-15 17:48:31] [INFO ] Deduced a trap composed of 149 places in 224 ms of which 0 ms to minimize.
[2023-03-15 17:48:31] [INFO ] Deduced a trap composed of 159 places in 243 ms of which 0 ms to minimize.
[2023-03-15 17:48:32] [INFO ] Deduced a trap composed of 164 places in 229 ms of which 1 ms to minimize.
[2023-03-15 17:48:32] [INFO ] Deduced a trap composed of 179 places in 234 ms of which 0 ms to minimize.
[2023-03-15 17:48:33] [INFO ] Deduced a trap composed of 222 places in 234 ms of which 1 ms to minimize.
[2023-03-15 17:48:33] [INFO ] Deduced a trap composed of 164 places in 228 ms of which 0 ms to minimize.
[2023-03-15 17:48:34] [INFO ] Deduced a trap composed of 69 places in 252 ms of which 1 ms to minimize.
[2023-03-15 17:48:34] [INFO ] Deduced a trap composed of 142 places in 247 ms of which 0 ms to minimize.
[2023-03-15 17:48:34] [INFO ] Deduced a trap composed of 113 places in 250 ms of which 0 ms to minimize.
[2023-03-15 17:48:35] [INFO ] Deduced a trap composed of 88 places in 240 ms of which 0 ms to minimize.
[2023-03-15 17:48:35] [INFO ] Deduced a trap composed of 142 places in 242 ms of which 0 ms to minimize.
[2023-03-15 17:48:35] [INFO ] Deduced a trap composed of 154 places in 242 ms of which 0 ms to minimize.
[2023-03-15 17:48:36] [INFO ] Deduced a trap composed of 189 places in 239 ms of which 0 ms to minimize.
[2023-03-15 17:48:36] [INFO ] Deduced a trap composed of 204 places in 242 ms of which 0 ms to minimize.
[2023-03-15 17:48:36] [INFO ] Deduced a trap composed of 169 places in 241 ms of which 1 ms to minimize.
[2023-03-15 17:48:37] [INFO ] Deduced a trap composed of 113 places in 240 ms of which 1 ms to minimize.
[2023-03-15 17:48:39] [INFO ] Deduced a trap composed of 199 places in 253 ms of which 0 ms to minimize.
[2023-03-15 17:48:39] [INFO ] Deduced a trap composed of 89 places in 247 ms of which 1 ms to minimize.
[2023-03-15 17:48:41] [INFO ] Deduced a trap composed of 219 places in 219 ms of which 1 ms to minimize.
[2023-03-15 17:48:41] [INFO ] Deduced a trap composed of 98 places in 236 ms of which 1 ms to minimize.
[2023-03-15 17:48:42] [INFO ] Deduced a trap composed of 69 places in 242 ms of which 1 ms to minimize.
[2023-03-15 17:48:42] [INFO ] Deduced a trap composed of 142 places in 244 ms of which 1 ms to minimize.
[2023-03-15 17:48:43] [INFO ] Deduced a trap composed of 155 places in 234 ms of which 0 ms to minimize.
[2023-03-15 17:48:44] [INFO ] Deduced a trap composed of 232 places in 241 ms of which 1 ms to minimize.
[2023-03-15 17:48:44] [INFO ] Deduced a trap composed of 104 places in 239 ms of which 1 ms to minimize.
[2023-03-15 17:48:44] [INFO ] Deduced a trap composed of 144 places in 237 ms of which 1 ms to minimize.
[2023-03-15 17:48:45] [INFO ] Deduced a trap composed of 140 places in 235 ms of which 1 ms to minimize.
[2023-03-15 17:48:45] [INFO ] Deduced a trap composed of 266 places in 245 ms of which 1 ms to minimize.
[2023-03-15 17:48:45] [INFO ] Deduced a trap composed of 151 places in 240 ms of which 0 ms to minimize.
[2023-03-15 17:48:46] [INFO ] Deduced a trap composed of 69 places in 243 ms of which 1 ms to minimize.
[2023-03-15 17:48:46] [INFO ] Deduced a trap composed of 82 places in 242 ms of which 1 ms to minimize.
[2023-03-15 17:48:46] [INFO ] Deduced a trap composed of 184 places in 240 ms of which 0 ms to minimize.
[2023-03-15 17:48:47] [INFO ] Deduced a trap composed of 152 places in 235 ms of which 1 ms to minimize.
[2023-03-15 17:48:47] [INFO ] Deduced a trap composed of 174 places in 226 ms of which 1 ms to minimize.
[2023-03-15 17:48:47] [INFO ] Deduced a trap composed of 163 places in 236 ms of which 1 ms to minimize.
[2023-03-15 17:48:48] [INFO ] Deduced a trap composed of 212 places in 240 ms of which 1 ms to minimize.
[2023-03-15 17:48:49] [INFO ] Deduced a trap composed of 69 places in 242 ms of which 1 ms to minimize.
[2023-03-15 17:48:49] [INFO ] Deduced a trap composed of 69 places in 238 ms of which 1 ms to minimize.
[2023-03-15 17:48:51] [INFO ] Deduced a trap composed of 85 places in 228 ms of which 0 ms to minimize.
[2023-03-15 17:48:51] [INFO ] Deduced a trap composed of 69 places in 226 ms of which 1 ms to minimize.
[2023-03-15 17:48:52] [INFO ] Deduced a trap composed of 69 places in 237 ms of which 1 ms to minimize.
[2023-03-15 17:48:52] [INFO ] Deduced a trap composed of 69 places in 236 ms of which 1 ms to minimize.
[2023-03-15 17:48:53] [INFO ] Deduced a trap composed of 200 places in 229 ms of which 1 ms to minimize.
[2023-03-15 17:48:53] [INFO ] Deduced a trap composed of 150 places in 229 ms of which 1 ms to minimize.
[2023-03-15 17:48:54] [INFO ] Deduced a trap composed of 187 places in 227 ms of which 0 ms to minimize.
[2023-03-15 17:48:54] [INFO ] Deduced a trap composed of 210 places in 230 ms of which 0 ms to minimize.
[2023-03-15 17:48:55] [INFO ] Deduced a trap composed of 214 places in 241 ms of which 0 ms to minimize.
[2023-03-15 17:48:55] [INFO ] Deduced a trap composed of 220 places in 235 ms of which 1 ms to minimize.
[2023-03-15 17:48:56] [INFO ] Deduced a trap composed of 184 places in 241 ms of which 0 ms to minimize.
[2023-03-15 17:48:56] [INFO ] Deduced a trap composed of 189 places in 225 ms of which 1 ms to minimize.
[2023-03-15 17:48:57] [INFO ] Deduced a trap composed of 195 places in 239 ms of which 1 ms to minimize.
[2023-03-15 17:48:57] [INFO ] Deduced a trap composed of 197 places in 234 ms of which 1 ms to minimize.
[2023-03-15 17:48:57] [INFO ] Deduced a trap composed of 166 places in 230 ms of which 1 ms to minimize.
[2023-03-15 17:48:57] [INFO ] Deduced a trap composed of 69 places in 235 ms of which 0 ms to minimize.
[2023-03-15 17:48:58] [INFO ] Deduced a trap composed of 150 places in 226 ms of which 0 ms to minimize.
[2023-03-15 17:48:58] [INFO ] Deduced a trap composed of 141 places in 228 ms of which 0 ms to minimize.
[2023-03-15 17:48:59] [INFO ] Deduced a trap composed of 207 places in 235 ms of which 0 ms to minimize.
[2023-03-15 17:48:59] [INFO ] Deduced a trap composed of 169 places in 230 ms of which 1 ms to minimize.
[2023-03-15 17:48:59] [INFO ] Deduced a trap composed of 154 places in 229 ms of which 1 ms to minimize.
[2023-03-15 17:49:00] [INFO ] Deduced a trap composed of 195 places in 220 ms of which 1 ms to minimize.
[2023-03-15 17:49:00] [INFO ] Deduced a trap composed of 162 places in 229 ms of which 0 ms to minimize.
[2023-03-15 17:49:00] [INFO ] Deduced a trap composed of 153 places in 236 ms of which 0 ms to minimize.
[2023-03-15 17:49:01] [INFO ] Deduced a trap composed of 140 places in 230 ms of which 1 ms to minimize.
[2023-03-15 17:49:01] [INFO ] Deduced a trap composed of 177 places in 229 ms of which 0 ms to minimize.
[2023-03-15 17:49:01] [INFO ] Deduced a trap composed of 186 places in 231 ms of which 0 ms to minimize.
[2023-03-15 17:49:02] [INFO ] Deduced a trap composed of 154 places in 232 ms of which 0 ms to minimize.
[2023-03-15 17:49:02] [INFO ] Deduced a trap composed of 202 places in 234 ms of which 0 ms to minimize.
[2023-03-15 17:49:03] [INFO ] Deduced a trap composed of 152 places in 231 ms of which 0 ms to minimize.
[2023-03-15 17:49:03] [INFO ] Deduced a trap composed of 196 places in 235 ms of which 1 ms to minimize.
[2023-03-15 17:49:03] [INFO ] Deduced a trap composed of 156 places in 241 ms of which 0 ms to minimize.
[2023-03-15 17:49:04] [INFO ] Deduced a trap composed of 69 places in 235 ms of which 1 ms to minimize.
[2023-03-15 17:49:04] [INFO ] Deduced a trap composed of 213 places in 234 ms of which 0 ms to minimize.
[2023-03-15 17:49:04] [INFO ] Deduced a trap composed of 153 places in 220 ms of which 1 ms to minimize.
[2023-03-15 17:49:05] [INFO ] Deduced a trap composed of 142 places in 226 ms of which 0 ms to minimize.
[2023-03-15 17:49:05] [INFO ] Deduced a trap composed of 208 places in 239 ms of which 0 ms to minimize.
[2023-03-15 17:49:05] [INFO ] Deduced a trap composed of 240 places in 239 ms of which 0 ms to minimize.
[2023-03-15 17:49:06] [INFO ] Deduced a trap composed of 231 places in 244 ms of which 0 ms to minimize.
[2023-03-15 17:49:06] [INFO ] Deduced a trap composed of 145 places in 224 ms of which 0 ms to minimize.
[2023-03-15 17:49:07] [INFO ] Deduced a trap composed of 69 places in 239 ms of which 0 ms to minimize.
[2023-03-15 17:49:07] [INFO ] Deduced a trap composed of 166 places in 232 ms of which 1 ms to minimize.
[2023-03-15 17:49:07] [INFO ] Deduced a trap composed of 109 places in 242 ms of which 0 ms to minimize.
[2023-03-15 17:49:09] [INFO ] Deduced a trap composed of 69 places in 249 ms of which 0 ms to minimize.
[2023-03-15 17:49:10] [INFO ] Deduced a trap composed of 93 places in 234 ms of which 0 ms to minimize.
[2023-03-15 17:49:10] [INFO ] Deduced a trap composed of 184 places in 240 ms of which 0 ms to minimize.
[2023-03-15 17:49:10] [INFO ] Deduced a trap composed of 174 places in 235 ms of which 1 ms to minimize.
[2023-03-15 17:49:11] [INFO ] Deduced a trap composed of 155 places in 223 ms of which 1 ms to minimize.
[2023-03-15 17:49:11] [INFO ] Deduced a trap composed of 139 places in 219 ms of which 1 ms to minimize.
[2023-03-15 17:49:12] [INFO ] Deduced a trap composed of 148 places in 225 ms of which 0 ms to minimize.
[2023-03-15 17:49:12] [INFO ] Deduced a trap composed of 153 places in 242 ms of which 0 ms to minimize.
[2023-03-15 17:49:12] [INFO ] Deduced a trap composed of 196 places in 246 ms of which 0 ms to minimize.
[2023-03-15 17:49:13] [INFO ] Deduced a trap composed of 153 places in 244 ms of which 1 ms to minimize.
[2023-03-15 17:49:13] [INFO ] Deduced a trap composed of 140 places in 234 ms of which 1 ms to minimize.
[2023-03-15 17:49:13] [INFO ] Deduced a trap composed of 169 places in 230 ms of which 1 ms to minimize.
[2023-03-15 17:49:14] [INFO ] Deduced a trap composed of 217 places in 224 ms of which 0 ms to minimize.
[2023-03-15 17:49:14] [INFO ] Deduced a trap composed of 208 places in 223 ms of which 0 ms to minimize.
[2023-03-15 17:49:14] [INFO ] Deduced a trap composed of 159 places in 218 ms of which 1 ms to minimize.
[2023-03-15 17:49:15] [INFO ] Deduced a trap composed of 209 places in 217 ms of which 2 ms to minimize.
[2023-03-15 17:49:15] [INFO ] Deduced a trap composed of 213 places in 234 ms of which 1 ms to minimize.
[2023-03-15 17:49:15] [INFO ] Deduced a trap composed of 153 places in 222 ms of which 0 ms to minimize.
[2023-03-15 17:49:16] [INFO ] Deduced a trap composed of 153 places in 228 ms of which 1 ms to minimize.
[2023-03-15 17:49:16] [INFO ] Deduced a trap composed of 149 places in 229 ms of which 0 ms to minimize.
[2023-03-15 17:49:17] [INFO ] Deduced a trap composed of 228 places in 238 ms of which 1 ms to minimize.
[2023-03-15 17:49:17] [INFO ] Deduced a trap composed of 177 places in 226 ms of which 1 ms to minimize.
[2023-03-15 17:49:17] [INFO ] Deduced a trap composed of 200 places in 223 ms of which 2 ms to minimize.
[2023-03-15 17:49:18] [INFO ] Deduced a trap composed of 187 places in 219 ms of which 1 ms to minimize.
[2023-03-15 17:49:18] [INFO ] Deduced a trap composed of 171 places in 222 ms of which 1 ms to minimize.
[2023-03-15 17:49:19] [INFO ] Deduced a trap composed of 115 places in 255 ms of which 0 ms to minimize.
[2023-03-15 17:49:21] [INFO ] Deduced a trap composed of 157 places in 232 ms of which 0 ms to minimize.
[2023-03-15 17:49:22] [INFO ] Deduced a trap composed of 88 places in 235 ms of which 1 ms to minimize.
[2023-03-15 17:49:22] [INFO ] Deduced a trap composed of 214 places in 223 ms of which 1 ms to minimize.
[2023-03-15 17:49:23] [INFO ] Deduced a trap composed of 227 places in 246 ms of which 1 ms to minimize.
[2023-03-15 17:49:24] [INFO ] Deduced a trap composed of 132 places in 262 ms of which 0 ms to minimize.
[2023-03-15 17:49:24] [INFO ] Deduced a trap composed of 129 places in 233 ms of which 1 ms to minimize.
[2023-03-15 17:49:24] [INFO ] Deduced a trap composed of 203 places in 235 ms of which 0 ms to minimize.
[2023-03-15 17:49:25] [INFO ] Deduced a trap composed of 258 places in 239 ms of which 1 ms to minimize.
[2023-03-15 17:49:26] [INFO ] Deduced a trap composed of 127 places in 254 ms of which 0 ms to minimize.
[2023-03-15 17:49:26] [INFO ] Deduced a trap composed of 91 places in 238 ms of which 0 ms to minimize.
[2023-03-15 17:49:27] [INFO ] Deduced a trap composed of 271 places in 232 ms of which 0 ms to minimize.
[2023-03-15 17:49:28] [INFO ] Deduced a trap composed of 200 places in 235 ms of which 0 ms to minimize.
[2023-03-15 17:49:28] [INFO ] Deduced a trap composed of 202 places in 221 ms of which 1 ms to minimize.
[2023-03-15 17:49:29] [INFO ] Deduced a trap composed of 146 places in 232 ms of which 1 ms to minimize.
[2023-03-15 17:49:29] [INFO ] Deduced a trap composed of 140 places in 231 ms of which 1 ms to minimize.
[2023-03-15 17:49:29] [INFO ] Deduced a trap composed of 160 places in 225 ms of which 0 ms to minimize.
[2023-03-15 17:49:30] [INFO ] Deduced a trap composed of 156 places in 227 ms of which 0 ms to minimize.
[2023-03-15 17:49:30] [INFO ] Deduced a trap composed of 150 places in 244 ms of which 1 ms to minimize.
[2023-03-15 17:49:30] [INFO ] Deduced a trap composed of 149 places in 242 ms of which 0 ms to minimize.
[2023-03-15 17:49:31] [INFO ] Deduced a trap composed of 260 places in 229 ms of which 1 ms to minimize.
[2023-03-15 17:49:31] [INFO ] Deduced a trap composed of 152 places in 251 ms of which 0 ms to minimize.
[2023-03-15 17:49:32] [INFO ] Deduced a trap composed of 85 places in 236 ms of which 1 ms to minimize.
[2023-03-15 17:49:32] [INFO ] Deduced a trap composed of 162 places in 236 ms of which 1 ms to minimize.
[2023-03-15 17:49:33] [INFO ] Deduced a trap composed of 146 places in 241 ms of which 0 ms to minimize.
[2023-03-15 17:49:33] [INFO ] Deduced a trap composed of 204 places in 240 ms of which 1 ms to minimize.
[2023-03-15 17:49:33] [INFO ] Deduced a trap composed of 180 places in 236 ms of which 1 ms to minimize.
[2023-03-15 17:49:34] [INFO ] Deduced a trap composed of 148 places in 236 ms of which 0 ms to minimize.
SDD proceeding with computation,12 properties remain. new max is 524288
[2023-03-15 17:49:34] [INFO ] Deduced a trap composed of 164 places in 230 ms of which 1 ms to minimize.
[2023-03-15 17:49:34] [INFO ] Deduced a trap composed of 264 places in 231 ms of which 0 ms to minimize.
SDD size :8.82937e+06 after 9.48666e+06
[2023-03-15 17:49:35] [INFO ] Deduced a trap composed of 143 places in 231 ms of which 0 ms to minimize.
[2023-03-15 17:49:35] [INFO ] Deduced a trap composed of 153 places in 250 ms of which 0 ms to minimize.
[2023-03-15 17:49:36] [INFO ] Deduced a trap composed of 109 places in 242 ms of which 0 ms to minimize.
[2023-03-15 17:49:36] [INFO ] Deduced a trap composed of 115 places in 241 ms of which 0 ms to minimize.
[2023-03-15 17:49:36] [INFO ] Deduced a trap composed of 143 places in 243 ms of which 1 ms to minimize.
[2023-03-15 17:49:37] [INFO ] Deduced a trap composed of 150 places in 235 ms of which 0 ms to minimize.
[2023-03-15 17:49:37] [INFO ] Deduced a trap composed of 160 places in 239 ms of which 0 ms to minimize.
[2023-03-15 17:49:38] [INFO ] Deduced a trap composed of 183 places in 235 ms of which 1 ms to minimize.
[2023-03-15 17:49:38] [INFO ] Deduced a trap composed of 208 places in 232 ms of which 1 ms to minimize.
[2023-03-15 17:49:39] [INFO ] Deduced a trap composed of 153 places in 242 ms of which 0 ms to minimize.
[2023-03-15 17:49:40] [INFO ] Deduced a trap composed of 161 places in 240 ms of which 0 ms to minimize.
[2023-03-15 17:49:40] [INFO ] Deduced a trap composed of 201 places in 224 ms of which 1 ms to minimize.
[2023-03-15 17:49:41] [INFO ] Deduced a trap composed of 142 places in 228 ms of which 0 ms to minimize.
[2023-03-15 17:49:41] [INFO ] Deduced a trap composed of 165 places in 246 ms of which 1 ms to minimize.
[2023-03-15 17:49:42] [INFO ] Deduced a trap composed of 213 places in 230 ms of which 0 ms to minimize.
[2023-03-15 17:49:43] [INFO ] Deduced a trap composed of 93 places in 244 ms of which 0 ms to minimize.
[2023-03-15 17:49:43] [INFO ] Deduced a trap composed of 119 places in 244 ms of which 1 ms to minimize.
[2023-03-15 17:49:44] [INFO ] Deduced a trap composed of 136 places in 245 ms of which 1 ms to minimize.
[2023-03-15 17:49:46] [INFO ] Deduced a trap composed of 108 places in 243 ms of which 1 ms to minimize.
[2023-03-15 17:49:46] [INFO ] Deduced a trap composed of 137 places in 248 ms of which 1 ms to minimize.
[2023-03-15 17:49:47] [INFO ] Deduced a trap composed of 108 places in 246 ms of which 1 ms to minimize.
[2023-03-15 17:49:48] [INFO ] Deduced a trap composed of 179 places in 242 ms of which 0 ms to minimize.
[2023-03-15 17:49:48] [INFO ] Deduced a trap composed of 113 places in 245 ms of which 0 ms to minimize.
[2023-03-15 17:49:48] [INFO ] Deduced a trap composed of 140 places in 242 ms of which 0 ms to minimize.
[2023-03-15 17:49:49] [INFO ] Deduced a trap composed of 119 places in 248 ms of which 0 ms to minimize.
[2023-03-15 17:49:49] [INFO ] Deduced a trap composed of 108 places in 245 ms of which 0 ms to minimize.
[2023-03-15 17:49:54] [INFO ] Deduced a trap composed of 154 places in 230 ms of which 0 ms to minimize.
[2023-03-15 17:49:54] [INFO ] Deduced a trap composed of 165 places in 233 ms of which 0 ms to minimize.
[2023-03-15 17:49:55] [INFO ] Deduced a trap composed of 148 places in 231 ms of which 0 ms to minimize.
[2023-03-15 17:49:56] [INFO ] Deduced a trap composed of 155 places in 242 ms of which 0 ms to minimize.
[2023-03-15 17:49:56] [INFO ] Deduced a trap composed of 127 places in 236 ms of which 0 ms to minimize.
[2023-03-15 17:49:57] [INFO ] Deduced a trap composed of 119 places in 242 ms of which 0 ms to minimize.
[2023-03-15 17:49:59] [INFO ] Deduced a trap composed of 108 places in 238 ms of which 1 ms to minimize.
[2023-03-15 17:50:00] [INFO ] Deduced a trap composed of 110 places in 245 ms of which 0 ms to minimize.
[2023-03-15 17:50:01] [INFO ] Deduced a trap composed of 108 places in 238 ms of which 1 ms to minimize.
[2023-03-15 17:50:01] [INFO ] Deduced a trap composed of 212 places in 250 ms of which 0 ms to minimize.
[2023-03-15 17:50:01] [INFO ] Deduced a trap composed of 208 places in 253 ms of which 1 ms to minimize.
[2023-03-15 17:50:02] [INFO ] Deduced a trap composed of 113 places in 247 ms of which 0 ms to minimize.
[2023-03-15 17:50:02] [INFO ] Deduced a trap composed of 123 places in 249 ms of which 1 ms to minimize.
[2023-03-15 17:50:03] [INFO ] Deduced a trap composed of 115 places in 247 ms of which 1 ms to minimize.
[2023-03-15 17:50:03] [INFO ] Deduced a trap composed of 117 places in 248 ms of which 1 ms to minimize.
[2023-03-15 17:50:04] [INFO ] Deduced a trap composed of 215 places in 245 ms of which 0 ms to minimize.
[2023-03-15 17:50:04] [INFO ] Deduced a trap composed of 118 places in 246 ms of which 1 ms to minimize.
[2023-03-15 17:50:05] [INFO ] Deduced a trap composed of 108 places in 257 ms of which 1 ms to minimize.
[2023-03-15 17:50:06] [INFO ] Deduced a trap composed of 129 places in 248 ms of which 1 ms to minimize.
[2023-03-15 17:50:06] [INFO ] Deduced a trap composed of 127 places in 241 ms of which 0 ms to minimize.
[2023-03-15 17:50:08] [INFO ] Deduced a trap composed of 216 places in 244 ms of which 0 ms to minimize.
[2023-03-15 17:50:08] [INFO ] Deduced a trap composed of 110 places in 244 ms of which 0 ms to minimize.
[2023-03-15 17:50:09] [INFO ] Deduced a trap composed of 146 places in 248 ms of which 0 ms to minimize.
[2023-03-15 17:50:09] [INFO ] Deduced a trap composed of 154 places in 250 ms of which 1 ms to minimize.
[2023-03-15 17:50:09] [INFO ] Deduced a trap composed of 135 places in 248 ms of which 1 ms to minimize.
[2023-03-15 17:50:10] [INFO ] Deduced a trap composed of 110 places in 245 ms of which 1 ms to minimize.
[2023-03-15 17:50:10] [INFO ] Deduced a trap composed of 119 places in 248 ms of which 0 ms to minimize.
[2023-03-15 17:50:12] [INFO ] Deduced a trap composed of 108 places in 252 ms of which 1 ms to minimize.
[2023-03-15 17:50:13] [INFO ] Deduced a trap composed of 108 places in 245 ms of which 0 ms to minimize.
[2023-03-15 17:50:15] [INFO ] Deduced a trap composed of 69 places in 243 ms of which 1 ms to minimize.
[2023-03-15 17:50:16] [INFO ] Deduced a trap composed of 193 places in 245 ms of which 1 ms to minimize.
[2023-03-15 17:50:16] [INFO ] Deduced a trap composed of 217 places in 246 ms of which 0 ms to minimize.
[2023-03-15 17:50:16] [INFO ] Deduced a trap composed of 210 places in 253 ms of which 0 ms to minimize.
[2023-03-15 17:50:17] [INFO ] Deduced a trap composed of 149 places in 244 ms of which 1 ms to minimize.
[2023-03-15 17:50:17] [INFO ] Deduced a trap composed of 143 places in 246 ms of which 1 ms to minimize.
[2023-03-15 17:50:18] [INFO ] Deduced a trap composed of 122 places in 244 ms of which 1 ms to minimize.
[2023-03-15 17:50:19] [INFO ] Deduced a trap composed of 122 places in 242 ms of which 0 ms to minimize.
[2023-03-15 17:50:19] [INFO ] Deduced a trap composed of 129 places in 251 ms of which 0 ms to minimize.
[2023-03-15 17:50:20] [INFO ] Deduced a trap composed of 247 places in 244 ms of which 1 ms to minimize.
[2023-03-15 17:50:20] [INFO ] Deduced a trap composed of 121 places in 246 ms of which 1 ms to minimize.
[2023-03-15 17:50:20] [INFO ] Deduced a trap composed of 146 places in 245 ms of which 0 ms to minimize.
[2023-03-15 17:50:20] [INFO ] Deduced a trap composed of 245 places in 234 ms of which 1 ms to minimize.
[2023-03-15 17:50:21] [INFO ] Deduced a trap composed of 123 places in 233 ms of which 0 ms to minimize.
[2023-03-15 17:50:21] [INFO ] Deduced a trap composed of 141 places in 252 ms of which 0 ms to minimize.
[2023-03-15 17:50:22] [INFO ] Deduced a trap composed of 117 places in 244 ms of which 1 ms to minimize.
[2023-03-15 17:50:22] [INFO ] Deduced a trap composed of 111 places in 246 ms of which 1 ms to minimize.
[2023-03-15 17:50:22] [INFO ] Deduced a trap composed of 130 places in 251 ms of which 1 ms to minimize.
[2023-03-15 17:50:28] [INFO ] Deduced a trap composed of 69 places in 227 ms of which 0 ms to minimize.
[2023-03-15 17:50:29] [INFO ] Deduced a trap composed of 151 places in 229 ms of which 0 ms to minimize.
[2023-03-15 17:50:29] [INFO ] Deduced a trap composed of 152 places in 246 ms of which 1 ms to minimize.
[2023-03-15 17:50:30] [INFO ] Deduced a trap composed of 182 places in 234 ms of which 1 ms to minimize.
[2023-03-15 17:50:30] [INFO ] Deduced a trap composed of 148 places in 246 ms of which 1 ms to minimize.
[2023-03-15 17:50:31] [INFO ] Deduced a trap composed of 213 places in 225 ms of which 0 ms to minimize.
[2023-03-15 17:50:31] [INFO ] Deduced a trap composed of 203 places in 212 ms of which 0 ms to minimize.
[2023-03-15 17:50:32] [INFO ] Deduced a trap composed of 172 places in 222 ms of which 0 ms to minimize.
[2023-03-15 17:50:32] [INFO ] Deduced a trap composed of 131 places in 242 ms of which 1 ms to minimize.
[2023-03-15 17:50:33] [INFO ] Deduced a trap composed of 163 places in 241 ms of which 1 ms to minimize.
[2023-03-15 17:50:33] [INFO ] Deduced a trap composed of 222 places in 237 ms of which 0 ms to minimize.
[2023-03-15 17:50:33] [INFO ] Deduced a trap composed of 253 places in 240 ms of which 0 ms to minimize.
[2023-03-15 17:50:34] [INFO ] Deduced a trap composed of 161 places in 229 ms of which 1 ms to minimize.
[2023-03-15 17:50:36] [INFO ] Deduced a trap composed of 196 places in 229 ms of which 0 ms to minimize.
[2023-03-15 17:50:36] [INFO ] Deduced a trap composed of 139 places in 234 ms of which 1 ms to minimize.
[2023-03-15 17:50:36] [INFO ] Deduced a trap composed of 173 places in 221 ms of which 0 ms to minimize.
[2023-03-15 17:50:37] [INFO ] Deduced a trap composed of 173 places in 212 ms of which 1 ms to minimize.
[2023-03-15 17:50:37] [INFO ] Deduced a trap composed of 143 places in 220 ms of which 0 ms to minimize.
[2023-03-15 17:50:37] [INFO ] Deduced a trap composed of 139 places in 220 ms of which 0 ms to minimize.
[2023-03-15 17:50:38] [INFO ] Trap strengthening (SAT) tested/added 378/377 trap constraints in 186667 ms
[2023-03-15 17:50:38] [INFO ] After 192352ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 259 ms.
[2023-03-15 17:50:39] [INFO ] After 192715ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-15 17:50:39] [INFO ] Flatten gal took : 83 ms
[2023-03-15 17:50:39] [INFO ] Flatten gal took : 66 ms
[2023-03-15 17:50:39] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2671052469873075438.gal : 17 ms
[2023-03-15 17:50:39] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality158646292166456174.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality2671052469873075438.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality158646292166456174.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...327
Loading property file /tmp/ReachabilityCardinality158646292166456174.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 29
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :29 after 101
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :101 after 287
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :287 after 416
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :416 after 710
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :710 after 888
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :888 after 2948
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :2948 after 8424
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :8424 after 86224
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :86224 after 120334
Detected timeout of ITS tools.
[2023-03-15 17:50:54] [INFO ] Flatten gal took : 65 ms
[2023-03-15 17:50:54] [INFO ] Applying decomposition
[2023-03-15 17:50:54] [INFO ] Flatten gal took : 60 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph12952930334667109054.txt' '-o' '/tmp/graph12952930334667109054.bin' '-w' '/tmp/graph12952930334667109054.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph12952930334667109054.bin' '-l' '-1' '-v' '-w' '/tmp/graph12952930334667109054.weights' '-q' '0' '-e' '0.001'
[2023-03-15 17:50:54] [INFO ] Decomposing Gal with order
[2023-03-15 17:50:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-15 17:50:55] [INFO ] Removed a total of 1505 redundant transitions.
[2023-03-15 17:50:55] [INFO ] Flatten gal took : 410 ms
[2023-03-15 17:50:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 549 labels/synchronizations in 86 ms.
[2023-03-15 17:50:55] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13101137697380373955.gal : 29 ms
[2023-03-15 17:50:55] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11120791927787556296.prop : 54 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality13101137697380373955.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11120791927787556296.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...309
Loading property file /tmp/ReachabilityCardinality11120791927787556296.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 15
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :15 after 16
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :16 after 16
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :16 after 16
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :16 after 16
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :16 after 16
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :16 after 16
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :16 after 128
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :128 after 128
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :128 after 128
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :128 after 128
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :128 after 128
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :128 after 128
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :128 after 128
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :128 after 63240
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin16103081280836831252
[2023-03-15 17:51:10] [INFO ] Built C files in 52ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16103081280836831252
Running compilation step : cd /tmp/ltsmin16103081280836831252;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2786 ms.
Running link step : cd /tmp/ltsmin16103081280836831252;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 46 ms.
Running LTSmin : cd /tmp/ltsmin16103081280836831252;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'PolyORBLFPTS04J06T08ReachabilityCardinality13==true'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
ITS runner failed with exception null
java.lang.InterruptedException
at java.base/java.lang.Object.wait(Native Method)
at java.base/java.lang.Thread.join(Thread.java:1304)
at java.base/java.lang.Thread.join(Thread.java:1372)
at fr.lip6.move.gal.application.runner.AbstractRunner.join(AbstractRunner.java:27)
at fr.lip6.move.gal.application.runner.its.ITSRunner.join(ITSRunner.java:177)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.verifyWithSDD(GlobalPropertySolver.java:675)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.lambda$2(ReachabilitySolver.java:63)
at java.base/java.lang.Thread.run(Thread.java:833)
[2023-03-15 17:51:25] [INFO ] Flatten gal took : 95 ms
[2023-03-15 17:51:25] [INFO ] Applying decomposition
[2023-03-15 17:51:25] [INFO ] Flatten gal took : 100 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph8318658557783383813.txt' '-o' '/tmp/graph8318658557783383813.bin' '-w' '/tmp/graph8318658557783383813.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph8318658557783383813.bin' '-l' '-1' '-v' '-w' '/tmp/graph8318658557783383813.weights' '-q' '0' '-e' '0.001'
[2023-03-15 17:51:26] [INFO ] Decomposing Gal with order
[2023-03-15 17:51:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-15 17:51:26] [INFO ] Removed a total of 1553 redundant transitions.
[2023-03-15 17:51:26] [INFO ] Flatten gal took : 212 ms
[2023-03-15 17:51:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 364 labels/synchronizations in 41 ms.
[2023-03-15 17:51:26] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16929841863184902634.gal : 23 ms
[2023-03-15 17:51:26] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2274106148229800595.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality16929841863184902634.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2274106148229800595.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
Loading property file /tmp/ReachabilityCardinality2274106148229800595.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :1 after 31
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :31 after 31
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :31 after 31
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :31 after 31
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :31 after 46
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :46 after 61
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :61 after 3355
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :3355 after 6039
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :6039 after 22669
SDD proceeding with computation,1 properties remain. new max is 131072
SDD size :22669 after 676518
SDD proceeding with computation,12 properties remain. new max is 1048576
SDD size :9.48666e+06 after 3.39937e+07
SDD proceeding with computation,1 properties remain. new max is 262144
SDD size :676518 after 2.303e+07
SDD proceeding with computation,1 properties remain. new max is 524288
SDD size :2.303e+07 after 4.42718e+07
SDD proceeding with computation,12 properties remain. new max is 2097152
SDD size :3.39937e+07 after 9.56687e+07
Detected timeout of ITS tools.
Detected timeout of ITS tools.
[2023-03-15 18:21:28] [INFO ] Flatten gal took : 273 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin1915452613245794247
[2023-03-15 18:21:28] [INFO ] Computing symmetric may disable matrix : 1399 transitions.
[2023-03-15 18:21:28] [INFO ] Computation of Complete disable matrix. took 28 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-15 18:21:28] [INFO ] Computing symmetric may enable matrix : 1399 transitions.
[2023-03-15 18:21:28] [INFO ] Computation of Complete enable matrix. took 10 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-15 18:21:28] [INFO ] Applying decomposition
[2023-03-15 18:21:28] [INFO ] Flatten gal took : 83 ms
[2023-03-15 18:21:30] [INFO ] Computing Do-Not-Accords matrix : 1399 transitions.
[2023-03-15 18:21:31] [INFO ] Computation of Completed DNA matrix. took 83 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-15 18:21:31] [INFO ] Built C files in 2763ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1915452613245794247
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph17791567655116997272.txt' '-o' '/tmp/graph17791567655116997272.bin' '-w' '/tmp/graph17791567655116997272.weights'
Running compilation step : cd /tmp/ltsmin1915452613245794247;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph17791567655116997272.bin' '-l' '-1' '-v' '-w' '/tmp/graph17791567655116997272.weights' '-q' '0' '-e' '0.001'
[2023-03-15 18:21:31] [INFO ] Decomposing Gal with order
[2023-03-15 18:21:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-15 18:21:31] [INFO ] Removed a total of 1291 redundant transitions.
[2023-03-15 18:21:31] [INFO ] Flatten gal took : 242 ms
[2023-03-15 18:21:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 587 labels/synchronizations in 133 ms.
[2023-03-15 18:21:31] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4092956188770661081.gal : 18 ms
[2023-03-15 18:21:31] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17055865746727432293.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality4092956188770661081.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17055865746727432293.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
Loading property file /tmp/ReachabilityCardinality17055865746727432293.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :1 after 25
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :25 after 44
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :44 after 96
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :96 after 1250
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :1250 after 96727
Compilation finished in 6475 ms.
Running link step : cd /tmp/ltsmin1915452613245794247;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 87 ms.
Running LTSmin : cd /tmp/ltsmin1915452613245794247;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'PolyORBLFPTS04J06T08ReachabilityCardinality13==true'
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :96727 after 259537
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :259537 after 3.17536e+06
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :3.17536e+06 after 1.16027e+07
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :3.17167e+07 after 3.57746e+07
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393232 kB
MemFree: 7296788 kB
After kill :
MemTotal: 16393232 kB
MemFree: 15139448 kB

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="PolyORBLF-PT-S04J06T08"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool itstools"
echo " Input is PolyORBLF-PT-S04J06T08, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r293-tall-167873945600574"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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