Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2021-input.r216-tall-162098205100461.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is ShieldIIPt-PT-030B, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r216-tall-162098205100461
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 884K
-rw-r--r-- 1 mcc users 12K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 110K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 94K May 10 09:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.2K Mar 28 16:37 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Mar 28 16:37 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Mar 28 16:37 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 16:37 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 27 12:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 22K Mar 27 12:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 25 17:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K Mar 25 17:57 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 08:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 22 08:16 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:52 equiv_col
-rw-r--r-- 1 mcc users 5 May 5 16:52 instance
-rw-r--r-- 1 mcc users 6 May 5 16:52 iscolored
-rw-r--r-- 1 mcc users 512K May 5 16:52 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 ShieldIIPt-PT-030B-00
FORMULA_NAME ShieldIIPt-PT-030B-01
FORMULA_NAME ShieldIIPt-PT-030B-02
FORMULA_NAME ShieldIIPt-PT-030B-03
FORMULA_NAME ShieldIIPt-PT-030B-04
FORMULA_NAME ShieldIIPt-PT-030B-05
FORMULA_NAME ShieldIIPt-PT-030B-06
FORMULA_NAME ShieldIIPt-PT-030B-07
FORMULA_NAME ShieldIIPt-PT-030B-08
FORMULA_NAME ShieldIIPt-PT-030B-09
FORMULA_NAME ShieldIIPt-PT-030B-10
FORMULA_NAME ShieldIIPt-PT-030B-11
FORMULA_NAME ShieldIIPt-PT-030B-12
FORMULA_NAME ShieldIIPt-PT-030B-13
FORMULA_NAME ShieldIIPt-PT-030B-14
FORMULA_NAME ShieldIIPt-PT-030B-15

=== Now, execution of the tool begins

BK_START 1621107005953

Running Version 0
[2021-05-15 19:30:20] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -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]
[2021-05-15 19:30:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-15 19:30:20] [INFO ] Load time of PNML (sax parser for PT used): 132 ms
[2021-05-15 19:30:20] [INFO ] Transformed 2103 places.
[2021-05-15 19:30:20] [INFO ] Transformed 1953 transitions.
[2021-05-15 19:30:20] [INFO ] Found NUPN structural information;
[2021-05-15 19:30:20] [INFO ] Parsed PT model containing 2103 places and 1953 transitions in 237 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
[2021-05-15 19:30:20] [INFO ] Initial state test concluded for 1 properties.
Support contains 43 out of 2103 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2103/2103 places, 1953/1953 transitions.
Discarding 321 places :
Symmetric choice reduction at 0 with 321 rule applications. Total rules 321 place count 1782 transition count 1632
Iterating global reduction 0 with 321 rules applied. Total rules applied 642 place count 1782 transition count 1632
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 643 place count 1781 transition count 1631
Iterating global reduction 0 with 1 rules applied. Total rules applied 644 place count 1781 transition count 1631
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 645 place count 1780 transition count 1630
Iterating global reduction 0 with 1 rules applied. Total rules applied 646 place count 1780 transition count 1630
Applied a total of 646 rules in 1786 ms. Remains 1780 /2103 variables (removed 323) and now considering 1630/1953 (removed 323) transitions.
// Phase 1: matrix 1630 rows 1780 cols
[2021-05-15 19:30:22] [INFO ] Computed 271 place invariants in 30 ms
[2021-05-15 19:30:23] [INFO ] Implicit Places using invariants in 729 ms returned []
// Phase 1: matrix 1630 rows 1780 cols
[2021-05-15 19:30:23] [INFO ] Computed 271 place invariants in 24 ms
[2021-05-15 19:30:24] [INFO ] Implicit Places using invariants and state equation in 1365 ms returned []
Implicit Place search using SMT with State Equation took 2121 ms to find 0 implicit places.
// Phase 1: matrix 1630 rows 1780 cols
[2021-05-15 19:30:24] [INFO ] Computed 271 place invariants in 6 ms
[2021-05-15 19:30:25] [INFO ] Dead Transitions using invariants and state equation in 989 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1780/2103 places, 1630/1953 transitions.
[2021-05-15 19:30:37] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2021-05-15 19:30:37] [INFO ] Flatten gal took : 170 ms
FORMULA ShieldIIPt-PT-030B-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-15 19:30:37] [INFO ] Flatten gal took : 79 ms
[2021-05-15 19:30:37] [INFO ] Input system was already deterministic with 1630 transitions.
Incomplete random walk after 100000 steps, including 2 resets, run finished after 918 ms. (steps per millisecond=108 ) properties (out of 36) seen :26
Running SMT prover for 10 properties.
// Phase 1: matrix 1630 rows 1780 cols
[2021-05-15 19:30:38] [INFO ] Computed 271 place invariants in 7 ms
[2021-05-15 19:30:38] [INFO ] [Real]Absence check using 271 positive place invariants in 76 ms returned sat
[2021-05-15 19:30:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-15 19:30:39] [INFO ] [Real]Absence check using state equation in 587 ms returned sat
[2021-05-15 19:30:39] [INFO ] Solution in real domain found non-integer solution.
[2021-05-15 19:30:39] [INFO ] [Nat]Absence check using 271 positive place invariants in 82 ms returned sat
[2021-05-15 19:30:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-15 19:30:40] [INFO ] [Nat]Absence check using state equation in 642 ms returned sat
[2021-05-15 19:30:41] [INFO ] Deduced a trap composed of 26 places in 412 ms of which 4 ms to minimize.
[2021-05-15 19:30:41] [INFO ] Deduced a trap composed of 19 places in 329 ms of which 1 ms to minimize.
[2021-05-15 19:30:41] [INFO ] Deduced a trap composed of 23 places in 391 ms of which 2 ms to minimize.
[2021-05-15 19:30:42] [INFO ] Deduced a trap composed of 25 places in 317 ms of which 2 ms to minimize.
[2021-05-15 19:30:42] [INFO ] Deduced a trap composed of 22 places in 302 ms of which 2 ms to minimize.
[2021-05-15 19:30:42] [INFO ] Deduced a trap composed of 17 places in 292 ms of which 1 ms to minimize.
[2021-05-15 19:30:43] [INFO ] Deduced a trap composed of 19 places in 279 ms of which 1 ms to minimize.
[2021-05-15 19:30:43] [INFO ] Deduced a trap composed of 16 places in 287 ms of which 1 ms to minimize.
[2021-05-15 19:30:44] [INFO ] Deduced a trap composed of 16 places in 288 ms of which 1 ms to minimize.
[2021-05-15 19:30:44] [INFO ] Deduced a trap composed of 16 places in 275 ms of which 1 ms to minimize.
[2021-05-15 19:30:44] [INFO ] Deduced a trap composed of 22 places in 271 ms of which 0 ms to minimize.
[2021-05-15 19:30:44] [INFO ] Deduced a trap composed of 32 places in 270 ms of which 1 ms to minimize.
[2021-05-15 19:30:45] [INFO ] Deduced a trap composed of 30 places in 263 ms of which 1 ms to minimize.
[2021-05-15 19:30:45] [INFO ] Deduced a trap composed of 26 places in 257 ms of which 1 ms to minimize.
[2021-05-15 19:30:45] [INFO ] Deduced a trap composed of 27 places in 251 ms of which 1 ms to minimize.
[2021-05-15 19:30:46] [INFO ] Deduced a trap composed of 25 places in 249 ms of which 0 ms to minimize.
[2021-05-15 19:30:46] [INFO ] Deduced a trap composed of 20 places in 240 ms of which 1 ms to minimize.
[2021-05-15 19:30:46] [INFO ] Deduced a trap composed of 30 places in 235 ms of which 1 ms to minimize.
[2021-05-15 19:30:47] [INFO ] Deduced a trap composed of 35 places in 231 ms of which 1 ms to minimize.
[2021-05-15 19:30:47] [INFO ] Deduced a trap composed of 31 places in 222 ms of which 1 ms to minimize.
[2021-05-15 19:30:47] [INFO ] Deduced a trap composed of 41 places in 221 ms of which 1 ms to minimize.
[2021-05-15 19:30:47] [INFO ] Deduced a trap composed of 34 places in 221 ms of which 1 ms to minimize.
[2021-05-15 19:30:48] [INFO ] Deduced a trap composed of 27 places in 212 ms of which 1 ms to minimize.
[2021-05-15 19:30:48] [INFO ] Deduced a trap composed of 29 places in 211 ms of which 0 ms to minimize.
[2021-05-15 19:30:48] [INFO ] Deduced a trap composed of 33 places in 209 ms of which 0 ms to minimize.
[2021-05-15 19:30:48] [INFO ] Deduced a trap composed of 29 places in 205 ms of which 0 ms to minimize.
[2021-05-15 19:30:49] [INFO ] Deduced a trap composed of 35 places in 197 ms of which 1 ms to minimize.
[2021-05-15 19:30:49] [INFO ] Deduced a trap composed of 34 places in 187 ms of which 1 ms to minimize.
[2021-05-15 19:30:49] [INFO ] Deduced a trap composed of 36 places in 179 ms of which 1 ms to minimize.
[2021-05-15 19:30:49] [INFO ] Deduced a trap composed of 32 places in 181 ms of which 1 ms to minimize.
[2021-05-15 19:30:50] [INFO ] Deduced a trap composed of 29 places in 181 ms of which 1 ms to minimize.
[2021-05-15 19:30:50] [INFO ] Deduced a trap composed of 37 places in 174 ms of which 1 ms to minimize.
[2021-05-15 19:30:50] [INFO ] Deduced a trap composed of 34 places in 167 ms of which 0 ms to minimize.
[2021-05-15 19:30:50] [INFO ] Deduced a trap composed of 29 places in 168 ms of which 4 ms to minimize.
[2021-05-15 19:30:51] [INFO ] Deduced a trap composed of 40 places in 159 ms of which 0 ms to minimize.
[2021-05-15 19:30:51] [INFO ] Deduced a trap composed of 39 places in 148 ms of which 1 ms to minimize.
[2021-05-15 19:30:51] [INFO ] Deduced a trap composed of 41 places in 144 ms of which 0 ms to minimize.
[2021-05-15 19:30:51] [INFO ] Deduced a trap composed of 40 places in 144 ms of which 1 ms to minimize.
[2021-05-15 19:30:51] [INFO ] Deduced a trap composed of 41 places in 141 ms of which 0 ms to minimize.
[2021-05-15 19:30:53] [INFO ] Deduced a trap composed of 39 places in 130 ms of which 1 ms to minimize.
[2021-05-15 19:30:53] [INFO ] Deduced a trap composed of 41 places in 130 ms of which 0 ms to minimize.
[2021-05-15 19:30:54] [INFO ] Deduced a trap composed of 38 places in 129 ms of which 0 ms to minimize.
[2021-05-15 19:30:54] [INFO ] Deduced a trap composed of 42 places in 133 ms of which 1 ms to minimize.
[2021-05-15 19:30:54] [INFO ] Deduced a trap composed of 34 places in 126 ms of which 0 ms to minimize.
[2021-05-15 19:30:54] [INFO ] Deduced a trap composed of 40 places in 122 ms of which 0 ms to minimize.
[2021-05-15 19:30:54] [INFO ] Deduced a trap composed of 45 places in 123 ms of which 0 ms to minimize.
[2021-05-15 19:30:54] [INFO ] Deduced a trap composed of 44 places in 116 ms of which 0 ms to minimize.
[2021-05-15 19:30:55] [INFO ] Deduced a trap composed of 42 places in 110 ms of which 1 ms to minimize.
[2021-05-15 19:30:55] [INFO ] Deduced a trap composed of 43 places in 106 ms of which 1 ms to minimize.
[2021-05-15 19:30:55] [INFO ] Deduced a trap composed of 39 places in 104 ms of which 1 ms to minimize.
[2021-05-15 19:30:55] [INFO ] Deduced a trap composed of 38 places in 104 ms of which 1 ms to minimize.
[2021-05-15 19:30:55] [INFO ] Deduced a trap composed of 49 places in 99 ms of which 0 ms to minimize.
[2021-05-15 19:30:55] [INFO ] Deduced a trap composed of 40 places in 94 ms of which 0 ms to minimize.
[2021-05-15 19:30:56] [INFO ] Deduced a trap composed of 43 places in 91 ms of which 1 ms to minimize.
[2021-05-15 19:30:56] [INFO ] Deduced a trap composed of 44 places in 90 ms of which 1 ms to minimize.
[2021-05-15 19:30:56] [INFO ] Deduced a trap composed of 43 places in 96 ms of which 7 ms to minimize.
[2021-05-15 19:30:56] [INFO ] Deduced a trap composed of 45 places in 85 ms of which 1 ms to minimize.
[2021-05-15 19:30:56] [INFO ] Deduced a trap composed of 46 places in 78 ms of which 1 ms to minimize.
[2021-05-15 19:30:56] [INFO ] Deduced a trap composed of 45 places in 78 ms of which 0 ms to minimize.
[2021-05-15 19:30:56] [INFO ] Deduced a trap composed of 43 places in 72 ms of which 1 ms to minimize.
[2021-05-15 19:30:56] [INFO ] Trap strengthening (SAT) tested/added 61/60 trap constraints in 16353 ms
[2021-05-15 19:30:57] [INFO ] Computed and/alt/rep : 1629/2444/1629 causal constraints (skipped 0 transitions) in 84 ms.
[2021-05-15 19:30:59] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
[2021-05-15 19:31:00] [INFO ] [Real]Absence check using 271 positive place invariants in 124 ms returned sat
[2021-05-15 19:31:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-15 19:31:00] [INFO ] [Real]Absence check using state equation in 577 ms returned sat
[2021-05-15 19:31:00] [INFO ] Deduced a trap composed of 18 places in 306 ms of which 1 ms to minimize.
[2021-05-15 19:31:01] [INFO ] Deduced a trap composed of 26 places in 304 ms of which 1 ms to minimize.
[2021-05-15 19:31:01] [INFO ] Deduced a trap composed of 17 places in 298 ms of which 0 ms to minimize.
[2021-05-15 19:31:02] [INFO ] Deduced a trap composed of 17 places in 297 ms of which 1 ms to minimize.
[2021-05-15 19:31:02] [INFO ] Deduced a trap composed of 19 places in 287 ms of which 1 ms to minimize.
[2021-05-15 19:31:02] [INFO ] Deduced a trap composed of 21 places in 281 ms of which 1 ms to minimize.
[2021-05-15 19:31:03] [INFO ] Deduced a trap composed of 22 places in 286 ms of which 1 ms to minimize.
[2021-05-15 19:31:03] [INFO ] Deduced a trap composed of 20 places in 270 ms of which 1 ms to minimize.
[2021-05-15 19:31:03] [INFO ] Deduced a trap composed of 24 places in 266 ms of which 1 ms to minimize.
[2021-05-15 19:31:04] [INFO ] Deduced a trap composed of 33 places in 262 ms of which 1 ms to minimize.
[2021-05-15 19:31:04] [INFO ] Deduced a trap composed of 25 places in 260 ms of which 0 ms to minimize.
[2021-05-15 19:31:04] [INFO ] Deduced a trap composed of 20 places in 262 ms of which 1 ms to minimize.
[2021-05-15 19:31:05] [INFO ] Deduced a trap composed of 28 places in 247 ms of which 1 ms to minimize.
[2021-05-15 19:31:05] [INFO ] Deduced a trap composed of 18 places in 245 ms of which 1 ms to minimize.
[2021-05-15 19:31:05] [INFO ] Deduced a trap composed of 27 places in 241 ms of which 1 ms to minimize.
[2021-05-15 19:31:05] [INFO ] Deduced a trap composed of 22 places in 253 ms of which 0 ms to minimize.
[2021-05-15 19:31:06] [INFO ] Deduced a trap composed of 24 places in 239 ms of which 0 ms to minimize.
[2021-05-15 19:31:06] [INFO ] Deduced a trap composed of 19 places in 232 ms of which 0 ms to minimize.
[2021-05-15 19:31:06] [INFO ] Deduced a trap composed of 25 places in 229 ms of which 1 ms to minimize.
[2021-05-15 19:31:07] [INFO ] Deduced a trap composed of 25 places in 223 ms of which 0 ms to minimize.
[2021-05-15 19:31:07] [INFO ] Deduced a trap composed of 33 places in 215 ms of which 1 ms to minimize.
[2021-05-15 19:31:07] [INFO ] Deduced a trap composed of 30 places in 214 ms of which 1 ms to minimize.
[2021-05-15 19:31:07] [INFO ] Deduced a trap composed of 25 places in 202 ms of which 1 ms to minimize.
[2021-05-15 19:31:08] [INFO ] Deduced a trap composed of 32 places in 200 ms of which 0 ms to minimize.
[2021-05-15 19:31:08] [INFO ] Deduced a trap composed of 34 places in 196 ms of which 1 ms to minimize.
[2021-05-15 19:31:08] [INFO ] Deduced a trap composed of 25 places in 190 ms of which 1 ms to minimize.
[2021-05-15 19:31:08] [INFO ] Deduced a trap composed of 32 places in 189 ms of which 0 ms to minimize.
[2021-05-15 19:31:09] [INFO ] Deduced a trap composed of 29 places in 172 ms of which 0 ms to minimize.
[2021-05-15 19:31:09] [INFO ] Deduced a trap composed of 40 places in 166 ms of which 1 ms to minimize.
[2021-05-15 19:31:09] [INFO ] Deduced a trap composed of 34 places in 155 ms of which 0 ms to minimize.
[2021-05-15 19:31:09] [INFO ] Deduced a trap composed of 30 places in 154 ms of which 1 ms to minimize.
[2021-05-15 19:31:09] [INFO ] Deduced a trap composed of 31 places in 146 ms of which 1 ms to minimize.
[2021-05-15 19:31:10] [INFO ] Deduced a trap composed of 26 places in 145 ms of which 1 ms to minimize.
[2021-05-15 19:31:10] [INFO ] Deduced a trap composed of 25 places in 141 ms of which 0 ms to minimize.
[2021-05-15 19:31:10] [INFO ] Deduced a trap composed of 25 places in 138 ms of which 1 ms to minimize.
[2021-05-15 19:31:10] [INFO ] Deduced a trap composed of 40 places in 134 ms of which 0 ms to minimize.
[2021-05-15 19:31:10] [INFO ] Deduced a trap composed of 44 places in 136 ms of which 1 ms to minimize.
[2021-05-15 19:31:11] [INFO ] Deduced a trap composed of 38 places in 131 ms of which 0 ms to minimize.
[2021-05-15 19:31:11] [INFO ] Deduced a trap composed of 46 places in 131 ms of which 1 ms to minimize.
[2021-05-15 19:31:11] [INFO ] Deduced a trap composed of 40 places in 124 ms of which 1 ms to minimize.
[2021-05-15 19:31:11] [INFO ] Deduced a trap composed of 40 places in 134 ms of which 0 ms to minimize.
[2021-05-15 19:31:11] [INFO ] Deduced a trap composed of 39 places in 120 ms of which 0 ms to minimize.
[2021-05-15 19:31:12] [INFO ] Deduced a trap composed of 38 places in 112 ms of which 0 ms to minimize.
[2021-05-15 19:31:12] [INFO ] Deduced a trap composed of 41 places in 105 ms of which 1 ms to minimize.
[2021-05-15 19:31:12] [INFO ] Deduced a trap composed of 44 places in 100 ms of which 1 ms to minimize.
[2021-05-15 19:31:12] [INFO ] Deduced a trap composed of 42 places in 100 ms of which 1 ms to minimize.
[2021-05-15 19:31:12] [INFO ] Deduced a trap composed of 45 places in 102 ms of which 0 ms to minimize.
[2021-05-15 19:31:12] [INFO ] Deduced a trap composed of 43 places in 90 ms of which 1 ms to minimize.
[2021-05-15 19:31:12] [INFO ] Trap strengthening (SAT) tested/added 49/48 trap constraints in 12222 ms
[2021-05-15 19:31:12] [INFO ] Solution in real domain found non-integer solution.
[2021-05-15 19:31:13] [INFO ] [Nat]Absence check using 271 positive place invariants in 76 ms returned sat
[2021-05-15 19:31:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-15 19:31:13] [INFO ] [Nat]Absence check using state equation in 566 ms returned sat
[2021-05-15 19:31:14] [INFO ] Deduced a trap composed of 18 places in 318 ms of which 8 ms to minimize.
[2021-05-15 19:31:14] [INFO ] Deduced a trap composed of 26 places in 313 ms of which 1 ms to minimize.
[2021-05-15 19:31:14] [INFO ] Deduced a trap composed of 17 places in 328 ms of which 1 ms to minimize.
[2021-05-15 19:31:15] [INFO ] Deduced a trap composed of 17 places in 309 ms of which 1 ms to minimize.
[2021-05-15 19:31:15] [INFO ] Deduced a trap composed of 19 places in 289 ms of which 0 ms to minimize.
[2021-05-15 19:31:15] [INFO ] Deduced a trap composed of 21 places in 293 ms of which 1 ms to minimize.
[2021-05-15 19:31:16] [INFO ] Deduced a trap composed of 22 places in 286 ms of which 1 ms to minimize.
[2021-05-15 19:31:16] [INFO ] Deduced a trap composed of 20 places in 273 ms of which 0 ms to minimize.
[2021-05-15 19:31:16] [INFO ] Deduced a trap composed of 24 places in 268 ms of which 1 ms to minimize.
[2021-05-15 19:31:17] [INFO ] Deduced a trap composed of 33 places in 265 ms of which 1 ms to minimize.
[2021-05-15 19:31:17] [INFO ] Deduced a trap composed of 25 places in 261 ms of which 0 ms to minimize.
[2021-05-15 19:31:17] [INFO ] Deduced a trap composed of 20 places in 276 ms of which 0 ms to minimize.
[2021-05-15 19:31:18] [INFO ] Deduced a trap composed of 28 places in 250 ms of which 1 ms to minimize.
[2021-05-15 19:31:18] [INFO ] Deduced a trap composed of 18 places in 248 ms of which 1 ms to minimize.
[2021-05-15 19:31:18] [INFO ] Deduced a trap composed of 27 places in 243 ms of which 1 ms to minimize.
[2021-05-15 19:31:18] [INFO ] Deduced a trap composed of 22 places in 242 ms of which 1 ms to minimize.
[2021-05-15 19:31:19] [INFO ] Deduced a trap composed of 24 places in 236 ms of which 1 ms to minimize.
[2021-05-15 19:31:19] [INFO ] Deduced a trap composed of 19 places in 233 ms of which 1 ms to minimize.
[2021-05-15 19:31:19] [INFO ] Deduced a trap composed of 25 places in 230 ms of which 1 ms to minimize.
[2021-05-15 19:31:20] [INFO ] Deduced a trap composed of 25 places in 224 ms of which 1 ms to minimize.
[2021-05-15 19:31:20] [INFO ] Deduced a trap composed of 33 places in 212 ms of which 1 ms to minimize.
[2021-05-15 19:31:20] [INFO ] Deduced a trap composed of 30 places in 216 ms of which 0 ms to minimize.
[2021-05-15 19:31:20] [INFO ] Deduced a trap composed of 25 places in 201 ms of which 1 ms to minimize.
[2021-05-15 19:31:21] [INFO ] Deduced a trap composed of 32 places in 201 ms of which 1 ms to minimize.
[2021-05-15 19:31:21] [INFO ] Deduced a trap composed of 34 places in 196 ms of which 0 ms to minimize.
[2021-05-15 19:31:21] [INFO ] Deduced a trap composed of 25 places in 192 ms of which 1 ms to minimize.
[2021-05-15 19:31:21] [INFO ] Deduced a trap composed of 32 places in 191 ms of which 0 ms to minimize.
[2021-05-15 19:31:22] [INFO ] Deduced a trap composed of 29 places in 171 ms of which 1 ms to minimize.
[2021-05-15 19:31:22] [INFO ] Deduced a trap composed of 40 places in 166 ms of which 1 ms to minimize.
[2021-05-15 19:31:22] [INFO ] Deduced a trap composed of 34 places in 160 ms of which 1 ms to minimize.
[2021-05-15 19:31:22] [INFO ] Deduced a trap composed of 30 places in 150 ms of which 0 ms to minimize.
[2021-05-15 19:31:22] [INFO ] Deduced a trap composed of 31 places in 147 ms of which 0 ms to minimize.
[2021-05-15 19:31:23] [INFO ] Deduced a trap composed of 26 places in 145 ms of which 0 ms to minimize.
[2021-05-15 19:31:23] [INFO ] Deduced a trap composed of 25 places in 142 ms of which 1 ms to minimize.
[2021-05-15 19:31:23] [INFO ] Deduced a trap composed of 25 places in 137 ms of which 1 ms to minimize.
[2021-05-15 19:31:23] [INFO ] Deduced a trap composed of 40 places in 133 ms of which 1 ms to minimize.
[2021-05-15 19:31:23] [INFO ] Deduced a trap composed of 44 places in 132 ms of which 0 ms to minimize.
[2021-05-15 19:31:24] [INFO ] Deduced a trap composed of 38 places in 129 ms of which 0 ms to minimize.
[2021-05-15 19:31:24] [INFO ] Deduced a trap composed of 46 places in 129 ms of which 1 ms to minimize.
[2021-05-15 19:31:24] [INFO ] Deduced a trap composed of 40 places in 125 ms of which 1 ms to minimize.
[2021-05-15 19:31:24] [INFO ] Deduced a trap composed of 40 places in 122 ms of which 1 ms to minimize.
[2021-05-15 19:31:24] [INFO ] Deduced a trap composed of 39 places in 118 ms of which 0 ms to minimize.
[2021-05-15 19:31:24] [INFO ] Deduced a trap composed of 35 places in 112 ms of which 0 ms to minimize.
[2021-05-15 19:31:25] [INFO ] Deduced a trap composed of 42 places in 111 ms of which 1 ms to minimize.
[2021-05-15 19:31:25] [INFO ] Deduced a trap composed of 42 places in 106 ms of which 1 ms to minimize.
[2021-05-15 19:31:25] [INFO ] Deduced a trap composed of 43 places in 105 ms of which 0 ms to minimize.
[2021-05-15 19:31:25] [INFO ] Deduced a trap composed of 38 places in 96 ms of which 0 ms to minimize.
[2021-05-15 19:31:25] [INFO ] Deduced a trap composed of 38 places in 89 ms of which 0 ms to minimize.
[2021-05-15 19:31:25] [INFO ] Deduced a trap composed of 45 places in 82 ms of which 1 ms to minimize.
[2021-05-15 19:31:25] [INFO ] Deduced a trap composed of 45 places in 80 ms of which 0 ms to minimize.
[2021-05-15 19:31:25] [INFO ] Trap strengthening (SAT) tested/added 51/50 trap constraints in 12249 ms
[2021-05-15 19:31:26] [INFO ] Computed and/alt/rep : 1629/2444/1629 causal constraints (skipped 0 transitions) in 97 ms.
[2021-05-15 19:31:32] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 1
[2021-05-15 19:31:33] [INFO ] [Real]Absence check using 271 positive place invariants in 72 ms returned sat
[2021-05-15 19:31:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-15 19:31:33] [INFO ] [Real]Absence check using state equation in 570 ms returned sat
[2021-05-15 19:31:34] [INFO ] Deduced a trap composed of 17 places in 281 ms of which 1 ms to minimize.
[2021-05-15 19:31:34] [INFO ] Deduced a trap composed of 16 places in 276 ms of which 1 ms to minimize.
[2021-05-15 19:31:34] [INFO ] Deduced a trap composed of 23 places in 270 ms of which 1 ms to minimize.
[2021-05-15 19:31:35] [INFO ] Deduced a trap composed of 18 places in 270 ms of which 1 ms to minimize.
[2021-05-15 19:31:35] [INFO ] Deduced a trap composed of 29 places in 259 ms of which 1 ms to minimize.
[2021-05-15 19:31:35] [INFO ] Deduced a trap composed of 25 places in 256 ms of which 1 ms to minimize.
[2021-05-15 19:31:35] [INFO ] Deduced a trap composed of 26 places in 254 ms of which 0 ms to minimize.
[2021-05-15 19:31:36] [INFO ] Deduced a trap composed of 20 places in 247 ms of which 1 ms to minimize.
[2021-05-15 19:31:36] [INFO ] Deduced a trap composed of 27 places in 246 ms of which 1 ms to minimize.
[2021-05-15 19:31:36] [INFO ] Deduced a trap composed of 31 places in 238 ms of which 1 ms to minimize.
[2021-05-15 19:31:37] [INFO ] Deduced a trap composed of 31 places in 240 ms of which 1 ms to minimize.
[2021-05-15 19:31:37] [INFO ] Deduced a trap composed of 22 places in 238 ms of which 1 ms to minimize.
[2021-05-15 19:31:37] [INFO ] Deduced a trap composed of 22 places in 236 ms of which 1 ms to minimize.
[2021-05-15 19:31:38] [INFO ] Deduced a trap composed of 28 places in 228 ms of which 1 ms to minimize.
[2021-05-15 19:31:38] [INFO ] Deduced a trap composed of 20 places in 222 ms of which 1 ms to minimize.
[2021-05-15 19:31:38] [INFO ] Deduced a trap composed of 21 places in 221 ms of which 1 ms to minimize.
[2021-05-15 19:31:38] [INFO ] Deduced a trap composed of 36 places in 221 ms of which 1 ms to minimize.
[2021-05-15 19:31:39] [INFO ] Deduced a trap composed of 23 places in 218 ms of which 0 ms to minimize.
[2021-05-15 19:31:39] [INFO ] Deduced a trap composed of 26 places in 209 ms of which 1 ms to minimize.
[2021-05-15 19:31:39] [INFO ] Deduced a trap composed of 38 places in 203 ms of which 1 ms to minimize.
[2021-05-15 19:31:39] [INFO ] Deduced a trap composed of 34 places in 175 ms of which 1 ms to minimize.
[2021-05-15 19:31:40] [INFO ] Deduced a trap composed of 29 places in 179 ms of which 1 ms to minimize.
[2021-05-15 19:31:40] [INFO ] Deduced a trap composed of 42 places in 168 ms of which 1 ms to minimize.
[2021-05-15 19:31:40] [INFO ] Deduced a trap composed of 38 places in 161 ms of which 1 ms to minimize.
[2021-05-15 19:31:40] [INFO ] Deduced a trap composed of 33 places in 160 ms of which 0 ms to minimize.
[2021-05-15 19:31:41] [INFO ] Deduced a trap composed of 32 places in 155 ms of which 0 ms to minimize.
[2021-05-15 19:31:41] [INFO ] Deduced a trap composed of 28 places in 152 ms of which 0 ms to minimize.
[2021-05-15 19:31:41] [INFO ] Deduced a trap composed of 29 places in 146 ms of which 0 ms to minimize.
[2021-05-15 19:31:41] [INFO ] Deduced a trap composed of 30 places in 141 ms of which 1 ms to minimize.
[2021-05-15 19:31:41] [INFO ] Deduced a trap composed of 33 places in 138 ms of which 0 ms to minimize.
[2021-05-15 19:31:42] [INFO ] Deduced a trap composed of 22 places in 131 ms of which 1 ms to minimize.
[2021-05-15 19:31:42] [INFO ] Deduced a trap composed of 26 places in 127 ms of which 1 ms to minimize.
[2021-05-15 19:31:42] [INFO ] Deduced a trap composed of 37 places in 121 ms of which 0 ms to minimize.
[2021-05-15 19:31:42] [INFO ] Deduced a trap composed of 41 places in 117 ms of which 1 ms to minimize.
[2021-05-15 19:31:42] [INFO ] Deduced a trap composed of 40 places in 114 ms of which 1 ms to minimize.
[2021-05-15 19:31:42] [INFO ] Deduced a trap composed of 41 places in 112 ms of which 0 ms to minimize.
[2021-05-15 19:31:43] [INFO ] Deduced a trap composed of 40 places in 108 ms of which 1 ms to minimize.
[2021-05-15 19:31:43] [INFO ] Deduced a trap composed of 32 places in 109 ms of which 0 ms to minimize.
[2021-05-15 19:31:43] [INFO ] Deduced a trap composed of 29 places in 107 ms of which 1 ms to minimize.
[2021-05-15 19:31:43] [INFO ] Deduced a trap composed of 39 places in 101 ms of which 0 ms to minimize.
[2021-05-15 19:31:43] [INFO ] Deduced a trap composed of 40 places in 98 ms of which 0 ms to minimize.
[2021-05-15 19:31:43] [INFO ] Deduced a trap composed of 43 places in 102 ms of which 0 ms to minimize.
[2021-05-15 19:31:44] [INFO ] Deduced a trap composed of 41 places in 93 ms of which 0 ms to minimize.
[2021-05-15 19:31:44] [INFO ] Deduced a trap composed of 44 places in 87 ms of which 0 ms to minimize.
[2021-05-15 19:31:44] [INFO ] Deduced a trap composed of 46 places in 83 ms of which 0 ms to minimize.
[2021-05-15 19:31:44] [INFO ] Deduced a trap composed of 44 places in 78 ms of which 0 ms to minimize.
[2021-05-15 19:31:44] [INFO ] Deduced a trap composed of 43 places in 74 ms of which 1 ms to minimize.
[2021-05-15 19:31:44] [INFO ] Deduced a trap composed of 39 places in 66 ms of which 1 ms to minimize.
[2021-05-15 19:31:44] [INFO ] Trap strengthening (SAT) tested/added 49/48 trap constraints in 11005 ms
[2021-05-15 19:31:44] [INFO ] Solution in real domain found non-integer solution.
[2021-05-15 19:31:45] [INFO ] [Nat]Absence check using 271 positive place invariants in 73 ms returned sat
[2021-05-15 19:31:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-15 19:31:45] [INFO ] [Nat]Absence check using state equation in 541 ms returned sat
[2021-05-15 19:31:45] [INFO ] Deduced a trap composed of 17 places in 280 ms of which 1 ms to minimize.
[2021-05-15 19:31:46] [INFO ] Deduced a trap composed of 16 places in 284 ms of which 10 ms to minimize.
[2021-05-15 19:31:46] [INFO ] Deduced a trap composed of 23 places in 271 ms of which 1 ms to minimize.
[2021-05-15 19:31:46] [INFO ] Deduced a trap composed of 18 places in 271 ms of which 0 ms to minimize.
[2021-05-15 19:31:47] [INFO ] Deduced a trap composed of 29 places in 269 ms of which 1 ms to minimize.
[2021-05-15 19:31:47] [INFO ] Deduced a trap composed of 25 places in 258 ms of which 1 ms to minimize.
[2021-05-15 19:31:47] [INFO ] Deduced a trap composed of 26 places in 265 ms of which 1 ms to minimize.
[2021-05-15 19:31:48] [INFO ] Deduced a trap composed of 20 places in 250 ms of which 0 ms to minimize.
[2021-05-15 19:31:48] [INFO ] Deduced a trap composed of 27 places in 249 ms of which 1 ms to minimize.
[2021-05-15 19:31:48] [INFO ] Deduced a trap composed of 31 places in 241 ms of which 0 ms to minimize.
[2021-05-15 19:31:49] [INFO ] Deduced a trap composed of 31 places in 251 ms of which 1 ms to minimize.
[2021-05-15 19:31:49] [INFO ] Deduced a trap composed of 22 places in 242 ms of which 1 ms to minimize.
[2021-05-15 19:31:49] [INFO ] Deduced a trap composed of 22 places in 233 ms of which 1 ms to minimize.
[2021-05-15 19:31:49] [INFO ] Deduced a trap composed of 28 places in 231 ms of which 1 ms to minimize.
[2021-05-15 19:31:50] [INFO ] Deduced a trap composed of 20 places in 223 ms of which 1 ms to minimize.
[2021-05-15 19:31:50] [INFO ] Deduced a trap composed of 21 places in 224 ms of which 1 ms to minimize.
[2021-05-15 19:31:50] [INFO ] Deduced a trap composed of 36 places in 220 ms of which 0 ms to minimize.
[2021-05-15 19:31:50] [INFO ] Deduced a trap composed of 23 places in 215 ms of which 0 ms to minimize.
[2021-05-15 19:31:51] [INFO ] Deduced a trap composed of 26 places in 207 ms of which 1 ms to minimize.
[2021-05-15 19:31:51] [INFO ] Deduced a trap composed of 38 places in 199 ms of which 0 ms to minimize.
[2021-05-15 19:31:51] [INFO ] Deduced a trap composed of 28 places in 196 ms of which 0 ms to minimize.
[2021-05-15 19:31:51] [INFO ] Deduced a trap composed of 29 places in 195 ms of which 1 ms to minimize.
[2021-05-15 19:31:52] [INFO ] Deduced a trap composed of 32 places in 190 ms of which 0 ms to minimize.
[2021-05-15 19:31:52] [INFO ] Deduced a trap composed of 32 places in 183 ms of which 0 ms to minimize.
[2021-05-15 19:31:52] [INFO ] Deduced a trap composed of 32 places in 181 ms of which 1 ms to minimize.
[2021-05-15 19:31:52] [INFO ] Deduced a trap composed of 33 places in 175 ms of which 1 ms to minimize.
[2021-05-15 19:31:53] [INFO ] Deduced a trap composed of 30 places in 165 ms of which 1 ms to minimize.
[2021-05-15 19:31:53] [INFO ] Deduced a trap composed of 33 places in 163 ms of which 0 ms to minimize.
[2021-05-15 19:31:53] [INFO ] Deduced a trap composed of 22 places in 154 ms of which 1 ms to minimize.
[2021-05-15 19:31:53] [INFO ] Deduced a trap composed of 26 places in 151 ms of which 1 ms to minimize.
[2021-05-15 19:31:53] [INFO ] Deduced a trap composed of 34 places in 145 ms of which 0 ms to minimize.
[2021-05-15 19:31:54] [INFO ] Deduced a trap composed of 40 places in 138 ms of which 0 ms to minimize.
[2021-05-15 19:31:54] [INFO ] Deduced a trap composed of 40 places in 135 ms of which 1 ms to minimize.
[2021-05-15 19:31:54] [INFO ] Deduced a trap composed of 38 places in 134 ms of which 0 ms to minimize.
[2021-05-15 19:31:54] [INFO ] Deduced a trap composed of 39 places in 132 ms of which 0 ms to minimize.
[2021-05-15 19:31:54] [INFO ] Deduced a trap composed of 42 places in 129 ms of which 0 ms to minimize.
[2021-05-15 19:31:55] [INFO ] Deduced a trap composed of 41 places in 124 ms of which 1 ms to minimize.
[2021-05-15 19:31:55] [INFO ] Deduced a trap composed of 38 places in 122 ms of which 1 ms to minimize.
[2021-05-15 19:31:55] [INFO ] Deduced a trap composed of 43 places in 128 ms of which 0 ms to minimize.
[2021-05-15 19:31:55] [INFO ] Deduced a trap composed of 41 places in 136 ms of which 0 ms to minimize.
[2021-05-15 19:31:55] [INFO ] Deduced a trap composed of 44 places in 121 ms of which 0 ms to minimize.
[2021-05-15 19:31:55] [INFO ] Deduced a trap composed of 39 places in 112 ms of which 1 ms to minimize.
[2021-05-15 19:31:56] [INFO ] Deduced a trap composed of 41 places in 107 ms of which 1 ms to minimize.
[2021-05-15 19:31:56] [INFO ] Deduced a trap composed of 47 places in 109 ms of which 1 ms to minimize.
[2021-05-15 19:31:56] [INFO ] Deduced a trap composed of 43 places in 93 ms of which 0 ms to minimize.
[2021-05-15 19:31:56] [INFO ] Deduced a trap composed of 40 places in 89 ms of which 1 ms to minimize.
[2021-05-15 19:31:56] [INFO ] Deduced a trap composed of 45 places in 84 ms of which 1 ms to minimize.
[2021-05-15 19:31:56] [INFO ] Trap strengthening (SAT) tested/added 48/47 trap constraints in 11140 ms
[2021-05-15 19:31:56] [INFO ] Computed and/alt/rep : 1629/2444/1629 causal constraints (skipped 0 transitions) in 83 ms.
[2021-05-15 19:32:05] [INFO ] Deduced a trap composed of 21 places in 745 ms of which 3 ms to minimize.
[2021-05-15 19:32:05] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 2
[2021-05-15 19:32:05] [INFO ] [Real]Absence check using 271 positive place invariants in 74 ms returned sat
[2021-05-15 19:32:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-15 19:32:06] [INFO ] [Real]Absence check using state equation in 572 ms returned sat
[2021-05-15 19:32:06] [INFO ] Deduced a trap composed of 21 places in 320 ms of which 2 ms to minimize.
[2021-05-15 19:32:07] [INFO ] Deduced a trap composed of 19 places in 313 ms of which 3 ms to minimize.
[2021-05-15 19:32:07] [INFO ] Deduced a trap composed of 18 places in 309 ms of which 1 ms to minimize.
[2021-05-15 19:32:07] [INFO ] Deduced a trap composed of 19 places in 302 ms of which 1 ms to minimize.
[2021-05-15 19:32:08] [INFO ] Deduced a trap composed of 21 places in 301 ms of which 1 ms to minimize.
[2021-05-15 19:32:08] [INFO ] Deduced a trap composed of 26 places in 289 ms of which 1 ms to minimize.
[2021-05-15 19:32:08] [INFO ] Deduced a trap composed of 25 places in 284 ms of which 1 ms to minimize.
[2021-05-15 19:32:09] [INFO ] Deduced a trap composed of 20 places in 275 ms of which 1 ms to minimize.
[2021-05-15 19:32:09] [INFO ] Deduced a trap composed of 20 places in 268 ms of which 0 ms to minimize.
[2021-05-15 19:32:09] [INFO ] Deduced a trap composed of 25 places in 260 ms of which 0 ms to minimize.
[2021-05-15 19:32:10] [INFO ] Deduced a trap composed of 22 places in 260 ms of which 1 ms to minimize.
[2021-05-15 19:32:10] [INFO ] Deduced a trap composed of 29 places in 246 ms of which 1 ms to minimize.
[2021-05-15 19:32:10] [INFO ] Deduced a trap composed of 17 places in 247 ms of which 1 ms to minimize.
[2021-05-15 19:32:11] [INFO ] Deduced a trap composed of 26 places in 277 ms of which 1 ms to minimize.
[2021-05-15 19:32:11] [INFO ] Deduced a trap composed of 32 places in 259 ms of which 0 ms to minimize.
[2021-05-15 19:32:11] [INFO ] Deduced a trap composed of 20 places in 229 ms of which 0 ms to minimize.
[2021-05-15 19:32:12] [INFO ] Deduced a trap composed of 32 places in 218 ms of which 0 ms to minimize.
[2021-05-15 19:32:12] [INFO ] Deduced a trap composed of 26 places in 216 ms of which 1 ms to minimize.
[2021-05-15 19:32:12] [INFO ] Deduced a trap composed of 27 places in 213 ms of which 0 ms to minimize.
[2021-05-15 19:32:12] [INFO ] Deduced a trap composed of 27 places in 208 ms of which 1 ms to minimize.
[2021-05-15 19:32:13] [INFO ] Deduced a trap composed of 25 places in 208 ms of which 1 ms to minimize.
[2021-05-15 19:32:13] [INFO ] Deduced a trap composed of 23 places in 204 ms of which 0 ms to minimize.
[2021-05-15 19:32:13] [INFO ] Deduced a trap composed of 26 places in 198 ms of which 1 ms to minimize.
[2021-05-15 19:32:13] [INFO ] Deduced a trap composed of 33 places in 191 ms of which 1 ms to minimize.
[2021-05-15 19:32:14] [INFO ] Deduced a trap composed of 31 places in 189 ms of which 1 ms to minimize.
[2021-05-15 19:32:14] [INFO ] Deduced a trap composed of 33 places in 190 ms of which 0 ms to minimize.
[2021-05-15 19:32:14] [INFO ] Deduced a trap composed of 30 places in 184 ms of which 1 ms to minimize.
[2021-05-15 19:32:14] [INFO ] Deduced a trap composed of 27 places in 176 ms of which 1 ms to minimize.
[2021-05-15 19:32:15] [INFO ] Deduced a trap composed of 26 places in 170 ms of which 0 ms to minimize.
[2021-05-15 19:32:15] [INFO ] Deduced a trap composed of 32 places in 174 ms of which 0 ms to minimize.
[2021-05-15 19:32:15] [INFO ] Deduced a trap composed of 42 places in 162 ms of which 1 ms to minimize.
[2021-05-15 19:32:15] [INFO ] Deduced a trap composed of 34 places in 161 ms of which 1 ms to minimize.
[2021-05-15 19:32:15] [INFO ] Deduced a trap composed of 28 places in 158 ms of which 1 ms to minimize.
[2021-05-15 19:32:16] [INFO ] Deduced a trap composed of 35 places in 153 ms of which 1 ms to minimize.
[2021-05-15 19:32:16] [INFO ] Deduced a trap composed of 26 places in 147 ms of which 1 ms to minimize.
[2021-05-15 19:32:16] [INFO ] Deduced a trap composed of 37 places in 140 ms of which 1 ms to minimize.
[2021-05-15 19:32:16] [INFO ] Deduced a trap composed of 44 places in 133 ms of which 0 ms to minimize.
[2021-05-15 19:32:16] [INFO ] Deduced a trap composed of 39 places in 129 ms of which 1 ms to minimize.
[2021-05-15 19:32:17] [INFO ] Deduced a trap composed of 43 places in 117 ms of which 1 ms to minimize.
[2021-05-15 19:32:17] [INFO ] Deduced a trap composed of 40 places in 122 ms of which 1 ms to minimize.
[2021-05-15 19:32:17] [INFO ] Deduced a trap composed of 46 places in 109 ms of which 0 ms to minimize.
[2021-05-15 19:32:17] [INFO ] Deduced a trap composed of 39 places in 110 ms of which 1 ms to minimize.
[2021-05-15 19:32:17] [INFO ] Deduced a trap composed of 41 places in 108 ms of which 1 ms to minimize.
[2021-05-15 19:32:17] [INFO ] Deduced a trap composed of 42 places in 100 ms of which 0 ms to minimize.
[2021-05-15 19:32:18] [INFO ] Deduced a trap composed of 44 places in 94 ms of which 0 ms to minimize.
[2021-05-15 19:32:18] [INFO ] Deduced a trap composed of 39 places in 91 ms of which 0 ms to minimize.
[2021-05-15 19:32:18] [INFO ] Deduced a trap composed of 38 places in 85 ms of which 0 ms to minimize.
[2021-05-15 19:32:18] [INFO ] Deduced a trap composed of 44 places in 84 ms of which 0 ms to minimize.
[2021-05-15 19:32:18] [INFO ] Deduced a trap composed of 38 places in 79 ms of which 0 ms to minimize.
[2021-05-15 19:32:18] [INFO ] Deduced a trap composed of 41 places in 75 ms of which 0 ms to minimize.
[2021-05-15 19:32:18] [INFO ] Deduced a trap composed of 46 places in 75 ms of which 0 ms to minimize.
[2021-05-15 19:32:19] [INFO ] Deduced a trap composed of 43 places in 65 ms of which 1 ms to minimize.
[2021-05-15 19:32:19] [INFO ] Deduced a trap composed of 44 places in 64 ms of which 0 ms to minimize.
[2021-05-15 19:32:19] [INFO ] Trap strengthening (SAT) tested/added 54/53 trap constraints in 12711 ms
[2021-05-15 19:32:19] [INFO ] Solution in real domain found non-integer solution.
[2021-05-15 19:32:19] [INFO ] [Nat]Absence check using 271 positive place invariants in 75 ms returned sat
[2021-05-15 19:32:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-15 19:32:20] [INFO ] [Nat]Absence check using state equation in 568 ms returned sat
[2021-05-15 19:32:20] [INFO ] Deduced a trap composed of 21 places in 309 ms of which 1 ms to minimize.
[2021-05-15 19:32:20] [INFO ] Deduced a trap composed of 19 places in 307 ms of which 1 ms to minimize.
[2021-05-15 19:32:21] [INFO ] Deduced a trap composed of 18 places in 318 ms of which 1 ms to minimize.
[2021-05-15 19:32:21] [INFO ] Deduced a trap composed of 19 places in 311 ms of which 1 ms to minimize.
[2021-05-15 19:32:21] [INFO ] Deduced a trap composed of 21 places in 305 ms of which 1 ms to minimize.
[2021-05-15 19:32:22] [INFO ] Deduced a trap composed of 26 places in 292 ms of which 1 ms to minimize.
[2021-05-15 19:32:22] [INFO ] Deduced a trap composed of 20 places in 283 ms of which 1 ms to minimize.
[2021-05-15 19:32:22] [INFO ] Deduced a trap composed of 25 places in 277 ms of which 1 ms to minimize.
[2021-05-15 19:32:23] [INFO ] Deduced a trap composed of 26 places in 269 ms of which 1 ms to minimize.
[2021-05-15 19:32:23] [INFO ] Deduced a trap composed of 21 places in 264 ms of which 1 ms to minimize.
[2021-05-15 19:32:23] [INFO ] Deduced a trap composed of 22 places in 262 ms of which 0 ms to minimize.
[2021-05-15 19:32:24] [INFO ] Deduced a trap composed of 26 places in 249 ms of which 1 ms to minimize.
[2021-05-15 19:32:24] [INFO ] Deduced a trap composed of 16 places in 247 ms of which 1 ms to minimize.
[2021-05-15 19:32:24] [INFO ] Deduced a trap composed of 26 places in 237 ms of which 1 ms to minimize.
[2021-05-15 19:32:24] [INFO ] Deduced a trap composed of 17 places in 239 ms of which 0 ms to minimize.
[2021-05-15 19:32:25] [INFO ] Deduced a trap composed of 30 places in 228 ms of which 1 ms to minimize.
[2021-05-15 19:32:25] [INFO ] Deduced a trap composed of 32 places in 222 ms of which 1 ms to minimize.
[2021-05-15 19:32:25] [INFO ] Deduced a trap composed of 31 places in 244 ms of which 1 ms to minimize.
[2021-05-15 19:32:26] [INFO ] Deduced a trap composed of 29 places in 218 ms of which 1 ms to minimize.
[2021-05-15 19:32:26] [INFO ] Deduced a trap composed of 26 places in 210 ms of which 0 ms to minimize.
[2021-05-15 19:32:26] [INFO ] Deduced a trap composed of 30 places in 215 ms of which 0 ms to minimize.
[2021-05-15 19:32:26] [INFO ] Deduced a trap composed of 25 places in 210 ms of which 1 ms to minimize.
[2021-05-15 19:32:27] [INFO ] Deduced a trap composed of 25 places in 201 ms of which 0 ms to minimize.
[2021-05-15 19:32:27] [INFO ] Deduced a trap composed of 30 places in 197 ms of which 1 ms to minimize.
[2021-05-15 19:32:27] [INFO ] Deduced a trap composed of 32 places in 195 ms of which 0 ms to minimize.
[2021-05-15 19:32:27] [INFO ] Deduced a trap composed of 31 places in 215 ms of which 1 ms to minimize.
[2021-05-15 19:32:28] [INFO ] Deduced a trap composed of 26 places in 187 ms of which 1 ms to minimize.
[2021-05-15 19:32:28] [INFO ] Deduced a trap composed of 32 places in 178 ms of which 1 ms to minimize.
[2021-05-15 19:32:28] [INFO ] Deduced a trap composed of 39 places in 170 ms of which 1 ms to minimize.
[2021-05-15 19:32:28] [INFO ] Deduced a trap composed of 29 places in 180 ms of which 0 ms to minimize.
[2021-05-15 19:32:29] [INFO ] Deduced a trap composed of 27 places in 170 ms of which 1 ms to minimize.
[2021-05-15 19:32:29] [INFO ] Deduced a trap composed of 26 places in 149 ms of which 1 ms to minimize.
[2021-05-15 19:32:29] [INFO ] Deduced a trap composed of 35 places in 143 ms of which 0 ms to minimize.
[2021-05-15 19:32:29] [INFO ] Deduced a trap composed of 27 places in 142 ms of which 0 ms to minimize.
[2021-05-15 19:32:29] [INFO ] Deduced a trap composed of 33 places in 138 ms of which 1 ms to minimize.
[2021-05-15 19:32:29] [INFO ] Deduced a trap composed of 43 places in 131 ms of which 1 ms to minimize.
[2021-05-15 19:32:30] [INFO ] Deduced a trap composed of 34 places in 127 ms of which 0 ms to minimize.
[2021-05-15 19:32:30] [INFO ] Deduced a trap composed of 43 places in 120 ms of which 1 ms to minimize.
[2021-05-15 19:32:30] [INFO ] Deduced a trap composed of 45 places in 114 ms of which 0 ms to minimize.
[2021-05-15 19:32:30] [INFO ] Deduced a trap composed of 40 places in 109 ms of which 0 ms to minimize.
[2021-05-15 19:32:30] [INFO ] Deduced a trap composed of 37 places in 105 ms of which 1 ms to minimize.
[2021-05-15 19:32:30] [INFO ] Deduced a trap composed of 42 places in 106 ms of which 0 ms to minimize.
[2021-05-15 19:32:31] [INFO ] Deduced a trap composed of 41 places in 103 ms of which 0 ms to minimize.
[2021-05-15 19:32:31] [INFO ] Deduced a trap composed of 43 places in 99 ms of which 1 ms to minimize.
[2021-05-15 19:32:31] [INFO ] Deduced a trap composed of 43 places in 100 ms of which 1 ms to minimize.
[2021-05-15 19:32:31] [INFO ] Deduced a trap composed of 48 places in 97 ms of which 0 ms to minimize.
[2021-05-15 19:32:31] [INFO ] Deduced a trap composed of 44 places in 92 ms of which 0 ms to minimize.
[2021-05-15 19:32:31] [INFO ] Deduced a trap composed of 39 places in 87 ms of which 0 ms to minimize.
[2021-05-15 19:32:31] [INFO ] Deduced a trap composed of 43 places in 81 ms of which 1 ms to minimize.
[2021-05-15 19:32:32] [INFO ] Deduced a trap composed of 38 places in 78 ms of which 0 ms to minimize.
[2021-05-15 19:32:32] [INFO ] Deduced a trap composed of 41 places in 74 ms of which 0 ms to minimize.
[2021-05-15 19:32:32] [INFO ] Deduced a trap composed of 41 places in 74 ms of which 0 ms to minimize.
[2021-05-15 19:32:32] [INFO ] Deduced a trap composed of 45 places in 72 ms of which 0 ms to minimize.
[2021-05-15 19:32:32] [INFO ] Deduced a trap composed of 42 places in 66 ms of which 0 ms to minimize.
[2021-05-15 19:32:32] [INFO ] Deduced a trap composed of 44 places in 62 ms of which 0 ms to minimize.
[2021-05-15 19:32:32] [INFO ] Trap strengthening (SAT) tested/added 56/55 trap constraints in 12726 ms
[2021-05-15 19:32:32] [INFO ] Computed and/alt/rep : 1629/2444/1629 causal constraints (skipped 0 transitions) in 81 ms.
[2021-05-15 19:32:39] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 3
[2021-05-15 19:32:39] [INFO ] [Real]Absence check using 271 positive place invariants in 74 ms returned sat
[2021-05-15 19:32:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-15 19:32:40] [INFO ] [Real]Absence check using state equation in 567 ms returned sat
[2021-05-15 19:32:40] [INFO ] Solution in real domain found non-integer solution.
[2021-05-15 19:32:40] [INFO ] [Nat]Absence check using 271 positive place invariants in 76 ms returned sat
[2021-05-15 19:32:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-15 19:32:40] [INFO ] [Nat]Absence check using state equation in 612 ms returned sat
[2021-05-15 19:32:41] [INFO ] Deduced a trap composed of 22 places in 339 ms of which 1 ms to minimize.
[2021-05-15 19:32:41] [INFO ] Deduced a trap composed of 25 places in 339 ms of which 1 ms to minimize.
[2021-05-15 19:32:42] [INFO ] Deduced a trap composed of 19 places in 328 ms of which 1 ms to minimize.
[2021-05-15 19:32:42] [INFO ] Deduced a trap composed of 18 places in 319 ms of which 0 ms to minimize.
[2021-05-15 19:32:42] [INFO ] Deduced a trap composed of 19 places in 322 ms of which 1 ms to minimize.
[2021-05-15 19:32:43] [INFO ] Deduced a trap composed of 19 places in 324 ms of which 0 ms to minimize.
[2021-05-15 19:32:43] [INFO ] Deduced a trap composed of 19 places in 314 ms of which 1 ms to minimize.
[2021-05-15 19:32:43] [INFO ] Deduced a trap composed of 20 places in 310 ms of which 1 ms to minimize.
[2021-05-15 19:32:44] [INFO ] Deduced a trap composed of 19 places in 308 ms of which 1 ms to minimize.
[2021-05-15 19:32:44] [INFO ] Deduced a trap composed of 24 places in 304 ms of which 1 ms to minimize.
[2021-05-15 19:32:45] [INFO ] Deduced a trap composed of 24 places in 318 ms of which 1 ms to minimize.
[2021-05-15 19:32:45] [INFO ] Deduced a trap composed of 21 places in 301 ms of which 1 ms to minimize.
[2021-05-15 19:32:45] [INFO ] Deduced a trap composed of 23 places in 298 ms of which 1 ms to minimize.
[2021-05-15 19:32:46] [INFO ] Deduced a trap composed of 30 places in 284 ms of which 0 ms to minimize.
[2021-05-15 19:32:46] [INFO ] Deduced a trap composed of 30 places in 281 ms of which 0 ms to minimize.
[2021-05-15 19:32:46] [INFO ] Deduced a trap composed of 31 places in 277 ms of which 1 ms to minimize.
[2021-05-15 19:32:47] [INFO ] Deduced a trap composed of 34 places in 272 ms of which 1 ms to minimize.
[2021-05-15 19:32:47] [INFO ] Deduced a trap composed of 29 places in 270 ms of which 1 ms to minimize.
[2021-05-15 19:32:47] [INFO ] Deduced a trap composed of 31 places in 267 ms of which 1 ms to minimize.
[2021-05-15 19:32:48] [INFO ] Deduced a trap composed of 32 places in 267 ms of which 1 ms to minimize.
[2021-05-15 19:32:48] [INFO ] Deduced a trap composed of 17 places in 255 ms of which 1 ms to minimize.
[2021-05-15 19:32:48] [INFO ] Deduced a trap composed of 17 places in 252 ms of which 1 ms to minimize.
[2021-05-15 19:32:48] [INFO ] Deduced a trap composed of 25 places in 244 ms of which 1 ms to minimize.
[2021-05-15 19:32:49] [INFO ] Deduced a trap composed of 28 places in 242 ms of which 1 ms to minimize.
[2021-05-15 19:32:49] [INFO ] Deduced a trap composed of 26 places in 242 ms of which 1 ms to minimize.
[2021-05-15 19:32:49] [INFO ] Deduced a trap composed of 21 places in 235 ms of which 1 ms to minimize.
[2021-05-15 19:32:50] [INFO ] Deduced a trap composed of 21 places in 237 ms of which 1 ms to minimize.
[2021-05-15 19:32:50] [INFO ] Deduced a trap composed of 23 places in 226 ms of which 1 ms to minimize.
[2021-05-15 19:32:50] [INFO ] Deduced a trap composed of 28 places in 217 ms of which 0 ms to minimize.
[2021-05-15 19:32:50] [INFO ] Deduced a trap composed of 33 places in 212 ms of which 1 ms to minimize.
[2021-05-15 19:32:51] [INFO ] Deduced a trap composed of 25 places in 210 ms of which 1 ms to minimize.
[2021-05-15 19:32:51] [INFO ] Deduced a trap composed of 26 places in 209 ms of which 0 ms to minimize.
[2021-05-15 19:32:51] [INFO ] Deduced a trap composed of 39 places in 199 ms of which 0 ms to minimize.
[2021-05-15 19:32:51] [INFO ] Deduced a trap composed of 41 places in 195 ms of which 1 ms to minimize.
[2021-05-15 19:32:52] [INFO ] Deduced a trap composed of 41 places in 198 ms of which 0 ms to minimize.
[2021-05-15 19:32:52] [INFO ] Deduced a trap composed of 38 places in 191 ms of which 1 ms to minimize.
[2021-05-15 19:32:52] [INFO ] Deduced a trap composed of 25 places in 187 ms of which 0 ms to minimize.
[2021-05-15 19:32:52] [INFO ] Deduced a trap composed of 24 places in 183 ms of which 1 ms to minimize.
[2021-05-15 19:32:53] [INFO ] Deduced a trap composed of 43 places in 181 ms of which 0 ms to minimize.
[2021-05-15 19:32:53] [INFO ] Deduced a trap composed of 41 places in 178 ms of which 1 ms to minimize.
[2021-05-15 19:32:53] [INFO ] Deduced a trap composed of 36 places in 175 ms of which 1 ms to minimize.
[2021-05-15 19:32:53] [INFO ] Deduced a trap composed of 29 places in 170 ms of which 1 ms to minimize.
[2021-05-15 19:32:53] [INFO ] Deduced a trap composed of 30 places in 176 ms of which 0 ms to minimize.
[2021-05-15 19:32:54] [INFO ] Deduced a trap composed of 35 places in 158 ms of which 1 ms to minimize.
[2021-05-15 19:32:54] [INFO ] Deduced a trap composed of 29 places in 157 ms of which 0 ms to minimize.
[2021-05-15 19:32:54] [INFO ] Deduced a trap composed of 45 places in 154 ms of which 1 ms to minimize.
[2021-05-15 19:32:54] [INFO ] Deduced a trap composed of 42 places in 153 ms of which 1 ms to minimize.
[2021-05-15 19:32:54] [INFO ] Deduced a trap composed of 31 places in 148 ms of which 0 ms to minimize.
[2021-05-15 19:32:55] [INFO ] Deduced a trap composed of 37 places in 144 ms of which 1 ms to minimize.
[2021-05-15 19:32:55] [INFO ] Deduced a trap composed of 41 places in 143 ms of which 1 ms to minimize.
[2021-05-15 19:32:55] [INFO ] Deduced a trap composed of 32 places in 139 ms of which 1 ms to minimize.
[2021-05-15 19:32:55] [INFO ] Deduced a trap composed of 37 places in 138 ms of which 1 ms to minimize.
[2021-05-15 19:32:55] [INFO ] Deduced a trap composed of 34 places in 128 ms of which 0 ms to minimize.
[2021-05-15 19:32:56] [INFO ] Deduced a trap composed of 44 places in 128 ms of which 0 ms to minimize.
[2021-05-15 19:32:56] [INFO ] Deduced a trap composed of 37 places in 122 ms of which 1 ms to minimize.
[2021-05-15 19:32:56] [INFO ] Deduced a trap composed of 34 places in 115 ms of which 0 ms to minimize.
[2021-05-15 19:32:56] [INFO ] Deduced a trap composed of 41 places in 114 ms of which 0 ms to minimize.
[2021-05-15 19:32:56] [INFO ] Deduced a trap composed of 41 places in 111 ms of which 1 ms to minimize.
[2021-05-15 19:32:56] [INFO ] Deduced a trap composed of 28 places in 106 ms of which 0 ms to minimize.
[2021-05-15 19:32:57] [INFO ] Deduced a trap composed of 44 places in 100 ms of which 0 ms to minimize.
[2021-05-15 19:32:57] [INFO ] Deduced a trap composed of 47 places in 97 ms of which 0 ms to minimize.
[2021-05-15 19:32:57] [INFO ] Deduced a trap composed of 38 places in 95 ms of which 0 ms to minimize.
[2021-05-15 19:32:57] [INFO ] Deduced a trap composed of 45 places in 87 ms of which 0 ms to minimize.
[2021-05-15 19:32:57] [INFO ] Trap strengthening (SAT) tested/added 64/63 trap constraints in 16594 ms
[2021-05-15 19:32:57] [INFO ] Computed and/alt/rep : 1629/2444/1629 causal constraints (skipped 0 transitions) in 75 ms.
[2021-05-15 19:33:00] [INFO ] Added : 180 causal constraints over 36 iterations in 2566 ms. Result :unknown
[2021-05-15 19:33:00] [INFO ] [Real]Absence check using 271 positive place invariants in 75 ms returned sat
[2021-05-15 19:33:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-15 19:33:00] [INFO ] [Real]Absence check using state equation in 590 ms returned sat
[2021-05-15 19:33:01] [INFO ] Deduced a trap composed of 17 places in 288 ms of which 1 ms to minimize.
[2021-05-15 19:33:01] [INFO ] Deduced a trap composed of 22 places in 288 ms of which 1 ms to minimize.
[2021-05-15 19:33:02] [INFO ] Deduced a trap composed of 21 places in 283 ms of which 1 ms to minimize.
[2021-05-15 19:33:02] [INFO ] Deduced a trap composed of 19 places in 274 ms of which 1 ms to minimize.
[2021-05-15 19:33:02] [INFO ] Deduced a trap composed of 20 places in 268 ms of which 1 ms to minimize.
[2021-05-15 19:33:02] [INFO ] Deduced a trap composed of 18 places in 268 ms of which 1 ms to minimize.
[2021-05-15 19:33:03] [INFO ] Deduced a trap composed of 19 places in 261 ms of which 1 ms to minimize.
[2021-05-15 19:33:03] [INFO ] Deduced a trap composed of 25 places in 260 ms of which 1 ms to minimize.
[2021-05-15 19:33:03] [INFO ] Deduced a trap composed of 25 places in 261 ms of which 1 ms to minimize.
[2021-05-15 19:33:04] [INFO ] Deduced a trap composed of 18 places in 252 ms of which 0 ms to minimize.
[2021-05-15 19:33:04] [INFO ] Deduced a trap composed of 20 places in 246 ms of which 1 ms to minimize.
[2021-05-15 19:33:04] [INFO ] Deduced a trap composed of 23 places in 250 ms of which 1 ms to minimize.
[2021-05-15 19:33:05] [INFO ] Deduced a trap composed of 18 places in 233 ms of which 1 ms to minimize.
[2021-05-15 19:33:05] [INFO ] Deduced a trap composed of 22 places in 224 ms of which 1 ms to minimize.
[2021-05-15 19:33:05] [INFO ] Deduced a trap composed of 24 places in 217 ms of which 0 ms to minimize.
[2021-05-15 19:33:05] [INFO ] Deduced a trap composed of 21 places in 212 ms of which 1 ms to minimize.
[2021-05-15 19:33:06] [INFO ] Deduced a trap composed of 25 places in 209 ms of which 0 ms to minimize.
[2021-05-15 19:33:06] [INFO ] Deduced a trap composed of 28 places in 200 ms of which 0 ms to minimize.
[2021-05-15 19:33:06] [INFO ] Deduced a trap composed of 25 places in 199 ms of which 1 ms to minimize.
[2021-05-15 19:33:06] [INFO ] Deduced a trap composed of 29 places in 198 ms of which 0 ms to minimize.
[2021-05-15 19:33:07] [INFO ] Deduced a trap composed of 25 places in 195 ms of which 0 ms to minimize.
[2021-05-15 19:33:07] [INFO ] Deduced a trap composed of 25 places in 192 ms of which 1 ms to minimize.
[2021-05-15 19:33:07] [INFO ] Deduced a trap composed of 36 places in 184 ms of which 1 ms to minimize.
[2021-05-15 19:33:07] [INFO ] Deduced a trap composed of 30 places in 179 ms of which 0 ms to minimize.
[2021-05-15 19:33:08] [INFO ] Deduced a trap composed of 28 places in 176 ms of which 1 ms to minimize.
[2021-05-15 19:33:08] [INFO ] Deduced a trap composed of 33 places in 164 ms of which 1 ms to minimize.
[2021-05-15 19:33:08] [INFO ] Deduced a trap composed of 30 places in 157 ms of which 1 ms to minimize.
[2021-05-15 19:33:08] [INFO ] Deduced a trap composed of 22 places in 151 ms of which 1 ms to minimize.
[2021-05-15 19:33:09] [INFO ] Deduced a trap composed of 29 places in 150 ms of which 1 ms to minimize.
[2021-05-15 19:33:09] [INFO ] Deduced a trap composed of 38 places in 142 ms of which 1 ms to minimize.
[2021-05-15 19:33:09] [INFO ] Deduced a trap composed of 37 places in 140 ms of which 0 ms to minimize.
[2021-05-15 19:33:09] [INFO ] Deduced a trap composed of 35 places in 134 ms of which 0 ms to minimize.
[2021-05-15 19:33:09] [INFO ] Deduced a trap composed of 39 places in 124 ms of which 1 ms to minimize.
[2021-05-15 19:33:09] [INFO ] Deduced a trap composed of 34 places in 123 ms of which 0 ms to minimize.
[2021-05-15 19:33:10] [INFO ] Deduced a trap composed of 40 places in 124 ms of which 1 ms to minimize.
[2021-05-15 19:33:10] [INFO ] Deduced a trap composed of 32 places in 116 ms of which 1 ms to minimize.
[2021-05-15 19:33:10] [INFO ] Deduced a trap composed of 36 places in 112 ms of which 1 ms to minimize.
[2021-05-15 19:33:10] [INFO ] Deduced a trap composed of 40 places in 106 ms of which 0 ms to minimize.
[2021-05-15 19:33:10] [INFO ] Deduced a trap composed of 32 places in 103 ms of which 0 ms to minimize.
[2021-05-15 19:33:10] [INFO ] Deduced a trap composed of 42 places in 104 ms of which 1 ms to minimize.
[2021-05-15 19:33:11] [INFO ] Deduced a trap composed of 43 places in 92 ms of which 0 ms to minimize.
[2021-05-15 19:33:11] [INFO ] Deduced a trap composed of 40 places in 88 ms of which 0 ms to minimize.
[2021-05-15 19:33:11] [INFO ] Deduced a trap composed of 42 places in 87 ms of which 0 ms to minimize.
[2021-05-15 19:33:11] [INFO ] Deduced a trap composed of 42 places in 84 ms of which 0 ms to minimize.
[2021-05-15 19:33:11] [INFO ] Deduced a trap composed of 43 places in 82 ms of which 1 ms to minimize.
[2021-05-15 19:33:11] [INFO ] Deduced a trap composed of 39 places in 85 ms of which 0 ms to minimize.
[2021-05-15 19:33:11] [INFO ] Deduced a trap composed of 40 places in 75 ms of which 1 ms to minimize.
[2021-05-15 19:33:12] [INFO ] Deduced a trap composed of 43 places in 67 ms of which 0 ms to minimize.
[2021-05-15 19:33:12] [INFO ] Deduced a trap composed of 47 places in 62 ms of which 0 ms to minimize.
[2021-05-15 19:33:12] [INFO ] Trap strengthening (SAT) tested/added 50/49 trap constraints in 11258 ms
[2021-05-15 19:33:12] [INFO ] Solution in real domain found non-integer solution.
[2021-05-15 19:33:12] [INFO ] [Nat]Absence check using 271 positive place invariants in 76 ms returned sat
[2021-05-15 19:33:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-15 19:33:13] [INFO ] [Nat]Absence check using state equation in 565 ms returned sat
[2021-05-15 19:33:13] [INFO ] Deduced a trap composed of 17 places in 281 ms of which 1 ms to minimize.
[2021-05-15 19:33:13] [INFO ] Deduced a trap composed of 22 places in 280 ms of which 1 ms to minimize.
[2021-05-15 19:33:14] [INFO ] Deduced a trap composed of 21 places in 277 ms of which 1 ms to minimize.
[2021-05-15 19:33:14] [INFO ] Deduced a trap composed of 19 places in 278 ms of which 0 ms to minimize.
[2021-05-15 19:33:14] [INFO ] Deduced a trap composed of 20 places in 268 ms of which 1 ms to minimize.
[2021-05-15 19:33:15] [INFO ] Deduced a trap composed of 18 places in 264 ms of which 1 ms to minimize.
[2021-05-15 19:33:15] [INFO ] Deduced a trap composed of 19 places in 259 ms of which 1 ms to minimize.
[2021-05-15 19:33:15] [INFO ] Deduced a trap composed of 25 places in 259 ms of which 1 ms to minimize.
[2021-05-15 19:33:15] [INFO ] Deduced a trap composed of 25 places in 254 ms of which 1 ms to minimize.
[2021-05-15 19:33:16] [INFO ] Deduced a trap composed of 18 places in 247 ms of which 1 ms to minimize.
[2021-05-15 19:33:16] [INFO ] Deduced a trap composed of 20 places in 246 ms of which 1 ms to minimize.
[2021-05-15 19:33:16] [INFO ] Deduced a trap composed of 23 places in 240 ms of which 1 ms to minimize.
[2021-05-15 19:33:17] [INFO ] Deduced a trap composed of 18 places in 230 ms of which 1 ms to minimize.
[2021-05-15 19:33:17] [INFO ] Deduced a trap composed of 22 places in 219 ms of which 1 ms to minimize.
[2021-05-15 19:33:17] [INFO ] Deduced a trap composed of 24 places in 216 ms of which 0 ms to minimize.
[2021-05-15 19:33:17] [INFO ] Deduced a trap composed of 21 places in 211 ms of which 1 ms to minimize.
[2021-05-15 19:33:18] [INFO ] Deduced a trap composed of 25 places in 202 ms of which 0 ms to minimize.
[2021-05-15 19:33:18] [INFO ] Deduced a trap composed of 28 places in 202 ms of which 1 ms to minimize.
[2021-05-15 19:33:18] [INFO ] Deduced a trap composed of 25 places in 197 ms of which 0 ms to minimize.
[2021-05-15 19:33:18] [INFO ] Deduced a trap composed of 29 places in 196 ms of which 1 ms to minimize.
[2021-05-15 19:33:19] [INFO ] Deduced a trap composed of 25 places in 192 ms of which 0 ms to minimize.
[2021-05-15 19:33:19] [INFO ] Deduced a trap composed of 25 places in 188 ms of which 0 ms to minimize.
[2021-05-15 19:33:19] [INFO ] Deduced a trap composed of 36 places in 182 ms of which 1 ms to minimize.
[2021-05-15 19:33:19] [INFO ] Deduced a trap composed of 30 places in 179 ms of which 1 ms to minimize.
[2021-05-15 19:33:20] [INFO ] Deduced a trap composed of 28 places in 174 ms of which 0 ms to minimize.
[2021-05-15 19:33:20] [INFO ] Deduced a trap composed of 33 places in 169 ms of which 1 ms to minimize.
[2021-05-15 19:33:20] [INFO ] Deduced a trap composed of 30 places in 158 ms of which 1 ms to minimize.
[2021-05-15 19:33:20] [INFO ] Deduced a trap composed of 22 places in 150 ms of which 1 ms to minimize.
[2021-05-15 19:33:20] [INFO ] Deduced a trap composed of 29 places in 143 ms of which 1 ms to minimize.
[2021-05-15 19:33:21] [INFO ] Deduced a trap composed of 38 places in 142 ms of which 1 ms to minimize.
[2021-05-15 19:33:21] [INFO ] Deduced a trap composed of 37 places in 139 ms of which 1 ms to minimize.
[2021-05-15 19:33:21] [INFO ] Deduced a trap composed of 35 places in 135 ms of which 0 ms to minimize.
[2021-05-15 19:33:21] [INFO ] Deduced a trap composed of 33 places in 129 ms of which 0 ms to minimize.
[2021-05-15 19:33:21] [INFO ] Deduced a trap composed of 34 places in 122 ms of which 1 ms to minimize.
[2021-05-15 19:33:22] [INFO ] Deduced a trap composed of 47 places in 121 ms of which 1 ms to minimize.
[2021-05-15 19:33:22] [INFO ] Deduced a trap composed of 39 places in 118 ms of which 1 ms to minimize.
[2021-05-15 19:33:22] [INFO ] Deduced a trap composed of 39 places in 114 ms of which 1 ms to minimize.
[2021-05-15 19:33:22] [INFO ] Deduced a trap composed of 41 places in 112 ms of which 4 ms to minimize.
[2021-05-15 19:33:22] [INFO ] Deduced a trap composed of 32 places in 121 ms of which 1 ms to minimize.
[2021-05-15 19:33:22] [INFO ] Deduced a trap composed of 36 places in 115 ms of which 1 ms to minimize.
[2021-05-15 19:33:23] [INFO ] Deduced a trap composed of 40 places in 115 ms of which 1 ms to minimize.
[2021-05-15 19:33:23] [INFO ] Deduced a trap composed of 40 places in 111 ms of which 0 ms to minimize.
[2021-05-15 19:33:23] [INFO ] Deduced a trap composed of 35 places in 101 ms of which 1 ms to minimize.
[2021-05-15 19:33:23] [INFO ] Deduced a trap composed of 36 places in 93 ms of which 0 ms to minimize.
[2021-05-15 19:33:23] [INFO ] Deduced a trap composed of 42 places in 90 ms of which 1 ms to minimize.
[2021-05-15 19:33:23] [INFO ] Deduced a trap composed of 44 places in 90 ms of which 0 ms to minimize.
[2021-05-15 19:33:23] [INFO ] Deduced a trap composed of 41 places in 85 ms of which 0 ms to minimize.
[2021-05-15 19:33:24] [INFO ] Deduced a trap composed of 37 places in 85 ms of which 1 ms to minimize.
[2021-05-15 19:33:24] [INFO ] Deduced a trap composed of 34 places in 79 ms of which 0 ms to minimize.
[2021-05-15 19:33:24] [INFO ] Deduced a trap composed of 40 places in 77 ms of which 1 ms to minimize.
[2021-05-15 19:33:24] [INFO ] Deduced a trap composed of 43 places in 70 ms of which 0 ms to minimize.
[2021-05-15 19:33:24] [INFO ] Deduced a trap composed of 47 places in 64 ms of which 0 ms to minimize.
[2021-05-15 19:33:24] [INFO ] Deduced a trap composed of 43 places in 59 ms of which 1 ms to minimize.
[2021-05-15 19:33:24] [INFO ] Trap strengthening (SAT) tested/added 54/53 trap constraints in 11587 ms
[2021-05-15 19:33:24] [INFO ] Computed and/alt/rep : 1629/2444/1629 causal constraints (skipped 0 transitions) in 81 ms.
[2021-05-15 19:33:32] [INFO ] Deduced a trap composed of 21 places in 682 ms of which 4 ms to minimize.
[2021-05-15 19:33:32] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 5
[2021-05-15 19:33:33] [INFO ] [Real]Absence check using 271 positive place invariants in 73 ms returned sat
[2021-05-15 19:33:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-15 19:33:33] [INFO ] [Real]Absence check using state equation in 563 ms returned sat
[2021-05-15 19:33:33] [INFO ] Solution in real domain found non-integer solution.
[2021-05-15 19:33:34] [INFO ] [Nat]Absence check using 271 positive place invariants in 40 ms returned unsat
[2021-05-15 19:33:34] [INFO ] [Real]Absence check using 271 positive place invariants in 74 ms returned sat
[2021-05-15 19:33:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-15 19:33:34] [INFO ] [Real]Absence check using state equation in 565 ms returned sat
[2021-05-15 19:33:35] [INFO ] Deduced a trap composed of 28 places in 320 ms of which 1 ms to minimize.
[2021-05-15 19:33:35] [INFO ] Deduced a trap composed of 19 places in 323 ms of which 1 ms to minimize.
[2021-05-15 19:33:35] [INFO ] Deduced a trap composed of 29 places in 310 ms of which 0 ms to minimize.
[2021-05-15 19:33:36] [INFO ] Deduced a trap composed of 21 places in 321 ms of which 1 ms to minimize.
[2021-05-15 19:33:36] [INFO ] Deduced a trap composed of 19 places in 301 ms of which 1 ms to minimize.
[2021-05-15 19:33:37] [INFO ] Deduced a trap composed of 21 places in 297 ms of which 1 ms to minimize.
[2021-05-15 19:33:37] [INFO ] Deduced a trap composed of 24 places in 289 ms of which 0 ms to minimize.
[2021-05-15 19:33:37] [INFO ] Deduced a trap composed of 22 places in 285 ms of which 1 ms to minimize.
[2021-05-15 19:33:38] [INFO ] Deduced a trap composed of 34 places in 279 ms of which 1 ms to minimize.
[2021-05-15 19:33:38] [INFO ] Deduced a trap composed of 24 places in 277 ms of which 0 ms to minimize.
[2021-05-15 19:33:38] [INFO ] Deduced a trap composed of 30 places in 269 ms of which 0 ms to minimize.
[2021-05-15 19:33:39] [INFO ] Deduced a trap composed of 29 places in 267 ms of which 1 ms to minimize.
[2021-05-15 19:33:39] [INFO ] Deduced a trap composed of 26 places in 269 ms of which 1 ms to minimize.
[2021-05-15 19:33:39] [INFO ] Deduced a trap composed of 25 places in 256 ms of which 1 ms to minimize.
[2021-05-15 19:33:39] [INFO ] Deduced a trap composed of 25 places in 252 ms of which 1 ms to minimize.
[2021-05-15 19:33:40] [INFO ] Deduced a trap composed of 23 places in 248 ms of which 1 ms to minimize.
[2021-05-15 19:33:40] [INFO ] Deduced a trap composed of 31 places in 241 ms of which 0 ms to minimize.
[2021-05-15 19:33:40] [INFO ] Deduced a trap composed of 17 places in 238 ms of which 1 ms to minimize.
[2021-05-15 19:33:41] [INFO ] Deduced a trap composed of 35 places in 234 ms of which 1 ms to minimize.
[2021-05-15 19:33:41] [INFO ] Deduced a trap composed of 30 places in 231 ms of which 0 ms to minimize.
[2021-05-15 19:33:41] [INFO ] Deduced a trap composed of 29 places in 234 ms of which 1 ms to minimize.
[2021-05-15 19:33:42] [INFO ] Deduced a trap composed of 41 places in 231 ms of which 0 ms to minimize.
[2021-05-15 19:33:42] [INFO ] Deduced a trap composed of 39 places in 229 ms of which 1 ms to minimize.
[2021-05-15 19:33:42] [INFO ] Deduced a trap composed of 33 places in 220 ms of which 1 ms to minimize.
[2021-05-15 19:33:42] [INFO ] Deduced a trap composed of 37 places in 215 ms of which 1 ms to minimize.
[2021-05-15 19:33:43] [INFO ] Deduced a trap composed of 34 places in 206 ms of which 0 ms to minimize.
[2021-05-15 19:33:43] [INFO ] Deduced a trap composed of 43 places in 202 ms of which 0 ms to minimize.
[2021-05-15 19:33:43] [INFO ] Deduced a trap composed of 40 places in 195 ms of which 1 ms to minimize.
[2021-05-15 19:33:43] [INFO ] Deduced a trap composed of 39 places in 195 ms of which 1 ms to minimize.
[2021-05-15 19:33:44] [INFO ] Deduced a trap composed of 28 places in 186 ms of which 1 ms to minimize.
[2021-05-15 19:33:44] [INFO ] Deduced a trap composed of 25 places in 188 ms of which 0 ms to minimize.
[2021-05-15 19:33:44] [INFO ] Deduced a trap composed of 32 places in 179 ms of which 1 ms to minimize.
[2021-05-15 19:33:44] [INFO ] Deduced a trap composed of 30 places in 189 ms of which 1 ms to minimize.
[2021-05-15 19:33:45] [INFO ] Deduced a trap composed of 31 places in 172 ms of which 1 ms to minimize.
[2021-05-15 19:33:45] [INFO ] Deduced a trap composed of 31 places in 165 ms of which 0 ms to minimize.
[2021-05-15 19:33:45] [INFO ] Deduced a trap composed of 22 places in 156 ms of which 1 ms to minimize.
[2021-05-15 19:33:45] [INFO ] Deduced a trap composed of 20 places in 152 ms of which 0 ms to minimize.
[2021-05-15 19:33:45] [INFO ] Deduced a trap composed of 29 places in 146 ms of which 0 ms to minimize.
[2021-05-15 19:33:46] [INFO ] Deduced a trap composed of 41 places in 136 ms of which 0 ms to minimize.
[2021-05-15 19:33:46] [INFO ] Deduced a trap composed of 31 places in 136 ms of which 1 ms to minimize.
[2021-05-15 19:33:46] [INFO ] Deduced a trap composed of 32 places in 130 ms of which 1 ms to minimize.
[2021-05-15 19:33:46] [INFO ] Deduced a trap composed of 35 places in 127 ms of which 0 ms to minimize.
[2021-05-15 19:33:46] [INFO ] Deduced a trap composed of 32 places in 116 ms of which 0 ms to minimize.
[2021-05-15 19:33:47] [INFO ] Deduced a trap composed of 42 places in 108 ms of which 0 ms to minimize.
[2021-05-15 19:33:47] [INFO ] Deduced a trap composed of 40 places in 108 ms of which 0 ms to minimize.
[2021-05-15 19:33:47] [INFO ] Deduced a trap composed of 42 places in 102 ms of which 0 ms to minimize.
[2021-05-15 19:33:47] [INFO ] Deduced a trap composed of 47 places in 102 ms of which 0 ms to minimize.
[2021-05-15 19:33:47] [INFO ] Deduced a trap composed of 44 places in 96 ms of which 0 ms to minimize.
[2021-05-15 19:33:47] [INFO ] Deduced a trap composed of 36 places in 98 ms of which 0 ms to minimize.
[2021-05-15 19:33:47] [INFO ] Deduced a trap composed of 42 places in 89 ms of which 1 ms to minimize.
[2021-05-15 19:33:48] [INFO ] Deduced a trap composed of 44 places in 82 ms of which 1 ms to minimize.
[2021-05-15 19:33:48] [INFO ] Deduced a trap composed of 42 places in 82 ms of which 0 ms to minimize.
[2021-05-15 19:33:48] [INFO ] Deduced a trap composed of 45 places in 77 ms of which 0 ms to minimize.
[2021-05-15 19:33:48] [INFO ] Deduced a trap composed of 44 places in 70 ms of which 0 ms to minimize.
[2021-05-15 19:33:48] [INFO ] Trap strengthening (SAT) tested/added 55/54 trap constraints in 13687 ms
[2021-05-15 19:33:48] [INFO ] Solution in real domain found non-integer solution.
[2021-05-15 19:33:48] [INFO ] [Nat]Absence check using 271 positive place invariants in 75 ms returned sat
[2021-05-15 19:33:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-15 19:33:49] [INFO ] [Nat]Absence check using state equation in 573 ms returned sat
[2021-05-15 19:33:49] [INFO ] Deduced a trap composed of 28 places in 318 ms of which 1 ms to minimize.
[2021-05-15 19:33:50] [INFO ] Deduced a trap composed of 19 places in 323 ms of which 0 ms to minimize.
[2021-05-15 19:33:50] [INFO ] Deduced a trap composed of 29 places in 325 ms of which 1 ms to minimize.
[2021-05-15 19:33:50] [INFO ] Deduced a trap composed of 21 places in 310 ms of which 1 ms to minimize.
[2021-05-15 19:33:51] [INFO ] Deduced a trap composed of 19 places in 305 ms of which 1 ms to minimize.
[2021-05-15 19:33:51] [INFO ] Deduced a trap composed of 21 places in 304 ms of which 0 ms to minimize.
[2021-05-15 19:33:51] [INFO ] Deduced a trap composed of 24 places in 299 ms of which 1 ms to minimize.
[2021-05-15 19:33:52] [INFO ] Deduced a trap composed of 22 places in 292 ms of which 0 ms to minimize.
[2021-05-15 19:33:52] [INFO ] Deduced a trap composed of 34 places in 290 ms of which 0 ms to minimize.
[2021-05-15 19:33:52] [INFO ] Deduced a trap composed of 17 places in 283 ms of which 1 ms to minimize.
[2021-05-15 19:33:53] [INFO ] Deduced a trap composed of 25 places in 282 ms of which 1 ms to minimize.
[2021-05-15 19:33:53] [INFO ] Deduced a trap composed of 25 places in 278 ms of which 1 ms to minimize.
[2021-05-15 19:33:53] [INFO ] Deduced a trap composed of 25 places in 275 ms of which 1 ms to minimize.
[2021-05-15 19:33:54] [INFO ] Deduced a trap composed of 30 places in 266 ms of which 0 ms to minimize.
[2021-05-15 19:33:54] [INFO ] Deduced a trap composed of 22 places in 262 ms of which 1 ms to minimize.
[2021-05-15 19:33:54] [INFO ] Deduced a trap composed of 26 places in 257 ms of which 1 ms to minimize.
[2021-05-15 19:33:55] [INFO ] Deduced a trap composed of 20 places in 241 ms of which 1 ms to minimize.
[2021-05-15 19:33:55] [INFO ] Deduced a trap composed of 41 places in 231 ms of which 1 ms to minimize.
[2021-05-15 19:33:55] [INFO ] Deduced a trap composed of 28 places in 231 ms of which 1 ms to minimize.
[2021-05-15 19:33:56] [INFO ] Deduced a trap composed of 29 places in 226 ms of which 1 ms to minimize.
[2021-05-15 19:33:56] [INFO ] Deduced a trap composed of 30 places in 225 ms of which 0 ms to minimize.
[2021-05-15 19:33:56] [INFO ] Deduced a trap composed of 33 places in 214 ms of which 0 ms to minimize.
[2021-05-15 19:33:56] [INFO ] Deduced a trap composed of 31 places in 213 ms of which 1 ms to minimize.
[2021-05-15 19:33:57] [INFO ] Deduced a trap composed of 24 places in 200 ms of which 1 ms to minimize.
[2021-05-15 19:33:57] [INFO ] Deduced a trap composed of 29 places in 198 ms of which 1 ms to minimize.
[2021-05-15 19:33:57] [INFO ] Deduced a trap composed of 33 places in 194 ms of which 1 ms to minimize.
[2021-05-15 19:33:57] [INFO ] Deduced a trap composed of 23 places in 191 ms of which 1 ms to minimize.
[2021-05-15 19:33:58] [INFO ] Deduced a trap composed of 35 places in 183 ms of which 1 ms to minimize.
[2021-05-15 19:33:58] [INFO ] Deduced a trap composed of 36 places in 172 ms of which 0 ms to minimize.
[2021-05-15 19:33:58] [INFO ] Deduced a trap composed of 37 places in 168 ms of which 1 ms to minimize.
[2021-05-15 19:33:58] [INFO ] Deduced a trap composed of 43 places in 162 ms of which 1 ms to minimize.
[2021-05-15 19:33:58] [INFO ] Deduced a trap composed of 42 places in 157 ms of which 0 ms to minimize.
[2021-05-15 19:33:59] [INFO ] Deduced a trap composed of 44 places in 152 ms of which 0 ms to minimize.
[2021-05-15 19:33:59] [INFO ] Deduced a trap composed of 42 places in 152 ms of which 0 ms to minimize.
[2021-05-15 19:33:59] [INFO ] Deduced a trap composed of 40 places in 147 ms of which 0 ms to minimize.
[2021-05-15 19:33:59] [INFO ] Deduced a trap composed of 38 places in 142 ms of which 0 ms to minimize.
[2021-05-15 19:33:59] [INFO ] Deduced a trap composed of 30 places in 140 ms of which 1 ms to minimize.
[2021-05-15 19:34:00] [INFO ] Deduced a trap composed of 32 places in 136 ms of which 1 ms to minimize.
[2021-05-15 19:34:00] [INFO ] Deduced a trap composed of 34 places in 135 ms of which 1 ms to minimize.
[2021-05-15 19:34:00] [INFO ] Deduced a trap composed of 28 places in 129 ms of which 0 ms to minimize.
[2021-05-15 19:34:00] [INFO ] Deduced a trap composed of 31 places in 128 ms of which 1 ms to minimize.
[2021-05-15 19:34:00] [INFO ] Deduced a trap composed of 37 places in 119 ms of which 0 ms to minimize.
[2021-05-15 19:34:00] [INFO ] Deduced a trap composed of 40 places in 113 ms of which 1 ms to minimize.
[2021-05-15 19:34:01] [INFO ] Deduced a trap composed of 42 places in 108 ms of which 1 ms to minimize.
[2021-05-15 19:34:01] [INFO ] Deduced a trap composed of 35 places in 107 ms of which 0 ms to minimize.
[2021-05-15 19:34:01] [INFO ] Deduced a trap composed of 29 places in 105 ms of which 1 ms to minimize.
[2021-05-15 19:34:01] [INFO ] Deduced a trap composed of 41 places in 100 ms of which 1 ms to minimize.
[2021-05-15 19:34:01] [INFO ] Deduced a trap composed of 34 places in 94 ms of which 1 ms to minimize.
[2021-05-15 19:34:01] [INFO ] Deduced a trap composed of 32 places in 89 ms of which 1 ms to minimize.
[2021-05-15 19:34:02] [INFO ] Deduced a trap composed of 40 places in 83 ms of which 0 ms to minimize.
[2021-05-15 19:34:02] [INFO ] Deduced a trap composed of 46 places in 89 ms of which 0 ms to minimize.
[2021-05-15 19:34:02] [INFO ] Deduced a trap composed of 44 places in 75 ms of which 0 ms to minimize.
[2021-05-15 19:34:02] [INFO ] Deduced a trap composed of 47 places in 70 ms of which 1 ms to minimize.
[2021-05-15 19:34:02] [INFO ] Trap strengthening (SAT) tested/added 54/53 trap constraints in 13041 ms
[2021-05-15 19:34:02] [INFO ] Computed and/alt/rep : 1629/2444/1629 causal constraints (skipped 0 transitions) in 78 ms.
[2021-05-15 19:34:09] [INFO ] Deduced a trap composed of 21 places in 688 ms of which 3 ms to minimize.
[2021-05-15 19:34:09] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 7
[2021-05-15 19:34:09] [INFO ] [Real]Absence check using 271 positive place invariants in 74 ms returned sat
[2021-05-15 19:34:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-15 19:34:10] [INFO ] [Real]Absence check using state equation in 586 ms returned sat
[2021-05-15 19:34:10] [INFO ] Deduced a trap composed of 20 places in 323 ms of which 0 ms to minimize.
[2021-05-15 19:34:10] [INFO ] Deduced a trap composed of 28 places in 315 ms of which 1 ms to minimize.
[2021-05-15 19:34:11] [INFO ] Deduced a trap composed of 17 places in 316 ms of which 1 ms to minimize.
[2021-05-15 19:34:11] [INFO ] Deduced a trap composed of 17 places in 312 ms of which 1 ms to minimize.
[2021-05-15 19:34:11] [INFO ] Deduced a trap composed of 20 places in 312 ms of which 1 ms to minimize.
[2021-05-15 19:34:12] [INFO ] Deduced a trap composed of 17 places in 304 ms of which 1 ms to minimize.
[2021-05-15 19:34:12] [INFO ] Deduced a trap composed of 26 places in 307 ms of which 1 ms to minimize.
[2021-05-15 19:34:13] [INFO ] Deduced a trap composed of 23 places in 297 ms of which 1 ms to minimize.
[2021-05-15 19:34:13] [INFO ] Deduced a trap composed of 23 places in 295 ms of which 1 ms to minimize.
[2021-05-15 19:34:13] [INFO ] Deduced a trap composed of 22 places in 290 ms of which 1 ms to minimize.
[2021-05-15 19:34:14] [INFO ] Deduced a trap composed of 19 places in 281 ms of which 1 ms to minimize.
[2021-05-15 19:34:14] [INFO ] Deduced a trap composed of 21 places in 270 ms of which 1 ms to minimize.
[2021-05-15 19:34:14] [INFO ] Deduced a trap composed of 25 places in 264 ms of which 0 ms to minimize.
[2021-05-15 19:34:15] [INFO ] Deduced a trap composed of 24 places in 264 ms of which 1 ms to minimize.
[2021-05-15 19:34:15] [INFO ] Deduced a trap composed of 33 places in 261 ms of which 1 ms to minimize.
[2021-05-15 19:34:15] [INFO ] Deduced a trap composed of 32 places in 258 ms of which 0 ms to minimize.
[2021-05-15 19:34:15] [INFO ] Deduced a trap composed of 32 places in 253 ms of which 1 ms to minimize.
[2021-05-15 19:34:16] [INFO ] Deduced a trap composed of 23 places in 249 ms of which 1 ms to minimize.
[2021-05-15 19:34:16] [INFO ] Deduced a trap composed of 17 places in 240 ms of which 0 ms to minimize.
[2021-05-15 19:34:16] [INFO ] Deduced a trap composed of 26 places in 245 ms of which 1 ms to minimize.
[2021-05-15 19:34:17] [INFO ] Deduced a trap composed of 23 places in 240 ms of which 1 ms to minimize.
[2021-05-15 19:34:17] [INFO ] Deduced a trap composed of 30 places in 236 ms of which 1 ms to minimize.
[2021-05-15 19:34:17] [INFO ] Deduced a trap composed of 28 places in 230 ms of which 1 ms to minimize.
[2021-05-15 19:34:18] [INFO ] Deduced a trap composed of 20 places in 231 ms of which 0 ms to minimize.
[2021-05-15 19:34:18] [INFO ] Deduced a trap composed of 29 places in 223 ms of which 1 ms to minimize.
[2021-05-15 19:34:18] [INFO ] Deduced a trap composed of 25 places in 229 ms of which 1 ms to minimize.
[2021-05-15 19:34:18] [INFO ] Deduced a trap composed of 31 places in 218 ms of which 1 ms to minimize.
[2021-05-15 19:34:19] [INFO ] Deduced a trap composed of 29 places in 210 ms of which 1 ms to minimize.
[2021-05-15 19:34:19] [INFO ] Deduced a trap composed of 31 places in 203 ms of which 0 ms to minimize.
[2021-05-15 19:34:19] [INFO ] Deduced a trap composed of 33 places in 199 ms of which 1 ms to minimize.
[2021-05-15 19:34:19] [INFO ] Deduced a trap composed of 32 places in 197 ms of which 1 ms to minimize.
[2021-05-15 19:34:20] [INFO ] Deduced a trap composed of 31 places in 189 ms of which 1 ms to minimize.
[2021-05-15 19:34:20] [INFO ] Deduced a trap composed of 18 places in 186 ms of which 1 ms to minimize.
[2021-05-15 19:34:20] [INFO ] Deduced a trap composed of 39 places in 183 ms of which 0 ms to minimize.
[2021-05-15 19:34:20] [INFO ] Deduced a trap composed of 39 places in 168 ms of which 0 ms to minimize.
[2021-05-15 19:34:21] [INFO ] Deduced a trap composed of 30 places in 166 ms of which 1 ms to minimize.
[2021-05-15 19:34:21] [INFO ] Deduced a trap composed of 39 places in 161 ms of which 0 ms to minimize.
[2021-05-15 19:34:21] [INFO ] Deduced a trap composed of 40 places in 157 ms of which 0 ms to minimize.
[2021-05-15 19:34:21] [INFO ] Deduced a trap composed of 36 places in 157 ms of which 0 ms to minimize.
[2021-05-15 19:34:21] [INFO ] Deduced a trap composed of 41 places in 150 ms of which 0 ms to minimize.
[2021-05-15 19:34:22] [INFO ] Deduced a trap composed of 42 places in 153 ms of which 0 ms to minimize.
[2021-05-15 19:34:22] [INFO ] Deduced a trap composed of 40 places in 146 ms of which 1 ms to minimize.
[2021-05-15 19:34:22] [INFO ] Deduced a trap composed of 47 places in 160 ms of which 1 ms to minimize.
[2021-05-15 19:34:22] [INFO ] Deduced a trap composed of 41 places in 158 ms of which 0 ms to minimize.
[2021-05-15 19:34:22] [INFO ] Deduced a trap composed of 40 places in 138 ms of which 0 ms to minimize.
[2021-05-15 19:34:23] [INFO ] Deduced a trap composed of 38 places in 134 ms of which 1 ms to minimize.
[2021-05-15 19:34:23] [INFO ] Deduced a trap composed of 34 places in 139 ms of which 1 ms to minimize.
[2021-05-15 19:34:23] [INFO ] Deduced a trap composed of 40 places in 124 ms of which 0 ms to minimize.
[2021-05-15 19:34:23] [INFO ] Deduced a trap composed of 40 places in 122 ms of which 1 ms to minimize.
[2021-05-15 19:34:23] [INFO ] Deduced a trap composed of 49 places in 116 ms of which 0 ms to minimize.
[2021-05-15 19:34:24] [INFO ] Deduced a trap composed of 44 places in 112 ms of which 1 ms to minimize.
[2021-05-15 19:34:24] [INFO ] Deduced a trap composed of 45 places in 113 ms of which 0 ms to minimize.
[2021-05-15 19:34:24] [INFO ] Deduced a trap composed of 44 places in 111 ms of which 0 ms to minimize.
[2021-05-15 19:34:24] [INFO ] Deduced a trap composed of 44 places in 106 ms of which 0 ms to minimize.
[2021-05-15 19:34:24] [INFO ] Deduced a trap composed of 47 places in 98 ms of which 1 ms to minimize.
[2021-05-15 19:34:24] [INFO ] Deduced a trap composed of 42 places in 92 ms of which 0 ms to minimize.
[2021-05-15 19:34:24] [INFO ] Deduced a trap composed of 41 places in 88 ms of which 0 ms to minimize.
[2021-05-15 19:34:25] [INFO ] Trap strengthening (SAT) tested/added 58/57 trap constraints in 14889 ms
[2021-05-15 19:34:25] [INFO ] Solution in real domain found non-integer solution.
[2021-05-15 19:34:25] [INFO ] [Nat]Absence check using 271 positive place invariants in 81 ms returned sat
[2021-05-15 19:34:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-15 19:34:25] [INFO ] [Nat]Absence check using state equation in 571 ms returned sat
[2021-05-15 19:34:26] [INFO ] Deduced a trap composed of 20 places in 322 ms of which 1 ms to minimize.
[2021-05-15 19:34:26] [INFO ] Deduced a trap composed of 28 places in 315 ms of which 1 ms to minimize.
[2021-05-15 19:34:27] [INFO ] Deduced a trap composed of 17 places in 314 ms of which 1 ms to minimize.
[2021-05-15 19:34:27] [INFO ] Deduced a trap composed of 18 places in 314 ms of which 1 ms to minimize.
[2021-05-15 19:34:27] [INFO ] Deduced a trap composed of 17 places in 313 ms of which 1 ms to minimize.
[2021-05-15 19:34:28] [INFO ] Deduced a trap composed of 20 places in 317 ms of which 1 ms to minimize.
[2021-05-15 19:34:28] [INFO ] Deduced a trap composed of 22 places in 303 ms of which 1 ms to minimize.
[2021-05-15 19:34:28] [INFO ] Deduced a trap composed of 25 places in 287 ms of which 1 ms to minimize.
[2021-05-15 19:34:29] [INFO ] Deduced a trap composed of 24 places in 282 ms of which 1 ms to minimize.
[2021-05-15 19:34:29] [INFO ] Deduced a trap composed of 38 places in 280 ms of which 1 ms to minimize.
[2021-05-15 19:34:29] [INFO ] Deduced a trap composed of 23 places in 280 ms of which 1 ms to minimize.
[2021-05-15 19:34:30] [INFO ] Deduced a trap composed of 29 places in 279 ms of which 1 ms to minimize.
[2021-05-15 19:34:30] [INFO ] Deduced a trap composed of 22 places in 283 ms of which 1 ms to minimize.
[2021-05-15 19:34:30] [INFO ] Deduced a trap composed of 28 places in 265 ms of which 1 ms to minimize.
[2021-05-15 19:34:31] [INFO ] Deduced a trap composed of 26 places in 261 ms of which 1 ms to minimize.
[2021-05-15 19:34:31] [INFO ] Deduced a trap composed of 17 places in 259 ms of which 1 ms to minimize.
[2021-05-15 19:34:31] [INFO ] Deduced a trap composed of 25 places in 265 ms of which 1 ms to minimize.
[2021-05-15 19:34:31] [INFO ] Deduced a trap composed of 18 places in 249 ms of which 1 ms to minimize.
[2021-05-15 19:34:32] [INFO ] Deduced a trap composed of 23 places in 258 ms of which 0 ms to minimize.
[2021-05-15 19:34:32] [INFO ] Deduced a trap composed of 23 places in 247 ms of which 1 ms to minimize.
[2021-05-15 19:34:32] [INFO ] Deduced a trap composed of 23 places in 232 ms of which 1 ms to minimize.
[2021-05-15 19:34:33] [INFO ] Deduced a trap composed of 31 places in 229 ms of which 0 ms to minimize.
[2021-05-15 19:34:33] [INFO ] Deduced a trap composed of 20 places in 225 ms of which 1 ms to minimize.
[2021-05-15 19:34:33] [INFO ] Deduced a trap composed of 26 places in 223 ms of which 1 ms to minimize.
[2021-05-15 19:34:33] [INFO ] Deduced a trap composed of 31 places in 223 ms of which 1 ms to minimize.
[2021-05-15 19:34:34] [INFO ] Deduced a trap composed of 29 places in 222 ms of which 1 ms to minimize.
[2021-05-15 19:34:34] [INFO ] Deduced a trap composed of 32 places in 219 ms of which 0 ms to minimize.
[2021-05-15 19:34:34] [INFO ] Deduced a trap composed of 30 places in 214 ms of which 1 ms to minimize.
[2021-05-15 19:34:35] [INFO ] Deduced a trap composed of 30 places in 205 ms of which 1 ms to minimize.
[2021-05-15 19:34:35] [INFO ] Deduced a trap composed of 42 places in 199 ms of which 1 ms to minimize.
[2021-05-15 19:34:35] [INFO ] Deduced a trap composed of 31 places in 194 ms of which 1 ms to minimize.
[2021-05-15 19:34:35] [INFO ] Deduced a trap composed of 34 places in 190 ms of which 0 ms to minimize.
[2021-05-15 19:34:36] [INFO ] Deduced a trap composed of 23 places in 184 ms of which 1 ms to minimize.
[2021-05-15 19:34:36] [INFO ] Deduced a trap composed of 36 places in 177 ms of which 0 ms to minimize.
[2021-05-15 19:34:36] [INFO ] Deduced a trap composed of 34 places in 174 ms of which 1 ms to minimize.
[2021-05-15 19:34:36] [INFO ] Deduced a trap composed of 35 places in 176 ms of which 1 ms to minimize.
[2021-05-15 19:34:36] [INFO ] Deduced a trap composed of 43 places in 167 ms of which 0 ms to minimize.
[2021-05-15 19:34:37] [INFO ] Deduced a trap composed of 43 places in 163 ms of which 0 ms to minimize.
[2021-05-15 19:34:37] [INFO ] Deduced a trap composed of 33 places in 161 ms of which 1 ms to minimize.
[2021-05-15 19:34:37] [INFO ] Deduced a trap composed of 37 places in 159 ms of which 1 ms to minimize.
[2021-05-15 19:34:37] [INFO ] Deduced a trap composed of 37 places in 162 ms of which 0 ms to minimize.
[2021-05-15 19:34:37] [INFO ] Deduced a trap composed of 32 places in 163 ms of which 0 ms to minimize.
[2021-05-15 19:34:38] [INFO ] Deduced a trap composed of 41 places in 157 ms of which 0 ms to minimize.
[2021-05-15 19:34:38] [INFO ] Deduced a trap composed of 41 places in 150 ms of which 0 ms to minimize.
[2021-05-15 19:34:38] [INFO ] Deduced a trap composed of 28 places in 147 ms of which 1 ms to minimize.
[2021-05-15 19:34:38] [INFO ] Deduced a trap composed of 47 places in 142 ms of which 1 ms to minimize.
[2021-05-15 19:34:38] [INFO ] Deduced a trap composed of 40 places in 138 ms of which 1 ms to minimize.
[2021-05-15 19:34:39] [INFO ] Deduced a trap composed of 40 places in 137 ms of which 0 ms to minimize.
[2021-05-15 19:34:39] [INFO ] Deduced a trap composed of 39 places in 130 ms of which 1 ms to minimize.
[2021-05-15 19:34:39] [INFO ] Deduced a trap composed of 41 places in 127 ms of which 0 ms to minimize.
[2021-05-15 19:34:39] [INFO ] Deduced a trap composed of 39 places in 126 ms of which 1 ms to minimize.
[2021-05-15 19:34:39] [INFO ] Deduced a trap composed of 43 places in 121 ms of which 1 ms to minimize.
[2021-05-15 19:34:40] [INFO ] Deduced a trap composed of 45 places in 115 ms of which 0 ms to minimize.
[2021-05-15 19:34:40] [INFO ] Deduced a trap composed of 42 places in 117 ms of which 0 ms to minimize.
[2021-05-15 19:34:40] [INFO ] Deduced a trap composed of 41 places in 111 ms of which 1 ms to minimize.
[2021-05-15 19:34:40] [INFO ] Deduced a trap composed of 40 places in 107 ms of which 0 ms to minimize.
[2021-05-15 19:34:40] [INFO ] Deduced a trap composed of 42 places in 104 ms of which 0 ms to minimize.
[2021-05-15 19:34:40] [INFO ] Deduced a trap composed of 38 places in 99 ms of which 0 ms to minimize.
[2021-05-15 19:34:40] [INFO ] Deduced a trap composed of 47 places in 95 ms of which 0 ms to minimize.
[2021-05-15 19:34:41] [INFO ] Deduced a trap composed of 44 places in 89 ms of which 0 ms to minimize.
[2021-05-15 19:34:41] [INFO ] Trap strengthening (SAT) tested/added 61/60 trap constraints in 15233 ms
[2021-05-15 19:34:41] [INFO ] Computed and/alt/rep : 1629/2444/1629 causal constraints (skipped 0 transitions) in 78 ms.
[2021-05-15 19:34:45] [INFO ] Deduced a trap composed of 21 places in 693 ms of which 2 ms to minimize.
[2021-05-15 19:34:45] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 8
[2021-05-15 19:34:46] [INFO ] [Real]Absence check using 271 positive place invariants in 76 ms returned sat
[2021-05-15 19:34:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-15 19:34:46] [INFO ] [Real]Absence check using state equation in 572 ms returned sat
[2021-05-15 19:34:46] [INFO ] Deduced a trap composed of 16 places in 294 ms of which 1 ms to minimize.
[2021-05-15 19:34:47] [INFO ] Deduced a trap composed of 20 places in 290 ms of which 1 ms to minimize.
[2021-05-15 19:34:47] [INFO ] Deduced a trap composed of 23 places in 275 ms of which 1 ms to minimize.
[2021-05-15 19:34:47] [INFO ] Deduced a trap composed of 26 places in 275 ms of which 0 ms to minimize.
[2021-05-15 19:34:48] [INFO ] Deduced a trap composed of 20 places in 278 ms of which 1 ms to minimize.
[2021-05-15 19:34:48] [INFO ] Deduced a trap composed of 22 places in 263 ms of which 1 ms to minimize.
[2021-05-15 19:34:48] [INFO ] Deduced a trap composed of 24 places in 255 ms of which 1 ms to minimize.
[2021-05-15 19:34:49] [INFO ] Deduced a trap composed of 30 places in 246 ms of which 0 ms to minimize.
[2021-05-15 19:34:49] [INFO ] Deduced a trap composed of 29 places in 240 ms of which 1 ms to minimize.
[2021-05-15 19:34:49] [INFO ] Deduced a trap composed of 29 places in 243 ms of which 1 ms to minimize.
[2021-05-15 19:34:50] [INFO ] Deduced a trap composed of 27 places in 241 ms of which 1 ms to minimize.
[2021-05-15 19:34:50] [INFO ] Deduced a trap composed of 30 places in 240 ms of which 1 ms to minimize.
[2021-05-15 19:34:50] [INFO ] Deduced a trap composed of 18 places in 234 ms of which 1 ms to minimize.
[2021-05-15 19:34:51] [INFO ] Deduced a trap composed of 28 places in 227 ms of which 1 ms to minimize.
[2021-05-15 19:34:51] [INFO ] Deduced a trap composed of 23 places in 227 ms of which 0 ms to minimize.
[2021-05-15 19:34:51] [INFO ] Deduced a trap composed of 29 places in 216 ms of which 0 ms to minimize.
[2021-05-15 19:34:51] [INFO ] Deduced a trap composed of 32 places in 212 ms of which 1 ms to minimize.
[2021-05-15 19:34:52] [INFO ] Deduced a trap composed of 37 places in 205 ms of which 0 ms to minimize.
[2021-05-15 19:34:52] [INFO ] Deduced a trap composed of 30 places in 201 ms of which 1 ms to minimize.
[2021-05-15 19:34:52] [INFO ] Deduced a trap composed of 33 places in 188 ms of which 1 ms to minimize.
[2021-05-15 19:34:52] [INFO ] Deduced a trap composed of 39 places in 193 ms of which 1 ms to minimize.
[2021-05-15 19:34:53] [INFO ] Deduced a trap composed of 31 places in 186 ms of which 1 ms to minimize.
[2021-05-15 19:34:53] [INFO ] Deduced a trap composed of 29 places in 187 ms of which 0 ms to minimize.
[2021-05-15 19:34:53] [INFO ] Deduced a trap composed of 33 places in 179 ms of which 1 ms to minimize.
[2021-05-15 19:34:53] [INFO ] Deduced a trap composed of 19 places in 173 ms of which 1 ms to minimize.
[2021-05-15 19:34:54] [INFO ] Deduced a trap composed of 22 places in 173 ms of which 1 ms to minimize.
[2021-05-15 19:34:54] [INFO ] Deduced a trap composed of 42 places in 173 ms of which 0 ms to minimize.
[2021-05-15 19:34:54] [INFO ] Deduced a trap composed of 36 places in 144 ms of which 1 ms to minimize.
[2021-05-15 19:34:54] [INFO ] Deduced a trap composed of 43 places in 142 ms of which 1 ms to minimize.
[2021-05-15 19:34:54] [INFO ] Deduced a trap composed of 32 places in 138 ms of which 1 ms to minimize.
[2021-05-15 19:34:55] [INFO ] Deduced a trap composed of 43 places in 136 ms of which 0 ms to minimize.
[2021-05-15 19:34:55] [INFO ] Deduced a trap composed of 41 places in 129 ms of which 0 ms to minimize.
[2021-05-15 19:34:55] [INFO ] Deduced a trap composed of 40 places in 117 ms of which 1 ms to minimize.
[2021-05-15 19:34:55] [INFO ] Deduced a trap composed of 43 places in 115 ms of which 1 ms to minimize.
[2021-05-15 19:34:55] [INFO ] Deduced a trap composed of 37 places in 114 ms of which 0 ms to minimize.
[2021-05-15 19:34:55] [INFO ] Deduced a trap composed of 34 places in 114 ms of which 3 ms to minimize.
[2021-05-15 19:34:56] [INFO ] Deduced a trap composed of 38 places in 106 ms of which 0 ms to minimize.
[2021-05-15 19:34:56] [INFO ] Deduced a trap composed of 33 places in 105 ms of which 1 ms to minimize.
[2021-05-15 19:34:56] [INFO ] Deduced a trap composed of 44 places in 97 ms of which 1 ms to minimize.
[2021-05-15 19:34:56] [INFO ] Deduced a trap composed of 41 places in 94 ms of which 1 ms to minimize.
[2021-05-15 19:34:56] [INFO ] Deduced a trap composed of 39 places in 101 ms of which 0 ms to minimize.
[2021-05-15 19:34:56] [INFO ] Deduced a trap composed of 40 places in 89 ms of which 1 ms to minimize.
[2021-05-15 19:34:56] [INFO ] Deduced a trap composed of 40 places in 85 ms of which 0 ms to minimize.
[2021-05-15 19:34:57] [INFO ] Deduced a trap composed of 45 places in 80 ms of which 1 ms to minimize.
[2021-05-15 19:34:57] [INFO ] Deduced a trap composed of 43 places in 77 ms of which 0 ms to minimize.
[2021-05-15 19:34:57] [INFO ] Deduced a trap composed of 41 places in 67 ms of which 1 ms to minimize.
[2021-05-15 19:34:57] [INFO ] Deduced a trap composed of 41 places in 64 ms of which 1 ms to minimize.
[2021-05-15 19:34:57] [INFO ] Trap strengthening (SAT) tested/added 48/47 trap constraints in 10895 ms
[2021-05-15 19:34:57] [INFO ] Solution in real domain found non-integer solution.
[2021-05-15 19:34:57] [INFO ] [Nat]Absence check using 271 positive place invariants in 74 ms returned sat
[2021-05-15 19:34:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-15 19:34:58] [INFO ] [Nat]Absence check using state equation in 566 ms returned sat
[2021-05-15 19:34:58] [INFO ] Deduced a trap composed of 16 places in 286 ms of which 1 ms to minimize.
[2021-05-15 19:34:59] [INFO ] Deduced a trap composed of 20 places in 283 ms of which 1 ms to minimize.
[2021-05-15 19:34:59] [INFO ] Deduced a trap composed of 23 places in 272 ms of which 1 ms to minimize.
[2021-05-15 19:34:59] [INFO ] Deduced a trap composed of 26 places in 268 ms of which 1 ms to minimize.
[2021-05-15 19:35:00] [INFO ] Deduced a trap composed of 20 places in 267 ms of which 0 ms to minimize.
[2021-05-15 19:35:00] [INFO ] Deduced a trap composed of 22 places in 262 ms of which 1 ms to minimize.
[2021-05-15 19:35:00] [INFO ] Deduced a trap composed of 24 places in 255 ms of which 1 ms to minimize.
[2021-05-15 19:35:00] [INFO ] Deduced a trap composed of 30 places in 246 ms of which 1 ms to minimize.
[2021-05-15 19:35:01] [INFO ] Deduced a trap composed of 29 places in 244 ms of which 1 ms to minimize.
[2021-05-15 19:35:01] [INFO ] Deduced a trap composed of 29 places in 243 ms of which 0 ms to minimize.
[2021-05-15 19:35:01] [INFO ] Deduced a trap composed of 18 places in 239 ms of which 0 ms to minimize.
[2021-05-15 19:35:02] [INFO ] Deduced a trap composed of 30 places in 232 ms of which 0 ms to minimize.
[2021-05-15 19:35:02] [INFO ] Deduced a trap composed of 27 places in 231 ms of which 0 ms to minimize.
[2021-05-15 19:35:02] [INFO ] Deduced a trap composed of 19 places in 226 ms of which 0 ms to minimize.
[2021-05-15 19:35:02] [INFO ] Deduced a trap composed of 23 places in 225 ms of which 1 ms to minimize.
[2021-05-15 19:35:03] [INFO ] Deduced a trap composed of 31 places in 213 ms of which 1 ms to minimize.
[2021-05-15 19:35:03] [INFO ] Deduced a trap composed of 33 places in 211 ms of which 1 ms to minimize.
[2021-05-15 19:35:03] [INFO ] Deduced a trap composed of 22 places in 205 ms of which 0 ms to minimize.
[2021-05-15 19:35:03] [INFO ] Deduced a trap composed of 33 places in 197 ms of which 1 ms to minimize.
[2021-05-15 19:35:04] [INFO ] Deduced a trap composed of 29 places in 195 ms of which 2 ms to minimize.
[2021-05-15 19:35:04] [INFO ] Deduced a trap composed of 45 places in 191 ms of which 1 ms to minimize.
[2021-05-15 19:35:04] [INFO ] Deduced a trap composed of 28 places in 183 ms of which 1 ms to minimize.
[2021-05-15 19:35:04] [INFO ] Deduced a trap composed of 32 places in 187 ms of which 0 ms to minimize.
[2021-05-15 19:35:05] [INFO ] Deduced a trap composed of 37 places in 173 ms of which 1 ms to minimize.
[2021-05-15 19:35:05] [INFO ] Deduced a trap composed of 34 places in 171 ms of which 1 ms to minimize.
[2021-05-15 19:35:05] [INFO ] Deduced a trap composed of 35 places in 163 ms of which 0 ms to minimize.
[2021-05-15 19:35:05] [INFO ] Deduced a trap composed of 30 places in 164 ms of which 1 ms to minimize.
[2021-05-15 19:35:06] [INFO ] Deduced a trap composed of 41 places in 159 ms of which 0 ms to minimize.
[2021-05-15 19:35:06] [INFO ] Deduced a trap composed of 40 places in 160 ms of which 0 ms to minimize.
[2021-05-15 19:35:06] [INFO ] Deduced a trap composed of 33 places in 154 ms of which 1 ms to minimize.
[2021-05-15 19:35:06] [INFO ] Deduced a trap composed of 40 places in 149 ms of which 0 ms to minimize.
[2021-05-15 19:35:06] [INFO ] Deduced a trap composed of 33 places in 148 ms of which 0 ms to minimize.
[2021-05-15 19:35:07] [INFO ] Deduced a trap composed of 35 places in 143 ms of which 0 ms to minimize.
[2021-05-15 19:35:07] [INFO ] Deduced a trap composed of 36 places in 136 ms of which 1 ms to minimize.
[2021-05-15 19:35:07] [INFO ] Deduced a trap composed of 41 places in 131 ms of which 1 ms to minimize.
[2021-05-15 19:35:07] [INFO ] Deduced a trap composed of 42 places in 120 ms of which 0 ms to minimize.
[2021-05-15 19:35:07] [INFO ] Deduced a trap composed of 39 places in 115 ms of which 1 ms to minimize.
[2021-05-15 19:35:07] [INFO ] Deduced a trap composed of 39 places in 116 ms of which 1 ms to minimize.
[2021-05-15 19:35:08] [INFO ] Deduced a trap composed of 30 places in 109 ms of which 0 ms to minimize.
[2021-05-15 19:35:08] [INFO ] Deduced a trap composed of 43 places in 101 ms of which 0 ms to minimize.
[2021-05-15 19:35:08] [INFO ] Deduced a trap composed of 40 places in 96 ms of which 1 ms to minimize.
[2021-05-15 19:35:08] [INFO ] Deduced a trap composed of 44 places in 91 ms of which 1 ms to minimize.
[2021-05-15 19:35:08] [INFO ] Deduced a trap composed of 41 places in 88 ms of which 0 ms to minimize.
[2021-05-15 19:35:08] [INFO ] Deduced a trap composed of 41 places in 88 ms of which 0 ms to minimize.
[2021-05-15 19:35:08] [INFO ] Deduced a trap composed of 44 places in 94 ms of which 0 ms to minimize.
[2021-05-15 19:35:09] [INFO ] Deduced a trap composed of 43 places in 81 ms of which 0 ms to minimize.
[2021-05-15 19:35:09] [INFO ] Deduced a trap composed of 43 places in 76 ms of which 0 ms to minimize.
[2021-05-15 19:35:09] [INFO ] Trap strengthening (SAT) tested/added 48/47 trap constraints in 10830 ms
[2021-05-15 19:35:09] [INFO ] Computed and/alt/rep : 1629/2444/1629 causal constraints (skipped 0 transitions) in 80 ms.
[2021-05-15 19:35:18] [INFO ] Deduced a trap composed of 21 places in 697 ms of which 1 ms to minimize.
[2021-05-15 19:35:18] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 9
Successfully simplified 1 atomic propositions for a total of 15 simplifications.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(((G(p0) U (G(p2)||p1)) U p3))], workingDir=/home/mcc/execution]
Support contains 6 out of 1780 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1780/1780 places, 1630/1630 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 360 transitions
Trivial Post-agglo rules discarded 360 transitions
Performed 360 trivial Post agglomeration. Transition count delta: 360
Iterating post reduction 0 with 360 rules applied. Total rules applied 360 place count 1779 transition count 1269
Reduce places removed 360 places and 0 transitions.
Iterating post reduction 1 with 360 rules applied. Total rules applied 720 place count 1419 transition count 1269
Performed 235 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 235 Pre rules applied. Total rules applied 720 place count 1419 transition count 1034
Deduced a syphon composed of 235 places in 2 ms
Reduce places removed 235 places and 0 transitions.
Iterating global reduction 2 with 470 rules applied. Total rules applied 1190 place count 1184 transition count 1034
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 1196 place count 1178 transition count 1028
Iterating global reduction 2 with 6 rules applied. Total rules applied 1202 place count 1178 transition count 1028
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 1202 place count 1178 transition count 1024
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 1210 place count 1174 transition count 1024
Performed 505 Post agglomeration using F-continuation condition.Transition count delta: 505
Deduced a syphon composed of 505 places in 0 ms
Reduce places removed 505 places and 0 transitions.
Iterating global reduction 2 with 1010 rules applied. Total rules applied 2220 place count 669 transition count 519
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2221 place count 669 transition count 518
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2223 place count 668 transition count 517
Performed 89 Post agglomeration using F-continuation condition.Transition count delta: -59
Deduced a syphon composed of 89 places in 1 ms
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 3 with 178 rules applied. Total rules applied 2401 place count 579 transition count 576
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 2402 place count 578 transition count 575
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 2404 place count 576 transition count 575
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 2404 place count 576 transition count 574
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2406 place count 575 transition count 574
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 2407 place count 574 transition count 573
Applied a total of 2407 rules in 442 ms. Remains 574 /1780 variables (removed 1206) and now considering 573/1630 (removed 1057) transitions.
// Phase 1: matrix 573 rows 574 cols
[2021-05-15 19:35:18] [INFO ] Computed 269 place invariants in 2 ms
[2021-05-15 19:35:19] [INFO ] Implicit Places using invariants in 329 ms returned [563]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 331 ms to find 1 implicit places.
[2021-05-15 19:35:19] [INFO ] Redundant transitions in 33 ms returned []
// Phase 1: matrix 573 rows 573 cols
[2021-05-15 19:35:19] [INFO ] Computed 268 place invariants in 1 ms
[2021-05-15 19:35:19] [INFO ] Dead Transitions using invariants and state equation in 268 ms returned []
Starting structural reductions, iteration 1 : 573/1780 places, 573/1630 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 572 transition count 572
Applied a total of 2 rules in 24 ms. Remains 572 /573 variables (removed 1) and now considering 572/573 (removed 1) transitions.
// Phase 1: matrix 572 rows 572 cols
[2021-05-15 19:35:19] [INFO ] Computed 268 place invariants in 1 ms
[2021-05-15 19:35:19] [INFO ] Implicit Places using invariants in 362 ms returned []
// Phase 1: matrix 572 rows 572 cols
[2021-05-15 19:35:19] [INFO ] Computed 268 place invariants in 2 ms
[2021-05-15 19:35:20] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-15 19:35:20] [INFO ] Implicit Places using invariants and state equation in 528 ms returned []
Implicit Place search using SMT with State Equation took 890 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 572/1780 places, 572/1630 transitions.
Stuttering acceptance computed with spot in 339 ms :[(NOT p3), true, (NOT p0), (NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : ShieldIIPt-PT-030B-00 automaton TGBA [mat=[[{ cond=(OR (AND (NOT p3) p1) (AND (NOT p3) p2) (AND (NOT p3) p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p3) (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p3) (NOT p1) (NOT p2) p0), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p3) (NOT p1) p2 (NOT p0)), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p3) (NOT p1) p2 p0), acceptance={} source=0 dest: 4}, { cond=(AND (NOT p3) (NOT p1) p0), acceptance={} source=0 dest: 5}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={} source=3 dest: 1}, { cond=p2, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p2) p0), acceptance={} source=4 dest: 2}, { cond=(AND p2 (NOT p0)), acceptance={} source=4 dest: 3}, { cond=(AND p2 p0), acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p1) p2 p0), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={0} source=5 dest: 5}, { cond=(AND (NOT p1) p2 p0), acceptance={} source=5 dest: 5}]], initial=0, aps=[p3:(AND (EQ s543 1) (EQ s553 1)), p1:(OR (EQ s496 1) (AND (EQ s8 1) (EQ s20 1))), p2:(EQ s148 0), p0:(EQ s496 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null][true, true, true, true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA ShieldIIPt-PT-030B-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-030B-00 finished in 2378 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((G(p0)||G((p1 U (p2||X(G(p3))))))))], workingDir=/home/mcc/execution]
Support contains 5 out of 1780 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1780/1780 places, 1630/1630 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 1773 transition count 1623
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 1773 transition count 1623
Applied a total of 14 rules in 206 ms. Remains 1773 /1780 variables (removed 7) and now considering 1623/1630 (removed 7) transitions.
// Phase 1: matrix 1623 rows 1773 cols
[2021-05-15 19:35:20] [INFO ] Computed 271 place invariants in 6 ms
[2021-05-15 19:35:21] [INFO ] Implicit Places using invariants in 500 ms returned []
// Phase 1: matrix 1623 rows 1773 cols
[2021-05-15 19:35:21] [INFO ] Computed 271 place invariants in 6 ms
[2021-05-15 19:35:22] [INFO ] Implicit Places using invariants and state equation in 1335 ms returned []
Implicit Place search using SMT with State Equation took 1844 ms to find 0 implicit places.
// Phase 1: matrix 1623 rows 1773 cols
[2021-05-15 19:35:22] [INFO ] Computed 271 place invariants in 5 ms
[2021-05-15 19:35:23] [INFO ] Dead Transitions using invariants and state equation in 858 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1773/1780 places, 1623/1630 transitions.
Stuttering acceptance computed with spot in 203 ms :[(AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (NOT p3), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p3)), true, (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-030B-01 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=1 dest: 4}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=1 dest: 5}], [{ cond=p3, acceptance={} source=2 dest: 2}, { cond=(NOT p3), acceptance={} source=2 dest: 6}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}, { cond=(AND (NOT p2) p1), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p2) p1 (NOT p3)), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p2) p1 p3), acceptance={} source=4 dest: 4}], [{ cond=(OR (AND (NOT p0) p2 p3) (AND (NOT p0) p1 p3)), acceptance={} source=5 dest: 2}, { cond=(OR (AND p0 p2 p3) (AND p0 p1 p3)), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p0) (NOT p3)), acceptance={} source=5 dest: 6}, { cond=(AND p0 (NOT p3)), acceptance={} source=5 dest: 7}], [{ cond=true, acceptance={0} source=6 dest: 6}], [{ cond=(NOT p0), acceptance={} source=7 dest: 6}, { cond=p0, acceptance={} source=7 dest: 7}]], initial=0, aps=[p0:(EQ s1690 0), p2:(EQ s986 1), p1:(AND (EQ s281 1) (EQ s313 1)), p3:(NEQ s602 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 25062 reset in 870 ms.
Product exploration explored 100000 steps with 25053 reset in 696 ms.
Knowledge obtained : [p0, (NOT p2), (NOT p1), p3]
Stuttering acceptance computed with spot in 202 ms :[(AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (NOT p3), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p3)), true, (NOT p0)]
Product exploration explored 100000 steps with 25028 reset in 662 ms.
Product exploration explored 100000 steps with 24978 reset in 672 ms.
Applying partial POR strategy [false, false, true, false, false, true, true, true]
Stuttering acceptance computed with spot in 201 ms :[(AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (NOT p3), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p3)), true, (NOT p0)]
Support contains 5 out of 1773 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 1773/1773 places, 1623/1623 transitions.
Performed 356 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 356 rules applied. Total rules applied 356 place count 1773 transition count 1623
Performed 151 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 151 Pre rules applied. Total rules applied 356 place count 1773 transition count 1803
Deduced a syphon composed of 507 places in 2 ms
Iterating global reduction 1 with 151 rules applied. Total rules applied 507 place count 1773 transition count 1803
Performed 569 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1076 places in 2 ms
Iterating global reduction 1 with 569 rules applied. Total rules applied 1076 place count 1773 transition count 1804
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 1077 place count 1773 transition count 1803
Renaming transitions due to excessive name length > 1024 char.
Discarding 207 places :
Symmetric choice reduction at 2 with 207 rule applications. Total rules 1284 place count 1566 transition count 1596
Deduced a syphon composed of 869 places in 1 ms
Iterating global reduction 2 with 207 rules applied. Total rules applied 1491 place count 1566 transition count 1596
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 870 places in 2 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 1492 place count 1566 transition count 1596
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 1494 place count 1564 transition count 1594
Deduced a syphon composed of 868 places in 1 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 1496 place count 1564 transition count 1594
Performed 91 Post agglomeration using F-continuation condition.Transition count delta: -502
Deduced a syphon composed of 959 places in 2 ms
Iterating global reduction 2 with 91 rules applied. Total rules applied 1587 place count 1564 transition count 2096
Discarding 92 places :
Symmetric choice reduction at 2 with 92 rule applications. Total rules 1679 place count 1472 transition count 1912
Deduced a syphon composed of 867 places in 1 ms
Iterating global reduction 2 with 92 rules applied. Total rules applied 1771 place count 1472 transition count 1912
Deduced a syphon composed of 867 places in 2 ms
Applied a total of 1771 rules in 1004 ms. Remains 1472 /1773 variables (removed 301) and now considering 1912/1623 (removed -289) transitions.
[2021-05-15 19:35:29] [INFO ] Redundant transitions in 131 ms returned []
// Phase 1: matrix 1912 rows 1472 cols
[2021-05-15 19:35:29] [INFO ] Computed 271 place invariants in 13 ms
[2021-05-15 19:35:30] [INFO ] Dead Transitions using invariants and state equation in 1002 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1472/1773 places, 1912/1623 transitions.
Product exploration explored 100000 steps with 24947 reset in 3217 ms.
Product exploration explored 100000 steps with 25045 reset in 3070 ms.
[2021-05-15 19:35:36] [INFO ] Flatten gal took : 64 ms
[2021-05-15 19:35:36] [INFO ] Flatten gal took : 57 ms
[2021-05-15 19:35:36] [INFO ] Time to serialize gal into /tmp/LTL2615052083757569306.gal : 29 ms
[2021-05-15 19:35:36] [INFO ] Time to serialize properties into /tmp/LTL12158747083050327022.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL2615052083757569306.gal, -t, CGAL, -LTL, /tmp/LTL12158747083050327022.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL2615052083757569306.gal -t CGAL -LTL /tmp/LTL12158747083050327022.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X((G("(p1999==0)"))||(G(("((p325==1)&&(p364==1))")U(("(p1162==1)")||(X(G("(p707!=1)")))))))))
Formula 0 simplified : !X(G"(p1999==0)" | G("((p325==1)&&(p364==1))" U ("(p1162==1)" | XG"(p707!=1)")))
Detected timeout of ITS tools.
[2021-05-15 19:35:51] [INFO ] Flatten gal took : 53 ms
[2021-05-15 19:35:51] [INFO ] Applying decomposition
[2021-05-15 19:35:51] [INFO ] Flatten gal took : 49 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph9244049295043770887.txt, -o, /tmp/graph9244049295043770887.bin, -w, /tmp/graph9244049295043770887.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph9244049295043770887.bin, -l, -1, -v, -w, /tmp/graph9244049295043770887.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-15 19:35:52] [INFO ] Decomposing Gal with order
[2021-05-15 19:35:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-15 19:35:52] [INFO ] Removed a total of 297 redundant transitions.
[2021-05-15 19:35:52] [INFO ] Flatten gal took : 138 ms
[2021-05-15 19:35:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 9 ms.
[2021-05-15 19:35:52] [INFO ] Time to serialize gal into /tmp/LTL6459520572329071420.gal : 16 ms
[2021-05-15 19:35:52] [INFO ] Time to serialize properties into /tmp/LTL3553430938435376542.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL6459520572329071420.gal, -t, CGAL, -LTL, /tmp/LTL3553430938435376542.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL6459520572329071420.gal -t CGAL -LTL /tmp/LTL3553430938435376542.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X((G("(i28.u627.p1999==0)"))||(G(("((i4.u106.p325==1)&&(i4.u117.p364==1))")U(("(i16.u368.p1162==1)")||(X(G("(i9.u225.p707!=1)")))))))))
Formula 0 simplified : !X(G"(i28.u627.p1999==0)" | G("((i4.u106.p325==1)&&(i4.u117.p364==1))" U ("(i16.u368.p1162==1)" | XG"(i9.u225.p707!=1)")))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin5933475415576046274
[2021-05-15 19:36:08] [INFO ] Built C files in 38ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5933475415576046274
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin5933475415576046274]
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin5933475415576046274] killed by timeout after 1 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin5933475415576046274] killed by timeout after 1 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Treatment of property ShieldIIPt-PT-030B-01 finished in 49388 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((((F(p0) U p1) U p2)||X(G(p2)))))], workingDir=/home/mcc/execution]
Support contains 4 out of 1780 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1780/1780 places, 1630/1630 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 1772 transition count 1622
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 1772 transition count 1622
Applied a total of 16 rules in 222 ms. Remains 1772 /1780 variables (removed 8) and now considering 1622/1630 (removed 8) transitions.
// Phase 1: matrix 1622 rows 1772 cols
[2021-05-15 19:36:10] [INFO ] Computed 271 place invariants in 5 ms
[2021-05-15 19:36:10] [INFO ] Implicit Places using invariants in 584 ms returned []
// Phase 1: matrix 1622 rows 1772 cols
[2021-05-15 19:36:10] [INFO ] Computed 271 place invariants in 5 ms
[2021-05-15 19:36:12] [INFO ] Implicit Places using invariants and state equation in 1282 ms returned []
Implicit Place search using SMT with State Equation took 1883 ms to find 0 implicit places.
// Phase 1: matrix 1622 rows 1772 cols
[2021-05-15 19:36:12] [INFO ] Computed 271 place invariants in 4 ms
[2021-05-15 19:36:13] [INFO ] Dead Transitions using invariants and state equation in 870 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1772/1780 places, 1622/1630 transitions.
Stuttering acceptance computed with spot in 202 ms :[(NOT p2), (NOT p2), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p0), (NOT p1)]
Running random walk in product with property : ShieldIIPt-PT-030B-02 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p2), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=1 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 5}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 6}], [{ cond=(AND p2 (NOT p1)), acceptance={} source=3 dest: 3}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=3 dest: 5}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=3 dest: 6}], [{ cond=(AND p2 (NOT p0)), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=4 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=6 dest: 5}, { cond=(NOT p1), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p2:(EQ s555 1), p1:(AND (EQ s925 1) (EQ s1006 1)), p0:(EQ s1646 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 165 reset in 536 ms.
Stack based approach found an accepted trace after 723 steps with 0 reset with depth 724 and stack size 724 in 6 ms.
FORMULA ShieldIIPt-PT-030B-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-030B-02 finished in 3766 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 1780 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1780/1780 places, 1630/1630 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 360 transitions
Trivial Post-agglo rules discarded 360 transitions
Performed 360 trivial Post agglomeration. Transition count delta: 360
Iterating post reduction 0 with 360 rules applied. Total rules applied 360 place count 1779 transition count 1269
Reduce places removed 360 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 361 rules applied. Total rules applied 721 place count 1419 transition count 1268
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 722 place count 1418 transition count 1268
Performed 235 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 235 Pre rules applied. Total rules applied 722 place count 1418 transition count 1033
Deduced a syphon composed of 235 places in 1 ms
Reduce places removed 235 places and 0 transitions.
Iterating global reduction 3 with 470 rules applied. Total rules applied 1192 place count 1183 transition count 1033
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 1199 place count 1176 transition count 1026
Iterating global reduction 3 with 7 rules applied. Total rules applied 1206 place count 1176 transition count 1026
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 1206 place count 1176 transition count 1020
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 1218 place count 1170 transition count 1020
Performed 507 Post agglomeration using F-continuation condition.Transition count delta: 507
Deduced a syphon composed of 507 places in 1 ms
Reduce places removed 507 places and 0 transitions.
Iterating global reduction 3 with 1014 rules applied. Total rules applied 2232 place count 663 transition count 513
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2233 place count 663 transition count 512
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2235 place count 662 transition count 511
Performed 88 Post agglomeration using F-continuation condition.Transition count delta: -57
Deduced a syphon composed of 88 places in 0 ms
Reduce places removed 88 places and 0 transitions.
Iterating global reduction 4 with 176 rules applied. Total rules applied 2411 place count 574 transition count 568
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 2412 place count 573 transition count 567
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 2414 place count 571 transition count 567
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 2414 place count 571 transition count 566
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 2416 place count 570 transition count 566
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 2417 place count 569 transition count 565
Applied a total of 2417 rules in 333 ms. Remains 569 /1780 variables (removed 1211) and now considering 565/1630 (removed 1065) transitions.
// Phase 1: matrix 565 rows 569 cols
[2021-05-15 19:36:14] [INFO ] Computed 269 place invariants in 1 ms
[2021-05-15 19:36:14] [INFO ] Implicit Places using invariants in 444 ms returned [558]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 445 ms to find 1 implicit places.
[2021-05-15 19:36:14] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 565 rows 568 cols
[2021-05-15 19:36:14] [INFO ] Computed 268 place invariants in 5 ms
[2021-05-15 19:36:14] [INFO ] Dead Transitions using invariants and state equation in 299 ms returned []
Starting structural reductions, iteration 1 : 568/1780 places, 565/1630 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 567 transition count 564
Applied a total of 2 rules in 20 ms. Remains 567 /568 variables (removed 1) and now considering 564/565 (removed 1) transitions.
// Phase 1: matrix 564 rows 567 cols
[2021-05-15 19:36:15] [INFO ] Computed 268 place invariants in 1 ms
[2021-05-15 19:36:15] [INFO ] Implicit Places using invariants in 328 ms returned []
// Phase 1: matrix 564 rows 567 cols
[2021-05-15 19:36:15] [INFO ] Computed 268 place invariants in 1 ms
[2021-05-15 19:36:15] [INFO ] Implicit Places using invariants and state equation in 551 ms returned []
Implicit Place search using SMT with State Equation took 888 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 567/1780 places, 564/1630 transitions.
Stuttering acceptance computed with spot in 59 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-030B-03 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s554 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA ShieldIIPt-PT-030B-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-030B-03 finished in 2086 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G(p0)&&X((p1&&X(F(p2))))))], workingDir=/home/mcc/execution]
Support contains 3 out of 1780 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1780/1780 places, 1630/1630 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 1771 transition count 1621
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 1771 transition count 1621
Applied a total of 18 rules in 209 ms. Remains 1771 /1780 variables (removed 9) and now considering 1621/1630 (removed 9) transitions.
// Phase 1: matrix 1621 rows 1771 cols
[2021-05-15 19:36:16] [INFO ] Computed 271 place invariants in 4 ms
[2021-05-15 19:36:16] [INFO ] Implicit Places using invariants in 502 ms returned []
// Phase 1: matrix 1621 rows 1771 cols
[2021-05-15 19:36:16] [INFO ] Computed 271 place invariants in 4 ms
[2021-05-15 19:36:17] [INFO ] Implicit Places using invariants and state equation in 1294 ms returned []
Implicit Place search using SMT with State Equation took 1805 ms to find 0 implicit places.
// Phase 1: matrix 1621 rows 1771 cols
[2021-05-15 19:36:17] [INFO ] Computed 271 place invariants in 4 ms
[2021-05-15 19:36:18] [INFO ] Dead Transitions using invariants and state equation in 858 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1771/1780 places, 1621/1630 transitions.
Stuttering acceptance computed with spot in 3076 ms :[(NOT p0), (OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p2) (NOT p1)), true]
Running random walk in product with property : ShieldIIPt-PT-030B-04 automaton TGBA [mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 4}], [{ cond=(AND p0 p2), acceptance={0} source=1 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 4}], [{ cond=(AND p0 p1), acceptance={} source=2 dest: 1}, { cond=(OR (NOT p0) (NOT p1)), acceptance={} source=2 dest: 4}], [{ cond=p0, acceptance={} source=3 dest: 2}, { cond=(NOT p0), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=3, aps=[p0:(EQ s1687 0), p2:(AND (EQ s105 1) (EQ s122 1)), p1:(NEQ s1687 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 815 steps with 0 reset in 5 ms.
FORMULA ShieldIIPt-PT-030B-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-030B-04 finished in 5973 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F((p0&&(p1 U ((p1&&G(p2))||G(p1)))))))], workingDir=/home/mcc/execution]
Support contains 3 out of 1780 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1780/1780 places, 1630/1630 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 359 transitions
Trivial Post-agglo rules discarded 359 transitions
Performed 359 trivial Post agglomeration. Transition count delta: 359
Iterating post reduction 0 with 359 rules applied. Total rules applied 359 place count 1779 transition count 1270
Reduce places removed 359 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 360 rules applied. Total rules applied 719 place count 1420 transition count 1269
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 720 place count 1419 transition count 1269
Performed 234 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 234 Pre rules applied. Total rules applied 720 place count 1419 transition count 1035
Deduced a syphon composed of 234 places in 1 ms
Reduce places removed 234 places and 0 transitions.
Iterating global reduction 3 with 468 rules applied. Total rules applied 1188 place count 1185 transition count 1035
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 1195 place count 1178 transition count 1028
Iterating global reduction 3 with 7 rules applied. Total rules applied 1202 place count 1178 transition count 1028
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 1202 place count 1178 transition count 1022
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 1214 place count 1172 transition count 1022
Performed 505 Post agglomeration using F-continuation condition.Transition count delta: 505
Deduced a syphon composed of 505 places in 1 ms
Reduce places removed 505 places and 0 transitions.
Iterating global reduction 3 with 1010 rules applied. Total rules applied 2224 place count 667 transition count 517
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2225 place count 667 transition count 516
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2227 place count 666 transition count 515
Performed 89 Post agglomeration using F-continuation condition.Transition count delta: -59
Deduced a syphon composed of 89 places in 0 ms
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 4 with 178 rules applied. Total rules applied 2405 place count 577 transition count 574
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 2406 place count 576 transition count 573
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 2408 place count 574 transition count 573
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 2408 place count 574 transition count 572
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 2410 place count 573 transition count 572
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 2411 place count 572 transition count 571
Applied a total of 2411 rules in 314 ms. Remains 572 /1780 variables (removed 1208) and now considering 571/1630 (removed 1059) transitions.
// Phase 1: matrix 571 rows 572 cols
[2021-05-15 19:36:22] [INFO ] Computed 269 place invariants in 1 ms
[2021-05-15 19:36:22] [INFO ] Implicit Places using invariants in 505 ms returned [561]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 506 ms to find 1 implicit places.
[2021-05-15 19:36:22] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 571 rows 571 cols
[2021-05-15 19:36:22] [INFO ] Computed 268 place invariants in 1 ms
[2021-05-15 19:36:23] [INFO ] Dead Transitions using invariants and state equation in 255 ms returned []
Starting structural reductions, iteration 1 : 571/1780 places, 571/1630 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 570 transition count 570
Applied a total of 2 rules in 35 ms. Remains 570 /571 variables (removed 1) and now considering 570/571 (removed 1) transitions.
// Phase 1: matrix 570 rows 570 cols
[2021-05-15 19:36:23] [INFO ] Computed 268 place invariants in 0 ms
[2021-05-15 19:36:23] [INFO ] Implicit Places using invariants in 466 ms returned []
// Phase 1: matrix 570 rows 570 cols
[2021-05-15 19:36:23] [INFO ] Computed 268 place invariants in 1 ms
[2021-05-15 19:36:23] [INFO ] State equation strengthened by 9 read => feed constraints.
[2021-05-15 19:36:24] [INFO ] Implicit Places using invariants and state equation in 543 ms returned []
Implicit Place search using SMT with State Equation took 1017 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 570/1780 places, 570/1630 transitions.
Stuttering acceptance computed with spot in 2719 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p2)), (NOT p1), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2)))]
Running random walk in product with property : ShieldIIPt-PT-030B-05 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=0 dest: 3}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={0, 1} source=1 dest: 1}, { cond=(AND p0 p2 p1), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p2) p1), acceptance={0} source=1 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0, 1} source=2 dest: 1}, { cond=(AND p2 p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={0} source=2 dest: 3}, { cond=(AND p2 (NOT p1)), acceptance={1} source=2 dest: 4}], [{ cond=(NOT p1), acceptance={0, 1} source=3 dest: 1}, { cond=(AND p2 p1), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={0} source=3 dest: 3}], [{ cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p1))), acceptance={0, 1} source=4 dest: 1}, { cond=(AND p0 p2 p1), acceptance={} source=4 dest: 2}, { cond=(AND p0 (NOT p2) p1), acceptance={0} source=4 dest: 3}, { cond=(OR (AND (NOT p0) p2) (AND p2 (NOT p1))), acceptance={1} source=4 dest: 4}]], initial=0, aps=[p0:(NEQ s176 1), p1:(NEQ s500 1), p2:(NEQ s227 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA ShieldIIPt-PT-030B-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-030B-05 finished in 4878 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G((G(p0)||(p1 U (p2||G(p1)))))))], workingDir=/home/mcc/execution]
Support contains 3 out of 1780 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1780/1780 places, 1630/1630 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 1772 transition count 1622
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 1772 transition count 1622
Applied a total of 16 rules in 227 ms. Remains 1772 /1780 variables (removed 8) and now considering 1622/1630 (removed 8) transitions.
// Phase 1: matrix 1622 rows 1772 cols
[2021-05-15 19:36:27] [INFO ] Computed 271 place invariants in 4 ms
[2021-05-15 19:36:27] [INFO ] Implicit Places using invariants in 465 ms returned []
// Phase 1: matrix 1622 rows 1772 cols
[2021-05-15 19:36:27] [INFO ] Computed 271 place invariants in 4 ms
[2021-05-15 19:36:28] [INFO ] Implicit Places using invariants and state equation in 1355 ms returned []
Implicit Place search using SMT with State Equation took 1839 ms to find 0 implicit places.
// Phase 1: matrix 1622 rows 1772 cols
[2021-05-15 19:36:28] [INFO ] Computed 271 place invariants in 4 ms
[2021-05-15 19:36:29] [INFO ] Dead Transitions using invariants and state equation in 881 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1772/1780 places, 1622/1630 transitions.
Stuttering acceptance computed with spot in 101 ms :[(AND (NOT p2) (NOT p1) (NOT p0)), true, (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-030B-06 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={} source=2 dest: 2}, { cond=p2, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=3 dest: 2}, { cond=(OR (AND p0 p1) p2), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 1}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=0, aps=[p2:(AND (NEQ s559 1) (NEQ s1282 1)), p1:(NEQ s1282 1), p0:(NEQ s952 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 5764 steps with 0 reset in 85 ms.
FORMULA ShieldIIPt-PT-030B-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-030B-06 finished in 3154 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 1780 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1780/1780 places, 1630/1630 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 362 transitions
Trivial Post-agglo rules discarded 362 transitions
Performed 362 trivial Post agglomeration. Transition count delta: 362
Iterating post reduction 0 with 362 rules applied. Total rules applied 362 place count 1779 transition count 1267
Reduce places removed 362 places and 0 transitions.
Iterating post reduction 1 with 362 rules applied. Total rules applied 724 place count 1417 transition count 1267
Performed 235 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 235 Pre rules applied. Total rules applied 724 place count 1417 transition count 1032
Deduced a syphon composed of 235 places in 1 ms
Reduce places removed 235 places and 0 transitions.
Iterating global reduction 2 with 470 rules applied. Total rules applied 1194 place count 1182 transition count 1032
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 1201 place count 1175 transition count 1025
Iterating global reduction 2 with 7 rules applied. Total rules applied 1208 place count 1175 transition count 1025
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 1208 place count 1175 transition count 1019
Deduced a syphon composed of 6 places in 2 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 1220 place count 1169 transition count 1019
Performed 505 Post agglomeration using F-continuation condition.Transition count delta: 505
Deduced a syphon composed of 505 places in 1 ms
Reduce places removed 505 places and 0 transitions.
Iterating global reduction 2 with 1010 rules applied. Total rules applied 2230 place count 664 transition count 514
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2231 place count 664 transition count 513
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2233 place count 663 transition count 512
Performed 89 Post agglomeration using F-continuation condition.Transition count delta: -59
Deduced a syphon composed of 89 places in 1 ms
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 3 with 178 rules applied. Total rules applied 2411 place count 574 transition count 571
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 2412 place count 573 transition count 570
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 2414 place count 571 transition count 570
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 2414 place count 571 transition count 569
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2416 place count 570 transition count 569
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 2417 place count 569 transition count 568
Applied a total of 2417 rules in 263 ms. Remains 569 /1780 variables (removed 1211) and now considering 568/1630 (removed 1062) transitions.
// Phase 1: matrix 568 rows 569 cols
[2021-05-15 19:36:30] [INFO ] Computed 269 place invariants in 1 ms
[2021-05-15 19:36:30] [INFO ] Implicit Places using invariants in 281 ms returned [558]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 291 ms to find 1 implicit places.
[2021-05-15 19:36:30] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 568 rows 568 cols
[2021-05-15 19:36:30] [INFO ] Computed 268 place invariants in 1 ms
[2021-05-15 19:36:30] [INFO ] Dead Transitions using invariants and state equation in 270 ms returned []
Starting structural reductions, iteration 1 : 568/1780 places, 568/1630 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 567 transition count 567
Applied a total of 2 rules in 18 ms. Remains 567 /568 variables (removed 1) and now considering 567/568 (removed 1) transitions.
// Phase 1: matrix 567 rows 567 cols
[2021-05-15 19:36:30] [INFO ] Computed 268 place invariants in 2 ms
[2021-05-15 19:36:31] [INFO ] Implicit Places using invariants in 279 ms returned []
// Phase 1: matrix 567 rows 567 cols
[2021-05-15 19:36:31] [INFO ] Computed 268 place invariants in 1 ms
[2021-05-15 19:36:31] [INFO ] Implicit Places using invariants and state equation in 478 ms returned []
Implicit Place search using SMT with State Equation took 759 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 567/1780 places, 567/1630 transitions.
Stuttering acceptance computed with spot in 22 ms :[(NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-030B-07 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s364 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA ShieldIIPt-PT-030B-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-030B-07 finished in 1649 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((F(p1)&&p0)))], workingDir=/home/mcc/execution]
Support contains 3 out of 1780 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1780/1780 places, 1630/1630 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 1771 transition count 1621
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 1771 transition count 1621
Applied a total of 18 rules in 217 ms. Remains 1771 /1780 variables (removed 9) and now considering 1621/1630 (removed 9) transitions.
// Phase 1: matrix 1621 rows 1771 cols
[2021-05-15 19:36:31] [INFO ] Computed 271 place invariants in 4 ms
[2021-05-15 19:36:32] [INFO ] Implicit Places using invariants in 461 ms returned []
// Phase 1: matrix 1621 rows 1771 cols
[2021-05-15 19:36:32] [INFO ] Computed 271 place invariants in 4 ms
[2021-05-15 19:36:33] [INFO ] Implicit Places using invariants and state equation in 1265 ms returned []
Implicit Place search using SMT with State Equation took 1727 ms to find 0 implicit places.
// Phase 1: matrix 1621 rows 1771 cols
[2021-05-15 19:36:33] [INFO ] Computed 271 place invariants in 3 ms
[2021-05-15 19:36:34] [INFO ] Dead Transitions using invariants and state equation in 856 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1771/1780 places, 1621/1630 transitions.
Stuttering acceptance computed with spot in 2619 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), true]
Running random walk in product with property : ShieldIIPt-PT-030B-09 automaton TGBA [mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=2, aps=[p1:(EQ s1113 1), p0:(AND (EQ s1092 1) (EQ s1094 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldIIPt-PT-030B-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-030B-09 finished in 5435 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((F(G(p0)) U G(p1))))], workingDir=/home/mcc/execution]
Support contains 2 out of 1780 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1780/1780 places, 1630/1630 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 1771 transition count 1621
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 1771 transition count 1621
Applied a total of 18 rules in 202 ms. Remains 1771 /1780 variables (removed 9) and now considering 1621/1630 (removed 9) transitions.
// Phase 1: matrix 1621 rows 1771 cols
[2021-05-15 19:36:37] [INFO ] Computed 271 place invariants in 3 ms
[2021-05-15 19:36:37] [INFO ] Implicit Places using invariants in 460 ms returned []
// Phase 1: matrix 1621 rows 1771 cols
[2021-05-15 19:36:37] [INFO ] Computed 271 place invariants in 4 ms
[2021-05-15 19:36:38] [INFO ] Implicit Places using invariants and state equation in 1258 ms returned []
Implicit Place search using SMT with State Equation took 1719 ms to find 0 implicit places.
// Phase 1: matrix 1621 rows 1771 cols
[2021-05-15 19:36:38] [INFO ] Computed 271 place invariants in 3 ms
[2021-05-15 19:36:39] [INFO ] Dead Transitions using invariants and state equation in 859 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1771/1780 places, 1621/1630 transitions.
Stuttering acceptance computed with spot in 72 ms :[(NOT p1), (NOT p1), (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-030B-10 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(NEQ s875 1), p0:(NEQ s1247 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 612 ms.
Product exploration explored 100000 steps with 0 reset in 882 ms.
Knowledge obtained : [p1, p0]
Stuttering acceptance computed with spot in 65 ms :[(NOT p1), (NOT p1), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 579 ms.
Product exploration explored 100000 steps with 0 reset in 740 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 71 ms :[(NOT p1), (NOT p1), (NOT p0)]
Support contains 2 out of 1771 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 1771/1771 places, 1621/1621 transitions.
Performed 357 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 357 rules applied. Total rules applied 357 place count 1771 transition count 1621
Performed 151 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 151 Pre rules applied. Total rules applied 357 place count 1771 transition count 1804
Deduced a syphon composed of 508 places in 2 ms
Iterating global reduction 1 with 151 rules applied. Total rules applied 508 place count 1771 transition count 1804
Performed 570 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1078 places in 2 ms
Iterating global reduction 1 with 570 rules applied. Total rules applied 1078 place count 1771 transition count 1805
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 1079 place count 1771 transition count 1804
Renaming transitions due to excessive name length > 1024 char.
Discarding 209 places :
Symmetric choice reduction at 2 with 209 rule applications. Total rules 1288 place count 1562 transition count 1595
Deduced a syphon composed of 869 places in 1 ms
Iterating global reduction 2 with 209 rules applied. Total rules applied 1497 place count 1562 transition count 1595
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 870 places in 1 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 1498 place count 1562 transition count 1595
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 1500 place count 1560 transition count 1593
Deduced a syphon composed of 868 places in 2 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 1502 place count 1560 transition count 1593
Performed 89 Post agglomeration using F-continuation condition.Transition count delta: -483
Deduced a syphon composed of 957 places in 1 ms
Iterating global reduction 2 with 89 rules applied. Total rules applied 1591 place count 1560 transition count 2076
Discarding 89 places :
Symmetric choice reduction at 2 with 89 rule applications. Total rules 1680 place count 1471 transition count 1898
Deduced a syphon composed of 868 places in 1 ms
Iterating global reduction 2 with 89 rules applied. Total rules applied 1769 place count 1471 transition count 1898
Deduced a syphon composed of 868 places in 1 ms
Applied a total of 1769 rules in 577 ms. Remains 1471 /1771 variables (removed 300) and now considering 1898/1621 (removed -277) transitions.
[2021-05-15 19:36:43] [INFO ] Redundant transitions in 27 ms returned []
// Phase 1: matrix 1898 rows 1471 cols
[2021-05-15 19:36:43] [INFO ] Computed 271 place invariants in 9 ms
[2021-05-15 19:36:44] [INFO ] Dead Transitions using invariants and state equation in 874 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1471/1771 places, 1898/1621 transitions.
Product exploration explored 100000 steps with 0 reset in 770 ms.
Stack based approach found an accepted trace after 6513 steps with 0 reset with depth 6514 and stack size 5971 in 51 ms.
FORMULA ShieldIIPt-PT-030B-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-030B-10 finished in 8271 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(X(X(X(F(p0)))))))], workingDir=/home/mcc/execution]
Support contains 2 out of 1780 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1780/1780 places, 1630/1630 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 1772 transition count 1622
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 1772 transition count 1622
Applied a total of 16 rules in 178 ms. Remains 1772 /1780 variables (removed 8) and now considering 1622/1630 (removed 8) transitions.
// Phase 1: matrix 1622 rows 1772 cols
[2021-05-15 19:36:45] [INFO ] Computed 271 place invariants in 4 ms
[2021-05-15 19:36:45] [INFO ] Implicit Places using invariants in 467 ms returned []
// Phase 1: matrix 1622 rows 1772 cols
[2021-05-15 19:36:45] [INFO ] Computed 271 place invariants in 4 ms
[2021-05-15 19:36:47] [INFO ] Implicit Places using invariants and state equation in 1303 ms returned []
Implicit Place search using SMT with State Equation took 1779 ms to find 0 implicit places.
// Phase 1: matrix 1622 rows 1772 cols
[2021-05-15 19:36:47] [INFO ] Computed 271 place invariants in 3 ms
[2021-05-15 19:36:48] [INFO ] Dead Transitions using invariants and state equation in 853 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1772/1780 places, 1622/1630 transitions.
Stuttering acceptance computed with spot in 3759 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-030B-11 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={} source=5 dest: 3}]], initial=4, aps=[p0:(OR (NEQ s1132 1) (NEQ s879 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 16666 reset in 463 ms.
Product exploration explored 100000 steps with 16666 reset in 475 ms.
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 125 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 16666 reset in 462 ms.
Product exploration explored 100000 steps with 16666 reset in 486 ms.
Applying partial POR strategy [true, false, false, false, false, false]
Stuttering acceptance computed with spot in 142 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 1772 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 1772/1772 places, 1622/1622 transitions.
Performed 358 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 358 rules applied. Total rules applied 358 place count 1772 transition count 1622
Performed 150 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 150 Pre rules applied. Total rules applied 358 place count 1772 transition count 1805
Deduced a syphon composed of 508 places in 2 ms
Iterating global reduction 1 with 150 rules applied. Total rules applied 508 place count 1772 transition count 1805
Performed 571 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1079 places in 1 ms
Iterating global reduction 1 with 571 rules applied. Total rules applied 1079 place count 1772 transition count 1805
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 1080 place count 1772 transition count 1804
Renaming transitions due to excessive name length > 1024 char.
Discarding 211 places :
Symmetric choice reduction at 2 with 211 rule applications. Total rules 1291 place count 1561 transition count 1593
Deduced a syphon composed of 868 places in 1 ms
Iterating global reduction 2 with 211 rules applied. Total rules applied 1502 place count 1561 transition count 1593
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 869 places in 1 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 1503 place count 1561 transition count 1593
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 1505 place count 1559 transition count 1591
Deduced a syphon composed of 867 places in 2 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 1507 place count 1559 transition count 1591
Performed 88 Post agglomeration using F-continuation condition.Transition count delta: -475
Deduced a syphon composed of 955 places in 2 ms
Iterating global reduction 2 with 88 rules applied. Total rules applied 1595 place count 1559 transition count 2066
Discarding 88 places :
Symmetric choice reduction at 2 with 88 rule applications. Total rules 1683 place count 1471 transition count 1890
Deduced a syphon composed of 867 places in 2 ms
Iterating global reduction 2 with 88 rules applied. Total rules applied 1771 place count 1471 transition count 1890
Deduced a syphon composed of 867 places in 1 ms
Applied a total of 1771 rules in 470 ms. Remains 1471 /1772 variables (removed 301) and now considering 1890/1622 (removed -268) transitions.
[2021-05-15 19:36:54] [INFO ] Redundant transitions in 26 ms returned []
// Phase 1: matrix 1890 rows 1471 cols
[2021-05-15 19:36:54] [INFO ] Computed 271 place invariants in 9 ms
[2021-05-15 19:36:55] [INFO ] Dead Transitions using invariants and state equation in 880 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1471/1772 places, 1890/1622 transitions.
Product exploration explored 100000 steps with 16666 reset in 2119 ms.
Product exploration explored 100000 steps with 16666 reset in 2137 ms.
[2021-05-15 19:36:59] [INFO ] Flatten gal took : 45 ms
[2021-05-15 19:36:59] [INFO ] Flatten gal took : 45 ms
[2021-05-15 19:36:59] [INFO ] Time to serialize gal into /tmp/LTL10117247088144505531.gal : 5 ms
[2021-05-15 19:37:05] [INFO ] Time to serialize properties into /tmp/LTL12161260929182148307.ltl : 5967 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL10117247088144505531.gal, -t, CGAL, -LTL, /tmp/LTL12161260929182148307.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL10117247088144505531.gal -t CGAL -LTL /tmp/LTL12161260929182148307.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(X(X(X(X(F("((p1338!=1)||(p1036!=1))"))))))))
Formula 0 simplified : !XXXXXF"((p1338!=1)||(p1036!=1))"
Detected timeout of ITS tools.
[2021-05-15 19:37:20] [INFO ] Flatten gal took : 43 ms
[2021-05-15 19:37:20] [INFO ] Applying decomposition
[2021-05-15 19:37:21] [INFO ] Flatten gal took : 42 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph17689421217638147962.txt, -o, /tmp/graph17689421217638147962.bin, -w, /tmp/graph17689421217638147962.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph17689421217638147962.bin, -l, -1, -v, -w, /tmp/graph17689421217638147962.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-15 19:37:21] [INFO ] Decomposing Gal with order
[2021-05-15 19:37:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-15 19:37:21] [INFO ] Removed a total of 300 redundant transitions.
[2021-05-15 19:37:21] [INFO ] Flatten gal took : 85 ms
[2021-05-15 19:37:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 6 ms.
[2021-05-15 19:37:22] [INFO ] Time to serialize gal into /tmp/LTL11549452287268643717.gal : 1358 ms
[2021-05-15 19:37:23] [INFO ] Time to serialize properties into /tmp/LTL16119343615893229786.ltl : 623 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL11549452287268643717.gal, -t, CGAL, -LTL, /tmp/LTL16119343615893229786.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL11549452287268643717.gal -t CGAL -LTL /tmp/LTL16119343615893229786.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(X(X(X(X(F("((i18.u424.p1338!=1)||(i14.u330.p1036!=1))"))))))))
Formula 0 simplified : !XXXXXF"((i18.u424.p1338!=1)||(i14.u330.p1036!=1))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin947395646406507605
[2021-05-15 19:37:38] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin947395646406507605
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin947395646406507605]
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin947395646406507605] killed by timeout after 1 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin947395646406507605] killed by timeout after 1 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Treatment of property ShieldIIPt-PT-030B-11 finished in 54073 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(p0))], workingDir=/home/mcc/execution]
Support contains 1 out of 1780 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1780/1780 places, 1630/1630 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 360 transitions
Trivial Post-agglo rules discarded 360 transitions
Performed 360 trivial Post agglomeration. Transition count delta: 360
Iterating post reduction 0 with 360 rules applied. Total rules applied 360 place count 1779 transition count 1269
Reduce places removed 360 places and 0 transitions.
Iterating post reduction 1 with 360 rules applied. Total rules applied 720 place count 1419 transition count 1269
Performed 235 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 235 Pre rules applied. Total rules applied 720 place count 1419 transition count 1034
Deduced a syphon composed of 235 places in 1 ms
Reduce places removed 235 places and 0 transitions.
Iterating global reduction 2 with 470 rules applied. Total rules applied 1190 place count 1184 transition count 1034
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 1196 place count 1178 transition count 1028
Iterating global reduction 2 with 6 rules applied. Total rules applied 1202 place count 1178 transition count 1028
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 1202 place count 1178 transition count 1022
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 1214 place count 1172 transition count 1022
Performed 508 Post agglomeration using F-continuation condition.Transition count delta: 508
Deduced a syphon composed of 508 places in 0 ms
Reduce places removed 508 places and 0 transitions.
Iterating global reduction 2 with 1016 rules applied. Total rules applied 2230 place count 664 transition count 514
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2231 place count 664 transition count 513
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2233 place count 663 transition count 512
Performed 89 Post agglomeration using F-continuation condition.Transition count delta: -59
Deduced a syphon composed of 89 places in 0 ms
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 3 with 178 rules applied. Total rules applied 2411 place count 574 transition count 571
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 2412 place count 573 transition count 570
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 2414 place count 571 transition count 570
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 2414 place count 571 transition count 569
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2416 place count 570 transition count 569
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 2417 place count 569 transition count 568
Applied a total of 2417 rules in 265 ms. Remains 569 /1780 variables (removed 1211) and now considering 568/1630 (removed 1062) transitions.
// Phase 1: matrix 568 rows 569 cols
[2021-05-15 19:37:40] [INFO ] Computed 269 place invariants in 1 ms
[2021-05-15 19:37:40] [INFO ] Implicit Places using invariants in 314 ms returned [558]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 315 ms to find 1 implicit places.
[2021-05-15 19:37:40] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 568 rows 568 cols
[2021-05-15 19:37:40] [INFO ] Computed 268 place invariants in 0 ms
[2021-05-15 19:37:40] [INFO ] Dead Transitions using invariants and state equation in 261 ms returned []
Starting structural reductions, iteration 1 : 568/1780 places, 568/1630 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 567 transition count 567
Applied a total of 2 rules in 13 ms. Remains 567 /568 variables (removed 1) and now considering 567/568 (removed 1) transitions.
// Phase 1: matrix 567 rows 567 cols
[2021-05-15 19:37:40] [INFO ] Computed 268 place invariants in 0 ms
[2021-05-15 19:37:41] [INFO ] Implicit Places using invariants in 283 ms returned []
// Phase 1: matrix 567 rows 567 cols
[2021-05-15 19:37:41] [INFO ] Computed 268 place invariants in 0 ms
[2021-05-15 19:37:41] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-15 19:37:41] [INFO ] Implicit Places using invariants and state equation in 555 ms returned []
Implicit Place search using SMT with State Equation took 848 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 567/1780 places, 567/1630 transitions.
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-030B-12 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s227 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA ShieldIIPt-PT-030B-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-030B-12 finished in 2393 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(G(p0))))], workingDir=/home/mcc/execution]
Support contains 3 out of 1780 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1780/1780 places, 1630/1630 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 1771 transition count 1621
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 1771 transition count 1621
Applied a total of 18 rules in 128 ms. Remains 1771 /1780 variables (removed 9) and now considering 1621/1630 (removed 9) transitions.
// Phase 1: matrix 1621 rows 1771 cols
[2021-05-15 19:37:41] [INFO ] Computed 271 place invariants in 4 ms
[2021-05-15 19:37:42] [INFO ] Implicit Places using invariants in 470 ms returned []
// Phase 1: matrix 1621 rows 1771 cols
[2021-05-15 19:37:42] [INFO ] Computed 271 place invariants in 4 ms
[2021-05-15 19:37:43] [INFO ] Implicit Places using invariants and state equation in 1331 ms returned []
Implicit Place search using SMT with State Equation took 1811 ms to find 0 implicit places.
// Phase 1: matrix 1621 rows 1771 cols
[2021-05-15 19:37:43] [INFO ] Computed 271 place invariants in 4 ms
[2021-05-15 19:37:44] [INFO ] Dead Transitions using invariants and state equation in 898 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1771/1780 places, 1621/1630 transitions.
Stuttering acceptance computed with spot in 83 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-030B-13 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(AND (EQ s1622 1) (EQ s1647 1) (EQ s1656 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA ShieldIIPt-PT-030B-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-030B-13 finished in 2936 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((p0&&X(X(((p1&&F((G(p2)||G(p3))))||G(p1)))))))], workingDir=/home/mcc/execution]
Support contains 3 out of 1780 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1780/1780 places, 1630/1630 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 1772 transition count 1622
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 1772 transition count 1622
Applied a total of 16 rules in 127 ms. Remains 1772 /1780 variables (removed 8) and now considering 1622/1630 (removed 8) transitions.
// Phase 1: matrix 1622 rows 1772 cols
[2021-05-15 19:37:44] [INFO ] Computed 271 place invariants in 4 ms
[2021-05-15 19:37:45] [INFO ] Implicit Places using invariants in 471 ms returned []
// Phase 1: matrix 1622 rows 1772 cols
[2021-05-15 19:37:45] [INFO ] Computed 271 place invariants in 3 ms
[2021-05-15 19:37:46] [INFO ] Implicit Places using invariants and state equation in 1280 ms returned []
Implicit Place search using SMT with State Equation took 1760 ms to find 0 implicit places.
// Phase 1: matrix 1622 rows 1772 cols
[2021-05-15 19:37:46] [INFO ] Computed 271 place invariants in 4 ms
[2021-05-15 19:37:47] [INFO ] Dead Transitions using invariants and state equation in 888 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1772/1780 places, 1622/1630 transitions.
Spot timed out Subprocess running CommandLine [args=[/home/mcc/BenchKit/bin//..//autfilt, --hoaf=tv, --small, -F, /tmp/curaut14647370445768620661.hoa], workingDir=/home/mcc/execution] killed by timeout after 10 SECONDS
Stuttering acceptance computed with spot in 11946 ms :[false, (NOT p1), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3)))]
Running random walk in product with property : ShieldIIPt-PT-030B-14 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0, 1, 2} source=0 dest: 0}, { cond=p0, acceptance={0, 1, 2} source=0 dest: 1}], [{ cond=p0, acceptance={0, 1, 2} source=1 dest: 2}, { cond=(NOT p0), acceptance={0, 1, 2} source=1 dest: 3}], [{ cond=(AND p0 (NOT p1)), acceptance={0, 1, 2} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1, 2} source=2 dest: 3}, { cond=(AND p0 p1), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1, 2} source=3 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0, 1, 2} source=3 dest: 1}, { cond=(AND p0 p1), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 5}], [{ cond=(AND p0 (NOT p1) (NOT p2) (NOT p3)), acceptance={0, 1, 2} source=4 dest: 4}, { cond=(AND p0 (NOT p1) (NOT p2) p3), acceptance={0, 2} source=4 dest: 4}, { cond=(AND p0 (NOT p1) p2 (NOT p3)), acceptance={1, 2} source=4 dest: 4}, { cond=(AND p0 (NOT p1) p2 p3), acceptance={2} source=4 dest: 4}, { cond=(AND p0 p1 (NOT p2) (NOT p3)), acceptance={0, 1} source=4 dest: 4}, { cond=(AND p0 p1 (NOT p2) p3), acceptance={0} source=4 dest: 4}, { cond=(AND p0 p1 p2 (NOT p3)), acceptance={1} source=4 dest: 4}, { cond=(AND p0 p1 p2 p3), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), acceptance={0, 1, 2} source=4 dest: 5}, { cond=(AND (NOT p0) (NOT p1) (NOT p2) p3), acceptance={0, 2} source=4 dest: 5}, { cond=(AND (NOT p0) (NOT p1) p2 (NOT p3)), acceptance={1, 2} source=4 dest: 5}, { cond=(AND (NOT p0) (NOT p1) p2 p3), acceptance={2} source=4 dest: 5}, { cond=(AND (NOT p0) p1 (NOT p2) (NOT p3)), acceptance={0, 1} source=4 dest: 5}, { cond=(AND (NOT p0) p1 (NOT p2) p3), acceptance={0} source=4 dest: 5}, { cond=(AND (NOT p0) p1 p2 (NOT p3)), acceptance={1} source=4 dest: 5}, { cond=(AND (NOT p0) p1 p2 p3), acceptance={} source=4 dest: 5}], [{ cond=(AND p0 p1 (NOT p2) (NOT p3)), acceptance={0, 1} source=5 dest: 4}, { cond=(AND p0 p1 (NOT p2) p3), acceptance={0} source=5 dest: 4}, { cond=(AND p0 p1 p2 (NOT p3)), acceptance={1} source=5 dest: 4}, { cond=(AND p0 p1 p2 p3), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p0) p1 (NOT p2) (NOT p3)), acceptance={0, 1} source=5 dest: 5}, { cond=(AND (NOT p0) p1 (NOT p2) p3), acceptance={0} source=5 dest: 5}, { cond=(AND (NOT p0) p1 p2 (NOT p3)), acceptance={1} source=5 dest: 5}, { cond=(AND (NOT p0) p1 p2 p3), acceptance={} source=5 dest: 5}, { cond=(AND p0 (NOT p1) (NOT p2) (NOT p3)), acceptance={0, 1, 2} source=5 dest: 6}, { cond=(AND p0 (NOT p1) (NOT p2) p3), acceptance={0, 2} source=5 dest: 6}, { cond=(AND p0 (NOT p1) p2 (NOT p3)), acceptance={1, 2} source=5 dest: 6}, { cond=(AND p0 (NOT p1) p2 p3), acceptance={2} source=5 dest: 6}, { cond=(AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), acceptance={0, 1, 2} source=5 dest: 7}, { cond=(AND (NOT p0) (NOT p1) (NOT p2) p3), acceptance={0, 2} source=5 dest: 7}, { cond=(AND (NOT p0) (NOT p1) p2 (NOT p3)), acceptance={1, 2} source=5 dest: 7}, { cond=(AND (NOT p0) (NOT p1) p2 p3), acceptance={2} source=5 dest: 7}], [{ cond=(AND p0 (NOT p2) (NOT p3)), acceptance={0, 1, 2} source=6 dest: 4}, { cond=(AND p0 (NOT p2) p3), acceptance={0, 2} source=6 dest: 4}, { cond=(AND p0 p2 (NOT p3)), acceptance={1, 2} source=6 dest: 4}, { cond=(AND p0 p2 p3), acceptance={2} source=6 dest: 4}, { cond=(AND (NOT p0) (NOT p2) (NOT p3)), acceptance={0, 1, 2} source=6 dest: 5}, { cond=(AND (NOT p0) (NOT p2) p3), acceptance={0, 2} source=6 dest: 5}, { cond=(AND (NOT p0) p2 (NOT p3)), acceptance={1, 2} source=6 dest: 5}, { cond=(AND (NOT p0) p2 p3), acceptance={2} source=6 dest: 5}], [{ cond=(AND p0 (NOT p2) (NOT p3)), acceptance={0, 1, 2} source=7 dest: 6}, { cond=(AND p0 (NOT p2) p3), acceptance={0, 2} source=7 dest: 6}, { cond=(AND p0 p2 (NOT p3)), acceptance={1, 2} source=7 dest: 6}, { cond=(AND p0 p2 p3), acceptance={2} source=7 dest: 6}, { cond=(AND (NOT p0) (NOT p2) (NOT p3)), acceptance={0, 1, 2} source=7 dest: 7}, { cond=(AND (NOT p0) (NOT p2) p3), acceptance={0, 2} source=7 dest: 7}, { cond=(AND (NOT p0) p2 (NOT p3)), acceptance={1, 2} source=7 dest: 7}, { cond=(AND (NOT p0) p2 p3), acceptance={2} source=7 dest: 7}]], initial=0, aps=[p0:(EQ s444 0), p1:(NEQ s1640 0), p2:(NEQ s599 1), p3:(NEQ s1640 1)], nbAcceptance=3, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 728 ms.
Product exploration explored 100000 steps with 0 reset in 908 ms.
Knowledge obtained : [p0, (NOT p1), p2, p3]
Stuttering acceptance computed with spot in 236 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3)))]
Product exploration explored 100000 steps with 0 reset in 739 ms.
Product exploration explored 100000 steps with 0 reset in 928 ms.
[2021-05-15 19:38:03] [INFO ] Flatten gal took : 40 ms
[2021-05-15 19:38:03] [INFO ] Flatten gal took : 57 ms
[2021-05-15 19:38:03] [INFO ] Time to serialize gal into /tmp/LTL16016792400789196538.gal : 5 ms
[2021-05-15 19:38:03] [INFO ] Time to serialize properties into /tmp/LTL7920736529727884525.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL16016792400789196538.gal, -t, CGAL, -LTL, /tmp/LTL7920736529727884525.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL16016792400789196538.gal -t CGAL -LTL /tmp/LTL7920736529727884525.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((F(("(p521==0)")&&(X(X((("(p1941!=0)")&&(F((G("(p703!=1)"))||(G("(p1941!=1)")))))||(G("(p1941!=0)"))))))))
Formula 0 simplified : !F("(p521==0)" & XX(("(p1941!=0)" & F(G"(p703!=1)" | G"(p1941!=1)")) | G"(p1941!=0)"))
Detected timeout of ITS tools.
[2021-05-15 19:38:18] [INFO ] Flatten gal took : 45 ms
[2021-05-15 19:38:18] [INFO ] Applying decomposition
[2021-05-15 19:38:18] [INFO ] Flatten gal took : 38 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph9666285629611569786.txt, -o, /tmp/graph9666285629611569786.bin, -w, /tmp/graph9666285629611569786.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph9666285629611569786.bin, -l, -1, -v, -w, /tmp/graph9666285629611569786.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-15 19:38:20] [INFO ] Decomposing Gal with order
[2021-05-15 19:38:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-15 19:38:20] [INFO ] Removed a total of 300 redundant transitions.
[2021-05-15 19:38:20] [INFO ] Flatten gal took : 76 ms
[2021-05-15 19:38:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 6 ms.
[2021-05-15 19:38:20] [INFO ] Time to serialize gal into /tmp/LTL874743024492173588.gal : 32 ms
[2021-05-15 19:38:20] [INFO ] Time to serialize properties into /tmp/LTL1042331910682546933.ltl : 2 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL874743024492173588.gal, -t, CGAL, -LTL, /tmp/LTL1042331910682546933.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL874743024492173588.gal -t CGAL -LTL /tmp/LTL1042331910682546933.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((F(("(i7.u165.p521==0)")&&(X(X((("(i27.i0.i1.u607.p1941!=0)")&&(F((G("(i9.u223.p703!=1)"))||(G("(i27.i0.i1.u607.p1941!=1)")))))||(G("(i27.i0.i1.u607.p1941!=0)"))))))))
Formula 0 simplified : !F("(i7.u165.p521==0)" & XX(("(i27.i0.i1.u607.p1941!=0)" & F(G"(i9.u223.p703!=1)" | G"(i27.i0.i1.u607.p1941!=1)")) | G"(i27.i0.i1.u607.p1941!=0)"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin1930290395945999938
[2021-05-15 19:38:35] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1930290395945999938
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin1930290395945999938]
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin1930290395945999938] killed by timeout after 1 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin1930290395945999938] killed by timeout after 1 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Treatment of property ShieldIIPt-PT-030B-14 finished in 51869 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F((p0||G(F(p1))))))], workingDir=/home/mcc/execution]
Support contains 2 out of 1780 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1780/1780 places, 1630/1630 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 360 transitions
Trivial Post-agglo rules discarded 360 transitions
Performed 360 trivial Post agglomeration. Transition count delta: 360
Iterating post reduction 0 with 360 rules applied. Total rules applied 360 place count 1779 transition count 1269
Reduce places removed 360 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 361 rules applied. Total rules applied 721 place count 1419 transition count 1268
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 722 place count 1418 transition count 1268
Performed 235 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 235 Pre rules applied. Total rules applied 722 place count 1418 transition count 1033
Deduced a syphon composed of 235 places in 1 ms
Reduce places removed 235 places and 0 transitions.
Iterating global reduction 3 with 470 rules applied. Total rules applied 1192 place count 1183 transition count 1033
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 1199 place count 1176 transition count 1026
Iterating global reduction 3 with 7 rules applied. Total rules applied 1206 place count 1176 transition count 1026
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 1206 place count 1176 transition count 1020
Deduced a syphon composed of 6 places in 2 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 1218 place count 1170 transition count 1020
Performed 504 Post agglomeration using F-continuation condition.Transition count delta: 504
Deduced a syphon composed of 504 places in 0 ms
Reduce places removed 504 places and 0 transitions.
Iterating global reduction 3 with 1008 rules applied. Total rules applied 2226 place count 666 transition count 516
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2227 place count 666 transition count 515
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2229 place count 665 transition count 514
Performed 89 Post agglomeration using F-continuation condition.Transition count delta: -59
Deduced a syphon composed of 89 places in 1 ms
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 4 with 178 rules applied. Total rules applied 2407 place count 576 transition count 573
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 2408 place count 576 transition count 573
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 2409 place count 575 transition count 572
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 2411 place count 573 transition count 572
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 2411 place count 573 transition count 571
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 2413 place count 572 transition count 571
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 2414 place count 571 transition count 570
Applied a total of 2414 rules in 266 ms. Remains 571 /1780 variables (removed 1209) and now considering 570/1630 (removed 1060) transitions.
// Phase 1: matrix 570 rows 571 cols
[2021-05-15 19:38:43] [INFO ] Computed 269 place invariants in 1 ms
[2021-05-15 19:38:43] [INFO ] Implicit Places using invariants in 292 ms returned [560]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 294 ms to find 1 implicit places.
[2021-05-15 19:38:43] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 570 rows 570 cols
[2021-05-15 19:38:43] [INFO ] Computed 268 place invariants in 1 ms
[2021-05-15 19:38:43] [INFO ] Dead Transitions using invariants and state equation in 274 ms returned []
Starting structural reductions, iteration 1 : 570/1780 places, 570/1630 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 569 transition count 569
Applied a total of 2 rules in 21 ms. Remains 569 /570 variables (removed 1) and now considering 569/570 (removed 1) transitions.
// Phase 1: matrix 569 rows 569 cols
[2021-05-15 19:38:43] [INFO ] Computed 268 place invariants in 12 ms
[2021-05-15 19:38:43] [INFO ] Implicit Places using invariants in 296 ms returned []
// Phase 1: matrix 569 rows 569 cols
[2021-05-15 19:38:43] [INFO ] Computed 268 place invariants in 1 ms
[2021-05-15 19:38:44] [INFO ] State equation strengthened by 45 read => feed constraints.
[2021-05-15 19:38:44] [INFO ] Implicit Places using invariants and state equation in 676 ms returned []
Implicit Place search using SMT with State Equation took 973 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 569/1780 places, 569/1630 transitions.
Stuttering acceptance computed with spot in 45 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldIIPt-PT-030B-15 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s79 1), p1:(AND (NEQ s304 1) (NEQ s79 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 66209 steps with 1 reset in 438 ms.
FORMULA ShieldIIPt-PT-030B-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-030B-15 finished in 8514 ms.
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin1012986832523818359
[2021-05-15 19:38:45] [INFO ] Too many transitions (1630) to apply POR reductions. Disabling POR matrices.
[2021-05-15 19:38:45] [INFO ] Applying decomposition
[2021-05-15 19:38:45] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1012986832523818359
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin1012986832523818359]
[2021-05-15 19:38:45] [INFO ] Flatten gal took : 36 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph538022767249961385.txt, -o, /tmp/graph538022767249961385.bin, -w, /tmp/graph538022767249961385.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph538022767249961385.bin, -l, -1, -v, -w, /tmp/graph538022767249961385.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-15 19:38:45] [INFO ] Decomposing Gal with order
[2021-05-15 19:38:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-15 19:38:45] [INFO ] Removed a total of 290 redundant transitions.
[2021-05-15 19:38:45] [INFO ] Flatten gal took : 115 ms
[2021-05-15 19:38:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 21 ms.
[2021-05-15 19:38:45] [INFO ] Time to serialize gal into /tmp/LTLFireability10499421933814360815.gal : 24 ms
[2021-05-15 19:38:45] [INFO ] Time to serialize properties into /tmp/LTLFireability14813932442041975864.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTLFireability10499421933814360815.gal, -t, CGAL, -LTL, /tmp/LTLFireability14813932442041975864.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireability10499421933814360815.gal -t CGAL -LTL /tmp/LTLFireability14813932442041975864.ltl -c -stutter-deadlock
Read 3 LTL properties
Checking formula 0 : !((X((G("(i28.i3.u631.p1999==0)"))||(G(("((i4.i2.u108.p325==1)&&(i4.i5.u118.p364==1))")U(("(i16.i4.u369.p1162==1)")||(X(G("(i9.i5.u227.p707!=1)")))))))))
Formula 0 simplified : !X(G"(i28.i3.u631.p1999==0)" | G("((i4.i2.u108.p325==1)&&(i4.i5.u118.p364==1))" U ("(i16.i4.u369.p1162==1)" | XG"(i9.i5.u227.p707!=1)")))
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin1012986832523818359] killed by timeout after 24 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin1012986832523818359] killed by timeout after 24 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Detected timeout of ITS tools.
[2021-05-15 20:01:34] [INFO ] Applying decomposition
[2021-05-15 20:01:34] [INFO ] Flatten gal took : 42 ms
[2021-05-15 20:01:34] [INFO ] Decomposing Gal with order
[2021-05-15 20:01:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-15 20:01:34] [INFO ] Removed a total of 88 redundant transitions.
[2021-05-15 20:01:34] [INFO ] Flatten gal took : 102 ms
[2021-05-15 20:01:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 14 ms.
[2021-05-15 20:01:34] [INFO ] Time to serialize gal into /tmp/LTLFireability13278855211130015389.gal : 10 ms
[2021-05-15 20:01:34] [INFO ] Time to serialize properties into /tmp/LTLFireability10763435898003778800.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTLFireability13278855211130015389.gal, -t, CGAL, -LTL, /tmp/LTLFireability10763435898003778800.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireability13278855211130015389.gal -t CGAL -LTL /tmp/LTLFireability10763435898003778800.ltl -c -stutter-deadlock
Read 3 LTL properties
Checking formula 0 : !((X((G("(i0.i1.i0.i0.i0.u520.p1999==0)"))||(G(("((i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.i0.i0.i0.i0.i1.u109.p325==1)&&(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.u114.p364==1))")U(("(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.i0.u316.p1162==1)")||(X(G("(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.u199.p707!=1)")))))))))
Formula 0 simplified : !X(G"(i0.i1.i0.i0.i0.u520.p1999==0)" | G("((i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.i0.i0.i0.i0.i1.u109.p325==1)&&(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.u114.p364==1))" U ("(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.i0.u316.p1162==1)" | XG"(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.u199.p707!=1)")))
Detected timeout of ITS tools.
[2021-05-15 20:24:23] [INFO ] Flatten gal took : 175 ms
[2021-05-15 20:24:24] [INFO ] Input system was already deterministic with 1630 transitions.
[2021-05-15 20:24:24] [INFO ] Transformed 1780 places.
[2021-05-15 20:24:24] [INFO ] Transformed 1630 transitions.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar, /home/mcc/execution/gspn], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2, /home/mcc/execution/gspn, -META, -varord-only], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2021-05-15 20:24:25] [INFO ] Time to serialize gal into /tmp/LTLFireability11538172806362705206.gal : 14 ms
[2021-05-15 20:24:25] [INFO ] Time to serialize properties into /tmp/LTLFireability3063954373548200149.ltl : 2 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTLFireability11538172806362705206.gal, -t, CGAL, -LTL, /tmp/LTLFireability3063954373548200149.ltl, -c, -stutter-deadlock, --load-order, /home/mcc/execution/model.ord, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireability11538172806362705206.gal -t CGAL -LTL /tmp/LTLFireability3063954373548200149.ltl -c -stutter-deadlock --load-order /home/mcc/execution/model.ord --gen-order FOLLOW
Read 3 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((X((G("(p1999==0)"))||(G(("((p325==1)&&(p364==1))")U(("(p1162==1)")||(X(G("(p707!=1)")))))))))
Formula 0 simplified : !X(G"(p1999==0)" | G("((p325==1)&&(p364==1))" U ("(p1162==1)" | XG"(p707!=1)")))

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination LTLFireability -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=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

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="ShieldIIPt-PT-030B"
export BK_EXAMINATION="LTLFireability"
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 ShieldIIPt-PT-030B, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r216-tall-162098205100461"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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