Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r224-tall-171649612300238.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is LamportFastMutEx-COL-6, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r224-tall-171649612300238
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 440K
-rw-r--r-- 1 mcc users 5.7K Apr 13 07:44 CTLCardinality.txt
-rw-r--r-- 1 mcc users 55K Apr 13 07:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Apr 13 07:41 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K Apr 13 07:41 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Apr 22 14:51 LTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Apr 22 14:51 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 22 14:51 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:51 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.2K Apr 13 07:51 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 69K Apr 13 07:51 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 13 07:49 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 78K Apr 13 07:49 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 22 14:51 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:51 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:42 equiv_pt
-rw-r--r-- 1 mcc users 2 May 18 16:42 instance
-rw-r--r-- 1 mcc users 5 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 42K May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716564342114

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=LamportFastMutEx-COL-6
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
ReachabilityCardinality COL
Running Version 202405141337
[2024-05-24 15:25:43] [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]
[2024-05-24 15:25:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 15:25:43] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-05-24 15:25:43] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-24 15:25:43] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 567 ms
[2024-05-24 15:25:43] [INFO ] Imported 18 HL places and 17 HL transitions for a total of 217 PT places and 525.0 transition bindings in 16 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 17 ms.
Working with output stream class java.io.PrintStream
[2024-05-24 15:25:43] [INFO ] Built PT skeleton of HLPN with 18 places and 17 transitions 68 arcs in 10 ms.
[2024-05-24 15:25:43] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
Remains 16 properties that can be checked using skeleton over-approximation.
Reduce places removed 3 places and 0 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
[2024-05-24 15:25:44] [INFO ] Flatten gal took : 43 ms
[2024-05-24 15:25:44] [INFO ] Flatten gal took : 3 ms
[2024-05-24 15:25:44] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16746013902979420391.gal : 4 ms
[2024-05-24 15:25:44] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12065542377163427232.prop : 3 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.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality16746013902979420391.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12065542377163427232.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.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
Loading property file /tmp/ReachabilityCardinality12065542377163427232.prop.
SDD proceeding with computation,15 properties remain. new max is 4
SDD size :1 after 7
SDD proceeding with computation,15 properties remain. new max is 8
SDD size :7 after 20
SDD proceeding with computation,15 properties remain. new max is 16
SDD size :20 after 84
SDD proceeding with computation,15 properties remain. new max is 32
SDD size :84 after 923
Invariant property LamportFastMutEx-COL-6-ReachabilityCardinality-2024-10 does not hold.
Invariant property LamportFastMutEx-COL-6-ReachabilityCardinality-2024-05 does not hold.
Invariant property LamportFastMutEx-COL-6-ReachabilityCardinality-2024-03 does not hold.
SDD proceeding with computation,12 properties remain. new max is 32
SDD size :923 after 12376
SDD proceeding with computation,12 properties remain. new max is 64
SDD size :69890 after 69917
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,69972,0.049772,4312,2,256,15,4458,18,0,208,3658,0
Total reachable state count : 69972

Verifying 15 reachability properties.
Invariant property LamportFastMutEx-COL-6-ReachabilityCardinality-2024-01 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
LamportFastMutEx-COL-6-ReachabilityCardinality-2024-01,0,0.050981,4312,1,0,15,4458,18,0,210,3658,0
Invariant property LamportFastMutEx-COL-6-ReachabilityCardinality-2024-02 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
LamportFastMutEx-COL-6-ReachabilityCardinality-2024-02,0,0.05172,4572,1,0,15,4458,18,0,211,3658,0
Invariant property LamportFastMutEx-COL-6-ReachabilityCardinality-2024-03 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
LamportFastMutEx-COL-6-ReachabilityCardinality-2024-03,4368,0.051974,4572,2,71,15,4458,19,0,222,3658,0
Reachability property LamportFastMutEx-COL-6-ReachabilityCardinality-2024-04 does not hold.
No reachable states exhibit your property : LamportFastMutEx-COL-6-ReachabilityCardinality-2024-04

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
LamportFastMutEx-COL-6-ReachabilityCardinality-2024-04,0,0.052168,4572,1,0,15,4458,19,0,222,3658,0
Invariant property LamportFastMutEx-COL-6-ReachabilityCardinality-2024-05 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
LamportFastMutEx-COL-6-ReachabilityCardinality-2024-05,715,0.052341,4572,2,52,15,4458,20,0,224,3658,0
Reachability property LamportFastMutEx-COL-6-ReachabilityCardinality-2024-06 does not hold.
No reachable states exhibit your property : LamportFastMutEx-COL-6-ReachabilityCardinality-2024-06

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
LamportFastMutEx-COL-6-ReachabilityCardinality-2024-06,0,0.052621,4572,1,0,15,4458,20,0,224,3658,0
Reachability property LamportFastMutEx-COL-6-ReachabilityCardinality-2024-07 does not hold.
No reachable states exhibit your property : LamportFastMutEx-COL-6-ReachabilityCardinality-2024-07

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
LamportFastMutEx-COL-6-ReachabilityCardinality-2024-07,0,0.05285,4572,1,0,15,4458,20,0,224,3658,0
Reachability property LamportFastMutEx-COL-6-ReachabilityCardinality-2024-08 does not hold.
No reachable states exhibit your property : LamportFastMutEx-COL-6-ReachabilityCardinality-2024-08

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
LamportFastMutEx-COL-6-ReachabilityCardinality-2024-08,0,0.054419,4572,1,0,15,4458,20,0,245,3658,0
Reachability property LamportFastMutEx-COL-6-ReachabilityCardinality-2024-09 does not hold.
No reachable states exhibit your property : LamportFastMutEx-COL-6-ReachabilityCardinality-2024-09

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
LamportFastMutEx-COL-6-ReachabilityCardinality-2024-09,0,0.054638,4572,1,0,15,4458,20,0,245,3658,0
Invariant property LamportFastMutEx-COL-6-ReachabilityCardinality-2024-10 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
LamportFastMutEx-COL-6-ReachabilityCardinality-2024-10,1,0.05498,4572,2,16,15,4458,21,0,255,3658,0
Invariant property LamportFastMutEx-COL-6-ReachabilityCardinality-2024-11 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
LamportFastMutEx-COL-6-ReachabilityCardinality-2024-11,0,0.055981,4572,1,0,15,4458,21,0,260,3658,0
Reachability property LamportFastMutEx-COL-6-ReachabilityCardinality-2024-12 does not hold.
No reachable states exhibit your property : LamportFastMutEx-COL-6-ReachabilityCardinality-2024-12

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
LamportFastMutEx-COL-6-ReachabilityCardinality-2024-12,0,0.05627,4572,1,0,15,4458,21,0,260,3658,0
Invariant property LamportFastMutEx-COL-6-ReachabilityCardinality-2024-13 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
LamportFastMutEx-COL-6-ReachabilityCardinality-2024-13,0,0.057397,4572,1,0,15,4458,21,0,263,3658,0
Reachability property LamportFastMutEx-COL-6-ReachabilityCardinality-2024-14 does not hold.
No reachable states exhibit your property : LamportFastMutEx-COL-6-ReachabilityCardinality-2024-14

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
LamportFastMutEx-COL-6-ReachabilityCardinality-2024-14,0,0.057536,4572,1,0,15,4458,21,0,263,3658,0
Invariant property LamportFastMutEx-COL-6-ReachabilityCardinality-2024-15 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
LamportFastMutEx-COL-6-ReachabilityCardinality-2024-15,0,0.058345,4572,1,0,15,4458,21,0,263,3658,0
ITS tools runner thread asked to quit. Dying gracefully.
RANDOM walk for 40038 steps (8 resets) in 779 ms. (51 steps per ms) remains 12/15 properties
BEST_FIRST walk for 40004 steps (8 resets) in 592 ms. (67 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (8 resets) in 252 ms. (158 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 139 ms. (285 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 205 ms. (194 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (8 resets) in 186 ms. (213 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 666 ms. (59 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 67 ms. (588 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 101 ms. (392 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 91 ms. (434 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 122 ms. (325 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 79 ms. (500 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 77 ms. (512 steps per ms) remains 12/12 properties
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
[2024-05-24 15:25:45] [INFO ] Flatten gal took : 5 ms
[2024-05-24 15:25:45] [INFO ] Flatten gal took : 2 ms
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
[2024-05-24 15:25:45] [INFO ] Flatten gal took : 3 ms
[2024-05-24 15:25:45] [INFO ] Flatten gal took : 3 ms
[2024-05-24 15:25:45] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7145788705735065237.gal : 1 ms
[2024-05-24 15:25:45] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3338974601100967421.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.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality7145788705735065237.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3338974601100967421.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.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality3338974601100967421.prop.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 3 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,7,0.002162,3580,2,23,5,68,6,0,80,32,0
Total reachable state count : 7

ITS runner timed out or was interrupted.
FORMULA LamportFastMutEx-COL-6-ReachabilityCardinality-2024-00 TRUE TECHNIQUES CPN_APPROX
FORMULA LamportFastMutEx-COL-6-ReachabilityCardinality-2024-01 TRUE TECHNIQUES CPN_APPROX
FORMULA LamportFastMutEx-COL-6-ReachabilityCardinality-2024-02 TRUE TECHNIQUES CPN_APPROX
FORMULA LamportFastMutEx-COL-6-ReachabilityCardinality-2024-04 FALSE TECHNIQUES CPN_APPROX
FORMULA LamportFastMutEx-COL-6-ReachabilityCardinality-2024-06 FALSE TECHNIQUES CPN_APPROX
FORMULA LamportFastMutEx-COL-6-ReachabilityCardinality-2024-07 FALSE TECHNIQUES CPN_APPROX
FORMULA LamportFastMutEx-COL-6-ReachabilityCardinality-2024-08 FALSE TECHNIQUES CPN_APPROX
FORMULA LamportFastMutEx-COL-6-ReachabilityCardinality-2024-09 FALSE TECHNIQUES CPN_APPROX
FORMULA LamportFastMutEx-COL-6-ReachabilityCardinality-2024-11 TRUE TECHNIQUES CPN_APPROX
FORMULA LamportFastMutEx-COL-6-ReachabilityCardinality-2024-12 FALSE TECHNIQUES CPN_APPROX
FORMULA LamportFastMutEx-COL-6-ReachabilityCardinality-2024-13 TRUE TECHNIQUES CPN_APPROX
FORMULA LamportFastMutEx-COL-6-ReachabilityCardinality-2024-14 FALSE TECHNIQUES CPN_APPROX
FORMULA LamportFastMutEx-COL-6-ReachabilityCardinality-2024-15 TRUE TECHNIQUES CPN_APPROX
Domain [pid(7), pid(7)] of place P_wait breaks symmetries in sort pid
Symmetric sort wr.t. initial and guards and successors and join/free detected :P_bool
Arc [3:1*[$i, 1]] contains constants of sort P_bool
Transition T_setbi_2 : constants on arcs in [[3:1*[$i, 1]]] introduces in P_bool(2) partition with 1 elements that refines current partition to 2 subsets.
[2024-05-24 15:25:45] [INFO ] Unfolded HLPN to a Petri net with 217 places and 420 transitions 1834 arcs in 40 ms.
[2024-05-24 15:25:45] [INFO ] Unfolded 16 HLPN properties in 1 ms.
Deduced a syphon composed of 41 places in 1 ms
Reduce places removed 41 places and 66 transitions.
[2024-05-24 15:25:45] [INFO ] Flatten gal took : 69 ms
[2024-05-24 15:25:45] [INFO ] Flatten gal took : 38 ms
[2024-05-24 15:25:45] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17542945495522796747.gal : 20 ms
[2024-05-24 15:25:45] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15962732045211766334.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.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality17542945495522796747.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15962732045211766334.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.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
RANDOM walk for 40000 steps (8 resets) in 578 ms. (69 steps per ms) remains 1/3 properties
FORMULA LamportFastMutEx-COL-6-ReachabilityCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-COL-6-ReachabilityCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Loading property file /tmp/ReachabilityCardinality15962732045211766334.prop.
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :5 after 7
BEST_FIRST walk for 40003 steps (8 resets) in 404 ms. (98 steps per ms) remains 1/1 properties
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :7 after 9
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :9 after 64
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :64 after 101
SDD proceeding with computation,3 properties remain. new max is 128
SDD size :101 after 146
[2024-05-24 15:25:45] [INFO ] Flow matrix only has 264 transitions (discarded 90 similar events)
// Phase 1: matrix 264 rows 176 cols
SDD proceeding with computation,3 properties remain. new max is 256
SDD size :146 after 632
[2024-05-24 15:25:45] [INFO ] Computed 50 invariants in 20 ms
[2024-05-24 15:25:45] [INFO ] State equation strengthened by 72 read => feed constraints.
SDD proceeding with computation,3 properties remain. new max is 512
SDD size :632 after 1727
SDD proceeding with computation,3 properties remain. new max is 1024
SDD size :1727 after 2504
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 96/150 variables, 42/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/150 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 264/414 variables, 150/192 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Invariant property LamportFastMutEx-COL-6-ReachabilityCardinality-2024-05 does not hold.
Invariant property LamportFastMutEx-COL-6-ReachabilityCardinality-2024-03 does not hold.
SDD proceeding with computation,1 properties remain. new max is 1024
At refinement iteration 4 (INCLUDED_ONLY) 0/414 variables, 72/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
SDD size :2504 after 6265
At refinement iteration 5 (INCLUDED_ONLY) 0/414 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 26/440 variables, 26/290 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/440 variables, 8/298 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/440 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/440 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 440/440 variables, and 298 constraints, problems are : Problem set: 0 solved, 1 unsolved in 307 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 176/176 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 96/150 variables, 42/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/150 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 264/414 variables, 150/192 constraints. Problems are: Problem set: 0 solved, 1 unsolved
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :6265 after 30817
At refinement iteration 4 (INCLUDED_ONLY) 0/414 variables, 72/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/414 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 26/440 variables, 26/290 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/440 variables, 8/298 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/440 variables, 1/299 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 15:25:46] [INFO ] Deduced a trap composed of 20 places in 99 ms of which 8 ms to minimize.
[2024-05-24 15:25:46] [INFO ] Deduced a trap composed of 9 places in 85 ms of which 2 ms to minimize.
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :30817 after 41274
[2024-05-24 15:25:46] [INFO ] Deduced a trap composed of 10 places in 93 ms of which 2 ms to minimize.
[2024-05-24 15:25:46] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 1 ms to minimize.
[2024-05-24 15:25:46] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 1 ms to minimize.
[2024-05-24 15:25:46] [INFO ] Deduced a trap composed of 51 places in 62 ms of which 1 ms to minimize.
[2024-05-24 15:25:46] [INFO ] Deduced a trap composed of 12 places in 61 ms of which 1 ms to minimize.
[2024-05-24 15:25:46] [INFO ] Deduced a trap composed of 34 places in 64 ms of which 1 ms to minimize.
[2024-05-24 15:25:46] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 1 ms to minimize.
[2024-05-24 15:25:47] [INFO ] Deduced a trap composed of 9 places in 64 ms of which 1 ms to minimize.
[2024-05-24 15:25:47] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 1 ms to minimize.
[2024-05-24 15:25:47] [INFO ] Deduced a trap composed of 15 places in 72 ms of which 7 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/440 variables, 12/311 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/440 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/440 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 440/440 variables, and 311 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1363 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 176/176 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 12/12 constraints]
After SMT, in 1776ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 38 ms.
Support contains 54 out of 176 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 176/176 places, 354/354 transitions.
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 176 transition count 348
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 12 place count 170 transition count 348
Applied a total of 12 rules in 39 ms. Remains 170 /176 variables (removed 6) and now considering 348/354 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48 ms. Remains : 170/176 places, 348/354 transitions.
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :41274 after 77734
RANDOM walk for 40000 steps (8 resets) in 398 ms. (100 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 110 ms. (360 steps per ms) remains 1/1 properties
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :77734 after 653763
Interrupted probabilistic random walk after 1273493 steps, run timeout after 3001 ms. (steps per millisecond=424 ) properties seen :0 out of 1
Probabilistic random walk after 1273493 steps, saw 413448 distinct states, run finished after 3005 ms. (steps per millisecond=423 ) properties seen :0
[2024-05-24 15:25:50] [INFO ] Flow matrix only has 258 transitions (discarded 90 similar events)
// Phase 1: matrix 258 rows 170 cols
[2024-05-24 15:25:50] [INFO ] Computed 50 invariants in 15 ms
[2024-05-24 15:25:50] [INFO ] State equation strengthened by 72 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 90/144 variables, 42/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/144 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 258/402 variables, 144/186 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/402 variables, 72/258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/402 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 26/428 variables, 26/284 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/428 variables, 8/292 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/428 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/428 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 428/428 variables, and 292 constraints, problems are : Problem set: 0 solved, 1 unsolved in 134 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 170/170 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 90/144 variables, 42/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/144 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 258/402 variables, 144/186 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/402 variables, 72/258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/402 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 26/428 variables, 26/284 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/428 variables, 8/292 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/428 variables, 1/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 15:25:51] [INFO ] Deduced a trap composed of 10 places in 141 ms of which 8 ms to minimize.
[2024-05-24 15:25:51] [INFO ] Deduced a trap composed of 11 places in 87 ms of which 1 ms to minimize.
[2024-05-24 15:25:51] [INFO ] Deduced a trap composed of 10 places in 62 ms of which 2 ms to minimize.
[2024-05-24 15:25:51] [INFO ] Deduced a trap composed of 9 places in 69 ms of which 1 ms to minimize.
[2024-05-24 15:25:51] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 1 ms to minimize.
[2024-05-24 15:25:51] [INFO ] Deduced a trap composed of 9 places in 66 ms of which 0 ms to minimize.
[2024-05-24 15:25:51] [INFO ] Deduced a trap composed of 21 places in 60 ms of which 0 ms to minimize.
[2024-05-24 15:25:51] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 1 ms to minimize.
[2024-05-24 15:25:51] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 1 ms to minimize.
[2024-05-24 15:25:51] [INFO ] Deduced a trap composed of 8 places in 48 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/428 variables, 10/303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/428 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/428 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 428/428 variables, and 303 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1158 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 170/170 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 10/10 constraints]
After SMT, in 1328ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 29 ms.
Support contains 54 out of 170 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 348/348 transitions.
Applied a total of 0 rules in 14 ms. Remains 170 /170 variables (removed 0) and now considering 348/348 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 170/170 places, 348/348 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 348/348 transitions.
Applied a total of 0 rules in 13 ms. Remains 170 /170 variables (removed 0) and now considering 348/348 (removed 0) transitions.
[2024-05-24 15:25:51] [INFO ] Flow matrix only has 258 transitions (discarded 90 similar events)
[2024-05-24 15:25:51] [INFO ] Invariant cache hit.
[2024-05-24 15:25:52] [INFO ] Implicit Places using invariants in 159 ms returned [110, 111, 112, 113, 114, 115]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 166 ms to find 6 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 164/170 places, 348/348 transitions.
Applied a total of 0 rules in 11 ms. Remains 164 /164 variables (removed 0) and now considering 348/348 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 191 ms. Remains : 164/170 places, 348/348 transitions.
RANDOM walk for 40000 steps (8 resets) in 183 ms. (217 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 96 ms. (412 steps per ms) remains 1/1 properties
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :653763 after 1.23079e+06
Interrupted probabilistic random walk after 1287046 steps, run timeout after 3001 ms. (steps per millisecond=428 ) properties seen :0 out of 1
Probabilistic random walk after 1287046 steps, saw 420115 distinct states, run finished after 3001 ms. (steps per millisecond=428 ) properties seen :0
[2024-05-24 15:25:55] [INFO ] Flow matrix only has 258 transitions (discarded 90 similar events)
// Phase 1: matrix 258 rows 164 cols
[2024-05-24 15:25:55] [INFO ] Computed 44 invariants in 5 ms
[2024-05-24 15:25:55] [INFO ] State equation strengthened by 36 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 84/138 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/138 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 258/396 variables, 138/174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/396 variables, 36/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/396 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 26/422 variables, 26/236 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/422 variables, 8/244 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/422 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/422 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 422/422 variables, and 244 constraints, problems are : Problem set: 0 solved, 1 unsolved in 140 ms.
Refiners :[Positive P Invariants (semi-flows): 44/44 constraints, State Equation: 164/164 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 84/138 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/138 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 258/396 variables, 138/174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/396 variables, 36/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/396 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 26/422 variables, 26/236 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/422 variables, 8/244 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/422 variables, 1/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 15:25:55] [INFO ] Deduced a trap composed of 11 places in 61 ms of which 1 ms to minimize.
[2024-05-24 15:25:55] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 0 ms to minimize.
[2024-05-24 15:25:55] [INFO ] Deduced a trap composed of 11 places in 51 ms of which 1 ms to minimize.
[2024-05-24 15:25:55] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 0 ms to minimize.
[2024-05-24 15:25:55] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 1 ms to minimize.
[2024-05-24 15:25:55] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 1 ms to minimize.
[2024-05-24 15:25:56] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 1 ms to minimize.
[2024-05-24 15:25:56] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 1 ms to minimize.
[2024-05-24 15:25:56] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 1 ms to minimize.
[2024-05-24 15:25:56] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/422 variables, 10/255 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/422 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/422 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 422/422 variables, and 255 constraints, problems are : Problem set: 0 solved, 1 unsolved in 918 ms.
Refiners :[Positive P Invariants (semi-flows): 44/44 constraints, State Equation: 164/164 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 10/10 constraints]
After SMT, in 1088ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 29 ms.
Support contains 54 out of 164 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 164/164 places, 348/348 transitions.
Applied a total of 0 rules in 8 ms. Remains 164 /164 variables (removed 0) and now considering 348/348 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 164/164 places, 348/348 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 164/164 places, 348/348 transitions.
Applied a total of 0 rules in 7 ms. Remains 164 /164 variables (removed 0) and now considering 348/348 (removed 0) transitions.
[2024-05-24 15:25:56] [INFO ] Flow matrix only has 258 transitions (discarded 90 similar events)
[2024-05-24 15:25:56] [INFO ] Invariant cache hit.
[2024-05-24 15:25:56] [INFO ] Implicit Places using invariants in 106 ms returned []
[2024-05-24 15:25:56] [INFO ] Flow matrix only has 258 transitions (discarded 90 similar events)
[2024-05-24 15:25:56] [INFO ] Invariant cache hit.
[2024-05-24 15:25:56] [INFO ] State equation strengthened by 36 read => feed constraints.
[2024-05-24 15:25:56] [INFO ] Implicit Places using invariants and state equation in 183 ms returned []
Implicit Place search using SMT with State Equation took 292 ms to find 0 implicit places.
[2024-05-24 15:25:56] [INFO ] Redundant transitions in 18 ms returned []
Running 342 sub problems to find dead transitions.
[2024-05-24 15:25:56] [INFO ] Flow matrix only has 258 transitions (discarded 90 similar events)
[2024-05-24 15:25:56] [INFO ] Invariant cache hit.
[2024-05-24 15:25:56] [INFO ] State equation strengthened by 36 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/164 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 342 unsolved
[2024-05-24 15:25:57] [INFO ] Deduced a trap composed of 10 places in 69 ms of which 5 ms to minimize.
[2024-05-24 15:25:58] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 1 ms to minimize.
[2024-05-24 15:25:58] [INFO ] Deduced a trap composed of 18 places in 51 ms of which 1 ms to minimize.
[2024-05-24 15:25:58] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 1 ms to minimize.
Problem TDEAD6 is UNSAT
[2024-05-24 15:25:58] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 1 ms to minimize.
[2024-05-24 15:25:58] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 1 ms to minimize.
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
[2024-05-24 15:25:58] [INFO ] Deduced a trap composed of 23 places in 61 ms of which 2 ms to minimize.
[2024-05-24 15:25:58] [INFO ] Deduced a trap composed of 31 places in 77 ms of which 1 ms to minimize.
[2024-05-24 15:25:58] [INFO ] Deduced a trap composed of 25 places in 58 ms of which 1 ms to minimize.
[2024-05-24 15:25:58] [INFO ] Deduced a trap composed of 12 places in 55 ms of which 1 ms to minimize.
[2024-05-24 15:25:58] [INFO ] Deduced a trap composed of 26 places in 59 ms of which 2 ms to minimize.
[2024-05-24 15:25:58] [INFO ] Deduced a trap composed of 8 places in 77 ms of which 1 ms to minimize.
[2024-05-24 15:25:58] [INFO ] Deduced a trap composed of 9 places in 67 ms of which 1 ms to minimize.
Problem TDEAD9 is UNSAT
[2024-05-24 15:25:58] [INFO ] Deduced a trap composed of 15 places in 69 ms of which 2 ms to minimize.
[2024-05-24 15:25:58] [INFO ] Deduced a trap composed of 20 places in 63 ms of which 1 ms to minimize.
[2024-05-24 15:25:58] [INFO ] Deduced a trap composed of 20 places in 74 ms of which 1 ms to minimize.
[2024-05-24 15:25:58] [INFO ] Deduced a trap composed of 9 places in 19 ms of which 1 ms to minimize.
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
[2024-05-24 15:25:59] [INFO ] Deduced a trap composed of 25 places in 68 ms of which 2 ms to minimize.
[2024-05-24 15:25:59] [INFO ] Deduced a trap composed of 8 places in 71 ms of which 1 ms to minimize.
[2024-05-24 15:25:59] [INFO ] Deduced a trap composed of 8 places in 65 ms of which 2 ms to minimize.
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD194 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/164 variables, 20/64 constraints. Problems are: Problem set: 9 solved, 333 unsolved
[2024-05-24 15:25:59] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 0 ms to minimize.
[2024-05-24 15:25:59] [INFO ] Deduced a trap composed of 8 places in 53 ms of which 1 ms to minimize.
[2024-05-24 15:25:59] [INFO ] Deduced a trap composed of 8 places in 22 ms of which 1 ms to minimize.
[2024-05-24 15:25:59] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 1 ms to minimize.
[2024-05-24 15:25:59] [INFO ] Deduced a trap composed of 20 places in 59 ms of which 2 ms to minimize.
[2024-05-24 15:25:59] [INFO ] Deduced a trap composed of 8 places in 60 ms of which 1 ms to minimize.
[2024-05-24 15:25:59] [INFO ] Deduced a trap composed of 26 places in 62 ms of which 1 ms to minimize.
[2024-05-24 15:25:59] [INFO ] Deduced a trap composed of 25 places in 80 ms of which 1 ms to minimize.
[2024-05-24 15:25:59] [INFO ] Deduced a trap composed of 8 places in 20 ms of which 0 ms to minimize.
[2024-05-24 15:25:59] [INFO ] Deduced a trap composed of 25 places in 69 ms of which 1 ms to minimize.
[2024-05-24 15:26:00] [INFO ] Deduced a trap composed of 26 places in 67 ms of which 1 ms to minimize.
[2024-05-24 15:26:00] [INFO ] Deduced a trap composed of 20 places in 58 ms of which 1 ms to minimize.
[2024-05-24 15:26:00] [INFO ] Deduced a trap composed of 24 places in 63 ms of which 1 ms to minimize.
[2024-05-24 15:26:00] [INFO ] Deduced a trap composed of 29 places in 63 ms of which 1 ms to minimize.
[2024-05-24 15:26:00] [INFO ] Deduced a trap composed of 31 places in 62 ms of which 1 ms to minimize.
[2024-05-24 15:26:00] [INFO ] Deduced a trap composed of 18 places in 57 ms of which 1 ms to minimize.
[2024-05-24 15:26:00] [INFO ] Deduced a trap composed of 25 places in 66 ms of which 1 ms to minimize.
[2024-05-24 15:26:00] [INFO ] Deduced a trap composed of 23 places in 56 ms of which 1 ms to minimize.
[2024-05-24 15:26:00] [INFO ] Deduced a trap composed of 25 places in 47 ms of which 1 ms to minimize.
[2024-05-24 15:26:00] [INFO ] Deduced a trap composed of 13 places in 59 ms of which 1 ms to minimize.
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD196 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/164 variables, 20/84 constraints. Problems are: Problem set: 17 solved, 325 unsolved
[2024-05-24 15:26:00] [INFO ] Deduced a trap composed of 12 places in 73 ms of which 1 ms to minimize.
[2024-05-24 15:26:00] [INFO ] Deduced a trap composed of 25 places in 72 ms of which 1 ms to minimize.
[2024-05-24 15:26:01] [INFO ] Deduced a trap composed of 28 places in 55 ms of which 1 ms to minimize.
[2024-05-24 15:26:01] [INFO ] Deduced a trap composed of 12 places in 52 ms of which 1 ms to minimize.
[2024-05-24 15:26:01] [INFO ] Deduced a trap composed of 25 places in 55 ms of which 1 ms to minimize.
[2024-05-24 15:26:01] [INFO ] Deduced a trap composed of 33 places in 59 ms of which 1 ms to minimize.
[2024-05-24 15:26:01] [INFO ] Deduced a trap composed of 8 places in 52 ms of which 1 ms to minimize.
[2024-05-24 15:26:01] [INFO ] Deduced a trap composed of 16 places in 57 ms of which 1 ms to minimize.
[2024-05-24 15:26:01] [INFO ] Deduced a trap composed of 8 places in 59 ms of which 1 ms to minimize.
[2024-05-24 15:26:01] [INFO ] Deduced a trap composed of 17 places in 69 ms of which 1 ms to minimize.
[2024-05-24 15:26:01] [INFO ] Deduced a trap composed of 17 places in 52 ms of which 1 ms to minimize.
[2024-05-24 15:26:01] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 1 ms to minimize.
[2024-05-24 15:26:01] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 0 ms to minimize.
Problem TDEAD61 is UNSAT
[2024-05-24 15:26:01] [INFO ] Deduced a trap composed of 26 places in 60 ms of which 1 ms to minimize.
[2024-05-24 15:26:01] [INFO ] Deduced a trap composed of 35 places in 60 ms of which 1 ms to minimize.
[2024-05-24 15:26:01] [INFO ] Deduced a trap composed of 22 places in 60 ms of which 1 ms to minimize.
[2024-05-24 15:26:01] [INFO ] Deduced a trap composed of 19 places in 60 ms of which 1 ms to minimize.
[2024-05-24 15:26:01] [INFO ] Deduced a trap composed of 18 places in 63 ms of which 1 ms to minimize.
[2024-05-24 15:26:02] [INFO ] Deduced a trap composed of 29 places in 60 ms of which 1 ms to minimize.
[2024-05-24 15:26:02] [INFO ] Deduced a trap composed of 13 places in 58 ms of which 1 ms to minimize.
Problem TDEAD61 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD197 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/164 variables, 20/104 constraints. Problems are: Problem set: 27 solved, 315 unsolved
[2024-05-24 15:26:03] [INFO ] Deduced a trap composed of 22 places in 68 ms of which 1 ms to minimize.
SDD proceeding with computation,1 properties remain. new max is 65536
[2024-05-24 15:26:03] [INFO ] Deduced a trap composed of 20 places in 58 ms of which 1 ms to minimize.
SDD size :1.23079e+06 after 5.06705e+06
[2024-05-24 15:26:03] [INFO ] Deduced a trap composed of 12 places in 48 ms of which 0 ms to minimize.
[2024-05-24 15:26:03] [INFO ] Deduced a trap composed of 29 places in 62 ms of which 1 ms to minimize.
[2024-05-24 15:26:03] [INFO ] Deduced a trap composed of 17 places in 70 ms of which 1 ms to minimize.
[2024-05-24 15:26:03] [INFO ] Deduced a trap composed of 31 places in 66 ms of which 1 ms to minimize.
Problem TDEAD68 is UNSAT
[2024-05-24 15:26:03] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 0 ms to minimize.
[2024-05-24 15:26:03] [INFO ] Deduced a trap composed of 30 places in 66 ms of which 1 ms to minimize.
[2024-05-24 15:26:03] [INFO ] Deduced a trap composed of 33 places in 71 ms of which 1 ms to minimize.
[2024-05-24 15:26:03] [INFO ] Deduced a trap composed of 13 places in 55 ms of which 1 ms to minimize.
[2024-05-24 15:26:03] [INFO ] Deduced a trap composed of 30 places in 63 ms of which 1 ms to minimize.
[2024-05-24 15:26:04] [INFO ] Deduced a trap composed of 28 places in 70 ms of which 1 ms to minimize.
[2024-05-24 15:26:04] [INFO ] Deduced a trap composed of 21 places in 64 ms of which 1 ms to minimize.
[2024-05-24 15:26:04] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 1 ms to minimize.
[2024-05-24 15:26:04] [INFO ] Deduced a trap composed of 18 places in 52 ms of which 1 ms to minimize.
[2024-05-24 15:26:04] [INFO ] Deduced a trap composed of 40 places in 62 ms of which 2 ms to minimize.
[2024-05-24 15:26:04] [INFO ] Deduced a trap composed of 20 places in 55 ms of which 1 ms to minimize.
[2024-05-24 15:26:04] [INFO ] Deduced a trap composed of 30 places in 72 ms of which 1 ms to minimize.
[2024-05-24 15:26:04] [INFO ] Deduced a trap composed of 26 places in 69 ms of which 1 ms to minimize.
[2024-05-24 15:26:04] [INFO ] Deduced a trap composed of 25 places in 68 ms of which 1 ms to minimize.
Problem TDEAD68 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD193 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/164 variables, 20/124 constraints. Problems are: Problem set: 31 solved, 311 unsolved
[2024-05-24 15:26:04] [INFO ] Deduced a trap composed of 28 places in 72 ms of which 1 ms to minimize.
[2024-05-24 15:26:05] [INFO ] Deduced a trap composed of 27 places in 62 ms of which 1 ms to minimize.
[2024-05-24 15:26:05] [INFO ] Deduced a trap composed of 32 places in 60 ms of which 1 ms to minimize.
[2024-05-24 15:26:05] [INFO ] Deduced a trap composed of 12 places in 67 ms of which 1 ms to minimize.
[2024-05-24 15:26:05] [INFO ] Deduced a trap composed of 28 places in 65 ms of which 1 ms to minimize.
[2024-05-24 15:26:05] [INFO ] Deduced a trap composed of 23 places in 64 ms of which 1 ms to minimize.
[2024-05-24 15:26:05] [INFO ] Deduced a trap composed of 32 places in 63 ms of which 2 ms to minimize.
[2024-05-24 15:26:05] [INFO ] Deduced a trap composed of 39 places in 66 ms of which 1 ms to minimize.
[2024-05-24 15:26:05] [INFO ] Deduced a trap composed of 24 places in 65 ms of which 2 ms to minimize.
[2024-05-24 15:26:05] [INFO ] Deduced a trap composed of 30 places in 65 ms of which 1 ms to minimize.
[2024-05-24 15:26:05] [INFO ] Deduced a trap composed of 24 places in 63 ms of which 1 ms to minimize.
[2024-05-24 15:26:05] [INFO ] Deduced a trap composed of 26 places in 63 ms of which 1 ms to minimize.
[2024-05-24 15:26:05] [INFO ] Deduced a trap composed of 25 places in 63 ms of which 1 ms to minimize.
[2024-05-24 15:26:05] [INFO ] Deduced a trap composed of 25 places in 67 ms of which 1 ms to minimize.
[2024-05-24 15:26:06] [INFO ] Deduced a trap composed of 33 places in 64 ms of which 1 ms to minimize.
[2024-05-24 15:26:06] [INFO ] Deduced a trap composed of 23 places in 62 ms of which 1 ms to minimize.
[2024-05-24 15:26:06] [INFO ] Deduced a trap composed of 13 places in 60 ms of which 1 ms to minimize.
[2024-05-24 15:26:06] [INFO ] Deduced a trap composed of 36 places in 52 ms of which 1 ms to minimize.
[2024-05-24 15:26:06] [INFO ] Deduced a trap composed of 32 places in 46 ms of which 1 ms to minimize.
[2024-05-24 15:26:06] [INFO ] Deduced a trap composed of 31 places in 61 ms of which 1 ms to minimize.
Problem TDEAD54 is UNSAT
Problem TDEAD115 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/164 variables, 20/144 constraints. Problems are: Problem set: 33 solved, 309 unsolved
[2024-05-24 15:26:06] [INFO ] Deduced a trap composed of 25 places in 72 ms of which 1 ms to minimize.
[2024-05-24 15:26:06] [INFO ] Deduced a trap composed of 35 places in 71 ms of which 1 ms to minimize.
[2024-05-24 15:26:06] [INFO ] Deduced a trap composed of 20 places in 68 ms of which 2 ms to minimize.
[2024-05-24 15:26:07] [INFO ] Deduced a trap composed of 25 places in 65 ms of which 1 ms to minimize.
[2024-05-24 15:26:07] [INFO ] Deduced a trap composed of 24 places in 71 ms of which 1 ms to minimize.
[2024-05-24 15:26:07] [INFO ] Deduced a trap composed of 20 places in 62 ms of which 1 ms to minimize.
[2024-05-24 15:26:07] [INFO ] Deduced a trap composed of 20 places in 61 ms of which 1 ms to minimize.
[2024-05-24 15:26:07] [INFO ] Deduced a trap composed of 27 places in 57 ms of which 1 ms to minimize.
[2024-05-24 15:26:07] [INFO ] Deduced a trap composed of 30 places in 69 ms of which 1 ms to minimize.
[2024-05-24 15:26:07] [INFO ] Deduced a trap composed of 18 places in 60 ms of which 2 ms to minimize.
[2024-05-24 15:26:07] [INFO ] Deduced a trap composed of 21 places in 63 ms of which 1 ms to minimize.
[2024-05-24 15:26:07] [INFO ] Deduced a trap composed of 12 places in 58 ms of which 1 ms to minimize.
Problem TDEAD75 is UNSAT
[2024-05-24 15:26:07] [INFO ] Deduced a trap composed of 25 places in 66 ms of which 2 ms to minimize.
[2024-05-24 15:26:07] [INFO ] Deduced a trap composed of 36 places in 67 ms of which 1 ms to minimize.
[2024-05-24 15:26:07] [INFO ] Deduced a trap composed of 26 places in 63 ms of which 1 ms to minimize.
[2024-05-24 15:26:08] [INFO ] Deduced a trap composed of 34 places in 66 ms of which 1 ms to minimize.
[2024-05-24 15:26:08] [INFO ] Deduced a trap composed of 32 places in 60 ms of which 1 ms to minimize.
[2024-05-24 15:26:08] [INFO ] Deduced a trap composed of 16 places in 68 ms of which 1 ms to minimize.
[2024-05-24 15:26:08] [INFO ] Deduced a trap composed of 15 places in 67 ms of which 1 ms to minimize.
Problem TDEAD139 is UNSAT
[2024-05-24 15:26:08] [INFO ] Deduced a trap composed of 20 places in 68 ms of which 1 ms to minimize.
Problem TDEAD75 is UNSAT
Problem TDEAD139 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/164 variables, 20/164 constraints. Problems are: Problem set: 35 solved, 307 unsolved
[2024-05-24 15:26:09] [INFO ] Deduced a trap composed of 26 places in 66 ms of which 1 ms to minimize.
[2024-05-24 15:26:09] [INFO ] Deduced a trap composed of 36 places in 65 ms of which 1 ms to minimize.
[2024-05-24 15:26:09] [INFO ] Deduced a trap composed of 24 places in 64 ms of which 1 ms to minimize.
[2024-05-24 15:26:10] [INFO ] Deduced a trap composed of 32 places in 67 ms of which 1 ms to minimize.
[2024-05-24 15:26:10] [INFO ] Deduced a trap composed of 18 places in 57 ms of which 1 ms to minimize.
[2024-05-24 15:26:10] [INFO ] Deduced a trap composed of 16 places in 58 ms of which 1 ms to minimize.
[2024-05-24 15:26:10] [INFO ] Deduced a trap composed of 19 places in 56 ms of which 1 ms to minimize.
[2024-05-24 15:26:10] [INFO ] Deduced a trap composed of 22 places in 63 ms of which 1 ms to minimize.
[2024-05-24 15:26:10] [INFO ] Deduced a trap composed of 17 places in 61 ms of which 1 ms to minimize.
[2024-05-24 15:26:10] [INFO ] Deduced a trap composed of 19 places in 66 ms of which 1 ms to minimize.
[2024-05-24 15:26:10] [INFO ] Deduced a trap composed of 22 places in 62 ms of which 1 ms to minimize.
[2024-05-24 15:26:10] [INFO ] Deduced a trap composed of 27 places in 62 ms of which 1 ms to minimize.
[2024-05-24 15:26:10] [INFO ] Deduced a trap composed of 24 places in 56 ms of which 1 ms to minimize.
[2024-05-24 15:26:10] [INFO ] Deduced a trap composed of 25 places in 60 ms of which 1 ms to minimize.
[2024-05-24 15:26:10] [INFO ] Deduced a trap composed of 22 places in 59 ms of which 1 ms to minimize.
[2024-05-24 15:26:11] [INFO ] Deduced a trap composed of 23 places in 58 ms of which 1 ms to minimize.
[2024-05-24 15:26:11] [INFO ] Deduced a trap composed of 22 places in 61 ms of which 1 ms to minimize.
[2024-05-24 15:26:11] [INFO ] Deduced a trap composed of 22 places in 64 ms of which 1 ms to minimize.
[2024-05-24 15:26:11] [INFO ] Deduced a trap composed of 22 places in 64 ms of which 1 ms to minimize.
[2024-05-24 15:26:11] [INFO ] Deduced a trap composed of 22 places in 62 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/164 variables, 20/184 constraints. Problems are: Problem set: 35 solved, 307 unsolved
[2024-05-24 15:26:11] [INFO ] Deduced a trap composed of 16 places in 61 ms of which 1 ms to minimize.
[2024-05-24 15:26:12] [INFO ] Deduced a trap composed of 28 places in 65 ms of which 1 ms to minimize.
[2024-05-24 15:26:12] [INFO ] Deduced a trap composed of 24 places in 57 ms of which 1 ms to minimize.
[2024-05-24 15:26:12] [INFO ] Deduced a trap composed of 22 places in 60 ms of which 1 ms to minimize.
[2024-05-24 15:26:12] [INFO ] Deduced a trap composed of 27 places in 62 ms of which 1 ms to minimize.
[2024-05-24 15:26:12] [INFO ] Deduced a trap composed of 41 places in 63 ms of which 1 ms to minimize.
[2024-05-24 15:26:12] [INFO ] Deduced a trap composed of 8 places in 37 ms of which 0 ms to minimize.
Problem TDEAD156 is UNSAT
[2024-05-24 15:26:12] [INFO ] Deduced a trap composed of 36 places in 61 ms of which 1 ms to minimize.
[2024-05-24 15:26:12] [INFO ] Deduced a trap composed of 36 places in 65 ms of which 1 ms to minimize.
[2024-05-24 15:26:12] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 1 ms to minimize.
[2024-05-24 15:26:12] [INFO ] Deduced a trap composed of 17 places in 59 ms of which 1 ms to minimize.
[2024-05-24 15:26:12] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 1 ms to minimize.
[2024-05-24 15:26:12] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 1 ms to minimize.
[2024-05-24 15:26:13] [INFO ] Deduced a trap composed of 24 places in 56 ms of which 1 ms to minimize.
[2024-05-24 15:26:13] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 1 ms to minimize.
[2024-05-24 15:26:13] [INFO ] Deduced a trap composed of 46 places in 54 ms of which 1 ms to minimize.
[2024-05-24 15:26:13] [INFO ] Deduced a trap composed of 23 places in 70 ms of which 1 ms to minimize.
[2024-05-24 15:26:13] [INFO ] Deduced a trap composed of 37 places in 58 ms of which 1 ms to minimize.
[2024-05-24 15:26:13] [INFO ] Deduced a trap composed of 43 places in 60 ms of which 1 ms to minimize.
[2024-05-24 15:26:13] [INFO ] Deduced a trap composed of 37 places in 55 ms of which 1 ms to minimize.
Problem TDEAD156 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/164 variables, 20/204 constraints. Problems are: Problem set: 36 solved, 306 unsolved
[2024-05-24 15:26:13] [INFO ] Deduced a trap composed of 26 places in 77 ms of which 1 ms to minimize.
[2024-05-24 15:26:14] [INFO ] Deduced a trap composed of 37 places in 65 ms of which 1 ms to minimize.
[2024-05-24 15:26:14] [INFO ] Deduced a trap composed of 42 places in 70 ms of which 1 ms to minimize.
[2024-05-24 15:26:14] [INFO ] Deduced a trap composed of 43 places in 65 ms of which 1 ms to minimize.
[2024-05-24 15:26:14] [INFO ] Deduced a trap composed of 32 places in 68 ms of which 2 ms to minimize.
[2024-05-24 15:26:14] [INFO ] Deduced a trap composed of 23 places in 64 ms of which 1 ms to minimize.
[2024-05-24 15:26:14] [INFO ] Deduced a trap composed of 29 places in 74 ms of which 1 ms to minimize.
[2024-05-24 15:26:14] [INFO ] Deduced a trap composed of 20 places in 49 ms of which 1 ms to minimize.
[2024-05-24 15:26:14] [INFO ] Deduced a trap composed of 24 places in 56 ms of which 1 ms to minimize.
[2024-05-24 15:26:15] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 1 ms to minimize.
[2024-05-24 15:26:15] [INFO ] Deduced a trap composed of 28 places in 70 ms of which 2 ms to minimize.
[2024-05-24 15:26:15] [INFO ] Deduced a trap composed of 30 places in 59 ms of which 1 ms to minimize.
[2024-05-24 15:26:15] [INFO ] Deduced a trap composed of 28 places in 56 ms of which 1 ms to minimize.
[2024-05-24 15:26:15] [INFO ] Deduced a trap composed of 27 places in 48 ms of which 1 ms to minimize.
[2024-05-24 15:26:15] [INFO ] Deduced a trap composed of 23 places in 56 ms of which 1 ms to minimize.
[2024-05-24 15:26:15] [INFO ] Deduced a trap composed of 27 places in 58 ms of which 1 ms to minimize.
[2024-05-24 15:26:15] [INFO ] Deduced a trap composed of 20 places in 58 ms of which 1 ms to minimize.
[2024-05-24 15:26:15] [INFO ] Deduced a trap composed of 23 places in 52 ms of which 1 ms to minimize.
[2024-05-24 15:26:15] [INFO ] Deduced a trap composed of 24 places in 66 ms of which 1 ms to minimize.
[2024-05-24 15:26:15] [INFO ] Deduced a trap composed of 27 places in 60 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/164 variables, 20/224 constraints. Problems are: Problem set: 36 solved, 306 unsolved
[2024-05-24 15:26:17] [INFO ] Deduced a trap composed of 23 places in 63 ms of which 1 ms to minimize.
[2024-05-24 15:26:17] [INFO ] Deduced a trap composed of 33 places in 57 ms of which 0 ms to minimize.
[2024-05-24 15:26:17] [INFO ] Deduced a trap composed of 32 places in 53 ms of which 1 ms to minimize.
[2024-05-24 15:26:18] [INFO ] Deduced a trap composed of 36 places in 69 ms of which 3 ms to minimize.
[2024-05-24 15:26:18] [INFO ] Deduced a trap composed of 45 places in 73 ms of which 1 ms to minimize.
[2024-05-24 15:26:18] [INFO ] Deduced a trap composed of 37 places in 62 ms of which 1 ms to minimize.
[2024-05-24 15:26:18] [INFO ] Deduced a trap composed of 41 places in 63 ms of which 1 ms to minimize.
[2024-05-24 15:26:18] [INFO ] Deduced a trap composed of 25 places in 72 ms of which 1 ms to minimize.
[2024-05-24 15:26:18] [INFO ] Deduced a trap composed of 23 places in 61 ms of which 1 ms to minimize.
[2024-05-24 15:26:18] [INFO ] Deduced a trap composed of 26 places in 69 ms of which 2 ms to minimize.
[2024-05-24 15:26:18] [INFO ] Deduced a trap composed of 31 places in 62 ms of which 1 ms to minimize.
[2024-05-24 15:26:18] [INFO ] Deduced a trap composed of 24 places in 67 ms of which 1 ms to minimize.
[2024-05-24 15:26:18] [INFO ] Deduced a trap composed of 23 places in 63 ms of which 1 ms to minimize.
[2024-05-24 15:26:18] [INFO ] Deduced a trap composed of 28 places in 64 ms of which 1 ms to minimize.
[2024-05-24 15:26:19] [INFO ] Deduced a trap composed of 20 places in 64 ms of which 1 ms to minimize.
[2024-05-24 15:26:19] [INFO ] Deduced a trap composed of 28 places in 65 ms of which 1 ms to minimize.
[2024-05-24 15:26:19] [INFO ] Deduced a trap composed of 21 places in 51 ms of which 1 ms to minimize.
[2024-05-24 15:26:19] [INFO ] Deduced a trap composed of 24 places in 59 ms of which 1 ms to minimize.
[2024-05-24 15:26:19] [INFO ] Deduced a trap composed of 39 places in 73 ms of which 1 ms to minimize.
[2024-05-24 15:26:19] [INFO ] Deduced a trap composed of 40 places in 56 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/164 variables, 20/244 constraints. Problems are: Problem set: 36 solved, 306 unsolved
[2024-05-24 15:26:20] [INFO ] Deduced a trap composed of 19 places in 68 ms of which 1 ms to minimize.
[2024-05-24 15:26:20] [INFO ] Deduced a trap composed of 21 places in 76 ms of which 1 ms to minimize.
[2024-05-24 15:26:20] [INFO ] Deduced a trap composed of 37 places in 66 ms of which 1 ms to minimize.
[2024-05-24 15:26:20] [INFO ] Deduced a trap composed of 31 places in 78 ms of which 1 ms to minimize.
[2024-05-24 15:26:20] [INFO ] Deduced a trap composed of 24 places in 64 ms of which 1 ms to minimize.
[2024-05-24 15:26:21] [INFO ] Deduced a trap composed of 29 places in 65 ms of which 1 ms to minimize.
[2024-05-24 15:26:21] [INFO ] Deduced a trap composed of 29 places in 62 ms of which 1 ms to minimize.
[2024-05-24 15:26:21] [INFO ] Deduced a trap composed of 40 places in 55 ms of which 1 ms to minimize.
[2024-05-24 15:26:21] [INFO ] Deduced a trap composed of 36 places in 64 ms of which 1 ms to minimize.
[2024-05-24 15:26:21] [INFO ] Deduced a trap composed of 24 places in 63 ms of which 1 ms to minimize.
[2024-05-24 15:26:21] [INFO ] Deduced a trap composed of 27 places in 62 ms of which 1 ms to minimize.
[2024-05-24 15:26:21] [INFO ] Deduced a trap composed of 38 places in 65 ms of which 1 ms to minimize.
[2024-05-24 15:26:21] [INFO ] Deduced a trap composed of 26 places in 80 ms of which 1 ms to minimize.
[2024-05-24 15:26:21] [INFO ] Deduced a trap composed of 45 places in 66 ms of which 1 ms to minimize.
[2024-05-24 15:26:21] [INFO ] Deduced a trap composed of 38 places in 59 ms of which 2 ms to minimize.
[2024-05-24 15:26:21] [INFO ] Deduced a trap composed of 28 places in 65 ms of which 1 ms to minimize.
[2024-05-24 15:26:21] [INFO ] Deduced a trap composed of 32 places in 68 ms of which 3 ms to minimize.
[2024-05-24 15:26:21] [INFO ] Deduced a trap composed of 26 places in 58 ms of which 1 ms to minimize.
[2024-05-24 15:26:22] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 1 ms to minimize.
[2024-05-24 15:26:22] [INFO ] Deduced a trap composed of 30 places in 61 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/164 variables, 20/264 constraints. Problems are: Problem set: 36 solved, 306 unsolved
SDD proceeding with computation,1 properties remain. new max is 131072
SDD size :5.06705e+06 after 4.49801e+07
[2024-05-24 15:26:22] [INFO ] Deduced a trap composed of 22 places in 70 ms of which 1 ms to minimize.
[2024-05-24 15:26:22] [INFO ] Deduced a trap composed of 24 places in 59 ms of which 1 ms to minimize.
[2024-05-24 15:26:23] [INFO ] Deduced a trap composed of 46 places in 68 ms of which 2 ms to minimize.
[2024-05-24 15:26:23] [INFO ] Deduced a trap composed of 24 places in 71 ms of which 4 ms to minimize.
[2024-05-24 15:26:23] [INFO ] Deduced a trap composed of 29 places in 60 ms of which 2 ms to minimize.
[2024-05-24 15:26:23] [INFO ] Deduced a trap composed of 46 places in 66 ms of which 1 ms to minimize.
[2024-05-24 15:26:23] [INFO ] Deduced a trap composed of 28 places in 66 ms of which 1 ms to minimize.
[2024-05-24 15:26:23] [INFO ] Deduced a trap composed of 26 places in 66 ms of which 1 ms to minimize.
[2024-05-24 15:26:24] [INFO ] Deduced a trap composed of 40 places in 62 ms of which 1 ms to minimize.
[2024-05-24 15:26:24] [INFO ] Deduced a trap composed of 28 places in 72 ms of which 2 ms to minimize.
[2024-05-24 15:26:24] [INFO ] Deduced a trap composed of 29 places in 63 ms of which 1 ms to minimize.
[2024-05-24 15:26:24] [INFO ] Deduced a trap composed of 28 places in 60 ms of which 1 ms to minimize.
[2024-05-24 15:26:24] [INFO ] Deduced a trap composed of 40 places in 54 ms of which 1 ms to minimize.
[2024-05-24 15:26:24] [INFO ] Deduced a trap composed of 28 places in 60 ms of which 1 ms to minimize.
[2024-05-24 15:26:24] [INFO ] Deduced a trap composed of 29 places in 67 ms of which 1 ms to minimize.
[2024-05-24 15:26:24] [INFO ] Deduced a trap composed of 33 places in 55 ms of which 1 ms to minimize.
[2024-05-24 15:26:24] [INFO ] Deduced a trap composed of 23 places in 57 ms of which 1 ms to minimize.
[2024-05-24 15:26:24] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 1 ms to minimize.
[2024-05-24 15:26:24] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 1 ms to minimize.
[2024-05-24 15:26:25] [INFO ] Deduced a trap composed of 28 places in 56 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/164 variables, 20/284 constraints. Problems are: Problem set: 36 solved, 306 unsolved
[2024-05-24 15:26:26] [INFO ] Deduced a trap composed of 23 places in 75 ms of which 1 ms to minimize.
[2024-05-24 15:26:26] [INFO ] Deduced a trap composed of 23 places in 67 ms of which 1 ms to minimize.
[2024-05-24 15:26:26] [INFO ] Deduced a trap composed of 38 places in 64 ms of which 1 ms to minimize.
SMT process timed out in 30205ms, After SMT, problems are : Problem set: 36 solved, 306 unsolved
Search for dead transitions found 36 dead transitions in 30210ms
Found 36 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 36 transitions
Dead transitions reduction (with SMT) removed 36 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 164/164 places, 312/348 transitions.
Applied a total of 0 rules in 16 ms. Remains 164 /164 variables (removed 0) and now considering 312/312 (removed 0) transitions.
[2024-05-24 15:26:26] [INFO ] Redundant transitions in 4 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 30569 ms. Remains : 164/164 places, 312/348 transitions.
RANDOM walk for 40000 steps (8 resets) in 159 ms. (250 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 97 ms. (408 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1421784 steps, run timeout after 3001 ms. (steps per millisecond=473 ) properties seen :0 out of 1
Probabilistic random walk after 1421784 steps, saw 454921 distinct states, run finished after 3001 ms. (steps per millisecond=473 ) properties seen :0
[2024-05-24 15:26:29] [INFO ] Flow matrix only has 234 transitions (discarded 78 similar events)
// Phase 1: matrix 234 rows 164 cols
[2024-05-24 15:26:29] [INFO ] Computed 44 invariants in 4 ms
[2024-05-24 15:26:29] [INFO ] State equation strengthened by 30 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 84/138 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/138 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 234/372 variables, 138/174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/372 variables, 30/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/372 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 26/398 variables, 26/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/398 variables, 8/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/398 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/398 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 398/398 variables, and 238 constraints, problems are : Problem set: 0 solved, 1 unsolved in 108 ms.
Refiners :[Positive P Invariants (semi-flows): 44/44 constraints, State Equation: 164/164 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 84/138 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/138 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 234/372 variables, 138/174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/372 variables, 30/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/372 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 26/398 variables, 26/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/398 variables, 8/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/398 variables, 1/239 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 15:26:30] [INFO ] Deduced a trap composed of 9 places in 69 ms of which 1 ms to minimize.
[2024-05-24 15:26:30] [INFO ] Deduced a trap composed of 11 places in 66 ms of which 1 ms to minimize.
[2024-05-24 15:26:30] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 1 ms to minimize.
[2024-05-24 15:26:30] [INFO ] Deduced a trap composed of 20 places in 62 ms of which 1 ms to minimize.
[2024-05-24 15:26:30] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 1 ms to minimize.
[2024-05-24 15:26:30] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 0 ms to minimize.
[2024-05-24 15:26:30] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 1 ms to minimize.
[2024-05-24 15:26:30] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 1 ms to minimize.
[2024-05-24 15:26:30] [INFO ] Deduced a trap composed of 18 places in 48 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/398 variables, 9/248 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/398 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/398 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 398/398 variables, and 248 constraints, problems are : Problem set: 0 solved, 1 unsolved in 827 ms.
Refiners :[Positive P Invariants (semi-flows): 44/44 constraints, State Equation: 164/164 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 9/9 constraints]
After SMT, in 953ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 28 ms.
Support contains 54 out of 164 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 164/164 places, 312/312 transitions.
Applied a total of 0 rules in 10 ms. Remains 164 /164 variables (removed 0) and now considering 312/312 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 164/164 places, 312/312 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 164/164 places, 312/312 transitions.
Applied a total of 0 rules in 6 ms. Remains 164 /164 variables (removed 0) and now considering 312/312 (removed 0) transitions.
[2024-05-24 15:26:30] [INFO ] Flow matrix only has 234 transitions (discarded 78 similar events)
[2024-05-24 15:26:30] [INFO ] Invariant cache hit.
[2024-05-24 15:26:31] [INFO ] Implicit Places using invariants in 111 ms returned []
[2024-05-24 15:26:31] [INFO ] Flow matrix only has 234 transitions (discarded 78 similar events)
[2024-05-24 15:26:31] [INFO ] Invariant cache hit.
[2024-05-24 15:26:31] [INFO ] State equation strengthened by 30 read => feed constraints.
[2024-05-24 15:26:31] [INFO ] Implicit Places using invariants and state equation in 189 ms returned []
Implicit Place search using SMT with State Equation took 304 ms to find 0 implicit places.
[2024-05-24 15:26:31] [INFO ] Redundant transitions in 5 ms returned []
Running 306 sub problems to find dead transitions.
[2024-05-24 15:26:31] [INFO ] Flow matrix only has 234 transitions (discarded 78 similar events)
[2024-05-24 15:26:31] [INFO ] Invariant cache hit.
[2024-05-24 15:26:31] [INFO ] State equation strengthened by 30 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/158 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/158 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 2 (OVERLAPS) 6/164 variables, 36/44 constraints. Problems are: Problem set: 0 solved, 306 unsolved
[2024-05-24 15:26:33] [INFO ] Deduced a trap composed of 9 places in 65 ms of which 1 ms to minimize.
[2024-05-24 15:26:33] [INFO ] Deduced a trap composed of 10 places in 50 ms of which 1 ms to minimize.
[2024-05-24 15:26:33] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 1 ms to minimize.
[2024-05-24 15:26:33] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 1 ms to minimize.
[2024-05-24 15:26:33] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 1 ms to minimize.
[2024-05-24 15:26:33] [INFO ] Deduced a trap composed of 8 places in 51 ms of which 1 ms to minimize.
[2024-05-24 15:26:33] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 1 ms to minimize.
[2024-05-24 15:26:33] [INFO ] Deduced a trap composed of 12 places in 54 ms of which 1 ms to minimize.
[2024-05-24 15:26:33] [INFO ] Deduced a trap composed of 8 places in 56 ms of which 1 ms to minimize.
[2024-05-24 15:26:33] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 1 ms to minimize.
[2024-05-24 15:26:33] [INFO ] Deduced a trap composed of 27 places in 60 ms of which 1 ms to minimize.
[2024-05-24 15:26:33] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 1 ms to minimize.
[2024-05-24 15:26:33] [INFO ] Deduced a trap composed of 8 places in 34 ms of which 1 ms to minimize.
[2024-05-24 15:26:34] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 0 ms to minimize.
[2024-05-24 15:26:34] [INFO ] Deduced a trap composed of 10 places in 55 ms of which 1 ms to minimize.
[2024-05-24 15:26:34] [INFO ] Deduced a trap composed of 13 places in 63 ms of which 1 ms to minimize.
[2024-05-24 15:26:34] [INFO ] Deduced a trap composed of 14 places in 24 ms of which 0 ms to minimize.
[2024-05-24 15:26:34] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 0 ms to minimize.
[2024-05-24 15:26:34] [INFO ] Deduced a trap composed of 35 places in 54 ms of which 1 ms to minimize.
[2024-05-24 15:26:34] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/164 variables, 20/64 constraints. Problems are: Problem set: 0 solved, 306 unsolved
[2024-05-24 15:26:35] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 1 ms to minimize.
[2024-05-24 15:26:35] [INFO ] Deduced a trap composed of 10 places in 56 ms of which 1 ms to minimize.
[2024-05-24 15:26:35] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 0 ms to minimize.
[2024-05-24 15:26:35] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 0 ms to minimize.
[2024-05-24 15:26:35] [INFO ] Deduced a trap composed of 21 places in 58 ms of which 1 ms to minimize.
[2024-05-24 15:26:35] [INFO ] Deduced a trap composed of 12 places in 59 ms of which 1 ms to minimize.
[2024-05-24 15:26:35] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 1 ms to minimize.
[2024-05-24 15:26:35] [INFO ] Deduced a trap composed of 25 places in 60 ms of which 1 ms to minimize.
[2024-05-24 15:26:35] [INFO ] Deduced a trap composed of 24 places in 71 ms of which 1 ms to minimize.
[2024-05-24 15:26:35] [INFO ] Deduced a trap composed of 25 places in 59 ms of which 1 ms to minimize.
[2024-05-24 15:26:35] [INFO ] Deduced a trap composed of 8 places in 22 ms of which 0 ms to minimize.
[2024-05-24 15:26:35] [INFO ] Deduced a trap composed of 26 places in 62 ms of which 1 ms to minimize.
[2024-05-24 15:26:36] [INFO ] Deduced a trap composed of 13 places in 62 ms of which 1 ms to minimize.
[2024-05-24 15:26:36] [INFO ] Deduced a trap composed of 32 places in 62 ms of which 1 ms to minimize.
[2024-05-24 15:26:36] [INFO ] Deduced a trap composed of 28 places in 60 ms of which 1 ms to minimize.
[2024-05-24 15:26:36] [INFO ] Deduced a trap composed of 25 places in 59 ms of which 1 ms to minimize.
[2024-05-24 15:26:36] [INFO ] Deduced a trap composed of 24 places in 63 ms of which 1 ms to minimize.
[2024-05-24 15:26:36] [INFO ] Deduced a trap composed of 25 places in 58 ms of which 1 ms to minimize.
[2024-05-24 15:26:36] [INFO ] Deduced a trap composed of 26 places in 61 ms of which 1 ms to minimize.
[2024-05-24 15:26:36] [INFO ] Deduced a trap composed of 12 places in 60 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/164 variables, 20/84 constraints. Problems are: Problem set: 0 solved, 306 unsolved
[2024-05-24 15:26:36] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 1 ms to minimize.
[2024-05-24 15:26:36] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 1 ms to minimize.
[2024-05-24 15:26:36] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 0 ms to minimize.
[2024-05-24 15:26:36] [INFO ] Deduced a trap composed of 28 places in 68 ms of which 1 ms to minimize.
[2024-05-24 15:26:37] [INFO ] Deduced a trap composed of 31 places in 60 ms of which 1 ms to minimize.
[2024-05-24 15:26:37] [INFO ] Deduced a trap composed of 25 places in 58 ms of which 1 ms to minimize.
[2024-05-24 15:26:37] [INFO ] Deduced a trap composed of 20 places in 63 ms of which 1 ms to minimize.
[2024-05-24 15:26:37] [INFO ] Deduced a trap composed of 28 places in 59 ms of which 1 ms to minimize.
[2024-05-24 15:26:37] [INFO ] Deduced a trap composed of 19 places in 65 ms of which 1 ms to minimize.
[2024-05-24 15:26:37] [INFO ] Deduced a trap composed of 19 places in 60 ms of which 1 ms to minimize.
[2024-05-24 15:26:37] [INFO ] Deduced a trap composed of 8 places in 62 ms of which 1 ms to minimize.
[2024-05-24 15:26:37] [INFO ] Deduced a trap composed of 23 places in 61 ms of which 1 ms to minimize.
[2024-05-24 15:26:37] [INFO ] Deduced a trap composed of 13 places in 59 ms of which 1 ms to minimize.
[2024-05-24 15:26:37] [INFO ] Deduced a trap composed of 12 places in 50 ms of which 1 ms to minimize.
[2024-05-24 15:26:37] [INFO ] Deduced a trap composed of 27 places in 61 ms of which 1 ms to minimize.
[2024-05-24 15:26:37] [INFO ] Deduced a trap composed of 26 places in 57 ms of which 1 ms to minimize.
[2024-05-24 15:26:37] [INFO ] Deduced a trap composed of 27 places in 60 ms of which 1 ms to minimize.
[2024-05-24 15:26:37] [INFO ] Deduced a trap composed of 29 places in 63 ms of which 1 ms to minimize.
[2024-05-24 15:26:37] [INFO ] Deduced a trap composed of 25 places in 62 ms of which 1 ms to minimize.
[2024-05-24 15:26:38] [INFO ] Deduced a trap composed of 27 places in 60 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/164 variables, 20/104 constraints. Problems are: Problem set: 0 solved, 306 unsolved
[2024-05-24 15:26:38] [INFO ] Deduced a trap composed of 22 places in 66 ms of which 1 ms to minimize.
[2024-05-24 15:26:38] [INFO ] Deduced a trap composed of 16 places in 58 ms of which 1 ms to minimize.
[2024-05-24 15:26:38] [INFO ] Deduced a trap composed of 36 places in 68 ms of which 1 ms to minimize.
[2024-05-24 15:26:38] [INFO ] Deduced a trap composed of 34 places in 62 ms of which 1 ms to minimize.
[2024-05-24 15:26:38] [INFO ] Deduced a trap composed of 35 places in 55 ms of which 1 ms to minimize.
[2024-05-24 15:26:38] [INFO ] Deduced a trap composed of 34 places in 56 ms of which 0 ms to minimize.
[2024-05-24 15:26:38] [INFO ] Deduced a trap composed of 35 places in 37 ms of which 0 ms to minimize.
[2024-05-24 15:26:38] [INFO ] Deduced a trap composed of 32 places in 44 ms of which 1 ms to minimize.
[2024-05-24 15:26:38] [INFO ] Deduced a trap composed of 33 places in 44 ms of which 1 ms to minimize.
[2024-05-24 15:26:38] [INFO ] Deduced a trap composed of 8 places in 51 ms of which 1 ms to minimize.
[2024-05-24 15:26:39] [INFO ] Deduced a trap composed of 22 places in 54 ms of which 1 ms to minimize.
[2024-05-24 15:26:39] [INFO ] Deduced a trap composed of 12 places in 61 ms of which 1 ms to minimize.
[2024-05-24 15:26:39] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 1 ms to minimize.
[2024-05-24 15:26:39] [INFO ] Deduced a trap composed of 9 places in 59 ms of which 1 ms to minimize.
[2024-05-24 15:26:39] [INFO ] Deduced a trap composed of 18 places in 58 ms of which 1 ms to minimize.
[2024-05-24 15:26:39] [INFO ] Deduced a trap composed of 16 places in 55 ms of which 1 ms to minimize.
[2024-05-24 15:26:39] [INFO ] Deduced a trap composed of 21 places in 58 ms of which 1 ms to minimize.
[2024-05-24 15:26:39] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 1 ms to minimize.
[2024-05-24 15:26:39] [INFO ] Deduced a trap composed of 18 places in 59 ms of which 1 ms to minimize.
[2024-05-24 15:26:39] [INFO ] Deduced a trap composed of 18 places in 73 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/164 variables, 20/124 constraints. Problems are: Problem set: 0 solved, 306 unsolved
[2024-05-24 15:26:40] [INFO ] Deduced a trap composed of 22 places in 69 ms of which 1 ms to minimize.
[2024-05-24 15:26:41] [INFO ] Deduced a trap composed of 29 places in 66 ms of which 1 ms to minimize.
[2024-05-24 15:26:41] [INFO ] Deduced a trap composed of 30 places in 66 ms of which 1 ms to minimize.
[2024-05-24 15:26:41] [INFO ] Deduced a trap composed of 33 places in 60 ms of which 1 ms to minimize.
[2024-05-24 15:26:41] [INFO ] Deduced a trap composed of 29 places in 62 ms of which 1 ms to minimize.
[2024-05-24 15:26:41] [INFO ] Deduced a trap composed of 8 places in 62 ms of which 1 ms to minimize.
[2024-05-24 15:26:41] [INFO ] Deduced a trap composed of 33 places in 61 ms of which 1 ms to minimize.
[2024-05-24 15:26:41] [INFO ] Deduced a trap composed of 28 places in 62 ms of which 1 ms to minimize.
[2024-05-24 15:26:41] [INFO ] Deduced a trap composed of 22 places in 55 ms of which 1 ms to minimize.
[2024-05-24 15:26:41] [INFO ] Deduced a trap composed of 33 places in 65 ms of which 1 ms to minimize.
[2024-05-24 15:26:41] [INFO ] Deduced a trap composed of 30 places in 74 ms of which 1 ms to minimize.
[2024-05-24 15:26:41] [INFO ] Deduced a trap composed of 30 places in 66 ms of which 1 ms to minimize.
[2024-05-24 15:26:42] [INFO ] Deduced a trap composed of 29 places in 66 ms of which 1 ms to minimize.
[2024-05-24 15:26:42] [INFO ] Deduced a trap composed of 31 places in 67 ms of which 1 ms to minimize.
[2024-05-24 15:26:42] [INFO ] Deduced a trap composed of 22 places in 65 ms of which 1 ms to minimize.
[2024-05-24 15:26:42] [INFO ] Deduced a trap composed of 25 places in 68 ms of which 1 ms to minimize.
[2024-05-24 15:26:42] [INFO ] Deduced a trap composed of 31 places in 70 ms of which 1 ms to minimize.
[2024-05-24 15:26:42] [INFO ] Deduced a trap composed of 26 places in 66 ms of which 1 ms to minimize.
[2024-05-24 15:26:42] [INFO ] Deduced a trap composed of 16 places in 62 ms of which 1 ms to minimize.
[2024-05-24 15:26:42] [INFO ] Deduced a trap composed of 19 places in 58 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/164 variables, 20/144 constraints. Problems are: Problem set: 0 solved, 306 unsolved
[2024-05-24 15:26:43] [INFO ] Deduced a trap composed of 21 places in 60 ms of which 1 ms to minimize.
[2024-05-24 15:26:43] [INFO ] Deduced a trap composed of 21 places in 55 ms of which 1 ms to minimize.
[2024-05-24 15:26:43] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 1 ms to minimize.
[2024-05-24 15:26:43] [INFO ] Deduced a trap composed of 15 places in 68 ms of which 1 ms to minimize.
[2024-05-24 15:26:43] [INFO ] Deduced a trap composed of 23 places in 63 ms of which 1 ms to minimize.
[2024-05-24 15:26:43] [INFO ] Deduced a trap composed of 27 places in 61 ms of which 1 ms to minimize.
[2024-05-24 15:26:43] [INFO ] Deduced a trap composed of 30 places in 67 ms of which 1 ms to minimize.
[2024-05-24 15:26:43] [INFO ] Deduced a trap composed of 27 places in 63 ms of which 1 ms to minimize.
[2024-05-24 15:26:43] [INFO ] Deduced a trap composed of 27 places in 62 ms of which 1 ms to minimize.
[2024-05-24 15:26:43] [INFO ] Deduced a trap composed of 36 places in 69 ms of which 1 ms to minimize.
[2024-05-24 15:26:43] [INFO ] Deduced a trap composed of 37 places in 64 ms of which 1 ms to minimize.
[2024-05-24 15:26:44] [INFO ] Deduced a trap composed of 15 places in 71 ms of which 1 ms to minimize.
[2024-05-24 15:26:44] [INFO ] Deduced a trap composed of 24 places in 60 ms of which 1 ms to minimize.
[2024-05-24 15:26:44] [INFO ] Deduced a trap composed of 14 places in 60 ms of which 1 ms to minimize.
[2024-05-24 15:26:44] [INFO ] Deduced a trap composed of 14 places in 47 ms of which 0 ms to minimize.
[2024-05-24 15:26:44] [INFO ] Deduced a trap composed of 43 places in 69 ms of which 1 ms to minimize.
[2024-05-24 15:26:44] [INFO ] Deduced a trap composed of 24 places in 61 ms of which 1 ms to minimize.
[2024-05-24 15:26:44] [INFO ] Deduced a trap composed of 28 places in 59 ms of which 1 ms to minimize.
[2024-05-24 15:26:44] [INFO ] Deduced a trap composed of 33 places in 53 ms of which 1 ms to minimize.
[2024-05-24 15:26:44] [INFO ] Deduced a trap composed of 26 places in 61 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/164 variables, 20/164 constraints. Problems are: Problem set: 0 solved, 306 unsolved
[2024-05-24 15:26:45] [INFO ] Deduced a trap composed of 32 places in 67 ms of which 1 ms to minimize.
[2024-05-24 15:26:45] [INFO ] Deduced a trap composed of 31 places in 65 ms of which 1 ms to minimize.
[2024-05-24 15:26:45] [INFO ] Deduced a trap composed of 16 places in 65 ms of which 1 ms to minimize.
[2024-05-24 15:26:45] [INFO ] Deduced a trap composed of 19 places in 59 ms of which 1 ms to minimize.
[2024-05-24 15:26:45] [INFO ] Deduced a trap composed of 23 places in 59 ms of which 1 ms to minimize.
[2024-05-24 15:26:45] [INFO ] Deduced a trap composed of 22 places in 69 ms of which 2 ms to minimize.
[2024-05-24 15:26:46] [INFO ] Deduced a trap composed of 25 places in 69 ms of which 1 ms to minimize.
[2024-05-24 15:26:46] [INFO ] Deduced a trap composed of 29 places in 69 ms of which 1 ms to minimize.
[2024-05-24 15:26:46] [INFO ] Deduced a trap composed of 24 places in 61 ms of which 1 ms to minimize.
[2024-05-24 15:26:46] [INFO ] Deduced a trap composed of 24 places in 62 ms of which 1 ms to minimize.
[2024-05-24 15:26:46] [INFO ] Deduced a trap composed of 29 places in 64 ms of which 1 ms to minimize.
[2024-05-24 15:26:46] [INFO ] Deduced a trap composed of 40 places in 61 ms of which 1 ms to minimize.
[2024-05-24 15:26:46] [INFO ] Deduced a trap composed of 38 places in 63 ms of which 1 ms to minimize.
[2024-05-24 15:26:46] [INFO ] Deduced a trap composed of 25 places in 63 ms of which 1 ms to minimize.
[2024-05-24 15:26:47] [INFO ] Deduced a trap composed of 25 places in 67 ms of which 1 ms to minimize.
[2024-05-24 15:26:47] [INFO ] Deduced a trap composed of 25 places in 67 ms of which 1 ms to minimize.
[2024-05-24 15:26:47] [INFO ] Deduced a trap composed of 26 places in 59 ms of which 1 ms to minimize.
[2024-05-24 15:26:47] [INFO ] Deduced a trap composed of 30 places in 55 ms of which 1 ms to minimize.
[2024-05-24 15:26:47] [INFO ] Deduced a trap composed of 24 places in 55 ms of which 1 ms to minimize.
[2024-05-24 15:26:47] [INFO ] Deduced a trap composed of 20 places in 56 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/164 variables, 20/184 constraints. Problems are: Problem set: 0 solved, 306 unsolved
[2024-05-24 15:26:48] [INFO ] Deduced a trap composed of 25 places in 70 ms of which 1 ms to minimize.
[2024-05-24 15:26:48] [INFO ] Deduced a trap composed of 29 places in 82 ms of which 1 ms to minimize.
[2024-05-24 15:26:49] [INFO ] Deduced a trap composed of 20 places in 68 ms of which 1 ms to minimize.
[2024-05-24 15:26:49] [INFO ] Deduced a trap composed of 26 places in 65 ms of which 1 ms to minimize.
[2024-05-24 15:26:49] [INFO ] Deduced a trap composed of 26 places in 60 ms of which 1 ms to minimize.
[2024-05-24 15:26:49] [INFO ] Deduced a trap composed of 26 places in 61 ms of which 1 ms to minimize.
[2024-05-24 15:26:49] [INFO ] Deduced a trap composed of 35 places in 62 ms of which 1 ms to minimize.
[2024-05-24 15:26:49] [INFO ] Deduced a trap composed of 26 places in 65 ms of which 1 ms to minimize.
[2024-05-24 15:26:49] [INFO ] Deduced a trap composed of 37 places in 65 ms of which 1 ms to minimize.
[2024-05-24 15:26:49] [INFO ] Deduced a trap composed of 36 places in 64 ms of which 1 ms to minimize.
[2024-05-24 15:26:49] [INFO ] Deduced a trap composed of 22 places in 68 ms of which 1 ms to minimize.
[2024-05-24 15:26:49] [INFO ] Deduced a trap composed of 20 places in 62 ms of which 1 ms to minimize.
[2024-05-24 15:26:49] [INFO ] Deduced a trap composed of 28 places in 69 ms of which 1 ms to minimize.
[2024-05-24 15:26:50] [INFO ] Deduced a trap composed of 38 places in 75 ms of which 1 ms to minimize.
[2024-05-24 15:26:50] [INFO ] Deduced a trap composed of 36 places in 63 ms of which 2 ms to minimize.
[2024-05-24 15:26:50] [INFO ] Deduced a trap composed of 37 places in 57 ms of which 1 ms to minimize.
[2024-05-24 15:26:50] [INFO ] Deduced a trap composed of 33 places in 59 ms of which 1 ms to minimize.
[2024-05-24 15:26:50] [INFO ] Deduced a trap composed of 35 places in 54 ms of which 1 ms to minimize.
[2024-05-24 15:26:50] [INFO ] Deduced a trap composed of 24 places in 51 ms of which 1 ms to minimize.
[2024-05-24 15:26:50] [INFO ] Deduced a trap composed of 28 places in 55 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/164 variables, 20/204 constraints. Problems are: Problem set: 0 solved, 306 unsolved
[2024-05-24 15:26:51] [INFO ] Deduced a trap composed of 9 places in 60 ms of which 1 ms to minimize.
[2024-05-24 15:26:51] [INFO ] Deduced a trap composed of 38 places in 71 ms of which 1 ms to minimize.
[2024-05-24 15:26:51] [INFO ] Deduced a trap composed of 33 places in 56 ms of which 1 ms to minimize.
[2024-05-24 15:26:51] [INFO ] Deduced a trap composed of 33 places in 63 ms of which 1 ms to minimize.
[2024-05-24 15:26:51] [INFO ] Deduced a trap composed of 27 places in 58 ms of which 1 ms to minimize.
[2024-05-24 15:26:51] [INFO ] Deduced a trap composed of 31 places in 56 ms of which 1 ms to minimize.
[2024-05-24 15:26:51] [INFO ] Deduced a trap composed of 30 places in 56 ms of which 1 ms to minimize.
[2024-05-24 15:26:51] [INFO ] Deduced a trap composed of 24 places in 49 ms of which 1 ms to minimize.
[2024-05-24 15:26:51] [INFO ] Deduced a trap composed of 17 places in 64 ms of which 1 ms to minimize.
[2024-05-24 15:26:52] [INFO ] Deduced a trap composed of 29 places in 66 ms of which 1 ms to minimize.
[2024-05-24 15:26:52] [INFO ] Deduced a trap composed of 20 places in 59 ms of which 1 ms to minimize.
[2024-05-24 15:26:52] [INFO ] Deduced a trap composed of 23 places in 52 ms of which 1 ms to minimize.
[2024-05-24 15:26:52] [INFO ] Deduced a trap composed of 32 places in 60 ms of which 1 ms to minimize.
[2024-05-24 15:26:52] [INFO ] Deduced a trap composed of 28 places in 55 ms of which 1 ms to minimize.
[2024-05-24 15:26:52] [INFO ] Deduced a trap composed of 27 places in 62 ms of which 1 ms to minimize.
[2024-05-24 15:26:52] [INFO ] Deduced a trap composed of 30 places in 62 ms of which 1 ms to minimize.
[2024-05-24 15:26:52] [INFO ] Deduced a trap composed of 23 places in 58 ms of which 1 ms to minimize.
[2024-05-24 15:26:52] [INFO ] Deduced a trap composed of 41 places in 66 ms of which 1 ms to minimize.
[2024-05-24 15:26:52] [INFO ] Deduced a trap composed of 32 places in 61 ms of which 1 ms to minimize.
[2024-05-24 15:26:52] [INFO ] Deduced a trap composed of 27 places in 62 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/164 variables, 20/224 constraints. Problems are: Problem set: 0 solved, 306 unsolved
[2024-05-24 15:26:54] [INFO ] Deduced a trap composed of 24 places in 71 ms of which 1 ms to minimize.
[2024-05-24 15:26:54] [INFO ] Deduced a trap composed of 29 places in 63 ms of which 1 ms to minimize.
[2024-05-24 15:26:54] [INFO ] Deduced a trap composed of 27 places in 62 ms of which 1 ms to minimize.
[2024-05-24 15:26:54] [INFO ] Deduced a trap composed of 43 places in 62 ms of which 1 ms to minimize.
[2024-05-24 15:26:54] [INFO ] Deduced a trap composed of 40 places in 56 ms of which 1 ms to minimize.
[2024-05-24 15:26:54] [INFO ] Deduced a trap composed of 26 places in 55 ms of which 1 ms to minimize.
[2024-05-24 15:26:54] [INFO ] Deduced a trap composed of 26 places in 55 ms of which 1 ms to minimize.
[2024-05-24 15:26:54] [INFO ] Deduced a trap composed of 23 places in 50 ms of which 0 ms to minimize.
[2024-05-24 15:26:54] [INFO ] Deduced a trap composed of 29 places in 65 ms of which 1 ms to minimize.
[2024-05-24 15:26:54] [INFO ] Deduced a trap composed of 28 places in 62 ms of which 1 ms to minimize.
[2024-05-24 15:26:54] [INFO ] Deduced a trap composed of 28 places in 64 ms of which 1 ms to minimize.
[2024-05-24 15:26:54] [INFO ] Deduced a trap composed of 29 places in 61 ms of which 1 ms to minimize.
[2024-05-24 15:26:54] [INFO ] Deduced a trap composed of 25 places in 61 ms of which 1 ms to minimize.
[2024-05-24 15:26:54] [INFO ] Deduced a trap composed of 22 places in 61 ms of which 1 ms to minimize.
[2024-05-24 15:26:55] [INFO ] Deduced a trap composed of 22 places in 66 ms of which 1 ms to minimize.
[2024-05-24 15:26:55] [INFO ] Deduced a trap composed of 30 places in 65 ms of which 1 ms to minimize.
[2024-05-24 15:26:55] [INFO ] Deduced a trap composed of 39 places in 68 ms of which 1 ms to minimize.
[2024-05-24 15:26:55] [INFO ] Deduced a trap composed of 40 places in 59 ms of which 1 ms to minimize.
[2024-05-24 15:26:55] [INFO ] Deduced a trap composed of 41 places in 54 ms of which 1 ms to minimize.
[2024-05-24 15:26:55] [INFO ] Deduced a trap composed of 28 places in 58 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/164 variables, 20/244 constraints. Problems are: Problem set: 0 solved, 306 unsolved
[2024-05-24 15:26:56] [INFO ] Deduced a trap composed of 32 places in 56 ms of which 0 ms to minimize.
[2024-05-24 15:26:57] [INFO ] Deduced a trap composed of 27 places in 69 ms of which 1 ms to minimize.
[2024-05-24 15:26:57] [INFO ] Deduced a trap composed of 35 places in 69 ms of which 1 ms to minimize.
[2024-05-24 15:26:57] [INFO ] Deduced a trap composed of 44 places in 66 ms of which 1 ms to minimize.
[2024-05-24 15:26:57] [INFO ] Deduced a trap composed of 29 places in 61 ms of which 1 ms to minimize.
[2024-05-24 15:26:57] [INFO ] Deduced a trap composed of 43 places in 56 ms of which 1 ms to minimize.
[2024-05-24 15:26:58] [INFO ] Deduced a trap composed of 29 places in 59 ms of which 1 ms to minimize.
[2024-05-24 15:26:58] [INFO ] Deduced a trap composed of 23 places in 62 ms of which 1 ms to minimize.
[2024-05-24 15:26:58] [INFO ] Deduced a trap composed of 25 places in 61 ms of which 1 ms to minimize.
[2024-05-24 15:26:58] [INFO ] Deduced a trap composed of 24 places in 67 ms of which 1 ms to minimize.
[2024-05-24 15:26:58] [INFO ] Deduced a trap composed of 29 places in 56 ms of which 1 ms to minimize.
[2024-05-24 15:26:58] [INFO ] Deduced a trap composed of 29 places in 71 ms of which 1 ms to minimize.
[2024-05-24 15:26:58] [INFO ] Deduced a trap composed of 25 places in 57 ms of which 1 ms to minimize.
[2024-05-24 15:26:58] [INFO ] Deduced a trap composed of 22 places in 56 ms of which 1 ms to minimize.
[2024-05-24 15:26:58] [INFO ] Deduced a trap composed of 26 places in 51 ms of which 1 ms to minimize.
[2024-05-24 15:26:58] [INFO ] Deduced a trap composed of 27 places in 69 ms of which 1 ms to minimize.
[2024-05-24 15:26:58] [INFO ] Deduced a trap composed of 27 places in 58 ms of which 1 ms to minimize.
[2024-05-24 15:26:58] [INFO ] Deduced a trap composed of 25 places in 59 ms of which 1 ms to minimize.
[2024-05-24 15:26:58] [INFO ] Deduced a trap composed of 25 places in 55 ms of which 1 ms to minimize.
[2024-05-24 15:26:58] [INFO ] Deduced a trap composed of 23 places in 52 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/164 variables, 20/264 constraints. Problems are: Problem set: 0 solved, 306 unsolved
[2024-05-24 15:26:59] [INFO ] Deduced a trap composed of 25 places in 70 ms of which 1 ms to minimize.
[2024-05-24 15:26:59] [INFO ] Deduced a trap composed of 34 places in 65 ms of which 1 ms to minimize.
[2024-05-24 15:26:59] [INFO ] Deduced a trap composed of 30 places in 57 ms of which 1 ms to minimize.
[2024-05-24 15:26:59] [INFO ] Deduced a trap composed of 28 places in 59 ms of which 1 ms to minimize.
[2024-05-24 15:26:59] [INFO ] Deduced a trap composed of 21 places in 59 ms of which 1 ms to minimize.
[2024-05-24 15:27:00] [INFO ] Deduced a trap composed of 32 places in 66 ms of which 1 ms to minimize.
[2024-05-24 15:27:00] [INFO ] Deduced a trap composed of 23 places in 57 ms of which 1 ms to minimize.
[2024-05-24 15:27:00] [INFO ] Deduced a trap composed of 20 places in 57 ms of which 1 ms to minimize.
[2024-05-24 15:27:00] [INFO ] Deduced a trap composed of 21 places in 56 ms of which 1 ms to minimize.
[2024-05-24 15:27:00] [INFO ] Deduced a trap composed of 29 places in 62 ms of which 1 ms to minimize.
[2024-05-24 15:27:00] [INFO ] Deduced a trap composed of 29 places in 60 ms of which 1 ms to minimize.
[2024-05-24 15:27:00] [INFO ] Deduced a trap composed of 31 places in 58 ms of which 1 ms to minimize.
[2024-05-24 15:27:00] [INFO ] Deduced a trap composed of 49 places in 65 ms of which 1 ms to minimize.
[2024-05-24 15:27:01] [INFO ] Deduced a trap composed of 26 places in 67 ms of which 1 ms to minimize.
[2024-05-24 15:27:01] [INFO ] Deduced a trap composed of 12 places in 63 ms of which 1 ms to minimize.
[2024-05-24 15:27:01] [INFO ] Deduced a trap composed of 30 places in 71 ms of which 1 ms to minimize.
[2024-05-24 15:27:01] [INFO ] Deduced a trap composed of 43 places in 61 ms of which 1 ms to minimize.
[2024-05-24 15:27:01] [INFO ] Deduced a trap composed of 50 places in 58 ms of which 1 ms to minimize.
SMT process timed out in 30166ms, After SMT, problems are : Problem set: 0 solved, 306 unsolved
Search for dead transitions found 0 dead transitions in 30172ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30492 ms. Remains : 164/164 places, 312/312 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 78 transitions
Reduce isomorphic transitions removed 78 transitions.
Iterating post reduction 0 with 78 rules applied. Total rules applied 78 place count 164 transition count 234
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -24
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 90 place count 158 transition count 258
Free-agglomeration rule applied 6 times.
Iterating global reduction 1 with 6 rules applied. Total rules applied 96 place count 158 transition count 252
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 102 place count 152 transition count 252
Applied a total of 102 rules in 23 ms. Remains 152 /164 variables (removed 12) and now considering 252/312 (removed 60) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 252 rows 152 cols
[2024-05-24 15:27:01] [INFO ] Computed 44 invariants in 3 ms
[2024-05-24 15:27:01] [INFO ] After 34ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 15:27:01] [INFO ] [Nat]Absence check using 44 positive place invariants in 7 ms returned sat
[2024-05-24 15:27:01] [INFO ] After 89ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-24 15:27:01] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 1 ms to minimize.
[2024-05-24 15:27:01] [INFO ] Deduced a trap composed of 8 places in 35 ms of which 1 ms to minimize.
[2024-05-24 15:27:01] [INFO ] Deduced a trap composed of 8 places in 38 ms of which 0 ms to minimize.
[2024-05-24 15:27:01] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 0 ms to minimize.
[2024-05-24 15:27:01] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 0 ms to minimize.
[2024-05-24 15:27:01] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 239 ms
TRAPS : Iteration 1
[2024-05-24 15:27:01] [INFO ] Deduced a trap composed of 8 places in 18 ms of which 1 ms to minimize.
[2024-05-24 15:27:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 37 ms
TRAPS : Iteration 2
[2024-05-24 15:27:02] [INFO ] After 497ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-24 15:27:02] [INFO ] After 577ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2024-05-24 15:27:02] [INFO ] Flatten gal took : 19 ms
[2024-05-24 15:27:02] [INFO ] Flatten gal took : 20 ms
[2024-05-24 15:27:02] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17282304415082475461.gal : 12 ms
[2024-05-24 15:27:02] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10030540102369230532.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.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality17282304415082475461.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10030540102369230532.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.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
Loading property file /tmp/ReachabilityCardinality10030540102369230532.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 7
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :7 after 10
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :10 after 12
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :12 after 86
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :86 after 137
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :137 after 344
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :344 after 608
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :608 after 4791
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :4791 after 76251
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :76251 after 779372
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :779372 after 2.86391e+07
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :2.86391e+07 after 1.1765e+08
SDD proceeding with computation,1 properties remain. new max is 262144
SDD size :4.49801e+07 after 6.9072e+07
Detected timeout of ITS tools.
[2024-05-24 15:27:17] [INFO ] Flatten gal took : 13 ms
[2024-05-24 15:27:17] [INFO ] Applying decomposition
[2024-05-24 15:27:17] [INFO ] Flatten gal took : 13 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph640202838073368145.txt' '-o' '/tmp/graph640202838073368145.bin' '-w' '/tmp/graph640202838073368145.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph640202838073368145.bin' '-l' '-1' '-v' '-w' '/tmp/graph640202838073368145.weights' '-q' '0' '-e' '0.001'
[2024-05-24 15:27:17] [INFO ] Decomposing Gal with order
[2024-05-24 15:27:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 15:27:17] [INFO ] Removed a total of 99 redundant transitions.
[2024-05-24 15:27:17] [INFO ] Flatten gal took : 52 ms
[2024-05-24 15:27:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 24 labels/synchronizations in 8 ms.
[2024-05-24 15:27:17] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13241190640871610560.gal : 4 ms
[2024-05-24 15:27:17] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2255310798925546269.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.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality13241190640871610560.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2255310798925546269.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.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality2255310798925546269.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :3 after 4
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :4 after 15
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :15 after 49
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :49 after 128
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :128 after 298
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :298 after 633
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :633 after 4692
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :4692 after 32484
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :32484 after 139020
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :139020 after 1.10283e+06
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :1.10283e+06 after 5.55381e+07
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :5.55381e+07 after 1.31929e+08
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :1.31929e+08 after 1.92685e+10
Detected timeout of ITS tools.
Over-approximation ignoring read arcs solved 0 properties in 31068 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2024-05-24 15:27:32] [INFO ] Flatten gal took : 24 ms
[2024-05-24 15:27:32] [INFO ] Applying decomposition
[2024-05-24 15:27:32] [INFO ] Flatten gal took : 20 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph17700844047992067499.txt' '-o' '/tmp/graph17700844047992067499.bin' '-w' '/tmp/graph17700844047992067499.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17700844047992067499.bin' '-l' '-1' '-v' '-w' '/tmp/graph17700844047992067499.weights' '-q' '0' '-e' '0.001'
[2024-05-24 15:27:32] [INFO ] Decomposing Gal with order
[2024-05-24 15:27:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 15:27:32] [INFO ] Removed a total of 512 redundant transitions.
[2024-05-24 15:27:32] [INFO ] Flatten gal took : 65 ms
[2024-05-24 15:27:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 70 labels/synchronizations in 9 ms.
[2024-05-24 15:27:32] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality825310962930233252.gal : 4 ms
[2024-05-24 15:27:32] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4428676810236424621.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.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality825310962930233252.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4428676810236424621.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.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...327
Loading property file /tmp/ReachabilityCardinality4428676810236424621.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 6
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :6 after 7
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :7 after 18
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :18 after 73
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :73 after 106
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :106 after 216
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :216 after 1560
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :1560 after 2741
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :2741 after 6098
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :6098 after 37132
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :37132 after 73168
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :73168 after 266916
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :266916 after 1.56897e+06
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :1.56897e+06 after 2.90605e+06
SDD proceeding with computation,1 properties remain. new max is 131072
SDD size :2.90605e+06 after 4.39482e+07
SDD proceeding with computation,1 properties remain. new max is 262144
SDD size :4.39482e+07 after 6.16558e+07
SDD proceeding with computation,1 properties remain. new max is 524288
SDD size :6.16558e+07 after 1.21944e+08
SDD proceeding with computation,1 properties remain. new max is 1048576
SDD size :1.21944e+08 after 2.53413e+08
SDD proceeding with computation,1 properties remain. new max is 2097152
SDD size :2.53413e+08 after 1.85283e+09
ITS-tools command line returned an error code 137
[2024-05-24 15:50:14] [INFO ] Flatten gal took : 16 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin13615478892797571920
[2024-05-24 15:50:14] [INFO ] Applying decomposition
[2024-05-24 15:50:14] [INFO ] Computing symmetric may disable matrix : 312 transitions.
[2024-05-24 15:50:14] [INFO ] Flatten gal took : 15 ms
[2024-05-24 15:50:14] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 15:50:14] [INFO ] Computing symmetric may enable matrix : 312 transitions.
[2024-05-24 15:50:14] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 15:50:14] [INFO ] Computing Do-Not-Accords matrix : 312 transitions.
[2024-05-24 15:50:14] [INFO ] Computation of Completed DNA matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 15:50:14] [INFO ] Built C files in 67ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13615478892797571920
Running compilation step : cd /tmp/ltsmin13615478892797571920;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph2790957035487508876.txt' '-o' '/tmp/graph2790957035487508876.bin' '-w' '/tmp/graph2790957035487508876.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2790957035487508876.bin' '-l' '-1' '-v' '-w' '/tmp/graph2790957035487508876.weights' '-q' '0' '-e' '0.001'
[2024-05-24 15:50:14] [INFO ] Decomposing Gal with order
[2024-05-24 15:50:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 15:50:14] [INFO ] Removed a total of 404 redundant transitions.
[2024-05-24 15:50:14] [INFO ] Flatten gal took : 65 ms
[2024-05-24 15:50:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 48 labels/synchronizations in 6 ms.
[2024-05-24 15:50:15] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13076205647116121999.gal : 8 ms
[2024-05-24 15:50:15] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6324053888500918155.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.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality13076205647116121999.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6324053888500918155.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.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality6324053888500918155.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :3 after 6
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :6 after 7
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :7 after 20
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :20 after 29
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :29 after 79
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :79 after 143
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :143 after 755
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :755 after 1470
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :1470 after 2792
Compilation finished in 851 ms.
Running link step : cd /tmp/ltsmin13615478892797571920;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 46 ms.
Running LTSmin : cd /tmp/ltsmin13615478892797571920;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'LamportFastMutExCOL6ReachabilityCardinality202410==true'
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :2792 after 24766
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :24766 after 42931
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :42931 after 129018
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :129018 after 1.13241e+06
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :1.13241e+06 after 2.43377e+06
SDD proceeding with computation,1 properties remain. new max is 131072
SDD size :2.43377e+06 after 7.99745e+06
SDD proceeding with computation,1 properties remain. new max is 262144
SDD size :7.99745e+06 after 6.20107e+07
SDD proceeding with computation,1 properties remain. new max is 524288
SDD size :6.20107e+07 after 1.24203e+08
SDD proceeding with computation,1 properties remain. new max is 1048576
SDD size :1.24203e+08 after 2.88258e+08
Detected timeout of ITS tools.
[2024-05-24 16:18:25] [INFO ] Applying decomposition
[2024-05-24 16:18:25] [INFO ] Flatten gal took : 50 ms
[2024-05-24 16:18:25] [INFO ] Decomposing Gal with order
[2024-05-24 16:18:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 16:18:25] [INFO ] Removed a total of 674 redundant transitions.
[2024-05-24 16:18:25] [INFO ] Flatten gal took : 72 ms
[2024-05-24 16:18:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 24 labels/synchronizations in 22 ms.
[2024-05-24 16:18:25] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13482424099752941646.gal : 19 ms
[2024-05-24 16:18:25] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10573704246112776253.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.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality13482424099752941646.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10573704246112776253.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.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
Loading property file /tmp/ReachabilityCardinality10573704246112776253.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :3 after 6
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :6 after 7
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :7 after 23
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :23 after 33
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :33 after 93
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :93 after 143
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :143 after 695
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :695 after 1007
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :1007 after 2751
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :2751 after 19536
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :19536 after 30921
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :30921 after 82407
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :82407 after 650516
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :650516 after 1.73709e+06
SDD proceeding with computation,1 properties remain. new max is 131072
SDD size :1.73709e+06 after 7.32778e+06
SDD proceeding with computation,1 properties remain. new max is 262144
SDD size :7.32778e+06 after 5.1311e+07
SDD proceeding with computation,1 properties remain. new max is 524288
SDD size :5.1311e+07 after 8.28131e+07

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.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /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="LamportFastMutEx-COL-6"
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-5568"
echo " Executing tool itstools"
echo " Input is LamportFastMutEx-COL-6, 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 r224-tall-171649612300238"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/LamportFastMutEx-COL-6.tgz
mv LamportFastMutEx-COL-6 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 ;