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.r223-tall-171649611000250.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 greatspnxred
Input is LamportFastMutEx-COL-8, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r223-tall-171649611000250
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 536K
-rw-r--r-- 1 mcc users 7.1K Apr 13 07:46 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K Apr 13 07:46 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Apr 13 07:43 CTLFireability.txt
-rw-r--r-- 1 mcc users 68K Apr 13 07:43 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 4.0K Apr 22 14:51 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 22 14:51 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Apr 22 14:51 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 22 14:51 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Apr 13 07:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 168K Apr 13 07:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Apr 13 07:51 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 50K Apr 13 07:51 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 44K 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-8-CTLFireability-2024-00
FORMULA_NAME LamportFastMutEx-COL-8-CTLFireability-2024-01
FORMULA_NAME LamportFastMutEx-COL-8-CTLFireability-2024-02
FORMULA_NAME LamportFastMutEx-COL-8-CTLFireability-2024-03
FORMULA_NAME LamportFastMutEx-COL-8-CTLFireability-2024-04
FORMULA_NAME LamportFastMutEx-COL-8-CTLFireability-2024-05
FORMULA_NAME LamportFastMutEx-COL-8-CTLFireability-2024-06
FORMULA_NAME LamportFastMutEx-COL-8-CTLFireability-2024-07
FORMULA_NAME LamportFastMutEx-COL-8-CTLFireability-2024-08
FORMULA_NAME LamportFastMutEx-COL-8-CTLFireability-2024-09
FORMULA_NAME LamportFastMutEx-COL-8-CTLFireability-2024-10
FORMULA_NAME LamportFastMutEx-COL-8-CTLFireability-2024-11
FORMULA_NAME LamportFastMutEx-COL-8-CTLFireability-2024-12
FORMULA_NAME LamportFastMutEx-COL-8-CTLFireability-2024-13
FORMULA_NAME LamportFastMutEx-COL-8-CTLFireability-2024-14
FORMULA_NAME LamportFastMutEx-COL-8-CTLFireability-2024-15

=== Now, execution of the tool begins

BK_START 1716530017156

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=LamportFastMutEx-COL-8
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-24 05:53:38] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-24 05:53:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 05:53:38] [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 05:53:38] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-24 05:53:39] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 590 ms
[2024-05-24 05:53:39] [INFO ] Imported 18 HL places and 17 HL transitions for a total of 315 PT places and 837.0 transition bindings in 17 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 15 ms.
[2024-05-24 05:53:39] [INFO ] Built PT skeleton of HLPN with 18 places and 17 transitions 68 arcs in 4 ms.
[2024-05-24 05:53:39] [INFO ] Skeletonized 4 HLPN properties in 2 ms. Removed 12 properties that had guard overlaps.
Computed a total of 3 stabilizing places and 0 stable transitions
Remains 3 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
RANDOM walk for 1001 steps (0 resets) in 22 ms. (43 steps per ms) remains 0/7 properties
[2024-05-24 05:53:39] [INFO ] Flatten gal took : 13 ms
[2024-05-24 05:53:39] [INFO ] Flatten gal took : 2 ms
Domain [pid(9), pid(9)] 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 05:53:39] [INFO ] Unfolded HLPN to a Petri net with 315 places and 666 transitions 2934 arcs in 42 ms.
[2024-05-24 05:53:39] [INFO ] Unfolded 16 HLPN properties in 1 ms.
Deduced a syphon composed of 49 places in 3 ms
Reduce places removed 49 places and 82 transitions.
Support contains 266 out of 266 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 266/266 places, 584/584 transitions.
Applied a total of 0 rules in 12 ms. Remains 266 /266 variables (removed 0) and now considering 584/584 (removed 0) transitions.
[2024-05-24 05:53:39] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
// Phase 1: matrix 416 rows 266 cols
[2024-05-24 05:53:39] [INFO ] Computed 82 invariants in 11 ms
[2024-05-24 05:53:39] [INFO ] Implicit Places using invariants in 210 ms returned []
[2024-05-24 05:53:39] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
[2024-05-24 05:53:39] [INFO ] Invariant cache hit.
[2024-05-24 05:53:39] [INFO ] State equation strengthened by 112 read => feed constraints.
[2024-05-24 05:53:39] [INFO ] Implicit Places using invariants and state equation in 290 ms returned []
Implicit Place search using SMT with State Equation took 554 ms to find 0 implicit places.
Running 576 sub problems to find dead transitions.
[2024-05-24 05:53:39] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
[2024-05-24 05:53:39] [INFO ] Invariant cache hit.
[2024-05-24 05:53:39] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/266 variables, 82/82 constraints. Problems are: Problem set: 0 solved, 576 unsolved
[2024-05-24 05:53:43] [INFO ] Deduced a trap composed of 12 places in 166 ms of which 23 ms to minimize.
[2024-05-24 05:53:43] [INFO ] Deduced a trap composed of 15 places in 161 ms of which 3 ms to minimize.
[2024-05-24 05:53:43] [INFO ] Deduced a trap composed of 9 places in 126 ms of which 2 ms to minimize.
[2024-05-24 05:53:43] [INFO ] Deduced a trap composed of 21 places in 110 ms of which 2 ms to minimize.
[2024-05-24 05:53:43] [INFO ] Deduced a trap composed of 12 places in 112 ms of which 2 ms to minimize.
[2024-05-24 05:53:44] [INFO ] Deduced a trap composed of 15 places in 100 ms of which 2 ms to minimize.
[2024-05-24 05:53:44] [INFO ] Deduced a trap composed of 15 places in 125 ms of which 3 ms to minimize.
[2024-05-24 05:53:44] [INFO ] Deduced a trap composed of 12 places in 115 ms of which 3 ms to minimize.
[2024-05-24 05:53:44] [INFO ] Deduced a trap composed of 10 places in 107 ms of which 2 ms to minimize.
[2024-05-24 05:53:44] [INFO ] Deduced a trap composed of 9 places in 103 ms of which 2 ms to minimize.
Problem TDEAD8 is UNSAT
[2024-05-24 05:53:44] [INFO ] Deduced a trap composed of 17 places in 106 ms of which 2 ms to minimize.
[2024-05-24 05:53:44] [INFO ] Deduced a trap composed of 12 places in 120 ms of which 2 ms to minimize.
[2024-05-24 05:53:44] [INFO ] Deduced a trap composed of 24 places in 106 ms of which 2 ms to minimize.
[2024-05-24 05:53:44] [INFO ] Deduced a trap composed of 9 places in 107 ms of which 1 ms to minimize.
[2024-05-24 05:53:45] [INFO ] Deduced a trap composed of 23 places in 108 ms of which 2 ms to minimize.
[2024-05-24 05:53:45] [INFO ] Deduced a trap composed of 16 places in 101 ms of which 2 ms to minimize.
[2024-05-24 05:53:45] [INFO ] Deduced a trap composed of 9 places in 105 ms of which 2 ms to minimize.
Problem TDEAD9 is UNSAT
[2024-05-24 05:53:45] [INFO ] Deduced a trap composed of 19 places in 107 ms of which 2 ms to minimize.
[2024-05-24 05:53:45] [INFO ] Deduced a trap composed of 27 places in 104 ms of which 1 ms to minimize.
[2024-05-24 05:53:45] [INFO ] Deduced a trap composed of 9 places in 104 ms of which 2 ms to minimize.
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD14 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/266 variables, 20/102 constraints. Problems are: Problem set: 5 solved, 571 unsolved
[2024-05-24 05:53:45] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 0 ms to minimize.
Problem TDEAD12 is UNSAT
[2024-05-24 05:53:45] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 1 ms to minimize.
Problem TDEAD13 is UNSAT
[2024-05-24 05:53:45] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 1 ms to minimize.
Problem TDEAD15 is UNSAT
[2024-05-24 05:53:45] [INFO ] Deduced a trap composed of 12 places in 62 ms of which 1 ms to minimize.
[2024-05-24 05:53:46] [INFO ] Deduced a trap composed of 10 places in 106 ms of which 2 ms to minimize.
[2024-05-24 05:53:46] [INFO ] Deduced a trap composed of 10 places in 99 ms of which 2 ms to minimize.
[2024-05-24 05:53:46] [INFO ] Deduced a trap composed of 11 places in 94 ms of which 2 ms to minimize.
[2024-05-24 05:53:46] [INFO ] Deduced a trap composed of 10 places in 91 ms of which 1 ms to minimize.
[2024-05-24 05:53:46] [INFO ] Deduced a trap composed of 10 places in 93 ms of which 2 ms to minimize.
[2024-05-24 05:53:46] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 1 ms to minimize.
[2024-05-24 05:53:46] [INFO ] Deduced a trap composed of 10 places in 48 ms of which 0 ms to minimize.
[2024-05-24 05:53:46] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 0 ms to minimize.
[2024-05-24 05:53:47] [INFO ] Deduced a trap composed of 50 places in 91 ms of which 2 ms to minimize.
[2024-05-24 05:53:47] [INFO ] Deduced a trap composed of 35 places in 99 ms of which 2 ms to minimize.
[2024-05-24 05:53:47] [INFO ] Deduced a trap composed of 37 places in 106 ms of which 4 ms to minimize.
[2024-05-24 05:53:47] [INFO ] Deduced a trap composed of 34 places in 101 ms of which 2 ms to minimize.
[2024-05-24 05:53:47] [INFO ] Deduced a trap composed of 36 places in 94 ms of which 1 ms to minimize.
[2024-05-24 05:53:47] [INFO ] Deduced a trap composed of 31 places in 100 ms of which 2 ms to minimize.
[2024-05-24 05:53:47] [INFO ] Deduced a trap composed of 25 places in 99 ms of which 2 ms to minimize.
[2024-05-24 05:53:47] [INFO ] Deduced a trap composed of 37 places in 98 ms of which 2 ms to minimize.
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD263 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/266 variables, 20/122 constraints. Problems are: Problem set: 12 solved, 564 unsolved
[2024-05-24 05:53:47] [INFO ] Deduced a trap composed of 10 places in 54 ms of which 0 ms to minimize.
[2024-05-24 05:53:48] [INFO ] Deduced a trap composed of 10 places in 49 ms of which 1 ms to minimize.
[2024-05-24 05:53:48] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 1 ms to minimize.
[2024-05-24 05:53:48] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 0 ms to minimize.
[2024-05-24 05:53:48] [INFO ] Deduced a trap composed of 34 places in 102 ms of which 2 ms to minimize.
[2024-05-24 05:53:48] [INFO ] Deduced a trap composed of 36 places in 96 ms of which 1 ms to minimize.
[2024-05-24 05:53:48] [INFO ] Deduced a trap composed of 36 places in 99 ms of which 2 ms to minimize.
[2024-05-24 05:53:48] [INFO ] Deduced a trap composed of 38 places in 96 ms of which 1 ms to minimize.
[2024-05-24 05:53:48] [INFO ] Deduced a trap composed of 35 places in 96 ms of which 1 ms to minimize.
[2024-05-24 05:53:48] [INFO ] Deduced a trap composed of 40 places in 100 ms of which 2 ms to minimize.
[2024-05-24 05:53:48] [INFO ] Deduced a trap composed of 24 places in 99 ms of which 2 ms to minimize.
[2024-05-24 05:53:48] [INFO ] Deduced a trap composed of 38 places in 109 ms of which 1 ms to minimize.
[2024-05-24 05:53:49] [INFO ] Deduced a trap composed of 33 places in 105 ms of which 2 ms to minimize.
[2024-05-24 05:53:49] [INFO ] Deduced a trap composed of 25 places in 105 ms of which 2 ms to minimize.
[2024-05-24 05:53:49] [INFO ] Deduced a trap composed of 17 places in 101 ms of which 2 ms to minimize.
[2024-05-24 05:53:49] [INFO ] Deduced a trap composed of 29 places in 103 ms of which 6 ms to minimize.
[2024-05-24 05:53:49] [INFO ] Deduced a trap composed of 27 places in 93 ms of which 2 ms to minimize.
[2024-05-24 05:53:49] [INFO ] Deduced a trap composed of 15 places in 98 ms of which 1 ms to minimize.
[2024-05-24 05:53:49] [INFO ] Deduced a trap composed of 25 places in 115 ms of which 2 ms to minimize.
[2024-05-24 05:53:49] [INFO ] Deduced a trap composed of 17 places in 101 ms of which 2 ms to minimize.
Problem TDEAD151 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD261 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/266 variables, 20/142 constraints. Problems are: Problem set: 16 solved, 560 unsolved
[2024-05-24 05:53:52] [INFO ] Deduced a trap composed of 46 places in 91 ms of which 1 ms to minimize.
[2024-05-24 05:53:52] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 1 ms to minimize.
[2024-05-24 05:53:52] [INFO ] Deduced a trap composed of 21 places in 98 ms of which 2 ms to minimize.
[2024-05-24 05:53:52] [INFO ] Deduced a trap composed of 28 places in 94 ms of which 2 ms to minimize.
[2024-05-24 05:53:52] [INFO ] Deduced a trap composed of 51 places in 90 ms of which 2 ms to minimize.
[2024-05-24 05:53:52] [INFO ] Deduced a trap composed of 25 places in 90 ms of which 2 ms to minimize.
[2024-05-24 05:53:53] [INFO ] Deduced a trap composed of 42 places in 104 ms of which 1 ms to minimize.
[2024-05-24 05:53:53] [INFO ] Deduced a trap composed of 19 places in 101 ms of which 2 ms to minimize.
[2024-05-24 05:53:53] [INFO ] Deduced a trap composed of 28 places in 94 ms of which 1 ms to minimize.
[2024-05-24 05:53:53] [INFO ] Deduced a trap composed of 48 places in 102 ms of which 2 ms to minimize.
[2024-05-24 05:53:53] [INFO ] Deduced a trap composed of 35 places in 99 ms of which 2 ms to minimize.
[2024-05-24 05:53:53] [INFO ] Deduced a trap composed of 42 places in 94 ms of which 2 ms to minimize.
[2024-05-24 05:53:53] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
[2024-05-24 05:53:53] [INFO ] Deduced a trap composed of 40 places in 99 ms of which 2 ms to minimize.
[2024-05-24 05:53:53] [INFO ] Deduced a trap composed of 30 places in 102 ms of which 2 ms to minimize.
[2024-05-24 05:53:53] [INFO ] Deduced a trap composed of 34 places in 93 ms of which 1 ms to minimize.
[2024-05-24 05:53:54] [INFO ] Deduced a trap composed of 33 places in 94 ms of which 2 ms to minimize.
[2024-05-24 05:53:54] [INFO ] Deduced a trap composed of 32 places in 107 ms of which 2 ms to minimize.
[2024-05-24 05:53:54] [INFO ] Deduced a trap composed of 24 places in 103 ms of which 2 ms to minimize.
[2024-05-24 05:53:54] [INFO ] Deduced a trap composed of 37 places in 101 ms of which 1 ms to minimize.
Problem TDEAD156 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD326 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/266 variables, 20/162 constraints. Problems are: Problem set: 20 solved, 556 unsolved
[2024-05-24 05:53:54] [INFO ] Deduced a trap composed of 39 places in 118 ms of which 2 ms to minimize.
[2024-05-24 05:53:54] [INFO ] Deduced a trap composed of 31 places in 98 ms of which 2 ms to minimize.
[2024-05-24 05:53:54] [INFO ] Deduced a trap composed of 25 places in 101 ms of which 2 ms to minimize.
[2024-05-24 05:53:55] [INFO ] Deduced a trap composed of 33 places in 108 ms of which 2 ms to minimize.
[2024-05-24 05:53:55] [INFO ] Deduced a trap composed of 14 places in 96 ms of which 2 ms to minimize.
[2024-05-24 05:53:55] [INFO ] Deduced a trap composed of 34 places in 95 ms of which 2 ms to minimize.
[2024-05-24 05:53:55] [INFO ] Deduced a trap composed of 9 places in 89 ms of which 1 ms to minimize.
[2024-05-24 05:53:55] [INFO ] Deduced a trap composed of 27 places in 93 ms of which 2 ms to minimize.
[2024-05-24 05:53:55] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
[2024-05-24 05:53:55] [INFO ] Deduced a trap composed of 15 places in 101 ms of which 2 ms to minimize.
[2024-05-24 05:53:56] [INFO ] Deduced a trap composed of 42 places in 104 ms of which 2 ms to minimize.
[2024-05-24 05:53:56] [INFO ] Deduced a trap composed of 15 places in 88 ms of which 1 ms to minimize.
[2024-05-24 05:53:56] [INFO ] Deduced a trap composed of 20 places in 106 ms of which 2 ms to minimize.
[2024-05-24 05:53:56] [INFO ] Deduced a trap composed of 35 places in 108 ms of which 1 ms to minimize.
[2024-05-24 05:53:56] [INFO ] Deduced a trap composed of 29 places in 103 ms of which 2 ms to minimize.
[2024-05-24 05:53:56] [INFO ] Deduced a trap composed of 22 places in 91 ms of which 2 ms to minimize.
[2024-05-24 05:53:56] [INFO ] Deduced a trap composed of 43 places in 98 ms of which 2 ms to minimize.
[2024-05-24 05:53:56] [INFO ] Deduced a trap composed of 9 places in 96 ms of which 2 ms to minimize.
[2024-05-24 05:53:56] [INFO ] Deduced a trap composed of 23 places in 92 ms of which 1 ms to minimize.
[2024-05-24 05:53:57] [INFO ] Deduced a trap composed of 42 places in 95 ms of which 2 ms to minimize.
Problem TDEAD97 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD322 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/266 variables, 20/182 constraints. Problems are: Problem set: 29 solved, 547 unsolved
[2024-05-24 05:53:57] [INFO ] Deduced a trap composed of 22 places in 87 ms of which 2 ms to minimize.
[2024-05-24 05:53:57] [INFO ] Deduced a trap composed of 19 places in 91 ms of which 1 ms to minimize.
[2024-05-24 05:53:57] [INFO ] Deduced a trap composed of 15 places in 84 ms of which 1 ms to minimize.
Problem TDEAD88 is UNSAT
[2024-05-24 05:53:57] [INFO ] Deduced a trap composed of 34 places in 99 ms of which 2 ms to minimize.
[2024-05-24 05:53:58] [INFO ] Deduced a trap composed of 8 places in 102 ms of which 2 ms to minimize.
[2024-05-24 05:53:58] [INFO ] Deduced a trap composed of 25 places in 104 ms of which 2 ms to minimize.
[2024-05-24 05:53:58] [INFO ] Deduced a trap composed of 39 places in 93 ms of which 2 ms to minimize.
[2024-05-24 05:53:58] [INFO ] Deduced a trap composed of 36 places in 103 ms of which 2 ms to minimize.
[2024-05-24 05:53:58] [INFO ] Deduced a trap composed of 30 places in 97 ms of which 1 ms to minimize.
[2024-05-24 05:53:58] [INFO ] Deduced a trap composed of 34 places in 108 ms of which 2 ms to minimize.
[2024-05-24 05:53:58] [INFO ] Deduced a trap composed of 39 places in 101 ms of which 2 ms to minimize.
[2024-05-24 05:53:58] [INFO ] Deduced a trap composed of 25 places in 93 ms of which 2 ms to minimize.
[2024-05-24 05:53:58] [INFO ] Deduced a trap composed of 32 places in 95 ms of which 2 ms to minimize.
[2024-05-24 05:53:59] [INFO ] Deduced a trap composed of 33 places in 95 ms of which 1 ms to minimize.
[2024-05-24 05:53:59] [INFO ] Deduced a trap composed of 26 places in 100 ms of which 2 ms to minimize.
[2024-05-24 05:53:59] [INFO ] Deduced a trap composed of 29 places in 92 ms of which 1 ms to minimize.
[2024-05-24 05:53:59] [INFO ] Deduced a trap composed of 9 places in 84 ms of which 1 ms to minimize.
[2024-05-24 05:53:59] [INFO ] Deduced a trap composed of 31 places in 90 ms of which 2 ms to minimize.
[2024-05-24 05:53:59] [INFO ] Deduced a trap composed of 37 places in 82 ms of which 1 ms to minimize.
[2024-05-24 05:53:59] [INFO ] Deduced a trap composed of 39 places in 80 ms of which 2 ms to minimize.
Problem TDEAD88 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD327 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/266 variables, 20/202 constraints. Problems are: Problem set: 35 solved, 541 unsolved
[2024-05-24 05:54:02] [INFO ] Deduced a trap composed of 31 places in 98 ms of which 1 ms to minimize.
[2024-05-24 05:54:02] [INFO ] Deduced a trap composed of 45 places in 88 ms of which 1 ms to minimize.
[2024-05-24 05:54:02] [INFO ] Deduced a trap composed of 38 places in 88 ms of which 2 ms to minimize.
[2024-05-24 05:54:02] [INFO ] Deduced a trap composed of 46 places in 94 ms of which 1 ms to minimize.
[2024-05-24 05:54:03] [INFO ] Deduced a trap composed of 38 places in 83 ms of which 1 ms to minimize.
[2024-05-24 05:54:03] [INFO ] Deduced a trap composed of 27 places in 108 ms of which 2 ms to minimize.
[2024-05-24 05:54:03] [INFO ] Deduced a trap composed of 30 places in 98 ms of which 2 ms to minimize.
[2024-05-24 05:54:03] [INFO ] Deduced a trap composed of 30 places in 88 ms of which 1 ms to minimize.
[2024-05-24 05:54:03] [INFO ] Deduced a trap composed of 31 places in 97 ms of which 1 ms to minimize.
[2024-05-24 05:54:03] [INFO ] Deduced a trap composed of 32 places in 95 ms of which 1 ms to minimize.
[2024-05-24 05:54:03] [INFO ] Deduced a trap composed of 34 places in 84 ms of which 1 ms to minimize.
[2024-05-24 05:54:03] [INFO ] Deduced a trap composed of 37 places in 85 ms of which 3 ms to minimize.
[2024-05-24 05:54:03] [INFO ] Deduced a trap composed of 27 places in 84 ms of which 1 ms to minimize.
[2024-05-24 05:54:03] [INFO ] Deduced a trap composed of 32 places in 97 ms of which 1 ms to minimize.
[2024-05-24 05:54:04] [INFO ] Deduced a trap composed of 32 places in 74 ms of which 2 ms to minimize.
[2024-05-24 05:54:04] [INFO ] Deduced a trap composed of 28 places in 82 ms of which 1 ms to minimize.
[2024-05-24 05:54:04] [INFO ] Deduced a trap composed of 26 places in 86 ms of which 1 ms to minimize.
[2024-05-24 05:54:04] [INFO ] Deduced a trap composed of 32 places in 94 ms of which 1 ms to minimize.
[2024-05-24 05:54:04] [INFO ] Deduced a trap composed of 22 places in 98 ms of which 1 ms to minimize.
[2024-05-24 05:54:04] [INFO ] Deduced a trap composed of 27 places in 100 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/266 variables, 20/222 constraints. Problems are: Problem set: 35 solved, 541 unsolved
[2024-05-24 05:54:05] [INFO ] Deduced a trap composed of 25 places in 104 ms of which 1 ms to minimize.
[2024-05-24 05:54:05] [INFO ] Deduced a trap composed of 43 places in 102 ms of which 3 ms to minimize.
[2024-05-24 05:54:05] [INFO ] Deduced a trap composed of 44 places in 101 ms of which 3 ms to minimize.
[2024-05-24 05:54:05] [INFO ] Deduced a trap composed of 30 places in 93 ms of which 2 ms to minimize.
[2024-05-24 05:54:05] [INFO ] Deduced a trap composed of 39 places in 98 ms of which 1 ms to minimize.
[2024-05-24 05:54:05] [INFO ] Deduced a trap composed of 29 places in 95 ms of which 2 ms to minimize.
[2024-05-24 05:54:05] [INFO ] Deduced a trap composed of 33 places in 93 ms of which 1 ms to minimize.
[2024-05-24 05:54:06] [INFO ] Deduced a trap composed of 27 places in 108 ms of which 1 ms to minimize.
[2024-05-24 05:54:06] [INFO ] Deduced a trap composed of 31 places in 87 ms of which 2 ms to minimize.
[2024-05-24 05:54:06] [INFO ] Deduced a trap composed of 33 places in 93 ms of which 2 ms to minimize.
[2024-05-24 05:54:06] [INFO ] Deduced a trap composed of 32 places in 91 ms of which 1 ms to minimize.
[2024-05-24 05:54:06] [INFO ] Deduced a trap composed of 35 places in 87 ms of which 2 ms to minimize.
[2024-05-24 05:54:06] [INFO ] Deduced a trap composed of 37 places in 91 ms of which 1 ms to minimize.
[2024-05-24 05:54:06] [INFO ] Deduced a trap composed of 33 places in 88 ms of which 2 ms to minimize.
[2024-05-24 05:54:06] [INFO ] Deduced a trap composed of 31 places in 83 ms of which 1 ms to minimize.
[2024-05-24 05:54:06] [INFO ] Deduced a trap composed of 39 places in 90 ms of which 1 ms to minimize.
[2024-05-24 05:54:06] [INFO ] Deduced a trap composed of 33 places in 89 ms of which 1 ms to minimize.
[2024-05-24 05:54:06] [INFO ] Deduced a trap composed of 33 places in 98 ms of which 1 ms to minimize.
[2024-05-24 05:54:07] [INFO ] Deduced a trap composed of 42 places in 99 ms of which 2 ms to minimize.
[2024-05-24 05:54:07] [INFO ] Deduced a trap composed of 35 places in 99 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/266 variables, 20/242 constraints. Problems are: Problem set: 35 solved, 541 unsolved
[2024-05-24 05:54:07] [INFO ] Deduced a trap composed of 33 places in 107 ms of which 2 ms to minimize.
[2024-05-24 05:54:07] [INFO ] Deduced a trap composed of 32 places in 115 ms of which 1 ms to minimize.
[2024-05-24 05:54:07] [INFO ] Deduced a trap composed of 27 places in 100 ms of which 2 ms to minimize.
[2024-05-24 05:54:07] [INFO ] Deduced a trap composed of 44 places in 99 ms of which 2 ms to minimize.
[2024-05-24 05:54:08] [INFO ] Deduced a trap composed of 39 places in 105 ms of which 4 ms to minimize.
[2024-05-24 05:54:08] [INFO ] Deduced a trap composed of 32 places in 83 ms of which 2 ms to minimize.
[2024-05-24 05:54:08] [INFO ] Deduced a trap composed of 29 places in 92 ms of which 1 ms to minimize.
[2024-05-24 05:54:08] [INFO ] Deduced a trap composed of 28 places in 93 ms of which 1 ms to minimize.
[2024-05-24 05:54:08] [INFO ] Deduced a trap composed of 28 places in 81 ms of which 1 ms to minimize.
[2024-05-24 05:54:08] [INFO ] Deduced a trap composed of 51 places in 87 ms of which 1 ms to minimize.
[2024-05-24 05:54:08] [INFO ] Deduced a trap composed of 37 places in 96 ms of which 2 ms to minimize.
[2024-05-24 05:54:08] [INFO ] Deduced a trap composed of 35 places in 91 ms of which 1 ms to minimize.
[2024-05-24 05:54:08] [INFO ] Deduced a trap composed of 34 places in 92 ms of which 1 ms to minimize.
[2024-05-24 05:54:08] [INFO ] Deduced a trap composed of 34 places in 90 ms of which 2 ms to minimize.
[2024-05-24 05:54:09] [INFO ] Deduced a trap composed of 31 places in 102 ms of which 2 ms to minimize.
[2024-05-24 05:54:09] [INFO ] Deduced a trap composed of 9 places in 105 ms of which 2 ms to minimize.
[2024-05-24 05:54:09] [INFO ] Deduced a trap composed of 35 places in 90 ms of which 1 ms to minimize.
[2024-05-24 05:54:09] [INFO ] Deduced a trap composed of 44 places in 86 ms of which 1 ms to minimize.
[2024-05-24 05:54:09] [INFO ] Deduced a trap composed of 41 places in 100 ms of which 2 ms to minimize.
[2024-05-24 05:54:09] [INFO ] Deduced a trap composed of 42 places in 95 ms of which 1 ms to minimize.
Problem TDEAD155 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD323 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/266 variables, 20/262 constraints. Problems are: Problem set: 38 solved, 538 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 266/682 variables, and 262 constraints, problems are : Problem set: 38 solved, 538 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 82/82 constraints, State Equation: 0/266 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 576/576 constraints, Known Traps: 180/180 constraints]
Escalating to Integer solving :Problem set: 38 solved, 538 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/258 variables, 10/10 constraints. Problems are: Problem set: 38 solved, 538 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/258 variables, 124/134 constraints. Problems are: Problem set: 38 solved, 538 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/258 variables, 0/134 constraints. Problems are: Problem set: 38 solved, 538 unsolved
At refinement iteration 3 (OVERLAPS) 8/266 variables, 72/206 constraints. Problems are: Problem set: 38 solved, 538 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/266 variables, 56/262 constraints. Problems are: Problem set: 38 solved, 538 unsolved
[2024-05-24 05:54:14] [INFO ] Deduced a trap composed of 10 places in 49 ms of which 0 ms to minimize.
[2024-05-24 05:54:14] [INFO ] Deduced a trap composed of 35 places in 87 ms of which 2 ms to minimize.
[2024-05-24 05:54:14] [INFO ] Deduced a trap composed of 37 places in 79 ms of which 2 ms to minimize.
[2024-05-24 05:54:14] [INFO ] Deduced a trap composed of 22 places in 86 ms of which 1 ms to minimize.
[2024-05-24 05:54:14] [INFO ] Deduced a trap composed of 18 places in 80 ms of which 1 ms to minimize.
[2024-05-24 05:54:14] [INFO ] Deduced a trap composed of 37 places in 82 ms of which 1 ms to minimize.
[2024-05-24 05:54:14] [INFO ] Deduced a trap composed of 30 places in 83 ms of which 1 ms to minimize.
[2024-05-24 05:54:14] [INFO ] Deduced a trap composed of 28 places in 81 ms of which 1 ms to minimize.
[2024-05-24 05:54:14] [INFO ] Deduced a trap composed of 24 places in 85 ms of which 1 ms to minimize.
[2024-05-24 05:54:14] [INFO ] Deduced a trap composed of 35 places in 76 ms of which 1 ms to minimize.
[2024-05-24 05:54:15] [INFO ] Deduced a trap composed of 24 places in 77 ms of which 1 ms to minimize.
[2024-05-24 05:54:15] [INFO ] Deduced a trap composed of 29 places in 72 ms of which 1 ms to minimize.
[2024-05-24 05:54:15] [INFO ] Deduced a trap composed of 14 places in 95 ms of which 2 ms to minimize.
[2024-05-24 05:54:15] [INFO ] Deduced a trap composed of 35 places in 98 ms of which 2 ms to minimize.
[2024-05-24 05:54:15] [INFO ] Deduced a trap composed of 34 places in 96 ms of which 2 ms to minimize.
[2024-05-24 05:54:15] [INFO ] Deduced a trap composed of 28 places in 94 ms of which 2 ms to minimize.
[2024-05-24 05:54:16] [INFO ] Deduced a trap composed of 25 places in 99 ms of which 2 ms to minimize.
[2024-05-24 05:54:16] [INFO ] Deduced a trap composed of 34 places in 96 ms of which 2 ms to minimize.
[2024-05-24 05:54:16] [INFO ] Deduced a trap composed of 37 places in 76 ms of which 1 ms to minimize.
[2024-05-24 05:54:16] [INFO ] Deduced a trap composed of 31 places in 80 ms of which 2 ms to minimize.
Problem TDEAD106 is UNSAT
Problem TDEAD205 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/266 variables, 20/282 constraints. Problems are: Problem set: 40 solved, 536 unsolved
[2024-05-24 05:54:17] [INFO ] Deduced a trap composed of 32 places in 109 ms of which 1 ms to minimize.
[2024-05-24 05:54:17] [INFO ] Deduced a trap composed of 25 places in 91 ms of which 2 ms to minimize.
[2024-05-24 05:54:17] [INFO ] Deduced a trap composed of 39 places in 89 ms of which 2 ms to minimize.
[2024-05-24 05:54:17] [INFO ] Deduced a trap composed of 19 places in 104 ms of which 1 ms to minimize.
[2024-05-24 05:54:17] [INFO ] Deduced a trap composed of 17 places in 101 ms of which 2 ms to minimize.
[2024-05-24 05:54:17] [INFO ] Deduced a trap composed of 39 places in 109 ms of which 1 ms to minimize.
[2024-05-24 05:54:17] [INFO ] Deduced a trap composed of 17 places in 108 ms of which 1 ms to minimize.
[2024-05-24 05:54:17] [INFO ] Deduced a trap composed of 17 places in 114 ms of which 2 ms to minimize.
[2024-05-24 05:54:17] [INFO ] Deduced a trap composed of 22 places in 122 ms of which 1 ms to minimize.
[2024-05-24 05:54:18] [INFO ] Deduced a trap composed of 34 places in 105 ms of which 1 ms to minimize.
[2024-05-24 05:54:18] [INFO ] Deduced a trap composed of 33 places in 109 ms of which 1 ms to minimize.
[2024-05-24 05:54:18] [INFO ] Deduced a trap composed of 41 places in 110 ms of which 2 ms to minimize.
[2024-05-24 05:54:18] [INFO ] Deduced a trap composed of 24 places in 102 ms of which 1 ms to minimize.
[2024-05-24 05:54:18] [INFO ] Deduced a trap composed of 22 places in 103 ms of which 1 ms to minimize.
[2024-05-24 05:54:18] [INFO ] Deduced a trap composed of 18 places in 108 ms of which 2 ms to minimize.
[2024-05-24 05:54:18] [INFO ] Deduced a trap composed of 33 places in 97 ms of which 1 ms to minimize.
[2024-05-24 05:54:18] [INFO ] Deduced a trap composed of 27 places in 98 ms of which 1 ms to minimize.
[2024-05-24 05:54:19] [INFO ] Deduced a trap composed of 22 places in 101 ms of which 2 ms to minimize.
[2024-05-24 05:54:19] [INFO ] Deduced a trap composed of 36 places in 113 ms of which 3 ms to minimize.
[2024-05-24 05:54:19] [INFO ] Deduced a trap composed of 34 places in 118 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/266 variables, 20/302 constraints. Problems are: Problem set: 40 solved, 536 unsolved
[2024-05-24 05:54:19] [INFO ] Deduced a trap composed of 35 places in 106 ms of which 1 ms to minimize.
[2024-05-24 05:54:20] [INFO ] Deduced a trap composed of 30 places in 112 ms of which 1 ms to minimize.
[2024-05-24 05:54:20] [INFO ] Deduced a trap composed of 29 places in 102 ms of which 1 ms to minimize.
[2024-05-24 05:54:20] [INFO ] Deduced a trap composed of 41 places in 125 ms of which 2 ms to minimize.
[2024-05-24 05:54:20] [INFO ] Deduced a trap composed of 46 places in 115 ms of which 1 ms to minimize.
[2024-05-24 05:54:20] [INFO ] Deduced a trap composed of 35 places in 92 ms of which 1 ms to minimize.
[2024-05-24 05:54:20] [INFO ] Deduced a trap composed of 26 places in 115 ms of which 1 ms to minimize.
[2024-05-24 05:54:20] [INFO ] Deduced a trap composed of 32 places in 114 ms of which 2 ms to minimize.
[2024-05-24 05:54:20] [INFO ] Deduced a trap composed of 38 places in 114 ms of which 2 ms to minimize.
[2024-05-24 05:54:21] [INFO ] Deduced a trap composed of 41 places in 121 ms of which 2 ms to minimize.
[2024-05-24 05:54:21] [INFO ] Deduced a trap composed of 47 places in 105 ms of which 1 ms to minimize.
[2024-05-24 05:54:21] [INFO ] Deduced a trap composed of 42 places in 112 ms of which 3 ms to minimize.
[2024-05-24 05:54:21] [INFO ] Deduced a trap composed of 33 places in 151 ms of which 2 ms to minimize.
[2024-05-24 05:54:21] [INFO ] Deduced a trap composed of 30 places in 115 ms of which 2 ms to minimize.
[2024-05-24 05:54:21] [INFO ] Deduced a trap composed of 28 places in 104 ms of which 2 ms to minimize.
[2024-05-24 05:54:21] [INFO ] Deduced a trap composed of 30 places in 104 ms of which 2 ms to minimize.
[2024-05-24 05:54:21] [INFO ] Deduced a trap composed of 27 places in 98 ms of which 2 ms to minimize.
[2024-05-24 05:54:22] [INFO ] Deduced a trap composed of 31 places in 106 ms of which 1 ms to minimize.
[2024-05-24 05:54:22] [INFO ] Deduced a trap composed of 33 places in 97 ms of which 2 ms to minimize.
[2024-05-24 05:54:22] [INFO ] Deduced a trap composed of 29 places in 99 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/266 variables, 20/322 constraints. Problems are: Problem set: 40 solved, 536 unsolved
[2024-05-24 05:54:23] [INFO ] Deduced a trap composed of 34 places in 105 ms of which 4 ms to minimize.
[2024-05-24 05:54:23] [INFO ] Deduced a trap composed of 31 places in 106 ms of which 2 ms to minimize.
[2024-05-24 05:54:23] [INFO ] Deduced a trap composed of 36 places in 93 ms of which 2 ms to minimize.
[2024-05-24 05:54:23] [INFO ] Deduced a trap composed of 33 places in 120 ms of which 2 ms to minimize.
[2024-05-24 05:54:23] [INFO ] Deduced a trap composed of 26 places in 91 ms of which 2 ms to minimize.
[2024-05-24 05:54:23] [INFO ] Deduced a trap composed of 42 places in 105 ms of which 2 ms to minimize.
[2024-05-24 05:54:23] [INFO ] Deduced a trap composed of 35 places in 104 ms of which 1 ms to minimize.
[2024-05-24 05:54:23] [INFO ] Deduced a trap composed of 36 places in 104 ms of which 2 ms to minimize.
[2024-05-24 05:54:24] [INFO ] Deduced a trap composed of 36 places in 109 ms of which 3 ms to minimize.
[2024-05-24 05:54:24] [INFO ] Deduced a trap composed of 35 places in 101 ms of which 1 ms to minimize.
[2024-05-24 05:54:24] [INFO ] Deduced a trap composed of 27 places in 105 ms of which 1 ms to minimize.
[2024-05-24 05:54:24] [INFO ] Deduced a trap composed of 17 places in 111 ms of which 1 ms to minimize.
[2024-05-24 05:54:24] [INFO ] Deduced a trap composed of 34 places in 110 ms of which 2 ms to minimize.
[2024-05-24 05:54:24] [INFO ] Deduced a trap composed of 19 places in 111 ms of which 2 ms to minimize.
[2024-05-24 05:54:24] [INFO ] Deduced a trap composed of 29 places in 94 ms of which 1 ms to minimize.
[2024-05-24 05:54:24] [INFO ] Deduced a trap composed of 43 places in 106 ms of which 4 ms to minimize.
[2024-05-24 05:54:24] [INFO ] Deduced a trap composed of 39 places in 92 ms of which 1 ms to minimize.
[2024-05-24 05:54:25] [INFO ] Deduced a trap composed of 30 places in 119 ms of which 5 ms to minimize.
[2024-05-24 05:54:25] [INFO ] Deduced a trap composed of 31 places in 99 ms of which 1 ms to minimize.
[2024-05-24 05:54:25] [INFO ] Deduced a trap composed of 38 places in 104 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/266 variables, 20/342 constraints. Problems are: Problem set: 40 solved, 536 unsolved
[2024-05-24 05:54:25] [INFO ] Deduced a trap composed of 24 places in 102 ms of which 1 ms to minimize.
[2024-05-24 05:54:25] [INFO ] Deduced a trap composed of 29 places in 107 ms of which 2 ms to minimize.
[2024-05-24 05:54:26] [INFO ] Deduced a trap composed of 45 places in 105 ms of which 1 ms to minimize.
[2024-05-24 05:54:26] [INFO ] Deduced a trap composed of 32 places in 107 ms of which 2 ms to minimize.
[2024-05-24 05:54:26] [INFO ] Deduced a trap composed of 34 places in 115 ms of which 1 ms to minimize.
[2024-05-24 05:54:26] [INFO ] Deduced a trap composed of 33 places in 114 ms of which 1 ms to minimize.
[2024-05-24 05:54:26] [INFO ] Deduced a trap composed of 29 places in 110 ms of which 2 ms to minimize.
[2024-05-24 05:54:26] [INFO ] Deduced a trap composed of 32 places in 99 ms of which 2 ms to minimize.
[2024-05-24 05:54:26] [INFO ] Deduced a trap composed of 32 places in 104 ms of which 1 ms to minimize.
[2024-05-24 05:54:26] [INFO ] Deduced a trap composed of 34 places in 115 ms of which 1 ms to minimize.
[2024-05-24 05:54:27] [INFO ] Deduced a trap composed of 39 places in 119 ms of which 1 ms to minimize.
[2024-05-24 05:54:27] [INFO ] Deduced a trap composed of 26 places in 106 ms of which 1 ms to minimize.
[2024-05-24 05:54:27] [INFO ] Deduced a trap composed of 36 places in 94 ms of which 2 ms to minimize.
[2024-05-24 05:54:27] [INFO ] Deduced a trap composed of 35 places in 98 ms of which 1 ms to minimize.
[2024-05-24 05:54:27] [INFO ] Deduced a trap composed of 29 places in 109 ms of which 2 ms to minimize.
[2024-05-24 05:54:27] [INFO ] Deduced a trap composed of 26 places in 84 ms of which 2 ms to minimize.
[2024-05-24 05:54:27] [INFO ] Deduced a trap composed of 43 places in 115 ms of which 1 ms to minimize.
[2024-05-24 05:54:27] [INFO ] Deduced a trap composed of 39 places in 102 ms of which 2 ms to minimize.
[2024-05-24 05:54:27] [INFO ] Deduced a trap composed of 20 places in 132 ms of which 2 ms to minimize.
[2024-05-24 05:54:28] [INFO ] Deduced a trap composed of 31 places in 122 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/266 variables, 20/362 constraints. Problems are: Problem set: 40 solved, 536 unsolved
[2024-05-24 05:54:28] [INFO ] Deduced a trap composed of 35 places in 110 ms of which 1 ms to minimize.
[2024-05-24 05:54:29] [INFO ] Deduced a trap composed of 14 places in 115 ms of which 2 ms to minimize.
[2024-05-24 05:54:29] [INFO ] Deduced a trap composed of 35 places in 102 ms of which 1 ms to minimize.
[2024-05-24 05:54:29] [INFO ] Deduced a trap composed of 31 places in 110 ms of which 1 ms to minimize.
[2024-05-24 05:54:29] [INFO ] Deduced a trap composed of 29 places in 101 ms of which 1 ms to minimize.
[2024-05-24 05:54:29] [INFO ] Deduced a trap composed of 48 places in 111 ms of which 2 ms to minimize.
[2024-05-24 05:54:29] [INFO ] Deduced a trap composed of 31 places in 99 ms of which 1 ms to minimize.
[2024-05-24 05:54:29] [INFO ] Deduced a trap composed of 33 places in 83 ms of which 1 ms to minimize.
[2024-05-24 05:54:29] [INFO ] Deduced a trap composed of 41 places in 94 ms of which 2 ms to minimize.
[2024-05-24 05:54:29] [INFO ] Deduced a trap composed of 40 places in 73 ms of which 2 ms to minimize.
[2024-05-24 05:54:30] [INFO ] Deduced a trap composed of 36 places in 89 ms of which 2 ms to minimize.
[2024-05-24 05:54:30] [INFO ] Deduced a trap composed of 39 places in 90 ms of which 2 ms to minimize.
[2024-05-24 05:54:30] [INFO ] Deduced a trap composed of 40 places in 89 ms of which 1 ms to minimize.
[2024-05-24 05:54:30] [INFO ] Deduced a trap composed of 31 places in 85 ms of which 1 ms to minimize.
[2024-05-24 05:54:30] [INFO ] Deduced a trap composed of 30 places in 92 ms of which 2 ms to minimize.
[2024-05-24 05:54:30] [INFO ] Deduced a trap composed of 35 places in 84 ms of which 2 ms to minimize.
[2024-05-24 05:54:30] [INFO ] Deduced a trap composed of 36 places in 90 ms of which 2 ms to minimize.
[2024-05-24 05:54:30] [INFO ] Deduced a trap composed of 29 places in 86 ms of which 2 ms to minimize.
[2024-05-24 05:54:30] [INFO ] Deduced a trap composed of 39 places in 86 ms of which 2 ms to minimize.
[2024-05-24 05:54:30] [INFO ] Deduced a trap composed of 33 places in 83 ms of which 2 ms to minimize.
Problem TDEAD124 is UNSAT
Problem TDEAD225 is UNSAT
At refinement iteration 10 (INCLUDED_ONLY) 0/266 variables, 20/382 constraints. Problems are: Problem set: 42 solved, 534 unsolved
[2024-05-24 05:54:31] [INFO ] Deduced a trap composed of 30 places in 100 ms of which 1 ms to minimize.
[2024-05-24 05:54:31] [INFO ] Deduced a trap composed of 37 places in 93 ms of which 1 ms to minimize.
[2024-05-24 05:54:31] [INFO ] Deduced a trap composed of 30 places in 90 ms of which 1 ms to minimize.
[2024-05-24 05:54:31] [INFO ] Deduced a trap composed of 32 places in 88 ms of which 1 ms to minimize.
[2024-05-24 05:54:31] [INFO ] Deduced a trap composed of 29 places in 103 ms of which 2 ms to minimize.
[2024-05-24 05:54:31] [INFO ] Deduced a trap composed of 33 places in 95 ms of which 1 ms to minimize.
[2024-05-24 05:54:31] [INFO ] Deduced a trap composed of 28 places in 94 ms of which 2 ms to minimize.
[2024-05-24 05:54:32] [INFO ] Deduced a trap composed of 37 places in 104 ms of which 1 ms to minimize.
[2024-05-24 05:54:32] [INFO ] Deduced a trap composed of 25 places in 99 ms of which 2 ms to minimize.
[2024-05-24 05:54:32] [INFO ] Deduced a trap composed of 41 places in 92 ms of which 2 ms to minimize.
[2024-05-24 05:54:32] [INFO ] Deduced a trap composed of 34 places in 100 ms of which 2 ms to minimize.
[2024-05-24 05:54:32] [INFO ] Deduced a trap composed of 32 places in 86 ms of which 2 ms to minimize.
[2024-05-24 05:54:32] [INFO ] Deduced a trap composed of 40 places in 85 ms of which 1 ms to minimize.
[2024-05-24 05:54:32] [INFO ] Deduced a trap composed of 43 places in 75 ms of which 1 ms to minimize.
[2024-05-24 05:54:32] [INFO ] Deduced a trap composed of 24 places in 79 ms of which 1 ms to minimize.
[2024-05-24 05:54:32] [INFO ] Deduced a trap composed of 31 places in 83 ms of which 1 ms to minimize.
[2024-05-24 05:54:32] [INFO ] Deduced a trap composed of 35 places in 93 ms of which 1 ms to minimize.
[2024-05-24 05:54:33] [INFO ] Deduced a trap composed of 32 places in 79 ms of which 1 ms to minimize.
[2024-05-24 05:54:33] [INFO ] Deduced a trap composed of 32 places in 83 ms of which 1 ms to minimize.
[2024-05-24 05:54:33] [INFO ] Deduced a trap composed of 38 places in 85 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/266 variables, 20/402 constraints. Problems are: Problem set: 42 solved, 534 unsolved
[2024-05-24 05:54:33] [INFO ] Deduced a trap composed of 41 places in 93 ms of which 1 ms to minimize.
[2024-05-24 05:54:34] [INFO ] Deduced a trap composed of 38 places in 90 ms of which 1 ms to minimize.
[2024-05-24 05:54:34] [INFO ] Deduced a trap composed of 35 places in 87 ms of which 1 ms to minimize.
[2024-05-24 05:54:34] [INFO ] Deduced a trap composed of 32 places in 90 ms of which 1 ms to minimize.
[2024-05-24 05:54:34] [INFO ] Deduced a trap composed of 33 places in 77 ms of which 1 ms to minimize.
[2024-05-24 05:54:34] [INFO ] Deduced a trap composed of 31 places in 77 ms of which 1 ms to minimize.
[2024-05-24 05:54:34] [INFO ] Deduced a trap composed of 42 places in 76 ms of which 1 ms to minimize.
[2024-05-24 05:54:34] [INFO ] Deduced a trap composed of 36 places in 77 ms of which 1 ms to minimize.
[2024-05-24 05:54:34] [INFO ] Deduced a trap composed of 41 places in 78 ms of which 1 ms to minimize.
[2024-05-24 05:54:35] [INFO ] Deduced a trap composed of 35 places in 75 ms of which 1 ms to minimize.
[2024-05-24 05:54:35] [INFO ] Deduced a trap composed of 43 places in 68 ms of which 1 ms to minimize.
[2024-05-24 05:54:35] [INFO ] Deduced a trap composed of 38 places in 72 ms of which 2 ms to minimize.
[2024-05-24 05:54:35] [INFO ] Deduced a trap composed of 28 places in 74 ms of which 2 ms to minimize.
[2024-05-24 05:54:35] [INFO ] Deduced a trap composed of 32 places in 73 ms of which 1 ms to minimize.
[2024-05-24 05:54:35] [INFO ] Deduced a trap composed of 34 places in 77 ms of which 2 ms to minimize.
[2024-05-24 05:54:35] [INFO ] Deduced a trap composed of 33 places in 78 ms of which 1 ms to minimize.
[2024-05-24 05:54:35] [INFO ] Deduced a trap composed of 27 places in 69 ms of which 1 ms to minimize.
[2024-05-24 05:54:35] [INFO ] Deduced a trap composed of 21 places in 80 ms of which 1 ms to minimize.
[2024-05-24 05:54:35] [INFO ] Deduced a trap composed of 21 places in 84 ms of which 1 ms to minimize.
[2024-05-24 05:54:36] [INFO ] Deduced a trap composed of 30 places in 78 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/266 variables, 20/422 constraints. Problems are: Problem set: 42 solved, 534 unsolved
[2024-05-24 05:54:36] [INFO ] Deduced a trap composed of 28 places in 92 ms of which 2 ms to minimize.
[2024-05-24 05:54:36] [INFO ] Deduced a trap composed of 34 places in 93 ms of which 2 ms to minimize.
[2024-05-24 05:54:36] [INFO ] Deduced a trap composed of 40 places in 92 ms of which 2 ms to minimize.
[2024-05-24 05:54:36] [INFO ] Deduced a trap composed of 31 places in 88 ms of which 1 ms to minimize.
[2024-05-24 05:54:36] [INFO ] Deduced a trap composed of 44 places in 86 ms of which 2 ms to minimize.
[2024-05-24 05:54:37] [INFO ] Deduced a trap composed of 43 places in 82 ms of which 1 ms to minimize.
[2024-05-24 05:54:37] [INFO ] Deduced a trap composed of 36 places in 83 ms of which 2 ms to minimize.
[2024-05-24 05:54:37] [INFO ] Deduced a trap composed of 41 places in 98 ms of which 2 ms to minimize.
[2024-05-24 05:54:37] [INFO ] Deduced a trap composed of 32 places in 99 ms of which 2 ms to minimize.
[2024-05-24 05:54:37] [INFO ] Deduced a trap composed of 27 places in 95 ms of which 1 ms to minimize.
[2024-05-24 05:54:37] [INFO ] Deduced a trap composed of 34 places in 89 ms of which 1 ms to minimize.
[2024-05-24 05:54:37] [INFO ] Deduced a trap composed of 27 places in 87 ms of which 2 ms to minimize.
[2024-05-24 05:54:37] [INFO ] Deduced a trap composed of 44 places in 84 ms of which 2 ms to minimize.
[2024-05-24 05:54:37] [INFO ] Deduced a trap composed of 50 places in 78 ms of which 1 ms to minimize.
[2024-05-24 05:54:37] [INFO ] Deduced a trap composed of 43 places in 84 ms of which 1 ms to minimize.
[2024-05-24 05:54:37] [INFO ] Deduced a trap composed of 39 places in 81 ms of which 1 ms to minimize.
[2024-05-24 05:54:38] [INFO ] Deduced a trap composed of 41 places in 80 ms of which 1 ms to minimize.
[2024-05-24 05:54:38] [INFO ] Deduced a trap composed of 36 places in 84 ms of which 3 ms to minimize.
[2024-05-24 05:54:38] [INFO ] Deduced a trap composed of 37 places in 74 ms of which 1 ms to minimize.
[2024-05-24 05:54:38] [INFO ] Deduced a trap composed of 32 places in 71 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/266 variables, 20/442 constraints. Problems are: Problem set: 42 solved, 534 unsolved
[2024-05-24 05:54:39] [INFO ] Deduced a trap composed of 31 places in 92 ms of which 1 ms to minimize.
[2024-05-24 05:54:39] [INFO ] Deduced a trap composed of 41 places in 101 ms of which 1 ms to minimize.
[2024-05-24 05:54:39] [INFO ] Deduced a trap composed of 33 places in 89 ms of which 1 ms to minimize.
[2024-05-24 05:54:39] [INFO ] Deduced a trap composed of 33 places in 108 ms of which 2 ms to minimize.
[2024-05-24 05:54:39] [INFO ] Deduced a trap composed of 30 places in 92 ms of which 2 ms to minimize.
[2024-05-24 05:54:39] [INFO ] Deduced a trap composed of 32 places in 97 ms of which 1 ms to minimize.
[2024-05-24 05:54:39] [INFO ] Deduced a trap composed of 40 places in 100 ms of which 2 ms to minimize.
[2024-05-24 05:54:39] [INFO ] Deduced a trap composed of 38 places in 93 ms of which 1 ms to minimize.
[2024-05-24 05:54:39] [INFO ] Deduced a trap composed of 35 places in 90 ms of which 2 ms to minimize.
[2024-05-24 05:54:40] [INFO ] Deduced a trap composed of 34 places in 88 ms of which 2 ms to minimize.
[2024-05-24 05:54:40] [INFO ] Deduced a trap composed of 45 places in 89 ms of which 1 ms to minimize.
[2024-05-24 05:54:40] [INFO ] Deduced a trap composed of 40 places in 102 ms of which 1 ms to minimize.
[2024-05-24 05:54:40] [INFO ] Deduced a trap composed of 38 places in 93 ms of which 2 ms to minimize.
[2024-05-24 05:54:40] [INFO ] Deduced a trap composed of 31 places in 90 ms of which 1 ms to minimize.
SMT process timed out in 60511ms, After SMT, problems are : Problem set: 42 solved, 534 unsolved
Search for dead transitions found 42 dead transitions in 60533ms
Found 42 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 42 transitions
Dead transitions reduction (with SMT) removed 42 transitions
Starting structural reductions in LTL mode, iteration 1 : 266/266 places, 542/584 transitions.
Applied a total of 0 rules in 7 ms. Remains 266 /266 variables (removed 0) and now considering 542/542 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61124 ms. Remains : 266/266 places, 542/584 transitions.
Support contains 266 out of 266 places after structural reductions.
[2024-05-24 05:54:40] [INFO ] Flatten gal took : 88 ms
[2024-05-24 05:54:41] [INFO ] Flatten gal took : 98 ms
[2024-05-24 05:54:41] [INFO ] Input system was already deterministic with 542 transitions.
Reduction of identical properties reduced properties to check from 46 to 36
RANDOM walk for 40000 steps (8 resets) in 3227 ms. (12 steps per ms) remains 3/36 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1704 ms. (23 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 133 ms. (298 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 180 ms. (221 steps per ms) remains 3/3 properties
[2024-05-24 05:54:43] [INFO ] Flow matrix only has 387 transitions (discarded 155 similar events)
// Phase 1: matrix 387 rows 266 cols
[2024-05-24 05:54:43] [INFO ] Computed 82 invariants in 6 ms
[2024-05-24 05:54:43] [INFO ] State equation strengthened by 107 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 201/250 variables, 73/74 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-24 05:54:43] [INFO ] Deduced a trap composed of 46 places in 88 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/250 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/250 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 387/637 variables, 250/325 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/637 variables, 107/432 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/637 variables, 0/432 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 16/653 variables, 16/448 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/653 variables, 8/456 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/653 variables, 0/456 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 0/653 variables, 0/456 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 653/653 variables, and 456 constraints, problems are : Problem set: 0 solved, 3 unsolved in 407 ms.
Refiners :[Positive P Invariants (semi-flows): 82/82 constraints, State Equation: 266/266 constraints, ReadFeed: 107/107 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 201/250 variables, 73/74 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/250 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-24 05:54:44] [INFO ] Deduced a trap composed of 61 places in 93 ms of which 2 ms to minimize.
[2024-05-24 05:54:44] [INFO ] Deduced a trap composed of 42 places in 85 ms of which 2 ms to minimize.
[2024-05-24 05:54:44] [INFO ] Deduced a trap composed of 47 places in 91 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/250 variables, 3/78 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/250 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 387/637 variables, 250/328 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/637 variables, 107/435 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/637 variables, 2/437 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/637 variables, 0/437 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 16/653 variables, 16/453 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/653 variables, 8/461 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/653 variables, 1/462 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-24 05:54:45] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/653 variables, 1/463 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/653 variables, 0/463 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 0/653 variables, 0/463 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 653/653 variables, and 463 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1778 ms.
Refiners :[Positive P Invariants (semi-flows): 82/82 constraints, State Equation: 266/266 constraints, ReadFeed: 107/107 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 5/5 constraints]
After SMT, in 2252ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 1684 ms.
Support contains 49 out of 266 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 266/266 places, 542/542 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 16 place count 258 transition count 534
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 0 with 8 rules applied. Total rules applied 24 place count 258 transition count 526
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 32 place count 250 transition count 526
Applied a total of 32 rules in 85 ms. Remains 250 /266 variables (removed 16) and now considering 526/542 (removed 16) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 85 ms. Remains : 250/266 places, 526/542 transitions.
RANDOM walk for 40000 steps (8 resets) in 708 ms. (56 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 554 ms. (72 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 153 ms. (259 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 85 ms. (465 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 350661 steps, run timeout after 3001 ms. (steps per millisecond=116 ) properties seen :0 out of 3
Probabilistic random walk after 350661 steps, saw 186457 distinct states, run finished after 3004 ms. (steps per millisecond=116 ) properties seen :0
[2024-05-24 05:54:50] [INFO ] Flow matrix only has 371 transitions (discarded 155 similar events)
// Phase 1: matrix 371 rows 250 cols
[2024-05-24 05:54:50] [INFO ] Computed 82 invariants in 2 ms
[2024-05-24 05:54:50] [INFO ] State equation strengthened by 107 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 185/234 variables, 73/74 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-24 05:54:51] [INFO ] Deduced a trap composed of 46 places in 126 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/234 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/234 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 371/605 variables, 234/309 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/605 variables, 107/416 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/605 variables, 0/416 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 16/621 variables, 16/432 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/621 variables, 8/440 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/621 variables, 0/440 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 0/621 variables, 0/440 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 621/621 variables, and 440 constraints, problems are : Problem set: 0 solved, 3 unsolved in 451 ms.
Refiners :[Positive P Invariants (semi-flows): 82/82 constraints, State Equation: 250/250 constraints, ReadFeed: 107/107 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 185/234 variables, 73/74 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/234 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-24 05:54:51] [INFO ] Deduced a trap composed of 42 places in 108 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/234 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/234 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 371/605 variables, 234/310 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/605 variables, 107/417 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/605 variables, 2/419 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/605 variables, 0/419 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 16/621 variables, 16/435 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/621 variables, 8/443 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/621 variables, 1/444 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-24 05:54:52] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/621 variables, 1/445 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/621 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-24 05:54:52] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 0 ms to minimize.
At refinement iteration 15 (OVERLAPS) 0/621 variables, 1/446 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/621 variables, 0/446 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 0/621 variables, 0/446 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 621/621 variables, and 446 constraints, problems are : Problem set: 0 solved, 3 unsolved in 2103 ms.
Refiners :[Positive P Invariants (semi-flows): 82/82 constraints, State Equation: 250/250 constraints, ReadFeed: 107/107 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 4/4 constraints]
After SMT, in 2607ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 9766 ms.
Support contains 49 out of 250 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 250/250 places, 526/526 transitions.
Applied a total of 0 rules in 15 ms. Remains 250 /250 variables (removed 0) and now considering 526/526 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 250/250 places, 526/526 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 250/250 places, 526/526 transitions.
Applied a total of 0 rules in 14 ms. Remains 250 /250 variables (removed 0) and now considering 526/526 (removed 0) transitions.
[2024-05-24 05:55:03] [INFO ] Flow matrix only has 371 transitions (discarded 155 similar events)
[2024-05-24 05:55:03] [INFO ] Invariant cache hit.
[2024-05-24 05:55:03] [INFO ] Implicit Places using invariants in 225 ms returned [154, 155, 156, 157, 158, 159, 160, 161]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 230 ms to find 8 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 242/250 places, 526/526 transitions.
Applied a total of 0 rules in 13 ms. Remains 242 /242 variables (removed 0) and now considering 526/526 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 257 ms. Remains : 242/250 places, 526/526 transitions.
RANDOM walk for 40000 steps (8 resets) in 390 ms. (102 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 382 ms. (104 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 151 ms. (263 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 127 ms. (312 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 338956 steps, run timeout after 3001 ms. (steps per millisecond=112 ) properties seen :0 out of 3
Probabilistic random walk after 338956 steps, saw 180509 distinct states, run finished after 3001 ms. (steps per millisecond=112 ) properties seen :0
[2024-05-24 05:55:06] [INFO ] Flow matrix only has 371 transitions (discarded 155 similar events)
// Phase 1: matrix 371 rows 242 cols
[2024-05-24 05:55:06] [INFO ] Computed 74 invariants in 5 ms
[2024-05-24 05:55:06] [INFO ] State equation strengthened by 43 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 177/226 variables, 65/66 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-24 05:55:07] [INFO ] Deduced a trap composed of 46 places in 130 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/226 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/226 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 371/597 variables, 226/293 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/597 variables, 43/336 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/597 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 16/613 variables, 16/352 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/613 variables, 8/360 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/613 variables, 0/360 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 0/613 variables, 0/360 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 613/613 variables, and 360 constraints, problems are : Problem set: 0 solved, 3 unsolved in 397 ms.
Refiners :[Positive P Invariants (semi-flows): 74/74 constraints, State Equation: 242/242 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 177/226 variables, 65/66 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/226 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-24 05:55:07] [INFO ] Deduced a trap composed of 44 places in 108 ms of which 1 ms to minimize.
[2024-05-24 05:55:07] [INFO ] Deduced a trap composed of 48 places in 110 ms of which 1 ms to minimize.
[2024-05-24 05:55:07] [INFO ] Deduced a trap composed of 49 places in 98 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/226 variables, 3/70 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/226 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 371/597 variables, 226/296 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/597 variables, 43/339 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/597 variables, 2/341 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/597 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 16/613 variables, 16/357 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/613 variables, 8/365 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/613 variables, 1/366 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/613 variables, 0/366 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 0/613 variables, 0/366 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 613/613 variables, and 366 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1553 ms.
Refiners :[Positive P Invariants (semi-flows): 74/74 constraints, State Equation: 242/242 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 4/4 constraints]
After SMT, in 2016ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1016 ms.
Support contains 49 out of 242 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 242/242 places, 526/526 transitions.
Applied a total of 0 rules in 11 ms. Remains 242 /242 variables (removed 0) and now considering 526/526 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 242/242 places, 526/526 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 242/242 places, 526/526 transitions.
Applied a total of 0 rules in 11 ms. Remains 242 /242 variables (removed 0) and now considering 526/526 (removed 0) transitions.
[2024-05-24 05:55:09] [INFO ] Flow matrix only has 371 transitions (discarded 155 similar events)
[2024-05-24 05:55:10] [INFO ] Invariant cache hit.
[2024-05-24 05:55:10] [INFO ] Implicit Places using invariants in 160 ms returned []
[2024-05-24 05:55:10] [INFO ] Flow matrix only has 371 transitions (discarded 155 similar events)
[2024-05-24 05:55:10] [INFO ] Invariant cache hit.
[2024-05-24 05:55:10] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-05-24 05:55:10] [INFO ] Implicit Places using invariants and state equation in 339 ms returned []
Implicit Place search using SMT with State Equation took 501 ms to find 0 implicit places.
[2024-05-24 05:55:10] [INFO ] Redundant transitions in 32 ms returned []
Running 518 sub problems to find dead transitions.
[2024-05-24 05:55:10] [INFO ] Flow matrix only has 371 transitions (discarded 155 similar events)
[2024-05-24 05:55:10] [INFO ] Invariant cache hit.
[2024-05-24 05:55:10] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/234 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 518 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/234 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 518 unsolved
At refinement iteration 2 (OVERLAPS) 8/242 variables, 64/74 constraints. Problems are: Problem set: 0 solved, 518 unsolved
[2024-05-24 05:55:15] [INFO ] Deduced a trap composed of 15 places in 86 ms of which 2 ms to minimize.
[2024-05-24 05:55:15] [INFO ] Deduced a trap composed of 10 places in 86 ms of which 1 ms to minimize.
[2024-05-24 05:55:15] [INFO ] Deduced a trap composed of 10 places in 81 ms of which 1 ms to minimize.
[2024-05-24 05:55:15] [INFO ] Deduced a trap composed of 9 places in 88 ms of which 2 ms to minimize.
[2024-05-24 05:55:15] [INFO ] Deduced a trap composed of 9 places in 93 ms of which 1 ms to minimize.
[2024-05-24 05:55:15] [INFO ] Deduced a trap composed of 19 places in 100 ms of which 2 ms to minimize.
[2024-05-24 05:55:15] [INFO ] Deduced a trap composed of 20 places in 95 ms of which 1 ms to minimize.
[2024-05-24 05:55:15] [INFO ] Deduced a trap composed of 27 places in 106 ms of which 1 ms to minimize.
[2024-05-24 05:55:15] [INFO ] Deduced a trap composed of 15 places in 84 ms of which 1 ms to minimize.
[2024-05-24 05:55:16] [INFO ] Deduced a trap composed of 25 places in 85 ms of which 1 ms to minimize.
[2024-05-24 05:55:16] [INFO ] Deduced a trap composed of 27 places in 78 ms of which 1 ms to minimize.
[2024-05-24 05:55:16] [INFO ] Deduced a trap composed of 22 places in 74 ms of which 1 ms to minimize.
[2024-05-24 05:55:16] [INFO ] Deduced a trap composed of 30 places in 77 ms of which 1 ms to minimize.
[2024-05-24 05:55:16] [INFO ] Deduced a trap composed of 10 places in 77 ms of which 2 ms to minimize.
[2024-05-24 05:55:16] [INFO ] Deduced a trap composed of 36 places in 103 ms of which 1 ms to minimize.
[2024-05-24 05:55:16] [INFO ] Deduced a trap composed of 16 places in 98 ms of which 1 ms to minimize.
[2024-05-24 05:55:16] [INFO ] Deduced a trap composed of 20 places in 104 ms of which 2 ms to minimize.
[2024-05-24 05:55:16] [INFO ] Deduced a trap composed of 15 places in 86 ms of which 1 ms to minimize.
[2024-05-24 05:55:16] [INFO ] Deduced a trap composed of 9 places in 86 ms of which 1 ms to minimize.
[2024-05-24 05:55:16] [INFO ] Deduced a trap composed of 18 places in 86 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/242 variables, 20/94 constraints. Problems are: Problem set: 0 solved, 518 unsolved
[2024-05-24 05:55:19] [INFO ] Deduced a trap composed of 12 places in 98 ms of which 1 ms to minimize.
[2024-05-24 05:55:19] [INFO ] Deduced a trap composed of 13 places in 97 ms of which 1 ms to minimize.
[2024-05-24 05:55:19] [INFO ] Deduced a trap composed of 16 places in 100 ms of which 1 ms to minimize.
[2024-05-24 05:55:19] [INFO ] Deduced a trap composed of 10 places in 91 ms of which 1 ms to minimize.
[2024-05-24 05:55:19] [INFO ] Deduced a trap composed of 28 places in 101 ms of which 2 ms to minimize.
[2024-05-24 05:55:19] [INFO ] Deduced a trap composed of 10 places in 70 ms of which 1 ms to minimize.
[2024-05-24 05:55:19] [INFO ] Deduced a trap composed of 7 places in 90 ms of which 1 ms to minimize.
[2024-05-24 05:55:19] [INFO ] Deduced a trap composed of 12 places in 83 ms of which 2 ms to minimize.
[2024-05-24 05:55:19] [INFO ] Deduced a trap composed of 7 places in 91 ms of which 2 ms to minimize.
[2024-05-24 05:55:19] [INFO ] Deduced a trap composed of 15 places in 99 ms of which 2 ms to minimize.
[2024-05-24 05:55:20] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 1 ms to minimize.
[2024-05-24 05:55:20] [INFO ] Deduced a trap composed of 10 places in 40 ms of which 0 ms to minimize.
[2024-05-24 05:55:20] [INFO ] Deduced a trap composed of 7 places in 39 ms of which 1 ms to minimize.
[2024-05-24 05:55:20] [INFO ] Deduced a trap composed of 10 places in 60 ms of which 1 ms to minimize.
[2024-05-24 05:55:20] [INFO ] Deduced a trap composed of 24 places in 134 ms of which 1 ms to minimize.
[2024-05-24 05:55:20] [INFO ] Deduced a trap composed of 35 places in 117 ms of which 2 ms to minimize.
[2024-05-24 05:55:20] [INFO ] Deduced a trap composed of 17 places in 101 ms of which 1 ms to minimize.
[2024-05-24 05:55:21] [INFO ] Deduced a trap composed of 30 places in 98 ms of which 2 ms to minimize.
[2024-05-24 05:55:21] [INFO ] Deduced a trap composed of 23 places in 110 ms of which 1 ms to minimize.
[2024-05-24 05:55:21] [INFO ] Deduced a trap composed of 30 places in 103 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/242 variables, 20/114 constraints. Problems are: Problem set: 0 solved, 518 unsolved
[2024-05-24 05:55:21] [INFO ] Deduced a trap composed of 9 places in 105 ms of which 1 ms to minimize.
[2024-05-24 05:55:21] [INFO ] Deduced a trap composed of 28 places in 98 ms of which 2 ms to minimize.
[2024-05-24 05:55:21] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 1 ms to minimize.
[2024-05-24 05:55:22] [INFO ] Deduced a trap composed of 35 places in 109 ms of which 1 ms to minimize.
[2024-05-24 05:55:22] [INFO ] Deduced a trap composed of 29 places in 106 ms of which 2 ms to minimize.
[2024-05-24 05:55:22] [INFO ] Deduced a trap composed of 27 places in 103 ms of which 2 ms to minimize.
[2024-05-24 05:55:22] [INFO ] Deduced a trap composed of 29 places in 104 ms of which 2 ms to minimize.
[2024-05-24 05:55:22] [INFO ] Deduced a trap composed of 16 places in 116 ms of which 1 ms to minimize.
[2024-05-24 05:55:22] [INFO ] Deduced a trap composed of 28 places in 111 ms of which 1 ms to minimize.
[2024-05-24 05:55:22] [INFO ] Deduced a trap composed of 20 places in 100 ms of which 1 ms to minimize.
[2024-05-24 05:55:22] [INFO ] Deduced a trap composed of 15 places in 91 ms of which 1 ms to minimize.
[2024-05-24 05:55:22] [INFO ] Deduced a trap composed of 20 places in 87 ms of which 1 ms to minimize.
[2024-05-24 05:55:23] [INFO ] Deduced a trap composed of 30 places in 108 ms of which 1 ms to minimize.
[2024-05-24 05:55:23] [INFO ] Deduced a trap composed of 7 places in 106 ms of which 2 ms to minimize.
[2024-05-24 05:55:23] [INFO ] Deduced a trap composed of 30 places in 113 ms of which 1 ms to minimize.
[2024-05-24 05:55:23] [INFO ] Deduced a trap composed of 23 places in 101 ms of which 1 ms to minimize.
[2024-05-24 05:55:23] [INFO ] Deduced a trap composed of 20 places in 121 ms of which 1 ms to minimize.
[2024-05-24 05:55:23] [INFO ] Deduced a trap composed of 19 places in 103 ms of which 2 ms to minimize.
[2024-05-24 05:55:23] [INFO ] Deduced a trap composed of 34 places in 116 ms of which 1 ms to minimize.
[2024-05-24 05:55:23] [INFO ] Deduced a trap composed of 39 places in 111 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/242 variables, 20/134 constraints. Problems are: Problem set: 0 solved, 518 unsolved
[2024-05-24 05:55:24] [INFO ] Deduced a trap composed of 7 places in 45 ms of which 1 ms to minimize.
[2024-05-24 05:55:24] [INFO ] Deduced a trap composed of 29 places in 87 ms of which 1 ms to minimize.
[2024-05-24 05:55:24] [INFO ] Deduced a trap composed of 29 places in 88 ms of which 1 ms to minimize.
[2024-05-24 05:55:24] [INFO ] Deduced a trap composed of 30 places in 90 ms of which 1 ms to minimize.
[2024-05-24 05:55:24] [INFO ] Deduced a trap composed of 26 places in 95 ms of which 1 ms to minimize.
[2024-05-24 05:55:24] [INFO ] Deduced a trap composed of 34 places in 91 ms of which 1 ms to minimize.
[2024-05-24 05:55:24] [INFO ] Deduced a trap composed of 33 places in 88 ms of which 1 ms to minimize.
[2024-05-24 05:55:24] [INFO ] Deduced a trap composed of 38 places in 77 ms of which 1 ms to minimize.
[2024-05-24 05:55:25] [INFO ] Deduced a trap composed of 43 places in 120 ms of which 2 ms to minimize.
[2024-05-24 05:55:25] [INFO ] Deduced a trap composed of 22 places in 98 ms of which 1 ms to minimize.
[2024-05-24 05:55:25] [INFO ] Deduced a trap composed of 39 places in 91 ms of which 1 ms to minimize.
[2024-05-24 05:55:25] [INFO ] Deduced a trap composed of 42 places in 93 ms of which 2 ms to minimize.
[2024-05-24 05:55:25] [INFO ] Deduced a trap composed of 26 places in 96 ms of which 2 ms to minimize.
[2024-05-24 05:55:25] [INFO ] Deduced a trap composed of 25 places in 96 ms of which 1 ms to minimize.
[2024-05-24 05:55:25] [INFO ] Deduced a trap composed of 13 places in 77 ms of which 1 ms to minimize.
[2024-05-24 05:55:25] [INFO ] Deduced a trap composed of 41 places in 107 ms of which 1 ms to minimize.
[2024-05-24 05:55:26] [INFO ] Deduced a trap composed of 9 places in 97 ms of which 1 ms to minimize.
[2024-05-24 05:55:26] [INFO ] Deduced a trap composed of 33 places in 95 ms of which 2 ms to minimize.
[2024-05-24 05:55:26] [INFO ] Deduced a trap composed of 28 places in 114 ms of which 1 ms to minimize.
[2024-05-24 05:55:26] [INFO ] Deduced a trap composed of 29 places in 106 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/242 variables, 20/154 constraints. Problems are: Problem set: 0 solved, 518 unsolved
[2024-05-24 05:55:28] [INFO ] Deduced a trap composed of 29 places in 88 ms of which 2 ms to minimize.
[2024-05-24 05:55:28] [INFO ] Deduced a trap composed of 29 places in 83 ms of which 1 ms to minimize.
[2024-05-24 05:55:29] [INFO ] Deduced a trap composed of 7 places in 34 ms of which 0 ms to minimize.
[2024-05-24 05:55:29] [INFO ] Deduced a trap composed of 26 places in 95 ms of which 2 ms to minimize.
[2024-05-24 05:55:29] [INFO ] Deduced a trap composed of 25 places in 112 ms of which 2 ms to minimize.
[2024-05-24 05:55:29] [INFO ] Deduced a trap composed of 19 places in 94 ms of which 1 ms to minimize.
[2024-05-24 05:55:29] [INFO ] Deduced a trap composed of 21 places in 92 ms of which 1 ms to minimize.
[2024-05-24 05:55:29] [INFO ] Deduced a trap composed of 24 places in 78 ms of which 1 ms to minimize.
[2024-05-24 05:55:29] [INFO ] Deduced a trap composed of 17 places in 72 ms of which 1 ms to minimize.
[2024-05-24 05:55:29] [INFO ] Deduced a trap composed of 24 places in 68 ms of which 1 ms to minimize.
[2024-05-24 05:55:29] [INFO ] Deduced a trap composed of 17 places in 77 ms of which 1 ms to minimize.
[2024-05-24 05:55:30] [INFO ] Deduced a trap composed of 13 places in 66 ms of which 1 ms to minimize.
[2024-05-24 05:55:30] [INFO ] Deduced a trap composed of 24 places in 109 ms of which 1 ms to minimize.
[2024-05-24 05:55:30] [INFO ] Deduced a trap composed of 18 places in 112 ms of which 2 ms to minimize.
[2024-05-24 05:55:30] [INFO ] Deduced a trap composed of 32 places in 118 ms of which 2 ms to minimize.
[2024-05-24 05:55:30] [INFO ] Deduced a trap composed of 36 places in 105 ms of which 1 ms to minimize.
[2024-05-24 05:55:30] [INFO ] Deduced a trap composed of 24 places in 105 ms of which 1 ms to minimize.
[2024-05-24 05:55:30] [INFO ] Deduced a trap composed of 32 places in 105 ms of which 2 ms to minimize.
[2024-05-24 05:55:30] [INFO ] Deduced a trap composed of 39 places in 98 ms of which 1 ms to minimize.
[2024-05-24 05:55:30] [INFO ] Deduced a trap composed of 28 places in 97 ms of which 1 ms to minimize.
Problem TDEAD121 is UNSAT
Problem TDEAD210 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/242 variables, 20/174 constraints. Problems are: Problem set: 2 solved, 516 unsolved
[2024-05-24 05:55:31] [INFO ] Deduced a trap composed of 28 places in 83 ms of which 1 ms to minimize.
[2024-05-24 05:55:31] [INFO ] Deduced a trap composed of 30 places in 81 ms of which 1 ms to minimize.
[2024-05-24 05:55:31] [INFO ] Deduced a trap composed of 24 places in 78 ms of which 1 ms to minimize.
[2024-05-24 05:55:31] [INFO ] Deduced a trap composed of 36 places in 124 ms of which 1 ms to minimize.
[2024-05-24 05:55:31] [INFO ] Deduced a trap composed of 25 places in 105 ms of which 1 ms to minimize.
[2024-05-24 05:55:32] [INFO ] Deduced a trap composed of 37 places in 102 ms of which 2 ms to minimize.
[2024-05-24 05:55:32] [INFO ] Deduced a trap composed of 15 places in 106 ms of which 1 ms to minimize.
[2024-05-24 05:55:32] [INFO ] Deduced a trap composed of 14 places in 109 ms of which 2 ms to minimize.
[2024-05-24 05:55:32] [INFO ] Deduced a trap composed of 27 places in 112 ms of which 2 ms to minimize.
[2024-05-24 05:55:32] [INFO ] Deduced a trap composed of 14 places in 98 ms of which 2 ms to minimize.
[2024-05-24 05:55:32] [INFO ] Deduced a trap composed of 34 places in 98 ms of which 1 ms to minimize.
[2024-05-24 05:55:32] [INFO ] Deduced a trap composed of 18 places in 93 ms of which 2 ms to minimize.
[2024-05-24 05:55:32] [INFO ] Deduced a trap composed of 26 places in 98 ms of which 2 ms to minimize.
[2024-05-24 05:55:32] [INFO ] Deduced a trap composed of 15 places in 96 ms of which 1 ms to minimize.
[2024-05-24 05:55:33] [INFO ] Deduced a trap composed of 38 places in 106 ms of which 1 ms to minimize.
[2024-05-24 05:55:33] [INFO ] Deduced a trap composed of 41 places in 104 ms of which 2 ms to minimize.
[2024-05-24 05:55:33] [INFO ] Deduced a trap composed of 33 places in 102 ms of which 1 ms to minimize.
[2024-05-24 05:55:33] [INFO ] Deduced a trap composed of 15 places in 73 ms of which 1 ms to minimize.
[2024-05-24 05:55:33] [INFO ] Deduced a trap composed of 18 places in 61 ms of which 1 ms to minimize.
[2024-05-24 05:55:33] [INFO ] Deduced a trap composed of 25 places in 79 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/242 variables, 20/194 constraints. Problems are: Problem set: 2 solved, 516 unsolved
[2024-05-24 05:55:33] [INFO ] Deduced a trap composed of 33 places in 93 ms of which 1 ms to minimize.
[2024-05-24 05:55:33] [INFO ] Deduced a trap composed of 30 places in 107 ms of which 1 ms to minimize.
[2024-05-24 05:55:34] [INFO ] Deduced a trap composed of 27 places in 94 ms of which 1 ms to minimize.
[2024-05-24 05:55:34] [INFO ] Deduced a trap composed of 21 places in 90 ms of which 1 ms to minimize.
[2024-05-24 05:55:34] [INFO ] Deduced a trap composed of 15 places in 84 ms of which 1 ms to minimize.
[2024-05-24 05:55:34] [INFO ] Deduced a trap composed of 18 places in 85 ms of which 1 ms to minimize.
[2024-05-24 05:55:34] [INFO ] Deduced a trap composed of 29 places in 79 ms of which 1 ms to minimize.
[2024-05-24 05:55:34] [INFO ] Deduced a trap composed of 21 places in 98 ms of which 1 ms to minimize.
[2024-05-24 05:55:34] [INFO ] Deduced a trap composed of 14 places in 91 ms of which 1 ms to minimize.
[2024-05-24 05:55:34] [INFO ] Deduced a trap composed of 32 places in 84 ms of which 2 ms to minimize.
[2024-05-24 05:55:34] [INFO ] Deduced a trap composed of 13 places in 88 ms of which 1 ms to minimize.
[2024-05-24 05:55:34] [INFO ] Deduced a trap composed of 21 places in 92 ms of which 1 ms to minimize.
[2024-05-24 05:55:35] [INFO ] Deduced a trap composed of 19 places in 110 ms of which 2 ms to minimize.
[2024-05-24 05:55:35] [INFO ] Deduced a trap composed of 7 places in 149 ms of which 1 ms to minimize.
[2024-05-24 05:55:35] [INFO ] Deduced a trap composed of 25 places in 99 ms of which 2 ms to minimize.
[2024-05-24 05:55:35] [INFO ] Deduced a trap composed of 25 places in 106 ms of which 1 ms to minimize.
[2024-05-24 05:55:35] [INFO ] Deduced a trap composed of 33 places in 108 ms of which 2 ms to minimize.
[2024-05-24 05:55:35] [INFO ] Deduced a trap composed of 29 places in 113 ms of which 1 ms to minimize.
[2024-05-24 05:55:36] [INFO ] Deduced a trap composed of 16 places in 102 ms of which 2 ms to minimize.
[2024-05-24 05:55:36] [INFO ] Deduced a trap composed of 17 places in 105 ms of which 2 ms to minimize.
Problem TDEAD130 is UNSAT
Problem TDEAD220 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/242 variables, 20/214 constraints. Problems are: Problem set: 4 solved, 514 unsolved
[2024-05-24 05:55:38] [INFO ] Deduced a trap composed of 9 places in 89 ms of which 1 ms to minimize.
[2024-05-24 05:55:38] [INFO ] Deduced a trap composed of 23 places in 82 ms of which 1 ms to minimize.
[2024-05-24 05:55:38] [INFO ] Deduced a trap composed of 35 places in 85 ms of which 1 ms to minimize.
[2024-05-24 05:55:39] [INFO ] Deduced a trap composed of 14 places in 113 ms of which 1 ms to minimize.
[2024-05-24 05:55:39] [INFO ] Deduced a trap composed of 30 places in 90 ms of which 2 ms to minimize.
[2024-05-24 05:55:39] [INFO ] Deduced a trap composed of 21 places in 101 ms of which 2 ms to minimize.
[2024-05-24 05:55:39] [INFO ] Deduced a trap composed of 21 places in 79 ms of which 1 ms to minimize.
[2024-05-24 05:55:39] [INFO ] Deduced a trap composed of 13 places in 75 ms of which 1 ms to minimize.
[2024-05-24 05:55:39] [INFO ] Deduced a trap composed of 28 places in 95 ms of which 1 ms to minimize.
[2024-05-24 05:55:39] [INFO ] Deduced a trap composed of 30 places in 102 ms of which 1 ms to minimize.
[2024-05-24 05:55:40] [INFO ] Deduced a trap composed of 32 places in 96 ms of which 1 ms to minimize.
[2024-05-24 05:55:40] [INFO ] Deduced a trap composed of 27 places in 104 ms of which 2 ms to minimize.
[2024-05-24 05:55:40] [INFO ] Deduced a trap composed of 17 places in 84 ms of which 1 ms to minimize.
[2024-05-24 05:55:40] [INFO ] Deduced a trap composed of 15 places in 86 ms of which 1 ms to minimize.
[2024-05-24 05:55:40] [INFO ] Deduced a trap composed of 19 places in 70 ms of which 1 ms to minimize.
[2024-05-24 05:55:40] [INFO ] Deduced a trap composed of 13 places in 64 ms of which 1 ms to minimize.
[2024-05-24 05:55:40] [INFO ] Deduced a trap composed of 29 places in 101 ms of which 1 ms to minimize.
[2024-05-24 05:55:40] [INFO ] Deduced a trap composed of 29 places in 96 ms of which 1 ms to minimize.
[2024-05-24 05:55:40] [INFO ] Deduced a trap composed of 18 places in 95 ms of which 2 ms to minimize.
SMT process timed out in 30347ms, After SMT, problems are : Problem set: 4 solved, 514 unsolved
Search for dead transitions found 4 dead transitions in 30353ms
Found 4 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 4 transitions
Dead transitions reduction (with SMT) removed 4 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 242/242 places, 522/526 transitions.
Applied a total of 0 rules in 10 ms. Remains 242 /242 variables (removed 0) and now considering 522/522 (removed 0) transitions.
[2024-05-24 05:55:40] [INFO ] Redundant transitions in 3 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 30928 ms. Remains : 242/242 places, 522/526 transitions.
RANDOM walk for 40000 steps (8 resets) in 380 ms. (104 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 539 ms. (74 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 253 ms. (157 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 140 ms. (283 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 338792 steps, run timeout after 3001 ms. (steps per millisecond=112 ) properties seen :0 out of 3
Probabilistic random walk after 338792 steps, saw 180449 distinct states, run finished after 3002 ms. (steps per millisecond=112 ) properties seen :0
[2024-05-24 05:55:44] [INFO ] Flow matrix only has 369 transitions (discarded 153 similar events)
// Phase 1: matrix 369 rows 242 cols
[2024-05-24 05:55:44] [INFO ] Computed 74 invariants in 3 ms
[2024-05-24 05:55:44] [INFO ] State equation strengthened by 41 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 177/226 variables, 65/66 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-24 05:55:44] [INFO ] Deduced a trap composed of 46 places in 107 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/226 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/226 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 369/595 variables, 226/293 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/595 variables, 41/334 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/595 variables, 0/334 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 16/611 variables, 16/350 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/611 variables, 8/358 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/611 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 0/611 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 611/611 variables, and 358 constraints, problems are : Problem set: 0 solved, 3 unsolved in 400 ms.
Refiners :[Positive P Invariants (semi-flows): 74/74 constraints, State Equation: 242/242 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 177/226 variables, 65/66 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/226 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-24 05:55:45] [INFO ] Deduced a trap composed of 44 places in 119 ms of which 2 ms to minimize.
[2024-05-24 05:55:45] [INFO ] Deduced a trap composed of 48 places in 113 ms of which 1 ms to minimize.
[2024-05-24 05:55:45] [INFO ] Deduced a trap composed of 49 places in 112 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/226 variables, 3/70 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/226 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 369/595 variables, 226/296 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/595 variables, 41/337 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/595 variables, 2/339 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/595 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 16/611 variables, 16/355 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/611 variables, 8/363 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/611 variables, 1/364 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/611 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-24 05:55:46] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 0 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/611 variables, 1/365 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/611 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 0/611 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 611/611 variables, and 365 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1814 ms.
Refiners :[Positive P Invariants (semi-flows): 74/74 constraints, State Equation: 242/242 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 5/5 constraints]
After SMT, in 2263ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 337 ms.
Support contains 49 out of 242 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 242/242 places, 522/522 transitions.
Applied a total of 0 rules in 9 ms. Remains 242 /242 variables (removed 0) and now considering 522/522 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 242/242 places, 522/522 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 242/242 places, 522/522 transitions.
Applied a total of 0 rules in 9 ms. Remains 242 /242 variables (removed 0) and now considering 522/522 (removed 0) transitions.
[2024-05-24 05:55:47] [INFO ] Flow matrix only has 369 transitions (discarded 153 similar events)
[2024-05-24 05:55:47] [INFO ] Invariant cache hit.
[2024-05-24 05:55:47] [INFO ] Implicit Places using invariants in 215 ms returned []
[2024-05-24 05:55:47] [INFO ] Flow matrix only has 369 transitions (discarded 153 similar events)
[2024-05-24 05:55:47] [INFO ] Invariant cache hit.
[2024-05-24 05:55:47] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-05-24 05:55:47] [INFO ] Implicit Places using invariants and state equation in 363 ms returned []
Implicit Place search using SMT with State Equation took 580 ms to find 0 implicit places.
[2024-05-24 05:55:47] [INFO ] Redundant transitions in 20 ms returned []
Running 514 sub problems to find dead transitions.
[2024-05-24 05:55:47] [INFO ] Flow matrix only has 369 transitions (discarded 153 similar events)
[2024-05-24 05:55:47] [INFO ] Invariant cache hit.
[2024-05-24 05:55:47] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/234 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 514 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/234 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 514 unsolved
At refinement iteration 2 (OVERLAPS) 8/242 variables, 64/74 constraints. Problems are: Problem set: 0 solved, 514 unsolved
[2024-05-24 05:55:52] [INFO ] Deduced a trap composed of 15 places in 76 ms of which 1 ms to minimize.
[2024-05-24 05:55:52] [INFO ] Deduced a trap composed of 20 places in 88 ms of which 1 ms to minimize.
[2024-05-24 05:55:52] [INFO ] Deduced a trap composed of 21 places in 86 ms of which 1 ms to minimize.
[2024-05-24 05:55:52] [INFO ] Deduced a trap composed of 12 places in 95 ms of which 1 ms to minimize.
[2024-05-24 05:55:52] [INFO ] Deduced a trap composed of 9 places in 88 ms of which 1 ms to minimize.
[2024-05-24 05:55:52] [INFO ] Deduced a trap composed of 18 places in 89 ms of which 1 ms to minimize.
[2024-05-24 05:55:52] [INFO ] Deduced a trap composed of 20 places in 83 ms of which 1 ms to minimize.
[2024-05-24 05:55:52] [INFO ] Deduced a trap composed of 9 places in 94 ms of which 1 ms to minimize.
[2024-05-24 05:55:52] [INFO ] Deduced a trap composed of 9 places in 77 ms of which 2 ms to minimize.
[2024-05-24 05:55:53] [INFO ] Deduced a trap composed of 10 places in 81 ms of which 1 ms to minimize.
[2024-05-24 05:55:53] [INFO ] Deduced a trap composed of 9 places in 88 ms of which 1 ms to minimize.
[2024-05-24 05:55:53] [INFO ] Deduced a trap composed of 9 places in 75 ms of which 1 ms to minimize.
[2024-05-24 05:55:53] [INFO ] Deduced a trap composed of 16 places in 76 ms of which 1 ms to minimize.
[2024-05-24 05:55:53] [INFO ] Deduced a trap composed of 18 places in 81 ms of which 1 ms to minimize.
[2024-05-24 05:55:53] [INFO ] Deduced a trap composed of 18 places in 83 ms of which 1 ms to minimize.
[2024-05-24 05:55:53] [INFO ] Deduced a trap composed of 9 places in 81 ms of which 1 ms to minimize.
[2024-05-24 05:55:53] [INFO ] Deduced a trap composed of 14 places in 85 ms of which 1 ms to minimize.
[2024-05-24 05:55:53] [INFO ] Deduced a trap composed of 13 places in 103 ms of which 1 ms to minimize.
[2024-05-24 05:55:53] [INFO ] Deduced a trap composed of 31 places in 95 ms of which 1 ms to minimize.
[2024-05-24 05:55:53] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/242 variables, 20/94 constraints. Problems are: Problem set: 0 solved, 514 unsolved
[2024-05-24 05:55:56] [INFO ] Deduced a trap composed of 18 places in 91 ms of which 1 ms to minimize.
[2024-05-24 05:55:56] [INFO ] Deduced a trap composed of 10 places in 96 ms of which 1 ms to minimize.
[2024-05-24 05:55:56] [INFO ] Deduced a trap composed of 23 places in 95 ms of which 1 ms to minimize.
[2024-05-24 05:55:56] [INFO ] Deduced a trap composed of 10 places in 99 ms of which 2 ms to minimize.
[2024-05-24 05:55:56] [INFO ] Deduced a trap composed of 10 places in 90 ms of which 1 ms to minimize.
[2024-05-24 05:55:56] [INFO ] Deduced a trap composed of 9 places in 94 ms of which 1 ms to minimize.
[2024-05-24 05:55:56] [INFO ] Deduced a trap composed of 12 places in 99 ms of which 2 ms to minimize.
[2024-05-24 05:55:56] [INFO ] Deduced a trap composed of 10 places in 90 ms of which 2 ms to minimize.
[2024-05-24 05:55:56] [INFO ] Deduced a trap composed of 13 places in 98 ms of which 1 ms to minimize.
[2024-05-24 05:55:56] [INFO ] Deduced a trap composed of 12 places in 95 ms of which 1 ms to minimize.
[2024-05-24 05:55:57] [INFO ] Deduced a trap composed of 7 places in 103 ms of which 2 ms to minimize.
[2024-05-24 05:55:57] [INFO ] Deduced a trap composed of 13 places in 104 ms of which 1 ms to minimize.
[2024-05-24 05:55:57] [INFO ] Deduced a trap composed of 25 places in 110 ms of which 1 ms to minimize.
[2024-05-24 05:55:57] [INFO ] Deduced a trap composed of 18 places in 105 ms of which 1 ms to minimize.
[2024-05-24 05:55:57] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 0 ms to minimize.
[2024-05-24 05:55:57] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 0 ms to minimize.
[2024-05-24 05:55:57] [INFO ] Deduced a trap composed of 37 places in 110 ms of which 2 ms to minimize.
[2024-05-24 05:55:57] [INFO ] Deduced a trap composed of 35 places in 103 ms of which 1 ms to minimize.
[2024-05-24 05:55:57] [INFO ] Deduced a trap composed of 34 places in 112 ms of which 1 ms to minimize.
[2024-05-24 05:55:58] [INFO ] Deduced a trap composed of 15 places in 116 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/242 variables, 20/114 constraints. Problems are: Problem set: 0 solved, 514 unsolved
[2024-05-24 05:55:58] [INFO ] Deduced a trap composed of 10 places in 48 ms of which 3 ms to minimize.
[2024-05-24 05:55:58] [INFO ] Deduced a trap composed of 7 places in 39 ms of which 0 ms to minimize.
[2024-05-24 05:55:58] [INFO ] Deduced a trap composed of 33 places in 90 ms of which 1 ms to minimize.
[2024-05-24 05:55:58] [INFO ] Deduced a trap composed of 41 places in 86 ms of which 1 ms to minimize.
[2024-05-24 05:55:58] [INFO ] Deduced a trap composed of 39 places in 87 ms of which 1 ms to minimize.
[2024-05-24 05:55:58] [INFO ] Deduced a trap composed of 40 places in 85 ms of which 1 ms to minimize.
[2024-05-24 05:55:58] [INFO ] Deduced a trap composed of 37 places in 82 ms of which 1 ms to minimize.
[2024-05-24 05:55:58] [INFO ] Deduced a trap composed of 28 places in 78 ms of which 1 ms to minimize.
[2024-05-24 05:55:58] [INFO ] Deduced a trap composed of 35 places in 86 ms of which 1 ms to minimize.
[2024-05-24 05:55:59] [INFO ] Deduced a trap composed of 33 places in 83 ms of which 1 ms to minimize.
[2024-05-24 05:55:59] [INFO ] Deduced a trap composed of 7 places in 86 ms of which 1 ms to minimize.
[2024-05-24 05:55:59] [INFO ] Deduced a trap composed of 42 places in 74 ms of which 1 ms to minimize.
[2024-05-24 05:55:59] [INFO ] Deduced a trap composed of 34 places in 77 ms of which 2 ms to minimize.
[2024-05-24 05:55:59] [INFO ] Deduced a trap composed of 32 places in 77 ms of which 1 ms to minimize.
[2024-05-24 05:55:59] [INFO ] Deduced a trap composed of 33 places in 75 ms of which 1 ms to minimize.
[2024-05-24 05:55:59] [INFO ] Deduced a trap composed of 28 places in 76 ms of which 1 ms to minimize.
[2024-05-24 05:55:59] [INFO ] Deduced a trap composed of 33 places in 79 ms of which 1 ms to minimize.
[2024-05-24 05:55:59] [INFO ] Deduced a trap composed of 7 places in 29 ms of which 0 ms to minimize.
[2024-05-24 05:55:59] [INFO ] Deduced a trap composed of 36 places in 108 ms of which 1 ms to minimize.
[2024-05-24 05:55:59] [INFO ] Deduced a trap composed of 17 places in 99 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/242 variables, 20/134 constraints. Problems are: Problem set: 0 solved, 514 unsolved
[2024-05-24 05:56:00] [INFO ] Deduced a trap composed of 41 places in 99 ms of which 1 ms to minimize.
[2024-05-24 05:56:00] [INFO ] Deduced a trap composed of 16 places in 91 ms of which 1 ms to minimize.
[2024-05-24 05:56:00] [INFO ] Deduced a trap composed of 9 places in 82 ms of which 1 ms to minimize.
[2024-05-24 05:56:00] [INFO ] Deduced a trap composed of 31 places in 73 ms of which 1 ms to minimize.
[2024-05-24 05:56:00] [INFO ] Deduced a trap composed of 35 places in 73 ms of which 1 ms to minimize.
[2024-05-24 05:56:00] [INFO ] Deduced a trap composed of 31 places in 92 ms of which 2 ms to minimize.
[2024-05-24 05:56:00] [INFO ] Deduced a trap composed of 25 places in 89 ms of which 1 ms to minimize.
[2024-05-24 05:56:00] [INFO ] Deduced a trap composed of 38 places in 99 ms of which 1 ms to minimize.
[2024-05-24 05:56:00] [INFO ] Deduced a trap composed of 28 places in 89 ms of which 1 ms to minimize.
[2024-05-24 05:56:01] [INFO ] Deduced a trap composed of 19 places in 97 ms of which 1 ms to minimize.
[2024-05-24 05:56:01] [INFO ] Deduced a trap composed of 20 places in 81 ms of which 2 ms to minimize.
[2024-05-24 05:56:01] [INFO ] Deduced a trap composed of 19 places in 86 ms of which 1 ms to minimize.
[2024-05-24 05:56:01] [INFO ] Deduced a trap composed of 15 places in 78 ms of which 1 ms to minimize.
[2024-05-24 05:56:01] [INFO ] Deduced a trap composed of 14 places in 82 ms of which 1 ms to minimize.
[2024-05-24 05:56:01] [INFO ] Deduced a trap composed of 19 places in 68 ms of which 1 ms to minimize.
[2024-05-24 05:56:01] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 0 ms to minimize.
[2024-05-24 05:56:01] [INFO ] Deduced a trap composed of 20 places in 101 ms of which 1 ms to minimize.
[2024-05-24 05:56:01] [INFO ] Deduced a trap composed of 44 places in 104 ms of which 2 ms to minimize.
[2024-05-24 05:56:01] [INFO ] Deduced a trap composed of 30 places in 115 ms of which 1 ms to minimize.
[2024-05-24 05:56:01] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/242 variables, 20/154 constraints. Problems are: Problem set: 0 solved, 514 unsolved
[2024-05-24 05:56:04] [INFO ] Deduced a trap composed of 34 places in 104 ms of which 1 ms to minimize.
[2024-05-24 05:56:04] [INFO ] Deduced a trap composed of 26 places in 100 ms of which 2 ms to minimize.
[2024-05-24 05:56:04] [INFO ] Deduced a trap composed of 32 places in 103 ms of which 2 ms to minimize.
[2024-05-24 05:56:04] [INFO ] Deduced a trap composed of 34 places in 91 ms of which 2 ms to minimize.
[2024-05-24 05:56:04] [INFO ] Deduced a trap composed of 30 places in 105 ms of which 1 ms to minimize.
[2024-05-24 05:56:04] [INFO ] Deduced a trap composed of 34 places in 96 ms of which 1 ms to minimize.
[2024-05-24 05:56:04] [INFO ] Deduced a trap composed of 35 places in 84 ms of which 2 ms to minimize.
[2024-05-24 05:56:04] [INFO ] Deduced a trap composed of 31 places in 87 ms of which 1 ms to minimize.
[2024-05-24 05:56:04] [INFO ] Deduced a trap composed of 31 places in 94 ms of which 1 ms to minimize.
[2024-05-24 05:56:05] [INFO ] Deduced a trap composed of 32 places in 95 ms of which 1 ms to minimize.
[2024-05-24 05:56:05] [INFO ] Deduced a trap composed of 32 places in 99 ms of which 1 ms to minimize.
[2024-05-24 05:56:05] [INFO ] Deduced a trap composed of 7 places in 103 ms of which 1 ms to minimize.
[2024-05-24 05:56:05] [INFO ] Deduced a trap composed of 33 places in 102 ms of which 1 ms to minimize.
[2024-05-24 05:56:05] [INFO ] Deduced a trap composed of 33 places in 90 ms of which 2 ms to minimize.
[2024-05-24 05:56:05] [INFO ] Deduced a trap composed of 37 places in 93 ms of which 2 ms to minimize.
[2024-05-24 05:56:05] [INFO ] Deduced a trap composed of 28 places in 92 ms of which 1 ms to minimize.
[2024-05-24 05:56:05] [INFO ] Deduced a trap composed of 42 places in 93 ms of which 1 ms to minimize.
[2024-05-24 05:56:05] [INFO ] Deduced a trap composed of 30 places in 100 ms of which 2 ms to minimize.
[2024-05-24 05:56:06] [INFO ] Deduced a trap composed of 39 places in 103 ms of which 1 ms to minimize.
[2024-05-24 05:56:06] [INFO ] Deduced a trap composed of 35 places in 103 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/242 variables, 20/174 constraints. Problems are: Problem set: 0 solved, 514 unsolved
[2024-05-24 05:56:06] [INFO ] Deduced a trap composed of 7 places in 48 ms of which 0 ms to minimize.
[2024-05-24 05:56:06] [INFO ] Deduced a trap composed of 31 places in 99 ms of which 1 ms to minimize.
[2024-05-24 05:56:06] [INFO ] Deduced a trap composed of 33 places in 100 ms of which 1 ms to minimize.
[2024-05-24 05:56:06] [INFO ] Deduced a trap composed of 31 places in 98 ms of which 1 ms to minimize.
[2024-05-24 05:56:06] [INFO ] Deduced a trap composed of 33 places in 106 ms of which 2 ms to minimize.
[2024-05-24 05:56:06] [INFO ] Deduced a trap composed of 13 places in 88 ms of which 1 ms to minimize.
[2024-05-24 05:56:06] [INFO ] Deduced a trap composed of 10 places in 51 ms of which 1 ms to minimize.
[2024-05-24 05:56:07] [INFO ] Deduced a trap composed of 34 places in 98 ms of which 2 ms to minimize.
[2024-05-24 05:56:07] [INFO ] Deduced a trap composed of 20 places in 112 ms of which 1 ms to minimize.
[2024-05-24 05:56:07] [INFO ] Deduced a trap composed of 37 places in 100 ms of which 1 ms to minimize.
[2024-05-24 05:56:07] [INFO ] Deduced a trap composed of 39 places in 92 ms of which 1 ms to minimize.
[2024-05-24 05:56:07] [INFO ] Deduced a trap composed of 18 places in 101 ms of which 2 ms to minimize.
[2024-05-24 05:56:07] [INFO ] Deduced a trap composed of 16 places in 86 ms of which 2 ms to minimize.
[2024-05-24 05:56:07] [INFO ] Deduced a trap composed of 23 places in 106 ms of which 2 ms to minimize.
[2024-05-24 05:56:07] [INFO ] Deduced a trap composed of 17 places in 107 ms of which 1 ms to minimize.
[2024-05-24 05:56:08] [INFO ] Deduced a trap composed of 27 places in 104 ms of which 2 ms to minimize.
[2024-05-24 05:56:08] [INFO ] Deduced a trap composed of 31 places in 103 ms of which 2 ms to minimize.
[2024-05-24 05:56:08] [INFO ] Deduced a trap composed of 23 places in 107 ms of which 1 ms to minimize.
[2024-05-24 05:56:08] [INFO ] Deduced a trap composed of 15 places in 101 ms of which 1 ms to minimize.
[2024-05-24 05:56:08] [INFO ] Deduced a trap composed of 28 places in 116 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/242 variables, 20/194 constraints. Problems are: Problem set: 0 solved, 514 unsolved
[2024-05-24 05:56:08] [INFO ] Deduced a trap composed of 46 places in 92 ms of which 1 ms to minimize.
[2024-05-24 05:56:09] [INFO ] Deduced a trap composed of 19 places in 86 ms of which 1 ms to minimize.
[2024-05-24 05:56:09] [INFO ] Deduced a trap composed of 27 places in 108 ms of which 2 ms to minimize.
[2024-05-24 05:56:09] [INFO ] Deduced a trap composed of 27 places in 105 ms of which 1 ms to minimize.
[2024-05-24 05:56:09] [INFO ] Deduced a trap composed of 40 places in 113 ms of which 1 ms to minimize.
[2024-05-24 05:56:09] [INFO ] Deduced a trap composed of 27 places in 101 ms of which 1 ms to minimize.
[2024-05-24 05:56:09] [INFO ] Deduced a trap composed of 31 places in 110 ms of which 2 ms to minimize.
[2024-05-24 05:56:10] [INFO ] Deduced a trap composed of 29 places in 99 ms of which 2 ms to minimize.
[2024-05-24 05:56:10] [INFO ] Deduced a trap composed of 41 places in 98 ms of which 2 ms to minimize.
[2024-05-24 05:56:10] [INFO ] Deduced a trap composed of 23 places in 109 ms of which 2 ms to minimize.
[2024-05-24 05:56:10] [INFO ] Deduced a trap composed of 15 places in 102 ms of which 2 ms to minimize.
[2024-05-24 05:56:10] [INFO ] Deduced a trap composed of 32 places in 95 ms of which 1 ms to minimize.
[2024-05-24 05:56:10] [INFO ] Deduced a trap composed of 20 places in 111 ms of which 1 ms to minimize.
[2024-05-24 05:56:10] [INFO ] Deduced a trap composed of 36 places in 111 ms of which 2 ms to minimize.
[2024-05-24 05:56:10] [INFO ] Deduced a trap composed of 33 places in 104 ms of which 1 ms to minimize.
[2024-05-24 05:56:10] [INFO ] Deduced a trap composed of 20 places in 110 ms of which 1 ms to minimize.
[2024-05-24 05:56:11] [INFO ] Deduced a trap composed of 32 places in 101 ms of which 1 ms to minimize.
[2024-05-24 05:56:11] [INFO ] Deduced a trap composed of 13 places in 104 ms of which 1 ms to minimize.
[2024-05-24 05:56:11] [INFO ] Deduced a trap composed of 13 places in 121 ms of which 1 ms to minimize.
[2024-05-24 05:56:11] [INFO ] Deduced a trap composed of 7 places in 35 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/242 variables, 20/214 constraints. Problems are: Problem set: 0 solved, 514 unsolved
[2024-05-24 05:56:13] [INFO ] Deduced a trap composed of 33 places in 94 ms of which 1 ms to minimize.
[2024-05-24 05:56:13] [INFO ] Deduced a trap composed of 32 places in 101 ms of which 2 ms to minimize.
[2024-05-24 05:56:13] [INFO ] Deduced a trap composed of 35 places in 104 ms of which 1 ms to minimize.
[2024-05-24 05:56:14] [INFO ] Deduced a trap composed of 32 places in 110 ms of which 1 ms to minimize.
[2024-05-24 05:56:14] [INFO ] Deduced a trap composed of 35 places in 118 ms of which 2 ms to minimize.
[2024-05-24 05:56:14] [INFO ] Deduced a trap composed of 33 places in 107 ms of which 1 ms to minimize.
[2024-05-24 05:56:14] [INFO ] Deduced a trap composed of 29 places in 102 ms of which 1 ms to minimize.
[2024-05-24 05:56:14] [INFO ] Deduced a trap composed of 34 places in 106 ms of which 2 ms to minimize.
[2024-05-24 05:56:14] [INFO ] Deduced a trap composed of 44 places in 99 ms of which 1 ms to minimize.
[2024-05-24 05:56:14] [INFO ] Deduced a trap composed of 34 places in 98 ms of which 2 ms to minimize.
[2024-05-24 05:56:14] [INFO ] Deduced a trap composed of 7 places in 100 ms of which 2 ms to minimize.
[2024-05-24 05:56:14] [INFO ] Deduced a trap composed of 35 places in 102 ms of which 1 ms to minimize.
[2024-05-24 05:56:15] [INFO ] Deduced a trap composed of 39 places in 105 ms of which 1 ms to minimize.
[2024-05-24 05:56:15] [INFO ] Deduced a trap composed of 31 places in 105 ms of which 1 ms to minimize.
[2024-05-24 05:56:15] [INFO ] Deduced a trap composed of 33 places in 96 ms of which 2 ms to minimize.
[2024-05-24 05:56:15] [INFO ] Deduced a trap composed of 27 places in 101 ms of which 1 ms to minimize.
[2024-05-24 05:56:15] [INFO ] Deduced a trap composed of 33 places in 94 ms of which 2 ms to minimize.
[2024-05-24 05:56:15] [INFO ] Deduced a trap composed of 26 places in 97 ms of which 2 ms to minimize.
[2024-05-24 05:56:15] [INFO ] Deduced a trap composed of 39 places in 104 ms of which 2 ms to minimize.
[2024-05-24 05:56:15] [INFO ] Deduced a trap composed of 33 places in 98 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/242 variables, 20/234 constraints. Problems are: Problem set: 0 solved, 514 unsolved
[2024-05-24 05:56:16] [INFO ] Deduced a trap composed of 29 places in 90 ms of which 1 ms to minimize.
[2024-05-24 05:56:16] [INFO ] Deduced a trap composed of 33 places in 91 ms of which 2 ms to minimize.
[2024-05-24 05:56:16] [INFO ] Deduced a trap composed of 41 places in 93 ms of which 1 ms to minimize.
[2024-05-24 05:56:16] [INFO ] Deduced a trap composed of 26 places in 93 ms of which 1 ms to minimize.
[2024-05-24 05:56:16] [INFO ] Deduced a trap composed of 20 places in 89 ms of which 2 ms to minimize.
[2024-05-24 05:56:16] [INFO ] Deduced a trap composed of 13 places in 101 ms of which 1 ms to minimize.
[2024-05-24 05:56:17] [INFO ] Deduced a trap composed of 19 places in 113 ms of which 2 ms to minimize.
[2024-05-24 05:56:17] [INFO ] Deduced a trap composed of 32 places in 106 ms of which 1 ms to minimize.
[2024-05-24 05:56:17] [INFO ] Deduced a trap composed of 34 places in 119 ms of which 2 ms to minimize.
[2024-05-24 05:56:17] [INFO ] Deduced a trap composed of 27 places in 109 ms of which 2 ms to minimize.
[2024-05-24 05:56:17] [INFO ] Deduced a trap composed of 25 places in 106 ms of which 1 ms to minimize.
[2024-05-24 05:56:17] [INFO ] Deduced a trap composed of 32 places in 112 ms of which 1 ms to minimize.
[2024-05-24 05:56:17] [INFO ] Deduced a trap composed of 33 places in 117 ms of which 2 ms to minimize.
[2024-05-24 05:56:17] [INFO ] Deduced a trap composed of 34 places in 102 ms of which 1 ms to minimize.
SMT process timed out in 30289ms, After SMT, problems are : Problem set: 0 solved, 514 unsolved
Search for dead transitions found 0 dead transitions in 30294ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30914 ms. Remains : 242/242 places, 522/522 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 153 transitions
Reduce isomorphic transitions removed 153 transitions.
Iterating post reduction 0 with 153 rules applied. Total rules applied 153 place count 242 transition count 369
Performed 64 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 64 Pre rules applied. Total rules applied 153 place count 242 transition count 305
Deduced a syphon composed of 64 places in 1 ms
Ensure Unique test removed 56 places
Reduce places removed 120 places and 0 transitions.
Iterating global reduction 1 with 184 rules applied. Total rules applied 337 place count 122 transition count 305
Applied a total of 337 rules in 31 ms. Remains 122 /242 variables (removed 120) and now considering 305/522 (removed 217) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 305 rows 122 cols
[2024-05-24 05:56:17] [INFO ] Computed 18 invariants in 1 ms
[2024-05-24 05:56:18] [INFO ] [Real]Absence check using 18 positive place invariants in 3 ms returned sat
[2024-05-24 05:56:18] [INFO ] After 321ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-24 05:56:18] [INFO ] [Nat]Absence check using 18 positive place invariants in 3 ms returned sat
[2024-05-24 05:56:18] [INFO ] After 324ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
TRAPS : Iteration 0
[2024-05-24 05:56:18] [INFO ] Deduced a trap composed of 6 places in 24 ms of which 1 ms to minimize.
[2024-05-24 05:56:19] [INFO ] Deduced a trap composed of 6 places in 19 ms of which 1 ms to minimize.
[2024-05-24 05:56:19] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 81 ms
TRAPS : Iteration 1
[2024-05-24 05:56:19] [INFO ] After 966ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
[2024-05-24 05:56:19] [INFO ] After 1284ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Over-approximation ignoring read arcs solved 0 properties in 1677 ms.
[2024-05-24 05:56:19] [INFO ] Flatten gal took : 58 ms
[2024-05-24 05:56:20] [INFO ] Flatten gal took : 79 ms
[2024-05-24 05:56:20] [INFO ] Input system was already deterministic with 542 transitions.
Computed a total of 1 stabilizing places and 8 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 266/266 places, 542/542 transitions.
Applied a total of 0 rules in 16 ms. Remains 266 /266 variables (removed 0) and now considering 542/542 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 16 ms. Remains : 266/266 places, 542/542 transitions.
[2024-05-24 05:56:20] [INFO ] Flatten gal took : 24 ms
[2024-05-24 05:56:20] [INFO ] Flatten gal took : 23 ms
[2024-05-24 05:56:20] [INFO ] Input system was already deterministic with 542 transitions.
Starting structural reductions in LTL mode, iteration 0 : 266/266 places, 542/542 transitions.
Applied a total of 0 rules in 2 ms. Remains 266 /266 variables (removed 0) and now considering 542/542 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 266/266 places, 542/542 transitions.
[2024-05-24 05:56:20] [INFO ] Flatten gal took : 22 ms
[2024-05-24 05:56:20] [INFO ] Flatten gal took : 26 ms
[2024-05-24 05:56:20] [INFO ] Input system was already deterministic with 542 transitions.
Starting structural reductions in LTL mode, iteration 0 : 266/266 places, 542/542 transitions.
Applied a total of 0 rules in 2 ms. Remains 266 /266 variables (removed 0) and now considering 542/542 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 266/266 places, 542/542 transitions.
[2024-05-24 05:56:20] [INFO ] Flatten gal took : 22 ms
[2024-05-24 05:56:20] [INFO ] Flatten gal took : 25 ms
[2024-05-24 05:56:20] [INFO ] Input system was already deterministic with 542 transitions.
Starting structural reductions in LTL mode, iteration 0 : 266/266 places, 542/542 transitions.
Applied a total of 0 rules in 1 ms. Remains 266 /266 variables (removed 0) and now considering 542/542 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 266/266 places, 542/542 transitions.
[2024-05-24 05:56:20] [INFO ] Flatten gal took : 23 ms
[2024-05-24 05:56:21] [INFO ] Flatten gal took : 26 ms
[2024-05-24 05:56:21] [INFO ] Input system was already deterministic with 542 transitions.
Starting structural reductions in LTL mode, iteration 0 : 266/266 places, 542/542 transitions.
Applied a total of 0 rules in 2 ms. Remains 266 /266 variables (removed 0) and now considering 542/542 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 266/266 places, 542/542 transitions.
[2024-05-24 05:56:21] [INFO ] Flatten gal took : 18 ms
[2024-05-24 05:56:21] [INFO ] Flatten gal took : 20 ms
[2024-05-24 05:56:21] [INFO ] Input system was already deterministic with 542 transitions.
Starting structural reductions in LTL mode, iteration 0 : 266/266 places, 542/542 transitions.
Applied a total of 0 rules in 1 ms. Remains 266 /266 variables (removed 0) and now considering 542/542 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 266/266 places, 542/542 transitions.
[2024-05-24 05:56:21] [INFO ] Flatten gal took : 19 ms
[2024-05-24 05:56:21] [INFO ] Flatten gal took : 22 ms
[2024-05-24 05:56:21] [INFO ] Input system was already deterministic with 542 transitions.
Starting structural reductions in LTL mode, iteration 0 : 266/266 places, 542/542 transitions.
Applied a total of 0 rules in 1 ms. Remains 266 /266 variables (removed 0) and now considering 542/542 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 266/266 places, 542/542 transitions.
[2024-05-24 05:56:21] [INFO ] Flatten gal took : 17 ms
[2024-05-24 05:56:21] [INFO ] Flatten gal took : 19 ms
[2024-05-24 05:56:21] [INFO ] Input system was already deterministic with 542 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 266/266 places, 542/542 transitions.
Applied a total of 0 rules in 8 ms. Remains 266 /266 variables (removed 0) and now considering 542/542 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 8 ms. Remains : 266/266 places, 542/542 transitions.
[2024-05-24 05:56:21] [INFO ] Flatten gal took : 20 ms
[2024-05-24 05:56:21] [INFO ] Flatten gal took : 22 ms
[2024-05-24 05:56:21] [INFO ] Input system was already deterministic with 542 transitions.
Starting structural reductions in LTL mode, iteration 0 : 266/266 places, 542/542 transitions.
Applied a total of 0 rules in 3 ms. Remains 266 /266 variables (removed 0) and now considering 542/542 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 266/266 places, 542/542 transitions.
[2024-05-24 05:56:21] [INFO ] Flatten gal took : 15 ms
[2024-05-24 05:56:21] [INFO ] Flatten gal took : 18 ms
[2024-05-24 05:56:21] [INFO ] Input system was already deterministic with 542 transitions.
Starting structural reductions in LTL mode, iteration 0 : 266/266 places, 542/542 transitions.
Applied a total of 0 rules in 2 ms. Remains 266 /266 variables (removed 0) and now considering 542/542 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 266/266 places, 542/542 transitions.
[2024-05-24 05:56:21] [INFO ] Flatten gal took : 16 ms
[2024-05-24 05:56:21] [INFO ] Flatten gal took : 17 ms
[2024-05-24 05:56:21] [INFO ] Input system was already deterministic with 542 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 266/266 places, 542/542 transitions.
Applied a total of 0 rules in 11 ms. Remains 266 /266 variables (removed 0) and now considering 542/542 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 11 ms. Remains : 266/266 places, 542/542 transitions.
[2024-05-24 05:56:21] [INFO ] Flatten gal took : 16 ms
[2024-05-24 05:56:21] [INFO ] Flatten gal took : 17 ms
[2024-05-24 05:56:21] [INFO ] Input system was already deterministic with 542 transitions.
Starting structural reductions in LTL mode, iteration 0 : 266/266 places, 542/542 transitions.
Applied a total of 0 rules in 1 ms. Remains 266 /266 variables (removed 0) and now considering 542/542 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 266/266 places, 542/542 transitions.
[2024-05-24 05:56:21] [INFO ] Flatten gal took : 17 ms
[2024-05-24 05:56:21] [INFO ] Flatten gal took : 20 ms
[2024-05-24 05:56:21] [INFO ] Input system was already deterministic with 542 transitions.
Starting structural reductions in LTL mode, iteration 0 : 266/266 places, 542/542 transitions.
Applied a total of 0 rules in 3 ms. Remains 266 /266 variables (removed 0) and now considering 542/542 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 266/266 places, 542/542 transitions.
[2024-05-24 05:56:21] [INFO ] Flatten gal took : 16 ms
[2024-05-24 05:56:21] [INFO ] Flatten gal took : 17 ms
[2024-05-24 05:56:21] [INFO ] Input system was already deterministic with 542 transitions.
Starting structural reductions in LTL mode, iteration 0 : 266/266 places, 542/542 transitions.
Applied a total of 0 rules in 3 ms. Remains 266 /266 variables (removed 0) and now considering 542/542 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 266/266 places, 542/542 transitions.
[2024-05-24 05:56:21] [INFO ] Flatten gal took : 16 ms
[2024-05-24 05:56:21] [INFO ] Flatten gal took : 17 ms
[2024-05-24 05:56:21] [INFO ] Input system was already deterministic with 542 transitions.
Starting structural reductions in LTL mode, iteration 0 : 266/266 places, 542/542 transitions.
Applied a total of 0 rules in 3 ms. Remains 266 /266 variables (removed 0) and now considering 542/542 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 266/266 places, 542/542 transitions.
[2024-05-24 05:56:21] [INFO ] Flatten gal took : 16 ms
[2024-05-24 05:56:21] [INFO ] Flatten gal took : 16 ms
[2024-05-24 05:56:21] [INFO ] Input system was already deterministic with 542 transitions.
Starting structural reductions in LTL mode, iteration 0 : 266/266 places, 542/542 transitions.
Applied a total of 0 rules in 1 ms. Remains 266 /266 variables (removed 0) and now considering 542/542 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 266/266 places, 542/542 transitions.
[2024-05-24 05:56:22] [INFO ] Flatten gal took : 17 ms
[2024-05-24 05:56:22] [INFO ] Flatten gal took : 20 ms
[2024-05-24 05:56:22] [INFO ] Input system was already deterministic with 542 transitions.
[2024-05-24 05:56:22] [INFO ] Flatten gal took : 61 ms
[2024-05-24 05:56:22] [INFO ] Flatten gal took : 60 ms
[2024-05-24 05:56:22] [INFO ] Export to MCC of 16 properties in file /home/mcc/execution/CTLFireability.sr.xml took 35 ms.
[2024-05-24 05:56:22] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 266 places, 542 transitions and 2392 arcs took 5 ms.
Total runtime 164693 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running LamportFastMutEx-COL-8

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/411/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 266
TRANSITIONS: 542
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.014s, Sys 0.000s]


SAVING FILE /home/mcc/execution/411/model (.net / .def) ...
EXPORT TIME: [User 0.001s, Sys 0.000s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 2822
MODEL NAME: /home/mcc/execution/411/model
266 places, 542 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.

BK_TIME_CONFINEMENT_REACHED

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -timeout 360 -rebuildPNML
MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

Error in allocating array of size 1048576 at unique_table.cc, line 313
MEDDLY ERROR: Insufficient memory

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-8"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="greatspnxred"
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 greatspnxred"
echo " Input is LamportFastMutEx-COL-8, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r223-tall-171649611000250"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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