fond
Model Checking Contest 2022
12th edition, Bergen, Norway, June 21, 2022
Execution of r168-tall-165277016200074
Last Updated
Jun 22, 2022

About the Execution of ITS-Tools for Peterson-PT-5

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
16216.483 3600000.00 3035128.00 402529.10 [undef] Time out reached

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r168-tall-165277016200074.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is Peterson-PT-5, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r168-tall-165277016200074
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.2M
-rw-r--r-- 1 mcc users 135K Apr 30 09:33 CTLCardinality.txt
-rw-r--r-- 1 mcc users 571K Apr 30 09:33 CTLCardinality.xml
-rw-r--r-- 1 mcc users 82K Apr 30 09:24 CTLFireability.txt
-rw-r--r-- 1 mcc users 372K Apr 30 09:24 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 68K May 9 08:24 LTLCardinality.txt
-rw-r--r-- 1 mcc users 200K May 9 08:24 LTLCardinality.xml
-rw-r--r-- 1 mcc users 41K May 9 08:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 140K May 9 08:24 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K May 9 08:24 UpperBounds.txt
-rw-r--r-- 1 mcc users 34K May 9 08:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 2 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 535K May 10 09:34 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 Peterson-PT-5-CTLFireability-00
FORMULA_NAME Peterson-PT-5-CTLFireability-01
FORMULA_NAME Peterson-PT-5-CTLFireability-02
FORMULA_NAME Peterson-PT-5-CTLFireability-03
FORMULA_NAME Peterson-PT-5-CTLFireability-04
FORMULA_NAME Peterson-PT-5-CTLFireability-05
FORMULA_NAME Peterson-PT-5-CTLFireability-06
FORMULA_NAME Peterson-PT-5-CTLFireability-07
FORMULA_NAME Peterson-PT-5-CTLFireability-08
FORMULA_NAME Peterson-PT-5-CTLFireability-09
FORMULA_NAME Peterson-PT-5-CTLFireability-10
FORMULA_NAME Peterson-PT-5-CTLFireability-11
FORMULA_NAME Peterson-PT-5-CTLFireability-12
FORMULA_NAME Peterson-PT-5-CTLFireability-13
FORMULA_NAME Peterson-PT-5-CTLFireability-14
FORMULA_NAME Peterson-PT-5-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1652782457076

Running Version 202205111006
[2022-05-17 10:14:18] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-17 10:14:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-17 10:14:18] [INFO ] Load time of PNML (sax parser for PT used): 128 ms
[2022-05-17 10:14:18] [INFO ] Transformed 834 places.
[2022-05-17 10:14:18] [INFO ] Transformed 1242 transitions.
[2022-05-17 10:14:18] [INFO ] Found NUPN structural information;
[2022-05-17 10:14:18] [INFO ] Completing missing partition info from NUPN : creating a component with [IsEndLoop_1_3_5, IsEndLoop_2_1_5, BeginLoop_5_4_3, BeginLoop_3_4_3, BeginLoop_4_4_3, BeginLoop_4_1_5, BeginLoop_3_1_5, BeginLoop_5_1_5, BeginLoop_1_4_5, TestAlone_0_1_4, TestIdentity_1_3_3, TestIdentity_2_3_3, TestIdentity_0_0_2, TestIdentity_1_4_1, TestIdentity_4_4_1, TestIdentity_3_4_1, TestIdentity_5_3_2, TestIdentity_0_4_2, TestIdentity_1_4_2, TestIdentity_3_3_2, TestIdentity_4_3_2, TestIdentity_5_2_2]
[2022-05-17 10:14:18] [INFO ] Parsed PT model containing 834 places and 1242 transitions in 239 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 25 ms.
Support contains 834 out of 834 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 834/834 places, 1242/1242 transitions.
Applied a total of 0 rules in 19 ms. Remains 834 /834 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
[2022-05-17 10:14:18] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
// Phase 1: matrix 1122 rows 834 cols
[2022-05-17 10:14:18] [INFO ] Computed 23 place invariants in 37 ms
[2022-05-17 10:14:19] [INFO ] Implicit Places using invariants in 328 ms returned []
[2022-05-17 10:14:19] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
// Phase 1: matrix 1122 rows 834 cols
[2022-05-17 10:14:19] [INFO ] Computed 23 place invariants in 11 ms
[2022-05-17 10:14:19] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-05-17 10:14:19] [INFO ] Implicit Places using invariants and state equation in 475 ms returned []
Implicit Place search using SMT with State Equation took 828 ms to find 0 implicit places.
[2022-05-17 10:14:19] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
// Phase 1: matrix 1122 rows 834 cols
[2022-05-17 10:14:19] [INFO ] Computed 23 place invariants in 6 ms
[2022-05-17 10:14:20] [INFO ] Dead Transitions using invariants and state equation in 572 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 834/834 places, 1242/1242 transitions.
Support contains 834 out of 834 places after structural reductions.
[2022-05-17 10:14:20] [INFO ] Flatten gal took : 127 ms
[2022-05-17 10:14:20] [INFO ] Flatten gal took : 122 ms
[2022-05-17 10:14:21] [INFO ] Input system was already deterministic with 1242 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 555 ms. (steps per millisecond=18 ) properties (out of 72) seen :41
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 31) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 30) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 29) seen :0
Running SMT prover for 29 properties.
[2022-05-17 10:14:22] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
// Phase 1: matrix 1122 rows 834 cols
[2022-05-17 10:14:22] [INFO ] Computed 23 place invariants in 16 ms
[2022-05-17 10:14:22] [INFO ] [Real]Absence check using 17 positive place invariants in 12 ms returned sat
[2022-05-17 10:14:22] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 2 ms returned sat
[2022-05-17 10:14:24] [INFO ] After 977ms SMT Verify possible using state equation in real domain returned unsat :2 sat :1 real:26
[2022-05-17 10:14:24] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-05-17 10:14:24] [INFO ] After 102ms SMT Verify possible using 205 Read/Feed constraints in real domain returned unsat :2 sat :0 real:27
[2022-05-17 10:14:24] [INFO ] After 1937ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:27
[2022-05-17 10:14:24] [INFO ] [Nat]Absence check using 17 positive place invariants in 14 ms returned sat
[2022-05-17 10:14:24] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 2 ms returned sat
[2022-05-17 10:14:26] [INFO ] After 1333ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :27
[2022-05-17 10:14:27] [INFO ] After 1253ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :2 sat :27
[2022-05-17 10:14:27] [INFO ] Deduced a trap composed of 11 places in 297 ms of which 7 ms to minimize.
[2022-05-17 10:14:28] [INFO ] Deduced a trap composed of 91 places in 292 ms of which 1 ms to minimize.
[2022-05-17 10:14:28] [INFO ] Deduced a trap composed of 36 places in 282 ms of which 1 ms to minimize.
[2022-05-17 10:14:28] [INFO ] Deduced a trap composed of 28 places in 285 ms of which 1 ms to minimize.
[2022-05-17 10:14:29] [INFO ] Deduced a trap composed of 48 places in 279 ms of which 1 ms to minimize.
[2022-05-17 10:14:29] [INFO ] Deduced a trap composed of 56 places in 285 ms of which 1 ms to minimize.
[2022-05-17 10:14:29] [INFO ] Deduced a trap composed of 139 places in 267 ms of which 1 ms to minimize.
[2022-05-17 10:14:30] [INFO ] Deduced a trap composed of 28 places in 272 ms of which 1 ms to minimize.
[2022-05-17 10:14:30] [INFO ] Deduced a trap composed of 28 places in 274 ms of which 1 ms to minimize.
[2022-05-17 10:14:30] [INFO ] Deduced a trap composed of 146 places in 277 ms of which 1 ms to minimize.
[2022-05-17 10:14:31] [INFO ] Deduced a trap composed of 27 places in 275 ms of which 1 ms to minimize.
[2022-05-17 10:14:31] [INFO ] Deduced a trap composed of 11 places in 274 ms of which 0 ms to minimize.
[2022-05-17 10:14:31] [INFO ] Deduced a trap composed of 187 places in 264 ms of which 1 ms to minimize.
[2022-05-17 10:14:32] [INFO ] Deduced a trap composed of 173 places in 268 ms of which 1 ms to minimize.
[2022-05-17 10:14:32] [INFO ] Deduced a trap composed of 27 places in 262 ms of which 0 ms to minimize.
[2022-05-17 10:14:32] [INFO ] Deduced a trap composed of 44 places in 266 ms of which 2 ms to minimize.
[2022-05-17 10:14:33] [INFO ] Deduced a trap composed of 14 places in 259 ms of which 0 ms to minimize.
[2022-05-17 10:14:33] [INFO ] Deduced a trap composed of 39 places in 266 ms of which 0 ms to minimize.
[2022-05-17 10:14:33] [INFO ] Deduced a trap composed of 39 places in 256 ms of which 1 ms to minimize.
[2022-05-17 10:14:34] [INFO ] Deduced a trap composed of 39 places in 274 ms of which 0 ms to minimize.
[2022-05-17 10:14:34] [INFO ] Deduced a trap composed of 74 places in 263 ms of which 0 ms to minimize.
[2022-05-17 10:14:34] [INFO ] Deduced a trap composed of 39 places in 264 ms of which 1 ms to minimize.
[2022-05-17 10:14:34] [INFO ] Deduced a trap composed of 11 places in 238 ms of which 1 ms to minimize.
[2022-05-17 10:14:35] [INFO ] Deduced a trap composed of 27 places in 258 ms of which 1 ms to minimize.
[2022-05-17 10:14:35] [INFO ] Deduced a trap composed of 11 places in 269 ms of which 1 ms to minimize.
[2022-05-17 10:14:36] [INFO ] Deduced a trap composed of 92 places in 242 ms of which 1 ms to minimize.
[2022-05-17 10:14:36] [INFO ] Deduced a trap composed of 48 places in 246 ms of which 1 ms to minimize.
[2022-05-17 10:14:36] [INFO ] Deduced a trap composed of 92 places in 245 ms of which 1 ms to minimize.
[2022-05-17 10:14:37] [INFO ] Deduced a trap composed of 32 places in 238 ms of which 1 ms to minimize.
[2022-05-17 10:14:37] [INFO ] Deduced a trap composed of 117 places in 246 ms of which 1 ms to minimize.
[2022-05-17 10:14:37] [INFO ] Deduced a trap composed of 76 places in 246 ms of which 1 ms to minimize.
[2022-05-17 10:14:37] [INFO ] Deduced a trap composed of 86 places in 240 ms of which 0 ms to minimize.
[2022-05-17 10:14:38] [INFO ] Deduced a trap composed of 40 places in 233 ms of which 1 ms to minimize.
[2022-05-17 10:14:38] [INFO ] Deduced a trap composed of 50 places in 240 ms of which 2 ms to minimize.
[2022-05-17 10:14:38] [INFO ] Deduced a trap composed of 70 places in 246 ms of which 4 ms to minimize.
[2022-05-17 10:14:39] [INFO ] Deduced a trap composed of 52 places in 222 ms of which 0 ms to minimize.
[2022-05-17 10:14:39] [INFO ] Deduced a trap composed of 56 places in 224 ms of which 1 ms to minimize.
[2022-05-17 10:14:39] [INFO ] Deduced a trap composed of 52 places in 216 ms of which 0 ms to minimize.
[2022-05-17 10:14:39] [INFO ] Deduced a trap composed of 77 places in 227 ms of which 0 ms to minimize.
[2022-05-17 10:14:40] [INFO ] Deduced a trap composed of 52 places in 236 ms of which 2 ms to minimize.
[2022-05-17 10:14:40] [INFO ] Deduced a trap composed of 104 places in 178 ms of which 1 ms to minimize.
[2022-05-17 10:14:40] [INFO ] Deduced a trap composed of 108 places in 181 ms of which 1 ms to minimize.
[2022-05-17 10:14:40] [INFO ] Deduced a trap composed of 105 places in 179 ms of which 0 ms to minimize.
[2022-05-17 10:14:41] [INFO ] Deduced a trap composed of 127 places in 133 ms of which 1 ms to minimize.
[2022-05-17 10:14:41] [INFO ] Deduced a trap composed of 196 places in 148 ms of which 1 ms to minimize.
[2022-05-17 10:14:41] [INFO ] Deduced a trap composed of 126 places in 138 ms of which 1 ms to minimize.
[2022-05-17 10:14:41] [INFO ] Trap strengthening (SAT) tested/added 47/46 trap constraints in 13994 ms
[2022-05-17 10:14:41] [INFO ] Deduced a trap composed of 11 places in 226 ms of which 1 ms to minimize.
[2022-05-17 10:14:42] [INFO ] Deduced a trap composed of 65 places in 228 ms of which 1 ms to minimize.
[2022-05-17 10:14:42] [INFO ] Deduced a trap composed of 123 places in 189 ms of which 0 ms to minimize.
[2022-05-17 10:14:42] [INFO ] Deduced a trap composed of 183 places in 191 ms of which 0 ms to minimize.
[2022-05-17 10:14:43] [INFO ] Deduced a trap composed of 93 places in 194 ms of which 1 ms to minimize.
[2022-05-17 10:14:43] [INFO ] Deduced a trap composed of 63 places in 193 ms of which 0 ms to minimize.
[2022-05-17 10:14:43] [INFO ] Deduced a trap composed of 102 places in 191 ms of which 1 ms to minimize.
[2022-05-17 10:14:43] [INFO ] Deduced a trap composed of 63 places in 191 ms of which 1 ms to minimize.
[2022-05-17 10:14:44] [INFO ] Deduced a trap composed of 89 places in 197 ms of which 1 ms to minimize.
[2022-05-17 10:14:44] [INFO ] Deduced a trap composed of 91 places in 198 ms of which 0 ms to minimize.
[2022-05-17 10:14:44] [INFO ] Deduced a trap composed of 89 places in 200 ms of which 1 ms to minimize.
[2022-05-17 10:14:44] [INFO ] Deduced a trap composed of 43 places in 202 ms of which 1 ms to minimize.
[2022-05-17 10:14:45] [INFO ] Deduced a trap composed of 50 places in 219 ms of which 1 ms to minimize.
[2022-05-17 10:14:45] [INFO ] Deduced a trap composed of 31 places in 217 ms of which 0 ms to minimize.
[2022-05-17 10:14:45] [INFO ] Deduced a trap composed of 78 places in 165 ms of which 1 ms to minimize.
[2022-05-17 10:14:46] [INFO ] Deduced a trap composed of 37 places in 184 ms of which 0 ms to minimize.
[2022-05-17 10:14:46] [INFO ] Deduced a trap composed of 115 places in 163 ms of which 1 ms to minimize.
[2022-05-17 10:14:46] [INFO ] Deduced a trap composed of 180 places in 165 ms of which 1 ms to minimize.
[2022-05-17 10:14:46] [INFO ] Deduced a trap composed of 180 places in 166 ms of which 1 ms to minimize.
[2022-05-17 10:14:47] [INFO ] Deduced a trap composed of 40 places in 143 ms of which 0 ms to minimize.
[2022-05-17 10:14:47] [INFO ] Deduced a trap composed of 56 places in 144 ms of which 1 ms to minimize.
[2022-05-17 10:14:47] [INFO ] Deduced a trap composed of 37 places in 192 ms of which 1 ms to minimize.
[2022-05-17 10:14:47] [INFO ] Deduced a trap composed of 89 places in 172 ms of which 0 ms to minimize.
[2022-05-17 10:14:48] [INFO ] Deduced a trap composed of 94 places in 172 ms of which 0 ms to minimize.
[2022-05-17 10:14:48] [INFO ] Deduced a trap composed of 63 places in 171 ms of which 0 ms to minimize.
[2022-05-17 10:14:48] [INFO ] Deduced a trap composed of 63 places in 177 ms of which 1 ms to minimize.
[2022-05-17 10:14:48] [INFO ] Deduced a trap composed of 108 places in 158 ms of which 0 ms to minimize.
[2022-05-17 10:14:49] [INFO ] Deduced a trap composed of 134 places in 154 ms of which 0 ms to minimize.
[2022-05-17 10:14:49] [INFO ] Deduced a trap composed of 106 places in 161 ms of which 0 ms to minimize.
[2022-05-17 10:14:49] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-17 10:14:49] [INFO ] After 25108ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :0 real:27
Fused 29 Parikh solutions to 27 different solutions.
Parikh walk visited 0 properties in 602 ms.
Support contains 103 out of 834 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 834/834 places, 1242/1242 transitions.
Drop transitions removed 315 transitions
Trivial Post-agglo rules discarded 315 transitions
Performed 315 trivial Post agglomeration. Transition count delta: 315
Iterating post reduction 0 with 315 rules applied. Total rules applied 315 place count 834 transition count 927
Reduce places removed 315 places and 0 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Iterating post reduction 1 with 324 rules applied. Total rules applied 639 place count 519 transition count 918
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 648 place count 510 transition count 918
Performed 148 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 148 Pre rules applied. Total rules applied 648 place count 510 transition count 770
Deduced a syphon composed of 148 places in 0 ms
Reduce places removed 148 places and 0 transitions.
Iterating global reduction 3 with 296 rules applied. Total rules applied 944 place count 362 transition count 770
Applied a total of 944 rules in 90 ms. Remains 362 /834 variables (removed 472) and now considering 770/1242 (removed 472) transitions.
Finished structural reductions, in 1 iterations. Remains : 362/834 places, 770/1242 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 259 ms. (steps per millisecond=38 ) properties (out of 27) seen :4
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 23) seen :1
Running SMT prover for 22 properties.
[2022-05-17 10:14:50] [INFO ] Flow matrix only has 650 transitions (discarded 120 similar events)
// Phase 1: matrix 650 rows 362 cols
[2022-05-17 10:14:50] [INFO ] Computed 23 place invariants in 5 ms
[2022-05-17 10:14:50] [INFO ] [Real]Absence check using 17 positive place invariants in 7 ms returned sat
[2022-05-17 10:14:50] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 2 ms returned sat
[2022-05-17 10:14:51] [INFO ] After 920ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:22
[2022-05-17 10:14:51] [INFO ] [Nat]Absence check using 17 positive place invariants in 7 ms returned sat
[2022-05-17 10:14:51] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 2 ms returned sat
[2022-05-17 10:14:52] [INFO ] After 589ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :22
[2022-05-17 10:14:52] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-05-17 10:14:52] [INFO ] After 564ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :22
[2022-05-17 10:14:52] [INFO ] Deduced a trap composed of 10 places in 131 ms of which 0 ms to minimize.
[2022-05-17 10:14:53] [INFO ] Deduced a trap composed of 9 places in 113 ms of which 0 ms to minimize.
[2022-05-17 10:14:53] [INFO ] Deduced a trap composed of 9 places in 115 ms of which 0 ms to minimize.
[2022-05-17 10:14:53] [INFO ] Deduced a trap composed of 80 places in 121 ms of which 1 ms to minimize.
[2022-05-17 10:14:53] [INFO ] Deduced a trap composed of 9 places in 116 ms of which 0 ms to minimize.
[2022-05-17 10:14:53] [INFO ] Deduced a trap composed of 10 places in 119 ms of which 0 ms to minimize.
[2022-05-17 10:14:53] [INFO ] Deduced a trap composed of 73 places in 114 ms of which 0 ms to minimize.
[2022-05-17 10:14:53] [INFO ] Deduced a trap composed of 38 places in 115 ms of which 0 ms to minimize.
[2022-05-17 10:14:54] [INFO ] Deduced a trap composed of 12 places in 110 ms of which 1 ms to minimize.
[2022-05-17 10:14:54] [INFO ] Deduced a trap composed of 29 places in 102 ms of which 0 ms to minimize.
[2022-05-17 10:14:54] [INFO ] Deduced a trap composed of 29 places in 103 ms of which 1 ms to minimize.
[2022-05-17 10:14:54] [INFO ] Deduced a trap composed of 29 places in 109 ms of which 0 ms to minimize.
[2022-05-17 10:14:54] [INFO ] Deduced a trap composed of 29 places in 103 ms of which 1 ms to minimize.
[2022-05-17 10:14:54] [INFO ] Deduced a trap composed of 18 places in 100 ms of which 0 ms to minimize.
[2022-05-17 10:14:54] [INFO ] Deduced a trap composed of 35 places in 93 ms of which 0 ms to minimize.
[2022-05-17 10:14:55] [INFO ] Deduced a trap composed of 49 places in 98 ms of which 0 ms to minimize.
[2022-05-17 10:14:55] [INFO ] Deduced a trap composed of 61 places in 88 ms of which 0 ms to minimize.
[2022-05-17 10:14:55] [INFO ] Deduced a trap composed of 29 places in 96 ms of which 0 ms to minimize.
[2022-05-17 10:14:55] [INFO ] Deduced a trap composed of 34 places in 105 ms of which 0 ms to minimize.
[2022-05-17 10:14:55] [INFO ] Deduced a trap composed of 50 places in 95 ms of which 0 ms to minimize.
[2022-05-17 10:14:55] [INFO ] Deduced a trap composed of 33 places in 102 ms of which 0 ms to minimize.
[2022-05-17 10:14:55] [INFO ] Deduced a trap composed of 56 places in 111 ms of which 1 ms to minimize.
[2022-05-17 10:14:55] [INFO ] Deduced a trap composed of 19 places in 87 ms of which 1 ms to minimize.
[2022-05-17 10:14:56] [INFO ] Deduced a trap composed of 20 places in 91 ms of which 0 ms to minimize.
[2022-05-17 10:14:56] [INFO ] Deduced a trap composed of 68 places in 79 ms of which 1 ms to minimize.
[2022-05-17 10:14:56] [INFO ] Deduced a trap composed of 45 places in 79 ms of which 1 ms to minimize.
[2022-05-17 10:14:56] [INFO ] Deduced a trap composed of 43 places in 72 ms of which 0 ms to minimize.
[2022-05-17 10:14:56] [INFO ] Deduced a trap composed of 35 places in 90 ms of which 1 ms to minimize.
[2022-05-17 10:14:56] [INFO ] Deduced a trap composed of 46 places in 75 ms of which 0 ms to minimize.
[2022-05-17 10:14:56] [INFO ] Deduced a trap composed of 50 places in 71 ms of which 0 ms to minimize.
[2022-05-17 10:14:56] [INFO ] Deduced a trap composed of 35 places in 87 ms of which 0 ms to minimize.
[2022-05-17 10:14:56] [INFO ] Deduced a trap composed of 44 places in 69 ms of which 0 ms to minimize.
[2022-05-17 10:14:57] [INFO ] Deduced a trap composed of 37 places in 73 ms of which 0 ms to minimize.
[2022-05-17 10:14:57] [INFO ] Deduced a trap composed of 40 places in 104 ms of which 1 ms to minimize.
[2022-05-17 10:14:57] [INFO ] Deduced a trap composed of 42 places in 105 ms of which 0 ms to minimize.
[2022-05-17 10:14:57] [INFO ] Deduced a trap composed of 40 places in 111 ms of which 1 ms to minimize.
[2022-05-17 10:14:57] [INFO ] Deduced a trap composed of 40 places in 107 ms of which 0 ms to minimize.
[2022-05-17 10:14:57] [INFO ] Deduced a trap composed of 53 places in 103 ms of which 1 ms to minimize.
[2022-05-17 10:14:57] [INFO ] Deduced a trap composed of 44 places in 92 ms of which 1 ms to minimize.
[2022-05-17 10:14:58] [INFO ] Deduced a trap composed of 33 places in 96 ms of which 1 ms to minimize.
[2022-05-17 10:14:58] [INFO ] Deduced a trap composed of 42 places in 118 ms of which 1 ms to minimize.
[2022-05-17 10:14:58] [INFO ] Deduced a trap composed of 35 places in 109 ms of which 1 ms to minimize.
[2022-05-17 10:14:58] [INFO ] Deduced a trap composed of 28 places in 105 ms of which 1 ms to minimize.
[2022-05-17 10:14:58] [INFO ] Deduced a trap composed of 59 places in 94 ms of which 0 ms to minimize.
[2022-05-17 10:14:58] [INFO ] Deduced a trap composed of 28 places in 96 ms of which 0 ms to minimize.
[2022-05-17 10:14:58] [INFO ] Deduced a trap composed of 22 places in 100 ms of which 0 ms to minimize.
[2022-05-17 10:14:59] [INFO ] Deduced a trap composed of 21 places in 97 ms of which 0 ms to minimize.
[2022-05-17 10:14:59] [INFO ] Deduced a trap composed of 22 places in 104 ms of which 0 ms to minimize.
[2022-05-17 10:14:59] [INFO ] Deduced a trap composed of 10 places in 95 ms of which 0 ms to minimize.
[2022-05-17 10:14:59] [INFO ] Deduced a trap composed of 12 places in 93 ms of which 0 ms to minimize.
[2022-05-17 10:14:59] [INFO ] Deduced a trap composed of 11 places in 94 ms of which 0 ms to minimize.
[2022-05-17 10:14:59] [INFO ] Deduced a trap composed of 42 places in 79 ms of which 0 ms to minimize.
[2022-05-17 10:14:59] [INFO ] Deduced a trap composed of 56 places in 79 ms of which 0 ms to minimize.
[2022-05-17 10:14:59] [INFO ] Deduced a trap composed of 76 places in 87 ms of which 0 ms to minimize.
[2022-05-17 10:15:00] [INFO ] Deduced a trap composed of 45 places in 67 ms of which 0 ms to minimize.
[2022-05-17 10:15:00] [INFO ] Deduced a trap composed of 47 places in 68 ms of which 0 ms to minimize.
[2022-05-17 10:15:00] [INFO ] Deduced a trap composed of 44 places in 65 ms of which 0 ms to minimize.
[2022-05-17 10:15:00] [INFO ] Deduced a trap composed of 43 places in 64 ms of which 1 ms to minimize.
[2022-05-17 10:15:00] [INFO ] Deduced a trap composed of 33 places in 90 ms of which 0 ms to minimize.
[2022-05-17 10:15:00] [INFO ] Deduced a trap composed of 32 places in 83 ms of which 0 ms to minimize.
[2022-05-17 10:15:00] [INFO ] Deduced a trap composed of 33 places in 85 ms of which 0 ms to minimize.
[2022-05-17 10:15:00] [INFO ] Deduced a trap composed of 57 places in 89 ms of which 0 ms to minimize.
[2022-05-17 10:15:00] [INFO ] Deduced a trap composed of 45 places in 87 ms of which 1 ms to minimize.
[2022-05-17 10:15:01] [INFO ] Deduced a trap composed of 42 places in 85 ms of which 1 ms to minimize.
[2022-05-17 10:15:01] [INFO ] Deduced a trap composed of 9 places in 80 ms of which 1 ms to minimize.
[2022-05-17 10:15:01] [INFO ] Deduced a trap composed of 9 places in 79 ms of which 0 ms to minimize.
[2022-05-17 10:15:01] [INFO ] Deduced a trap composed of 22 places in 99 ms of which 0 ms to minimize.
[2022-05-17 10:15:01] [INFO ] Deduced a trap composed of 19 places in 96 ms of which 0 ms to minimize.
[2022-05-17 10:15:01] [INFO ] Deduced a trap composed of 19 places in 103 ms of which 1 ms to minimize.
[2022-05-17 10:15:02] [INFO ] Deduced a trap composed of 56 places in 93 ms of which 1 ms to minimize.
[2022-05-17 10:15:02] [INFO ] Deduced a trap composed of 54 places in 85 ms of which 0 ms to minimize.
[2022-05-17 10:15:02] [INFO ] Deduced a trap composed of 33 places in 62 ms of which 0 ms to minimize.
[2022-05-17 10:15:02] [INFO ] Deduced a trap composed of 33 places in 65 ms of which 0 ms to minimize.
[2022-05-17 10:15:02] [INFO ] Deduced a trap composed of 45 places in 95 ms of which 0 ms to minimize.
[2022-05-17 10:15:02] [INFO ] Deduced a trap composed of 62 places in 86 ms of which 1 ms to minimize.
[2022-05-17 10:15:02] [INFO ] Deduced a trap composed of 57 places in 86 ms of which 1 ms to minimize.
[2022-05-17 10:15:02] [INFO ] Deduced a trap composed of 60 places in 70 ms of which 0 ms to minimize.
[2022-05-17 10:15:03] [INFO ] Deduced a trap composed of 33 places in 99 ms of which 0 ms to minimize.
[2022-05-17 10:15:03] [INFO ] Deduced a trap composed of 57 places in 77 ms of which 0 ms to minimize.
[2022-05-17 10:15:03] [INFO ] Deduced a trap composed of 44 places in 80 ms of which 0 ms to minimize.
[2022-05-17 10:15:03] [INFO ] Deduced a trap composed of 21 places in 93 ms of which 0 ms to minimize.
[2022-05-17 10:15:03] [INFO ] Deduced a trap composed of 31 places in 87 ms of which 1 ms to minimize.
[2022-05-17 10:15:03] [INFO ] Deduced a trap composed of 40 places in 89 ms of which 0 ms to minimize.
[2022-05-17 10:15:03] [INFO ] Deduced a trap composed of 30 places in 88 ms of which 0 ms to minimize.
[2022-05-17 10:15:04] [INFO ] Deduced a trap composed of 10 places in 105 ms of which 0 ms to minimize.
[2022-05-17 10:15:05] [INFO ] Deduced a trap composed of 16 places in 103 ms of which 0 ms to minimize.
[2022-05-17 10:15:05] [INFO ] Deduced a trap composed of 12 places in 106 ms of which 0 ms to minimize.
[2022-05-17 10:15:05] [INFO ] Deduced a trap composed of 21 places in 97 ms of which 1 ms to minimize.
[2022-05-17 10:15:05] [INFO ] Trap strengthening (SAT) tested/added 89/88 trap constraints in 12631 ms
[2022-05-17 10:15:05] [INFO ] Deduced a trap composed of 39 places in 73 ms of which 1 ms to minimize.
[2022-05-17 10:15:05] [INFO ] Deduced a trap composed of 41 places in 70 ms of which 0 ms to minimize.
[2022-05-17 10:15:05] [INFO ] Deduced a trap composed of 54 places in 67 ms of which 0 ms to minimize.
[2022-05-17 10:15:05] [INFO ] Deduced a trap composed of 39 places in 68 ms of which 0 ms to minimize.
[2022-05-17 10:15:06] [INFO ] Deduced a trap composed of 58 places in 93 ms of which 1 ms to minimize.
[2022-05-17 10:15:06] [INFO ] Deduced a trap composed of 18 places in 90 ms of which 1 ms to minimize.
[2022-05-17 10:15:06] [INFO ] Deduced a trap composed of 25 places in 82 ms of which 0 ms to minimize.
[2022-05-17 10:15:06] [INFO ] Deduced a trap composed of 18 places in 83 ms of which 0 ms to minimize.
[2022-05-17 10:15:06] [INFO ] Deduced a trap composed of 20 places in 92 ms of which 0 ms to minimize.
[2022-05-17 10:15:06] [INFO ] Deduced a trap composed of 29 places in 89 ms of which 1 ms to minimize.
[2022-05-17 10:15:07] [INFO ] Deduced a trap composed of 22 places in 85 ms of which 1 ms to minimize.
[2022-05-17 10:15:07] [INFO ] Deduced a trap composed of 9 places in 88 ms of which 0 ms to minimize.
[2022-05-17 10:15:07] [INFO ] Deduced a trap composed of 18 places in 77 ms of which 0 ms to minimize.
[2022-05-17 10:15:07] [INFO ] Deduced a trap composed of 13 places in 100 ms of which 1 ms to minimize.
[2022-05-17 10:15:07] [INFO ] Deduced a trap composed of 53 places in 82 ms of which 0 ms to minimize.
[2022-05-17 10:15:07] [INFO ] Deduced a trap composed of 33 places in 78 ms of which 1 ms to minimize.
[2022-05-17 10:15:07] [INFO ] Deduced a trap composed of 34 places in 86 ms of which 1 ms to minimize.
[2022-05-17 10:15:08] [INFO ] Deduced a trap composed of 50 places in 75 ms of which 0 ms to minimize.
[2022-05-17 10:15:08] [INFO ] Deduced a trap composed of 43 places in 58 ms of which 0 ms to minimize.
[2022-05-17 10:15:08] [INFO ] Deduced a trap composed of 41 places in 58 ms of which 0 ms to minimize.
[2022-05-17 10:15:08] [INFO ] Deduced a trap composed of 46 places in 55 ms of which 0 ms to minimize.
[2022-05-17 10:15:08] [INFO ] Deduced a trap composed of 38 places in 51 ms of which 0 ms to minimize.
[2022-05-17 10:15:08] [INFO ] Deduced a trap composed of 31 places in 50 ms of which 1 ms to minimize.
[2022-05-17 10:15:08] [INFO ] Deduced a trap composed of 23 places in 50 ms of which 0 ms to minimize.
[2022-05-17 10:15:08] [INFO ] Deduced a trap composed of 22 places in 53 ms of which 0 ms to minimize.
[2022-05-17 10:15:09] [INFO ] Deduced a trap composed of 46 places in 77 ms of which 0 ms to minimize.
[2022-05-17 10:15:10] [INFO ] Trap strengthening (SAT) tested/added 27/26 trap constraints in 4487 ms
[2022-05-17 10:15:10] [INFO ] Deduced a trap composed of 12 places in 90 ms of which 0 ms to minimize.
[2022-05-17 10:15:10] [INFO ] Deduced a trap composed of 14 places in 92 ms of which 0 ms to minimize.
[2022-05-17 10:15:10] [INFO ] Deduced a trap composed of 11 places in 103 ms of which 0 ms to minimize.
[2022-05-17 10:15:10] [INFO ] Deduced a trap composed of 21 places in 86 ms of which 1 ms to minimize.
[2022-05-17 10:15:10] [INFO ] Deduced a trap composed of 14 places in 82 ms of which 1 ms to minimize.
[2022-05-17 10:15:10] [INFO ] Deduced a trap composed of 23 places in 81 ms of which 1 ms to minimize.
[2022-05-17 10:15:10] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 745 ms
[2022-05-17 10:15:10] [INFO ] Deduced a trap composed of 10 places in 102 ms of which 0 ms to minimize.
[2022-05-17 10:15:11] [INFO ] Deduced a trap composed of 15 places in 104 ms of which 0 ms to minimize.
[2022-05-17 10:15:11] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 279 ms
[2022-05-17 10:15:11] [INFO ] Deduced a trap composed of 23 places in 103 ms of which 5 ms to minimize.
[2022-05-17 10:15:11] [INFO ] Deduced a trap composed of 25 places in 94 ms of which 0 ms to minimize.
[2022-05-17 10:15:11] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 271 ms
[2022-05-17 10:15:11] [INFO ] Deduced a trap composed of 22 places in 96 ms of which 0 ms to minimize.
[2022-05-17 10:15:11] [INFO ] Deduced a trap composed of 32 places in 94 ms of which 1 ms to minimize.
[2022-05-17 10:15:11] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 276 ms
[2022-05-17 10:15:12] [INFO ] Deduced a trap composed of 35 places in 94 ms of which 0 ms to minimize.
[2022-05-17 10:15:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 143 ms
[2022-05-17 10:15:12] [INFO ] Deduced a trap composed of 23 places in 97 ms of which 1 ms to minimize.
[2022-05-17 10:15:12] [INFO ] Deduced a trap composed of 40 places in 101 ms of which 1 ms to minimize.
[2022-05-17 10:15:12] [INFO ] Deduced a trap composed of 38 places in 104 ms of which 0 ms to minimize.
[2022-05-17 10:15:12] [INFO ] Deduced a trap composed of 23 places in 100 ms of which 0 ms to minimize.
[2022-05-17 10:15:12] [INFO ] Deduced a trap composed of 31 places in 90 ms of which 0 ms to minimize.
[2022-05-17 10:15:12] [INFO ] Deduced a trap composed of 36 places in 91 ms of which 0 ms to minimize.
[2022-05-17 10:15:13] [INFO ] Deduced a trap composed of 34 places in 90 ms of which 0 ms to minimize.
[2022-05-17 10:15:13] [INFO ] Deduced a trap composed of 52 places in 89 ms of which 0 ms to minimize.
[2022-05-17 10:15:13] [INFO ] Deduced a trap composed of 36 places in 86 ms of which 0 ms to minimize.
[2022-05-17 10:15:13] [INFO ] Deduced a trap composed of 32 places in 67 ms of which 1 ms to minimize.
[2022-05-17 10:15:13] [INFO ] Deduced a trap composed of 13 places in 88 ms of which 1 ms to minimize.
[2022-05-17 10:15:13] [INFO ] Deduced a trap composed of 38 places in 75 ms of which 1 ms to minimize.
[2022-05-17 10:15:13] [INFO ] Deduced a trap composed of 52 places in 76 ms of which 1 ms to minimize.
[2022-05-17 10:15:13] [INFO ] Deduced a trap composed of 49 places in 79 ms of which 1 ms to minimize.
[2022-05-17 10:15:14] [INFO ] Deduced a trap composed of 43 places in 60 ms of which 1 ms to minimize.
[2022-05-17 10:15:14] [INFO ] Deduced a trap composed of 38 places in 54 ms of which 0 ms to minimize.
[2022-05-17 10:15:14] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 1873 ms
[2022-05-17 10:15:14] [INFO ] Deduced a trap composed of 30 places in 98 ms of which 1 ms to minimize.
[2022-05-17 10:15:14] [INFO ] Deduced a trap composed of 31 places in 95 ms of which 0 ms to minimize.
[2022-05-17 10:15:14] [INFO ] Deduced a trap composed of 20 places in 93 ms of which 1 ms to minimize.
[2022-05-17 10:15:14] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 389 ms
[2022-05-17 10:15:14] [INFO ] Deduced a trap composed of 43 places in 64 ms of which 0 ms to minimize.
[2022-05-17 10:15:14] [INFO ] Deduced a trap composed of 44 places in 67 ms of which 0 ms to minimize.
[2022-05-17 10:15:14] [INFO ] Deduced a trap composed of 45 places in 59 ms of which 0 ms to minimize.
[2022-05-17 10:15:14] [INFO ] Deduced a trap composed of 41 places in 60 ms of which 1 ms to minimize.
[2022-05-17 10:15:15] [INFO ] Deduced a trap composed of 41 places in 58 ms of which 0 ms to minimize.
[2022-05-17 10:15:16] [INFO ] Deduced a trap composed of 31 places in 88 ms of which 1 ms to minimize.
[2022-05-17 10:15:16] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-17 10:15:16] [INFO ] After 25058ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:22
Parikh walk visited 0 properties in 137 ms.
Support contains 95 out of 362 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 362/362 places, 770/770 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 362 transition count 768
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 360 transition count 768
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 4 place count 360 transition count 762
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 16 place count 354 transition count 762
Applied a total of 16 rules in 43 ms. Remains 354 /362 variables (removed 8) and now considering 762/770 (removed 8) transitions.
Finished structural reductions, in 1 iterations. Remains : 354/362 places, 762/770 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 280 ms. (steps per millisecond=35 ) properties (out of 22) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 21) seen :0
Interrupted probabilistic random walk after 476469 steps, run timeout after 3001 ms. (steps per millisecond=158 ) properties seen :{2=1}
Probabilistic random walk after 476469 steps, saw 69450 distinct states, run finished after 3002 ms. (steps per millisecond=158 ) properties seen :1
Running SMT prover for 20 properties.
[2022-05-17 10:15:19] [INFO ] Flow matrix only has 642 transitions (discarded 120 similar events)
// Phase 1: matrix 642 rows 354 cols
[2022-05-17 10:15:19] [INFO ] Computed 23 place invariants in 2 ms
[2022-05-17 10:15:20] [INFO ] [Real]Absence check using 17 positive place invariants in 6 ms returned sat
[2022-05-17 10:15:20] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 4 ms returned sat
[2022-05-17 10:15:20] [INFO ] After 501ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:20
[2022-05-17 10:15:20] [INFO ] [Nat]Absence check using 17 positive place invariants in 5 ms returned sat
[2022-05-17 10:15:20] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 2 ms returned sat
[2022-05-17 10:15:21] [INFO ] After 575ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :20
[2022-05-17 10:15:21] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-05-17 10:15:21] [INFO ] After 502ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :20
[2022-05-17 10:15:21] [INFO ] Deduced a trap composed of 45 places in 116 ms of which 0 ms to minimize.
[2022-05-17 10:15:22] [INFO ] Deduced a trap composed of 9 places in 110 ms of which 0 ms to minimize.
[2022-05-17 10:15:22] [INFO ] Deduced a trap composed of 9 places in 114 ms of which 1 ms to minimize.
[2022-05-17 10:15:22] [INFO ] Deduced a trap composed of 12 places in 112 ms of which 0 ms to minimize.
[2022-05-17 10:15:22] [INFO ] Deduced a trap composed of 33 places in 112 ms of which 1 ms to minimize.
[2022-05-17 10:15:22] [INFO ] Deduced a trap composed of 31 places in 116 ms of which 0 ms to minimize.
[2022-05-17 10:15:22] [INFO ] Deduced a trap composed of 44 places in 113 ms of which 0 ms to minimize.
[2022-05-17 10:15:22] [INFO ] Deduced a trap composed of 54 places in 115 ms of which 1 ms to minimize.
[2022-05-17 10:15:23] [INFO ] Deduced a trap composed of 23 places in 114 ms of which 1 ms to minimize.
[2022-05-17 10:15:23] [INFO ] Deduced a trap composed of 36 places in 110 ms of which 0 ms to minimize.
[2022-05-17 10:15:23] [INFO ] Deduced a trap composed of 42 places in 115 ms of which 0 ms to minimize.
[2022-05-17 10:15:23] [INFO ] Deduced a trap composed of 9 places in 110 ms of which 1 ms to minimize.
[2022-05-17 10:15:23] [INFO ] Deduced a trap composed of 26 places in 109 ms of which 1 ms to minimize.
[2022-05-17 10:15:23] [INFO ] Deduced a trap composed of 37 places in 108 ms of which 0 ms to minimize.
[2022-05-17 10:15:23] [INFO ] Deduced a trap composed of 21 places in 111 ms of which 0 ms to minimize.
[2022-05-17 10:15:24] [INFO ] Deduced a trap composed of 22 places in 116 ms of which 0 ms to minimize.
[2022-05-17 10:15:24] [INFO ] Deduced a trap composed of 21 places in 113 ms of which 0 ms to minimize.
[2022-05-17 10:15:24] [INFO ] Deduced a trap composed of 37 places in 117 ms of which 0 ms to minimize.
[2022-05-17 10:15:24] [INFO ] Deduced a trap composed of 57 places in 110 ms of which 1 ms to minimize.
[2022-05-17 10:15:24] [INFO ] Deduced a trap composed of 21 places in 120 ms of which 0 ms to minimize.
[2022-05-17 10:15:24] [INFO ] Deduced a trap composed of 37 places in 116 ms of which 1 ms to minimize.
[2022-05-17 10:15:24] [INFO ] Deduced a trap composed of 21 places in 112 ms of which 1 ms to minimize.
[2022-05-17 10:15:25] [INFO ] Deduced a trap composed of 13 places in 75 ms of which 0 ms to minimize.
[2022-05-17 10:15:25] [INFO ] Deduced a trap composed of 12 places in 77 ms of which 0 ms to minimize.
[2022-05-17 10:15:25] [INFO ] Deduced a trap composed of 67 places in 85 ms of which 0 ms to minimize.
[2022-05-17 10:15:25] [INFO ] Deduced a trap composed of 11 places in 88 ms of which 0 ms to minimize.
[2022-05-17 10:15:25] [INFO ] Deduced a trap composed of 33 places in 90 ms of which 1 ms to minimize.
[2022-05-17 10:15:25] [INFO ] Deduced a trap composed of 9 places in 99 ms of which 1 ms to minimize.
[2022-05-17 10:15:25] [INFO ] Deduced a trap composed of 20 places in 81 ms of which 0 ms to minimize.
[2022-05-17 10:15:25] [INFO ] Deduced a trap composed of 10 places in 92 ms of which 0 ms to minimize.
[2022-05-17 10:15:26] [INFO ] Deduced a trap composed of 10 places in 89 ms of which 1 ms to minimize.
[2022-05-17 10:15:26] [INFO ] Deduced a trap composed of 14 places in 97 ms of which 1 ms to minimize.
[2022-05-17 10:15:26] [INFO ] Deduced a trap composed of 43 places in 79 ms of which 0 ms to minimize.
[2022-05-17 10:15:26] [INFO ] Deduced a trap composed of 42 places in 77 ms of which 0 ms to minimize.
[2022-05-17 10:15:26] [INFO ] Deduced a trap composed of 44 places in 83 ms of which 0 ms to minimize.
[2022-05-17 10:15:26] [INFO ] Deduced a trap composed of 59 places in 81 ms of which 0 ms to minimize.
[2022-05-17 10:15:26] [INFO ] Deduced a trap composed of 43 places in 81 ms of which 1 ms to minimize.
[2022-05-17 10:15:26] [INFO ] Deduced a trap composed of 55 places in 64 ms of which 0 ms to minimize.
[2022-05-17 10:15:26] [INFO ] Deduced a trap composed of 54 places in 72 ms of which 0 ms to minimize.
[2022-05-17 10:15:26] [INFO ] Trap strengthening (SAT) tested/added 40/39 trap constraints in 5093 ms
[2022-05-17 10:15:27] [INFO ] Deduced a trap composed of 40 places in 102 ms of which 0 ms to minimize.
[2022-05-17 10:15:27] [INFO ] Deduced a trap composed of 33 places in 89 ms of which 0 ms to minimize.
[2022-05-17 10:15:27] [INFO ] Deduced a trap composed of 9 places in 98 ms of which 1 ms to minimize.
[2022-05-17 10:15:27] [INFO ] Deduced a trap composed of 30 places in 84 ms of which 1 ms to minimize.
[2022-05-17 10:15:27] [INFO ] Deduced a trap composed of 43 places in 85 ms of which 0 ms to minimize.
[2022-05-17 10:15:27] [INFO ] Deduced a trap composed of 51 places in 87 ms of which 0 ms to minimize.
[2022-05-17 10:15:27] [INFO ] Deduced a trap composed of 43 places in 79 ms of which 0 ms to minimize.
[2022-05-17 10:15:28] [INFO ] Deduced a trap composed of 38 places in 79 ms of which 0 ms to minimize.
[2022-05-17 10:15:28] [INFO ] Deduced a trap composed of 40 places in 84 ms of which 1 ms to minimize.
[2022-05-17 10:15:28] [INFO ] Deduced a trap composed of 38 places in 80 ms of which 0 ms to minimize.
[2022-05-17 10:15:28] [INFO ] Deduced a trap composed of 38 places in 79 ms of which 0 ms to minimize.
[2022-05-17 10:15:28] [INFO ] Deduced a trap composed of 38 places in 79 ms of which 1 ms to minimize.
[2022-05-17 10:15:28] [INFO ] Deduced a trap composed of 32 places in 80 ms of which 0 ms to minimize.
[2022-05-17 10:15:28] [INFO ] Deduced a trap composed of 29 places in 79 ms of which 0 ms to minimize.
[2022-05-17 10:15:28] [INFO ] Deduced a trap composed of 31 places in 85 ms of which 0 ms to minimize.
[2022-05-17 10:15:28] [INFO ] Deduced a trap composed of 41 places in 73 ms of which 0 ms to minimize.
[2022-05-17 10:15:29] [INFO ] Deduced a trap composed of 38 places in 83 ms of which 0 ms to minimize.
[2022-05-17 10:15:29] [INFO ] Deduced a trap composed of 29 places in 76 ms of which 0 ms to minimize.
[2022-05-17 10:15:29] [INFO ] Deduced a trap composed of 50 places in 74 ms of which 1 ms to minimize.
[2022-05-17 10:15:29] [INFO ] Deduced a trap composed of 51 places in 72 ms of which 1 ms to minimize.
[2022-05-17 10:15:29] [INFO ] Deduced a trap composed of 50 places in 73 ms of which 0 ms to minimize.
[2022-05-17 10:15:29] [INFO ] Deduced a trap composed of 50 places in 70 ms of which 0 ms to minimize.
[2022-05-17 10:15:29] [INFO ] Deduced a trap composed of 50 places in 70 ms of which 0 ms to minimize.
[2022-05-17 10:15:29] [INFO ] Deduced a trap composed of 31 places in 66 ms of which 0 ms to minimize.
[2022-05-17 10:15:29] [INFO ] Deduced a trap composed of 31 places in 71 ms of which 1 ms to minimize.
[2022-05-17 10:15:30] [INFO ] Deduced a trap composed of 21 places in 77 ms of which 0 ms to minimize.
[2022-05-17 10:15:30] [INFO ] Deduced a trap composed of 34 places in 100 ms of which 0 ms to minimize.
[2022-05-17 10:15:30] [INFO ] Deduced a trap composed of 45 places in 79 ms of which 0 ms to minimize.
[2022-05-17 10:15:30] [INFO ] Deduced a trap composed of 28 places in 90 ms of which 0 ms to minimize.
[2022-05-17 10:15:30] [INFO ] Deduced a trap composed of 23 places in 85 ms of which 1 ms to minimize.
[2022-05-17 10:15:30] [INFO ] Deduced a trap composed of 47 places in 66 ms of which 0 ms to minimize.
[2022-05-17 10:15:30] [INFO ] Deduced a trap composed of 47 places in 67 ms of which 0 ms to minimize.
[2022-05-17 10:15:30] [INFO ] Deduced a trap composed of 45 places in 72 ms of which 1 ms to minimize.
[2022-05-17 10:15:30] [INFO ] Deduced a trap composed of 41 places in 71 ms of which 0 ms to minimize.
[2022-05-17 10:15:31] [INFO ] Deduced a trap composed of 50 places in 57 ms of which 0 ms to minimize.
[2022-05-17 10:15:31] [INFO ] Deduced a trap composed of 50 places in 50 ms of which 1 ms to minimize.
[2022-05-17 10:15:31] [INFO ] Trap strengthening (SAT) tested/added 37/36 trap constraints in 4116 ms
[2022-05-17 10:15:31] [INFO ] Deduced a trap composed of 24 places in 95 ms of which 0 ms to minimize.
[2022-05-17 10:15:31] [INFO ] Deduced a trap composed of 21 places in 82 ms of which 0 ms to minimize.
[2022-05-17 10:15:31] [INFO ] Deduced a trap composed of 22 places in 86 ms of which 1 ms to minimize.
[2022-05-17 10:15:31] [INFO ] Deduced a trap composed of 65 places in 84 ms of which 0 ms to minimize.
[2022-05-17 10:15:31] [INFO ] Deduced a trap composed of 55 places in 87 ms of which 1 ms to minimize.
[2022-05-17 10:15:31] [INFO ] Deduced a trap composed of 57 places in 86 ms of which 1 ms to minimize.
[2022-05-17 10:15:31] [INFO ] Deduced a trap composed of 57 places in 80 ms of which 1 ms to minimize.
[2022-05-17 10:15:32] [INFO ] Deduced a trap composed of 55 places in 89 ms of which 0 ms to minimize.
[2022-05-17 10:15:32] [INFO ] Deduced a trap composed of 46 places in 79 ms of which 0 ms to minimize.
[2022-05-17 10:15:32] [INFO ] Deduced a trap composed of 39 places in 49 ms of which 1 ms to minimize.
[2022-05-17 10:15:32] [INFO ] Deduced a trap composed of 40 places in 51 ms of which 0 ms to minimize.
[2022-05-17 10:15:32] [INFO ] Deduced a trap composed of 41 places in 55 ms of which 0 ms to minimize.
[2022-05-17 10:15:32] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1245 ms
[2022-05-17 10:15:32] [INFO ] Deduced a trap composed of 46 places in 94 ms of which 0 ms to minimize.
[2022-05-17 10:15:32] [INFO ] Deduced a trap composed of 93 places in 95 ms of which 0 ms to minimize.
[2022-05-17 10:15:32] [INFO ] Deduced a trap composed of 21 places in 90 ms of which 0 ms to minimize.
[2022-05-17 10:15:32] [INFO ] Deduced a trap composed of 23 places in 98 ms of which 0 ms to minimize.
[2022-05-17 10:15:33] [INFO ] Deduced a trap composed of 48 places in 91 ms of which 1 ms to minimize.
[2022-05-17 10:15:33] [INFO ] Deduced a trap composed of 48 places in 92 ms of which 0 ms to minimize.
[2022-05-17 10:15:33] [INFO ] Deduced a trap composed of 81 places in 93 ms of which 0 ms to minimize.
[2022-05-17 10:15:33] [INFO ] Deduced a trap composed of 24 places in 89 ms of which 0 ms to minimize.
[2022-05-17 10:15:33] [INFO ] Deduced a trap composed of 20 places in 90 ms of which 0 ms to minimize.
[2022-05-17 10:15:33] [INFO ] Deduced a trap composed of 46 places in 84 ms of which 0 ms to minimize.
[2022-05-17 10:15:33] [INFO ] Deduced a trap composed of 59 places in 85 ms of which 1 ms to minimize.
[2022-05-17 10:15:33] [INFO ] Deduced a trap composed of 40 places in 81 ms of which 0 ms to minimize.
[2022-05-17 10:15:33] [INFO ] Deduced a trap composed of 41 places in 89 ms of which 0 ms to minimize.
[2022-05-17 10:15:34] [INFO ] Deduced a trap composed of 61 places in 85 ms of which 0 ms to minimize.
[2022-05-17 10:15:34] [INFO ] Deduced a trap composed of 47 places in 88 ms of which 1 ms to minimize.
[2022-05-17 10:15:34] [INFO ] Deduced a trap composed of 18 places in 93 ms of which 0 ms to minimize.
[2022-05-17 10:15:34] [INFO ] Deduced a trap composed of 21 places in 92 ms of which 1 ms to minimize.
[2022-05-17 10:15:34] [INFO ] Deduced a trap composed of 43 places in 84 ms of which 1 ms to minimize.
[2022-05-17 10:15:34] [INFO ] Deduced a trap composed of 31 places in 85 ms of which 0 ms to minimize.
[2022-05-17 10:15:34] [INFO ] Deduced a trap composed of 29 places in 81 ms of which 0 ms to minimize.
[2022-05-17 10:15:34] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 2435 ms
[2022-05-17 10:15:35] [INFO ] Deduced a trap composed of 23 places in 90 ms of which 1 ms to minimize.
[2022-05-17 10:15:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 138 ms
[2022-05-17 10:15:35] [INFO ] Deduced a trap composed of 22 places in 84 ms of which 0 ms to minimize.
[2022-05-17 10:15:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 125 ms
[2022-05-17 10:15:35] [INFO ] Deduced a trap composed of 30 places in 80 ms of which 0 ms to minimize.
[2022-05-17 10:15:35] [INFO ] Deduced a trap composed of 51 places in 86 ms of which 0 ms to minimize.
[2022-05-17 10:15:35] [INFO ] Deduced a trap composed of 32 places in 84 ms of which 1 ms to minimize.
[2022-05-17 10:15:35] [INFO ] Deduced a trap composed of 50 places in 84 ms of which 0 ms to minimize.
[2022-05-17 10:15:35] [INFO ] Deduced a trap composed of 49 places in 81 ms of which 0 ms to minimize.
[2022-05-17 10:15:36] [INFO ] Deduced a trap composed of 49 places in 87 ms of which 0 ms to minimize.
[2022-05-17 10:15:36] [INFO ] Deduced a trap composed of 50 places in 86 ms of which 0 ms to minimize.
[2022-05-17 10:15:36] [INFO ] Deduced a trap composed of 30 places in 68 ms of which 1 ms to minimize.
[2022-05-17 10:15:36] [INFO ] Deduced a trap composed of 43 places in 65 ms of which 0 ms to minimize.
[2022-05-17 10:15:36] [INFO ] Deduced a trap composed of 32 places in 63 ms of which 1 ms to minimize.
[2022-05-17 10:15:36] [INFO ] Deduced a trap composed of 29 places in 70 ms of which 3 ms to minimize.
[2022-05-17 10:15:36] [INFO ] Deduced a trap composed of 12 places in 96 ms of which 0 ms to minimize.
[2022-05-17 10:15:36] [INFO ] Deduced a trap composed of 38 places in 53 ms of which 0 ms to minimize.
[2022-05-17 10:15:36] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 1356 ms
[2022-05-17 10:15:36] [INFO ] Deduced a trap composed of 9 places in 97 ms of which 0 ms to minimize.
[2022-05-17 10:15:37] [INFO ] Deduced a trap composed of 10 places in 96 ms of which 1 ms to minimize.
[2022-05-17 10:15:37] [INFO ] Deduced a trap composed of 13 places in 105 ms of which 0 ms to minimize.
[2022-05-17 10:15:37] [INFO ] Deduced a trap composed of 10 places in 96 ms of which 0 ms to minimize.
[2022-05-17 10:15:37] [INFO ] Deduced a trap composed of 36 places in 70 ms of which 1 ms to minimize.
[2022-05-17 10:15:37] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 658 ms
[2022-05-17 10:15:37] [INFO ] Deduced a trap composed of 23 places in 96 ms of which 0 ms to minimize.
[2022-05-17 10:15:37] [INFO ] Deduced a trap composed of 25 places in 94 ms of which 0 ms to minimize.
[2022-05-17 10:15:37] [INFO ] Deduced a trap composed of 41 places in 64 ms of which 1 ms to minimize.
[2022-05-17 10:15:37] [INFO ] Deduced a trap composed of 39 places in 66 ms of which 1 ms to minimize.
[2022-05-17 10:15:37] [INFO ] Deduced a trap composed of 63 places in 68 ms of which 1 ms to minimize.
[2022-05-17 10:15:38] [INFO ] Deduced a trap composed of 39 places in 65 ms of which 0 ms to minimize.
[2022-05-17 10:15:38] [INFO ] Deduced a trap composed of 39 places in 65 ms of which 0 ms to minimize.
[2022-05-17 10:15:38] [INFO ] Deduced a trap composed of 21 places in 97 ms of which 0 ms to minimize.
[2022-05-17 10:15:38] [INFO ] Deduced a trap composed of 22 places in 88 ms of which 0 ms to minimize.
[2022-05-17 10:15:38] [INFO ] Deduced a trap composed of 20 places in 96 ms of which 1 ms to minimize.
[2022-05-17 10:15:38] [INFO ] Deduced a trap composed of 29 places in 83 ms of which 0 ms to minimize.
[2022-05-17 10:15:38] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1218 ms
[2022-05-17 10:15:38] [INFO ] Deduced a trap composed of 29 places in 63 ms of which 0 ms to minimize.
[2022-05-17 10:15:39] [INFO ] Deduced a trap composed of 35 places in 81 ms of which 0 ms to minimize.
[2022-05-17 10:15:39] [INFO ] Deduced a trap composed of 53 places in 64 ms of which 0 ms to minimize.
[2022-05-17 10:15:39] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 445 ms
[2022-05-17 10:15:39] [INFO ] Deduced a trap composed of 35 places in 70 ms of which 1 ms to minimize.
[2022-05-17 10:15:39] [INFO ] Deduced a trap composed of 32 places in 38 ms of which 1 ms to minimize.
[2022-05-17 10:15:39] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 173 ms
[2022-05-17 10:15:39] [INFO ] Deduced a trap composed of 14 places in 81 ms of which 0 ms to minimize.
[2022-05-17 10:15:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 188 ms
[2022-05-17 10:15:39] [INFO ] After 18595ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :20
Attempting to minimize the solution found.
Minimization took 1955 ms.
[2022-05-17 10:15:41] [INFO ] After 21415ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :20
Parikh walk visited 0 properties in 42 ms.
Support contains 92 out of 354 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 354/354 places, 762/762 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 354 transition count 760
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 352 transition count 760
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 4 place count 352 transition count 757
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 10 place count 349 transition count 757
Applied a total of 10 rules in 42 ms. Remains 349 /354 variables (removed 5) and now considering 757/762 (removed 5) transitions.
Finished structural reductions, in 1 iterations. Remains : 349/354 places, 757/762 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 392 ms. (steps per millisecond=25 ) properties (out of 20) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=30 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) seen :0
Interrupted probabilistic random walk after 476329 steps, run timeout after 3001 ms. (steps per millisecond=158 ) properties seen :{}
Probabilistic random walk after 476329 steps, saw 71333 distinct states, run finished after 3001 ms. (steps per millisecond=158 ) properties seen :0
Running SMT prover for 19 properties.
[2022-05-17 10:15:45] [INFO ] Flow matrix only has 637 transitions (discarded 120 similar events)
// Phase 1: matrix 637 rows 349 cols
[2022-05-17 10:15:45] [INFO ] Computed 23 place invariants in 8 ms
[2022-05-17 10:15:45] [INFO ] [Real]Absence check using 17 positive place invariants in 6 ms returned sat
[2022-05-17 10:15:45] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 2 ms returned sat
[2022-05-17 10:15:45] [INFO ] After 440ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:19
[2022-05-17 10:15:46] [INFO ] [Nat]Absence check using 17 positive place invariants in 6 ms returned sat
[2022-05-17 10:15:46] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 2 ms returned sat
[2022-05-17 10:15:46] [INFO ] After 530ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :19
[2022-05-17 10:15:46] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-05-17 10:15:47] [INFO ] After 510ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :19
[2022-05-17 10:15:47] [INFO ] Deduced a trap composed of 18 places in 115 ms of which 0 ms to minimize.
[2022-05-17 10:15:47] [INFO ] Deduced a trap composed of 11 places in 114 ms of which 0 ms to minimize.
[2022-05-17 10:15:47] [INFO ] Deduced a trap composed of 18 places in 103 ms of which 1 ms to minimize.
[2022-05-17 10:15:47] [INFO ] Deduced a trap composed of 18 places in 103 ms of which 1 ms to minimize.
[2022-05-17 10:15:47] [INFO ] Deduced a trap composed of 24 places in 106 ms of which 0 ms to minimize.
[2022-05-17 10:15:48] [INFO ] Deduced a trap composed of 31 places in 109 ms of which 0 ms to minimize.
[2022-05-17 10:15:48] [INFO ] Deduced a trap composed of 24 places in 106 ms of which 1 ms to minimize.
[2022-05-17 10:15:48] [INFO ] Deduced a trap composed of 38 places in 115 ms of which 0 ms to minimize.
[2022-05-17 10:15:48] [INFO ] Deduced a trap composed of 20 places in 99 ms of which 0 ms to minimize.
[2022-05-17 10:15:48] [INFO ] Deduced a trap composed of 48 places in 107 ms of which 1 ms to minimize.
[2022-05-17 10:15:48] [INFO ] Deduced a trap composed of 26 places in 105 ms of which 0 ms to minimize.
[2022-05-17 10:15:48] [INFO ] Deduced a trap composed of 10 places in 107 ms of which 1 ms to minimize.
[2022-05-17 10:15:49] [INFO ] Deduced a trap composed of 31 places in 91 ms of which 1 ms to minimize.
[2022-05-17 10:15:49] [INFO ] Deduced a trap composed of 93 places in 93 ms of which 0 ms to minimize.
[2022-05-17 10:15:49] [INFO ] Deduced a trap composed of 22 places in 90 ms of which 0 ms to minimize.
[2022-05-17 10:15:49] [INFO ] Deduced a trap composed of 9 places in 108 ms of which 1 ms to minimize.
[2022-05-17 10:15:49] [INFO ] Deduced a trap composed of 31 places in 89 ms of which 0 ms to minimize.
[2022-05-17 10:15:49] [INFO ] Deduced a trap composed of 52 places in 90 ms of which 1 ms to minimize.
[2022-05-17 10:15:49] [INFO ] Deduced a trap composed of 21 places in 95 ms of which 1 ms to minimize.
[2022-05-17 10:15:49] [INFO ] Deduced a trap composed of 52 places in 93 ms of which 1 ms to minimize.
[2022-05-17 10:15:49] [INFO ] Deduced a trap composed of 22 places in 95 ms of which 0 ms to minimize.
[2022-05-17 10:15:50] [INFO ] Deduced a trap composed of 32 places in 93 ms of which 0 ms to minimize.
[2022-05-17 10:15:50] [INFO ] Deduced a trap composed of 32 places in 90 ms of which 0 ms to minimize.
[2022-05-17 10:15:50] [INFO ] Deduced a trap composed of 16 places in 101 ms of which 0 ms to minimize.
[2022-05-17 10:15:50] [INFO ] Deduced a trap composed of 9 places in 94 ms of which 1 ms to minimize.
[2022-05-17 10:15:50] [INFO ] Deduced a trap composed of 9 places in 94 ms of which 0 ms to minimize.
[2022-05-17 10:15:50] [INFO ] Deduced a trap composed of 9 places in 91 ms of which 0 ms to minimize.
[2022-05-17 10:15:50] [INFO ] Deduced a trap composed of 21 places in 89 ms of which 1 ms to minimize.
[2022-05-17 10:15:50] [INFO ] Deduced a trap composed of 21 places in 97 ms of which 0 ms to minimize.
[2022-05-17 10:15:51] [INFO ] Deduced a trap composed of 32 places in 89 ms of which 0 ms to minimize.
[2022-05-17 10:15:51] [INFO ] Deduced a trap composed of 31 places in 102 ms of which 0 ms to minimize.
[2022-05-17 10:15:51] [INFO ] Deduced a trap composed of 50 places in 59 ms of which 0 ms to minimize.
[2022-05-17 10:15:51] [INFO ] Deduced a trap composed of 52 places in 66 ms of which 0 ms to minimize.
[2022-05-17 10:15:51] [INFO ] Trap strengthening (SAT) tested/added 34/33 trap constraints in 4304 ms
[2022-05-17 10:15:51] [INFO ] Deduced a trap composed of 9 places in 108 ms of which 0 ms to minimize.
[2022-05-17 10:15:51] [INFO ] Deduced a trap composed of 30 places in 86 ms of which 0 ms to minimize.
[2022-05-17 10:15:52] [INFO ] Deduced a trap composed of 31 places in 93 ms of which 0 ms to minimize.
[2022-05-17 10:15:52] [INFO ] Deduced a trap composed of 18 places in 89 ms of which 0 ms to minimize.
[2022-05-17 10:15:52] [INFO ] Deduced a trap composed of 39 places in 81 ms of which 0 ms to minimize.
[2022-05-17 10:15:52] [INFO ] Deduced a trap composed of 22 places in 88 ms of which 1 ms to minimize.
[2022-05-17 10:15:52] [INFO ] Deduced a trap composed of 38 places in 80 ms of which 1 ms to minimize.
[2022-05-17 10:15:52] [INFO ] Deduced a trap composed of 39 places in 63 ms of which 0 ms to minimize.
[2022-05-17 10:15:52] [INFO ] Deduced a trap composed of 40 places in 63 ms of which 0 ms to minimize.
[2022-05-17 10:15:52] [INFO ] Deduced a trap composed of 38 places in 64 ms of which 0 ms to minimize.
[2022-05-17 10:15:52] [INFO ] Deduced a trap composed of 48 places in 63 ms of which 1 ms to minimize.
[2022-05-17 10:15:52] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1285 ms
[2022-05-17 10:15:53] [INFO ] Deduced a trap composed of 22 places in 87 ms of which 0 ms to minimize.
[2022-05-17 10:15:53] [INFO ] Deduced a trap composed of 57 places in 91 ms of which 0 ms to minimize.
[2022-05-17 10:15:53] [INFO ] Deduced a trap composed of 24 places in 89 ms of which 0 ms to minimize.
[2022-05-17 10:15:53] [INFO ] Deduced a trap composed of 45 places in 81 ms of which 1 ms to minimize.
[2022-05-17 10:15:53] [INFO ] Deduced a trap composed of 51 places in 77 ms of which 0 ms to minimize.
[2022-05-17 10:15:53] [INFO ] Deduced a trap composed of 45 places in 83 ms of which 1 ms to minimize.
[2022-05-17 10:15:53] [INFO ] Deduced a trap composed of 36 places in 85 ms of which 0 ms to minimize.
[2022-05-17 10:15:53] [INFO ] Deduced a trap composed of 62 places in 83 ms of which 1 ms to minimize.
[2022-05-17 10:15:54] [INFO ] Deduced a trap composed of 34 places in 83 ms of which 0 ms to minimize.
[2022-05-17 10:15:54] [INFO ] Deduced a trap composed of 50 places in 87 ms of which 0 ms to minimize.
[2022-05-17 10:15:54] [INFO ] Deduced a trap composed of 57 places in 82 ms of which 0 ms to minimize.
[2022-05-17 10:15:54] [INFO ] Deduced a trap composed of 60 places in 92 ms of which 0 ms to minimize.
[2022-05-17 10:15:54] [INFO ] Deduced a trap composed of 45 places in 60 ms of which 0 ms to minimize.
[2022-05-17 10:15:54] [INFO ] Deduced a trap composed of 39 places in 52 ms of which 0 ms to minimize.
[2022-05-17 10:15:54] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 1509 ms
[2022-05-17 10:15:54] [INFO ] Deduced a trap composed of 46 places in 82 ms of which 1 ms to minimize.
[2022-05-17 10:15:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 125 ms
[2022-05-17 10:15:55] [INFO ] Deduced a trap composed of 30 places in 80 ms of which 0 ms to minimize.
[2022-05-17 10:15:55] [INFO ] Deduced a trap composed of 49 places in 73 ms of which 0 ms to minimize.
[2022-05-17 10:15:55] [INFO ] Deduced a trap composed of 48 places in 78 ms of which 1 ms to minimize.
[2022-05-17 10:15:55] [INFO ] Deduced a trap composed of 47 places in 76 ms of which 0 ms to minimize.
[2022-05-17 10:15:55] [INFO ] Deduced a trap composed of 31 places in 42 ms of which 0 ms to minimize.
[2022-05-17 10:15:55] [INFO ] Deduced a trap composed of 29 places in 43 ms of which 0 ms to minimize.
[2022-05-17 10:15:55] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 563 ms
[2022-05-17 10:15:55] [INFO ] Deduced a trap composed of 34 places in 74 ms of which 0 ms to minimize.
[2022-05-17 10:15:55] [INFO ] Deduced a trap composed of 25 places in 80 ms of which 1 ms to minimize.
[2022-05-17 10:15:55] [INFO ] Deduced a trap composed of 18 places in 77 ms of which 0 ms to minimize.
[2022-05-17 10:15:55] [INFO ] Deduced a trap composed of 23 places in 95 ms of which 1 ms to minimize.
[2022-05-17 10:15:56] [INFO ] Deduced a trap composed of 21 places in 94 ms of which 1 ms to minimize.
[2022-05-17 10:15:56] [INFO ] Deduced a trap composed of 61 places in 77 ms of which 0 ms to minimize.
[2022-05-17 10:15:56] [INFO ] Deduced a trap composed of 34 places in 110 ms of which 0 ms to minimize.
[2022-05-17 10:15:56] [INFO ] Deduced a trap composed of 78 places in 106 ms of which 0 ms to minimize.
[2022-05-17 10:15:56] [INFO ] Deduced a trap composed of 35 places in 105 ms of which 0 ms to minimize.
[2022-05-17 10:15:56] [INFO ] Deduced a trap composed of 40 places in 78 ms of which 0 ms to minimize.
[2022-05-17 10:15:56] [INFO ] Deduced a trap composed of 51 places in 78 ms of which 0 ms to minimize.
[2022-05-17 10:15:56] [INFO ] Deduced a trap composed of 51 places in 75 ms of which 0 ms to minimize.
[2022-05-17 10:15:57] [INFO ] Deduced a trap composed of 51 places in 86 ms of which 1 ms to minimize.
[2022-05-17 10:15:57] [INFO ] Deduced a trap composed of 50 places in 77 ms of which 0 ms to minimize.
[2022-05-17 10:15:57] [INFO ] Deduced a trap composed of 40 places in 75 ms of which 0 ms to minimize.
[2022-05-17 10:15:57] [INFO ] Deduced a trap composed of 51 places in 80 ms of which 0 ms to minimize.
[2022-05-17 10:15:57] [INFO ] Deduced a trap composed of 61 places in 64 ms of which 0 ms to minimize.
[2022-05-17 10:15:57] [INFO ] Deduced a trap composed of 41 places in 65 ms of which 0 ms to minimize.
[2022-05-17 10:15:57] [INFO ] Deduced a trap composed of 41 places in 58 ms of which 0 ms to minimize.
[2022-05-17 10:15:57] [INFO ] Deduced a trap composed of 41 places in 65 ms of which 0 ms to minimize.
[2022-05-17 10:15:57] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 2231 ms
[2022-05-17 10:15:57] [INFO ] Deduced a trap composed of 22 places in 86 ms of which 1 ms to minimize.
[2022-05-17 10:15:57] [INFO ] Deduced a trap composed of 41 places in 58 ms of which 0 ms to minimize.
[2022-05-17 10:15:58] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 206 ms
[2022-05-17 10:15:58] [INFO ] Deduced a trap composed of 29 places in 89 ms of which 1 ms to minimize.
[2022-05-17 10:15:58] [INFO ] Deduced a trap composed of 51 places in 54 ms of which 0 ms to minimize.
[2022-05-17 10:15:58] [INFO ] Deduced a trap composed of 50 places in 54 ms of which 0 ms to minimize.
[2022-05-17 10:15:58] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 283 ms
[2022-05-17 10:15:58] [INFO ] Deduced a trap composed of 31 places in 82 ms of which 1 ms to minimize.
[2022-05-17 10:15:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 133 ms
[2022-05-17 10:15:58] [INFO ] Deduced a trap composed of 49 places in 91 ms of which 0 ms to minimize.
[2022-05-17 10:15:58] [INFO ] Deduced a trap composed of 12 places in 89 ms of which 1 ms to minimize.
[2022-05-17 10:15:58] [INFO ] Deduced a trap composed of 21 places in 81 ms of which 1 ms to minimize.
[2022-05-17 10:15:59] [INFO ] Deduced a trap composed of 11 places in 68 ms of which 0 ms to minimize.
[2022-05-17 10:15:59] [INFO ] Deduced a trap composed of 13 places in 69 ms of which 0 ms to minimize.
[2022-05-17 10:15:59] [INFO ] Deduced a trap composed of 21 places in 77 ms of which 1 ms to minimize.
[2022-05-17 10:15:59] [INFO ] Deduced a trap composed of 14 places in 73 ms of which 0 ms to minimize.
[2022-05-17 10:15:59] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 732 ms
[2022-05-17 10:15:59] [INFO ] After 12563ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :19
Attempting to minimize the solution found.
Minimization took 941 ms.
[2022-05-17 10:16:00] [INFO ] After 14302ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :19
Parikh walk visited 0 properties in 233 ms.
Support contains 90 out of 349 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 349/349 places, 757/757 transitions.
Applied a total of 0 rules in 13 ms. Remains 349 /349 variables (removed 0) and now considering 757/757 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 349/349 places, 757/757 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 226 ms. (steps per millisecond=44 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) seen :0
Interrupted probabilistic random walk after 493528 steps, run timeout after 3001 ms. (steps per millisecond=164 ) properties seen :{}
Probabilistic random walk after 493528 steps, saw 73868 distinct states, run finished after 3001 ms. (steps per millisecond=164 ) properties seen :0
Running SMT prover for 19 properties.
[2022-05-17 10:16:03] [INFO ] Flow matrix only has 637 transitions (discarded 120 similar events)
// Phase 1: matrix 637 rows 349 cols
[2022-05-17 10:16:03] [INFO ] Computed 23 place invariants in 1 ms
[2022-05-17 10:16:04] [INFO ] [Real]Absence check using 17 positive place invariants in 6 ms returned sat
[2022-05-17 10:16:04] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 2 ms returned sat
[2022-05-17 10:16:04] [INFO ] After 436ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:19
[2022-05-17 10:16:04] [INFO ] [Nat]Absence check using 17 positive place invariants in 6 ms returned sat
[2022-05-17 10:16:04] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 1 ms returned sat
[2022-05-17 10:16:05] [INFO ] After 520ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :19
[2022-05-17 10:16:05] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-05-17 10:16:05] [INFO ] After 476ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :19
[2022-05-17 10:16:05] [INFO ] Deduced a trap composed of 18 places in 110 ms of which 0 ms to minimize.
[2022-05-17 10:16:05] [INFO ] Deduced a trap composed of 11 places in 108 ms of which 0 ms to minimize.
[2022-05-17 10:16:05] [INFO ] Deduced a trap composed of 18 places in 110 ms of which 0 ms to minimize.
[2022-05-17 10:16:06] [INFO ] Deduced a trap composed of 18 places in 108 ms of which 1 ms to minimize.
[2022-05-17 10:16:06] [INFO ] Deduced a trap composed of 24 places in 103 ms of which 1 ms to minimize.
[2022-05-17 10:16:06] [INFO ] Deduced a trap composed of 31 places in 105 ms of which 1 ms to minimize.
[2022-05-17 10:16:06] [INFO ] Deduced a trap composed of 24 places in 117 ms of which 0 ms to minimize.
[2022-05-17 10:16:06] [INFO ] Deduced a trap composed of 38 places in 101 ms of which 0 ms to minimize.
[2022-05-17 10:16:06] [INFO ] Deduced a trap composed of 20 places in 99 ms of which 1 ms to minimize.
[2022-05-17 10:16:06] [INFO ] Deduced a trap composed of 48 places in 105 ms of which 1 ms to minimize.
[2022-05-17 10:16:07] [INFO ] Deduced a trap composed of 26 places in 105 ms of which 0 ms to minimize.
[2022-05-17 10:16:07] [INFO ] Deduced a trap composed of 10 places in 108 ms of which 0 ms to minimize.
[2022-05-17 10:16:07] [INFO ] Deduced a trap composed of 31 places in 88 ms of which 1 ms to minimize.
[2022-05-17 10:16:07] [INFO ] Deduced a trap composed of 93 places in 93 ms of which 0 ms to minimize.
[2022-05-17 10:16:07] [INFO ] Deduced a trap composed of 22 places in 92 ms of which 1 ms to minimize.
[2022-05-17 10:16:07] [INFO ] Deduced a trap composed of 9 places in 108 ms of which 1 ms to minimize.
[2022-05-17 10:16:07] [INFO ] Deduced a trap composed of 31 places in 90 ms of which 0 ms to minimize.
[2022-05-17 10:16:07] [INFO ] Deduced a trap composed of 52 places in 91 ms of which 0 ms to minimize.
[2022-05-17 10:16:08] [INFO ] Deduced a trap composed of 21 places in 91 ms of which 0 ms to minimize.
[2022-05-17 10:16:08] [INFO ] Deduced a trap composed of 52 places in 95 ms of which 0 ms to minimize.
[2022-05-17 10:16:08] [INFO ] Deduced a trap composed of 22 places in 90 ms of which 0 ms to minimize.
[2022-05-17 10:16:08] [INFO ] Deduced a trap composed of 32 places in 89 ms of which 0 ms to minimize.
[2022-05-17 10:16:08] [INFO ] Deduced a trap composed of 32 places in 91 ms of which 0 ms to minimize.
[2022-05-17 10:16:08] [INFO ] Deduced a trap composed of 16 places in 90 ms of which 1 ms to minimize.
[2022-05-17 10:16:08] [INFO ] Deduced a trap composed of 9 places in 92 ms of which 0 ms to minimize.
[2022-05-17 10:16:08] [INFO ] Deduced a trap composed of 9 places in 90 ms of which 1 ms to minimize.
[2022-05-17 10:16:08] [INFO ] Deduced a trap composed of 9 places in 95 ms of which 0 ms to minimize.
[2022-05-17 10:16:09] [INFO ] Deduced a trap composed of 21 places in 98 ms of which 0 ms to minimize.
[2022-05-17 10:16:09] [INFO ] Deduced a trap composed of 21 places in 101 ms of which 1 ms to minimize.
[2022-05-17 10:16:09] [INFO ] Deduced a trap composed of 32 places in 94 ms of which 0 ms to minimize.
[2022-05-17 10:16:09] [INFO ] Deduced a trap composed of 31 places in 95 ms of which 1 ms to minimize.
[2022-05-17 10:16:09] [INFO ] Deduced a trap composed of 50 places in 66 ms of which 0 ms to minimize.
[2022-05-17 10:16:09] [INFO ] Deduced a trap composed of 52 places in 66 ms of which 0 ms to minimize.
[2022-05-17 10:16:09] [INFO ] Trap strengthening (SAT) tested/added 34/33 trap constraints in 4313 ms
[2022-05-17 10:16:10] [INFO ] Deduced a trap composed of 9 places in 97 ms of which 0 ms to minimize.
[2022-05-17 10:16:10] [INFO ] Deduced a trap composed of 30 places in 90 ms of which 0 ms to minimize.
[2022-05-17 10:16:10] [INFO ] Deduced a trap composed of 31 places in 82 ms of which 0 ms to minimize.
[2022-05-17 10:16:10] [INFO ] Deduced a trap composed of 18 places in 89 ms of which 1 ms to minimize.
[2022-05-17 10:16:10] [INFO ] Deduced a trap composed of 39 places in 84 ms of which 0 ms to minimize.
[2022-05-17 10:16:10] [INFO ] Deduced a trap composed of 22 places in 80 ms of which 0 ms to minimize.
[2022-05-17 10:16:10] [INFO ] Deduced a trap composed of 38 places in 81 ms of which 0 ms to minimize.
[2022-05-17 10:16:10] [INFO ] Deduced a trap composed of 39 places in 74 ms of which 1 ms to minimize.
[2022-05-17 10:16:11] [INFO ] Deduced a trap composed of 40 places in 57 ms of which 0 ms to minimize.
[2022-05-17 10:16:11] [INFO ] Deduced a trap composed of 38 places in 63 ms of which 0 ms to minimize.
[2022-05-17 10:16:11] [INFO ] Deduced a trap composed of 48 places in 56 ms of which 0 ms to minimize.
[2022-05-17 10:16:11] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1236 ms
[2022-05-17 10:16:11] [INFO ] Deduced a trap composed of 22 places in 82 ms of which 0 ms to minimize.
[2022-05-17 10:16:11] [INFO ] Deduced a trap composed of 57 places in 92 ms of which 1 ms to minimize.
[2022-05-17 10:16:11] [INFO ] Deduced a trap composed of 24 places in 86 ms of which 0 ms to minimize.
[2022-05-17 10:16:11] [INFO ] Deduced a trap composed of 45 places in 86 ms of which 0 ms to minimize.
[2022-05-17 10:16:11] [INFO ] Deduced a trap composed of 51 places in 80 ms of which 0 ms to minimize.
[2022-05-17 10:16:11] [INFO ] Deduced a trap composed of 45 places in 80 ms of which 1 ms to minimize.
[2022-05-17 10:16:12] [INFO ] Deduced a trap composed of 36 places in 83 ms of which 0 ms to minimize.
[2022-05-17 10:16:12] [INFO ] Deduced a trap composed of 62 places in 79 ms of which 0 ms to minimize.
[2022-05-17 10:16:12] [INFO ] Deduced a trap composed of 34 places in 84 ms of which 1 ms to minimize.
[2022-05-17 10:16:12] [INFO ] Deduced a trap composed of 50 places in 91 ms of which 1 ms to minimize.
[2022-05-17 10:16:12] [INFO ] Deduced a trap composed of 57 places in 82 ms of which 0 ms to minimize.
[2022-05-17 10:16:12] [INFO ] Deduced a trap composed of 60 places in 81 ms of which 1 ms to minimize.
[2022-05-17 10:16:12] [INFO ] Deduced a trap composed of 45 places in 61 ms of which 0 ms to minimize.
[2022-05-17 10:16:12] [INFO ] Deduced a trap composed of 39 places in 46 ms of which 1 ms to minimize.
[2022-05-17 10:16:12] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 1476 ms
[2022-05-17 10:16:12] [INFO ] Deduced a trap composed of 46 places in 82 ms of which 0 ms to minimize.
[2022-05-17 10:16:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 126 ms
[2022-05-17 10:16:13] [INFO ] Deduced a trap composed of 30 places in 77 ms of which 1 ms to minimize.
[2022-05-17 10:16:13] [INFO ] Deduced a trap composed of 49 places in 81 ms of which 0 ms to minimize.
[2022-05-17 10:16:13] [INFO ] Deduced a trap composed of 48 places in 78 ms of which 0 ms to minimize.
[2022-05-17 10:16:13] [INFO ] Deduced a trap composed of 47 places in 79 ms of which 0 ms to minimize.
[2022-05-17 10:16:13] [INFO ] Deduced a trap composed of 31 places in 44 ms of which 0 ms to minimize.
[2022-05-17 10:16:13] [INFO ] Deduced a trap composed of 29 places in 50 ms of which 1 ms to minimize.
[2022-05-17 10:16:13] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 552 ms
[2022-05-17 10:16:13] [INFO ] Deduced a trap composed of 34 places in 68 ms of which 0 ms to minimize.
[2022-05-17 10:16:13] [INFO ] Deduced a trap composed of 25 places in 77 ms of which 0 ms to minimize.
[2022-05-17 10:16:13] [INFO ] Deduced a trap composed of 18 places in 74 ms of which 1 ms to minimize.
[2022-05-17 10:16:14] [INFO ] Deduced a trap composed of 23 places in 91 ms of which 0 ms to minimize.
[2022-05-17 10:16:14] [INFO ] Deduced a trap composed of 21 places in 94 ms of which 0 ms to minimize.
[2022-05-17 10:16:14] [INFO ] Deduced a trap composed of 61 places in 72 ms of which 0 ms to minimize.
[2022-05-17 10:16:14] [INFO ] Deduced a trap composed of 34 places in 106 ms of which 0 ms to minimize.
[2022-05-17 10:16:14] [INFO ] Deduced a trap composed of 78 places in 105 ms of which 0 ms to minimize.
[2022-05-17 10:16:14] [INFO ] Deduced a trap composed of 35 places in 99 ms of which 0 ms to minimize.
[2022-05-17 10:16:14] [INFO ] Deduced a trap composed of 40 places in 79 ms of which 1 ms to minimize.
[2022-05-17 10:16:14] [INFO ] Deduced a trap composed of 51 places in 79 ms of which 0 ms to minimize.
[2022-05-17 10:16:15] [INFO ] Deduced a trap composed of 51 places in 79 ms of which 0 ms to minimize.
[2022-05-17 10:16:15] [INFO ] Deduced a trap composed of 51 places in 76 ms of which 0 ms to minimize.
[2022-05-17 10:16:15] [INFO ] Deduced a trap composed of 50 places in 88 ms of which 0 ms to minimize.
[2022-05-17 10:16:15] [INFO ] Deduced a trap composed of 40 places in 76 ms of which 0 ms to minimize.
[2022-05-17 10:16:15] [INFO ] Deduced a trap composed of 51 places in 75 ms of which 1 ms to minimize.
[2022-05-17 10:16:15] [INFO ] Deduced a trap composed of 61 places in 59 ms of which 1 ms to minimize.
[2022-05-17 10:16:15] [INFO ] Deduced a trap composed of 41 places in 62 ms of which 1 ms to minimize.
[2022-05-17 10:16:15] [INFO ] Deduced a trap composed of 41 places in 59 ms of which 0 ms to minimize.
[2022-05-17 10:16:15] [INFO ] Deduced a trap composed of 41 places in 60 ms of which 1 ms to minimize.
[2022-05-17 10:16:15] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 2184 ms
[2022-05-17 10:16:16] [INFO ] Deduced a trap composed of 22 places in 93 ms of which 1 ms to minimize.
[2022-05-17 10:16:16] [INFO ] Deduced a trap composed of 41 places in 60 ms of which 0 ms to minimize.
[2022-05-17 10:16:16] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 223 ms
[2022-05-17 10:16:16] [INFO ] Deduced a trap composed of 29 places in 90 ms of which 0 ms to minimize.
[2022-05-17 10:16:16] [INFO ] Deduced a trap composed of 51 places in 54 ms of which 1 ms to minimize.
[2022-05-17 10:16:16] [INFO ] Deduced a trap composed of 50 places in 58 ms of which 0 ms to minimize.
[2022-05-17 10:16:16] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 290 ms
[2022-05-17 10:16:16] [INFO ] Deduced a trap composed of 31 places in 83 ms of which 1 ms to minimize.
[2022-05-17 10:16:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 136 ms
[2022-05-17 10:16:16] [INFO ] Deduced a trap composed of 49 places in 86 ms of which 0 ms to minimize.
[2022-05-17 10:16:16] [INFO ] Deduced a trap composed of 12 places in 84 ms of which 1 ms to minimize.
[2022-05-17 10:16:17] [INFO ] Deduced a trap composed of 21 places in 82 ms of which 1 ms to minimize.
[2022-05-17 10:16:17] [INFO ] Deduced a trap composed of 11 places in 69 ms of which 1 ms to minimize.
[2022-05-17 10:16:17] [INFO ] Deduced a trap composed of 13 places in 75 ms of which 1 ms to minimize.
[2022-05-17 10:16:17] [INFO ] Deduced a trap composed of 21 places in 68 ms of which 0 ms to minimize.
[2022-05-17 10:16:17] [INFO ] Deduced a trap composed of 14 places in 70 ms of which 1 ms to minimize.
[2022-05-17 10:16:17] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 710 ms
[2022-05-17 10:16:17] [INFO ] After 12423ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :19
Attempting to minimize the solution found.
Minimization took 941 ms.
[2022-05-17 10:16:18] [INFO ] After 14147ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :19
Parikh walk visited 0 properties in 212 ms.
Support contains 90 out of 349 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 349/349 places, 757/757 transitions.
Applied a total of 0 rules in 13 ms. Remains 349 /349 variables (removed 0) and now considering 757/757 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 349/349 places, 757/757 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 349/349 places, 757/757 transitions.
Applied a total of 0 rules in 12 ms. Remains 349 /349 variables (removed 0) and now considering 757/757 (removed 0) transitions.
[2022-05-17 10:16:18] [INFO ] Flow matrix only has 637 transitions (discarded 120 similar events)
// Phase 1: matrix 637 rows 349 cols
[2022-05-17 10:16:18] [INFO ] Computed 23 place invariants in 2 ms
[2022-05-17 10:16:18] [INFO ] Implicit Places using invariants in 168 ms returned [300, 320, 321, 322, 323, 324]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 171 ms to find 6 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 343/349 places, 757/757 transitions.
Applied a total of 0 rules in 12 ms. Remains 343 /343 variables (removed 0) and now considering 757/757 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 343/349 places, 757/757 transitions.
Successfully simplified 2 atomic propositions for a total of 16 simplifications.
[2022-05-17 10:16:18] [INFO ] Flatten gal took : 68 ms
[2022-05-17 10:16:19] [INFO ] Flatten gal took : 73 ms
[2022-05-17 10:16:19] [INFO ] Input system was already deterministic with 1242 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 834/834 places, 1242/1242 transitions.
Applied a total of 0 rules in 15 ms. Remains 834 /834 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
[2022-05-17 10:16:19] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
// Phase 1: matrix 1122 rows 834 cols
[2022-05-17 10:16:19] [INFO ] Computed 23 place invariants in 5 ms
[2022-05-17 10:16:19] [INFO ] Implicit Places using invariants in 142 ms returned []
[2022-05-17 10:16:19] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
// Phase 1: matrix 1122 rows 834 cols
[2022-05-17 10:16:19] [INFO ] Computed 23 place invariants in 3 ms
[2022-05-17 10:16:20] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-05-17 10:16:20] [INFO ] Implicit Places using invariants and state equation in 452 ms returned []
Implicit Place search using SMT with State Equation took 595 ms to find 0 implicit places.
[2022-05-17 10:16:20] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
// Phase 1: matrix 1122 rows 834 cols
[2022-05-17 10:16:20] [INFO ] Computed 23 place invariants in 4 ms
[2022-05-17 10:16:20] [INFO ] Dead Transitions using invariants and state equation in 523 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 834/834 places, 1242/1242 transitions.
[2022-05-17 10:16:20] [INFO ] Flatten gal took : 39 ms
[2022-05-17 10:16:20] [INFO ] Flatten gal took : 45 ms
[2022-05-17 10:16:20] [INFO ] Input system was already deterministic with 1242 transitions.
[2022-05-17 10:16:20] [INFO ] Flatten gal took : 42 ms
[2022-05-17 10:16:21] [INFO ] Flatten gal took : 46 ms
[2022-05-17 10:16:21] [INFO ] Time to serialize gal into /tmp/CTLFireability14580597346462982479.gal : 15 ms
[2022-05-17 10:16:21] [INFO ] Time to serialize properties into /tmp/CTLFireability15072388833341155601.ctl : 5 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability14580597346462982479.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15072388833341155601.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...276
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2022-05-17 10:16:51] [INFO ] Flatten gal took : 40 ms
[2022-05-17 10:16:51] [INFO ] Applying decomposition
[2022-05-17 10:16:51] [INFO ] Flatten gal took : 40 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph8287241545982561371.txt' '-o' '/tmp/graph8287241545982561371.bin' '-w' '/tmp/graph8287241545982561371.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph8287241545982561371.bin' '-l' '-1' '-v' '-w' '/tmp/graph8287241545982561371.weights' '-q' '0' '-e' '0.001'
[2022-05-17 10:16:51] [INFO ] Decomposing Gal with order
[2022-05-17 10:16:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 10:16:51] [INFO ] Removed a total of 1033 redundant transitions.
[2022-05-17 10:16:51] [INFO ] Flatten gal took : 135 ms
[2022-05-17 10:16:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 8 ms.
[2022-05-17 10:16:51] [INFO ] Time to serialize gal into /tmp/CTLFireability17982167467119994433.gal : 13 ms
[2022-05-17 10:16:51] [INFO ] Time to serialize properties into /tmp/CTLFireability7300377585199491732.ctl : 8 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability17982167467119994433.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7300377585199491732.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...254
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 834/834 places, 1242/1242 transitions.
Applied a total of 0 rules in 8 ms. Remains 834 /834 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
[2022-05-17 10:17:21] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
// Phase 1: matrix 1122 rows 834 cols
[2022-05-17 10:17:21] [INFO ] Computed 23 place invariants in 9 ms
[2022-05-17 10:17:22] [INFO ] Implicit Places using invariants in 160 ms returned []
[2022-05-17 10:17:22] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
// Phase 1: matrix 1122 rows 834 cols
[2022-05-17 10:17:22] [INFO ] Computed 23 place invariants in 3 ms
[2022-05-17 10:17:22] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-05-17 10:17:22] [INFO ] Implicit Places using invariants and state equation in 444 ms returned []
Implicit Place search using SMT with State Equation took 606 ms to find 0 implicit places.
[2022-05-17 10:17:22] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
// Phase 1: matrix 1122 rows 834 cols
[2022-05-17 10:17:22] [INFO ] Computed 23 place invariants in 5 ms
[2022-05-17 10:17:22] [INFO ] Dead Transitions using invariants and state equation in 514 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 834/834 places, 1242/1242 transitions.
[2022-05-17 10:17:23] [INFO ] Flatten gal took : 38 ms
[2022-05-17 10:17:23] [INFO ] Flatten gal took : 45 ms
[2022-05-17 10:17:23] [INFO ] Input system was already deterministic with 1242 transitions.
[2022-05-17 10:17:23] [INFO ] Flatten gal took : 37 ms
[2022-05-17 10:17:23] [INFO ] Flatten gal took : 35 ms
[2022-05-17 10:17:23] [INFO ] Time to serialize gal into /tmp/CTLFireability17038104583495050581.gal : 6 ms
[2022-05-17 10:17:23] [INFO ] Time to serialize properties into /tmp/CTLFireability17045650122922355147.ctl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability17038104583495050581.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17045650122922355147.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...276
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2022-05-17 10:17:53] [INFO ] Flatten gal took : 34 ms
[2022-05-17 10:17:53] [INFO ] Applying decomposition
[2022-05-17 10:17:53] [INFO ] Flatten gal took : 39 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph1334278843775356373.txt' '-o' '/tmp/graph1334278843775356373.bin' '-w' '/tmp/graph1334278843775356373.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph1334278843775356373.bin' '-l' '-1' '-v' '-w' '/tmp/graph1334278843775356373.weights' '-q' '0' '-e' '0.001'
[2022-05-17 10:17:53] [INFO ] Decomposing Gal with order
[2022-05-17 10:17:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 10:17:53] [INFO ] Removed a total of 1034 redundant transitions.
[2022-05-17 10:17:53] [INFO ] Flatten gal took : 67 ms
[2022-05-17 10:17:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 5 ms.
[2022-05-17 10:17:53] [INFO ] Time to serialize gal into /tmp/CTLFireability13503543539984249147.gal : 6 ms
[2022-05-17 10:17:53] [INFO ] Time to serialize properties into /tmp/CTLFireability7578374544492379362.ctl : 4 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability13503543539984249147.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7578374544492379362.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...254
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 834/834 places, 1242/1242 transitions.
Applied a total of 0 rules in 13 ms. Remains 834 /834 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
[2022-05-17 10:18:23] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
// Phase 1: matrix 1122 rows 834 cols
[2022-05-17 10:18:23] [INFO ] Computed 23 place invariants in 3 ms
[2022-05-17 10:18:24] [INFO ] Implicit Places using invariants in 209 ms returned []
[2022-05-17 10:18:24] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
// Phase 1: matrix 1122 rows 834 cols
[2022-05-17 10:18:24] [INFO ] Computed 23 place invariants in 5 ms
[2022-05-17 10:18:24] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-05-17 10:18:25] [INFO ] Implicit Places using invariants and state equation in 1475 ms returned []
Implicit Place search using SMT with State Equation took 1688 ms to find 0 implicit places.
[2022-05-17 10:18:25] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
// Phase 1: matrix 1122 rows 834 cols
[2022-05-17 10:18:25] [INFO ] Computed 23 place invariants in 8 ms
[2022-05-17 10:18:26] [INFO ] Dead Transitions using invariants and state equation in 538 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 834/834 places, 1242/1242 transitions.
[2022-05-17 10:18:26] [INFO ] Flatten gal took : 32 ms
[2022-05-17 10:18:26] [INFO ] Flatten gal took : 29 ms
[2022-05-17 10:18:26] [INFO ] Input system was already deterministic with 1242 transitions.
[2022-05-17 10:18:26] [INFO ] Flatten gal took : 29 ms
[2022-05-17 10:18:26] [INFO ] Flatten gal took : 29 ms
[2022-05-17 10:18:26] [INFO ] Time to serialize gal into /tmp/CTLFireability13226680820141873350.gal : 3 ms
[2022-05-17 10:18:26] [INFO ] Time to serialize properties into /tmp/CTLFireability7516861735719464293.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability13226680820141873350.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7516861735719464293.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...275
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2022-05-17 10:18:56] [INFO ] Flatten gal took : 37 ms
[2022-05-17 10:18:56] [INFO ] Applying decomposition
[2022-05-17 10:18:56] [INFO ] Flatten gal took : 29 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph7099377961247516927.txt' '-o' '/tmp/graph7099377961247516927.bin' '-w' '/tmp/graph7099377961247516927.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph7099377961247516927.bin' '-l' '-1' '-v' '-w' '/tmp/graph7099377961247516927.weights' '-q' '0' '-e' '0.001'
[2022-05-17 10:18:56] [INFO ] Decomposing Gal with order
[2022-05-17 10:18:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 10:18:56] [INFO ] Removed a total of 1035 redundant transitions.
[2022-05-17 10:18:56] [INFO ] Flatten gal took : 58 ms
[2022-05-17 10:18:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2022-05-17 10:18:56] [INFO ] Time to serialize gal into /tmp/CTLFireability2832367305721502517.gal : 6 ms
[2022-05-17 10:18:56] [INFO ] Time to serialize properties into /tmp/CTLFireability11795405487935610941.ctl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability2832367305721502517.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11795405487935610941.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...254
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 834/834 places, 1242/1242 transitions.
Applied a total of 0 rules in 16 ms. Remains 834 /834 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
[2022-05-17 10:19:26] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
// Phase 1: matrix 1122 rows 834 cols
[2022-05-17 10:19:26] [INFO ] Computed 23 place invariants in 5 ms
[2022-05-17 10:19:27] [INFO ] Implicit Places using invariants in 213 ms returned []
[2022-05-17 10:19:27] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
// Phase 1: matrix 1122 rows 834 cols
[2022-05-17 10:19:27] [INFO ] Computed 23 place invariants in 3 ms
[2022-05-17 10:19:27] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-05-17 10:19:28] [INFO ] Implicit Places using invariants and state equation in 1483 ms returned []
Implicit Place search using SMT with State Equation took 1699 ms to find 0 implicit places.
[2022-05-17 10:19:28] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
// Phase 1: matrix 1122 rows 834 cols
[2022-05-17 10:19:28] [INFO ] Computed 23 place invariants in 3 ms
[2022-05-17 10:19:29] [INFO ] Dead Transitions using invariants and state equation in 507 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 834/834 places, 1242/1242 transitions.
[2022-05-17 10:19:29] [INFO ] Flatten gal took : 27 ms
[2022-05-17 10:19:29] [INFO ] Flatten gal took : 28 ms
[2022-05-17 10:19:29] [INFO ] Input system was already deterministic with 1242 transitions.
[2022-05-17 10:19:29] [INFO ] Flatten gal took : 29 ms
[2022-05-17 10:19:29] [INFO ] Flatten gal took : 29 ms
[2022-05-17 10:19:29] [INFO ] Time to serialize gal into /tmp/CTLFireability7636894797467775813.gal : 3 ms
[2022-05-17 10:19:29] [INFO ] Time to serialize properties into /tmp/CTLFireability11226975970813143531.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability7636894797467775813.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11226975970813143531.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...275
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2022-05-17 10:19:59] [INFO ] Flatten gal took : 30 ms
[2022-05-17 10:19:59] [INFO ] Applying decomposition
[2022-05-17 10:19:59] [INFO ] Flatten gal took : 34 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph14423127064289841683.txt' '-o' '/tmp/graph14423127064289841683.bin' '-w' '/tmp/graph14423127064289841683.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph14423127064289841683.bin' '-l' '-1' '-v' '-w' '/tmp/graph14423127064289841683.weights' '-q' '0' '-e' '0.001'
[2022-05-17 10:19:59] [INFO ] Decomposing Gal with order
[2022-05-17 10:19:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 10:19:59] [INFO ] Removed a total of 1034 redundant transitions.
[2022-05-17 10:19:59] [INFO ] Flatten gal took : 51 ms
[2022-05-17 10:19:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 4 ms.
[2022-05-17 10:19:59] [INFO ] Time to serialize gal into /tmp/CTLFireability7776366792981388211.gal : 5 ms
[2022-05-17 10:19:59] [INFO ] Time to serialize properties into /tmp/CTLFireability10270237349607591.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability7776366792981388211.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10270237349607591.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...251
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 834/834 places, 1242/1242 transitions.
Applied a total of 0 rules in 19 ms. Remains 834 /834 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
[2022-05-17 10:20:29] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
// Phase 1: matrix 1122 rows 834 cols
[2022-05-17 10:20:29] [INFO ] Computed 23 place invariants in 6 ms
[2022-05-17 10:20:30] [INFO ] Implicit Places using invariants in 214 ms returned [785, 805, 806, 807, 808, 809]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 216 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 828/834 places, 1242/1242 transitions.
Applied a total of 0 rules in 16 ms. Remains 828 /828 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 828/834 places, 1242/1242 transitions.
[2022-05-17 10:20:30] [INFO ] Flatten gal took : 24 ms
[2022-05-17 10:20:30] [INFO ] Flatten gal took : 27 ms
[2022-05-17 10:20:30] [INFO ] Input system was already deterministic with 1242 transitions.
[2022-05-17 10:20:30] [INFO ] Flatten gal took : 27 ms
[2022-05-17 10:20:30] [INFO ] Flatten gal took : 32 ms
[2022-05-17 10:20:30] [INFO ] Time to serialize gal into /tmp/CTLFireability672256220337262510.gal : 3 ms
[2022-05-17 10:20:30] [INFO ] Time to serialize properties into /tmp/CTLFireability14246134350706909206.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability672256220337262510.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14246134350706909206.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...274
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2022-05-17 10:21:00] [INFO ] Flatten gal took : 27 ms
[2022-05-17 10:21:00] [INFO ] Applying decomposition
[2022-05-17 10:21:00] [INFO ] Flatten gal took : 27 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph2483597249956876171.txt' '-o' '/tmp/graph2483597249956876171.bin' '-w' '/tmp/graph2483597249956876171.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph2483597249956876171.bin' '-l' '-1' '-v' '-w' '/tmp/graph2483597249956876171.weights' '-q' '0' '-e' '0.001'
[2022-05-17 10:21:00] [INFO ] Decomposing Gal with order
[2022-05-17 10:21:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 10:21:00] [INFO ] Removed a total of 1038 redundant transitions.
[2022-05-17 10:21:00] [INFO ] Flatten gal took : 56 ms
[2022-05-17 10:21:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 4 ms.
[2022-05-17 10:21:00] [INFO ] Time to serialize gal into /tmp/CTLFireability5980723725134061043.gal : 6 ms
[2022-05-17 10:21:00] [INFO ] Time to serialize properties into /tmp/CTLFireability15246042477493720140.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability5980723725134061043.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15246042477493720140.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...254
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 834/834 places, 1242/1242 transitions.
Applied a total of 0 rules in 11 ms. Remains 834 /834 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
[2022-05-17 10:21:30] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
// Phase 1: matrix 1122 rows 834 cols
[2022-05-17 10:21:30] [INFO ] Computed 23 place invariants in 7 ms
[2022-05-17 10:21:30] [INFO ] Implicit Places using invariants in 245 ms returned [785, 805, 806, 807, 808, 809]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 247 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 828/834 places, 1242/1242 transitions.
Applied a total of 0 rules in 11 ms. Remains 828 /828 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 828/834 places, 1242/1242 transitions.
[2022-05-17 10:21:30] [INFO ] Flatten gal took : 25 ms
[2022-05-17 10:21:30] [INFO ] Flatten gal took : 27 ms
[2022-05-17 10:21:31] [INFO ] Input system was already deterministic with 1242 transitions.
[2022-05-17 10:21:31] [INFO ] Flatten gal took : 34 ms
[2022-05-17 10:21:31] [INFO ] Flatten gal took : 26 ms
[2022-05-17 10:21:31] [INFO ] Time to serialize gal into /tmp/CTLFireability18204839514603655310.gal : 3 ms
[2022-05-17 10:21:31] [INFO ] Time to serialize properties into /tmp/CTLFireability15967519821058079488.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability18204839514603655310.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15967519821058079488.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...276
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2022-05-17 10:22:01] [INFO ] Flatten gal took : 31 ms
[2022-05-17 10:22:01] [INFO ] Applying decomposition
[2022-05-17 10:22:01] [INFO ] Flatten gal took : 27 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph12743484594357845927.txt' '-o' '/tmp/graph12743484594357845927.bin' '-w' '/tmp/graph12743484594357845927.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph12743484594357845927.bin' '-l' '-1' '-v' '-w' '/tmp/graph12743484594357845927.weights' '-q' '0' '-e' '0.001'
[2022-05-17 10:22:01] [INFO ] Decomposing Gal with order
[2022-05-17 10:22:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 10:22:01] [INFO ] Removed a total of 1038 redundant transitions.
[2022-05-17 10:22:01] [INFO ] Flatten gal took : 55 ms
[2022-05-17 10:22:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2022-05-17 10:22:01] [INFO ] Time to serialize gal into /tmp/CTLFireability7356042915432163664.gal : 6 ms
[2022-05-17 10:22:01] [INFO ] Time to serialize properties into /tmp/CTLFireability3392831598729030876.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability7356042915432163664.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3392831598729030876.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...253
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 834/834 places, 1242/1242 transitions.
Applied a total of 0 rules in 11 ms. Remains 834 /834 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
[2022-05-17 10:22:31] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
// Phase 1: matrix 1122 rows 834 cols
[2022-05-17 10:22:31] [INFO ] Computed 23 place invariants in 2 ms
[2022-05-17 10:22:31] [INFO ] Implicit Places using invariants in 166 ms returned [785, 805, 806, 807, 808, 809]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 167 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 828/834 places, 1242/1242 transitions.
Applied a total of 0 rules in 4 ms. Remains 828 /828 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 828/834 places, 1242/1242 transitions.
[2022-05-17 10:22:31] [INFO ] Flatten gal took : 25 ms
[2022-05-17 10:22:31] [INFO ] Flatten gal took : 30 ms
[2022-05-17 10:22:31] [INFO ] Input system was already deterministic with 1242 transitions.
[2022-05-17 10:22:31] [INFO ] Flatten gal took : 35 ms
[2022-05-17 10:22:31] [INFO ] Flatten gal took : 30 ms
[2022-05-17 10:22:31] [INFO ] Time to serialize gal into /tmp/CTLFireability10786000007981595976.gal : 2 ms
[2022-05-17 10:22:31] [INFO ] Time to serialize properties into /tmp/CTLFireability14398946671042523367.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability10786000007981595976.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14398946671042523367.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...276
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2022-05-17 10:23:02] [INFO ] Flatten gal took : 30 ms
[2022-05-17 10:23:02] [INFO ] Applying decomposition
[2022-05-17 10:23:02] [INFO ] Flatten gal took : 30 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph9697339169368519014.txt' '-o' '/tmp/graph9697339169368519014.bin' '-w' '/tmp/graph9697339169368519014.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph9697339169368519014.bin' '-l' '-1' '-v' '-w' '/tmp/graph9697339169368519014.weights' '-q' '0' '-e' '0.001'
[2022-05-17 10:23:02] [INFO ] Decomposing Gal with order
[2022-05-17 10:23:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 10:23:02] [INFO ] Removed a total of 1038 redundant transitions.
[2022-05-17 10:23:02] [INFO ] Flatten gal took : 52 ms
[2022-05-17 10:23:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2022-05-17 10:23:02] [INFO ] Time to serialize gal into /tmp/CTLFireability8320469514754850992.gal : 10 ms
[2022-05-17 10:23:02] [INFO ] Time to serialize properties into /tmp/CTLFireability11529363200137956205.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability8320469514754850992.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11529363200137956205.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...254
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 834/834 places, 1242/1242 transitions.
Applied a total of 0 rules in 21 ms. Remains 834 /834 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
[2022-05-17 10:23:32] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
// Phase 1: matrix 1122 rows 834 cols
[2022-05-17 10:23:32] [INFO ] Computed 23 place invariants in 8 ms
[2022-05-17 10:23:32] [INFO ] Implicit Places using invariants in 228 ms returned [785, 805, 806, 807, 808, 809]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 229 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 828/834 places, 1242/1242 transitions.
Applied a total of 0 rules in 11 ms. Remains 828 /828 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 828/834 places, 1242/1242 transitions.
[2022-05-17 10:23:32] [INFO ] Flatten gal took : 24 ms
[2022-05-17 10:23:32] [INFO ] Flatten gal took : 30 ms
[2022-05-17 10:23:32] [INFO ] Input system was already deterministic with 1242 transitions.
[2022-05-17 10:23:32] [INFO ] Flatten gal took : 25 ms
[2022-05-17 10:23:32] [INFO ] Flatten gal took : 26 ms
[2022-05-17 10:23:32] [INFO ] Time to serialize gal into /tmp/CTLFireability17198353893048756593.gal : 3 ms
[2022-05-17 10:23:32] [INFO ] Time to serialize properties into /tmp/CTLFireability16162636276069358473.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability17198353893048756593.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16162636276069358473.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...276
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2022-05-17 10:24:02] [INFO ] Flatten gal took : 25 ms
[2022-05-17 10:24:02] [INFO ] Applying decomposition
[2022-05-17 10:24:02] [INFO ] Flatten gal took : 25 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph599327653337840442.txt' '-o' '/tmp/graph599327653337840442.bin' '-w' '/tmp/graph599327653337840442.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph599327653337840442.bin' '-l' '-1' '-v' '-w' '/tmp/graph599327653337840442.weights' '-q' '0' '-e' '0.001'
[2022-05-17 10:24:03] [INFO ] Decomposing Gal with order
[2022-05-17 10:24:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 10:24:03] [INFO ] Removed a total of 1038 redundant transitions.
[2022-05-17 10:24:03] [INFO ] Flatten gal took : 44 ms
[2022-05-17 10:24:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2022-05-17 10:24:03] [INFO ] Time to serialize gal into /tmp/CTLFireability8088251241913081509.gal : 5 ms
[2022-05-17 10:24:03] [INFO ] Time to serialize properties into /tmp/CTLFireability7860687591854544092.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability8088251241913081509.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7860687591854544092.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...253
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 834/834 places, 1242/1242 transitions.
Applied a total of 0 rules in 19 ms. Remains 834 /834 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
[2022-05-17 10:24:33] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
// Phase 1: matrix 1122 rows 834 cols
[2022-05-17 10:24:33] [INFO ] Computed 23 place invariants in 12 ms
[2022-05-17 10:24:33] [INFO ] Implicit Places using invariants in 279 ms returned [785, 805, 806, 807, 808, 809]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 280 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 828/834 places, 1242/1242 transitions.
Applied a total of 0 rules in 13 ms. Remains 828 /828 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 828/834 places, 1242/1242 transitions.
[2022-05-17 10:24:33] [INFO ] Flatten gal took : 24 ms
[2022-05-17 10:24:33] [INFO ] Flatten gal took : 25 ms
[2022-05-17 10:24:33] [INFO ] Input system was already deterministic with 1242 transitions.
[2022-05-17 10:24:33] [INFO ] Flatten gal took : 27 ms
[2022-05-17 10:24:33] [INFO ] Flatten gal took : 25 ms
[2022-05-17 10:24:33] [INFO ] Time to serialize gal into /tmp/CTLFireability1306894486351721761.gal : 3 ms
[2022-05-17 10:24:33] [INFO ] Time to serialize properties into /tmp/CTLFireability1510501523991226697.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability1306894486351721761.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1510501523991226697.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...274
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2022-05-17 10:25:03] [INFO ] Flatten gal took : 29 ms
[2022-05-17 10:25:03] [INFO ] Applying decomposition
[2022-05-17 10:25:03] [INFO ] Flatten gal took : 25 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph2372984363999158736.txt' '-o' '/tmp/graph2372984363999158736.bin' '-w' '/tmp/graph2372984363999158736.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph2372984363999158736.bin' '-l' '-1' '-v' '-w' '/tmp/graph2372984363999158736.weights' '-q' '0' '-e' '0.001'
[2022-05-17 10:25:03] [INFO ] Decomposing Gal with order
[2022-05-17 10:25:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 10:25:03] [INFO ] Removed a total of 1038 redundant transitions.
[2022-05-17 10:25:03] [INFO ] Flatten gal took : 43 ms
[2022-05-17 10:25:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2022-05-17 10:25:04] [INFO ] Time to serialize gal into /tmp/CTLFireability14781863896752072116.gal : 4 ms
[2022-05-17 10:25:04] [INFO ] Time to serialize properties into /tmp/CTLFireability9805165683431586260.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability14781863896752072116.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9805165683431586260.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...254
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 834/834 places, 1242/1242 transitions.
Drop transitions removed 352 transitions
Trivial Post-agglo rules discarded 352 transitions
Performed 352 trivial Post agglomeration. Transition count delta: 352
Iterating post reduction 0 with 352 rules applied. Total rules applied 352 place count 834 transition count 890
Reduce places removed 352 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 355 rules applied. Total rules applied 707 place count 482 transition count 887
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 710 place count 479 transition count 887
Performed 175 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 175 Pre rules applied. Total rules applied 710 place count 479 transition count 712
Deduced a syphon composed of 175 places in 1 ms
Reduce places removed 175 places and 0 transitions.
Iterating global reduction 3 with 350 rules applied. Total rules applied 1060 place count 304 transition count 712
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 1 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 3 with 58 rules applied. Total rules applied 1118 place count 275 transition count 683
Applied a total of 1118 rules in 65 ms. Remains 275 /834 variables (removed 559) and now considering 683/1242 (removed 559) transitions.
[2022-05-17 10:25:34] [INFO ] Flow matrix only has 563 transitions (discarded 120 similar events)
// Phase 1: matrix 563 rows 275 cols
[2022-05-17 10:25:34] [INFO ] Computed 23 place invariants in 1 ms
[2022-05-17 10:25:34] [INFO ] Implicit Places using invariants in 152 ms returned [239, 251, 252, 253, 254, 255]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 153 ms to find 6 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 269/834 places, 683/1242 transitions.
Applied a total of 0 rules in 19 ms. Remains 269 /269 variables (removed 0) and now considering 683/683 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 269/834 places, 683/1242 transitions.
[2022-05-17 10:25:34] [INFO ] Flatten gal took : 15 ms
[2022-05-17 10:25:34] [INFO ] Flatten gal took : 16 ms
[2022-05-17 10:25:34] [INFO ] Input system was already deterministic with 683 transitions.
[2022-05-17 10:25:34] [INFO ] Flatten gal took : 16 ms
[2022-05-17 10:25:34] [INFO ] Flatten gal took : 16 ms
[2022-05-17 10:25:34] [INFO ] Time to serialize gal into /tmp/CTLFireability13114742888741924400.gal : 2 ms
[2022-05-17 10:25:34] [INFO ] Time to serialize properties into /tmp/CTLFireability10508713570771985805.ctl : 317 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability13114742888741924400.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10508713570771985805.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...276
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2022-05-17 10:26:04] [INFO ] Flatten gal took : 25 ms
[2022-05-17 10:26:04] [INFO ] Applying decomposition
[2022-05-17 10:26:04] [INFO ] Flatten gal took : 16 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph10048747576682982052.txt' '-o' '/tmp/graph10048747576682982052.bin' '-w' '/tmp/graph10048747576682982052.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph10048747576682982052.bin' '-l' '-1' '-v' '-w' '/tmp/graph10048747576682982052.weights' '-q' '0' '-e' '0.001'
[2022-05-17 10:26:04] [INFO ] Decomposing Gal with order
[2022-05-17 10:26:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 10:26:04] [INFO ] Removed a total of 914 redundant transitions.
[2022-05-17 10:26:04] [INFO ] Flatten gal took : 29 ms
[2022-05-17 10:26:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 217 labels/synchronizations in 17 ms.
[2022-05-17 10:26:04] [INFO ] Time to serialize gal into /tmp/CTLFireability4027676108668382751.gal : 3 ms
[2022-05-17 10:26:04] [INFO ] Time to serialize properties into /tmp/CTLFireability2681472167042279535.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability4027676108668382751.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2681472167042279535.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...253
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 834/834 places, 1242/1242 transitions.
Applied a total of 0 rules in 22 ms. Remains 834 /834 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
[2022-05-17 10:26:34] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
// Phase 1: matrix 1122 rows 834 cols
[2022-05-17 10:26:34] [INFO ] Computed 23 place invariants in 6 ms
[2022-05-17 10:26:35] [INFO ] Implicit Places using invariants in 269 ms returned [785, 805, 806, 807, 808, 809]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 270 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 828/834 places, 1242/1242 transitions.
Applied a total of 0 rules in 14 ms. Remains 828 /828 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 828/834 places, 1242/1242 transitions.
[2022-05-17 10:26:35] [INFO ] Flatten gal took : 24 ms
[2022-05-17 10:26:35] [INFO ] Flatten gal took : 28 ms
[2022-05-17 10:26:35] [INFO ] Input system was already deterministic with 1242 transitions.
[2022-05-17 10:26:35] [INFO ] Flatten gal took : 27 ms
[2022-05-17 10:26:35] [INFO ] Flatten gal took : 25 ms
[2022-05-17 10:26:35] [INFO ] Time to serialize gal into /tmp/CTLFireability6992775248126890532.gal : 3 ms
[2022-05-17 10:26:35] [INFO ] Time to serialize properties into /tmp/CTLFireability4552489268993127067.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability6992775248126890532.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4552489268993127067.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...274
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2022-05-17 10:27:05] [INFO ] Flatten gal took : 30 ms
[2022-05-17 10:27:05] [INFO ] Applying decomposition
[2022-05-17 10:27:05] [INFO ] Flatten gal took : 25 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph9506641827894009175.txt' '-o' '/tmp/graph9506641827894009175.bin' '-w' '/tmp/graph9506641827894009175.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph9506641827894009175.bin' '-l' '-1' '-v' '-w' '/tmp/graph9506641827894009175.weights' '-q' '0' '-e' '0.001'
[2022-05-17 10:27:05] [INFO ] Decomposing Gal with order
[2022-05-17 10:27:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 10:27:05] [INFO ] Removed a total of 1038 redundant transitions.
[2022-05-17 10:27:05] [INFO ] Flatten gal took : 42 ms
[2022-05-17 10:27:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2022-05-17 10:27:05] [INFO ] Time to serialize gal into /tmp/CTLFireability14145571945230672174.gal : 5 ms
[2022-05-17 10:27:05] [INFO ] Time to serialize properties into /tmp/CTLFireability17511759999106211077.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability14145571945230672174.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17511759999106211077.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...255
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 834/834 places, 1242/1242 transitions.
Drop transitions removed 355 transitions
Trivial Post-agglo rules discarded 355 transitions
Performed 355 trivial Post agglomeration. Transition count delta: 355
Iterating post reduction 0 with 355 rules applied. Total rules applied 355 place count 834 transition count 887
Reduce places removed 355 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 357 rules applied. Total rules applied 712 place count 479 transition count 885
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 714 place count 477 transition count 885
Performed 178 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 178 Pre rules applied. Total rules applied 714 place count 477 transition count 707
Deduced a syphon composed of 178 places in 0 ms
Reduce places removed 178 places and 0 transitions.
Iterating global reduction 3 with 356 rules applied. Total rules applied 1070 place count 299 transition count 707
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 3 with 60 rules applied. Total rules applied 1130 place count 269 transition count 677
Applied a total of 1130 rules in 43 ms. Remains 269 /834 variables (removed 565) and now considering 677/1242 (removed 565) transitions.
[2022-05-17 10:27:35] [INFO ] Flow matrix only has 557 transitions (discarded 120 similar events)
// Phase 1: matrix 557 rows 269 cols
[2022-05-17 10:27:35] [INFO ] Computed 23 place invariants in 1 ms
[2022-05-17 10:27:35] [INFO ] Implicit Places using invariants in 154 ms returned [233, 245, 246, 247, 248, 249]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 155 ms to find 6 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 263/834 places, 677/1242 transitions.
Applied a total of 0 rules in 9 ms. Remains 263 /263 variables (removed 0) and now considering 677/677 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 263/834 places, 677/1242 transitions.
[2022-05-17 10:27:35] [INFO ] Flatten gal took : 14 ms
[2022-05-17 10:27:36] [INFO ] Flatten gal took : 15 ms
[2022-05-17 10:27:36] [INFO ] Input system was already deterministic with 677 transitions.
[2022-05-17 10:27:36] [INFO ] Flatten gal took : 19 ms
[2022-05-17 10:27:36] [INFO ] Flatten gal took : 16 ms
[2022-05-17 10:27:36] [INFO ] Time to serialize gal into /tmp/CTLFireability4078589143600214352.gal : 2 ms
[2022-05-17 10:27:36] [INFO ] Time to serialize properties into /tmp/CTLFireability16148421774529617425.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability4078589143600214352.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16148421774529617425.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...275
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2022-05-17 10:28:06] [INFO ] Flatten gal took : 16 ms
[2022-05-17 10:28:06] [INFO ] Applying decomposition
[2022-05-17 10:28:06] [INFO ] Flatten gal took : 16 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph6977686151051330156.txt' '-o' '/tmp/graph6977686151051330156.bin' '-w' '/tmp/graph6977686151051330156.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph6977686151051330156.bin' '-l' '-1' '-v' '-w' '/tmp/graph6977686151051330156.weights' '-q' '0' '-e' '0.001'
[2022-05-17 10:28:06] [INFO ] Decomposing Gal with order
[2022-05-17 10:28:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 10:28:06] [INFO ] Removed a total of 919 redundant transitions.
[2022-05-17 10:28:06] [INFO ] Flatten gal took : 31 ms
[2022-05-17 10:28:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 218 labels/synchronizations in 9 ms.
[2022-05-17 10:28:06] [INFO ] Time to serialize gal into /tmp/CTLFireability14095876988913437795.gal : 3 ms
[2022-05-17 10:28:06] [INFO ] Time to serialize properties into /tmp/CTLFireability13532509462778992788.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability14095876988913437795.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13532509462778992788.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...255
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 834/834 places, 1242/1242 transitions.
Applied a total of 0 rules in 17 ms. Remains 834 /834 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
[2022-05-17 10:28:36] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
// Phase 1: matrix 1122 rows 834 cols
[2022-05-17 10:28:36] [INFO ] Computed 23 place invariants in 6 ms
[2022-05-17 10:28:36] [INFO ] Implicit Places using invariants in 270 ms returned [785, 805, 806, 807, 808, 809]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 271 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 828/834 places, 1242/1242 transitions.
Applied a total of 0 rules in 16 ms. Remains 828 /828 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 828/834 places, 1242/1242 transitions.
[2022-05-17 10:28:36] [INFO ] Flatten gal took : 23 ms
[2022-05-17 10:28:36] [INFO ] Flatten gal took : 26 ms
[2022-05-17 10:28:36] [INFO ] Input system was already deterministic with 1242 transitions.
[2022-05-17 10:28:36] [INFO ] Flatten gal took : 25 ms
[2022-05-17 10:28:36] [INFO ] Flatten gal took : 25 ms
[2022-05-17 10:28:36] [INFO ] Time to serialize gal into /tmp/CTLFireability447575543790897844.gal : 7 ms
[2022-05-17 10:28:36] [INFO ] Time to serialize properties into /tmp/CTLFireability4277193314040956311.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability447575543790897844.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4277193314040956311.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...273
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2022-05-17 10:29:06] [INFO ] Flatten gal took : 29 ms
[2022-05-17 10:29:06] [INFO ] Applying decomposition
[2022-05-17 10:29:06] [INFO ] Flatten gal took : 25 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph15552881747172378243.txt' '-o' '/tmp/graph15552881747172378243.bin' '-w' '/tmp/graph15552881747172378243.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph15552881747172378243.bin' '-l' '-1' '-v' '-w' '/tmp/graph15552881747172378243.weights' '-q' '0' '-e' '0.001'
[2022-05-17 10:29:06] [INFO ] Decomposing Gal with order
[2022-05-17 10:29:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 10:29:07] [INFO ] Removed a total of 1038 redundant transitions.
[2022-05-17 10:29:07] [INFO ] Flatten gal took : 46 ms
[2022-05-17 10:29:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2022-05-17 10:29:07] [INFO ] Time to serialize gal into /tmp/CTLFireability17311700264277310457.gal : 4 ms
[2022-05-17 10:29:07] [INFO ] Time to serialize properties into /tmp/CTLFireability3432182712294641416.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability17311700264277310457.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3432182712294641416.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...254
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 834/834 places, 1242/1242 transitions.
Drop transitions removed 356 transitions
Trivial Post-agglo rules discarded 356 transitions
Performed 356 trivial Post agglomeration. Transition count delta: 356
Iterating post reduction 0 with 356 rules applied. Total rules applied 356 place count 834 transition count 886
Reduce places removed 356 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 357 rules applied. Total rules applied 713 place count 478 transition count 885
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 714 place count 477 transition count 885
Performed 179 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 179 Pre rules applied. Total rules applied 714 place count 477 transition count 706
Deduced a syphon composed of 179 places in 0 ms
Reduce places removed 179 places and 0 transitions.
Iterating global reduction 3 with 358 rules applied. Total rules applied 1072 place count 298 transition count 706
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 3 with 60 rules applied. Total rules applied 1132 place count 268 transition count 676
Applied a total of 1132 rules in 36 ms. Remains 268 /834 variables (removed 566) and now considering 676/1242 (removed 566) transitions.
[2022-05-17 10:29:37] [INFO ] Flow matrix only has 556 transitions (discarded 120 similar events)
// Phase 1: matrix 556 rows 268 cols
[2022-05-17 10:29:37] [INFO ] Computed 23 place invariants in 3 ms
[2022-05-17 10:29:37] [INFO ] Implicit Places using invariants in 158 ms returned [232, 244, 245, 246, 247, 248]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 160 ms to find 6 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 262/834 places, 676/1242 transitions.
Applied a total of 0 rules in 10 ms. Remains 262 /262 variables (removed 0) and now considering 676/676 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 262/834 places, 676/1242 transitions.
[2022-05-17 10:29:37] [INFO ] Flatten gal took : 14 ms
[2022-05-17 10:29:37] [INFO ] Flatten gal took : 16 ms
[2022-05-17 10:29:37] [INFO ] Input system was already deterministic with 676 transitions.
[2022-05-17 10:29:37] [INFO ] Flatten gal took : 15 ms
[2022-05-17 10:29:37] [INFO ] Flatten gal took : 15 ms
[2022-05-17 10:29:37] [INFO ] Time to serialize gal into /tmp/CTLFireability6290107280289147227.gal : 1 ms
[2022-05-17 10:29:37] [INFO ] Time to serialize properties into /tmp/CTLFireability587892076463974682.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability6290107280289147227.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability587892076463974682.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...273
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2022-05-17 10:30:07] [INFO ] Flatten gal took : 18 ms
[2022-05-17 10:30:07] [INFO ] Applying decomposition
[2022-05-17 10:30:07] [INFO ] Flatten gal took : 22 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph13945327940993132129.txt' '-o' '/tmp/graph13945327940993132129.bin' '-w' '/tmp/graph13945327940993132129.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph13945327940993132129.bin' '-l' '-1' '-v' '-w' '/tmp/graph13945327940993132129.weights' '-q' '0' '-e' '0.001'
[2022-05-17 10:30:07] [INFO ] Decomposing Gal with order
[2022-05-17 10:30:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 10:30:07] [INFO ] Removed a total of 918 redundant transitions.
[2022-05-17 10:30:07] [INFO ] Flatten gal took : 33 ms
[2022-05-17 10:30:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 236 labels/synchronizations in 8 ms.
[2022-05-17 10:30:07] [INFO ] Time to serialize gal into /tmp/CTLFireability2387743065933620461.gal : 2 ms
[2022-05-17 10:30:07] [INFO ] Time to serialize properties into /tmp/CTLFireability18366009982654671852.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability2387743065933620461.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18366009982654671852.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...254
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 834/834 places, 1242/1242 transitions.
Applied a total of 0 rules in 11 ms. Remains 834 /834 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
[2022-05-17 10:30:37] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
// Phase 1: matrix 1122 rows 834 cols
[2022-05-17 10:30:37] [INFO ] Computed 23 place invariants in 9 ms
[2022-05-17 10:30:37] [INFO ] Implicit Places using invariants in 269 ms returned [785, 805, 806, 807, 808, 809]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 274 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 828/834 places, 1242/1242 transitions.
Applied a total of 0 rules in 13 ms. Remains 828 /828 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 828/834 places, 1242/1242 transitions.
[2022-05-17 10:30:37] [INFO ] Flatten gal took : 24 ms
[2022-05-17 10:30:38] [INFO ] Flatten gal took : 36 ms
[2022-05-17 10:30:38] [INFO ] Input system was already deterministic with 1242 transitions.
[2022-05-17 10:30:38] [INFO ] Flatten gal took : 25 ms
[2022-05-17 10:30:38] [INFO ] Flatten gal took : 26 ms
[2022-05-17 10:30:38] [INFO ] Time to serialize gal into /tmp/CTLFireability10810273436297025357.gal : 3 ms
[2022-05-17 10:30:38] [INFO ] Time to serialize properties into /tmp/CTLFireability1834119062091783525.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability10810273436297025357.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1834119062091783525.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...275
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2022-05-17 10:31:08] [INFO ] Flatten gal took : 28 ms
[2022-05-17 10:31:08] [INFO ] Applying decomposition
[2022-05-17 10:31:08] [INFO ] Flatten gal took : 25 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph2358518654631349489.txt' '-o' '/tmp/graph2358518654631349489.bin' '-w' '/tmp/graph2358518654631349489.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph2358518654631349489.bin' '-l' '-1' '-v' '-w' '/tmp/graph2358518654631349489.weights' '-q' '0' '-e' '0.001'
[2022-05-17 10:31:08] [INFO ] Decomposing Gal with order
[2022-05-17 10:31:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 10:31:08] [INFO ] Removed a total of 1038 redundant transitions.
[2022-05-17 10:31:08] [INFO ] Flatten gal took : 41 ms
[2022-05-17 10:31:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2022-05-17 10:31:08] [INFO ] Time to serialize gal into /tmp/CTLFireability7202130183275282264.gal : 4 ms
[2022-05-17 10:31:08] [INFO ] Time to serialize properties into /tmp/CTLFireability9887075047772934828.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability7202130183275282264.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9887075047772934828.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...253
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 834/834 places, 1242/1242 transitions.
Drop transitions removed 358 transitions
Trivial Post-agglo rules discarded 358 transitions
Performed 358 trivial Post agglomeration. Transition count delta: 358
Iterating post reduction 0 with 358 rules applied. Total rules applied 358 place count 834 transition count 884
Reduce places removed 358 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 359 rules applied. Total rules applied 717 place count 476 transition count 883
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 718 place count 475 transition count 883
Performed 179 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 179 Pre rules applied. Total rules applied 718 place count 475 transition count 704
Deduced a syphon composed of 179 places in 1 ms
Reduce places removed 179 places and 0 transitions.
Iterating global reduction 3 with 358 rules applied. Total rules applied 1076 place count 296 transition count 704
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 3 with 60 rules applied. Total rules applied 1136 place count 266 transition count 674
Applied a total of 1136 rules in 35 ms. Remains 266 /834 variables (removed 568) and now considering 674/1242 (removed 568) transitions.
[2022-05-17 10:31:38] [INFO ] Flow matrix only has 554 transitions (discarded 120 similar events)
// Phase 1: matrix 554 rows 266 cols
[2022-05-17 10:31:38] [INFO ] Computed 23 place invariants in 4 ms
[2022-05-17 10:31:38] [INFO ] Implicit Places using invariants in 167 ms returned [230, 242, 243, 244, 245, 246]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 169 ms to find 6 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 260/834 places, 674/1242 transitions.
Applied a total of 0 rules in 12 ms. Remains 260 /260 variables (removed 0) and now considering 674/674 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 260/834 places, 674/1242 transitions.
[2022-05-17 10:31:38] [INFO ] Flatten gal took : 14 ms
[2022-05-17 10:31:38] [INFO ] Flatten gal took : 16 ms
[2022-05-17 10:31:38] [INFO ] Input system was already deterministic with 674 transitions.
[2022-05-17 10:31:38] [INFO ] Flatten gal took : 20 ms
[2022-05-17 10:31:38] [INFO ] Flatten gal took : 17 ms
[2022-05-17 10:31:38] [INFO ] Time to serialize gal into /tmp/CTLFireability2525650012898343161.gal : 2 ms
[2022-05-17 10:31:38] [INFO ] Time to serialize properties into /tmp/CTLFireability10647215539549626630.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability2525650012898343161.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10647215539549626630.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...275
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2022-05-17 10:32:08] [INFO ] Flatten gal took : 20 ms
[2022-05-17 10:32:08] [INFO ] Applying decomposition
[2022-05-17 10:32:08] [INFO ] Flatten gal took : 16 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph6880712309794860317.txt' '-o' '/tmp/graph6880712309794860317.bin' '-w' '/tmp/graph6880712309794860317.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph6880712309794860317.bin' '-l' '-1' '-v' '-w' '/tmp/graph6880712309794860317.weights' '-q' '0' '-e' '0.001'
[2022-05-17 10:32:08] [INFO ] Decomposing Gal with order
[2022-05-17 10:32:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 10:32:08] [INFO ] Removed a total of 915 redundant transitions.
[2022-05-17 10:32:08] [INFO ] Flatten gal took : 34 ms
[2022-05-17 10:32:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 254 labels/synchronizations in 5 ms.
[2022-05-17 10:32:08] [INFO ] Time to serialize gal into /tmp/CTLFireability18390631925060160056.gal : 2 ms
[2022-05-17 10:32:08] [INFO ] Time to serialize properties into /tmp/CTLFireability9103764722184465598.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability18390631925060160056.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9103764722184465598.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...254
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2022-05-17 10:32:39] [INFO ] Flatten gal took : 51 ms
[2022-05-17 10:32:39] [INFO ] Flatten gal took : 56 ms
[2022-05-17 10:32:39] [INFO ] Applying decomposition
[2022-05-17 10:32:39] [INFO ] Flatten gal took : 56 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph12016462898505705689.txt' '-o' '/tmp/graph12016462898505705689.bin' '-w' '/tmp/graph12016462898505705689.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph12016462898505705689.bin' '-l' '-1' '-v' '-w' '/tmp/graph12016462898505705689.weights' '-q' '0' '-e' '0.001'
[2022-05-17 10:32:39] [INFO ] Decomposing Gal with order
[2022-05-17 10:32:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 10:32:39] [INFO ] Removed a total of 1033 redundant transitions.
[2022-05-17 10:32:39] [INFO ] Flatten gal took : 88 ms
[2022-05-17 10:32:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2022-05-17 10:32:40] [INFO ] Time to serialize gal into /tmp/CTLFireability6972878443230044843.gal : 3 ms
[2022-05-17 10:32:40] [INFO ] Time to serialize properties into /tmp/CTLFireability8683030878694576682.ctl : 12 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability6972878443230044843.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8683030878694576682.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...253
No direction supplied, using forward translation only.
Parsed 16 CTL formulae.
Detected timeout of ITS tools.
[2022-05-17 10:59:15] [INFO ] Applying decomposition
[2022-05-17 10:59:16] [INFO ] Flatten gal took : 367 ms
[2022-05-17 10:59:16] [INFO ] Decomposing Gal with order
[2022-05-17 10:59:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 10:59:16] [INFO ] Removed a total of 771 redundant transitions.
[2022-05-17 10:59:16] [INFO ] Flatten gal took : 193 ms
[2022-05-17 10:59:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 387 labels/synchronizations in 25 ms.
[2022-05-17 10:59:16] [INFO ] Time to serialize gal into /tmp/CTLFireability15225023601142905084.gal : 30 ms
[2022-05-17 10:59:16] [INFO ] Time to serialize properties into /tmp/CTLFireability14058289565796220117.ctl : 18 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability15225023601142905084.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14058289565796220117.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...255
No direction supplied, using forward translation only.
Parsed 16 CTL formulae.

BK_TIME_CONFINEMENT_REACHED

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution CTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination CTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

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="Peterson-PT-5"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is Peterson-PT-5, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r168-tall-165277016200074"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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