Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r425-tajo-167905977800148.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.........................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is ShieldRVs-PT-050A, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r425-tajo-167905977800148
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 744K
-rw-r--r-- 1 mcc users 6.7K Feb 26 18:44 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K Feb 26 18:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Feb 26 18:31 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Feb 26 18:31 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 17:03 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Feb 25 17:03 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 17:03 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 17:03 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.3K Feb 26 19:05 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 81K Feb 26 19:05 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.1K Feb 26 18:52 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 69K Feb 26 18:52 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:03 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:03 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 320K Mar 5 18:23 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1679302454522

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldRVs-PT-050A
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-20 08:54:16] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-20 08:54:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 08:54:16] [INFO ] Load time of PNML (sax parser for PT used): 85 ms
[2023-03-20 08:54:16] [INFO ] Transformed 703 places.
[2023-03-20 08:54:16] [INFO ] Transformed 953 transitions.
[2023-03-20 08:54:16] [INFO ] Found NUPN structural information;
[2023-03-20 08:54:16] [INFO ] Parsed PT model containing 703 places and 953 transitions and 4600 arcs in 157 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA ShieldRVs-PT-050A-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-050A-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-050A-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-050A-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 84 out of 703 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 703/703 places, 953/953 transitions.
Applied a total of 0 rules in 65 ms. Remains 703 /703 variables (removed 0) and now considering 953/953 (removed 0) transitions.
// Phase 1: matrix 953 rows 703 cols
[2023-03-20 08:54:16] [INFO ] Computed 201 place invariants in 15 ms
[2023-03-20 08:54:17] [INFO ] Implicit Places using invariants in 498 ms returned []
[2023-03-20 08:54:17] [INFO ] Invariant cache hit.
[2023-03-20 08:54:17] [INFO ] Implicit Places using invariants and state equation in 701 ms returned []
Implicit Place search using SMT with State Equation took 1225 ms to find 0 implicit places.
[2023-03-20 08:54:17] [INFO ] Invariant cache hit.
[2023-03-20 08:54:18] [INFO ] Dead Transitions using invariants and state equation in 458 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1753 ms. Remains : 703/703 places, 953/953 transitions.
Support contains 84 out of 703 places after structural reductions.
[2023-03-20 08:54:18] [INFO ] Flatten gal took : 142 ms
[2023-03-20 08:54:18] [INFO ] Flatten gal took : 72 ms
[2023-03-20 08:54:18] [INFO ] Input system was already deterministic with 953 transitions.
Incomplete random walk after 10000 steps, including 15 resets, run finished after 347 ms. (steps per millisecond=28 ) properties (out of 36) seen :34
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-20 08:54:19] [INFO ] Invariant cache hit.
[2023-03-20 08:54:19] [INFO ] [Real]Absence check using 201 positive place invariants in 32 ms returned sat
[2023-03-20 08:54:19] [INFO ] After 516ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 08:54:19] [INFO ] [Nat]Absence check using 201 positive place invariants in 25 ms returned sat
[2023-03-20 08:54:20] [INFO ] After 468ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 08:54:20] [INFO ] Deduced a trap composed of 11 places in 184 ms of which 8 ms to minimize.
[2023-03-20 08:54:20] [INFO ] Deduced a trap composed of 12 places in 165 ms of which 1 ms to minimize.
[2023-03-20 08:54:21] [INFO ] Deduced a trap composed of 15 places in 153 ms of which 2 ms to minimize.
[2023-03-20 08:54:21] [INFO ] Deduced a trap composed of 13 places in 133 ms of which 2 ms to minimize.
[2023-03-20 08:54:21] [INFO ] Deduced a trap composed of 23 places in 137 ms of which 1 ms to minimize.
[2023-03-20 08:54:21] [INFO ] Deduced a trap composed of 11 places in 147 ms of which 1 ms to minimize.
[2023-03-20 08:54:21] [INFO ] Deduced a trap composed of 8 places in 179 ms of which 1 ms to minimize.
[2023-03-20 08:54:21] [INFO ] Deduced a trap composed of 8 places in 138 ms of which 1 ms to minimize.
[2023-03-20 08:54:22] [INFO ] Deduced a trap composed of 8 places in 137 ms of which 0 ms to minimize.
[2023-03-20 08:54:22] [INFO ] Deduced a trap composed of 11 places in 135 ms of which 0 ms to minimize.
[2023-03-20 08:54:22] [INFO ] Deduced a trap composed of 8 places in 174 ms of which 0 ms to minimize.
[2023-03-20 08:54:22] [INFO ] Deduced a trap composed of 8 places in 170 ms of which 0 ms to minimize.
[2023-03-20 08:54:23] [INFO ] Deduced a trap composed of 9 places in 159 ms of which 1 ms to minimize.
[2023-03-20 08:54:23] [INFO ] Deduced a trap composed of 11 places in 158 ms of which 1 ms to minimize.
[2023-03-20 08:54:23] [INFO ] Deduced a trap composed of 10 places in 154 ms of which 1 ms to minimize.
[2023-03-20 08:54:23] [INFO ] Deduced a trap composed of 24 places in 149 ms of which 0 ms to minimize.
[2023-03-20 08:54:23] [INFO ] Deduced a trap composed of 24 places in 151 ms of which 1 ms to minimize.
[2023-03-20 08:54:23] [INFO ] Deduced a trap composed of 23 places in 139 ms of which 1 ms to minimize.
[2023-03-20 08:54:24] [INFO ] Deduced a trap composed of 23 places in 137 ms of which 1 ms to minimize.
[2023-03-20 08:54:24] [INFO ] Deduced a trap composed of 7 places in 136 ms of which 1 ms to minimize.
[2023-03-20 08:54:24] [INFO ] Deduced a trap composed of 14 places in 171 ms of which 1 ms to minimize.
[2023-03-20 08:54:24] [INFO ] Deduced a trap composed of 15 places in 148 ms of which 1 ms to minimize.
[2023-03-20 08:54:24] [INFO ] Deduced a trap composed of 27 places in 167 ms of which 1 ms to minimize.
[2023-03-20 08:54:25] [INFO ] Deduced a trap composed of 33 places in 144 ms of which 0 ms to minimize.
[2023-03-20 08:54:25] [INFO ] Deduced a trap composed of 33 places in 165 ms of which 0 ms to minimize.
[2023-03-20 08:54:25] [INFO ] Deduced a trap composed of 33 places in 188 ms of which 1 ms to minimize.
[2023-03-20 08:54:25] [INFO ] Deduced a trap composed of 8 places in 158 ms of which 1 ms to minimize.
[2023-03-20 08:54:25] [INFO ] Deduced a trap composed of 31 places in 179 ms of which 1 ms to minimize.
[2023-03-20 08:54:26] [INFO ] Deduced a trap composed of 12 places in 152 ms of which 1 ms to minimize.
[2023-03-20 08:54:26] [INFO ] Deduced a trap composed of 27 places in 157 ms of which 1 ms to minimize.
[2023-03-20 08:54:26] [INFO ] Deduced a trap composed of 12 places in 173 ms of which 0 ms to minimize.
[2023-03-20 08:54:26] [INFO ] Deduced a trap composed of 16 places in 161 ms of which 0 ms to minimize.
[2023-03-20 08:54:26] [INFO ] Deduced a trap composed of 11 places in 150 ms of which 1 ms to minimize.
[2023-03-20 08:54:27] [INFO ] Deduced a trap composed of 25 places in 127 ms of which 1 ms to minimize.
[2023-03-20 08:54:27] [INFO ] Deduced a trap composed of 11 places in 126 ms of which 1 ms to minimize.
[2023-03-20 08:54:27] [INFO ] Deduced a trap composed of 28 places in 123 ms of which 1 ms to minimize.
[2023-03-20 08:54:27] [INFO ] Deduced a trap composed of 27 places in 144 ms of which 0 ms to minimize.
[2023-03-20 08:54:27] [INFO ] Deduced a trap composed of 27 places in 120 ms of which 0 ms to minimize.
[2023-03-20 08:54:27] [INFO ] Deduced a trap composed of 28 places in 115 ms of which 1 ms to minimize.
[2023-03-20 08:54:28] [INFO ] Deduced a trap composed of 27 places in 123 ms of which 0 ms to minimize.
[2023-03-20 08:54:28] [INFO ] Deduced a trap composed of 31 places in 109 ms of which 1 ms to minimize.
[2023-03-20 08:54:28] [INFO ] Deduced a trap composed of 31 places in 108 ms of which 1 ms to minimize.
[2023-03-20 08:54:28] [INFO ] Deduced a trap composed of 31 places in 131 ms of which 0 ms to minimize.
[2023-03-20 08:54:28] [INFO ] Deduced a trap composed of 31 places in 143 ms of which 1 ms to minimize.
[2023-03-20 08:54:28] [INFO ] Deduced a trap composed of 31 places in 119 ms of which 1 ms to minimize.
[2023-03-20 08:54:28] [INFO ] Deduced a trap composed of 31 places in 107 ms of which 0 ms to minimize.
[2023-03-20 08:54:29] [INFO ] Deduced a trap composed of 31 places in 112 ms of which 0 ms to minimize.
[2023-03-20 08:54:29] [INFO ] Deduced a trap composed of 31 places in 115 ms of which 0 ms to minimize.
[2023-03-20 08:54:29] [INFO ] Deduced a trap composed of 31 places in 137 ms of which 1 ms to minimize.
[2023-03-20 08:54:29] [INFO ] Deduced a trap composed of 32 places in 124 ms of which 0 ms to minimize.
[2023-03-20 08:54:29] [INFO ] Deduced a trap composed of 31 places in 115 ms of which 0 ms to minimize.
[2023-03-20 08:54:29] [INFO ] Deduced a trap composed of 32 places in 132 ms of which 0 ms to minimize.
[2023-03-20 08:54:30] [INFO ] Deduced a trap composed of 31 places in 125 ms of which 1 ms to minimize.
[2023-03-20 08:54:30] [INFO ] Deduced a trap composed of 32 places in 127 ms of which 0 ms to minimize.
[2023-03-20 08:54:30] [INFO ] Deduced a trap composed of 31 places in 115 ms of which 0 ms to minimize.
[2023-03-20 08:54:30] [INFO ] Deduced a trap composed of 32 places in 116 ms of which 1 ms to minimize.
[2023-03-20 08:54:30] [INFO ] Deduced a trap composed of 31 places in 149 ms of which 1 ms to minimize.
[2023-03-20 08:54:30] [INFO ] Deduced a trap composed of 31 places in 133 ms of which 1 ms to minimize.
[2023-03-20 08:54:31] [INFO ] Deduced a trap composed of 32 places in 122 ms of which 0 ms to minimize.
[2023-03-20 08:54:31] [INFO ] Deduced a trap composed of 31 places in 116 ms of which 1 ms to minimize.
[2023-03-20 08:54:31] [INFO ] Deduced a trap composed of 31 places in 115 ms of which 1 ms to minimize.
[2023-03-20 08:54:31] [INFO ] Deduced a trap composed of 32 places in 130 ms of which 0 ms to minimize.
[2023-03-20 08:54:31] [INFO ] Deduced a trap composed of 31 places in 125 ms of which 0 ms to minimize.
[2023-03-20 08:54:31] [INFO ] Deduced a trap composed of 32 places in 133 ms of which 2 ms to minimize.
[2023-03-20 08:54:31] [INFO ] Deduced a trap composed of 31 places in 116 ms of which 2 ms to minimize.
[2023-03-20 08:54:32] [INFO ] Deduced a trap composed of 32 places in 113 ms of which 1 ms to minimize.
[2023-03-20 08:54:32] [INFO ] Deduced a trap composed of 8 places in 123 ms of which 1 ms to minimize.
[2023-03-20 08:54:32] [INFO ] Deduced a trap composed of 8 places in 108 ms of which 0 ms to minimize.
[2023-03-20 08:54:32] [INFO ] Deduced a trap composed of 11 places in 105 ms of which 1 ms to minimize.
[2023-03-20 08:54:32] [INFO ] Deduced a trap composed of 31 places in 121 ms of which 1 ms to minimize.
[2023-03-20 08:54:32] [INFO ] Deduced a trap composed of 32 places in 105 ms of which 0 ms to minimize.
[2023-03-20 08:54:32] [INFO ] Deduced a trap composed of 31 places in 124 ms of which 1 ms to minimize.
[2023-03-20 08:54:33] [INFO ] Deduced a trap composed of 32 places in 119 ms of which 0 ms to minimize.
[2023-03-20 08:54:33] [INFO ] Deduced a trap composed of 31 places in 117 ms of which 1 ms to minimize.
[2023-03-20 08:54:33] [INFO ] Deduced a trap composed of 11 places in 125 ms of which 0 ms to minimize.
[2023-03-20 08:54:33] [INFO ] Deduced a trap composed of 8 places in 99 ms of which 1 ms to minimize.
[2023-03-20 08:54:33] [INFO ] Deduced a trap composed of 11 places in 113 ms of which 1 ms to minimize.
[2023-03-20 08:54:33] [INFO ] Deduced a trap composed of 13 places in 91 ms of which 0 ms to minimize.
[2023-03-20 08:54:33] [INFO ] Deduced a trap composed of 36 places in 104 ms of which 0 ms to minimize.
[2023-03-20 08:54:34] [INFO ] Deduced a trap composed of 20 places in 118 ms of which 1 ms to minimize.
[2023-03-20 08:54:34] [INFO ] Deduced a trap composed of 24 places in 125 ms of which 0 ms to minimize.
[2023-03-20 08:54:34] [INFO ] Deduced a trap composed of 28 places in 134 ms of which 1 ms to minimize.
[2023-03-20 08:54:34] [INFO ] Deduced a trap composed of 33 places in 101 ms of which 1 ms to minimize.
[2023-03-20 08:54:34] [INFO ] Deduced a trap composed of 40 places in 116 ms of which 0 ms to minimize.
[2023-03-20 08:54:34] [INFO ] Deduced a trap composed of 19 places in 83 ms of which 0 ms to minimize.
[2023-03-20 08:54:35] [INFO ] Deduced a trap composed of 15 places in 103 ms of which 1 ms to minimize.
[2023-03-20 08:54:35] [INFO ] Deduced a trap composed of 19 places in 98 ms of which 0 ms to minimize.
[2023-03-20 08:54:35] [INFO ] Deduced a trap composed of 23 places in 104 ms of which 0 ms to minimize.
[2023-03-20 08:54:35] [INFO ] Deduced a trap composed of 23 places in 108 ms of which 1 ms to minimize.
[2023-03-20 08:54:35] [INFO ] Deduced a trap composed of 31 places in 91 ms of which 0 ms to minimize.
[2023-03-20 08:54:35] [INFO ] Deduced a trap composed of 36 places in 106 ms of which 0 ms to minimize.
[2023-03-20 08:54:35] [INFO ] Deduced a trap composed of 20 places in 107 ms of which 0 ms to minimize.
[2023-03-20 08:54:35] [INFO ] Deduced a trap composed of 23 places in 103 ms of which 0 ms to minimize.
[2023-03-20 08:54:36] [INFO ] Deduced a trap composed of 23 places in 100 ms of which 1 ms to minimize.
[2023-03-20 08:54:36] [INFO ] Deduced a trap composed of 23 places in 122 ms of which 1 ms to minimize.
[2023-03-20 08:54:36] [INFO ] Deduced a trap composed of 23 places in 97 ms of which 1 ms to minimize.
[2023-03-20 08:54:36] [INFO ] Deduced a trap composed of 23 places in 100 ms of which 1 ms to minimize.
[2023-03-20 08:54:36] [INFO ] Deduced a trap composed of 23 places in 98 ms of which 0 ms to minimize.
[2023-03-20 08:54:36] [INFO ] Deduced a trap composed of 20 places in 105 ms of which 0 ms to minimize.
[2023-03-20 08:54:36] [INFO ] Deduced a trap composed of 23 places in 97 ms of which 1 ms to minimize.
[2023-03-20 08:54:37] [INFO ] Deduced a trap composed of 23 places in 98 ms of which 0 ms to minimize.
[2023-03-20 08:54:37] [INFO ] Deduced a trap composed of 23 places in 109 ms of which 1 ms to minimize.
[2023-03-20 08:54:37] [INFO ] Deduced a trap composed of 23 places in 93 ms of which 0 ms to minimize.
[2023-03-20 08:54:37] [INFO ] Deduced a trap composed of 44 places in 95 ms of which 1 ms to minimize.
[2023-03-20 08:54:37] [INFO ] Deduced a trap composed of 31 places in 92 ms of which 1 ms to minimize.
[2023-03-20 08:54:37] [INFO ] Deduced a trap composed of 48 places in 94 ms of which 1 ms to minimize.
[2023-03-20 08:54:37] [INFO ] Deduced a trap composed of 32 places in 107 ms of which 1 ms to minimize.
[2023-03-20 08:54:38] [INFO ] Deduced a trap composed of 48 places in 99 ms of which 0 ms to minimize.
[2023-03-20 08:54:38] [INFO ] Deduced a trap composed of 32 places in 100 ms of which 1 ms to minimize.
[2023-03-20 08:54:38] [INFO ] Deduced a trap composed of 48 places in 98 ms of which 0 ms to minimize.
[2023-03-20 08:54:38] [INFO ] Deduced a trap composed of 48 places in 99 ms of which 1 ms to minimize.
[2023-03-20 08:54:38] [INFO ] Deduced a trap composed of 44 places in 111 ms of which 1 ms to minimize.
[2023-03-20 08:54:38] [INFO ] Deduced a trap composed of 31 places in 98 ms of which 0 ms to minimize.
[2023-03-20 08:54:38] [INFO ] Deduced a trap composed of 57 places in 98 ms of which 1 ms to minimize.
[2023-03-20 08:54:39] [INFO ] Deduced a trap composed of 32 places in 100 ms of which 2 ms to minimize.
[2023-03-20 08:54:39] [INFO ] Deduced a trap composed of 48 places in 101 ms of which 1 ms to minimize.
[2023-03-20 08:54:39] [INFO ] Deduced a trap composed of 44 places in 98 ms of which 0 ms to minimize.
[2023-03-20 08:54:39] [INFO ] Deduced a trap composed of 52 places in 111 ms of which 1 ms to minimize.
[2023-03-20 08:54:39] [INFO ] Deduced a trap composed of 57 places in 99 ms of which 0 ms to minimize.
[2023-03-20 08:54:39] [INFO ] Deduced a trap composed of 55 places in 109 ms of which 0 ms to minimize.
[2023-03-20 08:54:39] [INFO ] Deduced a trap composed of 64 places in 96 ms of which 0 ms to minimize.
[2023-03-20 08:54:39] [INFO ] Deduced a trap composed of 57 places in 91 ms of which 0 ms to minimize.
[2023-03-20 08:54:40] [INFO ] Deduced a trap composed of 8 places in 86 ms of which 1 ms to minimize.
[2023-03-20 08:54:40] [INFO ] Deduced a trap composed of 11 places in 87 ms of which 0 ms to minimize.
[2023-03-20 08:54:40] [INFO ] Deduced a trap composed of 15 places in 87 ms of which 0 ms to minimize.
[2023-03-20 08:54:40] [INFO ] Deduced a trap composed of 54 places in 85 ms of which 1 ms to minimize.
[2023-03-20 08:54:40] [INFO ] Deduced a trap composed of 20 places in 86 ms of which 1 ms to minimize.
[2023-03-20 08:54:40] [INFO ] Deduced a trap composed of 57 places in 80 ms of which 0 ms to minimize.
[2023-03-20 08:54:40] [INFO ] Deduced a trap composed of 41 places in 91 ms of which 1 ms to minimize.
[2023-03-20 08:54:40] [INFO ] Deduced a trap composed of 11 places in 84 ms of which 0 ms to minimize.
[2023-03-20 08:54:41] [INFO ] Deduced a trap composed of 44 places in 51 ms of which 0 ms to minimize.
[2023-03-20 08:54:41] [INFO ] Deduced a trap composed of 57 places in 50 ms of which 0 ms to minimize.
[2023-03-20 08:54:41] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 1 ms to minimize.
[2023-03-20 08:54:41] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 0 ms to minimize.
[2023-03-20 08:54:41] [INFO ] Deduced a trap composed of 19 places in 54 ms of which 0 ms to minimize.
[2023-03-20 08:54:41] [INFO ] Deduced a trap composed of 55 places in 55 ms of which 1 ms to minimize.
[2023-03-20 08:54:41] [INFO ] Deduced a trap composed of 57 places in 55 ms of which 1 ms to minimize.
[2023-03-20 08:54:41] [INFO ] Deduced a trap composed of 43 places in 67 ms of which 0 ms to minimize.
[2023-03-20 08:54:41] [INFO ] Deduced a trap composed of 54 places in 70 ms of which 0 ms to minimize.
[2023-03-20 08:54:41] [INFO ] Deduced a trap composed of 60 places in 85 ms of which 1 ms to minimize.
[2023-03-20 08:54:41] [INFO ] Deduced a trap composed of 57 places in 65 ms of which 0 ms to minimize.
[2023-03-20 08:54:42] [INFO ] Deduced a trap composed of 57 places in 66 ms of which 0 ms to minimize.
[2023-03-20 08:54:42] [INFO ] Deduced a trap composed of 54 places in 63 ms of which 0 ms to minimize.
[2023-03-20 08:54:42] [INFO ] Deduced a trap composed of 61 places in 67 ms of which 0 ms to minimize.
[2023-03-20 08:54:42] [INFO ] Deduced a trap composed of 71 places in 68 ms of which 1 ms to minimize.
[2023-03-20 08:54:42] [INFO ] Deduced a trap composed of 71 places in 68 ms of which 1 ms to minimize.
[2023-03-20 08:54:42] [INFO ] Deduced a trap composed of 67 places in 68 ms of which 0 ms to minimize.
[2023-03-20 08:54:42] [INFO ] Deduced a trap composed of 64 places in 64 ms of which 0 ms to minimize.
[2023-03-20 08:54:42] [INFO ] Deduced a trap composed of 63 places in 66 ms of which 0 ms to minimize.
[2023-03-20 08:54:42] [INFO ] Deduced a trap composed of 54 places in 69 ms of which 0 ms to minimize.
[2023-03-20 08:54:43] [INFO ] Deduced a trap composed of 57 places in 67 ms of which 1 ms to minimize.
[2023-03-20 08:54:43] [INFO ] Deduced a trap composed of 55 places in 67 ms of which 1 ms to minimize.
[2023-03-20 08:54:43] [INFO ] Deduced a trap composed of 11 places in 80 ms of which 1 ms to minimize.
[2023-03-20 08:54:43] [INFO ] Deduced a trap composed of 52 places in 71 ms of which 1 ms to minimize.
[2023-03-20 08:54:43] [INFO ] Deduced a trap composed of 64 places in 70 ms of which 1 ms to minimize.
[2023-03-20 08:54:43] [INFO ] Deduced a trap composed of 64 places in 72 ms of which 0 ms to minimize.
[2023-03-20 08:54:43] [INFO ] Deduced a trap composed of 55 places in 67 ms of which 0 ms to minimize.
[2023-03-20 08:54:43] [INFO ] Deduced a trap composed of 55 places in 67 ms of which 1 ms to minimize.
[2023-03-20 08:54:43] [INFO ] Deduced a trap composed of 55 places in 67 ms of which 0 ms to minimize.
[2023-03-20 08:54:43] [INFO ] Deduced a trap composed of 47 places in 68 ms of which 1 ms to minimize.
[2023-03-20 08:54:44] [INFO ] Deduced a trap composed of 47 places in 59 ms of which 0 ms to minimize.
[2023-03-20 08:54:44] [INFO ] Deduced a trap composed of 55 places in 58 ms of which 0 ms to minimize.
[2023-03-20 08:54:44] [INFO ] Deduced a trap composed of 57 places in 65 ms of which 1 ms to minimize.
[2023-03-20 08:54:44] [INFO ] Deduced a trap composed of 47 places in 57 ms of which 0 ms to minimize.
[2023-03-20 08:54:44] [INFO ] Deduced a trap composed of 57 places in 79 ms of which 0 ms to minimize.
[2023-03-20 08:54:44] [INFO ] Deduced a trap composed of 47 places in 74 ms of which 1 ms to minimize.
[2023-03-20 08:54:44] [INFO ] Deduced a trap composed of 55 places in 63 ms of which 0 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-20 08:54:44] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-20 08:54:44] [INFO ] After 25017ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 28 ms.
Support contains 6 out of 703 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 703/703 places, 953/953 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 702 transition count 952
Partial Free-agglomeration rule applied 101 times.
Drop transitions removed 101 transitions
Iterating global reduction 0 with 101 rules applied. Total rules applied 103 place count 702 transition count 952
Applied a total of 103 rules in 147 ms. Remains 702 /703 variables (removed 1) and now considering 952/953 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 147 ms. Remains : 702/703 places, 952/953 transitions.
Incomplete random walk after 10000 steps, including 17 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 275477 steps, run timeout after 3001 ms. (steps per millisecond=91 ) properties seen :{}
Probabilistic random walk after 275477 steps, saw 165846 distinct states, run finished after 3002 ms. (steps per millisecond=91 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 952 rows 702 cols
[2023-03-20 08:54:48] [INFO ] Computed 201 place invariants in 5 ms
[2023-03-20 08:54:48] [INFO ] [Real]Absence check using 201 positive place invariants in 26 ms returned sat
[2023-03-20 08:54:48] [INFO ] After 505ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 08:54:48] [INFO ] [Nat]Absence check using 201 positive place invariants in 26 ms returned sat
[2023-03-20 08:54:48] [INFO ] After 310ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 08:54:49] [INFO ] Deduced a trap composed of 9 places in 160 ms of which 1 ms to minimize.
[2023-03-20 08:54:49] [INFO ] Deduced a trap composed of 7 places in 155 ms of which 0 ms to minimize.
[2023-03-20 08:54:49] [INFO ] Deduced a trap composed of 6 places in 153 ms of which 0 ms to minimize.
[2023-03-20 08:54:49] [INFO ] Deduced a trap composed of 7 places in 164 ms of which 1 ms to minimize.
[2023-03-20 08:54:49] [INFO ] Deduced a trap composed of 13 places in 151 ms of which 0 ms to minimize.
[2023-03-20 08:54:50] [INFO ] Deduced a trap composed of 11 places in 153 ms of which 0 ms to minimize.
[2023-03-20 08:54:50] [INFO ] Deduced a trap composed of 7 places in 151 ms of which 1 ms to minimize.
[2023-03-20 08:54:50] [INFO ] Deduced a trap composed of 7 places in 154 ms of which 0 ms to minimize.
[2023-03-20 08:54:50] [INFO ] Deduced a trap composed of 7 places in 150 ms of which 0 ms to minimize.
[2023-03-20 08:54:50] [INFO ] Deduced a trap composed of 12 places in 142 ms of which 1 ms to minimize.
[2023-03-20 08:54:51] [INFO ] Deduced a trap composed of 7 places in 150 ms of which 1 ms to minimize.
[2023-03-20 08:54:51] [INFO ] Deduced a trap composed of 11 places in 146 ms of which 0 ms to minimize.
[2023-03-20 08:54:51] [INFO ] Deduced a trap composed of 11 places in 153 ms of which 0 ms to minimize.
[2023-03-20 08:54:51] [INFO ] Deduced a trap composed of 7 places in 150 ms of which 0 ms to minimize.
[2023-03-20 08:54:51] [INFO ] Deduced a trap composed of 7 places in 142 ms of which 1 ms to minimize.
[2023-03-20 08:54:51] [INFO ] Deduced a trap composed of 7 places in 144 ms of which 0 ms to minimize.
[2023-03-20 08:54:52] [INFO ] Deduced a trap composed of 7 places in 127 ms of which 0 ms to minimize.
[2023-03-20 08:54:52] [INFO ] Deduced a trap composed of 7 places in 144 ms of which 0 ms to minimize.
[2023-03-20 08:54:52] [INFO ] Deduced a trap composed of 7 places in 141 ms of which 0 ms to minimize.
[2023-03-20 08:54:52] [INFO ] Deduced a trap composed of 7 places in 138 ms of which 0 ms to minimize.
[2023-03-20 08:54:52] [INFO ] Deduced a trap composed of 7 places in 123 ms of which 0 ms to minimize.
[2023-03-20 08:54:52] [INFO ] Deduced a trap composed of 16 places in 124 ms of which 0 ms to minimize.
[2023-03-20 08:54:53] [INFO ] Deduced a trap composed of 17 places in 121 ms of which 0 ms to minimize.
[2023-03-20 08:54:53] [INFO ] Deduced a trap composed of 15 places in 121 ms of which 0 ms to minimize.
[2023-03-20 08:54:53] [INFO ] Deduced a trap composed of 7 places in 120 ms of which 0 ms to minimize.
[2023-03-20 08:54:53] [INFO ] Deduced a trap composed of 7 places in 118 ms of which 0 ms to minimize.
[2023-03-20 08:54:53] [INFO ] Deduced a trap composed of 11 places in 123 ms of which 0 ms to minimize.
[2023-03-20 08:54:53] [INFO ] Deduced a trap composed of 11 places in 137 ms of which 1 ms to minimize.
[2023-03-20 08:54:53] [INFO ] Deduced a trap composed of 7 places in 124 ms of which 0 ms to minimize.
[2023-03-20 08:54:54] [INFO ] Deduced a trap composed of 7 places in 152 ms of which 1 ms to minimize.
[2023-03-20 08:54:54] [INFO ] Deduced a trap composed of 7 places in 167 ms of which 0 ms to minimize.
[2023-03-20 08:54:54] [INFO ] Deduced a trap composed of 7 places in 166 ms of which 1 ms to minimize.
[2023-03-20 08:54:54] [INFO ] Deduced a trap composed of 7 places in 167 ms of which 1 ms to minimize.
[2023-03-20 08:54:54] [INFO ] Deduced a trap composed of 7 places in 169 ms of which 0 ms to minimize.
[2023-03-20 08:54:55] [INFO ] Deduced a trap composed of 7 places in 150 ms of which 1 ms to minimize.
[2023-03-20 08:54:55] [INFO ] Deduced a trap composed of 7 places in 148 ms of which 0 ms to minimize.
[2023-03-20 08:54:55] [INFO ] Deduced a trap composed of 15 places in 145 ms of which 1 ms to minimize.
[2023-03-20 08:54:55] [INFO ] Deduced a trap composed of 11 places in 144 ms of which 1 ms to minimize.
[2023-03-20 08:54:55] [INFO ] Deduced a trap composed of 7 places in 167 ms of which 1 ms to minimize.
[2023-03-20 08:54:56] [INFO ] Deduced a trap composed of 29 places in 146 ms of which 0 ms to minimize.
[2023-03-20 08:54:56] [INFO ] Deduced a trap composed of 28 places in 143 ms of which 0 ms to minimize.
[2023-03-20 08:54:56] [INFO ] Deduced a trap composed of 29 places in 141 ms of which 1 ms to minimize.
[2023-03-20 08:54:56] [INFO ] Deduced a trap composed of 31 places in 148 ms of which 0 ms to minimize.
[2023-03-20 08:54:56] [INFO ] Deduced a trap composed of 28 places in 145 ms of which 0 ms to minimize.
[2023-03-20 08:54:56] [INFO ] Deduced a trap composed of 28 places in 141 ms of which 0 ms to minimize.
[2023-03-20 08:54:57] [INFO ] Deduced a trap composed of 27 places in 142 ms of which 0 ms to minimize.
[2023-03-20 08:54:57] [INFO ] Deduced a trap composed of 27 places in 136 ms of which 0 ms to minimize.
[2023-03-20 08:54:57] [INFO ] Deduced a trap composed of 11 places in 141 ms of which 0 ms to minimize.
[2023-03-20 08:54:57] [INFO ] Deduced a trap composed of 7 places in 141 ms of which 1 ms to minimize.
[2023-03-20 08:54:57] [INFO ] Deduced a trap composed of 11 places in 133 ms of which 0 ms to minimize.
[2023-03-20 08:54:57] [INFO ] Deduced a trap composed of 11 places in 137 ms of which 0 ms to minimize.
[2023-03-20 08:54:58] [INFO ] Deduced a trap composed of 11 places in 125 ms of which 0 ms to minimize.
[2023-03-20 08:54:58] [INFO ] Deduced a trap composed of 15 places in 168 ms of which 0 ms to minimize.
[2023-03-20 08:54:58] [INFO ] Deduced a trap composed of 31 places in 145 ms of which 0 ms to minimize.
[2023-03-20 08:54:58] [INFO ] Deduced a trap composed of 39 places in 146 ms of which 1 ms to minimize.
[2023-03-20 08:54:58] [INFO ] Deduced a trap composed of 16 places in 149 ms of which 1 ms to minimize.
[2023-03-20 08:54:59] [INFO ] Deduced a trap composed of 12 places in 148 ms of which 1 ms to minimize.
[2023-03-20 08:54:59] [INFO ] Deduced a trap composed of 15 places in 148 ms of which 0 ms to minimize.
[2023-03-20 08:54:59] [INFO ] Deduced a trap composed of 15 places in 147 ms of which 1 ms to minimize.
[2023-03-20 08:54:59] [INFO ] Deduced a trap composed of 43 places in 136 ms of which 1 ms to minimize.
[2023-03-20 08:54:59] [INFO ] Deduced a trap composed of 35 places in 134 ms of which 0 ms to minimize.
[2023-03-20 08:54:59] [INFO ] Deduced a trap composed of 11 places in 134 ms of which 1 ms to minimize.
[2023-03-20 08:55:00] [INFO ] Deduced a trap composed of 15 places in 134 ms of which 1 ms to minimize.
[2023-03-20 08:55:00] [INFO ] Deduced a trap composed of 15 places in 162 ms of which 1 ms to minimize.
[2023-03-20 08:55:00] [INFO ] Deduced a trap composed of 19 places in 157 ms of which 2 ms to minimize.
[2023-03-20 08:55:00] [INFO ] Deduced a trap composed of 11 places in 134 ms of which 1 ms to minimize.
[2023-03-20 08:55:00] [INFO ] Deduced a trap composed of 19 places in 149 ms of which 1 ms to minimize.
[2023-03-20 08:55:00] [INFO ] Deduced a trap composed of 7 places in 164 ms of which 0 ms to minimize.
[2023-03-20 08:55:01] [INFO ] Deduced a trap composed of 15 places in 136 ms of which 0 ms to minimize.
[2023-03-20 08:55:01] [INFO ] Deduced a trap composed of 15 places in 135 ms of which 0 ms to minimize.
[2023-03-20 08:55:01] [INFO ] Deduced a trap composed of 16 places in 138 ms of which 0 ms to minimize.
[2023-03-20 08:55:01] [INFO ] Deduced a trap composed of 35 places in 180 ms of which 1 ms to minimize.
[2023-03-20 08:55:01] [INFO ] Deduced a trap composed of 35 places in 181 ms of which 0 ms to minimize.
[2023-03-20 08:55:02] [INFO ] Deduced a trap composed of 28 places in 179 ms of which 0 ms to minimize.
[2023-03-20 08:55:02] [INFO ] Deduced a trap composed of 7 places in 179 ms of which 1 ms to minimize.
[2023-03-20 08:55:02] [INFO ] Deduced a trap composed of 28 places in 138 ms of which 0 ms to minimize.
[2023-03-20 08:55:02] [INFO ] Deduced a trap composed of 35 places in 136 ms of which 1 ms to minimize.
[2023-03-20 08:55:02] [INFO ] Deduced a trap composed of 35 places in 175 ms of which 1 ms to minimize.
[2023-03-20 08:55:03] [INFO ] Deduced a trap composed of 36 places in 157 ms of which 0 ms to minimize.
[2023-03-20 08:55:03] [INFO ] Deduced a trap composed of 27 places in 130 ms of which 1 ms to minimize.
[2023-03-20 08:55:03] [INFO ] Deduced a trap composed of 35 places in 130 ms of which 1 ms to minimize.
[2023-03-20 08:55:03] [INFO ] Deduced a trap composed of 39 places in 136 ms of which 1 ms to minimize.
[2023-03-20 08:55:03] [INFO ] Deduced a trap composed of 35 places in 133 ms of which 0 ms to minimize.
[2023-03-20 08:55:03] [INFO ] Deduced a trap composed of 35 places in 133 ms of which 0 ms to minimize.
[2023-03-20 08:55:04] [INFO ] Deduced a trap composed of 39 places in 134 ms of which 1 ms to minimize.
[2023-03-20 08:55:04] [INFO ] Deduced a trap composed of 39 places in 133 ms of which 0 ms to minimize.
[2023-03-20 08:55:04] [INFO ] Deduced a trap composed of 47 places in 133 ms of which 0 ms to minimize.
[2023-03-20 08:55:04] [INFO ] Deduced a trap composed of 47 places in 157 ms of which 1 ms to minimize.
[2023-03-20 08:55:04] [INFO ] Deduced a trap composed of 47 places in 143 ms of which 3 ms to minimize.
[2023-03-20 08:55:04] [INFO ] Deduced a trap composed of 43 places in 134 ms of which 1 ms to minimize.
[2023-03-20 08:55:05] [INFO ] Deduced a trap composed of 43 places in 150 ms of which 1 ms to minimize.
[2023-03-20 08:55:05] [INFO ] Deduced a trap composed of 16 places in 143 ms of which 1 ms to minimize.
[2023-03-20 08:55:05] [INFO ] Deduced a trap composed of 19 places in 138 ms of which 0 ms to minimize.
[2023-03-20 08:55:05] [INFO ] Deduced a trap composed of 19 places in 125 ms of which 1 ms to minimize.
[2023-03-20 08:55:05] [INFO ] Deduced a trap composed of 19 places in 140 ms of which 0 ms to minimize.
[2023-03-20 08:55:06] [INFO ] Deduced a trap composed of 19 places in 178 ms of which 0 ms to minimize.
[2023-03-20 08:55:06] [INFO ] Deduced a trap composed of 47 places in 174 ms of which 0 ms to minimize.
[2023-03-20 08:55:06] [INFO ] Deduced a trap composed of 47 places in 151 ms of which 0 ms to minimize.
[2023-03-20 08:55:06] [INFO ] Deduced a trap composed of 47 places in 177 ms of which 0 ms to minimize.
[2023-03-20 08:55:06] [INFO ] Deduced a trap composed of 35 places in 141 ms of which 1 ms to minimize.
[2023-03-20 08:55:06] [INFO ] Deduced a trap composed of 35 places in 121 ms of which 0 ms to minimize.
[2023-03-20 08:55:07] [INFO ] Deduced a trap composed of 39 places in 153 ms of which 1 ms to minimize.
[2023-03-20 08:55:07] [INFO ] Deduced a trap composed of 35 places in 162 ms of which 1 ms to minimize.
[2023-03-20 08:55:07] [INFO ] Deduced a trap composed of 39 places in 177 ms of which 1 ms to minimize.
[2023-03-20 08:55:07] [INFO ] Deduced a trap composed of 35 places in 170 ms of which 0 ms to minimize.
[2023-03-20 08:55:07] [INFO ] Deduced a trap composed of 35 places in 132 ms of which 1 ms to minimize.
[2023-03-20 08:55:08] [INFO ] Deduced a trap composed of 43 places in 140 ms of which 0 ms to minimize.
[2023-03-20 08:55:08] [INFO ] Deduced a trap composed of 43 places in 137 ms of which 1 ms to minimize.
[2023-03-20 08:55:08] [INFO ] Deduced a trap composed of 43 places in 133 ms of which 0 ms to minimize.
[2023-03-20 08:55:08] [INFO ] Deduced a trap composed of 43 places in 155 ms of which 1 ms to minimize.
[2023-03-20 08:55:08] [INFO ] Deduced a trap composed of 43 places in 183 ms of which 1 ms to minimize.
[2023-03-20 08:55:09] [INFO ] Deduced a trap composed of 43 places in 172 ms of which 1 ms to minimize.
[2023-03-20 08:55:09] [INFO ] Deduced a trap composed of 43 places in 169 ms of which 0 ms to minimize.
[2023-03-20 08:55:09] [INFO ] Deduced a trap composed of 47 places in 159 ms of which 1 ms to minimize.
[2023-03-20 08:55:09] [INFO ] Deduced a trap composed of 43 places in 146 ms of which 0 ms to minimize.
[2023-03-20 08:55:09] [INFO ] Deduced a trap composed of 43 places in 144 ms of which 0 ms to minimize.
[2023-03-20 08:55:10] [INFO ] Deduced a trap composed of 43 places in 142 ms of which 1 ms to minimize.
[2023-03-20 08:55:10] [INFO ] Deduced a trap composed of 43 places in 143 ms of which 1 ms to minimize.
[2023-03-20 08:55:10] [INFO ] Deduced a trap composed of 43 places in 142 ms of which 1 ms to minimize.
[2023-03-20 08:55:10] [INFO ] Deduced a trap composed of 43 places in 139 ms of which 0 ms to minimize.
[2023-03-20 08:55:10] [INFO ] Deduced a trap composed of 43 places in 143 ms of which 1 ms to minimize.
[2023-03-20 08:55:10] [INFO ] Deduced a trap composed of 43 places in 140 ms of which 0 ms to minimize.
[2023-03-20 08:55:11] [INFO ] Deduced a trap composed of 43 places in 139 ms of which 0 ms to minimize.
[2023-03-20 08:55:11] [INFO ] Deduced a trap composed of 43 places in 149 ms of which 1 ms to minimize.
[2023-03-20 08:55:11] [INFO ] Deduced a trap composed of 43 places in 142 ms of which 1 ms to minimize.
[2023-03-20 08:55:11] [INFO ] Trap strengthening procedure interrupted after too many repetitions 22453 ms
[2023-03-20 08:55:11] [INFO ] Trap strengthening (SAT) tested/added 125/124 trap constraints in 22453 ms
[2023-03-20 08:55:11] [INFO ] After 22812ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 64 ms.
[2023-03-20 08:55:11] [INFO ] After 23006ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 19 ms.
Support contains 6 out of 702 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 702/702 places, 952/952 transitions.
Applied a total of 0 rules in 50 ms. Remains 702 /702 variables (removed 0) and now considering 952/952 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50 ms. Remains : 702/702 places, 952/952 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 702/702 places, 952/952 transitions.
Applied a total of 0 rules in 43 ms. Remains 702 /702 variables (removed 0) and now considering 952/952 (removed 0) transitions.
[2023-03-20 08:55:11] [INFO ] Invariant cache hit.
[2023-03-20 08:55:12] [INFO ] Implicit Places using invariants in 360 ms returned []
[2023-03-20 08:55:12] [INFO ] Invariant cache hit.
[2023-03-20 08:55:12] [INFO ] Implicit Places using invariants and state equation in 930 ms returned []
Implicit Place search using SMT with State Equation took 1292 ms to find 0 implicit places.
[2023-03-20 08:55:13] [INFO ] Redundant transitions in 115 ms returned []
[2023-03-20 08:55:13] [INFO ] Invariant cache hit.
[2023-03-20 08:55:13] [INFO ] Dead Transitions using invariants and state equation in 464 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1926 ms. Remains : 702/702 places, 952/952 transitions.
Applied a total of 0 rules in 33 ms. Remains 702 /702 variables (removed 0) and now considering 952/952 (removed 0) transitions.
Running SMT prover for 1 properties.
[2023-03-20 08:55:13] [INFO ] Invariant cache hit.
[2023-03-20 08:55:13] [INFO ] [Real]Absence check using 201 positive place invariants in 28 ms returned sat
[2023-03-20 08:55:14] [INFO ] After 483ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 08:55:14] [INFO ] [Nat]Absence check using 201 positive place invariants in 30 ms returned sat
[2023-03-20 08:55:14] [INFO ] After 417ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 08:55:15] [INFO ] Deduced a trap composed of 7 places in 158 ms of which 0 ms to minimize.
[2023-03-20 08:55:17] [INFO ] Deduced a trap composed of 7 places in 202 ms of which 1 ms to minimize.
[2023-03-20 08:55:19] [INFO ] Deduced a trap composed of 7 places in 199 ms of which 1 ms to minimize.
[2023-03-20 08:55:19] [INFO ] Deduced a trap composed of 7 places in 175 ms of which 0 ms to minimize.
[2023-03-20 08:55:19] [INFO ] Deduced a trap composed of 7 places in 175 ms of which 1 ms to minimize.
[2023-03-20 08:55:19] [INFO ] Deduced a trap composed of 15 places in 181 ms of which 1 ms to minimize.
[2023-03-20 08:55:20] [INFO ] Deduced a trap composed of 7 places in 170 ms of which 1 ms to minimize.
[2023-03-20 08:55:20] [INFO ] Deduced a trap composed of 13 places in 192 ms of which 0 ms to minimize.
[2023-03-20 08:55:20] [INFO ] Deduced a trap composed of 11 places in 193 ms of which 1 ms to minimize.
[2023-03-20 08:55:20] [INFO ] Deduced a trap composed of 11 places in 185 ms of which 1 ms to minimize.
[2023-03-20 08:55:20] [INFO ] Deduced a trap composed of 7 places in 151 ms of which 0 ms to minimize.
[2023-03-20 08:55:21] [INFO ] Deduced a trap composed of 7 places in 185 ms of which 0 ms to minimize.
[2023-03-20 08:55:21] [INFO ] Deduced a trap composed of 7 places in 173 ms of which 0 ms to minimize.
[2023-03-20 08:55:21] [INFO ] Deduced a trap composed of 11 places in 154 ms of which 0 ms to minimize.
[2023-03-20 08:55:21] [INFO ] Deduced a trap composed of 11 places in 152 ms of which 1 ms to minimize.
[2023-03-20 08:55:21] [INFO ] Deduced a trap composed of 15 places in 137 ms of which 1 ms to minimize.
[2023-03-20 08:55:22] [INFO ] Deduced a trap composed of 7 places in 138 ms of which 0 ms to minimize.
[2023-03-20 08:55:22] [INFO ] Deduced a trap composed of 15 places in 131 ms of which 0 ms to minimize.
[2023-03-20 08:55:22] [INFO ] Deduced a trap composed of 15 places in 128 ms of which 0 ms to minimize.
[2023-03-20 08:55:22] [INFO ] Deduced a trap composed of 12 places in 136 ms of which 0 ms to minimize.
[2023-03-20 08:55:22] [INFO ] Deduced a trap composed of 19 places in 175 ms of which 1 ms to minimize.
[2023-03-20 08:55:23] [INFO ] Deduced a trap composed of 12 places in 173 ms of which 0 ms to minimize.
[2023-03-20 08:55:23] [INFO ] Deduced a trap composed of 11 places in 180 ms of which 0 ms to minimize.
[2023-03-20 08:55:23] [INFO ] Deduced a trap composed of 7 places in 153 ms of which 0 ms to minimize.
[2023-03-20 08:55:23] [INFO ] Deduced a trap composed of 15 places in 184 ms of which 1 ms to minimize.
[2023-03-20 08:55:23] [INFO ] Deduced a trap composed of 16 places in 190 ms of which 1 ms to minimize.
[2023-03-20 08:55:24] [INFO ] Deduced a trap composed of 15 places in 178 ms of which 0 ms to minimize.
[2023-03-20 08:55:24] [INFO ] Deduced a trap composed of 19 places in 198 ms of which 1 ms to minimize.
[2023-03-20 08:55:24] [INFO ] Deduced a trap composed of 12 places in 176 ms of which 1 ms to minimize.
[2023-03-20 08:55:24] [INFO ] Deduced a trap composed of 11 places in 187 ms of which 0 ms to minimize.
[2023-03-20 08:55:24] [INFO ] Deduced a trap composed of 11 places in 159 ms of which 1 ms to minimize.
[2023-03-20 08:55:25] [INFO ] Deduced a trap composed of 12 places in 201 ms of which 1 ms to minimize.
[2023-03-20 08:55:25] [INFO ] Deduced a trap composed of 7 places in 181 ms of which 1 ms to minimize.
[2023-03-20 08:55:26] [INFO ] Deduced a trap composed of 7 places in 173 ms of which 1 ms to minimize.
[2023-03-20 08:55:26] [INFO ] Deduced a trap composed of 11 places in 169 ms of which 0 ms to minimize.
[2023-03-20 08:55:26] [INFO ] Deduced a trap composed of 11 places in 155 ms of which 1 ms to minimize.
[2023-03-20 08:55:26] [INFO ] Deduced a trap composed of 11 places in 172 ms of which 0 ms to minimize.
[2023-03-20 08:55:26] [INFO ] Deduced a trap composed of 7 places in 177 ms of which 0 ms to minimize.
[2023-03-20 08:55:27] [INFO ] Deduced a trap composed of 7 places in 162 ms of which 0 ms to minimize.
[2023-03-20 08:55:27] [INFO ] Deduced a trap composed of 20 places in 149 ms of which 0 ms to minimize.
[2023-03-20 08:55:27] [INFO ] Deduced a trap composed of 27 places in 137 ms of which 1 ms to minimize.
[2023-03-20 08:55:27] [INFO ] Deduced a trap composed of 27 places in 182 ms of which 1 ms to minimize.
[2023-03-20 08:55:27] [INFO ] Deduced a trap composed of 15 places in 138 ms of which 0 ms to minimize.
[2023-03-20 08:55:28] [INFO ] Deduced a trap composed of 15 places in 120 ms of which 0 ms to minimize.
[2023-03-20 08:55:28] [INFO ] Deduced a trap composed of 7 places in 115 ms of which 1 ms to minimize.
[2023-03-20 08:55:28] [INFO ] Deduced a trap composed of 19 places in 128 ms of which 1 ms to minimize.
[2023-03-20 08:55:28] [INFO ] Deduced a trap composed of 19 places in 124 ms of which 1 ms to minimize.
[2023-03-20 08:55:28] [INFO ] Deduced a trap composed of 7 places in 114 ms of which 1 ms to minimize.
[2023-03-20 08:55:28] [INFO ] Deduced a trap composed of 7 places in 123 ms of which 0 ms to minimize.
[2023-03-20 08:55:29] [INFO ] Deduced a trap composed of 7 places in 93 ms of which 0 ms to minimize.
[2023-03-20 08:55:29] [INFO ] Deduced a trap composed of 27 places in 111 ms of which 0 ms to minimize.
[2023-03-20 08:55:29] [INFO ] Deduced a trap composed of 15 places in 92 ms of which 0 ms to minimize.
[2023-03-20 08:55:29] [INFO ] Deduced a trap composed of 19 places in 96 ms of which 1 ms to minimize.
[2023-03-20 08:55:29] [INFO ] Deduced a trap composed of 19 places in 120 ms of which 0 ms to minimize.
[2023-03-20 08:55:29] [INFO ] Deduced a trap composed of 7 places in 96 ms of which 0 ms to minimize.
[2023-03-20 08:55:29] [INFO ] Deduced a trap composed of 28 places in 96 ms of which 0 ms to minimize.
[2023-03-20 08:55:30] [INFO ] Deduced a trap composed of 28 places in 94 ms of which 0 ms to minimize.
[2023-03-20 08:55:30] [INFO ] Deduced a trap composed of 27 places in 89 ms of which 0 ms to minimize.
[2023-03-20 08:55:30] [INFO ] Deduced a trap composed of 7 places in 94 ms of which 0 ms to minimize.
[2023-03-20 08:55:30] [INFO ] Deduced a trap composed of 13 places in 113 ms of which 1 ms to minimize.
[2023-03-20 08:55:30] [INFO ] Deduced a trap composed of 11 places in 109 ms of which 1 ms to minimize.
[2023-03-20 08:55:30] [INFO ] Deduced a trap composed of 19 places in 116 ms of which 0 ms to minimize.
[2023-03-20 08:55:31] [INFO ] Deduced a trap composed of 27 places in 120 ms of which 0 ms to minimize.
[2023-03-20 08:55:31] [INFO ] Deduced a trap composed of 27 places in 104 ms of which 0 ms to minimize.
[2023-03-20 08:55:31] [INFO ] Deduced a trap composed of 27 places in 102 ms of which 0 ms to minimize.
[2023-03-20 08:55:31] [INFO ] Deduced a trap composed of 27 places in 103 ms of which 0 ms to minimize.
[2023-03-20 08:55:31] [INFO ] Deduced a trap composed of 12 places in 103 ms of which 0 ms to minimize.
[2023-03-20 08:55:31] [INFO ] Deduced a trap composed of 7 places in 108 ms of which 0 ms to minimize.
[2023-03-20 08:55:31] [INFO ] Deduced a trap composed of 24 places in 111 ms of which 0 ms to minimize.
[2023-03-20 08:55:32] [INFO ] Deduced a trap composed of 24 places in 107 ms of which 0 ms to minimize.
[2023-03-20 08:55:32] [INFO ] Deduced a trap composed of 23 places in 101 ms of which 0 ms to minimize.
[2023-03-20 08:55:32] [INFO ] Deduced a trap composed of 23 places in 107 ms of which 1 ms to minimize.
[2023-03-20 08:55:32] [INFO ] Deduced a trap composed of 31 places in 110 ms of which 0 ms to minimize.
[2023-03-20 08:55:32] [INFO ] Deduced a trap composed of 23 places in 106 ms of which 1 ms to minimize.
[2023-03-20 08:55:32] [INFO ] Deduced a trap composed of 19 places in 108 ms of which 0 ms to minimize.
[2023-03-20 08:55:32] [INFO ] Deduced a trap composed of 23 places in 107 ms of which 0 ms to minimize.
[2023-03-20 08:55:33] [INFO ] Deduced a trap composed of 31 places in 107 ms of which 0 ms to minimize.
[2023-03-20 08:55:33] [INFO ] Deduced a trap composed of 31 places in 94 ms of which 0 ms to minimize.
[2023-03-20 08:55:33] [INFO ] Deduced a trap composed of 31 places in 89 ms of which 0 ms to minimize.
[2023-03-20 08:55:33] [INFO ] Deduced a trap composed of 19 places in 94 ms of which 0 ms to minimize.
[2023-03-20 08:55:33] [INFO ] Deduced a trap composed of 23 places in 110 ms of which 1 ms to minimize.
[2023-03-20 08:55:33] [INFO ] Deduced a trap composed of 23 places in 108 ms of which 0 ms to minimize.
[2023-03-20 08:55:33] [INFO ] Deduced a trap composed of 23 places in 115 ms of which 0 ms to minimize.
[2023-03-20 08:55:34] [INFO ] Deduced a trap composed of 27 places in 108 ms of which 1 ms to minimize.
[2023-03-20 08:55:34] [INFO ] Deduced a trap composed of 27 places in 98 ms of which 1 ms to minimize.
[2023-03-20 08:55:34] [INFO ] Deduced a trap composed of 27 places in 106 ms of which 1 ms to minimize.
[2023-03-20 08:55:34] [INFO ] Deduced a trap composed of 31 places in 106 ms of which 1 ms to minimize.
[2023-03-20 08:55:34] [INFO ] Deduced a trap composed of 31 places in 109 ms of which 1 ms to minimize.
[2023-03-20 08:55:34] [INFO ] Deduced a trap composed of 31 places in 107 ms of which 0 ms to minimize.
[2023-03-20 08:55:34] [INFO ] Deduced a trap composed of 31 places in 92 ms of which 0 ms to minimize.
[2023-03-20 08:55:35] [INFO ] Deduced a trap composed of 35 places in 102 ms of which 0 ms to minimize.
[2023-03-20 08:55:35] [INFO ] Deduced a trap composed of 39 places in 125 ms of which 1 ms to minimize.
[2023-03-20 08:55:35] [INFO ] Deduced a trap composed of 39 places in 125 ms of which 0 ms to minimize.
[2023-03-20 08:55:35] [INFO ] Deduced a trap composed of 35 places in 106 ms of which 0 ms to minimize.
[2023-03-20 08:55:35] [INFO ] Deduced a trap composed of 39 places in 104 ms of which 1 ms to minimize.
[2023-03-20 08:55:36] [INFO ] Deduced a trap composed of 15 places in 126 ms of which 0 ms to minimize.
[2023-03-20 08:55:36] [INFO ] Deduced a trap composed of 31 places in 143 ms of which 1 ms to minimize.
[2023-03-20 08:55:36] [INFO ] Deduced a trap composed of 16 places in 126 ms of which 0 ms to minimize.
[2023-03-20 08:55:36] [INFO ] Deduced a trap composed of 15 places in 108 ms of which 0 ms to minimize.
[2023-03-20 08:55:36] [INFO ] Deduced a trap composed of 19 places in 111 ms of which 1 ms to minimize.
[2023-03-20 08:55:36] [INFO ] Deduced a trap composed of 15 places in 117 ms of which 0 ms to minimize.
[2023-03-20 08:55:37] [INFO ] Deduced a trap composed of 31 places in 142 ms of which 0 ms to minimize.
[2023-03-20 08:55:37] [INFO ] Deduced a trap composed of 31 places in 142 ms of which 1 ms to minimize.
[2023-03-20 08:55:37] [INFO ] Deduced a trap composed of 31 places in 103 ms of which 1 ms to minimize.
[2023-03-20 08:55:37] [INFO ] Deduced a trap composed of 32 places in 111 ms of which 0 ms to minimize.
[2023-03-20 08:55:37] [INFO ] Deduced a trap composed of 31 places in 115 ms of which 1 ms to minimize.
[2023-03-20 08:55:37] [INFO ] Deduced a trap composed of 39 places in 117 ms of which 0 ms to minimize.
[2023-03-20 08:55:38] [INFO ] Deduced a trap composed of 39 places in 111 ms of which 1 ms to minimize.
[2023-03-20 08:55:38] [INFO ] Deduced a trap composed of 39 places in 104 ms of which 1 ms to minimize.
[2023-03-20 08:55:38] [INFO ] Deduced a trap composed of 39 places in 100 ms of which 0 ms to minimize.
[2023-03-20 08:55:38] [INFO ] Deduced a trap composed of 7 places in 112 ms of which 0 ms to minimize.
[2023-03-20 08:55:38] [INFO ] Deduced a trap composed of 47 places in 105 ms of which 0 ms to minimize.
[2023-03-20 08:55:38] [INFO ] Deduced a trap composed of 47 places in 98 ms of which 1 ms to minimize.
[2023-03-20 08:55:38] [INFO ] Deduced a trap composed of 7 places in 100 ms of which 0 ms to minimize.
[2023-03-20 08:55:39] [INFO ] Deduced a trap composed of 39 places in 117 ms of which 0 ms to minimize.
[2023-03-20 08:55:39] [INFO ] Deduced a trap composed of 39 places in 86 ms of which 0 ms to minimize.
[2023-03-20 08:55:39] [INFO ] Deduced a trap composed of 40 places in 104 ms of which 0 ms to minimize.
[2023-03-20 08:55:39] [INFO ] Deduced a trap composed of 39 places in 101 ms of which 1 ms to minimize.
[2023-03-20 08:55:39] [INFO ] Deduced a trap composed of 47 places in 104 ms of which 1 ms to minimize.
[2023-03-20 08:55:40] [INFO ] Deduced a trap composed of 7 places in 171 ms of which 0 ms to minimize.
[2023-03-20 08:55:40] [INFO ] Deduced a trap composed of 11 places in 166 ms of which 0 ms to minimize.
[2023-03-20 08:55:40] [INFO ] Deduced a trap composed of 7 places in 160 ms of which 0 ms to minimize.
[2023-03-20 08:55:40] [INFO ] Deduced a trap composed of 12 places in 162 ms of which 0 ms to minimize.
[2023-03-20 08:55:41] [INFO ] Deduced a trap composed of 11 places in 187 ms of which 1 ms to minimize.
[2023-03-20 08:55:41] [INFO ] Deduced a trap composed of 7 places in 175 ms of which 0 ms to minimize.
[2023-03-20 08:55:41] [INFO ] Deduced a trap composed of 7 places in 164 ms of which 1 ms to minimize.
[2023-03-20 08:55:41] [INFO ] Deduced a trap composed of 10 places in 148 ms of which 1 ms to minimize.
[2023-03-20 08:55:41] [INFO ] Deduced a trap composed of 7 places in 127 ms of which 0 ms to minimize.
[2023-03-20 08:55:42] [INFO ] Deduced a trap composed of 7 places in 125 ms of which 0 ms to minimize.
[2023-03-20 08:55:42] [INFO ] Deduced a trap composed of 11 places in 132 ms of which 0 ms to minimize.
[2023-03-20 08:55:42] [INFO ] Deduced a trap composed of 11 places in 131 ms of which 0 ms to minimize.
[2023-03-20 08:55:42] [INFO ] Deduced a trap composed of 7 places in 117 ms of which 1 ms to minimize.
[2023-03-20 08:55:42] [INFO ] Deduced a trap composed of 7 places in 145 ms of which 0 ms to minimize.
[2023-03-20 08:55:42] [INFO ] Deduced a trap composed of 13 places in 125 ms of which 1 ms to minimize.
[2023-03-20 08:55:43] [INFO ] Deduced a trap composed of 7 places in 126 ms of which 0 ms to minimize.
[2023-03-20 08:55:43] [INFO ] Deduced a trap composed of 13 places in 124 ms of which 0 ms to minimize.
[2023-03-20 08:55:43] [INFO ] Deduced a trap composed of 7 places in 126 ms of which 1 ms to minimize.
[2023-03-20 08:55:43] [INFO ] Deduced a trap composed of 7 places in 125 ms of which 0 ms to minimize.
[2023-03-20 08:55:43] [INFO ] Deduced a trap composed of 23 places in 119 ms of which 0 ms to minimize.
[2023-03-20 08:55:44] [INFO ] Deduced a trap composed of 13 places in 124 ms of which 1 ms to minimize.
[2023-03-20 08:55:44] [INFO ] Deduced a trap composed of 12 places in 120 ms of which 1 ms to minimize.
[2023-03-20 08:55:44] [INFO ] Deduced a trap composed of 7 places in 124 ms of which 1 ms to minimize.
[2023-03-20 08:55:44] [INFO ] Deduced a trap composed of 12 places in 125 ms of which 0 ms to minimize.
[2023-03-20 08:55:44] [INFO ] Deduced a trap composed of 12 places in 128 ms of which 0 ms to minimize.
[2023-03-20 08:55:44] [INFO ] Deduced a trap composed of 12 places in 148 ms of which 0 ms to minimize.
[2023-03-20 08:55:45] [INFO ] Deduced a trap composed of 11 places in 141 ms of which 0 ms to minimize.
[2023-03-20 08:55:45] [INFO ] Deduced a trap composed of 19 places in 132 ms of which 0 ms to minimize.
[2023-03-20 08:55:45] [INFO ] Deduced a trap composed of 12 places in 132 ms of which 1 ms to minimize.
[2023-03-20 08:55:45] [INFO ] Deduced a trap composed of 20 places in 152 ms of which 0 ms to minimize.
[2023-03-20 08:55:45] [INFO ] Deduced a trap composed of 11 places in 132 ms of which 0 ms to minimize.
[2023-03-20 08:55:46] [INFO ] Deduced a trap composed of 20 places in 136 ms of which 1 ms to minimize.
[2023-03-20 08:55:46] [INFO ] Deduced a trap composed of 19 places in 135 ms of which 0 ms to minimize.
[2023-03-20 08:55:46] [INFO ] Deduced a trap composed of 7 places in 134 ms of which 1 ms to minimize.
[2023-03-20 08:55:46] [INFO ] Deduced a trap composed of 12 places in 133 ms of which 0 ms to minimize.
[2023-03-20 08:55:46] [INFO ] Deduced a trap composed of 11 places in 130 ms of which 0 ms to minimize.
[2023-03-20 08:55:46] [INFO ] Deduced a trap composed of 27 places in 129 ms of which 1 ms to minimize.
[2023-03-20 08:55:47] [INFO ] Deduced a trap composed of 24 places in 130 ms of which 1 ms to minimize.
[2023-03-20 08:55:47] [INFO ] Deduced a trap composed of 23 places in 126 ms of which 1 ms to minimize.
[2023-03-20 08:55:47] [INFO ] Deduced a trap composed of 15 places in 155 ms of which 0 ms to minimize.
[2023-03-20 08:55:47] [INFO ] Deduced a trap composed of 15 places in 173 ms of which 1 ms to minimize.
[2023-03-20 08:55:47] [INFO ] Deduced a trap composed of 27 places in 131 ms of which 0 ms to minimize.
[2023-03-20 08:55:48] [INFO ] Deduced a trap composed of 27 places in 160 ms of which 0 ms to minimize.
[2023-03-20 08:55:48] [INFO ] Deduced a trap composed of 28 places in 131 ms of which 1 ms to minimize.
[2023-03-20 08:55:48] [INFO ] Deduced a trap composed of 28 places in 131 ms of which 1 ms to minimize.
[2023-03-20 08:55:48] [INFO ] Deduced a trap composed of 27 places in 130 ms of which 0 ms to minimize.
[2023-03-20 08:55:48] [INFO ] Deduced a trap composed of 19 places in 132 ms of which 0 ms to minimize.
[2023-03-20 08:55:48] [INFO ] Deduced a trap composed of 12 places in 131 ms of which 0 ms to minimize.
[2023-03-20 08:55:49] [INFO ] Deduced a trap composed of 11 places in 130 ms of which 1 ms to minimize.
[2023-03-20 08:55:49] [INFO ] Deduced a trap composed of 11 places in 135 ms of which 0 ms to minimize.
[2023-03-20 08:55:49] [INFO ] Deduced a trap composed of 19 places in 142 ms of which 0 ms to minimize.
[2023-03-20 08:55:49] [INFO ] Deduced a trap composed of 19 places in 128 ms of which 0 ms to minimize.
[2023-03-20 08:55:49] [INFO ] Deduced a trap composed of 19 places in 128 ms of which 0 ms to minimize.
[2023-03-20 08:55:50] [INFO ] Deduced a trap composed of 19 places in 128 ms of which 1 ms to minimize.
[2023-03-20 08:55:50] [INFO ] Deduced a trap composed of 19 places in 121 ms of which 0 ms to minimize.
[2023-03-20 08:55:50] [INFO ] Deduced a trap composed of 16 places in 125 ms of which 1 ms to minimize.
[2023-03-20 08:55:50] [INFO ] Deduced a trap composed of 16 places in 124 ms of which 0 ms to minimize.
[2023-03-20 08:55:50] [INFO ] Deduced a trap composed of 15 places in 127 ms of which 1 ms to minimize.
[2023-03-20 08:55:50] [INFO ] Deduced a trap composed of 15 places in 125 ms of which 0 ms to minimize.
[2023-03-20 08:55:51] [INFO ] Deduced a trap composed of 19 places in 145 ms of which 0 ms to minimize.
[2023-03-20 08:55:51] [INFO ] Deduced a trap composed of 19 places in 124 ms of which 0 ms to minimize.
[2023-03-20 08:55:51] [INFO ] Deduced a trap composed of 19 places in 129 ms of which 1 ms to minimize.
[2023-03-20 08:55:51] [INFO ] Deduced a trap composed of 19 places in 141 ms of which 1 ms to minimize.
[2023-03-20 08:55:51] [INFO ] Deduced a trap composed of 19 places in 136 ms of which 0 ms to minimize.
[2023-03-20 08:55:52] [INFO ] Deduced a trap composed of 7 places in 139 ms of which 1 ms to minimize.
[2023-03-20 08:55:52] [INFO ] Deduced a trap composed of 11 places in 155 ms of which 0 ms to minimize.
[2023-03-20 08:55:52] [INFO ] Deduced a trap composed of 7 places in 141 ms of which 1 ms to minimize.
[2023-03-20 08:55:52] [INFO ] Deduced a trap composed of 13 places in 132 ms of which 1 ms to minimize.
[2023-03-20 08:55:52] [INFO ] Deduced a trap composed of 11 places in 132 ms of which 0 ms to minimize.
[2023-03-20 08:55:52] [INFO ] Deduced a trap composed of 12 places in 131 ms of which 0 ms to minimize.
[2023-03-20 08:55:53] [INFO ] Deduced a trap composed of 11 places in 125 ms of which 1 ms to minimize.
[2023-03-20 08:55:53] [INFO ] Deduced a trap composed of 7 places in 104 ms of which 0 ms to minimize.
[2023-03-20 08:55:53] [INFO ] Deduced a trap composed of 7 places in 135 ms of which 1 ms to minimize.
[2023-03-20 08:55:53] [INFO ] Deduced a trap composed of 12 places in 134 ms of which 0 ms to minimize.
[2023-03-20 08:55:53] [INFO ] Deduced a trap composed of 11 places in 134 ms of which 0 ms to minimize.
[2023-03-20 08:55:54] [INFO ] Deduced a trap composed of 7 places in 142 ms of which 0 ms to minimize.
[2023-03-20 08:55:54] [INFO ] Deduced a trap composed of 15 places in 159 ms of which 0 ms to minimize.
[2023-03-20 08:55:54] [INFO ] Deduced a trap composed of 7 places in 168 ms of which 0 ms to minimize.
[2023-03-20 08:55:54] [INFO ] Deduced a trap composed of 13 places in 175 ms of which 1 ms to minimize.
[2023-03-20 08:55:55] [INFO ] Deduced a trap composed of 11 places in 178 ms of which 1 ms to minimize.
[2023-03-20 08:55:55] [INFO ] Deduced a trap composed of 11 places in 174 ms of which 1 ms to minimize.
[2023-03-20 08:55:55] [INFO ] Deduced a trap composed of 15 places in 179 ms of which 1 ms to minimize.
[2023-03-20 08:55:55] [INFO ] Deduced a trap composed of 7 places in 176 ms of which 1 ms to minimize.
[2023-03-20 08:55:56] [INFO ] Deduced a trap composed of 11 places in 150 ms of which 1 ms to minimize.
[2023-03-20 08:55:56] [INFO ] Deduced a trap composed of 6 places in 143 ms of which 0 ms to minimize.
[2023-03-20 08:55:56] [INFO ] Deduced a trap composed of 7 places in 146 ms of which 1 ms to minimize.
[2023-03-20 08:55:56] [INFO ] Deduced a trap composed of 12 places in 182 ms of which 1 ms to minimize.
[2023-03-20 08:55:56] [INFO ] Deduced a trap composed of 21 places in 161 ms of which 0 ms to minimize.
[2023-03-20 08:55:57] [INFO ] Deduced a trap composed of 7 places in 208 ms of which 0 ms to minimize.
[2023-03-20 08:55:57] [INFO ] Deduced a trap composed of 11 places in 188 ms of which 0 ms to minimize.
[2023-03-20 08:55:57] [INFO ] Deduced a trap composed of 7 places in 153 ms of which 1 ms to minimize.
[2023-03-20 08:55:57] [INFO ] Deduced a trap composed of 20 places in 161 ms of which 1 ms to minimize.
[2023-03-20 08:55:58] [INFO ] Deduced a trap composed of 23 places in 169 ms of which 0 ms to minimize.
[2023-03-20 08:55:58] [INFO ] Deduced a trap composed of 19 places in 149 ms of which 0 ms to minimize.
[2023-03-20 08:55:58] [INFO ] Deduced a trap composed of 20 places in 143 ms of which 0 ms to minimize.
[2023-03-20 08:55:58] [INFO ] Deduced a trap composed of 23 places in 141 ms of which 0 ms to minimize.
[2023-03-20 08:55:58] [INFO ] Deduced a trap composed of 19 places in 146 ms of which 1 ms to minimize.
[2023-03-20 08:55:59] [INFO ] Deduced a trap composed of 10 places in 131 ms of which 1 ms to minimize.
[2023-03-20 08:55:59] [INFO ] Deduced a trap composed of 7 places in 113 ms of which 0 ms to minimize.
[2023-03-20 08:55:59] [INFO ] Deduced a trap composed of 7 places in 120 ms of which 5 ms to minimize.
[2023-03-20 08:55:59] [INFO ] Deduced a trap composed of 23 places in 87 ms of which 0 ms to minimize.
[2023-03-20 08:55:59] [INFO ] Deduced a trap composed of 7 places in 90 ms of which 1 ms to minimize.
[2023-03-20 08:55:59] [INFO ] Deduced a trap composed of 11 places in 86 ms of which 0 ms to minimize.
[2023-03-20 08:55:59] [INFO ] Deduced a trap composed of 7 places in 101 ms of which 0 ms to minimize.
[2023-03-20 08:56:00] [INFO ] Deduced a trap composed of 17 places in 116 ms of which 0 ms to minimize.
[2023-03-20 08:56:00] [INFO ] Deduced a trap composed of 15 places in 98 ms of which 0 ms to minimize.
[2023-03-20 08:56:00] [INFO ] Deduced a trap composed of 17 places in 123 ms of which 0 ms to minimize.
[2023-03-20 08:56:00] [INFO ] Deduced a trap composed of 7 places in 113 ms of which 0 ms to minimize.
[2023-03-20 08:56:00] [INFO ] Deduced a trap composed of 16 places in 127 ms of which 0 ms to minimize.
[2023-03-20 08:56:00] [INFO ] Deduced a trap composed of 16 places in 116 ms of which 1 ms to minimize.
[2023-03-20 08:56:01] [INFO ] Deduced a trap composed of 19 places in 111 ms of which 0 ms to minimize.
[2023-03-20 08:56:01] [INFO ] Deduced a trap composed of 17 places in 110 ms of which 0 ms to minimize.
[2023-03-20 08:56:01] [INFO ] Deduced a trap composed of 15 places in 111 ms of which 0 ms to minimize.
[2023-03-20 08:56:01] [INFO ] Deduced a trap composed of 15 places in 104 ms of which 0 ms to minimize.
[2023-03-20 08:56:01] [INFO ] Deduced a trap composed of 21 places in 115 ms of which 1 ms to minimize.
[2023-03-20 08:56:01] [INFO ] Deduced a trap composed of 21 places in 110 ms of which 0 ms to minimize.
[2023-03-20 08:56:01] [INFO ] Deduced a trap composed of 23 places in 113 ms of which 1 ms to minimize.
[2023-03-20 08:56:02] [INFO ] Deduced a trap composed of 21 places in 109 ms of which 0 ms to minimize.
[2023-03-20 08:56:02] [INFO ] Deduced a trap composed of 19 places in 116 ms of which 1 ms to minimize.
[2023-03-20 08:56:02] [INFO ] Deduced a trap composed of 19 places in 110 ms of which 1 ms to minimize.
[2023-03-20 08:56:02] [INFO ] Deduced a trap composed of 19 places in 113 ms of which 0 ms to minimize.
[2023-03-20 08:56:02] [INFO ] Deduced a trap composed of 25 places in 125 ms of which 0 ms to minimize.
[2023-03-20 08:56:02] [INFO ] Deduced a trap composed of 25 places in 125 ms of which 1 ms to minimize.
[2023-03-20 08:56:03] [INFO ] Deduced a trap composed of 27 places in 139 ms of which 0 ms to minimize.
[2023-03-20 08:56:03] [INFO ] Deduced a trap composed of 25 places in 106 ms of which 1 ms to minimize.
[2023-03-20 08:56:03] [INFO ] Deduced a trap composed of 27 places in 119 ms of which 0 ms to minimize.
[2023-03-20 08:56:03] [INFO ] Deduced a trap composed of 23 places in 120 ms of which 0 ms to minimize.
[2023-03-20 08:56:03] [INFO ] Deduced a trap composed of 23 places in 113 ms of which 1 ms to minimize.
[2023-03-20 08:56:04] [INFO ] Deduced a trap composed of 23 places in 112 ms of which 0 ms to minimize.
[2023-03-20 08:56:04] [INFO ] Deduced a trap composed of 23 places in 133 ms of which 0 ms to minimize.
[2023-03-20 08:56:04] [INFO ] Deduced a trap composed of 27 places in 124 ms of which 0 ms to minimize.
[2023-03-20 08:56:04] [INFO ] Deduced a trap composed of 25 places in 137 ms of which 0 ms to minimize.
[2023-03-20 08:56:04] [INFO ] Deduced a trap composed of 27 places in 116 ms of which 0 ms to minimize.
[2023-03-20 08:56:04] [INFO ] Deduced a trap composed of 25 places in 118 ms of which 1 ms to minimize.
[2023-03-20 08:56:05] [INFO ] Deduced a trap composed of 27 places in 98 ms of which 1 ms to minimize.
[2023-03-20 08:56:05] [INFO ] Deduced a trap composed of 23 places in 96 ms of which 0 ms to minimize.
[2023-03-20 08:56:05] [INFO ] Deduced a trap composed of 23 places in 110 ms of which 1 ms to minimize.
[2023-03-20 08:56:05] [INFO ] Deduced a trap composed of 29 places in 125 ms of which 1 ms to minimize.
[2023-03-20 08:56:05] [INFO ] Deduced a trap composed of 27 places in 142 ms of which 0 ms to minimize.
[2023-03-20 08:56:06] [INFO ] Deduced a trap composed of 39 places in 133 ms of which 1 ms to minimize.
[2023-03-20 08:56:06] [INFO ] Deduced a trap composed of 41 places in 113 ms of which 0 ms to minimize.
[2023-03-20 08:56:06] [INFO ] Deduced a trap composed of 43 places in 109 ms of which 1 ms to minimize.
[2023-03-20 08:56:06] [INFO ] Deduced a trap composed of 41 places in 112 ms of which 1 ms to minimize.
[2023-03-20 08:56:06] [INFO ] Deduced a trap composed of 41 places in 120 ms of which 0 ms to minimize.
[2023-03-20 08:56:06] [INFO ] Deduced a trap composed of 41 places in 116 ms of which 1 ms to minimize.
[2023-03-20 08:56:06] [INFO ] Deduced a trap composed of 37 places in 115 ms of which 0 ms to minimize.
[2023-03-20 08:56:07] [INFO ] Deduced a trap composed of 41 places in 126 ms of which 0 ms to minimize.
[2023-03-20 08:56:07] [INFO ] Deduced a trap composed of 36 places in 131 ms of which 0 ms to minimize.
[2023-03-20 08:56:07] [INFO ] Deduced a trap composed of 39 places in 126 ms of which 0 ms to minimize.
[2023-03-20 08:56:07] [INFO ] Deduced a trap composed of 39 places in 115 ms of which 0 ms to minimize.
[2023-03-20 08:56:07] [INFO ] Deduced a trap composed of 39 places in 114 ms of which 1 ms to minimize.
[2023-03-20 08:56:07] [INFO ] Deduced a trap composed of 35 places in 135 ms of which 1 ms to minimize.
[2023-03-20 08:56:08] [INFO ] Deduced a trap composed of 43 places in 129 ms of which 1 ms to minimize.
[2023-03-20 08:56:08] [INFO ] Deduced a trap composed of 39 places in 129 ms of which 0 ms to minimize.
[2023-03-20 08:56:08] [INFO ] Deduced a trap composed of 39 places in 125 ms of which 0 ms to minimize.
[2023-03-20 08:56:08] [INFO ] Deduced a trap composed of 39 places in 128 ms of which 0 ms to minimize.
[2023-03-20 08:56:08] [INFO ] Deduced a trap composed of 43 places in 110 ms of which 0 ms to minimize.
[2023-03-20 08:56:09] [INFO ] Deduced a trap composed of 35 places in 138 ms of which 0 ms to minimize.
[2023-03-20 08:56:09] [INFO ] Deduced a trap composed of 35 places in 121 ms of which 0 ms to minimize.
[2023-03-20 08:56:09] [INFO ] Deduced a trap composed of 39 places in 116 ms of which 0 ms to minimize.
[2023-03-20 08:56:09] [INFO ] Deduced a trap composed of 39 places in 115 ms of which 0 ms to minimize.
[2023-03-20 08:56:09] [INFO ] Deduced a trap composed of 39 places in 97 ms of which 0 ms to minimize.
[2023-03-20 08:56:09] [INFO ] Deduced a trap composed of 39 places in 99 ms of which 0 ms to minimize.
[2023-03-20 08:56:10] [INFO ] Deduced a trap composed of 27 places in 96 ms of which 1 ms to minimize.
[2023-03-20 08:56:10] [INFO ] Deduced a trap composed of 40 places in 95 ms of which 0 ms to minimize.
[2023-03-20 08:56:10] [INFO ] Deduced a trap composed of 39 places in 116 ms of which 1 ms to minimize.
[2023-03-20 08:56:10] [INFO ] Deduced a trap composed of 39 places in 119 ms of which 0 ms to minimize.
[2023-03-20 08:56:10] [INFO ] Deduced a trap composed of 39 places in 113 ms of which 1 ms to minimize.
[2023-03-20 08:56:10] [INFO ] Deduced a trap composed of 41 places in 133 ms of which 0 ms to minimize.
[2023-03-20 08:56:11] [INFO ] Deduced a trap composed of 43 places in 118 ms of which 0 ms to minimize.
[2023-03-20 08:56:11] [INFO ] Deduced a trap composed of 35 places in 107 ms of which 1 ms to minimize.
[2023-03-20 08:56:11] [INFO ] Deduced a trap composed of 35 places in 122 ms of which 1 ms to minimize.
[2023-03-20 08:56:11] [INFO ] Deduced a trap composed of 40 places in 126 ms of which 1 ms to minimize.
[2023-03-20 08:56:11] [INFO ] Deduced a trap composed of 39 places in 95 ms of which 0 ms to minimize.
[2023-03-20 08:56:11] [INFO ] Deduced a trap composed of 40 places in 100 ms of which 1 ms to minimize.
[2023-03-20 08:56:11] [INFO ] Deduced a trap composed of 35 places in 109 ms of which 0 ms to minimize.
[2023-03-20 08:56:12] [INFO ] Deduced a trap composed of 39 places in 98 ms of which 1 ms to minimize.
[2023-03-20 08:56:12] [INFO ] Deduced a trap composed of 39 places in 98 ms of which 0 ms to minimize.
[2023-03-20 08:56:12] [INFO ] Deduced a trap composed of 39 places in 122 ms of which 0 ms to minimize.
[2023-03-20 08:56:12] [INFO ] Deduced a trap composed of 15 places in 120 ms of which 1 ms to minimize.
[2023-03-20 08:56:12] [INFO ] Deduced a trap composed of 49 places in 137 ms of which 1 ms to minimize.
[2023-03-20 08:56:13] [INFO ] Deduced a trap composed of 49 places in 117 ms of which 0 ms to minimize.
[2023-03-20 08:56:13] [INFO ] Deduced a trap composed of 47 places in 108 ms of which 1 ms to minimize.
[2023-03-20 08:56:13] [INFO ] Deduced a trap composed of 51 places in 105 ms of which 1 ms to minimize.
[2023-03-20 08:56:13] [INFO ] Deduced a trap composed of 51 places in 130 ms of which 1 ms to minimize.
[2023-03-20 08:56:13] [INFO ] Deduced a trap composed of 49 places in 107 ms of which 1 ms to minimize.
[2023-03-20 08:56:13] [INFO ] Deduced a trap composed of 49 places in 148 ms of which 1 ms to minimize.
[2023-03-20 08:56:14] [INFO ] Deduced a trap composed of 47 places in 169 ms of which 1 ms to minimize.
[2023-03-20 08:56:14] [INFO ] Deduced a trap composed of 47 places in 127 ms of which 0 ms to minimize.
[2023-03-20 08:56:14] [INFO ] Deduced a trap composed of 47 places in 137 ms of which 1 ms to minimize.
[2023-03-20 08:56:14] [INFO ] Deduced a trap composed of 49 places in 144 ms of which 1 ms to minimize.
[2023-03-20 08:56:15] [INFO ] Deduced a trap composed of 47 places in 145 ms of which 1 ms to minimize.
[2023-03-20 08:56:15] [INFO ] Deduced a trap composed of 47 places in 128 ms of which 1 ms to minimize.
[2023-03-20 08:56:15] [INFO ] Deduced a trap composed of 47 places in 164 ms of which 1 ms to minimize.
[2023-03-20 08:56:15] [INFO ] Deduced a trap composed of 7 places in 168 ms of which 0 ms to minimize.
[2023-03-20 08:56:15] [INFO ] Deduced a trap composed of 21 places in 155 ms of which 1 ms to minimize.
[2023-03-20 08:56:16] [INFO ] Deduced a trap composed of 21 places in 167 ms of which 1 ms to minimize.
[2023-03-20 08:56:16] [INFO ] Deduced a trap composed of 54 places in 143 ms of which 1 ms to minimize.
[2023-03-20 08:56:16] [INFO ] Deduced a trap composed of 20 places in 148 ms of which 1 ms to minimize.
[2023-03-20 08:56:16] [INFO ] Deduced a trap composed of 56 places in 157 ms of which 0 ms to minimize.
[2023-03-20 08:56:16] [INFO ] Deduced a trap composed of 54 places in 129 ms of which 0 ms to minimize.
[2023-03-20 08:56:17] [INFO ] Deduced a trap composed of 54 places in 151 ms of which 0 ms to minimize.
[2023-03-20 08:56:17] [INFO ] Deduced a trap composed of 54 places in 139 ms of which 1 ms to minimize.
[2023-03-20 08:56:17] [INFO ] Deduced a trap composed of 54 places in 130 ms of which 1 ms to minimize.
[2023-03-20 08:56:17] [INFO ] Deduced a trap composed of 54 places in 125 ms of which 1 ms to minimize.
[2023-03-20 08:56:18] [INFO ] Deduced a trap composed of 54 places in 181 ms of which 1 ms to minimize.
[2023-03-20 08:56:18] [INFO ] Deduced a trap composed of 52 places in 160 ms of which 1 ms to minimize.
[2023-03-20 08:56:18] [INFO ] Deduced a trap composed of 56 places in 173 ms of which 1 ms to minimize.
[2023-03-20 08:56:18] [INFO ] Deduced a trap composed of 54 places in 135 ms of which 1 ms to minimize.
[2023-03-20 08:56:19] [INFO ] Deduced a trap composed of 52 places in 168 ms of which 0 ms to minimize.
[2023-03-20 08:56:19] [INFO ] Deduced a trap composed of 59 places in 167 ms of which 1 ms to minimize.
[2023-03-20 08:56:19] [INFO ] Deduced a trap composed of 56 places in 162 ms of which 0 ms to minimize.
[2023-03-20 08:56:19] [INFO ] Deduced a trap composed of 54 places in 178 ms of which 1 ms to minimize.
[2023-03-20 08:56:19] [INFO ] Deduced a trap composed of 52 places in 162 ms of which 0 ms to minimize.
[2023-03-20 08:56:20] [INFO ] Deduced a trap composed of 52 places in 160 ms of which 1 ms to minimize.
[2023-03-20 08:56:20] [INFO ] Deduced a trap composed of 52 places in 130 ms of which 0 ms to minimize.
[2023-03-20 08:56:20] [INFO ] Deduced a trap composed of 52 places in 140 ms of which 1 ms to minimize.
[2023-03-20 08:56:20] [INFO ] Deduced a trap composed of 52 places in 144 ms of which 0 ms to minimize.
[2023-03-20 08:56:21] [INFO ] Deduced a trap composed of 54 places in 131 ms of which 1 ms to minimize.
[2023-03-20 08:56:21] [INFO ] Deduced a trap composed of 52 places in 137 ms of which 1 ms to minimize.
[2023-03-20 08:56:21] [INFO ] Deduced a trap composed of 56 places in 155 ms of which 0 ms to minimize.
[2023-03-20 08:56:21] [INFO ] Deduced a trap composed of 54 places in 122 ms of which 0 ms to minimize.
[2023-03-20 08:56:21] [INFO ] Deduced a trap composed of 52 places in 139 ms of which 1 ms to minimize.
[2023-03-20 08:56:22] [INFO ] Deduced a trap composed of 52 places in 148 ms of which 1 ms to minimize.
[2023-03-20 08:56:22] [INFO ] Deduced a trap composed of 52 places in 145 ms of which 0 ms to minimize.
[2023-03-20 08:56:22] [INFO ] Deduced a trap composed of 52 places in 156 ms of which 1 ms to minimize.
[2023-03-20 08:56:22] [INFO ] Deduced a trap composed of 52 places in 118 ms of which 1 ms to minimize.
[2023-03-20 08:56:23] [INFO ] Deduced a trap composed of 56 places in 125 ms of which 1 ms to minimize.
[2023-03-20 08:56:23] [INFO ] Deduced a trap composed of 56 places in 173 ms of which 1 ms to minimize.
[2023-03-20 08:56:23] [INFO ] Deduced a trap composed of 56 places in 139 ms of which 1 ms to minimize.
[2023-03-20 08:56:23] [INFO ] Deduced a trap composed of 54 places in 162 ms of which 0 ms to minimize.
[2023-03-20 08:56:23] [INFO ] Deduced a trap composed of 54 places in 136 ms of which 0 ms to minimize.
[2023-03-20 08:56:24] [INFO ] Deduced a trap composed of 54 places in 147 ms of which 0 ms to minimize.
[2023-03-20 08:56:24] [INFO ] Deduced a trap composed of 54 places in 146 ms of which 1 ms to minimize.
[2023-03-20 08:56:24] [INFO ] Deduced a trap composed of 52 places in 171 ms of which 1 ms to minimize.
[2023-03-20 08:56:24] [INFO ] Deduced a trap composed of 52 places in 126 ms of which 0 ms to minimize.
[2023-03-20 08:56:24] [INFO ] Deduced a trap composed of 57 places in 120 ms of which 0 ms to minimize.
[2023-03-20 08:56:25] [INFO ] Deduced a trap composed of 23 places in 153 ms of which 1 ms to minimize.
[2023-03-20 08:56:25] [INFO ] Deduced a trap composed of 55 places in 108 ms of which 0 ms to minimize.
[2023-03-20 08:56:25] [INFO ] Deduced a trap composed of 59 places in 125 ms of which 1 ms to minimize.
[2023-03-20 08:56:25] [INFO ] Deduced a trap composed of 57 places in 156 ms of which 0 ms to minimize.
[2023-03-20 08:56:26] [INFO ] Deduced a trap composed of 57 places in 135 ms of which 1 ms to minimize.
[2023-03-20 08:56:26] [INFO ] Deduced a trap composed of 59 places in 126 ms of which 0 ms to minimize.
[2023-03-20 08:56:26] [INFO ] Deduced a trap composed of 57 places in 113 ms of which 1 ms to minimize.
[2023-03-20 08:56:26] [INFO ] Deduced a trap composed of 57 places in 104 ms of which 0 ms to minimize.
[2023-03-20 08:56:26] [INFO ] Deduced a trap composed of 57 places in 99 ms of which 1 ms to minimize.
[2023-03-20 08:56:26] [INFO ] Deduced a trap composed of 7 places in 97 ms of which 0 ms to minimize.
[2023-03-20 08:56:27] [INFO ] Deduced a trap composed of 57 places in 150 ms of which 0 ms to minimize.
[2023-03-20 08:56:27] [INFO ] Deduced a trap composed of 57 places in 132 ms of which 0 ms to minimize.
[2023-03-20 08:56:27] [INFO ] Deduced a trap composed of 57 places in 109 ms of which 1 ms to minimize.
[2023-03-20 08:56:27] [INFO ] Deduced a trap composed of 11 places in 172 ms of which 1 ms to minimize.
[2023-03-20 08:56:28] [INFO ] Deduced a trap composed of 15 places in 195 ms of which 0 ms to minimize.
[2023-03-20 08:56:28] [INFO ] Deduced a trap composed of 11 places in 191 ms of which 0 ms to minimize.
[2023-03-20 08:56:28] [INFO ] Deduced a trap composed of 13 places in 189 ms of which 0 ms to minimize.
[2023-03-20 08:56:28] [INFO ] Deduced a trap composed of 31 places in 184 ms of which 0 ms to minimize.
[2023-03-20 08:56:29] [INFO ] Deduced a trap composed of 15 places in 159 ms of which 0 ms to minimize.
[2023-03-20 08:56:29] [INFO ] Deduced a trap composed of 31 places in 159 ms of which 0 ms to minimize.
[2023-03-20 08:56:29] [INFO ] Deduced a trap composed of 45 places in 176 ms of which 1 ms to minimize.
[2023-03-20 08:56:29] [INFO ] Deduced a trap composed of 43 places in 143 ms of which 0 ms to minimize.
[2023-03-20 08:56:30] [INFO ] Deduced a trap composed of 15 places in 162 ms of which 0 ms to minimize.
[2023-03-20 08:56:30] [INFO ] Deduced a trap composed of 43 places in 149 ms of which 0 ms to minimize.
[2023-03-20 08:56:30] [INFO ] Deduced a trap composed of 43 places in 124 ms of which 1 ms to minimize.
[2023-03-20 08:56:30] [INFO ] Deduced a trap composed of 11 places in 147 ms of which 1 ms to minimize.
[2023-03-20 08:56:30] [INFO ] Deduced a trap composed of 19 places in 165 ms of which 1 ms to minimize.
[2023-03-20 08:56:31] [INFO ] Deduced a trap composed of 47 places in 167 ms of which 0 ms to minimize.
[2023-03-20 08:56:31] [INFO ] Deduced a trap composed of 19 places in 182 ms of which 1 ms to minimize.
[2023-03-20 08:56:31] [INFO ] Deduced a trap composed of 19 places in 162 ms of which 1 ms to minimize.
[2023-03-20 08:56:31] [INFO ] Deduced a trap composed of 15 places in 153 ms of which 0 ms to minimize.
[2023-03-20 08:56:31] [INFO ] Deduced a trap composed of 11 places in 134 ms of which 1 ms to minimize.
[2023-03-20 08:56:32] [INFO ] Deduced a trap composed of 43 places in 138 ms of which 0 ms to minimize.
[2023-03-20 08:56:32] [INFO ] Deduced a trap composed of 39 places in 139 ms of which 0 ms to minimize.
[2023-03-20 08:56:32] [INFO ] Deduced a trap composed of 39 places in 142 ms of which 0 ms to minimize.
[2023-03-20 08:56:32] [INFO ] Deduced a trap composed of 59 places in 141 ms of which 1 ms to minimize.
[2023-03-20 08:56:33] [INFO ] Deduced a trap composed of 20 places in 170 ms of which 0 ms to minimize.
[2023-03-20 08:56:33] [INFO ] Deduced a trap composed of 23 places in 128 ms of which 0 ms to minimize.
[2023-03-20 08:56:33] [INFO ] Deduced a trap composed of 39 places in 173 ms of which 0 ms to minimize.
[2023-03-20 08:56:33] [INFO ] Deduced a trap composed of 51 places in 129 ms of which 1 ms to minimize.
[2023-03-20 08:56:33] [INFO ] Deduced a trap composed of 39 places in 139 ms of which 0 ms to minimize.
[2023-03-20 08:56:33] [INFO ] Deduced a trap composed of 20 places in 126 ms of which 1 ms to minimize.
[2023-03-20 08:56:34] [INFO ] Deduced a trap composed of 53 places in 127 ms of which 0 ms to minimize.
[2023-03-20 08:56:34] [INFO ] Deduced a trap composed of 55 places in 128 ms of which 1 ms to minimize.
[2023-03-20 08:56:34] [INFO ] Deduced a trap composed of 55 places in 127 ms of which 0 ms to minimize.
[2023-03-20 08:56:34] [INFO ] Deduced a trap composed of 55 places in 147 ms of which 0 ms to minimize.
[2023-03-20 08:56:34] [INFO ] Deduced a trap composed of 19 places in 129 ms of which 1 ms to minimize.
[2023-03-20 08:56:35] [INFO ] Deduced a trap composed of 15 places in 129 ms of which 0 ms to minimize.
[2023-03-20 08:56:35] [INFO ] Deduced a trap composed of 15 places in 127 ms of which 0 ms to minimize.
[2023-03-20 08:56:35] [INFO ] Deduced a trap composed of 55 places in 122 ms of which 0 ms to minimize.
[2023-03-20 08:56:35] [INFO ] Deduced a trap composed of 55 places in 136 ms of which 0 ms to minimize.
[2023-03-20 08:56:35] [INFO ] Deduced a trap composed of 55 places in 126 ms of which 0 ms to minimize.
[2023-03-20 08:56:36] [INFO ] Deduced a trap composed of 59 places in 153 ms of which 0 ms to minimize.
[2023-03-20 08:56:36] [INFO ] Deduced a trap composed of 55 places in 116 ms of which 0 ms to minimize.
[2023-03-20 08:56:36] [INFO ] Deduced a trap composed of 51 places in 139 ms of which 1 ms to minimize.
[2023-03-20 08:56:36] [INFO ] Deduced a trap composed of 57 places in 115 ms of which 1 ms to minimize.
[2023-03-20 08:56:36] [INFO ] Deduced a trap composed of 55 places in 125 ms of which 0 ms to minimize.
[2023-03-20 08:56:36] [INFO ] Deduced a trap composed of 51 places in 115 ms of which 0 ms to minimize.
[2023-03-20 08:56:37] [INFO ] Deduced a trap composed of 51 places in 143 ms of which 0 ms to minimize.
[2023-03-20 08:56:37] [INFO ] Deduced a trap composed of 55 places in 112 ms of which 1 ms to minimize.
[2023-03-20 08:56:37] [INFO ] Deduced a trap composed of 53 places in 130 ms of which 1 ms to minimize.
[2023-03-20 08:56:37] [INFO ] Deduced a trap composed of 55 places in 143 ms of which 0 ms to minimize.
[2023-03-20 08:56:37] [INFO ] Deduced a trap composed of 47 places in 119 ms of which 0 ms to minimize.
[2023-03-20 08:56:37] [INFO ] Deduced a trap composed of 47 places in 125 ms of which 0 ms to minimize.
[2023-03-20 08:56:38] [INFO ] Deduced a trap composed of 57 places in 175 ms of which 1 ms to minimize.
[2023-03-20 08:56:38] [INFO ] Deduced a trap composed of 47 places in 140 ms of which 0 ms to minimize.
[2023-03-20 08:56:38] [INFO ] Deduced a trap composed of 45 places in 112 ms of which 0 ms to minimize.
[2023-03-20 08:56:38] [INFO ] Deduced a trap composed of 13 places in 107 ms of which 1 ms to minimize.
[2023-03-20 08:56:38] [INFO ] Deduced a trap composed of 13 places in 121 ms of which 1 ms to minimize.
[2023-03-20 08:56:39] [INFO ] Deduced a trap composed of 11 places in 119 ms of which 0 ms to minimize.
[2023-03-20 08:56:39] [INFO ] Deduced a trap composed of 45 places in 118 ms of which 0 ms to minimize.
[2023-03-20 08:56:39] [INFO ] Deduced a trap composed of 33 places in 108 ms of which 0 ms to minimize.
[2023-03-20 08:56:39] [INFO ] Deduced a trap composed of 47 places in 142 ms of which 1 ms to minimize.
[2023-03-20 08:56:39] [INFO ] Deduced a trap composed of 31 places in 129 ms of which 0 ms to minimize.
[2023-03-20 08:56:40] [INFO ] Deduced a trap composed of 45 places in 160 ms of which 1 ms to minimize.
[2023-03-20 08:56:40] [INFO ] Deduced a trap composed of 39 places in 133 ms of which 1 ms to minimize.
[2023-03-20 08:56:40] [INFO ] Deduced a trap composed of 55 places in 163 ms of which 1 ms to minimize.
[2023-03-20 08:56:40] [INFO ] Deduced a trap composed of 39 places in 139 ms of which 1 ms to minimize.
[2023-03-20 08:56:40] [INFO ] Deduced a trap composed of 39 places in 157 ms of which 1 ms to minimize.
[2023-03-20 08:56:41] [INFO ] Deduced a trap composed of 55 places in 152 ms of which 1 ms to minimize.
[2023-03-20 08:56:41] [INFO ] Deduced a trap composed of 55 places in 135 ms of which 1 ms to minimize.
[2023-03-20 08:56:41] [INFO ] Deduced a trap composed of 55 places in 144 ms of which 0 ms to minimize.
[2023-03-20 08:56:41] [INFO ] Deduced a trap composed of 55 places in 190 ms of which 0 ms to minimize.
[2023-03-20 08:56:41] [INFO ] Deduced a trap composed of 39 places in 150 ms of which 0 ms to minimize.
[2023-03-20 08:56:42] [INFO ] Deduced a trap composed of 39 places in 140 ms of which 0 ms to minimize.
[2023-03-20 08:56:42] [INFO ] Deduced a trap composed of 39 places in 143 ms of which 1 ms to minimize.
[2023-03-20 08:56:42] [INFO ] Deduced a trap composed of 55 places in 141 ms of which 1 ms to minimize.
[2023-03-20 08:56:42] [INFO ] Deduced a trap composed of 55 places in 143 ms of which 1 ms to minimize.
[2023-03-20 08:56:43] [INFO ] Deduced a trap composed of 55 places in 115 ms of which 0 ms to minimize.
[2023-03-20 08:56:43] [INFO ] Deduced a trap composed of 55 places in 145 ms of which 0 ms to minimize.
[2023-03-20 08:56:43] [INFO ] Deduced a trap composed of 55 places in 156 ms of which 0 ms to minimize.
[2023-03-20 08:56:43] [INFO ] Deduced a trap composed of 47 places in 172 ms of which 1 ms to minimize.
[2023-03-20 08:56:43] [INFO ] Deduced a trap composed of 55 places in 157 ms of which 0 ms to minimize.
[2023-03-20 08:56:44] [INFO ] Deduced a trap composed of 47 places in 165 ms of which 0 ms to minimize.
[2023-03-20 08:56:44] [INFO ] Deduced a trap composed of 55 places in 159 ms of which 0 ms to minimize.
[2023-03-20 08:56:44] [INFO ] Deduced a trap composed of 45 places in 176 ms of which 1 ms to minimize.
[2023-03-20 08:56:44] [INFO ] Deduced a trap composed of 45 places in 172 ms of which 0 ms to minimize.
[2023-03-20 08:56:45] [INFO ] Deduced a trap composed of 45 places in 157 ms of which 1 ms to minimize.
[2023-03-20 08:56:45] [INFO ] Deduced a trap composed of 45 places in 155 ms of which 0 ms to minimize.
[2023-03-20 08:56:45] [INFO ] Deduced a trap composed of 61 places in 173 ms of which 0 ms to minimize.
[2023-03-20 08:56:45] [INFO ] Deduced a trap composed of 11 places in 164 ms of which 1 ms to minimize.
[2023-03-20 08:56:45] [INFO ] Deduced a trap composed of 61 places in 118 ms of which 0 ms to minimize.
[2023-03-20 08:56:46] [INFO ] Deduced a trap composed of 55 places in 124 ms of which 0 ms to minimize.
[2023-03-20 08:56:46] [INFO ] Deduced a trap composed of 55 places in 115 ms of which 1 ms to minimize.
[2023-03-20 08:56:46] [INFO ] Deduced a trap composed of 61 places in 132 ms of which 1 ms to minimize.
[2023-03-20 08:56:46] [INFO ] Deduced a trap composed of 61 places in 123 ms of which 0 ms to minimize.
[2023-03-20 08:56:46] [INFO ] Deduced a trap composed of 55 places in 109 ms of which 1 ms to minimize.
[2023-03-20 08:56:47] [INFO ] Deduced a trap composed of 53 places in 117 ms of which 0 ms to minimize.
[2023-03-20 08:56:47] [INFO ] Deduced a trap composed of 15 places in 116 ms of which 0 ms to minimize.
[2023-03-20 08:56:47] [INFO ] Deduced a trap composed of 20 places in 151 ms of which 1 ms to minimize.
[2023-03-20 08:56:47] [INFO ] Deduced a trap composed of 24 places in 118 ms of which 0 ms to minimize.
[2023-03-20 08:56:47] [INFO ] Deduced a trap composed of 43 places in 121 ms of which 0 ms to minimize.
[2023-03-20 08:56:48] [INFO ] Deduced a trap composed of 59 places in 167 ms of which 0 ms to minimize.
[2023-03-20 08:56:48] [INFO ] Deduced a trap composed of 59 places in 492 ms of which 27 ms to minimize.
[2023-03-20 08:56:49] [INFO ] Deduced a trap composed of 59 places in 208 ms of which 1 ms to minimize.
[2023-03-20 08:56:49] [INFO ] Deduced a trap composed of 43 places in 207 ms of which 0 ms to minimize.
[2023-03-20 08:56:49] [INFO ] Deduced a trap composed of 57 places in 146 ms of which 1 ms to minimize.
[2023-03-20 08:56:49] [INFO ] Deduced a trap composed of 59 places in 174 ms of which 1 ms to minimize.
[2023-03-20 08:56:49] [INFO ] Deduced a trap composed of 59 places in 186 ms of which 0 ms to minimize.
[2023-03-20 08:56:50] [INFO ] Deduced a trap composed of 57 places in 163 ms of which 1 ms to minimize.
[2023-03-20 08:56:50] [INFO ] Deduced a trap composed of 59 places in 173 ms of which 1 ms to minimize.
[2023-03-20 08:56:50] [INFO ] Deduced a trap composed of 59 places in 174 ms of which 1 ms to minimize.
[2023-03-20 08:56:50] [INFO ] Deduced a trap composed of 43 places in 145 ms of which 0 ms to minimize.
[2023-03-20 08:56:51] [INFO ] Deduced a trap composed of 59 places in 176 ms of which 0 ms to minimize.
[2023-03-20 08:56:51] [INFO ] Deduced a trap composed of 59 places in 184 ms of which 0 ms to minimize.
[2023-03-20 08:56:51] [INFO ] Deduced a trap composed of 59 places in 141 ms of which 0 ms to minimize.
[2023-03-20 08:56:51] [INFO ] Deduced a trap composed of 43 places in 130 ms of which 0 ms to minimize.
[2023-03-20 08:56:51] [INFO ] Deduced a trap composed of 59 places in 144 ms of which 0 ms to minimize.
[2023-03-20 08:56:52] [INFO ] Deduced a trap composed of 59 places in 138 ms of which 0 ms to minimize.
[2023-03-20 08:56:52] [INFO ] Deduced a trap composed of 59 places in 122 ms of which 1 ms to minimize.
[2023-03-20 08:56:52] [INFO ] Deduced a trap composed of 43 places in 121 ms of which 0 ms to minimize.
[2023-03-20 08:56:52] [INFO ] Deduced a trap composed of 43 places in 161 ms of which 0 ms to minimize.
[2023-03-20 08:56:52] [INFO ] Deduced a trap composed of 59 places in 120 ms of which 0 ms to minimize.
[2023-03-20 08:56:52] [INFO ] Deduced a trap composed of 59 places in 120 ms of which 1 ms to minimize.
[2023-03-20 08:56:53] [INFO ] Deduced a trap composed of 55 places in 125 ms of which 0 ms to minimize.
[2023-03-20 08:56:53] [INFO ] Deduced a trap composed of 59 places in 144 ms of which 0 ms to minimize.
[2023-03-20 08:56:53] [INFO ] Deduced a trap composed of 59 places in 115 ms of which 0 ms to minimize.
[2023-03-20 08:56:53] [INFO ] Deduced a trap composed of 59 places in 115 ms of which 1 ms to minimize.
[2023-03-20 08:56:53] [INFO ] Deduced a trap composed of 43 places in 126 ms of which 0 ms to minimize.
[2023-03-20 08:56:54] [INFO ] Deduced a trap composed of 43 places in 121 ms of which 0 ms to minimize.
[2023-03-20 08:56:54] [INFO ] Deduced a trap composed of 59 places in 154 ms of which 0 ms to minimize.
[2023-03-20 08:56:54] [INFO ] Deduced a trap composed of 59 places in 125 ms of which 0 ms to minimize.
[2023-03-20 08:56:54] [INFO ] Deduced a trap composed of 59 places in 163 ms of which 0 ms to minimize.
[2023-03-20 08:56:55] [INFO ] Deduced a trap composed of 59 places in 163 ms of which 0 ms to minimize.
[2023-03-20 08:56:55] [INFO ] Deduced a trap composed of 59 places in 168 ms of which 0 ms to minimize.
[2023-03-20 08:56:55] [INFO ] Deduced a trap composed of 59 places in 181 ms of which 1 ms to minimize.
[2023-03-20 08:56:55] [INFO ] Deduced a trap composed of 55 places in 131 ms of which 1 ms to minimize.
[2023-03-20 08:56:55] [INFO ] Deduced a trap composed of 59 places in 148 ms of which 1 ms to minimize.
[2023-03-20 08:56:56] [INFO ] Deduced a trap composed of 43 places in 173 ms of which 0 ms to minimize.
[2023-03-20 08:56:56] [INFO ] Deduced a trap composed of 43 places in 144 ms of which 0 ms to minimize.
[2023-03-20 08:56:56] [INFO ] Deduced a trap composed of 59 places in 127 ms of which 1 ms to minimize.
[2023-03-20 08:56:56] [INFO ] Deduced a trap composed of 59 places in 132 ms of which 0 ms to minimize.
[2023-03-20 08:56:56] [INFO ] Deduced a trap composed of 59 places in 125 ms of which 1 ms to minimize.
[2023-03-20 08:56:57] [INFO ] Deduced a trap composed of 59 places in 101 ms of which 0 ms to minimize.
[2023-03-20 08:56:57] [INFO ] Deduced a trap composed of 59 places in 114 ms of which 0 ms to minimize.
[2023-03-20 08:56:57] [INFO ] Deduced a trap composed of 43 places in 171 ms of which 1 ms to minimize.
[2023-03-20 08:56:57] [INFO ] Deduced a trap composed of 43 places in 187 ms of which 0 ms to minimize.
[2023-03-20 08:56:58] [INFO ] Deduced a trap composed of 59 places in 166 ms of which 1 ms to minimize.
[2023-03-20 08:56:58] [INFO ] Deduced a trap composed of 59 places in 165 ms of which 1 ms to minimize.
[2023-03-20 08:56:58] [INFO ] Deduced a trap composed of 59 places in 132 ms of which 1 ms to minimize.
[2023-03-20 08:56:58] [INFO ] Deduced a trap composed of 59 places in 152 ms of which 1 ms to minimize.
[2023-03-20 08:56:58] [INFO ] Deduced a trap composed of 59 places in 163 ms of which 1 ms to minimize.
[2023-03-20 08:56:59] [INFO ] Deduced a trap composed of 19 places in 191 ms of which 0 ms to minimize.
[2023-03-20 08:56:59] [INFO ] Deduced a trap composed of 7 places in 174 ms of which 1 ms to minimize.
[2023-03-20 08:56:59] [INFO ] Deduced a trap composed of 24 places in 148 ms of which 0 ms to minimize.
[2023-03-20 08:56:59] [INFO ] Deduced a trap composed of 43 places in 155 ms of which 0 ms to minimize.
[2023-03-20 08:57:00] [INFO ] Deduced a trap composed of 59 places in 146 ms of which 0 ms to minimize.
[2023-03-20 08:57:00] [INFO ] Deduced a trap composed of 59 places in 144 ms of which 1 ms to minimize.
[2023-03-20 08:57:00] [INFO ] Deduced a trap composed of 59 places in 135 ms of which 1 ms to minimize.
[2023-03-20 08:57:00] [INFO ] Deduced a trap composed of 43 places in 193 ms of which 1 ms to minimize.
[2023-03-20 08:57:00] [INFO ] Deduced a trap composed of 59 places in 189 ms of which 0 ms to minimize.
[2023-03-20 08:57:01] [INFO ] Deduced a trap composed of 59 places in 177 ms of which 0 ms to minimize.
[2023-03-20 08:57:01] [INFO ] Deduced a trap composed of 59 places in 144 ms of which 0 ms to minimize.
[2023-03-20 08:57:01] [INFO ] Deduced a trap composed of 43 places in 161 ms of which 0 ms to minimize.
[2023-03-20 08:57:01] [INFO ] Deduced a trap composed of 57 places in 141 ms of which 0 ms to minimize.
[2023-03-20 08:57:02] [INFO ] Deduced a trap composed of 59 places in 134 ms of which 0 ms to minimize.
[2023-03-20 08:57:02] [INFO ] Deduced a trap composed of 59 places in 132 ms of which 0 ms to minimize.
[2023-03-20 08:57:02] [INFO ] Deduced a trap composed of 43 places in 130 ms of which 1 ms to minimize.
[2023-03-20 08:57:02] [INFO ] Deduced a trap composed of 59 places in 138 ms of which 0 ms to minimize.
[2023-03-20 08:57:02] [INFO ] Deduced a trap composed of 59 places in 132 ms of which 1 ms to minimize.
[2023-03-20 08:57:02] [INFO ] Deduced a trap composed of 59 places in 117 ms of which 1 ms to minimize.
[2023-03-20 08:57:03] [INFO ] Deduced a trap composed of 43 places in 157 ms of which 0 ms to minimize.
[2023-03-20 08:57:03] [INFO ] Deduced a trap composed of 59 places in 166 ms of which 1 ms to minimize.
[2023-03-20 08:57:03] [INFO ] Deduced a trap composed of 57 places in 162 ms of which 0 ms to minimize.
[2023-03-20 08:57:03] [INFO ] Deduced a trap composed of 59 places in 170 ms of which 0 ms to minimize.
[2023-03-20 08:57:04] [INFO ] Deduced a trap composed of 43 places in 150 ms of which 0 ms to minimize.
[2023-03-20 08:57:04] [INFO ] Deduced a trap composed of 59 places in 148 ms of which 0 ms to minimize.
[2023-03-20 08:57:04] [INFO ] Deduced a trap composed of 59 places in 153 ms of which 1 ms to minimize.
[2023-03-20 08:57:04] [INFO ] Deduced a trap composed of 59 places in 178 ms of which 0 ms to minimize.
[2023-03-20 08:57:05] [INFO ] Deduced a trap composed of 43 places in 169 ms of which 0 ms to minimize.
[2023-03-20 08:57:05] [INFO ] Deduced a trap composed of 59 places in 155 ms of which 1 ms to minimize.
[2023-03-20 08:57:05] [INFO ] Deduced a trap composed of 59 places in 151 ms of which 1 ms to minimize.
[2023-03-20 08:57:05] [INFO ] Deduced a trap composed of 59 places in 154 ms of which 0 ms to minimize.
[2023-03-20 08:57:05] [INFO ] Deduced a trap composed of 43 places in 159 ms of which 0 ms to minimize.
[2023-03-20 08:57:06] [INFO ] Deduced a trap composed of 59 places in 163 ms of which 1 ms to minimize.
[2023-03-20 08:57:06] [INFO ] Deduced a trap composed of 59 places in 167 ms of which 0 ms to minimize.
[2023-03-20 08:57:06] [INFO ] Deduced a trap composed of 59 places in 131 ms of which 1 ms to minimize.
[2023-03-20 08:57:06] [INFO ] Deduced a trap composed of 59 places in 156 ms of which 1 ms to minimize.
[2023-03-20 08:57:06] [INFO ] Deduced a trap composed of 59 places in 156 ms of which 1 ms to minimize.
[2023-03-20 08:57:07] [INFO ] Deduced a trap composed of 23 places in 160 ms of which 1 ms to minimize.
[2023-03-20 08:57:07] [INFO ] Deduced a trap composed of 7 places in 166 ms of which 0 ms to minimize.
[2023-03-20 08:57:07] [INFO ] Deduced a trap composed of 43 places in 155 ms of which 1 ms to minimize.
[2023-03-20 08:57:07] [INFO ] Deduced a trap composed of 43 places in 182 ms of which 0 ms to minimize.
[2023-03-20 08:57:07] [INFO ] Deduced a trap composed of 59 places in 160 ms of which 0 ms to minimize.
[2023-03-20 08:57:08] [INFO ] Deduced a trap composed of 59 places in 145 ms of which 1 ms to minimize.
[2023-03-20 08:57:08] [INFO ] Deduced a trap composed of 59 places in 177 ms of which 0 ms to minimize.
[2023-03-20 08:57:08] [INFO ] Deduced a trap composed of 59 places in 139 ms of which 1 ms to minimize.
[2023-03-20 08:57:08] [INFO ] Deduced a trap composed of 59 places in 145 ms of which 1 ms to minimize.
[2023-03-20 08:57:09] [INFO ] Deduced a trap composed of 43 places in 150 ms of which 1 ms to minimize.
[2023-03-20 08:57:09] [INFO ] Deduced a trap composed of 43 places in 160 ms of which 1 ms to minimize.
[2023-03-20 08:57:09] [INFO ] Deduced a trap composed of 59 places in 174 ms of which 0 ms to minimize.
[2023-03-20 08:57:09] [INFO ] Deduced a trap composed of 59 places in 135 ms of which 0 ms to minimize.
[2023-03-20 08:57:09] [INFO ] Deduced a trap composed of 59 places in 157 ms of which 0 ms to minimize.
[2023-03-20 08:57:10] [INFO ] Deduced a trap composed of 59 places in 170 ms of which 0 ms to minimize.
[2023-03-20 08:57:10] [INFO ] Deduced a trap composed of 59 places in 139 ms of which 1 ms to minimize.
[2023-03-20 08:57:10] [INFO ] Deduced a trap composed of 23 places in 146 ms of which 1 ms to minimize.
[2023-03-20 08:57:10] [INFO ] Deduced a trap composed of 23 places in 131 ms of which 0 ms to minimize.
[2023-03-20 08:57:10] [INFO ] Deduced a trap composed of 43 places in 142 ms of which 0 ms to minimize.
[2023-03-20 08:57:11] [INFO ] Deduced a trap composed of 43 places in 123 ms of which 0 ms to minimize.
[2023-03-20 08:57:11] [INFO ] Deduced a trap composed of 59 places in 167 ms of which 0 ms to minimize.
[2023-03-20 08:57:11] [INFO ] Deduced a trap composed of 59 places in 169 ms of which 0 ms to minimize.
[2023-03-20 08:57:11] [INFO ] Deduced a trap composed of 59 places in 190 ms of which 0 ms to minimize.
[2023-03-20 08:57:11] [INFO ] Deduced a trap composed of 59 places in 123 ms of which 1 ms to minimize.
[2023-03-20 08:57:12] [INFO ] Deduced a trap composed of 59 places in 128 ms of which 0 ms to minimize.
[2023-03-20 08:57:12] [INFO ] Deduced a trap composed of 43 places in 136 ms of which 1 ms to minimize.
[2023-03-20 08:57:12] [INFO ] Deduced a trap composed of 43 places in 149 ms of which 0 ms to minimize.
[2023-03-20 08:57:12] [INFO ] Deduced a trap composed of 59 places in 148 ms of which 0 ms to minimize.
[2023-03-20 08:57:13] [INFO ] Deduced a trap composed of 59 places in 185 ms of which 1 ms to minimize.
[2023-03-20 08:57:13] [INFO ] Deduced a trap composed of 59 places in 167 ms of which 0 ms to minimize.
[2023-03-20 08:57:13] [INFO ] Deduced a trap composed of 59 places in 199 ms of which 1 ms to minimize.
[2023-03-20 08:57:13] [INFO ] Deduced a trap composed of 59 places in 148 ms of which 1 ms to minimize.
[2023-03-20 08:57:13] [INFO ] Deduced a trap composed of 59 places in 142 ms of which 0 ms to minimize.
[2023-03-20 08:57:14] [INFO ] Deduced a trap composed of 33 places in 172 ms of which 1 ms to minimize.
[2023-03-20 08:57:14] [INFO ] Deduced a trap composed of 43 places in 189 ms of which 0 ms to minimize.
[2023-03-20 08:57:14] [INFO ] Deduced a trap composed of 43 places in 160 ms of which 1 ms to minimize.
[2023-03-20 08:57:14] [INFO ] Deduced a trap composed of 45 places in 184 ms of which 0 ms to minimize.
[2023-03-20 08:57:15] [INFO ] Deduced a trap composed of 59 places in 165 ms of which 0 ms to minimize.
[2023-03-20 08:57:15] [INFO ] Deduced a trap composed of 59 places in 174 ms of which 1 ms to minimize.
[2023-03-20 08:57:15] [INFO ] Deduced a trap composed of 45 places in 174 ms of which 1 ms to minimize.
[2023-03-20 08:57:15] [INFO ] Deduced a trap composed of 61 places in 153 ms of which 5 ms to minimize.
[2023-03-20 08:57:16] [INFO ] Deduced a trap composed of 59 places in 156 ms of which 1 ms to minimize.
[2023-03-20 08:57:16] [INFO ] Deduced a trap composed of 45 places in 134 ms of which 0 ms to minimize.
[2023-03-20 08:57:16] [INFO ] Deduced a trap composed of 57 places in 144 ms of which 1 ms to minimize.
[2023-03-20 08:57:16] [INFO ] Deduced a trap composed of 59 places in 114 ms of which 0 ms to minimize.
[2023-03-20 08:57:16] [INFO ] Deduced a trap composed of 59 places in 134 ms of which 1 ms to minimize.
[2023-03-20 08:57:16] [INFO ] Deduced a trap composed of 47 places in 115 ms of which 0 ms to minimize.
[2023-03-20 08:57:17] [INFO ] Deduced a trap composed of 59 places in 154 ms of which 0 ms to minimize.
[2023-03-20 08:57:17] [INFO ] Deduced a trap composed of 31 places in 121 ms of which 1 ms to minimize.
[2023-03-20 08:57:17] [INFO ] Deduced a trap composed of 43 places in 136 ms of which 0 ms to minimize.
[2023-03-20 08:57:17] [INFO ] Deduced a trap composed of 43 places in 100 ms of which 0 ms to minimize.
[2023-03-20 08:57:17] [INFO ] Deduced a trap composed of 45 places in 100 ms of which 0 ms to minimize.
[2023-03-20 08:57:17] [INFO ] Deduced a trap composed of 59 places in 118 ms of which 0 ms to minimize.
[2023-03-20 08:57:18] [INFO ] Deduced a trap composed of 59 places in 105 ms of which 0 ms to minimize.
[2023-03-20 08:57:18] [INFO ] Deduced a trap composed of 59 places in 160 ms of which 0 ms to minimize.
[2023-03-20 08:57:18] [INFO ] Deduced a trap composed of 47 places in 132 ms of which 0 ms to minimize.
[2023-03-20 08:57:18] [INFO ] Deduced a trap composed of 59 places in 109 ms of which 0 ms to minimize.
[2023-03-20 08:57:18] [INFO ] Deduced a trap composed of 59 places in 147 ms of which 0 ms to minimize.
[2023-03-20 08:57:19] [INFO ] Deduced a trap composed of 47 places in 97 ms of which 0 ms to minimize.
[2023-03-20 08:57:19] [INFO ] Deduced a trap composed of 59 places in 116 ms of which 0 ms to minimize.
[2023-03-20 08:57:19] [INFO ] Deduced a trap composed of 43 places in 98 ms of which 0 ms to minimize.
[2023-03-20 08:57:19] [INFO ] Deduced a trap composed of 43 places in 100 ms of which 0 ms to minimize.
[2023-03-20 08:57:19] [INFO ] Deduced a trap composed of 57 places in 140 ms of which 0 ms to minimize.
[2023-03-20 08:57:19] [INFO ] Deduced a trap composed of 59 places in 115 ms of which 1 ms to minimize.
[2023-03-20 08:57:20] [INFO ] Deduced a trap composed of 59 places in 105 ms of which 0 ms to minimize.
[2023-03-20 08:57:20] [INFO ] Deduced a trap composed of 57 places in 100 ms of which 1 ms to minimize.
[2023-03-20 08:57:20] [INFO ] Deduced a trap composed of 59 places in 175 ms of which 0 ms to minimize.
[2023-03-20 08:57:20] [INFO ] Deduced a trap composed of 59 places in 135 ms of which 0 ms to minimize.
[2023-03-20 08:57:20] [INFO ] Deduced a trap composed of 59 places in 137 ms of which 1 ms to minimize.
[2023-03-20 08:57:20] [INFO ] Deduced a trap composed of 45 places in 125 ms of which 0 ms to minimize.
[2023-03-20 08:57:21] [INFO ] Deduced a trap composed of 59 places in 96 ms of which 0 ms to minimize.
[2023-03-20 08:57:21] [INFO ] Deduced a trap composed of 43 places in 100 ms of which 0 ms to minimize.
[2023-03-20 08:57:21] [INFO ] Deduced a trap composed of 43 places in 130 ms of which 0 ms to minimize.
[2023-03-20 08:57:21] [INFO ] Deduced a trap composed of 59 places in 114 ms of which 0 ms to minimize.
[2023-03-20 08:57:21] [INFO ] Deduced a trap composed of 59 places in 160 ms of which 1 ms to minimize.
[2023-03-20 08:57:22] [INFO ] Deduced a trap composed of 59 places in 250 ms of which 1 ms to minimize.
[2023-03-20 08:57:22] [INFO ] Deduced a trap composed of 45 places in 179 ms of which 0 ms to minimize.
[2023-03-20 08:57:22] [INFO ] Deduced a trap composed of 59 places in 180 ms of which 1 ms to minimize.
[2023-03-20 08:57:22] [INFO ] Deduced a trap composed of 59 places in 168 ms of which 1 ms to minimize.
[2023-03-20 08:57:22] [INFO ] Deduced a trap composed of 59 places in 125 ms of which 0 ms to minimize.
[2023-03-20 08:57:23] [INFO ] Deduced a trap composed of 55 places in 117 ms of which 0 ms to minimize.
[2023-03-20 08:57:23] [INFO ] Deduced a trap composed of 45 places in 140 ms of which 0 ms to minimize.
[2023-03-20 08:57:23] [INFO ] Deduced a trap composed of 59 places in 155 ms of which 1 ms to minimize.
[2023-03-20 08:57:23] [INFO ] Deduced a trap composed of 43 places in 164 ms of which 0 ms to minimize.
[2023-03-20 08:57:24] [INFO ] Deduced a trap composed of 59 places in 157 ms of which 0 ms to minimize.
[2023-03-20 08:57:24] [INFO ] Deduced a trap composed of 59 places in 158 ms of which 0 ms to minimize.
[2023-03-20 08:57:24] [INFO ] Deduced a trap composed of 59 places in 166 ms of which 0 ms to minimize.
[2023-03-20 08:57:24] [INFO ] Deduced a trap composed of 59 places in 168 ms of which 0 ms to minimize.
[2023-03-20 08:57:25] [INFO ] Deduced a trap composed of 59 places in 165 ms of which 0 ms to minimize.
[2023-03-20 08:57:25] [INFO ] Deduced a trap composed of 59 places in 164 ms of which 1 ms to minimize.
[2023-03-20 08:57:25] [INFO ] Deduced a trap composed of 43 places in 158 ms of which 0 ms to minimize.
[2023-03-20 08:57:25] [INFO ] Deduced a trap composed of 59 places in 168 ms of which 0 ms to minimize.
[2023-03-20 08:57:26] [INFO ] Deduced a trap composed of 59 places in 151 ms of which 0 ms to minimize.
[2023-03-20 08:57:26] [INFO ] Deduced a trap composed of 59 places in 158 ms of which 1 ms to minimize.
[2023-03-20 08:57:26] [INFO ] Deduced a trap composed of 59 places in 151 ms of which 1 ms to minimize.
[2023-03-20 08:57:26] [INFO ] Deduced a trap composed of 43 places in 189 ms of which 1 ms to minimize.
[2023-03-20 08:57:27] [INFO ] Deduced a trap composed of 43 places in 175 ms of which 1 ms to minimize.
[2023-03-20 08:57:27] [INFO ] Deduced a trap composed of 59 places in 181 ms of which 0 ms to minimize.
[2023-03-20 08:57:27] [INFO ] Deduced a trap composed of 59 places in 156 ms of which 0 ms to minimize.
[2023-03-20 08:57:28] [INFO ] Deduced a trap composed of 59 places in 169 ms of which 1 ms to minimize.
[2023-03-20 08:57:28] [INFO ] Deduced a trap composed of 59 places in 180 ms of which 0 ms to minimize.
[2023-03-20 08:57:28] [INFO ] Deduced a trap composed of 59 places in 160 ms of which 0 ms to minimize.
[2023-03-20 08:57:28] [INFO ] Deduced a trap composed of 59 places in 166 ms of which 1 ms to minimize.
[2023-03-20 08:57:29] [INFO ] Deduced a trap composed of 59 places in 177 ms of which 0 ms to minimize.
[2023-03-20 08:57:29] [INFO ] Deduced a trap composed of 43 places in 173 ms of which 0 ms to minimize.
[2023-03-20 08:57:29] [INFO ] Deduced a trap composed of 43 places in 177 ms of which 1 ms to minimize.
[2023-03-20 08:57:29] [INFO ] Deduced a trap composed of 59 places in 176 ms of which 0 ms to minimize.
[2023-03-20 08:57:30] [INFO ] Deduced a trap composed of 59 places in 176 ms of which 1 ms to minimize.
[2023-03-20 08:57:30] [INFO ] Deduced a trap composed of 59 places in 153 ms of which 1 ms to minimize.
[2023-03-20 08:57:30] [INFO ] Deduced a trap composed of 59 places in 183 ms of which 0 ms to minimize.
[2023-03-20 08:57:30] [INFO ] Deduced a trap composed of 59 places in 190 ms of which 0 ms to minimize.
[2023-03-20 08:57:31] [INFO ] Deduced a trap composed of 55 places in 182 ms of which 1 ms to minimize.
[2023-03-20 08:57:31] [INFO ] Deduced a trap composed of 45 places in 170 ms of which 0 ms to minimize.
[2023-03-20 08:57:31] [INFO ] Deduced a trap composed of 55 places in 169 ms of which 0 ms to minimize.
[2023-03-20 08:57:31] [INFO ] Deduced a trap composed of 55 places in 168 ms of which 1 ms to minimize.
[2023-03-20 08:57:32] [INFO ] Deduced a trap composed of 55 places in 176 ms of which 0 ms to minimize.
[2023-03-20 08:57:32] [INFO ] Deduced a trap composed of 43 places in 161 ms of which 1 ms to minimize.
[2023-03-20 08:57:32] [INFO ] Deduced a trap composed of 55 places in 171 ms of which 0 ms to minimize.
[2023-03-20 08:57:32] [INFO ] Deduced a trap composed of 55 places in 148 ms of which 0 ms to minimize.
[2023-03-20 08:57:33] [INFO ] Deduced a trap composed of 43 places in 169 ms of which 1 ms to minimize.
[2023-03-20 08:57:33] [INFO ] Deduced a trap composed of 55 places in 180 ms of which 0 ms to minimize.
[2023-03-20 08:57:33] [INFO ] Deduced a trap composed of 55 places in 176 ms of which 0 ms to minimize.
[2023-03-20 08:57:33] [INFO ] Deduced a trap composed of 43 places in 165 ms of which 1 ms to minimize.
[2023-03-20 08:57:34] [INFO ] Deduced a trap composed of 55 places in 145 ms of which 1 ms to minimize.
[2023-03-20 08:57:34] [INFO ] Deduced a trap composed of 55 places in 121 ms of which 0 ms to minimize.
[2023-03-20 08:57:34] [INFO ] Deduced a trap composed of 45 places in 168 ms of which 1 ms to minimize.
[2023-03-20 08:57:34] [INFO ] Deduced a trap composed of 55 places in 173 ms of which 0 ms to minimize.
[2023-03-20 08:57:34] [INFO ] Deduced a trap composed of 55 places in 180 ms of which 1 ms to minimize.
[2023-03-20 08:57:35] [INFO ] Deduced a trap composed of 45 places in 157 ms of which 1 ms to minimize.
[2023-03-20 08:57:35] [INFO ] Deduced a trap composed of 55 places in 178 ms of which 0 ms to minimize.
[2023-03-20 08:57:35] [INFO ] Deduced a trap composed of 55 places in 160 ms of which 0 ms to minimize.
[2023-03-20 08:57:35] [INFO ] Deduced a trap composed of 43 places in 161 ms of which 1 ms to minimize.
[2023-03-20 08:57:36] [INFO ] Deduced a trap composed of 55 places in 158 ms of which 0 ms to minimize.
[2023-03-20 08:57:36] [INFO ] Deduced a trap composed of 55 places in 173 ms of which 1 ms to minimize.
[2023-03-20 08:57:36] [INFO ] Deduced a trap composed of 43 places in 139 ms of which 1 ms to minimize.
[2023-03-20 08:57:36] [INFO ] Deduced a trap composed of 55 places in 182 ms of which 1 ms to minimize.
[2023-03-20 08:57:37] [INFO ] Deduced a trap composed of 55 places in 155 ms of which 1 ms to minimize.
[2023-03-20 08:57:37] [INFO ] Deduced a trap composed of 45 places in 152 ms of which 0 ms to minimize.
[2023-03-20 08:57:37] [INFO ] Deduced a trap composed of 55 places in 175 ms of which 0 ms to minimize.
[2023-03-20 08:57:37] [INFO ] Deduced a trap composed of 45 places in 183 ms of which 1 ms to minimize.
[2023-03-20 08:57:38] [INFO ] Deduced a trap composed of 55 places in 184 ms of which 1 ms to minimize.
[2023-03-20 08:57:38] [INFO ] Deduced a trap composed of 43 places in 173 ms of which 0 ms to minimize.
[2023-03-20 08:57:38] [INFO ] Deduced a trap composed of 55 places in 184 ms of which 0 ms to minimize.
[2023-03-20 08:57:38] [INFO ] Deduced a trap composed of 55 places in 171 ms of which 0 ms to minimize.
[2023-03-20 08:57:39] [INFO ] Deduced a trap composed of 43 places in 158 ms of which 0 ms to minimize.
[2023-03-20 08:57:39] [INFO ] Deduced a trap composed of 55 places in 161 ms of which 1 ms to minimize.
[2023-03-20 08:57:39] [INFO ] Deduced a trap composed of 55 places in 171 ms of which 1 ms to minimize.
[2023-03-20 08:57:39] [INFO ] Deduced a trap composed of 43 places in 159 ms of which 0 ms to minimize.
[2023-03-20 08:57:40] [INFO ] Deduced a trap composed of 55 places in 150 ms of which 0 ms to minimize.
[2023-03-20 08:57:40] [INFO ] Deduced a trap composed of 55 places in 150 ms of which 0 ms to minimize.
[2023-03-20 08:57:40] [INFO ] Deduced a trap composed of 43 places in 159 ms of which 0 ms to minimize.
[2023-03-20 08:57:40] [INFO ] Deduced a trap composed of 55 places in 163 ms of which 0 ms to minimize.
[2023-03-20 08:57:41] [INFO ] Deduced a trap composed of 55 places in 164 ms of which 1 ms to minimize.
[2023-03-20 08:57:41] [INFO ] Deduced a trap composed of 45 places in 165 ms of which 0 ms to minimize.
[2023-03-20 08:57:41] [INFO ] Deduced a trap composed of 55 places in 174 ms of which 1 ms to minimize.
[2023-03-20 08:57:41] [INFO ] Deduced a trap composed of 55 places in 165 ms of which 1 ms to minimize.
[2023-03-20 08:57:42] [INFO ] Deduced a trap composed of 45 places in 166 ms of which 1 ms to minimize.
[2023-03-20 08:57:42] [INFO ] Deduced a trap composed of 55 places in 174 ms of which 0 ms to minimize.
[2023-03-20 08:57:42] [INFO ] Deduced a trap composed of 55 places in 184 ms of which 1 ms to minimize.
[2023-03-20 08:57:42] [INFO ] Deduced a trap composed of 43 places in 185 ms of which 0 ms to minimize.
[2023-03-20 08:57:43] [INFO ] Deduced a trap composed of 55 places in 154 ms of which 1 ms to minimize.
[2023-03-20 08:57:43] [INFO ] Deduced a trap composed of 55 places in 172 ms of which 1 ms to minimize.
[2023-03-20 08:57:43] [INFO ] Deduced a trap composed of 43 places in 156 ms of which 1 ms to minimize.
[2023-03-20 08:57:43] [INFO ] Deduced a trap composed of 55 places in 144 ms of which 1 ms to minimize.
[2023-03-20 08:57:43] [INFO ] Deduced a trap composed of 55 places in 168 ms of which 0 ms to minimize.
[2023-03-20 08:57:44] [INFO ] Deduced a trap composed of 43 places in 175 ms of which 1 ms to minimize.
[2023-03-20 08:57:44] [INFO ] Deduced a trap composed of 55 places in 170 ms of which 1 ms to minimize.
[2023-03-20 08:57:44] [INFO ] Deduced a trap composed of 43 places in 182 ms of which 0 ms to minimize.
[2023-03-20 08:57:44] [INFO ] Deduced a trap composed of 55 places in 186 ms of which 0 ms to minimize.
[2023-03-20 08:57:45] [INFO ] Deduced a trap composed of 43 places in 120 ms of which 0 ms to minimize.
[2023-03-20 08:57:45] [INFO ] Deduced a trap composed of 55 places in 110 ms of which 1 ms to minimize.
[2023-03-20 08:57:45] [INFO ] Deduced a trap composed of 55 places in 110 ms of which 0 ms to minimize.
[2023-03-20 08:57:45] [INFO ] Deduced a trap composed of 43 places in 145 ms of which 0 ms to minimize.
[2023-03-20 08:57:45] [INFO ] Deduced a trap composed of 55 places in 166 ms of which 0 ms to minimize.
[2023-03-20 08:57:46] [INFO ] Deduced a trap composed of 55 places in 171 ms of which 1 ms to minimize.
[2023-03-20 08:57:46] [INFO ] Deduced a trap composed of 12 places in 154 ms of which 0 ms to minimize.
[2023-03-20 08:57:46] [INFO ] Deduced a trap composed of 7 places in 141 ms of which 0 ms to minimize.
[2023-03-20 08:57:46] [INFO ] Deduced a trap composed of 12 places in 132 ms of which 1 ms to minimize.
[2023-03-20 08:57:47] [INFO ] Deduced a trap composed of 11 places in 145 ms of which 0 ms to minimize.
[2023-03-20 08:57:47] [INFO ] Deduced a trap composed of 20 places in 135 ms of which 0 ms to minimize.
[2023-03-20 08:57:47] [INFO ] Deduced a trap composed of 59 places in 92 ms of which 0 ms to minimize.
[2023-03-20 08:57:47] [INFO ] Deduced a trap composed of 19 places in 110 ms of which 1 ms to minimize.
[2023-03-20 08:57:47] [INFO ] Deduced a trap composed of 55 places in 92 ms of which 0 ms to minimize.
[2023-03-20 08:57:47] [INFO ] Deduced a trap composed of 19 places in 96 ms of which 0 ms to minimize.
[2023-03-20 08:57:48] [INFO ] Deduced a trap composed of 19 places in 102 ms of which 0 ms to minimize.
[2023-03-20 08:57:48] [INFO ] Deduced a trap composed of 55 places in 95 ms of which 1 ms to minimize.
[2023-03-20 08:57:48] [INFO ] Deduced a trap composed of 55 places in 150 ms of which 0 ms to minimize.
[2023-03-20 08:57:48] [INFO ] Deduced a trap composed of 55 places in 142 ms of which 0 ms to minimize.
[2023-03-20 08:57:48] [INFO ] Deduced a trap composed of 55 places in 144 ms of which 1 ms to minimize.
[2023-03-20 08:57:49] [INFO ] Deduced a trap composed of 55 places in 135 ms of which 0 ms to minimize.
[2023-03-20 08:57:49] [INFO ] Deduced a trap composed of 55 places in 132 ms of which 0 ms to minimize.
[2023-03-20 08:57:49] [INFO ] Deduced a trap composed of 55 places in 129 ms of which 0 ms to minimize.
[2023-03-20 08:57:49] [INFO ] Deduced a trap composed of 55 places in 133 ms of which 0 ms to minimize.
[2023-03-20 08:57:49] [INFO ] Deduced a trap composed of 55 places in 131 ms of which 1 ms to minimize.
[2023-03-20 08:57:50] [INFO ] Deduced a trap composed of 59 places in 122 ms of which 1 ms to minimize.
[2023-03-20 08:57:50] [INFO ] Deduced a trap composed of 55 places in 139 ms of which 1 ms to minimize.
[2023-03-20 08:57:50] [INFO ] Deduced a trap composed of 55 places in 119 ms of which 1 ms to minimize.
[2023-03-20 08:57:50] [INFO ] Deduced a trap composed of 59 places in 81 ms of which 1 ms to minimize.
[2023-03-20 08:57:50] [INFO ] Deduced a trap composed of 55 places in 155 ms of which 1 ms to minimize.
[2023-03-20 08:57:51] [INFO ] Deduced a trap composed of 55 places in 160 ms of which 1 ms to minimize.
[2023-03-20 08:57:51] [INFO ] Deduced a trap composed of 55 places in 134 ms of which 0 ms to minimize.
[2023-03-20 08:57:51] [INFO ] Deduced a trap composed of 55 places in 112 ms of which 0 ms to minimize.
[2023-03-20 08:57:51] [INFO ] Deduced a trap composed of 55 places in 125 ms of which 0 ms to minimize.
[2023-03-20 08:57:52] [INFO ] Deduced a trap composed of 55 places in 143 ms of which 1 ms to minimize.
[2023-03-20 08:57:52] [INFO ] Deduced a trap composed of 55 places in 139 ms of which 1 ms to minimize.
[2023-03-20 08:57:52] [INFO ] Deduced a trap composed of 55 places in 136 ms of which 0 ms to minimize.
[2023-03-20 08:57:52] [INFO ] Deduced a trap composed of 55 places in 130 ms of which 1 ms to minimize.
[2023-03-20 08:57:53] [INFO ] Deduced a trap composed of 55 places in 143 ms of which 1 ms to minimize.
[2023-03-20 08:57:53] [INFO ] Deduced a trap composed of 55 places in 128 ms of which 0 ms to minimize.
[2023-03-20 08:57:53] [INFO ] Trap strengthening procedure interrupted after too many repetitions 158185 ms
[2023-03-20 08:57:53] [INFO ] Trap strengthening (SAT) tested/added 764/763 trap constraints in 158185 ms
[2023-03-20 08:57:53] [INFO ] After 159271ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 168 ms.
[2023-03-20 08:57:53] [INFO ] After 159605ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
FORMULA ShieldRVs-PT-050A-LTLFireability-04 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 1 stabilizing places and 1 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(F((p0||(!p1 U X(p0)))))))))'
Support contains 3 out of 703 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 703/703 places, 953/953 transitions.
Applied a total of 0 rules in 17 ms. Remains 703 /703 variables (removed 0) and now considering 953/953 (removed 0) transitions.
// Phase 1: matrix 953 rows 703 cols
[2023-03-20 08:57:54] [INFO ] Computed 201 place invariants in 5 ms
[2023-03-20 08:57:54] [INFO ] Implicit Places using invariants in 434 ms returned []
[2023-03-20 08:57:54] [INFO ] Invariant cache hit.
[2023-03-20 08:57:55] [INFO ] Implicit Places using invariants and state equation in 750 ms returned []
Implicit Place search using SMT with State Equation took 1189 ms to find 0 implicit places.
[2023-03-20 08:57:55] [INFO ] Invariant cache hit.
[2023-03-20 08:57:55] [INFO ] Dead Transitions using invariants and state equation in 567 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1777 ms. Remains : 703/703 places, 953/953 transitions.
Stuttering acceptance computed with spot in 333 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVs-PT-050A-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p0:(AND (EQ s115 1) (EQ s132 1) (EQ s142 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 1795 steps with 2 reset in 38 ms.
FORMULA ShieldRVs-PT-050A-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-050A-LTLFireability-00 finished in 2230 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(p0))||(p1 U p2)))'
Support contains 7 out of 703 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 703/703 places, 953/953 transitions.
Applied a total of 0 rules in 19 ms. Remains 703 /703 variables (removed 0) and now considering 953/953 (removed 0) transitions.
[2023-03-20 08:57:56] [INFO ] Invariant cache hit.
[2023-03-20 08:57:56] [INFO ] Implicit Places using invariants in 398 ms returned []
[2023-03-20 08:57:56] [INFO ] Invariant cache hit.
[2023-03-20 08:57:57] [INFO ] Implicit Places using invariants and state equation in 735 ms returned []
Implicit Place search using SMT with State Equation took 1135 ms to find 0 implicit places.
[2023-03-20 08:57:57] [INFO ] Invariant cache hit.
[2023-03-20 08:57:57] [INFO ] Dead Transitions using invariants and state equation in 438 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1593 ms. Remains : 703/703 places, 953/953 transitions.
Stuttering acceptance computed with spot in 224 ms :[(NOT p0), (AND (NOT p0) (NOT p2)), true, (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p2)]
Running random walk in product with property : ShieldRVs-PT-050A-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=1 dest: 6}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 0}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p2) p1), acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=5 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={} source=5 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=6 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={0} source=6 dest: 6}]], initial=4, aps=[p0:(AND (EQ s236 1) (EQ s240 1) (EQ s247 1)), p2:(AND (EQ s59 1) (EQ s74 1) (EQ s85 1)), p1:(EQ s109 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 4 ms.
FORMULA ShieldRVs-PT-050A-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-050A-LTLFireability-01 finished in 1855 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&G((F(p1)&&F(G(p0)))))))'
Support contains 4 out of 703 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 703/703 places, 953/953 transitions.
Applied a total of 0 rules in 9 ms. Remains 703 /703 variables (removed 0) and now considering 953/953 (removed 0) transitions.
[2023-03-20 08:57:58] [INFO ] Invariant cache hit.
[2023-03-20 08:57:58] [INFO ] Implicit Places using invariants in 325 ms returned []
[2023-03-20 08:57:58] [INFO ] Invariant cache hit.
[2023-03-20 08:57:59] [INFO ] Implicit Places using invariants and state equation in 635 ms returned []
Implicit Place search using SMT with State Equation took 962 ms to find 0 implicit places.
[2023-03-20 08:57:59] [INFO ] Invariant cache hit.
[2023-03-20 08:57:59] [INFO ] Dead Transitions using invariants and state equation in 435 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1408 ms. Remains : 703/703 places, 953/953 transitions.
Stuttering acceptance computed with spot in 193 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1), (NOT p0), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldRVs-PT-050A-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}, { cond=p0, acceptance={} source=1 dest: 5}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=p0, acceptance={} source=4 dest: 4}, { cond=(NOT p0), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={} source=5 dest: 3}, { cond=(NOT p0), acceptance={} source=5 dest: 4}, { cond=true, acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(EQ s33 1), p1:(OR (EQ s33 1) (AND (EQ s10 1) (EQ s16 1) (EQ s23 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA ShieldRVs-PT-050A-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-050A-LTLFireability-02 finished in 1624 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 4 out of 703 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 703/703 places, 953/953 transitions.
Applied a total of 0 rules in 16 ms. Remains 703 /703 variables (removed 0) and now considering 953/953 (removed 0) transitions.
[2023-03-20 08:57:59] [INFO ] Invariant cache hit.
[2023-03-20 08:58:00] [INFO ] Implicit Places using invariants in 334 ms returned []
[2023-03-20 08:58:00] [INFO ] Invariant cache hit.
[2023-03-20 08:58:00] [INFO ] Implicit Places using invariants and state equation in 690 ms returned []
Implicit Place search using SMT with State Equation took 1039 ms to find 0 implicit places.
[2023-03-20 08:58:00] [INFO ] Invariant cache hit.
[2023-03-20 08:58:01] [INFO ] Dead Transitions using invariants and state equation in 521 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1580 ms. Remains : 703/703 places, 953/953 transitions.
Stuttering acceptance computed with spot in 122 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVs-PT-050A-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(OR (EQ s537 1) (AND (EQ s164 1) (EQ s168 1) (EQ s177 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA ShieldRVs-PT-050A-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-050A-LTLFireability-05 finished in 1722 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0) U (X(G(p1))&&G(!p2))))'
Support contains 7 out of 703 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 703/703 places, 953/953 transitions.
Applied a total of 0 rules in 17 ms. Remains 703 /703 variables (removed 0) and now considering 953/953 (removed 0) transitions.
[2023-03-20 08:58:01] [INFO ] Invariant cache hit.
[2023-03-20 08:58:01] [INFO ] Implicit Places using invariants in 375 ms returned []
[2023-03-20 08:58:01] [INFO ] Invariant cache hit.
[2023-03-20 08:58:02] [INFO ] Implicit Places using invariants and state equation in 741 ms returned []
Implicit Place search using SMT with State Equation took 1119 ms to find 0 implicit places.
[2023-03-20 08:58:02] [INFO ] Invariant cache hit.
[2023-03-20 08:58:03] [INFO ] Dead Transitions using invariants and state equation in 392 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1529 ms. Remains : 703/703 places, 953/953 transitions.
Stuttering acceptance computed with spot in 221 ms :[(OR (NOT p1) p2), (NOT p0), (NOT p1), p2, true, (AND p0 (NOT p1)), (AND p2 p0)]
Running random walk in product with property : ShieldRVs-PT-050A-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={0, 1} source=0 dest: 0}, { cond=p2, acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={0, 1} source=0 dest: 2}, { cond=(NOT p2), acceptance={1} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={} source=1 dest: 4}], [{ cond=(AND p2 p0 (NOT p1)), acceptance={0, 1} source=2 dest: 0}, { cond=(AND p2 p0 (NOT p1)), acceptance={} source=2 dest: 1}, { cond=p1, acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={0, 1} source=2 dest: 2}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={1} source=2 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 5}], [{ cond=(AND p2 p0), acceptance={0, 1} source=3 dest: 0}, { cond=(AND p2 p0), acceptance={} source=3 dest: 1}, { cond=(NOT p2), acceptance={1} source=3 dest: 3}, { cond=(AND p2 (NOT p0)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=3 dest: 6}], [{ cond=true, acceptance={0, 1} source=4 dest: 4}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=5 dest: 4}, { cond=(AND p0 p1), acceptance={} source=5 dest: 5}], [{ cond=(AND p2 p0), acceptance={} source=6 dest: 4}, { cond=(AND (NOT p2) p0), acceptance={} source=6 dest: 6}]], initial=0, aps=[p2:(AND (EQ s118 1) (EQ s119 1) (EQ s124 1)), p0:(OR (NOT (AND (EQ s313 1) (EQ s315 1) (EQ s320 1))) (AND (EQ s118 1) (EQ s119 1) (EQ s124 1))), p1:(EQ s3...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 27283 steps with 48 reset in 178 ms.
FORMULA ShieldRVs-PT-050A-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-050A-LTLFireability-06 finished in 1949 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(((p0 U p1)&&X((F(p2) U G(p3)))))))'
Support contains 10 out of 703 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 703/703 places, 953/953 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 702 transition count 952
Applied a total of 2 rules in 72 ms. Remains 702 /703 variables (removed 1) and now considering 952/953 (removed 1) transitions.
// Phase 1: matrix 952 rows 702 cols
[2023-03-20 08:58:03] [INFO ] Computed 201 place invariants in 5 ms
[2023-03-20 08:58:04] [INFO ] Implicit Places using invariants in 414 ms returned []
[2023-03-20 08:58:04] [INFO ] Invariant cache hit.
[2023-03-20 08:58:04] [INFO ] Implicit Places using invariants and state equation in 773 ms returned []
Implicit Place search using SMT with State Equation took 1197 ms to find 0 implicit places.
[2023-03-20 08:58:05] [INFO ] Redundant transitions in 233 ms returned [300]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 951 rows 702 cols
[2023-03-20 08:58:05] [INFO ] Computed 201 place invariants in 3 ms
[2023-03-20 08:58:05] [INFO ] Dead Transitions using invariants and state equation in 639 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 702/703 places, 951/953 transitions.
Applied a total of 0 rules in 35 ms. Remains 702 /702 variables (removed 0) and now considering 951/951 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2189 ms. Remains : 702/703 places, 951/953 transitions.
Stuttering acceptance computed with spot in 329 ms :[(OR (NOT p1) (NOT p3)), (OR (NOT p1) (NOT p3)), (NOT p1), (NOT p3), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p2) (NOT p3))), (AND (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : ShieldRVs-PT-050A-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 2}, { cond=(OR p1 p0), acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 2}, { cond=(OR p1 p0), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 2}], [{ cond=p3, acceptance={} source=3 dest: 3}, { cond=(NOT p3), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p0) (NOT p3) (NOT p2)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p1) p0 (NOT p3) (NOT p2)), acceptance={} source=3 dest: 6}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0} source=4 dest: 4}, { cond=(OR (AND p1 (NOT p2)) (AND p0 (NOT p2))), acceptance={0} source=4 dest: 5}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=4 dest: 6}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p3) (NOT p2)), acceptance={0} source=5 dest: 4}, { cond=(AND p3 (NOT p2)), acceptance={} source=5 dest: 5}, { cond=(OR (AND p1 (NOT p3) (NOT p2)) (AND p0 (NOT p3) (NOT p2))), acceptance={0} source=5 dest: 5}, { cond=(AND (NOT p1) p0 (NOT p3) (NOT p2)), acceptance={0} source=5 dest: 6}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0} source=6 dest: 4}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p1:(EQ s75 1), p0:(AND (EQ s3 1) (EQ s20 1) (EQ s29 1)), p3:(AND (EQ s304 1) (EQ s310 1) (EQ s317 1)), p2:(AND (EQ s129 1) (EQ s144 1) (EQ s156 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null, null][true, true, true, true, true, true, true]]
Stuttering criterion allowed to conclude after 697 steps with 0 reset in 10 ms.
FORMULA ShieldRVs-PT-050A-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-050A-LTLFireability-09 finished in 2590 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p1)&&p0)))'
Support contains 5 out of 703 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 703/703 places, 953/953 transitions.
Applied a total of 0 rules in 9 ms. Remains 703 /703 variables (removed 0) and now considering 953/953 (removed 0) transitions.
// Phase 1: matrix 953 rows 703 cols
[2023-03-20 08:58:06] [INFO ] Computed 201 place invariants in 4 ms
[2023-03-20 08:58:06] [INFO ] Implicit Places using invariants in 281 ms returned []
[2023-03-20 08:58:06] [INFO ] Invariant cache hit.
[2023-03-20 08:58:07] [INFO ] Implicit Places using invariants and state equation in 641 ms returned []
Implicit Place search using SMT with State Equation took 949 ms to find 0 implicit places.
[2023-03-20 08:58:07] [INFO ] Invariant cache hit.
[2023-03-20 08:58:07] [INFO ] Dead Transitions using invariants and state equation in 388 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1357 ms. Remains : 703/703 places, 953/953 transitions.
Stuttering acceptance computed with spot in 93 ms :[true, (OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldRVs-PT-050A-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 p1), acceptance={} source=3 dest: 2}]], initial=1, aps=[p1:(AND (EQ s642 1) (EQ s646 1) (EQ s653 1)), p0:(AND (EQ s642 1) (EQ s646 1) (EQ s653 1) (EQ s428 1) (EQ s433 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldRVs-PT-050A-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-050A-LTLFireability-11 finished in 1467 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((X(p0) U p1) U !p2)))'
Support contains 6 out of 703 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 703/703 places, 953/953 transitions.
Applied a total of 0 rules in 8 ms. Remains 703 /703 variables (removed 0) and now considering 953/953 (removed 0) transitions.
[2023-03-20 08:58:07] [INFO ] Invariant cache hit.
[2023-03-20 08:58:07] [INFO ] Implicit Places using invariants in 300 ms returned []
[2023-03-20 08:58:07] [INFO ] Invariant cache hit.
[2023-03-20 08:58:08] [INFO ] Implicit Places using invariants and state equation in 669 ms returned []
Implicit Place search using SMT with State Equation took 1014 ms to find 0 implicit places.
[2023-03-20 08:58:08] [INFO ] Invariant cache hit.
[2023-03-20 08:58:09] [INFO ] Dead Transitions using invariants and state equation in 418 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1464 ms. Remains : 703/703 places, 953/953 transitions.
Stuttering acceptance computed with spot in 133 ms :[p2, p2, (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : ShieldRVs-PT-050A-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p2, acceptance={} source=1 dest: 1}, { cond=(AND p2 (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p2:(AND (EQ s178 1) (EQ s182 1) (EQ s191 1)), p1:(EQ s11 1), p0:(OR (EQ s374 1) (EQ s60 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 2688 ms.
Product exploration explored 100000 steps with 50000 reset in 2745 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT p2)), (X (NOT (AND p2 (NOT p1)))), (X (X (NOT p2))), (X (X (NOT p0))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND (NOT p1) p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT p2))
Knowledge based reduction with 7 factoid took 165 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldRVs-PT-050A-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldRVs-PT-050A-LTLFireability-12 finished in 7225 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((!p0||F(p1)) U (G((!p0||F(p1)))||((!p0||F(p1))&&X(G(!p3))&&p2))))'
Support contains 6 out of 703 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 703/703 places, 953/953 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 702 transition count 952
Applied a total of 2 rules in 35 ms. Remains 702 /703 variables (removed 1) and now considering 952/953 (removed 1) transitions.
// Phase 1: matrix 952 rows 702 cols
[2023-03-20 08:58:14] [INFO ] Computed 201 place invariants in 3 ms
[2023-03-20 08:58:15] [INFO ] Implicit Places using invariants in 373 ms returned []
[2023-03-20 08:58:15] [INFO ] Invariant cache hit.
[2023-03-20 08:58:16] [INFO ] Implicit Places using invariants and state equation in 856 ms returned []
Implicit Place search using SMT with State Equation took 1257 ms to find 0 implicit places.
[2023-03-20 08:58:16] [INFO ] Redundant transitions in 233 ms returned [300]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 951 rows 702 cols
[2023-03-20 08:58:16] [INFO ] Computed 201 place invariants in 3 ms
[2023-03-20 08:58:16] [INFO ] Dead Transitions using invariants and state equation in 567 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 702/703 places, 951/953 transitions.
Applied a total of 0 rules in 24 ms. Remains 702 /702 variables (removed 0) and now considering 951/951 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2125 ms. Remains : 702/703 places, 951/953 transitions.
Stuttering acceptance computed with spot in 226 ms :[(AND p0 (NOT p1)), (NOT p1), (AND p0 (NOT p1) p3), (AND (NOT p1) (NOT p0) p3)]
Running random walk in product with property : ShieldRVs-PT-050A-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 1}, { cond=p2, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p2) p3), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1) p3), acceptance={} source=2 dest: 1}, { cond=(OR p2 (NOT p3)), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1) (NOT p3)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1) p3), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p3)), acceptance={} source=3 dest: 3}]], initial=0, aps=[p2:(AND (EQ s414 1) (EQ s419 1)), p0:(AND (EQ s414 1) (EQ s419 1)), p1:(NEQ s439 1), p3:(AND (EQ s500 1) (EQ s506 1) (EQ s513 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 158 reset in 536 ms.
Product exploration explored 100000 steps with 158 reset in 586 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p0) p1 (NOT p3)), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (NOT (AND (NOT p2) p3))), (X (NOT (AND p0 (NOT p1) p3))), (X (NOT p2)), (X (OR p2 (NOT p3))), (X (NOT (AND p0 (NOT p1) (NOT p3)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (X (X (NOT (AND (NOT p2) p3)))), (X (X (NOT (AND p0 (NOT p1) p3)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p3)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3))))), (X (X (OR p2 (NOT p3)))), (X (X (NOT (AND p0 (NOT p1) (NOT p3)))))]
False Knowledge obtained : []
Knowledge based reduction with 17 factoid took 753 ms. Reduced automaton from 4 states, 10 edges and 4 AP (stutter insensitive) to 4 states, 10 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 147 ms :[(AND p0 (NOT p1)), (NOT p1), (AND p0 (NOT p1) p3), (AND (NOT p1) (NOT p0) p3)]
Incomplete random walk after 10000 steps, including 15 resets, run finished after 171 ms. (steps per millisecond=58 ) properties (out of 9) seen :7
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 2) seen :1
Running SMT prover for 1 properties.
[2023-03-20 08:58:19] [INFO ] Invariant cache hit.
[2023-03-20 08:58:19] [INFO ] [Real]Absence check using 201 positive place invariants in 29 ms returned sat
[2023-03-20 08:58:20] [INFO ] After 525ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 08:58:20] [INFO ] [Nat]Absence check using 201 positive place invariants in 25 ms returned sat
[2023-03-20 08:58:20] [INFO ] After 496ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 08:58:20] [INFO ] Deduced a trap composed of 12 places in 122 ms of which 1 ms to minimize.
[2023-03-20 08:58:20] [INFO ] Deduced a trap composed of 12 places in 138 ms of which 0 ms to minimize.
[2023-03-20 08:58:21] [INFO ] Deduced a trap composed of 8 places in 132 ms of which 0 ms to minimize.
[2023-03-20 08:58:21] [INFO ] Deduced a trap composed of 7 places in 151 ms of which 0 ms to minimize.
[2023-03-20 08:58:21] [INFO ] Deduced a trap composed of 15 places in 159 ms of which 0 ms to minimize.
[2023-03-20 08:58:21] [INFO ] Deduced a trap composed of 15 places in 139 ms of which 1 ms to minimize.
[2023-03-20 08:58:21] [INFO ] Deduced a trap composed of 8 places in 146 ms of which 0 ms to minimize.
[2023-03-20 08:58:22] [INFO ] Deduced a trap composed of 9 places in 153 ms of which 1 ms to minimize.
[2023-03-20 08:58:22] [INFO ] Deduced a trap composed of 13 places in 110 ms of which 0 ms to minimize.
[2023-03-20 08:58:22] [INFO ] Deduced a trap composed of 8 places in 123 ms of which 1 ms to minimize.
[2023-03-20 08:58:22] [INFO ] Deduced a trap composed of 11 places in 121 ms of which 0 ms to minimize.
[2023-03-20 08:58:22] [INFO ] Deduced a trap composed of 12 places in 107 ms of which 1 ms to minimize.
[2023-03-20 08:58:22] [INFO ] Deduced a trap composed of 11 places in 181 ms of which 0 ms to minimize.
[2023-03-20 08:58:23] [INFO ] Deduced a trap composed of 8 places in 129 ms of which 1 ms to minimize.
[2023-03-20 08:58:23] [INFO ] Deduced a trap composed of 25 places in 162 ms of which 1 ms to minimize.
[2023-03-20 08:58:23] [INFO ] Deduced a trap composed of 12 places in 126 ms of which 0 ms to minimize.
[2023-03-20 08:58:23] [INFO ] Deduced a trap composed of 31 places in 124 ms of which 0 ms to minimize.
[2023-03-20 08:58:23] [INFO ] Deduced a trap composed of 19 places in 122 ms of which 0 ms to minimize.
[2023-03-20 08:58:23] [INFO ] Deduced a trap composed of 8 places in 127 ms of which 0 ms to minimize.
[2023-03-20 08:58:24] [INFO ] Deduced a trap composed of 11 places in 137 ms of which 0 ms to minimize.
[2023-03-20 08:58:24] [INFO ] Deduced a trap composed of 19 places in 128 ms of which 0 ms to minimize.
[2023-03-20 08:58:24] [INFO ] Deduced a trap composed of 11 places in 122 ms of which 0 ms to minimize.
[2023-03-20 08:58:24] [INFO ] Deduced a trap composed of 19 places in 126 ms of which 1 ms to minimize.
[2023-03-20 08:58:24] [INFO ] Deduced a trap composed of 35 places in 124 ms of which 0 ms to minimize.
[2023-03-20 08:58:24] [INFO ] Deduced a trap composed of 8 places in 127 ms of which 0 ms to minimize.
[2023-03-20 08:58:24] [INFO ] Deduced a trap composed of 11 places in 122 ms of which 1 ms to minimize.
[2023-03-20 08:58:25] [INFO ] Deduced a trap composed of 11 places in 125 ms of which 1 ms to minimize.
[2023-03-20 08:58:25] [INFO ] Deduced a trap composed of 15 places in 144 ms of which 0 ms to minimize.
[2023-03-20 08:58:25] [INFO ] Deduced a trap composed of 15 places in 121 ms of which 1 ms to minimize.
[2023-03-20 08:58:25] [INFO ] Deduced a trap composed of 19 places in 121 ms of which 0 ms to minimize.
[2023-03-20 08:58:25] [INFO ] Deduced a trap composed of 15 places in 117 ms of which 0 ms to minimize.
[2023-03-20 08:58:25] [INFO ] Deduced a trap composed of 19 places in 118 ms of which 1 ms to minimize.
[2023-03-20 08:58:26] [INFO ] Deduced a trap composed of 16 places in 122 ms of which 1 ms to minimize.
[2023-03-20 08:58:26] [INFO ] Deduced a trap composed of 16 places in 124 ms of which 1 ms to minimize.
[2023-03-20 08:58:26] [INFO ] Deduced a trap composed of 24 places in 124 ms of which 1 ms to minimize.
[2023-03-20 08:58:26] [INFO ] Deduced a trap composed of 25 places in 120 ms of which 1 ms to minimize.
[2023-03-20 08:58:26] [INFO ] Deduced a trap composed of 23 places in 121 ms of which 1 ms to minimize.
[2023-03-20 08:58:26] [INFO ] Deduced a trap composed of 23 places in 132 ms of which 0 ms to minimize.
[2023-03-20 08:58:27] [INFO ] Deduced a trap composed of 27 places in 96 ms of which 0 ms to minimize.
[2023-03-20 08:58:27] [INFO ] Deduced a trap composed of 16 places in 147 ms of which 0 ms to minimize.
[2023-03-20 08:58:27] [INFO ] Deduced a trap composed of 27 places in 100 ms of which 1 ms to minimize.
[2023-03-20 08:58:27] [INFO ] Deduced a trap composed of 16 places in 128 ms of which 0 ms to minimize.
[2023-03-20 08:58:27] [INFO ] Deduced a trap composed of 15 places in 113 ms of which 1 ms to minimize.
[2023-03-20 08:58:27] [INFO ] Deduced a trap composed of 15 places in 110 ms of which 0 ms to minimize.
[2023-03-20 08:58:28] [INFO ] Deduced a trap composed of 21 places in 108 ms of which 0 ms to minimize.
[2023-03-20 08:58:28] [INFO ] Deduced a trap composed of 31 places in 106 ms of which 0 ms to minimize.
[2023-03-20 08:58:28] [INFO ] Deduced a trap composed of 23 places in 106 ms of which 0 ms to minimize.
[2023-03-20 08:58:28] [INFO ] Deduced a trap composed of 19 places in 110 ms of which 0 ms to minimize.
[2023-03-20 08:58:28] [INFO ] Deduced a trap composed of 24 places in 111 ms of which 0 ms to minimize.
[2023-03-20 08:58:28] [INFO ] Deduced a trap composed of 24 places in 110 ms of which 0 ms to minimize.
[2023-03-20 08:58:29] [INFO ] Deduced a trap composed of 23 places in 113 ms of which 0 ms to minimize.
[2023-03-20 08:58:29] [INFO ] Deduced a trap composed of 25 places in 136 ms of which 0 ms to minimize.
[2023-03-20 08:58:29] [INFO ] Deduced a trap composed of 23 places in 100 ms of which 1 ms to minimize.
[2023-03-20 08:58:29] [INFO ] Deduced a trap composed of 24 places in 115 ms of which 0 ms to minimize.
[2023-03-20 08:58:29] [INFO ] Deduced a trap composed of 35 places in 109 ms of which 0 ms to minimize.
[2023-03-20 08:58:29] [INFO ] Deduced a trap composed of 24 places in 112 ms of which 1 ms to minimize.
[2023-03-20 08:58:29] [INFO ] Deduced a trap composed of 23 places in 112 ms of which 0 ms to minimize.
[2023-03-20 08:58:30] [INFO ] Deduced a trap composed of 23 places in 105 ms of which 0 ms to minimize.
[2023-03-20 08:58:30] [INFO ] Deduced a trap composed of 35 places in 111 ms of which 1 ms to minimize.
[2023-03-20 08:58:30] [INFO ] Deduced a trap composed of 35 places in 109 ms of which 0 ms to minimize.
[2023-03-20 08:58:30] [INFO ] Deduced a trap composed of 24 places in 132 ms of which 0 ms to minimize.
[2023-03-20 08:58:30] [INFO ] Deduced a trap composed of 23 places in 125 ms of which 0 ms to minimize.
[2023-03-20 08:58:30] [INFO ] Deduced a trap composed of 31 places in 127 ms of which 1 ms to minimize.
[2023-03-20 08:58:31] [INFO ] Deduced a trap composed of 31 places in 121 ms of which 0 ms to minimize.
[2023-03-20 08:58:31] [INFO ] Deduced a trap composed of 24 places in 113 ms of which 0 ms to minimize.
[2023-03-20 08:58:31] [INFO ] Deduced a trap composed of 19 places in 112 ms of which 1 ms to minimize.
[2023-03-20 08:58:31] [INFO ] Deduced a trap composed of 25 places in 129 ms of which 0 ms to minimize.
[2023-03-20 08:58:31] [INFO ] Deduced a trap composed of 23 places in 112 ms of which 0 ms to minimize.
[2023-03-20 08:58:31] [INFO ] Deduced a trap composed of 20 places in 114 ms of which 0 ms to minimize.
[2023-03-20 08:58:31] [INFO ] Deduced a trap composed of 33 places in 132 ms of which 0 ms to minimize.
[2023-03-20 08:58:32] [INFO ] Deduced a trap composed of 28 places in 112 ms of which 0 ms to minimize.
[2023-03-20 08:58:32] [INFO ] Deduced a trap composed of 28 places in 137 ms of which 1 ms to minimize.
[2023-03-20 08:58:32] [INFO ] Deduced a trap composed of 27 places in 145 ms of which 0 ms to minimize.
[2023-03-20 08:58:32] [INFO ] Deduced a trap composed of 31 places in 147 ms of which 0 ms to minimize.
[2023-03-20 08:58:32] [INFO ] Deduced a trap composed of 31 places in 147 ms of which 0 ms to minimize.
[2023-03-20 08:58:33] [INFO ] Deduced a trap composed of 31 places in 154 ms of which 0 ms to minimize.
[2023-03-20 08:58:33] [INFO ] Deduced a trap composed of 21 places in 134 ms of which 1 ms to minimize.
[2023-03-20 08:58:33] [INFO ] Deduced a trap composed of 28 places in 127 ms of which 1 ms to minimize.
[2023-03-20 08:58:33] [INFO ] Deduced a trap composed of 8 places in 134 ms of which 0 ms to minimize.
[2023-03-20 08:58:33] [INFO ] Deduced a trap composed of 26 places in 154 ms of which 0 ms to minimize.
[2023-03-20 08:58:34] [INFO ] Deduced a trap composed of 33 places in 132 ms of which 1 ms to minimize.
[2023-03-20 08:58:34] [INFO ] Deduced a trap composed of 24 places in 129 ms of which 1 ms to minimize.
[2023-03-20 08:58:34] [INFO ] Deduced a trap composed of 28 places in 132 ms of which 1 ms to minimize.
[2023-03-20 08:58:34] [INFO ] Deduced a trap composed of 31 places in 135 ms of which 1 ms to minimize.
[2023-03-20 08:58:34] [INFO ] Deduced a trap composed of 31 places in 146 ms of which 0 ms to minimize.
[2023-03-20 08:58:34] [INFO ] Deduced a trap composed of 31 places in 126 ms of which 1 ms to minimize.
[2023-03-20 08:58:35] [INFO ] Deduced a trap composed of 11 places in 140 ms of which 0 ms to minimize.
[2023-03-20 08:58:35] [INFO ] Deduced a trap composed of 15 places in 128 ms of which 1 ms to minimize.
[2023-03-20 08:58:35] [INFO ] Deduced a trap composed of 24 places in 126 ms of which 0 ms to minimize.
[2023-03-20 08:58:35] [INFO ] Deduced a trap composed of 28 places in 117 ms of which 0 ms to minimize.
[2023-03-20 08:58:35] [INFO ] Deduced a trap composed of 28 places in 147 ms of which 1 ms to minimize.
[2023-03-20 08:58:35] [INFO ] Deduced a trap composed of 24 places in 126 ms of which 1 ms to minimize.
[2023-03-20 08:58:36] [INFO ] Deduced a trap composed of 28 places in 117 ms of which 0 ms to minimize.
[2023-03-20 08:58:36] [INFO ] Deduced a trap composed of 28 places in 148 ms of which 1 ms to minimize.
[2023-03-20 08:58:36] [INFO ] Deduced a trap composed of 24 places in 107 ms of which 1 ms to minimize.
[2023-03-20 08:58:36] [INFO ] Deduced a trap composed of 28 places in 175 ms of which 0 ms to minimize.
[2023-03-20 08:58:36] [INFO ] Deduced a trap composed of 28 places in 117 ms of which 0 ms to minimize.
[2023-03-20 08:58:36] [INFO ] Deduced a trap composed of 27 places in 122 ms of which 1 ms to minimize.
[2023-03-20 08:58:37] [INFO ] Deduced a trap composed of 31 places in 119 ms of which 0 ms to minimize.
[2023-03-20 08:58:37] [INFO ] Deduced a trap composed of 28 places in 100 ms of which 1 ms to minimize.
[2023-03-20 08:58:37] [INFO ] Deduced a trap composed of 31 places in 104 ms of which 0 ms to minimize.
[2023-03-20 08:58:37] [INFO ] Deduced a trap composed of 24 places in 90 ms of which 0 ms to minimize.
[2023-03-20 08:58:37] [INFO ] Deduced a trap composed of 28 places in 105 ms of which 0 ms to minimize.
[2023-03-20 08:58:37] [INFO ] Deduced a trap composed of 24 places in 127 ms of which 1 ms to minimize.
[2023-03-20 08:58:38] [INFO ] Deduced a trap composed of 28 places in 117 ms of which 0 ms to minimize.
[2023-03-20 08:58:38] [INFO ] Deduced a trap composed of 24 places in 112 ms of which 1 ms to minimize.
[2023-03-20 08:58:38] [INFO ] Deduced a trap composed of 28 places in 114 ms of which 1 ms to minimize.
[2023-03-20 08:58:38] [INFO ] Deduced a trap composed of 28 places in 114 ms of which 0 ms to minimize.
[2023-03-20 08:58:38] [INFO ] Deduced a trap composed of 29 places in 111 ms of which 0 ms to minimize.
[2023-03-20 08:58:38] [INFO ] Deduced a trap composed of 33 places in 111 ms of which 1 ms to minimize.
[2023-03-20 08:58:38] [INFO ] Deduced a trap composed of 33 places in 104 ms of which 0 ms to minimize.
[2023-03-20 08:58:39] [INFO ] Deduced a trap composed of 27 places in 107 ms of which 0 ms to minimize.
[2023-03-20 08:58:39] [INFO ] Deduced a trap composed of 31 places in 101 ms of which 1 ms to minimize.
[2023-03-20 08:58:39] [INFO ] Deduced a trap composed of 27 places in 107 ms of which 0 ms to minimize.
[2023-03-20 08:58:39] [INFO ] Deduced a trap composed of 31 places in 108 ms of which 1 ms to minimize.
[2023-03-20 08:58:39] [INFO ] Deduced a trap composed of 29 places in 102 ms of which 1 ms to minimize.
[2023-03-20 08:58:39] [INFO ] Deduced a trap composed of 33 places in 122 ms of which 1 ms to minimize.
[2023-03-20 08:58:39] [INFO ] Deduced a trap composed of 27 places in 102 ms of which 1 ms to minimize.
[2023-03-20 08:58:39] [INFO ] Deduced a trap composed of 31 places in 127 ms of which 0 ms to minimize.
[2023-03-20 08:58:40] [INFO ] Deduced a trap composed of 16 places in 103 ms of which 0 ms to minimize.
[2023-03-20 08:58:40] [INFO ] Deduced a trap composed of 17 places in 119 ms of which 0 ms to minimize.
[2023-03-20 08:58:40] [INFO ] Deduced a trap composed of 8 places in 105 ms of which 0 ms to minimize.
[2023-03-20 08:58:40] [INFO ] Deduced a trap composed of 15 places in 123 ms of which 0 ms to minimize.
[2023-03-20 08:58:40] [INFO ] Deduced a trap composed of 8 places in 119 ms of which 0 ms to minimize.
[2023-03-20 08:58:40] [INFO ] Deduced a trap composed of 12 places in 137 ms of which 0 ms to minimize.
[2023-03-20 08:58:41] [INFO ] Deduced a trap composed of 12 places in 133 ms of which 0 ms to minimize.
[2023-03-20 08:58:41] [INFO ] Deduced a trap composed of 11 places in 121 ms of which 0 ms to minimize.
[2023-03-20 08:58:41] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 0 ms to minimize.
[2023-03-20 08:58:41] [INFO ] Deduced a trap composed of 11 places in 47 ms of which 1 ms to minimize.
[2023-03-20 08:58:41] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 0 ms to minimize.
[2023-03-20 08:58:41] [INFO ] Trap strengthening (SAT) tested/added 131/130 trap constraints in 20789 ms
[2023-03-20 08:58:41] [INFO ] After 21339ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 65 ms.
[2023-03-20 08:58:41] [INFO ] After 21584ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 29 ms.
Support contains 6 out of 702 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 702/702 places, 951/951 transitions.
Partial Free-agglomeration rule applied 100 times.
Drop transitions removed 100 transitions
Iterating global reduction 0 with 100 rules applied. Total rules applied 100 place count 702 transition count 951
Applied a total of 100 rules in 93 ms. Remains 702 /702 variables (removed 0) and now considering 951/951 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 93 ms. Remains : 702/702 places, 951/951 transitions.
Incomplete random walk after 10000 steps, including 16 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 1) seen :0
Finished Best-First random walk after 8354 steps, including 2 resets, run visited all 1 properties in 25 ms. (steps per millisecond=334 )
Knowledge obtained : [(AND (NOT p2) (NOT p0) p1 (NOT p3)), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (NOT (AND (NOT p2) p3))), (X (NOT (AND p0 (NOT p1) p3))), (X (NOT p2)), (X (OR p2 (NOT p3))), (X (NOT (AND p0 (NOT p1) (NOT p3)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (X (X (NOT (AND (NOT p2) p3)))), (X (X (NOT (AND p0 (NOT p1) p3)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p3)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3))))), (X (X (OR p2 (NOT p3)))), (X (X (NOT (AND p0 (NOT p1) (NOT p3)))))]
False Knowledge obtained : [(F (AND p0 (NOT p1) p3)), (F (AND p3 (NOT p2))), (F (AND p0 (NOT p1) (NOT p3))), (F (NOT (OR (NOT p3) p2))), (F p2), (F (NOT p1)), (F (AND p0 (NOT p1))), (F (AND (NOT p0) (NOT p1) (NOT p3))), (F (AND (NOT p0) (NOT p1) p3))]
Knowledge based reduction with 17 factoid took 1095 ms. Reduced automaton from 4 states, 10 edges and 4 AP (stutter insensitive) to 4 states, 10 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 153 ms :[(AND p0 (NOT p1)), (NOT p1), (AND p0 (NOT p1) p3), (AND (NOT p1) (NOT p0) p3)]
Stuttering acceptance computed with spot in 188 ms :[(AND p0 (NOT p1)), (NOT p1), (AND p0 (NOT p1) p3), (AND (NOT p1) (NOT p0) p3)]
Support contains 6 out of 702 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 702/702 places, 951/951 transitions.
Applied a total of 0 rules in 22 ms. Remains 702 /702 variables (removed 0) and now considering 951/951 (removed 0) transitions.
[2023-03-20 08:58:43] [INFO ] Invariant cache hit.
[2023-03-20 08:58:43] [INFO ] Implicit Places using invariants in 347 ms returned []
[2023-03-20 08:58:43] [INFO ] Invariant cache hit.
[2023-03-20 08:58:44] [INFO ] Implicit Places using invariants and state equation in 719 ms returned []
Implicit Place search using SMT with State Equation took 1082 ms to find 0 implicit places.
[2023-03-20 08:58:44] [INFO ] Redundant transitions in 202 ms returned []
[2023-03-20 08:58:44] [INFO ] Invariant cache hit.
[2023-03-20 08:58:45] [INFO ] Dead Transitions using invariants and state equation in 604 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1934 ms. Remains : 702/702 places, 951/951 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p0) p1 (NOT p3)), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (NOT (AND p0 (NOT p1) p3))), (X (OR (NOT p3) p2)), (X (NOT p2)), (X (NOT (AND p3 (NOT p2)))), (X (NOT (AND p0 (NOT p1) (NOT p3)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (X (X (NOT (AND p0 (NOT p1) p3)))), (X (X (OR (NOT p3) p2))), (X (X (NOT p2))), (X (X (NOT (AND p3 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) p3)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3))))), (X (X (NOT (AND p0 (NOT p1) (NOT p3)))))]
False Knowledge obtained : []
Knowledge based reduction with 17 factoid took 533 ms. Reduced automaton from 4 states, 10 edges and 4 AP (stutter insensitive) to 4 states, 10 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 132 ms :[(AND p0 (NOT p1)), (NOT p1), (AND p0 (NOT p1) p3), (AND (NOT p1) (NOT p0) p3)]
Incomplete random walk after 10000 steps, including 15 resets, run finished after 193 ms. (steps per millisecond=51 ) properties (out of 9) seen :7
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-20 08:58:46] [INFO ] Invariant cache hit.
[2023-03-20 08:58:46] [INFO ] After 133ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 08:58:46] [INFO ] [Nat]Absence check using 201 positive place invariants in 28 ms returned sat
[2023-03-20 08:58:47] [INFO ] After 577ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 08:58:47] [INFO ] Deduced a trap composed of 14 places in 123 ms of which 1 ms to minimize.
[2023-03-20 08:58:47] [INFO ] Deduced a trap composed of 12 places in 135 ms of which 1 ms to minimize.
[2023-03-20 08:58:47] [INFO ] Deduced a trap composed of 7 places in 134 ms of which 0 ms to minimize.
[2023-03-20 08:58:47] [INFO ] Deduced a trap composed of 7 places in 138 ms of which 0 ms to minimize.
[2023-03-20 08:58:47] [INFO ] Deduced a trap composed of 11 places in 121 ms of which 0 ms to minimize.
[2023-03-20 08:58:48] [INFO ] Deduced a trap composed of 13 places in 166 ms of which 0 ms to minimize.
[2023-03-20 08:58:48] [INFO ] Deduced a trap composed of 12 places in 138 ms of which 1 ms to minimize.
[2023-03-20 08:58:48] [INFO ] Deduced a trap composed of 8 places in 139 ms of which 1 ms to minimize.
[2023-03-20 08:58:48] [INFO ] Deduced a trap composed of 12 places in 153 ms of which 0 ms to minimize.
[2023-03-20 08:58:48] [INFO ] Deduced a trap composed of 11 places in 120 ms of which 1 ms to minimize.
[2023-03-20 08:58:48] [INFO ] Deduced a trap composed of 11 places in 157 ms of which 1 ms to minimize.
[2023-03-20 08:58:49] [INFO ] Deduced a trap composed of 24 places in 119 ms of which 1 ms to minimize.
[2023-03-20 08:58:49] [INFO ] Deduced a trap composed of 17 places in 117 ms of which 0 ms to minimize.
[2023-03-20 08:58:49] [INFO ] Deduced a trap composed of 23 places in 152 ms of which 0 ms to minimize.
[2023-03-20 08:58:49] [INFO ] Deduced a trap composed of 16 places in 117 ms of which 0 ms to minimize.
[2023-03-20 08:58:49] [INFO ] Deduced a trap composed of 24 places in 111 ms of which 0 ms to minimize.
[2023-03-20 08:58:49] [INFO ] Deduced a trap composed of 23 places in 109 ms of which 0 ms to minimize.
[2023-03-20 08:58:50] [INFO ] Deduced a trap composed of 11 places in 111 ms of which 0 ms to minimize.
[2023-03-20 08:58:50] [INFO ] Deduced a trap composed of 24 places in 152 ms of which 1 ms to minimize.
[2023-03-20 08:58:50] [INFO ] Deduced a trap composed of 18 places in 112 ms of which 0 ms to minimize.
[2023-03-20 08:58:50] [INFO ] Deduced a trap composed of 23 places in 124 ms of which 1 ms to minimize.
[2023-03-20 08:58:50] [INFO ] Deduced a trap composed of 23 places in 124 ms of which 0 ms to minimize.
[2023-03-20 08:58:50] [INFO ] Deduced a trap composed of 12 places in 124 ms of which 1 ms to minimize.
[2023-03-20 08:58:51] [INFO ] Deduced a trap composed of 11 places in 129 ms of which 0 ms to minimize.
[2023-03-20 08:58:51] [INFO ] Deduced a trap composed of 7 places in 135 ms of which 1 ms to minimize.
[2023-03-20 08:58:51] [INFO ] Deduced a trap composed of 8 places in 155 ms of which 0 ms to minimize.
[2023-03-20 08:58:51] [INFO ] Deduced a trap composed of 11 places in 161 ms of which 0 ms to minimize.
[2023-03-20 08:58:51] [INFO ] Deduced a trap composed of 11 places in 143 ms of which 1 ms to minimize.
[2023-03-20 08:58:51] [INFO ] Deduced a trap composed of 12 places in 154 ms of which 0 ms to minimize.
[2023-03-20 08:58:52] [INFO ] Deduced a trap composed of 11 places in 155 ms of which 0 ms to minimize.
[2023-03-20 08:58:52] [INFO ] Deduced a trap composed of 11 places in 152 ms of which 1 ms to minimize.
[2023-03-20 08:58:52] [INFO ] Deduced a trap composed of 12 places in 151 ms of which 0 ms to minimize.
[2023-03-20 08:58:52] [INFO ] Deduced a trap composed of 8 places in 150 ms of which 0 ms to minimize.
[2023-03-20 08:58:52] [INFO ] Deduced a trap composed of 8 places in 151 ms of which 1 ms to minimize.
[2023-03-20 08:58:53] [INFO ] Deduced a trap composed of 9 places in 150 ms of which 0 ms to minimize.
[2023-03-20 08:58:53] [INFO ] Deduced a trap composed of 11 places in 141 ms of which 1 ms to minimize.
[2023-03-20 08:58:53] [INFO ] Deduced a trap composed of 8 places in 147 ms of which 0 ms to minimize.
[2023-03-20 08:58:53] [INFO ] Deduced a trap composed of 11 places in 180 ms of which 0 ms to minimize.
[2023-03-20 08:58:53] [INFO ] Deduced a trap composed of 12 places in 193 ms of which 1 ms to minimize.
[2023-03-20 08:58:54] [INFO ] Deduced a trap composed of 11 places in 163 ms of which 1 ms to minimize.
[2023-03-20 08:58:54] [INFO ] Deduced a trap composed of 8 places in 218 ms of which 0 ms to minimize.
[2023-03-20 08:58:54] [INFO ] Deduced a trap composed of 9 places in 201 ms of which 1 ms to minimize.
[2023-03-20 08:58:54] [INFO ] Deduced a trap composed of 12 places in 164 ms of which 1 ms to minimize.
[2023-03-20 08:58:54] [INFO ] Deduced a trap composed of 11 places in 136 ms of which 1 ms to minimize.
[2023-03-20 08:58:55] [INFO ] Deduced a trap composed of 12 places in 178 ms of which 1 ms to minimize.
[2023-03-20 08:58:55] [INFO ] Deduced a trap composed of 11 places in 181 ms of which 0 ms to minimize.
[2023-03-20 08:58:55] [INFO ] Deduced a trap composed of 12 places in 164 ms of which 0 ms to minimize.
[2023-03-20 08:58:55] [INFO ] Deduced a trap composed of 12 places in 159 ms of which 0 ms to minimize.
[2023-03-20 08:58:55] [INFO ] Deduced a trap composed of 8 places in 183 ms of which 1 ms to minimize.
[2023-03-20 08:58:56] [INFO ] Deduced a trap composed of 21 places in 156 ms of which 0 ms to minimize.
[2023-03-20 08:58:56] [INFO ] Deduced a trap composed of 21 places in 171 ms of which 1 ms to minimize.
[2023-03-20 08:58:56] [INFO ] Deduced a trap composed of 21 places in 175 ms of which 1 ms to minimize.
[2023-03-20 08:58:56] [INFO ] Deduced a trap composed of 21 places in 181 ms of which 1 ms to minimize.
[2023-03-20 08:58:56] [INFO ] Deduced a trap composed of 21 places in 178 ms of which 0 ms to minimize.
[2023-03-20 08:58:57] [INFO ] Deduced a trap composed of 23 places in 152 ms of which 1 ms to minimize.
[2023-03-20 08:58:57] [INFO ] Deduced a trap composed of 21 places in 155 ms of which 1 ms to minimize.
[2023-03-20 08:58:57] [INFO ] Deduced a trap composed of 23 places in 175 ms of which 1 ms to minimize.
[2023-03-20 08:58:57] [INFO ] Deduced a trap composed of 23 places in 156 ms of which 0 ms to minimize.
[2023-03-20 08:58:57] [INFO ] Deduced a trap composed of 23 places in 149 ms of which 1 ms to minimize.
[2023-03-20 08:58:58] [INFO ] Deduced a trap composed of 11 places in 171 ms of which 0 ms to minimize.
[2023-03-20 08:58:58] [INFO ] Deduced a trap composed of 23 places in 148 ms of which 0 ms to minimize.
[2023-03-20 08:58:58] [INFO ] Deduced a trap composed of 23 places in 151 ms of which 1 ms to minimize.
[2023-03-20 08:58:58] [INFO ] Deduced a trap composed of 23 places in 152 ms of which 0 ms to minimize.
[2023-03-20 08:58:58] [INFO ] Deduced a trap composed of 11 places in 149 ms of which 0 ms to minimize.
[2023-03-20 08:58:58] [INFO ] Deduced a trap composed of 15 places in 121 ms of which 0 ms to minimize.
[2023-03-20 08:58:59] [INFO ] Deduced a trap composed of 11 places in 126 ms of which 1 ms to minimize.
[2023-03-20 08:58:59] [INFO ] Deduced a trap composed of 11 places in 127 ms of which 0 ms to minimize.
[2023-03-20 08:58:59] [INFO ] Deduced a trap composed of 11 places in 138 ms of which 1 ms to minimize.
[2023-03-20 08:58:59] [INFO ] Deduced a trap composed of 17 places in 124 ms of which 0 ms to minimize.
[2023-03-20 08:58:59] [INFO ] Deduced a trap composed of 16 places in 124 ms of which 0 ms to minimize.
[2023-03-20 08:58:59] [INFO ] Deduced a trap composed of 17 places in 121 ms of which 1 ms to minimize.
[2023-03-20 08:59:00] [INFO ] Deduced a trap composed of 16 places in 120 ms of which 0 ms to minimize.
[2023-03-20 08:59:00] [INFO ] Deduced a trap composed of 23 places in 136 ms of which 1 ms to minimize.
[2023-03-20 08:59:00] [INFO ] Deduced a trap composed of 23 places in 170 ms of which 1 ms to minimize.
[2023-03-20 08:59:00] [INFO ] Deduced a trap composed of 23 places in 140 ms of which 0 ms to minimize.
[2023-03-20 08:59:00] [INFO ] Deduced a trap composed of 23 places in 131 ms of which 1 ms to minimize.
[2023-03-20 08:59:00] [INFO ] Deduced a trap composed of 23 places in 130 ms of which 1 ms to minimize.
[2023-03-20 08:59:01] [INFO ] Deduced a trap composed of 23 places in 130 ms of which 1 ms to minimize.
[2023-03-20 08:59:01] [INFO ] Deduced a trap composed of 23 places in 131 ms of which 1 ms to minimize.
[2023-03-20 08:59:01] [INFO ] Deduced a trap composed of 8 places in 131 ms of which 0 ms to minimize.
[2023-03-20 08:59:01] [INFO ] Deduced a trap composed of 23 places in 131 ms of which 0 ms to minimize.
[2023-03-20 08:59:01] [INFO ] Deduced a trap composed of 11 places in 135 ms of which 0 ms to minimize.
[2023-03-20 08:59:01] [INFO ] Deduced a trap composed of 23 places in 135 ms of which 0 ms to minimize.
[2023-03-20 08:59:02] [INFO ] Deduced a trap composed of 23 places in 142 ms of which 0 ms to minimize.
[2023-03-20 08:59:02] [INFO ] Deduced a trap composed of 23 places in 145 ms of which 0 ms to minimize.
[2023-03-20 08:59:02] [INFO ] Deduced a trap composed of 16 places in 134 ms of which 1 ms to minimize.
[2023-03-20 08:59:02] [INFO ] Deduced a trap composed of 15 places in 155 ms of which 1 ms to minimize.
[2023-03-20 08:59:02] [INFO ] Deduced a trap composed of 16 places in 142 ms of which 1 ms to minimize.
[2023-03-20 08:59:03] [INFO ] Deduced a trap composed of 15 places in 128 ms of which 0 ms to minimize.
[2023-03-20 08:59:03] [INFO ] Deduced a trap composed of 17 places in 138 ms of which 0 ms to minimize.
[2023-03-20 08:59:03] [INFO ] Deduced a trap composed of 19 places in 140 ms of which 0 ms to minimize.
[2023-03-20 08:59:03] [INFO ] Deduced a trap composed of 19 places in 132 ms of which 0 ms to minimize.
[2023-03-20 08:59:03] [INFO ] Deduced a trap composed of 15 places in 121 ms of which 1 ms to minimize.
[2023-03-20 08:59:03] [INFO ] Deduced a trap composed of 15 places in 137 ms of which 1 ms to minimize.
[2023-03-20 08:59:03] [INFO ] Deduced a trap composed of 27 places in 126 ms of which 1 ms to minimize.
[2023-03-20 08:59:04] [INFO ] Deduced a trap composed of 27 places in 128 ms of which 0 ms to minimize.
[2023-03-20 08:59:04] [INFO ] Deduced a trap composed of 22 places in 139 ms of which 1 ms to minimize.
[2023-03-20 08:59:04] [INFO ] Deduced a trap composed of 24 places in 130 ms of which 1 ms to minimize.
[2023-03-20 08:59:04] [INFO ] Deduced a trap composed of 24 places in 125 ms of which 1 ms to minimize.
[2023-03-20 08:59:04] [INFO ] Deduced a trap composed of 32 places in 122 ms of which 0 ms to minimize.
[2023-03-20 08:59:04] [INFO ] Deduced a trap composed of 32 places in 121 ms of which 0 ms to minimize.
[2023-03-20 08:59:05] [INFO ] Deduced a trap composed of 17 places in 122 ms of which 0 ms to minimize.
[2023-03-20 08:59:05] [INFO ] Deduced a trap composed of 19 places in 121 ms of which 1 ms to minimize.
[2023-03-20 08:59:05] [INFO ] Deduced a trap composed of 19 places in 135 ms of which 1 ms to minimize.
[2023-03-20 08:59:05] [INFO ] Deduced a trap composed of 27 places in 194 ms of which 1 ms to minimize.
[2023-03-20 08:59:05] [INFO ] Deduced a trap composed of 27 places in 139 ms of which 0 ms to minimize.
[2023-03-20 08:59:06] [INFO ] Deduced a trap composed of 22 places in 145 ms of which 0 ms to minimize.
[2023-03-20 08:59:06] [INFO ] Deduced a trap composed of 24 places in 147 ms of which 0 ms to minimize.
[2023-03-20 08:59:06] [INFO ] Deduced a trap composed of 24 places in 134 ms of which 1 ms to minimize.
[2023-03-20 08:59:06] [INFO ] Deduced a trap composed of 32 places in 131 ms of which 0 ms to minimize.
[2023-03-20 08:59:06] [INFO ] Deduced a trap composed of 32 places in 133 ms of which 0 ms to minimize.
[2023-03-20 08:59:06] [INFO ] Deduced a trap composed of 24 places in 124 ms of which 1 ms to minimize.
[2023-03-20 08:59:06] [INFO ] Deduced a trap composed of 24 places in 127 ms of which 0 ms to minimize.
[2023-03-20 08:59:07] [INFO ] Deduced a trap composed of 32 places in 142 ms of which 0 ms to minimize.
[2023-03-20 08:59:07] [INFO ] Deduced a trap composed of 22 places in 139 ms of which 0 ms to minimize.
[2023-03-20 08:59:07] [INFO ] Deduced a trap composed of 32 places in 118 ms of which 0 ms to minimize.
[2023-03-20 08:59:07] [INFO ] Deduced a trap composed of 22 places in 156 ms of which 0 ms to minimize.
[2023-03-20 08:59:07] [INFO ] Deduced a trap composed of 24 places in 128 ms of which 0 ms to minimize.
[2023-03-20 08:59:07] [INFO ] Deduced a trap composed of 24 places in 130 ms of which 0 ms to minimize.
[2023-03-20 08:59:08] [INFO ] Deduced a trap composed of 32 places in 121 ms of which 1 ms to minimize.
[2023-03-20 08:59:08] [INFO ] Deduced a trap composed of 32 places in 134 ms of which 1 ms to minimize.
[2023-03-20 08:59:08] [INFO ] Deduced a trap composed of 19 places in 138 ms of which 0 ms to minimize.
[2023-03-20 08:59:08] [INFO ] Deduced a trap composed of 23 places in 124 ms of which 0 ms to minimize.
[2023-03-20 08:59:08] [INFO ] Deduced a trap composed of 23 places in 138 ms of which 0 ms to minimize.
[2023-03-20 08:59:08] [INFO ] Deduced a trap composed of 31 places in 126 ms of which 1 ms to minimize.
[2023-03-20 08:59:09] [INFO ] Deduced a trap composed of 31 places in 180 ms of which 0 ms to minimize.
[2023-03-20 08:59:09] [INFO ] Deduced a trap composed of 19 places in 143 ms of which 0 ms to minimize.
[2023-03-20 08:59:09] [INFO ] Deduced a trap composed of 23 places in 123 ms of which 1 ms to minimize.
[2023-03-20 08:59:09] [INFO ] Deduced a trap composed of 23 places in 137 ms of which 0 ms to minimize.
[2023-03-20 08:59:09] [INFO ] Deduced a trap composed of 31 places in 120 ms of which 1 ms to minimize.
[2023-03-20 08:59:10] [INFO ] Deduced a trap composed of 31 places in 167 ms of which 0 ms to minimize.
[2023-03-20 08:59:10] [INFO ] Deduced a trap composed of 19 places in 149 ms of which 0 ms to minimize.
[2023-03-20 08:59:10] [INFO ] Deduced a trap composed of 23 places in 139 ms of which 0 ms to minimize.
[2023-03-20 08:59:10] [INFO ] Deduced a trap composed of 23 places in 146 ms of which 0 ms to minimize.
[2023-03-20 08:59:10] [INFO ] Deduced a trap composed of 31 places in 129 ms of which 0 ms to minimize.
[2023-03-20 08:59:10] [INFO ] Deduced a trap composed of 31 places in 132 ms of which 0 ms to minimize.
[2023-03-20 08:59:11] [INFO ] Deduced a trap composed of 19 places in 142 ms of which 0 ms to minimize.
[2023-03-20 08:59:11] [INFO ] Deduced a trap composed of 23 places in 130 ms of which 0 ms to minimize.
[2023-03-20 08:59:11] [INFO ] Deduced a trap composed of 23 places in 120 ms of which 0 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-20 08:59:11] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-20 08:59:11] [INFO ] After 25119ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 10 ms.
Support contains 6 out of 702 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 702/702 places, 951/951 transitions.
Partial Free-agglomeration rule applied 100 times.
Drop transitions removed 100 transitions
Iterating global reduction 0 with 100 rules applied. Total rules applied 100 place count 702 transition count 951
Applied a total of 100 rules in 48 ms. Remains 702 /702 variables (removed 0) and now considering 951/951 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48 ms. Remains : 702/702 places, 951/951 transitions.
Incomplete random walk after 10000 steps, including 17 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 1) seen :0
Finished Best-First random walk after 1638 steps, including 0 resets, run visited all 1 properties in 6 ms. (steps per millisecond=273 )
Knowledge obtained : [(AND (NOT p2) (NOT p0) p1 (NOT p3)), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (NOT (AND p0 (NOT p1) p3))), (X (OR (NOT p3) p2)), (X (NOT p2)), (X (NOT (AND p3 (NOT p2)))), (X (NOT (AND p0 (NOT p1) (NOT p3)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (X (X (NOT (AND p0 (NOT p1) p3)))), (X (X (OR (NOT p3) p2))), (X (X (NOT p2))), (X (X (NOT (AND p3 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) p3)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3))))), (X (X (NOT (AND p0 (NOT p1) (NOT p3)))))]
False Knowledge obtained : [(F (AND p0 (NOT p1) p3)), (F (AND p3 (NOT p2))), (F (AND p0 (NOT p1) (NOT p3))), (F (NOT (OR (NOT p3) p2))), (F p2), (F (NOT p1)), (F (AND p0 (NOT p1))), (F (AND (NOT p0) (NOT p1) (NOT p3))), (F (AND (NOT p0) (NOT p1) p3))]
Knowledge based reduction with 17 factoid took 1033 ms. Reduced automaton from 4 states, 10 edges and 4 AP (stutter insensitive) to 4 states, 10 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 232 ms :[(AND p0 (NOT p1)), (NOT p1), (AND p0 (NOT p1) p3), (AND (NOT p1) (NOT p0) p3)]
Stuttering acceptance computed with spot in 228 ms :[(AND p0 (NOT p1)), (NOT p1), (AND p0 (NOT p1) p3), (AND (NOT p1) (NOT p0) p3)]
Stuttering acceptance computed with spot in 196 ms :[(AND p0 (NOT p1)), (NOT p1), (AND p0 (NOT p1) p3), (AND (NOT p1) (NOT p0) p3)]
Product exploration explored 100000 steps with 159 reset in 648 ms.
Product exploration explored 100000 steps with 165 reset in 761 ms.
Support contains 6 out of 702 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 702/702 places, 951/951 transitions.
Applied a total of 0 rules in 19 ms. Remains 702 /702 variables (removed 0) and now considering 951/951 (removed 0) transitions.
[2023-03-20 08:59:14] [INFO ] Invariant cache hit.
[2023-03-20 08:59:15] [INFO ] Implicit Places using invariants in 503 ms returned []
[2023-03-20 08:59:15] [INFO ] Invariant cache hit.
[2023-03-20 08:59:15] [INFO ] Implicit Places using invariants and state equation in 712 ms returned []
Implicit Place search using SMT with State Equation took 1250 ms to find 0 implicit places.
[2023-03-20 08:59:16] [INFO ] Redundant transitions in 136 ms returned []
[2023-03-20 08:59:16] [INFO ] Invariant cache hit.
[2023-03-20 08:59:16] [INFO ] Dead Transitions using invariants and state equation in 442 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1866 ms. Remains : 702/702 places, 951/951 transitions.
Treatment of property ShieldRVs-PT-050A-LTLFireability-13 finished in 61868 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p0 U X(G(p1)))&&F(p2))))'
Support contains 12 out of 703 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 703/703 places, 953/953 transitions.
Applied a total of 0 rules in 11 ms. Remains 703 /703 variables (removed 0) and now considering 953/953 (removed 0) transitions.
// Phase 1: matrix 953 rows 703 cols
[2023-03-20 08:59:16] [INFO ] Computed 201 place invariants in 3 ms
[2023-03-20 08:59:17] [INFO ] Implicit Places using invariants in 403 ms returned []
[2023-03-20 08:59:17] [INFO ] Invariant cache hit.
[2023-03-20 08:59:17] [INFO ] Implicit Places using invariants and state equation in 724 ms returned []
Implicit Place search using SMT with State Equation took 1131 ms to find 0 implicit places.
[2023-03-20 08:59:17] [INFO ] Invariant cache hit.
[2023-03-20 08:59:18] [INFO ] Dead Transitions using invariants and state equation in 440 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1585 ms. Remains : 703/703 places, 953/953 transitions.
Stuttering acceptance computed with spot in 160 ms :[(OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (NOT p1), (NOT p2), (NOT p1), true]
Running random walk in product with property : ShieldRVs-PT-050A-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(NOT p2), acceptance={} source=1 dest: 3}, { cond=p0, acceptance={} source=1 dest: 4}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={} source=2 dest: 5}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 2}, { cond=(AND p0 p1), acceptance={} source=4 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={0} source=4 dest: 4}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(AND (EQ s423 1) (EQ s438 1) (EQ s449 1) (EQ s383 1) (EQ s385 1) (EQ s390 1)), p2:(AND (EQ s202 1) (EQ s203 1) (EQ s207 1)), p1:(AND (EQ s454 1) (EQ s4...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 674 steps with 0 reset in 4 ms.
FORMULA ShieldRVs-PT-050A-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-050A-LTLFireability-14 finished in 1782 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((!p0 U (p1||G(!p0)))&&X((!p2 U (G(!p2)||(!p2&&(X(p3)||F(!p4)))))))))'
Support contains 11 out of 703 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 703/703 places, 953/953 transitions.
Applied a total of 0 rules in 8 ms. Remains 703 /703 variables (removed 0) and now considering 953/953 (removed 0) transitions.
[2023-03-20 08:59:18] [INFO ] Invariant cache hit.
[2023-03-20 08:59:18] [INFO ] Implicit Places using invariants in 367 ms returned []
[2023-03-20 08:59:18] [INFO ] Invariant cache hit.
[2023-03-20 08:59:19] [INFO ] Implicit Places using invariants and state equation in 656 ms returned []
Implicit Place search using SMT with State Equation took 1024 ms to find 0 implicit places.
[2023-03-20 08:59:19] [INFO ] Invariant cache hit.
[2023-03-20 08:59:19] [INFO ] Dead Transitions using invariants and state equation in 433 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1466 ms. Remains : 703/703 places, 953/953 transitions.
Stuttering acceptance computed with spot in 229 ms :[(OR p2 (AND p0 (NOT p1))), (OR p2 (AND p0 (NOT p1))), true, (AND (NOT p1) p0), p2, (AND p4 p2 (NOT p3)), p4]
Running random walk in product with property : ShieldRVs-PT-050A-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 3}, { cond=(OR p1 (NOT p0)), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 3}], [{ cond=p2, acceptance={} source=4 dest: 2}, { cond=(AND p4 (NOT p2)), acceptance={} source=4 dest: 5}], [{ cond=(AND p4 (NOT p2) (NOT p3)), acceptance={} source=5 dest: 5}, { cond=(AND p4 p2 (NOT p3)), acceptance={} source=5 dest: 6}], [{ cond=p4, acceptance={0} source=6 dest: 6}]], initial=0, aps=[p1:(AND (NOT (AND (EQ s652 1) (EQ s657 1))) (NOT (AND (EQ s106 1) (EQ s111 1)))), p0:(AND (EQ s106 1) (EQ s111 1)), p2:(EQ s109 1), p4:(AND (EQ s684 1) (E...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 2025 ms.
Product exploration explored 100000 steps with 33333 reset in 2061 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p1 (NOT p0) (NOT p2) (NOT p4) (NOT p3)), (X (OR p1 (NOT p0))), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT p2))), true, (X (X (NOT (AND p4 (NOT p2))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X (NOT (AND p4 (NOT p2)))))
Knowledge based reduction with 9 factoid took 268 ms. Reduced automaton from 7 states, 12 edges and 5 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldRVs-PT-050A-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldRVs-PT-050A-LTLFireability-15 finished in 6078 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((!p0||F(p1)) U (G((!p0||F(p1)))||((!p0||F(p1))&&X(G(!p3))&&p2))))'
[2023-03-20 08:59:24] [INFO ] Flatten gal took : 109 ms
[2023-03-20 08:59:24] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2023-03-20 08:59:24] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 703 places, 953 transitions and 4600 arcs took 13 ms.
Total runtime 308781 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/5341/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : ShieldRVs-PT-050A-LTLFireability-13

BK_STOP 1679302765634

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2023
ltl formula name ShieldRVs-PT-050A-LTLFireability-13
ltl formula formula --ltl=/tmp/5341/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 703 places, 953 transitions and 4600 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/5341/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/5341/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/5341/ltl_0_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.230 real 0.030 user 0.050 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/5341/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted

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="ShieldRVs-PT-050A"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
echo " Input is ShieldRVs-PT-050A, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r425-tajo-167905977800148"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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