Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 356K
-rw-r--r-- 1 mcc users 9.3K Apr 30 04:02 CTLCardinality.txt
-rw-r--r-- 1 mcc users 93K Apr 30 04:02 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Apr 30 03:35 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K Apr 30 03:35 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.4K May 9 08:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 9 08:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 9 08:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 08:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 9 08:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 9 08:30 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:34 equiv_pt
-rw-r--r-- 1 mcc users 7 May 10 09:34 instance
-rw-r--r-- 1 mcc users 5 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 92K May 10 09:34 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

FORMULA_NAME QuasiLiveness

=== Now, execution of the tool begins

BK_START 1652812882543

Running Version 202205111006
[2022-05-17 18:41:23] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -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, 1800]
[2022-05-17 18:41:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-17 18:41:23] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2022-05-17 18:41:24] [WARNING] Using fallBack plugin, rng conformance not checked
[2022-05-17 18:41:24] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 609 ms
[2022-05-17 18:41:24] [INFO ] Imported 48 HL places and 38 HL transitions for a total of 494 PT places and 11822.0 transition bindings in 22 ms.
[2022-05-17 18:41:24] [INFO ] Unfolded HLPN to a Petri net with 494 places and 11780 transitions 111159 arcs in 187 ms.
[2022-05-17 18:41:24] [INFO ] Unfolded 38 HLPN properties in 3 ms.
Initial state reduction rules removed 2 formulas.
[2022-05-17 18:41:24] [INFO ] Reduced 9285 identical enabling conditions.
[2022-05-17 18:41:24] [INFO ] Reduced 780 identical enabling conditions.
[2022-05-17 18:41:24] [INFO ] Reduced 45 identical enabling conditions.
Deduced a syphon composed of 20 places in 32 ms
Reduce places removed 20 places and 20 transitions.
Ensure Unique test removed 10110 transitions
Reduce redundant transitions removed 10110 transitions.
Incomplete random walk after 10000 steps, including 559 resets, run finished after 1237 ms. (steps per millisecond=8 ) properties (out of 36) seen :6
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1000 steps, including 9 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 11 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1000 steps, including 10 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 97 ms. (steps per millisecond=10 ) properties (out of 30) seen :8
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 22) seen :14
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
[2022-05-17 18:41:26] [INFO ] Flow matrix only has 1641 transitions (discarded 9 similar events)
// Phase 1: matrix 1641 rows 474 cols
[2022-05-17 18:41:26] [INFO ] Computed 72 place invariants in 75 ms
[2022-05-17 18:41:27] [INFO ] [Real]Absence check using 65 positive place invariants in 25 ms returned sat
[2022-05-17 18:41:27] [INFO ] [Real]Absence check using 65 positive and 7 generalized place invariants in 13 ms returned sat
[2022-05-17 18:41:28] [INFO ] After 713ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:6
[2022-05-17 18:41:28] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-17 18:41:28] [INFO ] After 124ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :2 real:6
[2022-05-17 18:41:29] [INFO ] After 341ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :2 real:6
Attempting to minimize the solution found.
Minimization took 115 ms.
[2022-05-17 18:41:29] [INFO ] After 1567ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :2 real:6
[2022-05-17 18:41:29] [INFO ] [Nat]Absence check using 65 positive place invariants in 23 ms returned sat
[2022-05-17 18:41:29] [INFO ] [Nat]Absence check using 65 positive and 7 generalized place invariants in 11 ms returned sat
[2022-05-17 18:41:30] [INFO ] After 1345ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2022-05-17 18:41:31] [INFO ] After 985ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2022-05-17 18:41:36] [INFO ] Deduced a trap composed of 131 places in 350 ms of which 1 ms to minimize.
[2022-05-17 18:41:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 487 ms
[2022-05-17 18:41:37] [INFO ] After 6366ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 642 ms.
[2022-05-17 18:41:37] [INFO ] After 8630ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Parikh walk visited 0 properties in 652 ms.
Support contains 41 out of 474 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 474/474 places, 1650/1650 transitions.
Ensure Unique test removed 10 places
Drop transitions removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 35 rules applied. Total rules applied 35 place count 464 transition count 1625
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 1 with 25 rules applied. Total rules applied 60 place count 439 transition count 1625
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 23 Pre rules applied. Total rules applied 60 place count 439 transition count 1602
Deduced a syphon composed of 23 places in 1 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 2 with 46 rules applied. Total rules applied 106 place count 416 transition count 1602
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 107 place count 415 transition count 1601
Iterating global reduction 2 with 1 rules applied. Total rules applied 108 place count 415 transition count 1601
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 112 place count 413 transition count 1599
Applied a total of 112 rules in 220 ms. Remains 413 /474 variables (removed 61) and now considering 1599/1650 (removed 51) transitions.
[2022-05-17 18:41:38] [INFO ] Flow matrix only has 1590 transitions (discarded 9 similar events)
// Phase 1: matrix 1590 rows 413 cols
[2022-05-17 18:41:38] [INFO ] Computed 62 place invariants in 57 ms
[2022-05-17 18:41:39] [INFO ] Dead Transitions using invariants and state equation in 630 ms found 615 transitions.
Found 615 dead transitions using SMT.
Drop transitions removed 615 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 615 transitions.
Starting structural reductions in SAFETY mode, iteration 1 : 413/474 places, 984/1650 transitions.
Applied a total of 0 rules in 31 ms. Remains 413 /413 variables (removed 0) and now considering 984/984 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 413/474 places, 984/1650 transitions.
Incomplete random walk after 1000000 steps, including 65260 resets, run finished after 6706 ms. (steps per millisecond=149 ) properties (out of 8) seen :7
Incomplete Best-First random walk after 1000000 steps, including 9496 resets, run finished after 1436 ms. (steps per millisecond=696 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2022-05-17 18:41:47] [INFO ] Flow matrix only has 975 transitions (discarded 9 similar events)
// Phase 1: matrix 975 rows 413 cols
[2022-05-17 18:41:47] [INFO ] Computed 62 place invariants in 26 ms
[2022-05-17 18:41:47] [INFO ] [Real]Absence check using 55 positive place invariants in 10 ms returned sat
[2022-05-17 18:41:47] [INFO ] [Real]Absence check using 55 positive and 7 generalized place invariants in 8 ms returned sat
[2022-05-17 18:41:47] [INFO ] After 91ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 18:41:47] [INFO ] [Nat]Absence check using 55 positive place invariants in 11 ms returned sat
[2022-05-17 18:41:47] [INFO ] [Nat]Absence check using 55 positive and 7 generalized place invariants in 11 ms returned sat
[2022-05-17 18:41:48] [INFO ] After 297ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 18:41:48] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-17 18:41:48] [INFO ] After 67ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 18:41:48] [INFO ] Deduced a trap composed of 176 places in 220 ms of which 2 ms to minimize.
[2022-05-17 18:41:48] [INFO ] Deduced a trap composed of 168 places in 243 ms of which 1 ms to minimize.
[2022-05-17 18:41:48] [INFO ] Deduced a trap composed of 176 places in 232 ms of which 0 ms to minimize.
[2022-05-17 18:41:49] [INFO ] Deduced a trap composed of 164 places in 216 ms of which 1 ms to minimize.
[2022-05-17 18:41:49] [INFO ] Deduced a trap composed of 168 places in 225 ms of which 0 ms to minimize.
[2022-05-17 18:41:49] [INFO ] Deduced a trap composed of 166 places in 211 ms of which 1 ms to minimize.
[2022-05-17 18:41:49] [INFO ] Deduced a trap composed of 172 places in 216 ms of which 1 ms to minimize.
[2022-05-17 18:41:50] [INFO ] Deduced a trap composed of 162 places in 212 ms of which 1 ms to minimize.
[2022-05-17 18:41:50] [INFO ] Deduced a trap composed of 184 places in 221 ms of which 1 ms to minimize.
[2022-05-17 18:41:50] [INFO ] Deduced a trap composed of 180 places in 209 ms of which 1 ms to minimize.
[2022-05-17 18:41:50] [INFO ] Deduced a trap composed of 162 places in 209 ms of which 0 ms to minimize.
[2022-05-17 18:41:51] [INFO ] Deduced a trap composed of 166 places in 211 ms of which 1 ms to minimize.
[2022-05-17 18:41:51] [INFO ] Deduced a trap composed of 166 places in 217 ms of which 0 ms to minimize.
[2022-05-17 18:41:51] [INFO ] Deduced a trap composed of 180 places in 224 ms of which 0 ms to minimize.
[2022-05-17 18:41:51] [INFO ] Deduced a trap composed of 168 places in 204 ms of which 1 ms to minimize.
[2022-05-17 18:41:52] [INFO ] Deduced a trap composed of 178 places in 206 ms of which 0 ms to minimize.
[2022-05-17 18:41:53] [INFO ] Deduced a trap composed of 178 places in 214 ms of which 0 ms to minimize.
[2022-05-17 18:41:54] [INFO ] Deduced a trap composed of 172 places in 213 ms of which 0 ms to minimize.
[2022-05-17 18:41:54] [INFO ] Deduced a trap composed of 164 places in 209 ms of which 1 ms to minimize.
[2022-05-17 18:41:55] [INFO ] Deduced a trap composed of 172 places in 215 ms of which 1 ms to minimize.
[2022-05-17 18:41:55] [INFO ] Deduced a trap composed of 162 places in 205 ms of which 1 ms to minimize.
[2022-05-17 18:41:56] [INFO ] Deduced a trap composed of 166 places in 207 ms of which 1 ms to minimize.
[2022-05-17 18:41:56] [INFO ] Deduced a trap composed of 170 places in 211 ms of which 0 ms to minimize.
[2022-05-17 18:41:56] [INFO ] Deduced a trap composed of 164 places in 203 ms of which 1 ms to minimize.
[2022-05-17 18:41:56] [INFO ] Deduced a trap composed of 162 places in 199 ms of which 1 ms to minimize.
[2022-05-17 18:41:57] [INFO ] Deduced a trap composed of 168 places in 202 ms of which 0 ms to minimize.
[2022-05-17 18:41:57] [INFO ] Deduced a trap composed of 166 places in 204 ms of which 1 ms to minimize.
[2022-05-17 18:41:57] [INFO ] Deduced a trap composed of 162 places in 214 ms of which 1 ms to minimize.
[2022-05-17 18:41:58] [INFO ] Deduced a trap composed of 166 places in 201 ms of which 0 ms to minimize.
[2022-05-17 18:41:58] [INFO ] Deduced a trap composed of 170 places in 200 ms of which 1 ms to minimize.
[2022-05-17 18:41:58] [INFO ] Deduced a trap composed of 160 places in 207 ms of which 1 ms to minimize.
[2022-05-17 18:41:58] [INFO ] Deduced a trap composed of 166 places in 209 ms of which 3 ms to minimize.
[2022-05-17 18:41:59] [INFO ] Deduced a trap composed of 160 places in 204 ms of which 1 ms to minimize.
[2022-05-17 18:41:59] [INFO ] Deduced a trap composed of 160 places in 204 ms of which 0 ms to minimize.
[2022-05-17 18:41:59] [INFO ] Deduced a trap composed of 166 places in 201 ms of which 0 ms to minimize.
[2022-05-17 18:41:59] [INFO ] Deduced a trap composed of 166 places in 205 ms of which 0 ms to minimize.
[2022-05-17 18:42:00] [INFO ] Deduced a trap composed of 160 places in 201 ms of which 1 ms to minimize.
[2022-05-17 18:42:00] [INFO ] Deduced a trap composed of 170 places in 203 ms of which 0 ms to minimize.
[2022-05-17 18:42:00] [INFO ] Deduced a trap composed of 168 places in 201 ms of which 0 ms to minimize.
[2022-05-17 18:42:01] [INFO ] Deduced a trap composed of 170 places in 199 ms of which 0 ms to minimize.
[2022-05-17 18:42:01] [INFO ] Deduced a trap composed of 160 places in 209 ms of which 1 ms to minimize.
[2022-05-17 18:42:01] [INFO ] Deduced a trap composed of 160 places in 200 ms of which 1 ms to minimize.
[2022-05-17 18:42:01] [INFO ] Deduced a trap composed of 168 places in 202 ms of which 1 ms to minimize.
[2022-05-17 18:42:02] [INFO ] Deduced a trap composed of 158 places in 194 ms of which 0 ms to minimize.
[2022-05-17 18:42:02] [INFO ] Deduced a trap composed of 160 places in 200 ms of which 0 ms to minimize.
[2022-05-17 18:42:02] [INFO ] Deduced a trap composed of 164 places in 201 ms of which 0 ms to minimize.
[2022-05-17 18:42:02] [INFO ] Deduced a trap composed of 162 places in 223 ms of which 1 ms to minimize.
[2022-05-17 18:42:03] [INFO ] Deduced a trap composed of 168 places in 207 ms of which 1 ms to minimize.
[2022-05-17 18:42:03] [INFO ] Deduced a trap composed of 164 places in 201 ms of which 1 ms to minimize.
[2022-05-17 18:42:04] [INFO ] Deduced a trap composed of 160 places in 208 ms of which 0 ms to minimize.
[2022-05-17 18:42:04] [INFO ] Deduced a trap composed of 168 places in 208 ms of which 1 ms to minimize.
[2022-05-17 18:42:04] [INFO ] Deduced a trap composed of 164 places in 205 ms of which 1 ms to minimize.
[2022-05-17 18:42:05] [INFO ] Deduced a trap composed of 164 places in 220 ms of which 11 ms to minimize.
[2022-05-17 18:42:05] [INFO ] Deduced a trap composed of 158 places in 199 ms of which 1 ms to minimize.
[2022-05-17 18:42:05] [INFO ] Deduced a trap composed of 164 places in 199 ms of which 0 ms to minimize.
[2022-05-17 18:42:05] [INFO ] Deduced a trap composed of 158 places in 199 ms of which 1 ms to minimize.
[2022-05-17 18:42:06] [INFO ] Deduced a trap composed of 164 places in 200 ms of which 0 ms to minimize.
[2022-05-17 18:42:06] [INFO ] Deduced a trap composed of 162 places in 210 ms of which 0 ms to minimize.
[2022-05-17 18:42:06] [INFO ] Deduced a trap composed of 166 places in 200 ms of which 1 ms to minimize.
[2022-05-17 18:42:07] [INFO ] Deduced a trap composed of 170 places in 205 ms of which 0 ms to minimize.
[2022-05-17 18:42:07] [INFO ] Deduced a trap composed of 164 places in 203 ms of which 0 ms to minimize.
[2022-05-17 18:42:08] [INFO ] Deduced a trap composed of 160 places in 204 ms of which 1 ms to minimize.
[2022-05-17 18:42:08] [INFO ] Deduced a trap composed of 170 places in 211 ms of which 2 ms to minimize.
[2022-05-17 18:42:08] [INFO ] Deduced a trap composed of 164 places in 208 ms of which 1 ms to minimize.
[2022-05-17 18:42:08] [INFO ] Deduced a trap composed of 164 places in 211 ms of which 4 ms to minimize.
[2022-05-17 18:42:09] [INFO ] Deduced a trap composed of 162 places in 210 ms of which 0 ms to minimize.
[2022-05-17 18:42:09] [INFO ] Deduced a trap composed of 170 places in 208 ms of which 1 ms to minimize.
[2022-05-17 18:42:09] [INFO ] Deduced a trap composed of 168 places in 204 ms of which 0 ms to minimize.
[2022-05-17 18:42:10] [INFO ] Deduced a trap composed of 162 places in 203 ms of which 0 ms to minimize.
[2022-05-17 18:42:10] [INFO ] Deduced a trap composed of 164 places in 209 ms of which 1 ms to minimize.
[2022-05-17 18:42:10] [INFO ] Deduced a trap composed of 162 places in 201 ms of which 0 ms to minimize.
[2022-05-17 18:42:11] [INFO ] Deduced a trap composed of 168 places in 210 ms of which 0 ms to minimize.
[2022-05-17 18:42:11] [INFO ] Deduced a trap composed of 164 places in 206 ms of which 0 ms to minimize.
[2022-05-17 18:42:11] [INFO ] Deduced a trap composed of 160 places in 201 ms of which 0 ms to minimize.
[2022-05-17 18:42:12] [INFO ] Deduced a trap composed of 164 places in 205 ms of which 0 ms to minimize.
[2022-05-17 18:42:13] [INFO ] Deduced a trap composed of 168 places in 208 ms of which 1 ms to minimize.
[2022-05-17 18:42:14] [INFO ] Deduced a trap composed of 164 places in 205 ms of which 1 ms to minimize.
[2022-05-17 18:42:14] [INFO ] Deduced a trap composed of 158 places in 207 ms of which 1 ms to minimize.
[2022-05-17 18:42:14] [INFO ] Deduced a trap composed of 164 places in 204 ms of which 0 ms to minimize.
[2022-05-17 18:42:15] [INFO ] Deduced a trap composed of 160 places in 207 ms of which 0 ms to minimize.
[2022-05-17 18:42:15] [INFO ] Deduced a trap composed of 162 places in 211 ms of which 0 ms to minimize.
[2022-05-17 18:42:15] [INFO ] Deduced a trap composed of 168 places in 206 ms of which 1 ms to minimize.
[2022-05-17 18:42:15] [INFO ] Deduced a trap composed of 164 places in 205 ms of which 0 ms to minimize.
[2022-05-17 18:42:16] [INFO ] Deduced a trap composed of 160 places in 207 ms of which 0 ms to minimize.
[2022-05-17 18:42:16] [INFO ] Deduced a trap composed of 166 places in 209 ms of which 0 ms to minimize.
[2022-05-17 18:42:16] [INFO ] Deduced a trap composed of 162 places in 201 ms of which 0 ms to minimize.
[2022-05-17 18:42:17] [INFO ] Deduced a trap composed of 162 places in 199 ms of which 1 ms to minimize.
[2022-05-17 18:42:17] [INFO ] Deduced a trap composed of 168 places in 199 ms of which 1 ms to minimize.
[2022-05-17 18:42:18] [INFO ] Deduced a trap composed of 164 places in 203 ms of which 0 ms to minimize.
[2022-05-17 18:42:18] [INFO ] Deduced a trap composed of 166 places in 201 ms of which 1 ms to minimize.
[2022-05-17 18:42:19] [INFO ] Deduced a trap composed of 162 places in 208 ms of which 0 ms to minimize.
[2022-05-17 18:42:19] [INFO ] Deduced a trap composed of 164 places in 198 ms of which 1 ms to minimize.
[2022-05-17 18:42:19] [INFO ] Deduced a trap composed of 164 places in 204 ms of which 1 ms to minimize.
[2022-05-17 18:42:20] [INFO ] Deduced a trap composed of 170 places in 200 ms of which 0 ms to minimize.
[2022-05-17 18:42:20] [INFO ] Deduced a trap composed of 168 places in 194 ms of which 1 ms to minimize.
[2022-05-17 18:42:24] [INFO ] Deduced a trap composed of 164 places in 207 ms of which 0 ms to minimize.
[2022-05-17 18:42:24] [INFO ] Deduced a trap composed of 162 places in 197 ms of which 1 ms to minimize.
[2022-05-17 18:42:24] [INFO ] Deduced a trap composed of 172 places in 198 ms of which 0 ms to minimize.
[2022-05-17 18:42:25] [INFO ] Deduced a trap composed of 166 places in 197 ms of which 0 ms to minimize.
[2022-05-17 18:42:25] [INFO ] Deduced a trap composed of 172 places in 215 ms of which 0 ms to minimize.
[2022-05-17 18:42:25] [INFO ] Deduced a trap composed of 162 places in 209 ms of which 0 ms to minimize.
[2022-05-17 18:42:26] [INFO ] Deduced a trap composed of 166 places in 196 ms of which 1 ms to minimize.
[2022-05-17 18:42:26] [INFO ] Deduced a trap composed of 160 places in 197 ms of which 0 ms to minimize.
[2022-05-17 18:42:26] [INFO ] Deduced a trap composed of 176 places in 207 ms of which 0 ms to minimize.
[2022-05-17 18:42:27] [INFO ] Deduced a trap composed of 162 places in 201 ms of which 1 ms to minimize.
[2022-05-17 18:42:27] [INFO ] Deduced a trap composed of 162 places in 201 ms of which 1 ms to minimize.
[2022-05-17 18:42:27] [INFO ] Deduced a trap composed of 166 places in 210 ms of which 1 ms to minimize.
[2022-05-17 18:42:28] [INFO ] Deduced a trap composed of 164 places in 210 ms of which 0 ms to minimize.
[2022-05-17 18:42:30] [INFO ] Deduced a trap composed of 168 places in 193 ms of which 1 ms to minimize.
[2022-05-17 18:42:31] [INFO ] Deduced a trap composed of 166 places in 199 ms of which 1 ms to minimize.
[2022-05-17 18:42:31] [INFO ] Deduced a trap composed of 162 places in 200 ms of which 0 ms to minimize.
[2022-05-17 18:42:32] [INFO ] Deduced a trap composed of 164 places in 197 ms of which 0 ms to minimize.
[2022-05-17 18:42:32] [INFO ] Deduced a trap composed of 160 places in 208 ms of which 1 ms to minimize.
[2022-05-17 18:42:33] [INFO ] Deduced a trap composed of 162 places in 205 ms of which 0 ms to minimize.
[2022-05-17 18:42:33] [INFO ] Deduced a trap composed of 160 places in 214 ms of which 0 ms to minimize.
[2022-05-17 18:42:34] [INFO ] Deduced a trap composed of 160 places in 205 ms of which 0 ms to minimize.
[2022-05-17 18:42:34] [INFO ] Deduced a trap composed of 160 places in 206 ms of which 1 ms to minimize.
[2022-05-17 18:42:34] [INFO ] Deduced a trap composed of 162 places in 203 ms of which 1 ms to minimize.
[2022-05-17 18:42:35] [INFO ] Deduced a trap composed of 162 places in 200 ms of which 1 ms to minimize.
[2022-05-17 18:42:35] [INFO ] Deduced a trap composed of 162 places in 206 ms of which 0 ms to minimize.
[2022-05-17 18:42:37] [INFO ] Deduced a trap composed of 156 places in 208 ms of which 0 ms to minimize.
[2022-05-17 18:42:37] [INFO ] Deduced a trap composed of 158 places in 199 ms of which 1 ms to minimize.
[2022-05-17 18:42:38] [INFO ] Deduced a trap composed of 166 places in 196 ms of which 0 ms to minimize.
[2022-05-17 18:42:38] [INFO ] Deduced a trap composed of 178 places in 206 ms of which 0 ms to minimize.
[2022-05-17 18:42:39] [INFO ] Deduced a trap composed of 168 places in 205 ms of which 1 ms to minimize.
[2022-05-17 18:42:39] [INFO ] Deduced a trap composed of 160 places in 197 ms of which 0 ms to minimize.
[2022-05-17 18:42:39] [INFO ] Deduced a trap composed of 170 places in 199 ms of which 0 ms to minimize.
[2022-05-17 18:42:39] [INFO ] Deduced a trap composed of 160 places in 197 ms of which 0 ms to minimize.
[2022-05-17 18:42:40] [INFO ] Deduced a trap composed of 160 places in 196 ms of which 0 ms to minimize.
[2022-05-17 18:42:40] [INFO ] Deduced a trap composed of 160 places in 198 ms of which 1 ms to minimize.
[2022-05-17 18:42:40] [INFO ] Deduced a trap composed of 166 places in 200 ms of which 0 ms to minimize.
[2022-05-17 18:42:41] [INFO ] Deduced a trap composed of 164 places in 200 ms of which 0 ms to minimize.
[2022-05-17 18:42:41] [INFO ] Deduced a trap composed of 162 places in 200 ms of which 0 ms to minimize.
[2022-05-17 18:42:42] [INFO ] Deduced a trap composed of 160 places in 212 ms of which 1 ms to minimize.
[2022-05-17 18:42:42] [INFO ] Deduced a trap composed of 180 places in 206 ms of which 0 ms to minimize.
[2022-05-17 18:42:43] [INFO ] Deduced a trap composed of 164 places in 201 ms of which 0 ms to minimize.
[2022-05-17 18:42:51] [INFO ] Deduced a trap composed of 166 places in 212 ms of which 1 ms to minimize.
[2022-05-17 18:42:52] [INFO ] Deduced a trap composed of 172 places in 204 ms of which 0 ms to minimize.
[2022-05-17 18:42:54] [INFO ] Deduced a trap composed of 180 places in 203 ms of which 1 ms to minimize.
[2022-05-17 18:42:59] [INFO ] Deduced a trap composed of 176 places in 210 ms of which 0 ms to minimize.
[2022-05-17 18:42:59] [INFO ] Deduced a trap composed of 166 places in 207 ms of which 1 ms to minimize.
[2022-05-17 18:43:00] [INFO ] Deduced a trap composed of 166 places in 205 ms of which 1 ms to minimize.
[2022-05-17 18:43:00] [INFO ] Deduced a trap composed of 176 places in 204 ms of which 1 ms to minimize.
[2022-05-17 18:43:00] [INFO ] Deduced a trap composed of 166 places in 208 ms of which 0 ms to minimize.
[2022-05-17 18:43:00] [INFO ] Deduced a trap composed of 164 places in 201 ms of which 1 ms to minimize.
[2022-05-17 18:43:01] [INFO ] Deduced a trap composed of 170 places in 212 ms of which 1 ms to minimize.
[2022-05-17 18:43:01] [INFO ] Deduced a trap composed of 182 places in 205 ms of which 0 ms to minimize.
[2022-05-17 18:43:02] [INFO ] Deduced a trap composed of 178 places in 205 ms of which 0 ms to minimize.
[2022-05-17 18:43:02] [INFO ] Deduced a trap composed of 166 places in 210 ms of which 0 ms to minimize.
[2022-05-17 18:43:03] [INFO ] Deduced a trap composed of 178 places in 199 ms of which 0 ms to minimize.
[2022-05-17 18:43:05] [INFO ] Deduced a trap composed of 166 places in 208 ms of which 1 ms to minimize.
[2022-05-17 18:43:05] [INFO ] Deduced a trap composed of 172 places in 205 ms of which 0 ms to minimize.
[2022-05-17 18:43:06] [INFO ] Deduced a trap composed of 164 places in 208 ms of which 0 ms to minimize.
[2022-05-17 18:43:07] [INFO ] Deduced a trap composed of 174 places in 206 ms of which 0 ms to minimize.
[2022-05-17 18:43:08] [INFO ] Deduced a trap composed of 168 places in 205 ms of which 0 ms to minimize.
[2022-05-17 18:43:09] [INFO ] Deduced a trap composed of 170 places in 205 ms of which 0 ms to minimize.
[2022-05-17 18:43:09] [INFO ] Deduced a trap composed of 170 places in 203 ms of which 0 ms to minimize.
[2022-05-17 18:43:10] [INFO ] Deduced a trap composed of 164 places in 207 ms of which 0 ms to minimize.
[2022-05-17 18:43:10] [INFO ] Deduced a trap composed of 168 places in 208 ms of which 0 ms to minimize.
[2022-05-17 18:43:11] [INFO ] Deduced a trap composed of 168 places in 201 ms of which 1 ms to minimize.
[2022-05-17 18:43:11] [INFO ] Deduced a trap composed of 176 places in 209 ms of which 1 ms to minimize.
[2022-05-17 18:43:11] [INFO ] Deduced a trap composed of 166 places in 205 ms of which 0 ms to minimize.
[2022-05-17 18:43:11] [INFO ] Deduced a trap composed of 168 places in 210 ms of which 1 ms to minimize.
[2022-05-17 18:43:12] [INFO ] Deduced a trap composed of 168 places in 203 ms of which 0 ms to minimize.
[2022-05-17 18:43:12] [INFO ] Deduced a trap composed of 170 places in 208 ms of which 0 ms to minimize.
[2022-05-17 18:43:12] [INFO ] Deduced a trap composed of 172 places in 204 ms of which 1 ms to minimize.
[2022-05-17 18:43:13] [INFO ] Deduced a trap composed of 170 places in 199 ms of which 0 ms to minimize.
[2022-05-17 18:43:13] [INFO ] Deduced a trap composed of 176 places in 204 ms of which 0 ms to minimize.
[2022-05-17 18:43:13] [INFO ] Deduced a trap composed of 170 places in 209 ms of which 1 ms to minimize.
[2022-05-17 18:43:14] [INFO ] Deduced a trap composed of 168 places in 198 ms of which 1 ms to minimize.
[2022-05-17 18:43:14] [INFO ] Deduced a trap composed of 162 places in 207 ms of which 0 ms to minimize.
[2022-05-17 18:43:14] [INFO ] Deduced a trap composed of 172 places in 198 ms of which 1 ms to minimize.
[2022-05-17 18:43:15] [INFO ] Deduced a trap composed of 166 places in 209 ms of which 0 ms to minimize.
[2022-05-17 18:43:15] [INFO ] Deduced a trap composed of 178 places in 203 ms of which 0 ms to minimize.
[2022-05-17 18:43:15] [INFO ] Deduced a trap composed of 172 places in 205 ms of which 0 ms to minimize.
[2022-05-17 18:43:16] [INFO ] Deduced a trap composed of 168 places in 197 ms of which 0 ms to minimize.
[2022-05-17 18:43:16] [INFO ] Deduced a trap composed of 178 places in 197 ms of which 0 ms to minimize.
[2022-05-17 18:43:17] [INFO ] Deduced a trap composed of 166 places in 199 ms of which 0 ms to minimize.
[2022-05-17 18:43:17] [INFO ] Deduced a trap composed of 176 places in 207 ms of which 1 ms to minimize.
[2022-05-17 18:43:17] [INFO ] Deduced a trap composed of 166 places in 203 ms of which 0 ms to minimize.
[2022-05-17 18:43:17] [INFO ] Deduced a trap composed of 164 places in 213 ms of which 0 ms to minimize.
[2022-05-17 18:43:18] [INFO ] Deduced a trap composed of 166 places in 203 ms of which 1 ms to minimize.
[2022-05-17 18:43:18] [INFO ] Deduced a trap composed of 162 places in 204 ms of which 1 ms to minimize.
[2022-05-17 18:43:18] [INFO ] Deduced a trap composed of 164 places in 209 ms of which 1 ms to minimize.
[2022-05-17 18:43:19] [INFO ] Deduced a trap composed of 178 places in 203 ms of which 1 ms to minimize.
[2022-05-17 18:43:19] [INFO ] Deduced a trap composed of 178 places in 199 ms of which 1 ms to minimize.
[2022-05-17 18:43:19] [INFO ] Deduced a trap composed of 178 places in 203 ms of which 0 ms to minimize.
[2022-05-17 18:43:19] [INFO ] Deduced a trap composed of 174 places in 200 ms of which 0 ms to minimize.
[2022-05-17 18:43:20] [INFO ] Deduced a trap composed of 178 places in 192 ms of which 1 ms to minimize.
[2022-05-17 18:43:20] [INFO ] Deduced a trap composed of 182 places in 194 ms of which 0 ms to minimize.
[2022-05-17 18:43:20] [INFO ] Deduced a trap composed of 180 places in 197 ms of which 1 ms to minimize.
[2022-05-17 18:43:21] [INFO ] Deduced a trap composed of 164 places in 202 ms of which 0 ms to minimize.
[2022-05-17 18:43:21] [INFO ] Deduced a trap composed of 172 places in 199 ms of which 0 ms to minimize.
[2022-05-17 18:43:21] [INFO ] Deduced a trap composed of 166 places in 198 ms of which 0 ms to minimize.
[2022-05-17 18:43:22] [INFO ] Deduced a trap composed of 172 places in 204 ms of which 1 ms to minimize.
[2022-05-17 18:43:22] [INFO ] Deduced a trap composed of 176 places in 201 ms of which 1 ms to minimize.
[2022-05-17 18:43:22] [INFO ] Deduced a trap composed of 174 places in 204 ms of which 1 ms to minimize.
[2022-05-17 18:43:23] [INFO ] Deduced a trap composed of 182 places in 204 ms of which 1 ms to minimize.
[2022-05-17 18:43:24] [INFO ] Deduced a trap composed of 174 places in 205 ms of which 0 ms to minimize.
[2022-05-17 18:43:27] [INFO ] Deduced a trap composed of 170 places in 202 ms of which 0 ms to minimize.
[2022-05-17 18:43:28] [INFO ] Deduced a trap composed of 166 places in 214 ms of which 0 ms to minimize.
[2022-05-17 18:43:28] [INFO ] Deduced a trap composed of 178 places in 200 ms of which 0 ms to minimize.
[2022-05-17 18:43:29] [INFO ] Deduced a trap composed of 174 places in 203 ms of which 1 ms to minimize.
[2022-05-17 18:43:30] [INFO ] Deduced a trap composed of 176 places in 203 ms of which 0 ms to minimize.
[2022-05-17 18:43:32] [INFO ] Deduced a trap composed of 166 places in 210 ms of which 1 ms to minimize.
[2022-05-17 18:43:33] [INFO ] Deduced a trap composed of 176 places in 202 ms of which 0 ms to minimize.
[2022-05-17 18:43:34] [INFO ] Deduced a trap composed of 164 places in 199 ms of which 0 ms to minimize.
[2022-05-17 18:43:35] [INFO ] Deduced a trap composed of 174 places in 203 ms of which 0 ms to minimize.
[2022-05-17 18:43:35] [INFO ] Deduced a trap composed of 166 places in 197 ms of which 1 ms to minimize.
[2022-05-17 18:43:36] [INFO ] Deduced a trap composed of 166 places in 198 ms of which 0 ms to minimize.
[2022-05-17 18:43:36] [INFO ] Deduced a trap composed of 166 places in 205 ms of which 1 ms to minimize.
[2022-05-17 18:43:37] [INFO ] Deduced a trap composed of 170 places in 207 ms of which 0 ms to minimize.
[2022-05-17 18:43:37] [INFO ] Deduced a trap composed of 164 places in 210 ms of which 1 ms to minimize.
[2022-05-17 18:43:40] [INFO ] Deduced a trap composed of 168 places in 205 ms of which 1 ms to minimize.
[2022-05-17 18:43:40] [INFO ] Deduced a trap composed of 166 places in 199 ms of which 0 ms to minimize.
[2022-05-17 18:43:42] [INFO ] Deduced a trap composed of 168 places in 206 ms of which 0 ms to minimize.
[2022-05-17 18:43:42] [INFO ] Deduced a trap composed of 178 places in 207 ms of which 1 ms to minimize.
[2022-05-17 18:43:43] [INFO ] Deduced a trap composed of 180 places in 215 ms of which 0 ms to minimize.
[2022-05-17 18:43:43] [INFO ] Deduced a trap composed of 174 places in 208 ms of which 1 ms to minimize.
[2022-05-17 18:43:44] [INFO ] Deduced a trap composed of 164 places in 206 ms of which 0 ms to minimize.
[2022-05-17 18:43:44] [INFO ] Deduced a trap composed of 172 places in 207 ms of which 1 ms to minimize.
[2022-05-17 18:43:46] [INFO ] Deduced a trap composed of 166 places in 210 ms of which 1 ms to minimize.
[2022-05-17 18:43:47] [INFO ] Deduced a trap composed of 170 places in 206 ms of which 1 ms to minimize.
[2022-05-17 18:43:48] [INFO ] Deduced a trap composed of 178 places in 206 ms of which 1 ms to minimize.
[2022-05-17 18:43:48] [INFO ] Deduced a trap composed of 164 places in 206 ms of which 1 ms to minimize.
[2022-05-17 18:43:49] [INFO ] Deduced a trap composed of 166 places in 206 ms of which 1 ms to minimize.
[2022-05-17 18:43:55] [INFO ] Deduced a trap composed of 168 places in 208 ms of which 1 ms to minimize.
[2022-05-17 18:43:56] [INFO ] Deduced a trap composed of 170 places in 205 ms of which 1 ms to minimize.
[2022-05-17 18:43:56] [INFO ] Deduced a trap composed of 168 places in 208 ms of which 1 ms to minimize.
[2022-05-17 18:43:56] [INFO ] Deduced a trap composed of 170 places in 210 ms of which 0 ms to minimize.
[2022-05-17 18:43:56] [INFO ] Deduced a trap composed of 166 places in 204 ms of which 0 ms to minimize.
[2022-05-17 18:43:57] [INFO ] Deduced a trap composed of 180 places in 205 ms of which 1 ms to minimize.
[2022-05-17 18:43:57] [INFO ] Deduced a trap composed of 172 places in 201 ms of which 0 ms to minimize.
[2022-05-17 18:43:57] [INFO ] Deduced a trap composed of 172 places in 201 ms of which 0 ms to minimize.
[2022-05-17 18:44:03] [INFO ] Deduced a trap composed of 164 places in 205 ms of which 1 ms to minimize.
[2022-05-17 18:44:04] [INFO ] Deduced a trap composed of 172 places in 199 ms of which 1 ms to minimize.
[2022-05-17 18:44:05] [INFO ] Deduced a trap composed of 180 places in 209 ms of which 1 ms to minimize.
[2022-05-17 18:44:05] [INFO ] Deduced a trap composed of 166 places in 205 ms of which 0 ms to minimize.
[2022-05-17 18:44:06] [INFO ] Deduced a trap composed of 170 places in 207 ms of which 0 ms to minimize.
[2022-05-17 18:44:06] [INFO ] Deduced a trap composed of 172 places in 206 ms of which 0 ms to minimize.
[2022-05-17 18:44:07] [INFO ] Deduced a trap composed of 178 places in 205 ms of which 0 ms to minimize.
[2022-05-17 18:44:07] [INFO ] Deduced a trap composed of 180 places in 201 ms of which 0 ms to minimize.
[2022-05-17 18:44:09] [INFO ] Deduced a trap composed of 170 places in 198 ms of which 1 ms to minimize.
[2022-05-17 18:44:09] [INFO ] Deduced a trap composed of 168 places in 215 ms of which 0 ms to minimize.
[2022-05-17 18:44:10] [INFO ] Deduced a trap composed of 170 places in 200 ms of which 1 ms to minimize.
[2022-05-17 18:44:11] [INFO ] Deduced a trap composed of 178 places in 202 ms of which 1 ms to minimize.
[2022-05-17 18:44:17] [INFO ] Deduced a trap composed of 162 places in 202 ms of which 0 ms to minimize.
[2022-05-17 18:44:22] [INFO ] Deduced a trap composed of 178 places in 213 ms of which 1 ms to minimize.
[2022-05-17 18:44:22] [INFO ] Deduced a trap composed of 164 places in 210 ms of which 1 ms to minimize.
[2022-05-17 18:44:23] [INFO ] Deduced a trap composed of 168 places in 205 ms of which 0 ms to minimize.
[2022-05-17 18:44:32] [INFO ] Trap strengthening (SAT) tested/added 250/250 trap constraints in 163955 ms
[2022-05-17 18:44:32] [INFO ] After 164188ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2022-05-17 18:44:32] [INFO ] After 164569ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 18 ms.
Support contains 1 out of 413 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 413/413 places, 984/984 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 413 transition count 983
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 412 transition count 983
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 2 place count 412 transition count 981
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 6 place count 410 transition count 981
Applied a total of 6 rules in 49 ms. Remains 410 /413 variables (removed 3) and now considering 981/984 (removed 3) transitions.
Finished structural reductions, in 1 iterations. Remains : 410/413 places, 981/984 transitions.
Incomplete random walk after 1000000 steps, including 72733 resets, run finished after 9182 ms. (steps per millisecond=108 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 9764 resets, run finished after 1741 ms. (steps per millisecond=574 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 5605832 steps, run timeout after 30001 ms. (steps per millisecond=186 ) properties seen :{}
Probabilistic random walk after 5605832 steps, saw 971777 distinct states, run finished after 30002 ms. (steps per millisecond=186 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-17 18:45:13] [INFO ] Flow matrix only has 972 transitions (discarded 9 similar events)
// Phase 1: matrix 972 rows 410 cols
[2022-05-17 18:45:13] [INFO ] Computed 62 place invariants in 18 ms
[2022-05-17 18:45:13] [INFO ] [Real]Absence check using 55 positive place invariants in 11 ms returned sat
[2022-05-17 18:45:13] [INFO ] [Real]Absence check using 55 positive and 7 generalized place invariants in 8 ms returned sat
[2022-05-17 18:45:13] [INFO ] After 83ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 18:45:13] [INFO ] [Nat]Absence check using 55 positive place invariants in 11 ms returned sat
[2022-05-17 18:45:13] [INFO ] [Nat]Absence check using 55 positive and 7 generalized place invariants in 9 ms returned sat
[2022-05-17 18:45:13] [INFO ] After 289ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 18:45:13] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-17 18:45:13] [INFO ] After 75ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 18:45:14] [INFO ] Deduced a trap composed of 177 places in 213 ms of which 1 ms to minimize.
[2022-05-17 18:45:14] [INFO ] Deduced a trap composed of 162 places in 201 ms of which 0 ms to minimize.
[2022-05-17 18:45:14] [INFO ] Deduced a trap composed of 166 places in 210 ms of which 0 ms to minimize.
[2022-05-17 18:45:14] [INFO ] Deduced a trap composed of 168 places in 201 ms of which 1 ms to minimize.
[2022-05-17 18:45:15] [INFO ] Deduced a trap composed of 166 places in 203 ms of which 1 ms to minimize.
[2022-05-17 18:45:15] [INFO ] Deduced a trap composed of 160 places in 201 ms of which 0 ms to minimize.
[2022-05-17 18:45:15] [INFO ] Deduced a trap composed of 166 places in 209 ms of which 1 ms to minimize.
[2022-05-17 18:45:15] [INFO ] Deduced a trap composed of 168 places in 203 ms of which 1 ms to minimize.
[2022-05-17 18:45:16] [INFO ] Deduced a trap composed of 164 places in 211 ms of which 0 ms to minimize.
[2022-05-17 18:45:16] [INFO ] Deduced a trap composed of 164 places in 222 ms of which 1 ms to minimize.
[2022-05-17 18:45:16] [INFO ] Deduced a trap composed of 170 places in 200 ms of which 0 ms to minimize.
[2022-05-17 18:45:16] [INFO ] Deduced a trap composed of 166 places in 207 ms of which 1 ms to minimize.
[2022-05-17 18:45:17] [INFO ] Deduced a trap composed of 158 places in 208 ms of which 1 ms to minimize.
[2022-05-17 18:45:17] [INFO ] Deduced a trap composed of 164 places in 204 ms of which 1 ms to minimize.
[2022-05-17 18:45:17] [INFO ] Deduced a trap composed of 164 places in 199 ms of which 1 ms to minimize.
[2022-05-17 18:45:17] [INFO ] Deduced a trap composed of 179 places in 211 ms of which 0 ms to minimize.
[2022-05-17 18:45:18] [INFO ] Deduced a trap composed of 173 places in 209 ms of which 0 ms to minimize.
[2022-05-17 18:45:18] [INFO ] Deduced a trap composed of 160 places in 201 ms of which 1 ms to minimize.
[2022-05-17 18:45:18] [INFO ] Deduced a trap composed of 164 places in 197 ms of which 0 ms to minimize.
[2022-05-17 18:45:19] [INFO ] Deduced a trap composed of 160 places in 197 ms of which 1 ms to minimize.
[2022-05-17 18:45:19] [INFO ] Deduced a trap composed of 164 places in 199 ms of which 1 ms to minimize.
[2022-05-17 18:45:19] [INFO ] Deduced a trap composed of 160 places in 198 ms of which 1 ms to minimize.
[2022-05-17 18:45:19] [INFO ] Deduced a trap composed of 162 places in 197 ms of which 0 ms to minimize.
[2022-05-17 18:45:20] [INFO ] Deduced a trap composed of 160 places in 203 ms of which 1 ms to minimize.
[2022-05-17 18:45:20] [INFO ] Deduced a trap composed of 164 places in 193 ms of which 1 ms to minimize.
[2022-05-17 18:45:20] [INFO ] Deduced a trap composed of 175 places in 210 ms of which 1 ms to minimize.
[2022-05-17 18:45:20] [INFO ] Deduced a trap composed of 162 places in 204 ms of which 1 ms to minimize.
[2022-05-17 18:45:21] [INFO ] Deduced a trap composed of 158 places in 209 ms of which 0 ms to minimize.
[2022-05-17 18:45:21] [INFO ] Deduced a trap composed of 156 places in 208 ms of which 0 ms to minimize.
[2022-05-17 18:45:21] [INFO ] Deduced a trap composed of 162 places in 200 ms of which 1 ms to minimize.
[2022-05-17 18:45:21] [INFO ] Deduced a trap composed of 164 places in 201 ms of which 0 ms to minimize.
[2022-05-17 18:45:22] [INFO ] Deduced a trap composed of 160 places in 204 ms of which 1 ms to minimize.
[2022-05-17 18:45:22] [INFO ] Deduced a trap composed of 170 places in 197 ms of which 0 ms to minimize.
[2022-05-17 18:45:22] [INFO ] Deduced a trap composed of 162 places in 201 ms of which 0 ms to minimize.
[2022-05-17 18:45:23] [INFO ] Deduced a trap composed of 168 places in 203 ms of which 0 ms to minimize.
[2022-05-17 18:45:23] [INFO ] Deduced a trap composed of 158 places in 194 ms of which 0 ms to minimize.
[2022-05-17 18:45:23] [INFO ] Deduced a trap composed of 164 places in 199 ms of which 0 ms to minimize.
[2022-05-17 18:45:23] [INFO ] Deduced a trap composed of 162 places in 194 ms of which 0 ms to minimize.
[2022-05-17 18:45:24] [INFO ] Deduced a trap composed of 162 places in 201 ms of which 1 ms to minimize.
[2022-05-17 18:45:24] [INFO ] Deduced a trap composed of 166 places in 192 ms of which 1 ms to minimize.
[2022-05-17 18:45:24] [INFO ] Deduced a trap composed of 162 places in 193 ms of which 1 ms to minimize.
[2022-05-17 18:45:24] [INFO ] Deduced a trap composed of 160 places in 203 ms of which 1 ms to minimize.
[2022-05-17 18:45:25] [INFO ] Deduced a trap composed of 166 places in 210 ms of which 1 ms to minimize.
[2022-05-17 18:45:25] [INFO ] Deduced a trap composed of 164 places in 200 ms of which 1 ms to minimize.
[2022-05-17 18:45:25] [INFO ] Deduced a trap composed of 156 places in 214 ms of which 1 ms to minimize.
[2022-05-17 18:45:25] [INFO ] Deduced a trap composed of 158 places in 204 ms of which 1 ms to minimize.
[2022-05-17 18:45:26] [INFO ] Deduced a trap composed of 168 places in 201 ms of which 1 ms to minimize.
[2022-05-17 18:45:26] [INFO ] Deduced a trap composed of 164 places in 204 ms of which 1 ms to minimize.
[2022-05-17 18:45:26] [INFO ] Deduced a trap composed of 171 places in 204 ms of which 1 ms to minimize.
[2022-05-17 18:45:26] [INFO ] Deduced a trap composed of 168 places in 187 ms of which 1 ms to minimize.
[2022-05-17 18:45:27] [INFO ] Deduced a trap composed of 166 places in 200 ms of which 0 ms to minimize.
[2022-05-17 18:45:27] [INFO ] Deduced a trap composed of 162 places in 201 ms of which 0 ms to minimize.
[2022-05-17 18:45:27] [INFO ] Deduced a trap composed of 160 places in 197 ms of which 0 ms to minimize.
[2022-05-17 18:45:27] [INFO ] Deduced a trap composed of 164 places in 192 ms of which 1 ms to minimize.
[2022-05-17 18:45:28] [INFO ] Deduced a trap composed of 162 places in 196 ms of which 1 ms to minimize.
[2022-05-17 18:45:28] [INFO ] Deduced a trap composed of 162 places in 196 ms of which 0 ms to minimize.
[2022-05-17 18:45:29] [INFO ] Deduced a trap composed of 158 places in 197 ms of which 0 ms to minimize.
[2022-05-17 18:45:29] [INFO ] Deduced a trap composed of 156 places in 194 ms of which 1 ms to minimize.
[2022-05-17 18:45:29] [INFO ] Deduced a trap composed of 154 places in 193 ms of which 1 ms to minimize.
[2022-05-17 18:45:30] [INFO ] Deduced a trap composed of 166 places in 192 ms of which 1 ms to minimize.
[2022-05-17 18:45:30] [INFO ] Deduced a trap composed of 170 places in 193 ms of which 0 ms to minimize.
[2022-05-17 18:45:30] [INFO ] Deduced a trap composed of 162 places in 194 ms of which 1 ms to minimize.
[2022-05-17 18:45:30] [INFO ] Deduced a trap composed of 158 places in 200 ms of which 0 ms to minimize.
[2022-05-17 18:45:31] [INFO ] Deduced a trap composed of 158 places in 199 ms of which 0 ms to minimize.
[2022-05-17 18:45:31] [INFO ] Deduced a trap composed of 164 places in 194 ms of which 0 ms to minimize.
[2022-05-17 18:45:31] [INFO ] Deduced a trap composed of 164 places in 190 ms of which 1 ms to minimize.
[2022-05-17 18:45:32] [INFO ] Deduced a trap composed of 160 places in 192 ms of which 0 ms to minimize.
[2022-05-17 18:45:32] [INFO ] Deduced a trap composed of 160 places in 198 ms of which 1 ms to minimize.
[2022-05-17 18:45:32] [INFO ] Deduced a trap composed of 168 places in 206 ms of which 1 ms to minimize.
[2022-05-17 18:45:33] [INFO ] Deduced a trap composed of 158 places in 207 ms of which 0 ms to minimize.
[2022-05-17 18:45:33] [INFO ] Deduced a trap composed of 162 places in 198 ms of which 1 ms to minimize.
[2022-05-17 18:45:33] [INFO ] Deduced a trap composed of 156 places in 195 ms of which 0 ms to minimize.
[2022-05-17 18:45:33] [INFO ] Deduced a trap composed of 162 places in 200 ms of which 1 ms to minimize.
[2022-05-17 18:45:34] [INFO ] Deduced a trap composed of 162 places in 208 ms of which 1 ms to minimize.
[2022-05-17 18:45:35] [INFO ] Deduced a trap composed of 164 places in 201 ms of which 0 ms to minimize.
[2022-05-17 18:45:35] [INFO ] Deduced a trap composed of 156 places in 199 ms of which 1 ms to minimize.
[2022-05-17 18:45:35] [INFO ] Deduced a trap composed of 158 places in 194 ms of which 1 ms to minimize.
[2022-05-17 18:45:36] [INFO ] Deduced a trap composed of 158 places in 197 ms of which 0 ms to minimize.
[2022-05-17 18:45:36] [INFO ] Deduced a trap composed of 174 places in 198 ms of which 0 ms to minimize.
[2022-05-17 18:45:36] [INFO ] Deduced a trap composed of 158 places in 214 ms of which 0 ms to minimize.
[2022-05-17 18:45:36] [INFO ] Deduced a trap composed of 164 places in 199 ms of which 1 ms to minimize.
[2022-05-17 18:45:37] [INFO ] Deduced a trap composed of 160 places in 202 ms of which 0 ms to minimize.
[2022-05-17 18:45:37] [INFO ] Deduced a trap composed of 154 places in 202 ms of which 1 ms to minimize.
[2022-05-17 18:45:37] [INFO ] Deduced a trap composed of 158 places in 198 ms of which 1 ms to minimize.
[2022-05-17 18:45:40] [INFO ] Deduced a trap composed of 168 places in 200 ms of which 0 ms to minimize.
[2022-05-17 18:45:40] [INFO ] Deduced a trap composed of 158 places in 211 ms of which 1 ms to minimize.
[2022-05-17 18:45:40] [INFO ] Deduced a trap composed of 162 places in 200 ms of which 0 ms to minimize.
[2022-05-17 18:45:41] [INFO ] Deduced a trap composed of 158 places in 203 ms of which 0 ms to minimize.
[2022-05-17 18:45:41] [INFO ] Deduced a trap composed of 164 places in 193 ms of which 0 ms to minimize.
[2022-05-17 18:45:41] [INFO ] Deduced a trap composed of 166 places in 207 ms of which 0 ms to minimize.
[2022-05-17 18:45:41] [INFO ] Deduced a trap composed of 160 places in 206 ms of which 0 ms to minimize.
[2022-05-17 18:45:42] [INFO ] Deduced a trap composed of 162 places in 202 ms of which 1 ms to minimize.
[2022-05-17 18:45:42] [INFO ] Deduced a trap composed of 170 places in 203 ms of which 0 ms to minimize.
[2022-05-17 18:45:44] [INFO ] Deduced a trap composed of 162 places in 203 ms of which 1 ms to minimize.
[2022-05-17 18:45:46] [INFO ] Deduced a trap composed of 169 places in 202 ms of which 0 ms to minimize.
[2022-05-17 18:45:55] [INFO ] Trap strengthening (SAT) tested/added 95/95 trap constraints in 41751 ms
[2022-05-17 18:45:55] [INFO ] After 41934ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2022-05-17 18:45:55] [INFO ] After 42313ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 14 ms.
Support contains 1 out of 410 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 410/410 places, 981/981 transitions.
Applied a total of 0 rules in 27 ms. Remains 410 /410 variables (removed 0) and now considering 981/981 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 410/410 places, 981/981 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 410/410 places, 981/981 transitions.
Applied a total of 0 rules in 26 ms. Remains 410 /410 variables (removed 0) and now considering 981/981 (removed 0) transitions.
[2022-05-17 18:45:55] [INFO ] Flow matrix only has 972 transitions (discarded 9 similar events)
// Phase 1: matrix 972 rows 410 cols
[2022-05-17 18:45:55] [INFO ] Computed 62 place invariants in 11 ms
[2022-05-17 18:45:56] [INFO ] Implicit Places using invariants in 312 ms returned []
[2022-05-17 18:45:56] [INFO ] Flow matrix only has 972 transitions (discarded 9 similar events)
// Phase 1: matrix 972 rows 410 cols
[2022-05-17 18:45:56] [INFO ] Computed 62 place invariants in 21 ms
[2022-05-17 18:45:56] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-17 18:45:57] [INFO ] Implicit Places using invariants and state equation in 1813 ms returned []
Implicit Place search using SMT with State Equation took 2127 ms to find 0 implicit places.
[2022-05-17 18:45:57] [INFO ] Redundant transitions in 64 ms returned []
[2022-05-17 18:45:57] [INFO ] Flow matrix only has 972 transitions (discarded 9 similar events)
// Phase 1: matrix 972 rows 410 cols
[2022-05-17 18:45:57] [INFO ] Computed 62 place invariants in 17 ms
[2022-05-17 18:45:58] [INFO ] Dead Transitions using invariants and state equation in 375 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 410/410 places, 981/981 transitions.
Incomplete random walk after 100000 steps, including 7306 resets, run finished after 1035 ms. (steps per millisecond=96 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2022-05-17 18:45:59] [INFO ] Flow matrix only has 972 transitions (discarded 9 similar events)
// Phase 1: matrix 972 rows 410 cols
[2022-05-17 18:45:59] [INFO ] Computed 62 place invariants in 14 ms
[2022-05-17 18:45:59] [INFO ] [Real]Absence check using 55 positive place invariants in 10 ms returned sat
[2022-05-17 18:45:59] [INFO ] [Real]Absence check using 55 positive and 7 generalized place invariants in 8 ms returned sat
[2022-05-17 18:45:59] [INFO ] After 76ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 18:45:59] [INFO ] [Nat]Absence check using 55 positive place invariants in 10 ms returned sat
[2022-05-17 18:45:59] [INFO ] [Nat]Absence check using 55 positive and 7 generalized place invariants in 9 ms returned sat
[2022-05-17 18:45:59] [INFO ] After 286ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 18:45:59] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-17 18:45:59] [INFO ] After 71ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 18:46:00] [INFO ] Deduced a trap composed of 177 places in 216 ms of which 0 ms to minimize.
[2022-05-17 18:46:00] [INFO ] Deduced a trap composed of 162 places in 202 ms of which 0 ms to minimize.
[2022-05-17 18:46:00] [INFO ] Deduced a trap composed of 166 places in 200 ms of which 0 ms to minimize.
[2022-05-17 18:46:00] [INFO ] Deduced a trap composed of 168 places in 199 ms of which 1 ms to minimize.
[2022-05-17 18:46:01] [INFO ] Deduced a trap composed of 166 places in 206 ms of which 0 ms to minimize.
[2022-05-17 18:46:01] [INFO ] Deduced a trap composed of 160 places in 202 ms of which 1 ms to minimize.
[2022-05-17 18:46:01] [INFO ] Deduced a trap composed of 166 places in 208 ms of which 0 ms to minimize.
[2022-05-17 18:46:01] [INFO ] Deduced a trap composed of 168 places in 194 ms of which 0 ms to minimize.
[2022-05-17 18:46:02] [INFO ] Deduced a trap composed of 164 places in 200 ms of which 0 ms to minimize.
[2022-05-17 18:46:02] [INFO ] Deduced a trap composed of 164 places in 205 ms of which 1 ms to minimize.
[2022-05-17 18:46:02] [INFO ] Deduced a trap composed of 170 places in 207 ms of which 1 ms to minimize.
[2022-05-17 18:46:02] [INFO ] Deduced a trap composed of 166 places in 208 ms of which 0 ms to minimize.
[2022-05-17 18:46:03] [INFO ] Deduced a trap composed of 158 places in 206 ms of which 0 ms to minimize.
[2022-05-17 18:46:03] [INFO ] Deduced a trap composed of 164 places in 197 ms of which 0 ms to minimize.
[2022-05-17 18:46:03] [INFO ] Deduced a trap composed of 164 places in 203 ms of which 0 ms to minimize.
[2022-05-17 18:46:03] [INFO ] Deduced a trap composed of 179 places in 205 ms of which 1 ms to minimize.
[2022-05-17 18:46:04] [INFO ] Deduced a trap composed of 173 places in 208 ms of which 0 ms to minimize.
[2022-05-17 18:46:04] [INFO ] Deduced a trap composed of 160 places in 204 ms of which 0 ms to minimize.
[2022-05-17 18:46:04] [INFO ] Deduced a trap composed of 164 places in 197 ms of which 0 ms to minimize.
[2022-05-17 18:46:05] [INFO ] Deduced a trap composed of 160 places in 201 ms of which 0 ms to minimize.
[2022-05-17 18:46:05] [INFO ] Deduced a trap composed of 164 places in 197 ms of which 0 ms to minimize.
[2022-05-17 18:46:05] [INFO ] Deduced a trap composed of 160 places in 195 ms of which 0 ms to minimize.
[2022-05-17 18:46:05] [INFO ] Deduced a trap composed of 162 places in 197 ms of which 0 ms to minimize.
[2022-05-17 18:46:06] [INFO ] Deduced a trap composed of 160 places in 203 ms of which 0 ms to minimize.
[2022-05-17 18:46:06] [INFO ] Deduced a trap composed of 164 places in 204 ms of which 1 ms to minimize.
[2022-05-17 18:46:06] [INFO ] Deduced a trap composed of 175 places in 205 ms of which 0 ms to minimize.
[2022-05-17 18:46:06] [INFO ] Deduced a trap composed of 162 places in 199 ms of which 1 ms to minimize.
[2022-05-17 18:46:07] [INFO ] Deduced a trap composed of 158 places in 200 ms of which 1 ms to minimize.
[2022-05-17 18:46:07] [INFO ] Deduced a trap composed of 156 places in 200 ms of which 1 ms to minimize.
[2022-05-17 18:46:07] [INFO ] Deduced a trap composed of 162 places in 198 ms of which 1 ms to minimize.
[2022-05-17 18:46:07] [INFO ] Deduced a trap composed of 164 places in 195 ms of which 0 ms to minimize.
[2022-05-17 18:46:07] [INFO ] Deduced a trap composed of 160 places in 193 ms of which 1 ms to minimize.
[2022-05-17 18:46:08] [INFO ] Deduced a trap composed of 170 places in 195 ms of which 0 ms to minimize.
[2022-05-17 18:46:08] [INFO ] Deduced a trap composed of 162 places in 204 ms of which 0 ms to minimize.
[2022-05-17 18:46:09] [INFO ] Deduced a trap composed of 168 places in 206 ms of which 1 ms to minimize.
[2022-05-17 18:46:09] [INFO ] Deduced a trap composed of 158 places in 203 ms of which 0 ms to minimize.
[2022-05-17 18:46:09] [INFO ] Deduced a trap composed of 164 places in 192 ms of which 1 ms to minimize.
[2022-05-17 18:46:09] [INFO ] Deduced a trap composed of 162 places in 200 ms of which 1 ms to minimize.
[2022-05-17 18:46:10] [INFO ] Deduced a trap composed of 162 places in 199 ms of which 0 ms to minimize.
[2022-05-17 18:46:10] [INFO ] Deduced a trap composed of 166 places in 202 ms of which 0 ms to minimize.
[2022-05-17 18:46:10] [INFO ] Deduced a trap composed of 162 places in 205 ms of which 0 ms to minimize.
[2022-05-17 18:46:10] [INFO ] Deduced a trap composed of 160 places in 203 ms of which 0 ms to minimize.
[2022-05-17 18:46:11] [INFO ] Deduced a trap composed of 166 places in 202 ms of which 0 ms to minimize.
[2022-05-17 18:46:11] [INFO ] Deduced a trap composed of 164 places in 201 ms of which 1 ms to minimize.
[2022-05-17 18:46:11] [INFO ] Deduced a trap composed of 156 places in 205 ms of which 1 ms to minimize.
[2022-05-17 18:46:11] [INFO ] Deduced a trap composed of 158 places in 196 ms of which 0 ms to minimize.
[2022-05-17 18:46:12] [INFO ] Deduced a trap composed of 168 places in 204 ms of which 1 ms to minimize.
[2022-05-17 18:46:12] [INFO ] Deduced a trap composed of 164 places in 200 ms of which 0 ms to minimize.
[2022-05-17 18:46:12] [INFO ] Deduced a trap composed of 171 places in 200 ms of which 0 ms to minimize.
[2022-05-17 18:46:12] [INFO ] Deduced a trap composed of 168 places in 200 ms of which 0 ms to minimize.
[2022-05-17 18:46:13] [INFO ] Deduced a trap composed of 166 places in 197 ms of which 0 ms to minimize.
[2022-05-17 18:46:13] [INFO ] Deduced a trap composed of 162 places in 196 ms of which 1 ms to minimize.
[2022-05-17 18:46:13] [INFO ] Deduced a trap composed of 160 places in 198 ms of which 0 ms to minimize.
[2022-05-17 18:46:13] [INFO ] Deduced a trap composed of 164 places in 201 ms of which 1 ms to minimize.
[2022-05-17 18:46:14] [INFO ] Deduced a trap composed of 162 places in 200 ms of which 0 ms to minimize.
[2022-05-17 18:46:14] [INFO ] Deduced a trap composed of 162 places in 200 ms of which 0 ms to minimize.
[2022-05-17 18:46:15] [INFO ] Deduced a trap composed of 158 places in 201 ms of which 0 ms to minimize.
[2022-05-17 18:46:15] [INFO ] Deduced a trap composed of 156 places in 199 ms of which 1 ms to minimize.
[2022-05-17 18:46:15] [INFO ] Deduced a trap composed of 154 places in 207 ms of which 0 ms to minimize.
[2022-05-17 18:46:16] [INFO ] Deduced a trap composed of 166 places in 204 ms of which 1 ms to minimize.
[2022-05-17 18:46:16] [INFO ] Deduced a trap composed of 170 places in 195 ms of which 1 ms to minimize.
[2022-05-17 18:46:16] [INFO ] Deduced a trap composed of 162 places in 199 ms of which 1 ms to minimize.
[2022-05-17 18:46:16] [INFO ] Deduced a trap composed of 158 places in 203 ms of which 0 ms to minimize.
[2022-05-17 18:46:17] [INFO ] Deduced a trap composed of 158 places in 203 ms of which 0 ms to minimize.
[2022-05-17 18:46:17] [INFO ] Deduced a trap composed of 164 places in 200 ms of which 0 ms to minimize.
[2022-05-17 18:46:17] [INFO ] Deduced a trap composed of 164 places in 204 ms of which 1 ms to minimize.
[2022-05-17 18:46:18] [INFO ] Deduced a trap composed of 160 places in 205 ms of which 0 ms to minimize.
[2022-05-17 18:46:18] [INFO ] Deduced a trap composed of 160 places in 205 ms of which 0 ms to minimize.
[2022-05-17 18:46:18] [INFO ] Deduced a trap composed of 168 places in 211 ms of which 0 ms to minimize.
[2022-05-17 18:46:19] [INFO ] Deduced a trap composed of 158 places in 214 ms of which 0 ms to minimize.
[2022-05-17 18:46:19] [INFO ] Deduced a trap composed of 162 places in 202 ms of which 1 ms to minimize.
[2022-05-17 18:46:19] [INFO ] Deduced a trap composed of 156 places in 202 ms of which 0 ms to minimize.
[2022-05-17 18:46:20] [INFO ] Deduced a trap composed of 162 places in 210 ms of which 1 ms to minimize.
[2022-05-17 18:46:21] [INFO ] Deduced a trap composed of 162 places in 199 ms of which 0 ms to minimize.
[2022-05-17 18:46:21] [INFO ] Deduced a trap composed of 164 places in 200 ms of which 0 ms to minimize.
[2022-05-17 18:46:21] [INFO ] Deduced a trap composed of 156 places in 196 ms of which 0 ms to minimize.
[2022-05-17 18:46:21] [INFO ] Deduced a trap composed of 158 places in 205 ms of which 1 ms to minimize.
[2022-05-17 18:46:22] [INFO ] Deduced a trap composed of 158 places in 196 ms of which 0 ms to minimize.
[2022-05-17 18:46:22] [INFO ] Deduced a trap composed of 174 places in 194 ms of which 1 ms to minimize.
[2022-05-17 18:46:22] [INFO ] Deduced a trap composed of 158 places in 200 ms of which 0 ms to minimize.
[2022-05-17 18:46:23] [INFO ] Deduced a trap composed of 164 places in 202 ms of which 0 ms to minimize.
[2022-05-17 18:46:23] [INFO ] Deduced a trap composed of 160 places in 196 ms of which 0 ms to minimize.
[2022-05-17 18:46:23] [INFO ] Deduced a trap composed of 154 places in 202 ms of which 0 ms to minimize.
[2022-05-17 18:46:24] [INFO ] Deduced a trap composed of 158 places in 195 ms of which 0 ms to minimize.
[2022-05-17 18:46:26] [INFO ] Deduced a trap composed of 168 places in 199 ms of which 1 ms to minimize.
[2022-05-17 18:46:26] [INFO ] Deduced a trap composed of 158 places in 199 ms of which 1 ms to minimize.
[2022-05-17 18:46:27] [INFO ] Deduced a trap composed of 162 places in 204 ms of which 0 ms to minimize.
[2022-05-17 18:46:27] [INFO ] Deduced a trap composed of 158 places in 203 ms of which 0 ms to minimize.
[2022-05-17 18:46:27] [INFO ] Deduced a trap composed of 164 places in 204 ms of which 1 ms to minimize.
[2022-05-17 18:46:27] [INFO ] Deduced a trap composed of 166 places in 195 ms of which 1 ms to minimize.
[2022-05-17 18:46:27] [INFO ] Deduced a trap composed of 160 places in 196 ms of which 0 ms to minimize.
[2022-05-17 18:46:28] [INFO ] Deduced a trap composed of 162 places in 195 ms of which 0 ms to minimize.
[2022-05-17 18:46:28] [INFO ] Deduced a trap composed of 170 places in 193 ms of which 0 ms to minimize.
[2022-05-17 18:46:30] [INFO ] Deduced a trap composed of 162 places in 205 ms of which 0 ms to minimize.
[2022-05-17 18:46:32] [INFO ] Deduced a trap composed of 169 places in 201 ms of which 0 ms to minimize.
[2022-05-17 18:46:41] [INFO ] Trap strengthening (SAT) tested/added 95/95 trap constraints in 41761 ms
[2022-05-17 18:46:41] [INFO ] After 42090ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2022-05-17 18:46:41] [INFO ] After 42453ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Incomplete random walk after 1000000 steps, including 72654 resets, run finished after 9101 ms. (steps per millisecond=109 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 9698 resets, run finished after 1684 ms. (steps per millisecond=593 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 5682684 steps, run timeout after 30001 ms. (steps per millisecond=189 ) properties seen :{}
Probabilistic random walk after 5682684 steps, saw 985393 distinct states, run finished after 30001 ms. (steps per millisecond=189 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-17 18:47:22] [INFO ] Flow matrix only has 972 transitions (discarded 9 similar events)
// Phase 1: matrix 972 rows 410 cols
[2022-05-17 18:47:22] [INFO ] Computed 62 place invariants in 18 ms
[2022-05-17 18:47:22] [INFO ] [Real]Absence check using 55 positive place invariants in 18 ms returned sat
[2022-05-17 18:47:22] [INFO ] [Real]Absence check using 55 positive and 7 generalized place invariants in 8 ms returned sat
[2022-05-17 18:47:22] [INFO ] After 92ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 18:47:22] [INFO ] [Nat]Absence check using 55 positive place invariants in 10 ms returned sat
[2022-05-17 18:47:22] [INFO ] [Nat]Absence check using 55 positive and 7 generalized place invariants in 8 ms returned sat
[2022-05-17 18:47:23] [INFO ] After 289ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 18:47:23] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-17 18:47:23] [INFO ] After 69ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 18:47:23] [INFO ] Deduced a trap composed of 177 places in 203 ms of which 0 ms to minimize.
[2022-05-17 18:47:23] [INFO ] Deduced a trap composed of 162 places in 210 ms of which 1 ms to minimize.
[2022-05-17 18:47:23] [INFO ] Deduced a trap composed of 166 places in 205 ms of which 0 ms to minimize.
[2022-05-17 18:47:24] [INFO ] Deduced a trap composed of 168 places in 199 ms of which 0 ms to minimize.
[2022-05-17 18:47:24] [INFO ] Deduced a trap composed of 166 places in 196 ms of which 0 ms to minimize.
[2022-05-17 18:47:24] [INFO ] Deduced a trap composed of 160 places in 195 ms of which 1 ms to minimize.
[2022-05-17 18:47:24] [INFO ] Deduced a trap composed of 166 places in 199 ms of which 0 ms to minimize.
[2022-05-17 18:47:25] [INFO ] Deduced a trap composed of 168 places in 201 ms of which 1 ms to minimize.
[2022-05-17 18:47:25] [INFO ] Deduced a trap composed of 164 places in 202 ms of which 0 ms to minimize.
[2022-05-17 18:47:25] [INFO ] Deduced a trap composed of 164 places in 205 ms of which 0 ms to minimize.
[2022-05-17 18:47:25] [INFO ] Deduced a trap composed of 170 places in 207 ms of which 1 ms to minimize.
[2022-05-17 18:47:26] [INFO ] Deduced a trap composed of 166 places in 204 ms of which 1 ms to minimize.
[2022-05-17 18:47:26] [INFO ] Deduced a trap composed of 158 places in 204 ms of which 0 ms to minimize.
[2022-05-17 18:47:26] [INFO ] Deduced a trap composed of 164 places in 211 ms of which 1 ms to minimize.
[2022-05-17 18:47:27] [INFO ] Deduced a trap composed of 164 places in 205 ms of which 0 ms to minimize.
[2022-05-17 18:47:27] [INFO ] Deduced a trap composed of 179 places in 210 ms of which 1 ms to minimize.
[2022-05-17 18:47:27] [INFO ] Deduced a trap composed of 173 places in 204 ms of which 0 ms to minimize.
[2022-05-17 18:47:27] [INFO ] Deduced a trap composed of 160 places in 196 ms of which 1 ms to minimize.
[2022-05-17 18:47:28] [INFO ] Deduced a trap composed of 164 places in 193 ms of which 1 ms to minimize.
[2022-05-17 18:47:28] [INFO ] Deduced a trap composed of 160 places in 196 ms of which 1 ms to minimize.
[2022-05-17 18:47:28] [INFO ] Deduced a trap composed of 164 places in 196 ms of which 0 ms to minimize.
[2022-05-17 18:47:28] [INFO ] Deduced a trap composed of 160 places in 196 ms of which 0 ms to minimize.
[2022-05-17 18:47:29] [INFO ] Deduced a trap composed of 162 places in 197 ms of which 1 ms to minimize.
[2022-05-17 18:47:29] [INFO ] Deduced a trap composed of 160 places in 196 ms of which 0 ms to minimize.
[2022-05-17 18:47:29] [INFO ] Deduced a trap composed of 164 places in 195 ms of which 0 ms to minimize.
[2022-05-17 18:47:29] [INFO ] Deduced a trap composed of 175 places in 205 ms of which 0 ms to minimize.
[2022-05-17 18:47:30] [INFO ] Deduced a trap composed of 162 places in 195 ms of which 1 ms to minimize.
[2022-05-17 18:47:30] [INFO ] Deduced a trap composed of 158 places in 195 ms of which 1 ms to minimize.
[2022-05-17 18:47:30] [INFO ] Deduced a trap composed of 156 places in 200 ms of which 0 ms to minimize.
[2022-05-17 18:47:30] [INFO ] Deduced a trap composed of 162 places in 196 ms of which 1 ms to minimize.
[2022-05-17 18:47:31] [INFO ] Deduced a trap composed of 164 places in 197 ms of which 0 ms to minimize.
[2022-05-17 18:47:31] [INFO ] Deduced a trap composed of 160 places in 200 ms of which 0 ms to minimize.
[2022-05-17 18:47:31] [INFO ] Deduced a trap composed of 170 places in 197 ms of which 0 ms to minimize.
[2022-05-17 18:47:32] [INFO ] Deduced a trap composed of 162 places in 198 ms of which 0 ms to minimize.
[2022-05-17 18:47:32] [INFO ] Deduced a trap composed of 168 places in 199 ms of which 0 ms to minimize.
[2022-05-17 18:47:32] [INFO ] Deduced a trap composed of 158 places in 197 ms of which 0 ms to minimize.
[2022-05-17 18:47:32] [INFO ] Deduced a trap composed of 164 places in 202 ms of which 0 ms to minimize.
[2022-05-17 18:47:33] [INFO ] Deduced a trap composed of 162 places in 201 ms of which 0 ms to minimize.
[2022-05-17 18:47:33] [INFO ] Deduced a trap composed of 162 places in 197 ms of which 1 ms to minimize.
[2022-05-17 18:47:33] [INFO ] Deduced a trap composed of 166 places in 200 ms of which 1 ms to minimize.
[2022-05-17 18:47:33] [INFO ] Deduced a trap composed of 162 places in 198 ms of which 0 ms to minimize.
[2022-05-17 18:47:34] [INFO ] Deduced a trap composed of 160 places in 194 ms of which 0 ms to minimize.
[2022-05-17 18:47:34] [INFO ] Deduced a trap composed of 166 places in 201 ms of which 1 ms to minimize.
[2022-05-17 18:47:34] [INFO ] Deduced a trap composed of 164 places in 201 ms of which 1 ms to minimize.
[2022-05-17 18:47:34] [INFO ] Deduced a trap composed of 156 places in 199 ms of which 0 ms to minimize.
[2022-05-17 18:47:35] [INFO ] Deduced a trap composed of 158 places in 198 ms of which 0 ms to minimize.
[2022-05-17 18:47:35] [INFO ] Deduced a trap composed of 168 places in 202 ms of which 0 ms to minimize.
[2022-05-17 18:47:35] [INFO ] Deduced a trap composed of 164 places in 202 ms of which 1 ms to minimize.
[2022-05-17 18:47:35] [INFO ] Deduced a trap composed of 171 places in 218 ms of which 0 ms to minimize.
[2022-05-17 18:47:36] [INFO ] Deduced a trap composed of 168 places in 194 ms of which 1 ms to minimize.
[2022-05-17 18:47:36] [INFO ] Deduced a trap composed of 166 places in 198 ms of which 1 ms to minimize.
[2022-05-17 18:47:36] [INFO ] Deduced a trap composed of 162 places in 195 ms of which 0 ms to minimize.
[2022-05-17 18:47:37] [INFO ] Deduced a trap composed of 160 places in 200 ms of which 1 ms to minimize.
[2022-05-17 18:47:37] [INFO ] Deduced a trap composed of 164 places in 198 ms of which 0 ms to minimize.
[2022-05-17 18:47:37] [INFO ] Deduced a trap composed of 162 places in 198 ms of which 1 ms to minimize.
[2022-05-17 18:47:38] [INFO ] Deduced a trap composed of 162 places in 205 ms of which 0 ms to minimize.
[2022-05-17 18:47:38] [INFO ] Deduced a trap composed of 158 places in 205 ms of which 0 ms to minimize.
[2022-05-17 18:47:38] [INFO ] Deduced a trap composed of 156 places in 202 ms of which 0 ms to minimize.
[2022-05-17 18:47:39] [INFO ] Deduced a trap composed of 154 places in 204 ms of which 0 ms to minimize.
[2022-05-17 18:47:39] [INFO ] Deduced a trap composed of 166 places in 207 ms of which 0 ms to minimize.
[2022-05-17 18:47:39] [INFO ] Deduced a trap composed of 170 places in 199 ms of which 1 ms to minimize.
[2022-05-17 18:47:39] [INFO ] Deduced a trap composed of 162 places in 199 ms of which 1 ms to minimize.
[2022-05-17 18:47:40] [INFO ] Deduced a trap composed of 158 places in 203 ms of which 0 ms to minimize.
[2022-05-17 18:47:40] [INFO ] Deduced a trap composed of 158 places in 194 ms of which 1 ms to minimize.
[2022-05-17 18:47:40] [INFO ] Deduced a trap composed of 164 places in 191 ms of which 0 ms to minimize.
[2022-05-17 18:47:41] [INFO ] Deduced a trap composed of 164 places in 202 ms of which 0 ms to minimize.
[2022-05-17 18:47:41] [INFO ] Deduced a trap composed of 160 places in 203 ms of which 0 ms to minimize.
[2022-05-17 18:47:41] [INFO ] Deduced a trap composed of 160 places in 199 ms of which 0 ms to minimize.
[2022-05-17 18:47:42] [INFO ] Deduced a trap composed of 168 places in 209 ms of which 0 ms to minimize.
[2022-05-17 18:47:42] [INFO ] Deduced a trap composed of 158 places in 202 ms of which 0 ms to minimize.
[2022-05-17 18:47:42] [INFO ] Deduced a trap composed of 162 places in 199 ms of which 0 ms to minimize.
[2022-05-17 18:47:43] [INFO ] Deduced a trap composed of 156 places in 203 ms of which 1 ms to minimize.
[2022-05-17 18:47:43] [INFO ] Deduced a trap composed of 162 places in 204 ms of which 1 ms to minimize.
[2022-05-17 18:47:44] [INFO ] Deduced a trap composed of 162 places in 205 ms of which 0 ms to minimize.
[2022-05-17 18:47:44] [INFO ] Deduced a trap composed of 164 places in 206 ms of which 0 ms to minimize.
[2022-05-17 18:47:44] [INFO ] Deduced a trap composed of 156 places in 201 ms of which 0 ms to minimize.
[2022-05-17 18:47:45] [INFO ] Deduced a trap composed of 158 places in 208 ms of which 0 ms to minimize.
[2022-05-17 18:47:45] [INFO ] Deduced a trap composed of 158 places in 203 ms of which 1 ms to minimize.
[2022-05-17 18:47:45] [INFO ] Deduced a trap composed of 174 places in 205 ms of which 1 ms to minimize.
[2022-05-17 18:47:46] [INFO ] Deduced a trap composed of 158 places in 196 ms of which 1 ms to minimize.
[2022-05-17 18:47:46] [INFO ] Deduced a trap composed of 164 places in 203 ms of which 0 ms to minimize.
[2022-05-17 18:47:46] [INFO ] Deduced a trap composed of 160 places in 211 ms of which 1 ms to minimize.
[2022-05-17 18:47:47] [INFO ] Deduced a trap composed of 154 places in 199 ms of which 1 ms to minimize.
[2022-05-17 18:47:47] [INFO ] Deduced a trap composed of 158 places in 211 ms of which 1 ms to minimize.
[2022-05-17 18:47:49] [INFO ] Deduced a trap composed of 168 places in 200 ms of which 0 ms to minimize.
[2022-05-17 18:47:50] [INFO ] Deduced a trap composed of 158 places in 195 ms of which 1 ms to minimize.
[2022-05-17 18:47:50] [INFO ] Deduced a trap composed of 162 places in 198 ms of which 1 ms to minimize.
[2022-05-17 18:47:50] [INFO ] Deduced a trap composed of 158 places in 197 ms of which 0 ms to minimize.
[2022-05-17 18:47:50] [INFO ] Deduced a trap composed of 164 places in 193 ms of which 0 ms to minimize.
[2022-05-17 18:47:51] [INFO ] Deduced a trap composed of 166 places in 199 ms of which 0 ms to minimize.
[2022-05-17 18:47:51] [INFO ] Deduced a trap composed of 160 places in 209 ms of which 0 ms to minimize.
[2022-05-17 18:47:51] [INFO ] Deduced a trap composed of 162 places in 198 ms of which 0 ms to minimize.
[2022-05-17 18:47:52] [INFO ] Deduced a trap composed of 170 places in 196 ms of which 0 ms to minimize.
[2022-05-17 18:47:53] [INFO ] Deduced a trap composed of 162 places in 202 ms of which 1 ms to minimize.
[2022-05-17 18:47:56] [INFO ] Deduced a trap composed of 169 places in 206 ms of which 0 ms to minimize.
[2022-05-17 18:48:05] [INFO ] Trap strengthening (SAT) tested/added 95/95 trap constraints in 41850 ms
[2022-05-17 18:48:05] [INFO ] After 42028ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2022-05-17 18:48:05] [INFO ] After 42395ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 15 ms.
Support contains 1 out of 410 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 410/410 places, 981/981 transitions.
Applied a total of 0 rules in 25 ms. Remains 410 /410 variables (removed 0) and now considering 981/981 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 410/410 places, 981/981 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 410/410 places, 981/981 transitions.
Applied a total of 0 rules in 25 ms. Remains 410 /410 variables (removed 0) and now considering 981/981 (removed 0) transitions.
[2022-05-17 18:48:05] [INFO ] Flow matrix only has 972 transitions (discarded 9 similar events)
// Phase 1: matrix 972 rows 410 cols
[2022-05-17 18:48:05] [INFO ] Computed 62 place invariants in 14 ms
[2022-05-17 18:48:05] [INFO ] Implicit Places using invariants in 310 ms returned []
[2022-05-17 18:48:05] [INFO ] Flow matrix only has 972 transitions (discarded 9 similar events)
// Phase 1: matrix 972 rows 410 cols
[2022-05-17 18:48:05] [INFO ] Computed 62 place invariants in 15 ms
[2022-05-17 18:48:05] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-17 18:48:07] [INFO ] Implicit Places using invariants and state equation in 1763 ms returned []
Implicit Place search using SMT with State Equation took 2077 ms to find 0 implicit places.
[2022-05-17 18:48:07] [INFO ] Redundant transitions in 17 ms returned []
[2022-05-17 18:48:07] [INFO ] Flow matrix only has 972 transitions (discarded 9 similar events)
// Phase 1: matrix 972 rows 410 cols
[2022-05-17 18:48:07] [INFO ] Computed 62 place invariants in 14 ms
[2022-05-17 18:48:07] [INFO ] Dead Transitions using invariants and state equation in 380 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 410/410 places, 981/981 transitions.
Incomplete random walk after 100000 steps, including 7253 resets, run finished after 925 ms. (steps per millisecond=108 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2022-05-17 18:48:08] [INFO ] Flow matrix only has 972 transitions (discarded 9 similar events)
// Phase 1: matrix 972 rows 410 cols
[2022-05-17 18:48:08] [INFO ] Computed 62 place invariants in 14 ms
[2022-05-17 18:48:08] [INFO ] [Real]Absence check using 55 positive place invariants in 11 ms returned sat
[2022-05-17 18:48:08] [INFO ] [Real]Absence check using 55 positive and 7 generalized place invariants in 9 ms returned sat
[2022-05-17 18:48:08] [INFO ] After 83ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 18:48:08] [INFO ] [Nat]Absence check using 55 positive place invariants in 9 ms returned sat
[2022-05-17 18:48:08] [INFO ] [Nat]Absence check using 55 positive and 7 generalized place invariants in 8 ms returned sat
[2022-05-17 18:48:09] [INFO ] After 286ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 18:48:09] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-17 18:48:09] [INFO ] After 65ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 18:48:09] [INFO ] Deduced a trap composed of 177 places in 209 ms of which 0 ms to minimize.
[2022-05-17 18:48:09] [INFO ] Deduced a trap composed of 162 places in 209 ms of which 1 ms to minimize.
[2022-05-17 18:48:09] [INFO ] Deduced a trap composed of 166 places in 200 ms of which 1 ms to minimize.
[2022-05-17 18:48:10] [INFO ] Deduced a trap composed of 168 places in 203 ms of which 0 ms to minimize.
[2022-05-17 18:48:10] [INFO ] Deduced a trap composed of 166 places in 205 ms of which 0 ms to minimize.
[2022-05-17 18:48:10] [INFO ] Deduced a trap composed of 160 places in 205 ms of which 1 ms to minimize.
[2022-05-17 18:48:10] [INFO ] Deduced a trap composed of 166 places in 203 ms of which 1 ms to minimize.
[2022-05-17 18:48:11] [INFO ] Deduced a trap composed of 168 places in 204 ms of which 1 ms to minimize.
[2022-05-17 18:48:11] [INFO ] Deduced a trap composed of 164 places in 210 ms of which 1 ms to minimize.
[2022-05-17 18:48:11] [INFO ] Deduced a trap composed of 164 places in 205 ms of which 1 ms to minimize.
[2022-05-17 18:48:11] [INFO ] Deduced a trap composed of 170 places in 207 ms of which 1 ms to minimize.
[2022-05-17 18:48:12] [INFO ] Deduced a trap composed of 166 places in 204 ms of which 0 ms to minimize.
[2022-05-17 18:48:12] [INFO ] Deduced a trap composed of 158 places in 204 ms of which 1 ms to minimize.
[2022-05-17 18:48:12] [INFO ] Deduced a trap composed of 164 places in 204 ms of which 0 ms to minimize.
[2022-05-17 18:48:13] [INFO ] Deduced a trap composed of 164 places in 206 ms of which 0 ms to minimize.
[2022-05-17 18:48:13] [INFO ] Deduced a trap composed of 179 places in 209 ms of which 0 ms to minimize.
[2022-05-17 18:48:13] [INFO ] Deduced a trap composed of 173 places in 213 ms of which 0 ms to minimize.
[2022-05-17 18:48:13] [INFO ] Deduced a trap composed of 160 places in 199 ms of which 1 ms to minimize.
[2022-05-17 18:48:14] [INFO ] Deduced a trap composed of 164 places in 198 ms of which 0 ms to minimize.
[2022-05-17 18:48:14] [INFO ] Deduced a trap composed of 160 places in 197 ms of which 1 ms to minimize.
[2022-05-17 18:48:14] [INFO ] Deduced a trap composed of 164 places in 196 ms of which 0 ms to minimize.
[2022-05-17 18:48:14] [INFO ] Deduced a trap composed of 160 places in 199 ms of which 1 ms to minimize.
[2022-05-17 18:48:15] [INFO ] Deduced a trap composed of 162 places in 196 ms of which 1 ms to minimize.
[2022-05-17 18:48:15] [INFO ] Deduced a trap composed of 160 places in 199 ms of which 0 ms to minimize.
[2022-05-17 18:48:15] [INFO ] Deduced a trap composed of 164 places in 194 ms of which 0 ms to minimize.
[2022-05-17 18:48:15] [INFO ] Deduced a trap composed of 175 places in 195 ms of which 1 ms to minimize.
[2022-05-17 18:48:16] [INFO ] Deduced a trap composed of 162 places in 199 ms of which 1 ms to minimize.
[2022-05-17 18:48:16] [INFO ] Deduced a trap composed of 158 places in 196 ms of which 0 ms to minimize.
[2022-05-17 18:48:16] [INFO ] Deduced a trap composed of 156 places in 188 ms of which 0 ms to minimize.
[2022-05-17 18:48:16] [INFO ] Deduced a trap composed of 162 places in 189 ms of which 0 ms to minimize.
[2022-05-17 18:48:17] [INFO ] Deduced a trap composed of 164 places in 198 ms of which 1 ms to minimize.
[2022-05-17 18:48:17] [INFO ] Deduced a trap composed of 160 places in 193 ms of which 1 ms to minimize.
[2022-05-17 18:48:17] [INFO ] Deduced a trap composed of 170 places in 199 ms of which 1 ms to minimize.
[2022-05-17 18:48:18] [INFO ] Deduced a trap composed of 162 places in 198 ms of which 0 ms to minimize.
[2022-05-17 18:48:18] [INFO ] Deduced a trap composed of 168 places in 202 ms of which 1 ms to minimize.
[2022-05-17 18:48:18] [INFO ] Deduced a trap composed of 158 places in 201 ms of which 0 ms to minimize.
[2022-05-17 18:48:18] [INFO ] Deduced a trap composed of 164 places in 201 ms of which 0 ms to minimize.
[2022-05-17 18:48:19] [INFO ] Deduced a trap composed of 162 places in 204 ms of which 0 ms to minimize.
[2022-05-17 18:48:19] [INFO ] Deduced a trap composed of 162 places in 212 ms of which 1 ms to minimize.
[2022-05-17 18:48:19] [INFO ] Deduced a trap composed of 166 places in 194 ms of which 0 ms to minimize.
[2022-05-17 18:48:19] [INFO ] Deduced a trap composed of 162 places in 198 ms of which 0 ms to minimize.
[2022-05-17 18:48:20] [INFO ] Deduced a trap composed of 160 places in 202 ms of which 0 ms to minimize.
[2022-05-17 18:48:20] [INFO ] Deduced a trap composed of 166 places in 197 ms of which 1 ms to minimize.
[2022-05-17 18:48:20] [INFO ] Deduced a trap composed of 164 places in 200 ms of which 1 ms to minimize.
[2022-05-17 18:48:20] [INFO ] Deduced a trap composed of 156 places in 202 ms of which 1 ms to minimize.
[2022-05-17 18:48:21] [INFO ] Deduced a trap composed of 158 places in 205 ms of which 1 ms to minimize.
[2022-05-17 18:48:21] [INFO ] Deduced a trap composed of 168 places in 195 ms of which 1 ms to minimize.
[2022-05-17 18:48:21] [INFO ] Deduced a trap composed of 164 places in 202 ms of which 0 ms to minimize.
[2022-05-17 18:48:21] [INFO ] Deduced a trap composed of 171 places in 202 ms of which 0 ms to minimize.
[2022-05-17 18:48:22] [INFO ] Deduced a trap composed of 168 places in 201 ms of which 0 ms to minimize.
[2022-05-17 18:48:22] [INFO ] Deduced a trap composed of 166 places in 197 ms of which 1 ms to minimize.
[2022-05-17 18:48:22] [INFO ] Deduced a trap composed of 162 places in 201 ms of which 1 ms to minimize.
[2022-05-17 18:48:23] [INFO ] Deduced a trap composed of 160 places in 203 ms of which 0 ms to minimize.
[2022-05-17 18:48:23] [INFO ] Deduced a trap composed of 164 places in 197 ms of which 0 ms to minimize.
[2022-05-17 18:48:23] [INFO ] Deduced a trap composed of 162 places in 201 ms of which 0 ms to minimize.
[2022-05-17 18:48:24] [INFO ] Deduced a trap composed of 162 places in 203 ms of which 0 ms to minimize.
[2022-05-17 18:48:24] [INFO ] Deduced a trap composed of 158 places in 198 ms of which 0 ms to minimize.
[2022-05-17 18:48:24] [INFO ] Deduced a trap composed of 156 places in 202 ms of which 1 ms to minimize.
[2022-05-17 18:48:25] [INFO ] Deduced a trap composed of 154 places in 200 ms of which 0 ms to minimize.
[2022-05-17 18:48:25] [INFO ] Deduced a trap composed of 166 places in 206 ms of which 1 ms to minimize.
[2022-05-17 18:48:25] [INFO ] Deduced a trap composed of 170 places in 204 ms of which 0 ms to minimize.
[2022-05-17 18:48:25] [INFO ] Deduced a trap composed of 162 places in 197 ms of which 0 ms to minimize.
[2022-05-17 18:48:26] [INFO ] Deduced a trap composed of 158 places in 203 ms of which 1 ms to minimize.
[2022-05-17 18:48:26] [INFO ] Deduced a trap composed of 158 places in 205 ms of which 0 ms to minimize.
[2022-05-17 18:48:26] [INFO ] Deduced a trap composed of 164 places in 204 ms of which 1 ms to minimize.
[2022-05-17 18:48:27] [INFO ] Deduced a trap composed of 164 places in 198 ms of which 0 ms to minimize.
[2022-05-17 18:48:27] [INFO ] Deduced a trap composed of 160 places in 197 ms of which 1 ms to minimize.
[2022-05-17 18:48:27] [INFO ] Deduced a trap composed of 160 places in 202 ms of which 0 ms to minimize.
[2022-05-17 18:48:28] [INFO ] Deduced a trap composed of 168 places in 213 ms of which 1 ms to minimize.
[2022-05-17 18:48:28] [INFO ] Deduced a trap composed of 158 places in 205 ms of which 0 ms to minimize.
[2022-05-17 18:48:28] [INFO ] Deduced a trap composed of 162 places in 192 ms of which 1 ms to minimize.
[2022-05-17 18:48:29] [INFO ] Deduced a trap composed of 156 places in 202 ms of which 0 ms to minimize.
[2022-05-17 18:48:29] [INFO ] Deduced a trap composed of 162 places in 197 ms of which 0 ms to minimize.
[2022-05-17 18:48:30] [INFO ] Deduced a trap composed of 162 places in 208 ms of which 0 ms to minimize.
[2022-05-17 18:48:30] [INFO ] Deduced a trap composed of 164 places in 196 ms of which 1 ms to minimize.
[2022-05-17 18:48:30] [INFO ] Deduced a trap composed of 156 places in 201 ms of which 0 ms to minimize.
[2022-05-17 18:48:31] [INFO ] Deduced a trap composed of 158 places in 201 ms of which 0 ms to minimize.
[2022-05-17 18:48:31] [INFO ] Deduced a trap composed of 158 places in 203 ms of which 0 ms to minimize.
[2022-05-17 18:48:31] [INFO ] Deduced a trap composed of 174 places in 192 ms of which 0 ms to minimize.
[2022-05-17 18:48:32] [INFO ] Deduced a trap composed of 158 places in 204 ms of which 1 ms to minimize.
[2022-05-17 18:48:32] [INFO ] Deduced a trap composed of 164 places in 192 ms of which 0 ms to minimize.
[2022-05-17 18:48:32] [INFO ] Deduced a trap composed of 160 places in 198 ms of which 1 ms to minimize.
[2022-05-17 18:48:33] [INFO ] Deduced a trap composed of 154 places in 204 ms of which 0 ms to minimize.
[2022-05-17 18:48:33] [INFO ] Deduced a trap composed of 158 places in 200 ms of which 0 ms to minimize.
[2022-05-17 18:48:35] [INFO ] Deduced a trap composed of 168 places in 205 ms of which 0 ms to minimize.
[2022-05-17 18:48:35] [INFO ] Deduced a trap composed of 158 places in 202 ms of which 0 ms to minimize.
[2022-05-17 18:48:36] [INFO ] Deduced a trap composed of 162 places in 195 ms of which 0 ms to minimize.
[2022-05-17 18:48:36] [INFO ] Deduced a trap composed of 158 places in 193 ms of which 1 ms to minimize.
[2022-05-17 18:48:36] [INFO ] Deduced a trap composed of 164 places in 195 ms of which 0 ms to minimize.
[2022-05-17 18:48:36] [INFO ] Deduced a trap composed of 166 places in 196 ms of which 0 ms to minimize.
[2022-05-17 18:48:37] [INFO ] Deduced a trap composed of 160 places in 199 ms of which 0 ms to minimize.
[2022-05-17 18:48:37] [INFO ] Deduced a trap composed of 162 places in 197 ms of which 0 ms to minimize.
[2022-05-17 18:48:38] [INFO ] Deduced a trap composed of 170 places in 198 ms of which 0 ms to minimize.
[2022-05-17 18:48:39] [INFO ] Deduced a trap composed of 162 places in 201 ms of which 1 ms to minimize.
[2022-05-17 18:48:41] [INFO ] Deduced a trap composed of 169 places in 211 ms of which 0 ms to minimize.
[2022-05-17 18:48:50] [INFO ] Trap strengthening (SAT) tested/added 95/95 trap constraints in 41688 ms
[2022-05-17 18:48:51] [INFO ] After 41877ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2022-05-17 18:48:51] [INFO ] After 42240ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Incomplete random walk after 10000 steps, including 724 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 98 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 532868 steps, run timeout after 3001 ms. (steps per millisecond=177 ) properties seen :{}
Probabilistic random walk after 532868 steps, saw 86695 distinct states, run finished after 3001 ms. (steps per millisecond=177 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-17 18:48:54] [INFO ] Flow matrix only has 972 transitions (discarded 9 similar events)
// Phase 1: matrix 972 rows 410 cols
[2022-05-17 18:48:54] [INFO ] Computed 62 place invariants in 17 ms
[2022-05-17 18:48:54] [INFO ] [Real]Absence check using 55 positive place invariants in 10 ms returned sat
[2022-05-17 18:48:54] [INFO ] [Real]Absence check using 55 positive and 7 generalized place invariants in 8 ms returned sat
[2022-05-17 18:48:54] [INFO ] After 77ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 18:48:54] [INFO ] [Nat]Absence check using 55 positive place invariants in 11 ms returned sat
[2022-05-17 18:48:54] [INFO ] [Nat]Absence check using 55 positive and 7 generalized place invariants in 9 ms returned sat
[2022-05-17 18:48:54] [INFO ] After 290ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 18:48:54] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-17 18:48:54] [INFO ] After 51ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 18:48:54] [INFO ] Deduced a trap composed of 175 places in 204 ms of which 1 ms to minimize.
[2022-05-17 18:48:55] [INFO ] Deduced a trap composed of 172 places in 203 ms of which 1 ms to minimize.
[2022-05-17 18:48:55] [INFO ] Deduced a trap composed of 170 places in 206 ms of which 1 ms to minimize.
[2022-05-17 18:48:55] [INFO ] Deduced a trap composed of 166 places in 212 ms of which 1 ms to minimize.
[2022-05-17 18:48:55] [INFO ] Deduced a trap composed of 162 places in 210 ms of which 0 ms to minimize.
[2022-05-17 18:48:56] [INFO ] Deduced a trap composed of 172 places in 204 ms of which 0 ms to minimize.
[2022-05-17 18:48:56] [INFO ] Deduced a trap composed of 158 places in 199 ms of which 1 ms to minimize.
[2022-05-17 18:48:56] [INFO ] Deduced a trap composed of 160 places in 204 ms of which 0 ms to minimize.
[2022-05-17 18:48:56] [INFO ] Deduced a trap composed of 158 places in 198 ms of which 1 ms to minimize.
[2022-05-17 18:48:57] [INFO ] Deduced a trap composed of 170 places in 204 ms of which 0 ms to minimize.
[2022-05-17 18:48:57] [INFO ] Deduced a trap composed of 164 places in 199 ms of which 1 ms to minimize.
[2022-05-17 18:48:57] [INFO ] Deduced a trap composed of 160 places in 199 ms of which 1 ms to minimize.
[2022-05-17 18:48:57] [INFO ] Deduced a trap composed of 160 places in 206 ms of which 0 ms to minimize.
[2022-05-17 18:48:58] [INFO ] Deduced a trap composed of 156 places in 198 ms of which 1 ms to minimize.
[2022-05-17 18:48:58] [INFO ] Deduced a trap composed of 160 places in 201 ms of which 1 ms to minimize.
[2022-05-17 18:48:58] [INFO ] Deduced a trap composed of 168 places in 199 ms of which 0 ms to minimize.
[2022-05-17 18:48:58] [INFO ] Deduced a trap composed of 160 places in 206 ms of which 1 ms to minimize.
[2022-05-17 18:48:59] [INFO ] Deduced a trap composed of 162 places in 199 ms of which 0 ms to minimize.
[2022-05-17 18:48:59] [INFO ] Deduced a trap composed of 156 places in 199 ms of which 0 ms to minimize.
[2022-05-17 18:48:59] [INFO ] Deduced a trap composed of 164 places in 216 ms of which 1 ms to minimize.
[2022-05-17 18:49:00] [INFO ] Deduced a trap composed of 158 places in 199 ms of which 1 ms to minimize.
[2022-05-17 18:49:00] [INFO ] Deduced a trap composed of 164 places in 198 ms of which 0 ms to minimize.
[2022-05-17 18:49:00] [INFO ] Deduced a trap composed of 160 places in 203 ms of which 1 ms to minimize.
[2022-05-17 18:49:00] [INFO ] Deduced a trap composed of 164 places in 192 ms of which 0 ms to minimize.
[2022-05-17 18:49:00] [INFO ] Deduced a trap composed of 162 places in 197 ms of which 0 ms to minimize.
[2022-05-17 18:49:01] [INFO ] Deduced a trap composed of 152 places in 201 ms of which 1 ms to minimize.
[2022-05-17 18:49:01] [INFO ] Deduced a trap composed of 168 places in 202 ms of which 0 ms to minimize.
[2022-05-17 18:49:01] [INFO ] Deduced a trap composed of 160 places in 203 ms of which 0 ms to minimize.
[2022-05-17 18:49:02] [INFO ] Deduced a trap composed of 162 places in 196 ms of which 0 ms to minimize.
[2022-05-17 18:49:02] [INFO ] Deduced a trap composed of 158 places in 201 ms of which 1 ms to minimize.
[2022-05-17 18:49:02] [INFO ] Deduced a trap composed of 160 places in 205 ms of which 0 ms to minimize.
[2022-05-17 18:49:03] [INFO ] Deduced a trap composed of 156 places in 196 ms of which 0 ms to minimize.
[2022-05-17 18:49:03] [INFO ] Deduced a trap composed of 160 places in 203 ms of which 1 ms to minimize.
[2022-05-17 18:49:03] [INFO ] Deduced a trap composed of 162 places in 201 ms of which 0 ms to minimize.
[2022-05-17 18:49:03] [INFO ] Deduced a trap composed of 168 places in 200 ms of which 0 ms to minimize.
[2022-05-17 18:49:04] [INFO ] Deduced a trap composed of 156 places in 199 ms of which 1 ms to minimize.
[2022-05-17 18:49:04] [INFO ] Deduced a trap composed of 160 places in 198 ms of which 0 ms to minimize.
[2022-05-17 18:49:04] [INFO ] Deduced a trap composed of 160 places in 195 ms of which 1 ms to minimize.
[2022-05-17 18:49:05] [INFO ] Deduced a trap composed of 160 places in 199 ms of which 1 ms to minimize.
[2022-05-17 18:49:05] [INFO ] Deduced a trap composed of 160 places in 200 ms of which 0 ms to minimize.
[2022-05-17 18:49:05] [INFO ] Deduced a trap composed of 164 places in 202 ms of which 0 ms to minimize.
[2022-05-17 18:49:05] [INFO ] Deduced a trap composed of 162 places in 197 ms of which 0 ms to minimize.
[2022-05-17 18:49:06] [INFO ] Deduced a trap composed of 168 places in 199 ms of which 0 ms to minimize.
[2022-05-17 18:49:06] [INFO ] Deduced a trap composed of 162 places in 200 ms of which 0 ms to minimize.
[2022-05-17 18:49:06] [INFO ] Deduced a trap composed of 162 places in 201 ms of which 0 ms to minimize.
[2022-05-17 18:49:06] [INFO ] Deduced a trap composed of 154 places in 201 ms of which 0 ms to minimize.
[2022-05-17 18:49:07] [INFO ] Deduced a trap composed of 164 places in 200 ms of which 0 ms to minimize.
[2022-05-17 18:49:07] [INFO ] Deduced a trap composed of 164 places in 200 ms of which 1 ms to minimize.
[2022-05-17 18:49:07] [INFO ] Deduced a trap composed of 164 places in 202 ms of which 0 ms to minimize.
[2022-05-17 18:49:07] [INFO ] Deduced a trap composed of 165 places in 204 ms of which 0 ms to minimize.
[2022-05-17 18:49:08] [INFO ] Deduced a trap composed of 164 places in 202 ms of which 0 ms to minimize.
[2022-05-17 18:49:08] [INFO ] Deduced a trap composed of 160 places in 202 ms of which 0 ms to minimize.
[2022-05-17 18:49:08] [INFO ] Deduced a trap composed of 165 places in 200 ms of which 0 ms to minimize.
[2022-05-17 18:49:09] [INFO ] Deduced a trap composed of 162 places in 201 ms of which 0 ms to minimize.
[2022-05-17 18:49:09] [INFO ] Deduced a trap composed of 158 places in 207 ms of which 1 ms to minimize.
[2022-05-17 18:49:09] [INFO ] Deduced a trap composed of 168 places in 199 ms of which 1 ms to minimize.
[2022-05-17 18:49:10] [INFO ] Deduced a trap composed of 166 places in 198 ms of which 1 ms to minimize.
[2022-05-17 18:49:10] [INFO ] Deduced a trap composed of 162 places in 205 ms of which 1 ms to minimize.
[2022-05-17 18:49:10] [INFO ] Deduced a trap composed of 162 places in 199 ms of which 0 ms to minimize.
[2022-05-17 18:49:11] [INFO ] Deduced a trap composed of 171 places in 204 ms of which 0 ms to minimize.
[2022-05-17 18:49:11] [INFO ] Deduced a trap composed of 158 places in 199 ms of which 0 ms to minimize.
[2022-05-17 18:49:11] [INFO ] Deduced a trap composed of 164 places in 197 ms of which 0 ms to minimize.
[2022-05-17 18:49:11] [INFO ] Deduced a trap composed of 160 places in 203 ms of which 0 ms to minimize.
[2022-05-17 18:49:12] [INFO ] Deduced a trap composed of 160 places in 205 ms of which 1 ms to minimize.
[2022-05-17 18:49:12] [INFO ] Deduced a trap composed of 164 places in 207 ms of which 0 ms to minimize.
[2022-05-17 18:49:12] [INFO ] Deduced a trap composed of 154 places in 194 ms of which 1 ms to minimize.
[2022-05-17 18:49:13] [INFO ] Deduced a trap composed of 164 places in 205 ms of which 0 ms to minimize.
[2022-05-17 18:49:13] [INFO ] Deduced a trap composed of 164 places in 207 ms of which 1 ms to minimize.
[2022-05-17 18:49:13] [INFO ] Deduced a trap composed of 156 places in 205 ms of which 0 ms to minimize.
[2022-05-17 18:49:14] [INFO ] Deduced a trap composed of 164 places in 200 ms of which 0 ms to minimize.
[2022-05-17 18:49:14] [INFO ] Deduced a trap composed of 164 places in 205 ms of which 0 ms to minimize.
[2022-05-17 18:49:14] [INFO ] Deduced a trap composed of 166 places in 199 ms of which 1 ms to minimize.
[2022-05-17 18:49:15] [INFO ] Deduced a trap composed of 160 places in 196 ms of which 0 ms to minimize.
[2022-05-17 18:49:15] [INFO ] Deduced a trap composed of 160 places in 206 ms of which 1 ms to minimize.
[2022-05-17 18:49:15] [INFO ] Deduced a trap composed of 158 places in 205 ms of which 0 ms to minimize.
[2022-05-17 18:49:16] [INFO ] Deduced a trap composed of 160 places in 201 ms of which 1 ms to minimize.
[2022-05-17 18:49:16] [INFO ] Deduced a trap composed of 168 places in 199 ms of which 1 ms to minimize.
[2022-05-17 18:49:16] [INFO ] Deduced a trap composed of 162 places in 201 ms of which 1 ms to minimize.
[2022-05-17 18:49:17] [INFO ] Deduced a trap composed of 160 places in 204 ms of which 0 ms to minimize.
[2022-05-17 18:49:17] [INFO ] Deduced a trap composed of 158 places in 193 ms of which 1 ms to minimize.
[2022-05-17 18:49:17] [INFO ] Deduced a trap composed of 158 places in 199 ms of which 0 ms to minimize.
[2022-05-17 18:49:18] [INFO ] Deduced a trap composed of 164 places in 201 ms of which 0 ms to minimize.
[2022-05-17 18:49:18] [INFO ] Deduced a trap composed of 168 places in 206 ms of which 0 ms to minimize.
[2022-05-17 18:49:19] [INFO ] Deduced a trap composed of 164 places in 203 ms of which 0 ms to minimize.
[2022-05-17 18:49:19] [INFO ] Deduced a trap composed of 160 places in 193 ms of which 0 ms to minimize.
[2022-05-17 18:49:19] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-17 18:49:19] [INFO ] After 25199ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 410 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 410/410 places, 981/981 transitions.
Applied a total of 0 rules in 17 ms. Remains 410 /410 variables (removed 0) and now considering 981/981 (removed 0) transitions.
[2022-05-17 18:49:19] [INFO ] Flow matrix only has 972 transitions (discarded 9 similar events)
// Phase 1: matrix 972 rows 410 cols
[2022-05-17 18:49:19] [INFO ] Computed 62 place invariants in 9 ms
[2022-05-17 18:49:19] [INFO ] Dead Transitions using invariants and state equation in 364 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 410/410 places, 981/981 transitions.
Incomplete random walk after 10000 steps, including 732 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 96 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 538454 steps, run timeout after 3001 ms. (steps per millisecond=179 ) properties seen :{}
Probabilistic random walk after 538454 steps, saw 87530 distinct states, run finished after 3001 ms. (steps per millisecond=179 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-17 18:49:23] [INFO ] Flow matrix only has 972 transitions (discarded 9 similar events)
// Phase 1: matrix 972 rows 410 cols
[2022-05-17 18:49:23] [INFO ] Computed 62 place invariants in 20 ms
[2022-05-17 18:49:23] [INFO ] [Real]Absence check using 55 positive place invariants in 11 ms returned sat
[2022-05-17 18:49:23] [INFO ] [Real]Absence check using 55 positive and 7 generalized place invariants in 8 ms returned sat
[2022-05-17 18:49:23] [INFO ] After 84ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 18:49:23] [INFO ] [Nat]Absence check using 55 positive place invariants in 10 ms returned sat
[2022-05-17 18:49:23] [INFO ] [Nat]Absence check using 55 positive and 7 generalized place invariants in 8 ms returned sat
[2022-05-17 18:49:23] [INFO ] After 282ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 18:49:23] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-17 18:49:23] [INFO ] After 49ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 18:49:23] [INFO ] Deduced a trap composed of 175 places in 199 ms of which 1 ms to minimize.
[2022-05-17 18:49:24] [INFO ] Deduced a trap composed of 172 places in 202 ms of which 0 ms to minimize.
[2022-05-17 18:49:24] [INFO ] Deduced a trap composed of 170 places in 203 ms of which 1 ms to minimize.
[2022-05-17 18:49:24] [INFO ] Deduced a trap composed of 166 places in 209 ms of which 0 ms to minimize.
[2022-05-17 18:49:24] [INFO ] Deduced a trap composed of 162 places in 206 ms of which 1 ms to minimize.
[2022-05-17 18:49:24] [INFO ] Deduced a trap composed of 172 places in 206 ms of which 0 ms to minimize.
[2022-05-17 18:49:25] [INFO ] Deduced a trap composed of 158 places in 201 ms of which 1 ms to minimize.
[2022-05-17 18:49:25] [INFO ] Deduced a trap composed of 160 places in 205 ms of which 0 ms to minimize.
[2022-05-17 18:49:25] [INFO ] Deduced a trap composed of 158 places in 217 ms of which 0 ms to minimize.
[2022-05-17 18:49:26] [INFO ] Deduced a trap composed of 170 places in 202 ms of which 0 ms to minimize.
[2022-05-17 18:49:26] [INFO ] Deduced a trap composed of 164 places in 198 ms of which 0 ms to minimize.
[2022-05-17 18:49:26] [INFO ] Deduced a trap composed of 160 places in 195 ms of which 1 ms to minimize.
[2022-05-17 18:49:26] [INFO ] Deduced a trap composed of 160 places in 197 ms of which 1 ms to minimize.
[2022-05-17 18:49:26] [INFO ] Deduced a trap composed of 156 places in 200 ms of which 1 ms to minimize.
[2022-05-17 18:49:27] [INFO ] Deduced a trap composed of 160 places in 199 ms of which 0 ms to minimize.
[2022-05-17 18:49:27] [INFO ] Deduced a trap composed of 168 places in 194 ms of which 0 ms to minimize.
[2022-05-17 18:49:27] [INFO ] Deduced a trap composed of 160 places in 197 ms of which 1 ms to minimize.
[2022-05-17 18:49:27] [INFO ] Deduced a trap composed of 162 places in 203 ms of which 1 ms to minimize.
[2022-05-17 18:49:28] [INFO ] Deduced a trap composed of 156 places in 203 ms of which 1 ms to minimize.
[2022-05-17 18:49:28] [INFO ] Deduced a trap composed of 164 places in 199 ms of which 0 ms to minimize.
[2022-05-17 18:49:28] [INFO ] Deduced a trap composed of 158 places in 198 ms of which 1 ms to minimize.
[2022-05-17 18:49:29] [INFO ] Deduced a trap composed of 164 places in 199 ms of which 1 ms to minimize.
[2022-05-17 18:49:29] [INFO ] Deduced a trap composed of 160 places in 194 ms of which 1 ms to minimize.
[2022-05-17 18:49:29] [INFO ] Deduced a trap composed of 164 places in 197 ms of which 0 ms to minimize.
[2022-05-17 18:49:29] [INFO ] Deduced a trap composed of 162 places in 203 ms of which 1 ms to minimize.
[2022-05-17 18:49:30] [INFO ] Deduced a trap composed of 152 places in 201 ms of which 0 ms to minimize.
[2022-05-17 18:49:30] [INFO ] Deduced a trap composed of 168 places in 197 ms of which 0 ms to minimize.
[2022-05-17 18:49:30] [INFO ] Deduced a trap composed of 160 places in 197 ms of which 0 ms to minimize.
[2022-05-17 18:49:31] [INFO ] Deduced a trap composed of 162 places in 204 ms of which 1 ms to minimize.
[2022-05-17 18:49:31] [INFO ] Deduced a trap composed of 158 places in 196 ms of which 1 ms to minimize.
[2022-05-17 18:49:31] [INFO ] Deduced a trap composed of 160 places in 195 ms of which 0 ms to minimize.
[2022-05-17 18:49:31] [INFO ] Deduced a trap composed of 156 places in 200 ms of which 0 ms to minimize.
[2022-05-17 18:49:32] [INFO ] Deduced a trap composed of 160 places in 202 ms of which 0 ms to minimize.
[2022-05-17 18:49:32] [INFO ] Deduced a trap composed of 162 places in 197 ms of which 0 ms to minimize.
[2022-05-17 18:49:32] [INFO ] Deduced a trap composed of 168 places in 199 ms of which 0 ms to minimize.
[2022-05-17 18:49:33] [INFO ] Deduced a trap composed of 156 places in 203 ms of which 1 ms to minimize.
[2022-05-17 18:49:33] [INFO ] Deduced a trap composed of 160 places in 198 ms of which 1 ms to minimize.
[2022-05-17 18:49:33] [INFO ] Deduced a trap composed of 160 places in 199 ms of which 0 ms to minimize.
[2022-05-17 18:49:33] [INFO ] Deduced a trap composed of 160 places in 194 ms of which 0 ms to minimize.
[2022-05-17 18:49:34] [INFO ] Deduced a trap composed of 160 places in 201 ms of which 0 ms to minimize.
[2022-05-17 18:49:34] [INFO ] Deduced a trap composed of 164 places in 197 ms of which 0 ms to minimize.
[2022-05-17 18:49:34] [INFO ] Deduced a trap composed of 162 places in 199 ms of which 1 ms to minimize.
[2022-05-17 18:49:34] [INFO ] Deduced a trap composed of 168 places in 202 ms of which 1 ms to minimize.
[2022-05-17 18:49:35] [INFO ] Deduced a trap composed of 162 places in 198 ms of which 0 ms to minimize.
[2022-05-17 18:49:35] [INFO ] Deduced a trap composed of 162 places in 199 ms of which 1 ms to minimize.
[2022-05-17 18:49:35] [INFO ] Deduced a trap composed of 154 places in 201 ms of which 1 ms to minimize.
[2022-05-17 18:49:35] [INFO ] Deduced a trap composed of 164 places in 198 ms of which 0 ms to minimize.
[2022-05-17 18:49:36] [INFO ] Deduced a trap composed of 164 places in 195 ms of which 0 ms to minimize.
[2022-05-17 18:49:36] [INFO ] Deduced a trap composed of 164 places in 200 ms of which 0 ms to minimize.
[2022-05-17 18:49:36] [INFO ] Deduced a trap composed of 165 places in 197 ms of which 1 ms to minimize.
[2022-05-17 18:49:36] [INFO ] Deduced a trap composed of 164 places in 199 ms of which 1 ms to minimize.
[2022-05-17 18:49:37] [INFO ] Deduced a trap composed of 160 places in 201 ms of which 0 ms to minimize.
[2022-05-17 18:49:37] [INFO ] Deduced a trap composed of 165 places in 206 ms of which 1 ms to minimize.
[2022-05-17 18:49:37] [INFO ] Deduced a trap composed of 162 places in 199 ms of which 0 ms to minimize.
[2022-05-17 18:49:38] [INFO ] Deduced a trap composed of 158 places in 198 ms of which 0 ms to minimize.
[2022-05-17 18:49:38] [INFO ] Deduced a trap composed of 168 places in 201 ms of which 1 ms to minimize.
[2022-05-17 18:49:38] [INFO ] Deduced a trap composed of 166 places in 199 ms of which 0 ms to minimize.
[2022-05-17 18:49:39] [INFO ] Deduced a trap composed of 162 places in 206 ms of which 1 ms to minimize.
[2022-05-17 18:49:39] [INFO ] Deduced a trap composed of 162 places in 204 ms of which 1 ms to minimize.
[2022-05-17 18:49:39] [INFO ] Deduced a trap composed of 171 places in 196 ms of which 0 ms to minimize.
[2022-05-17 18:49:40] [INFO ] Deduced a trap composed of 158 places in 201 ms of which 0 ms to minimize.
[2022-05-17 18:49:40] [INFO ] Deduced a trap composed of 164 places in 197 ms of which 0 ms to minimize.
[2022-05-17 18:49:40] [INFO ] Deduced a trap composed of 160 places in 195 ms of which 0 ms to minimize.
[2022-05-17 18:49:40] [INFO ] Deduced a trap composed of 160 places in 205 ms of which 0 ms to minimize.
[2022-05-17 18:49:41] [INFO ] Deduced a trap composed of 164 places in 198 ms of which 1 ms to minimize.
[2022-05-17 18:49:41] [INFO ] Deduced a trap composed of 154 places in 209 ms of which 0 ms to minimize.
[2022-05-17 18:49:41] [INFO ] Deduced a trap composed of 164 places in 203 ms of which 0 ms to minimize.
[2022-05-17 18:49:42] [INFO ] Deduced a trap composed of 164 places in 206 ms of which 0 ms to minimize.
[2022-05-17 18:49:42] [INFO ] Deduced a trap composed of 156 places in 202 ms of which 1 ms to minimize.
[2022-05-17 18:49:42] [INFO ] Deduced a trap composed of 164 places in 200 ms of which 0 ms to minimize.
[2022-05-17 18:49:43] [INFO ] Deduced a trap composed of 164 places in 200 ms of which 0 ms to minimize.
[2022-05-17 18:49:43] [INFO ] Deduced a trap composed of 166 places in 197 ms of which 1 ms to minimize.
[2022-05-17 18:49:43] [INFO ] Deduced a trap composed of 160 places in 206 ms of which 1 ms to minimize.
[2022-05-17 18:49:44] [INFO ] Deduced a trap composed of 160 places in 203 ms of which 1 ms to minimize.
[2022-05-17 18:49:44] [INFO ] Deduced a trap composed of 158 places in 198 ms of which 0 ms to minimize.
[2022-05-17 18:49:44] [INFO ] Deduced a trap composed of 160 places in 202 ms of which 0 ms to minimize.
[2022-05-17 18:49:45] [INFO ] Deduced a trap composed of 168 places in 205 ms of which 1 ms to minimize.
[2022-05-17 18:49:45] [INFO ] Deduced a trap composed of 162 places in 211 ms of which 0 ms to minimize.
[2022-05-17 18:49:45] [INFO ] Deduced a trap composed of 160 places in 196 ms of which 0 ms to minimize.
[2022-05-17 18:49:46] [INFO ] Deduced a trap composed of 158 places in 197 ms of which 0 ms to minimize.
[2022-05-17 18:49:46] [INFO ] Deduced a trap composed of 158 places in 204 ms of which 0 ms to minimize.
[2022-05-17 18:49:46] [INFO ] Deduced a trap composed of 164 places in 202 ms of which 0 ms to minimize.
[2022-05-17 18:49:47] [INFO ] Deduced a trap composed of 168 places in 204 ms of which 0 ms to minimize.
[2022-05-17 18:49:47] [INFO ] Deduced a trap composed of 164 places in 197 ms of which 0 ms to minimize.
[2022-05-17 18:49:48] [INFO ] Deduced a trap composed of 160 places in 193 ms of which 0 ms to minimize.
[2022-05-17 18:49:48] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-17 18:49:48] [INFO ] After 25099ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 410 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 410/410 places, 981/981 transitions.
Applied a total of 0 rules in 16 ms. Remains 410 /410 variables (removed 0) and now considering 981/981 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 410/410 places, 981/981 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 410/410 places, 981/981 transitions.
Applied a total of 0 rules in 16 ms. Remains 410 /410 variables (removed 0) and now considering 981/981 (removed 0) transitions.
[2022-05-17 18:49:48] [INFO ] Flow matrix only has 972 transitions (discarded 9 similar events)
// Phase 1: matrix 972 rows 410 cols
[2022-05-17 18:49:48] [INFO ] Computed 62 place invariants in 17 ms
[2022-05-17 18:49:48] [INFO ] Implicit Places using invariants in 324 ms returned []
[2022-05-17 18:49:48] [INFO ] Flow matrix only has 972 transitions (discarded 9 similar events)
// Phase 1: matrix 972 rows 410 cols
[2022-05-17 18:49:48] [INFO ] Computed 62 place invariants in 13 ms
[2022-05-17 18:49:48] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-17 18:49:50] [INFO ] Implicit Places using invariants and state equation in 1782 ms returned []
Implicit Place search using SMT with State Equation took 2107 ms to find 0 implicit places.
[2022-05-17 18:49:50] [INFO ] Redundant transitions in 13 ms returned []
[2022-05-17 18:49:50] [INFO ] Flow matrix only has 972 transitions (discarded 9 similar events)
// Phase 1: matrix 972 rows 410 cols
[2022-05-17 18:49:50] [INFO ] Computed 62 place invariants in 13 ms
[2022-05-17 18:49:50] [INFO ] Dead Transitions using invariants and state equation in 401 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 410/410 places, 981/981 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 410 transition count 972
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 9 place count 410 transition count 971
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 11 place count 409 transition count 971
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 409 transition count 970
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 13 place count 408 transition count 970
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 2 with 10 rules applied. Total rules applied 23 place count 408 transition count 960
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 33 place count 398 transition count 960
Applied a total of 33 rules in 82 ms. Remains 398 /410 variables (removed 12) and now considering 960/981 (removed 21) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 960 rows 398 cols
[2022-05-17 18:49:50] [INFO ] Computed 62 place invariants in 17 ms
[2022-05-17 18:49:50] [INFO ] [Real]Absence check using 55 positive place invariants in 10 ms returned sat
[2022-05-17 18:49:50] [INFO ] [Real]Absence check using 55 positive and 7 generalized place invariants in 8 ms returned sat
[2022-05-17 18:49:50] [INFO ] After 75ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 18:49:51] [INFO ] [Nat]Absence check using 55 positive place invariants in 10 ms returned sat
[2022-05-17 18:49:51] [INFO ] [Nat]Absence check using 55 positive and 7 generalized place invariants in 9 ms returned sat
[2022-05-17 18:49:51] [INFO ] After 223ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 18:49:51] [INFO ] Deduced a trap composed of 160 places in 180 ms of which 0 ms to minimize.
[2022-05-17 18:49:51] [INFO ] Deduced a trap composed of 162 places in 173 ms of which 0 ms to minimize.
[2022-05-17 18:49:51] [INFO ] Deduced a trap composed of 158 places in 176 ms of which 1 ms to minimize.
[2022-05-17 18:49:52] [INFO ] Deduced a trap composed of 160 places in 169 ms of which 1 ms to minimize.
[2022-05-17 18:49:52] [INFO ] Deduced a trap composed of 158 places in 170 ms of which 1 ms to minimize.
[2022-05-17 18:49:52] [INFO ] Deduced a trap composed of 158 places in 169 ms of which 1 ms to minimize.
[2022-05-17 18:49:52] [INFO ] Deduced a trap composed of 158 places in 170 ms of which 1 ms to minimize.
[2022-05-17 18:49:52] [INFO ] Deduced a trap composed of 154 places in 170 ms of which 0 ms to minimize.
[2022-05-17 18:49:53] [INFO ] Deduced a trap composed of 162 places in 177 ms of which 0 ms to minimize.
[2022-05-17 18:49:53] [INFO ] Deduced a trap composed of 164 places in 173 ms of which 0 ms to minimize.
[2022-05-17 18:49:53] [INFO ] Deduced a trap composed of 160 places in 175 ms of which 0 ms to minimize.
[2022-05-17 18:49:53] [INFO ] Deduced a trap composed of 156 places in 173 ms of which 0 ms to minimize.
[2022-05-17 18:49:53] [INFO ] Deduced a trap composed of 160 places in 174 ms of which 1 ms to minimize.
[2022-05-17 18:49:54] [INFO ] Deduced a trap composed of 156 places in 174 ms of which 0 ms to minimize.
[2022-05-17 18:49:54] [INFO ] Deduced a trap composed of 154 places in 170 ms of which 1 ms to minimize.
[2022-05-17 18:49:54] [INFO ] Deduced a trap composed of 158 places in 172 ms of which 0 ms to minimize.
[2022-05-17 18:49:54] [INFO ] Deduced a trap composed of 160 places in 164 ms of which 1 ms to minimize.
[2022-05-17 18:49:54] [INFO ] Deduced a trap composed of 158 places in 170 ms of which 1 ms to minimize.
[2022-05-17 18:49:55] [INFO ] Deduced a trap composed of 158 places in 171 ms of which 0 ms to minimize.
[2022-05-17 18:49:55] [INFO ] Deduced a trap composed of 160 places in 171 ms of which 0 ms to minimize.
[2022-05-17 18:49:55] [INFO ] Deduced a trap composed of 152 places in 171 ms of which 0 ms to minimize.
[2022-05-17 18:49:55] [INFO ] Deduced a trap composed of 160 places in 175 ms of which 0 ms to minimize.
[2022-05-17 18:49:55] [INFO ] Deduced a trap composed of 162 places in 182 ms of which 0 ms to minimize.
[2022-05-17 18:49:56] [INFO ] Deduced a trap composed of 154 places in 176 ms of which 1 ms to minimize.
[2022-05-17 18:49:56] [INFO ] Deduced a trap composed of 160 places in 172 ms of which 0 ms to minimize.
[2022-05-17 18:49:56] [INFO ] Deduced a trap composed of 156 places in 171 ms of which 0 ms to minimize.
[2022-05-17 18:49:56] [INFO ] Deduced a trap composed of 160 places in 166 ms of which 0 ms to minimize.
[2022-05-17 18:49:57] [INFO ] Deduced a trap composed of 158 places in 177 ms of which 0 ms to minimize.
[2022-05-17 18:49:57] [INFO ] Deduced a trap composed of 156 places in 170 ms of which 0 ms to minimize.
[2022-05-17 18:49:57] [INFO ] Deduced a trap composed of 160 places in 174 ms of which 1 ms to minimize.
[2022-05-17 18:49:57] [INFO ] Deduced a trap composed of 160 places in 172 ms of which 1 ms to minimize.
[2022-05-17 18:49:57] [INFO ] Deduced a trap composed of 156 places in 171 ms of which 0 ms to minimize.
[2022-05-17 18:49:58] [INFO ] Deduced a trap composed of 152 places in 173 ms of which 0 ms to minimize.
[2022-05-17 18:49:58] [INFO ] Deduced a trap composed of 158 places in 173 ms of which 1 ms to minimize.
[2022-05-17 18:49:58] [INFO ] Deduced a trap composed of 160 places in 174 ms of which 0 ms to minimize.
[2022-05-17 18:49:58] [INFO ] Deduced a trap composed of 160 places in 173 ms of which 0 ms to minimize.
[2022-05-17 18:49:58] [INFO ] Deduced a trap composed of 160 places in 179 ms of which 0 ms to minimize.
[2022-05-17 18:49:59] [INFO ] Deduced a trap composed of 158 places in 177 ms of which 0 ms to minimize.
[2022-05-17 18:49:59] [INFO ] Deduced a trap composed of 164 places in 178 ms of which 1 ms to minimize.
[2022-05-17 18:49:59] [INFO ] Deduced a trap composed of 164 places in 171 ms of which 1 ms to minimize.
[2022-05-17 18:49:59] [INFO ] Deduced a trap composed of 158 places in 181 ms of which 0 ms to minimize.
[2022-05-17 18:49:59] [INFO ] Deduced a trap composed of 160 places in 176 ms of which 1 ms to minimize.
[2022-05-17 18:50:00] [INFO ] Deduced a trap composed of 154 places in 171 ms of which 0 ms to minimize.
[2022-05-17 18:50:00] [INFO ] Deduced a trap composed of 160 places in 175 ms of which 0 ms to minimize.
[2022-05-17 18:50:00] [INFO ] Deduced a trap composed of 156 places in 174 ms of which 0 ms to minimize.
[2022-05-17 18:50:00] [INFO ] Deduced a trap composed of 158 places in 175 ms of which 0 ms to minimize.
[2022-05-17 18:50:01] [INFO ] Deduced a trap composed of 160 places in 175 ms of which 1 ms to minimize.
[2022-05-17 18:50:01] [INFO ] Deduced a trap composed of 156 places in 179 ms of which 0 ms to minimize.
[2022-05-17 18:50:01] [INFO ] Deduced a trap composed of 164 places in 170 ms of which 0 ms to minimize.
[2022-05-17 18:50:01] [INFO ] Deduced a trap composed of 158 places in 172 ms of which 1 ms to minimize.
[2022-05-17 18:50:02] [INFO ] Deduced a trap composed of 162 places in 172 ms of which 1 ms to minimize.
[2022-05-17 18:50:02] [INFO ] Deduced a trap composed of 160 places in 171 ms of which 0 ms to minimize.
[2022-05-17 18:50:02] [INFO ] Deduced a trap composed of 160 places in 170 ms of which 0 ms to minimize.
[2022-05-17 18:50:02] [INFO ] Deduced a trap composed of 158 places in 168 ms of which 1 ms to minimize.
[2022-05-17 18:50:03] [INFO ] Deduced a trap composed of 158 places in 169 ms of which 0 ms to minimize.
[2022-05-17 18:50:03] [INFO ] Deduced a trap composed of 164 places in 170 ms of which 1 ms to minimize.
[2022-05-17 18:50:03] [INFO ] Deduced a trap composed of 160 places in 168 ms of which 0 ms to minimize.
[2022-05-17 18:50:03] [INFO ] Deduced a trap composed of 156 places in 172 ms of which 0 ms to minimize.
[2022-05-17 18:50:03] [INFO ] Deduced a trap composed of 154 places in 168 ms of which 0 ms to minimize.
[2022-05-17 18:50:04] [INFO ] Deduced a trap composed of 156 places in 171 ms of which 1 ms to minimize.
[2022-05-17 18:50:04] [INFO ] Deduced a trap composed of 156 places in 174 ms of which 0 ms to minimize.
[2022-05-17 18:50:04] [INFO ] Deduced a trap composed of 160 places in 167 ms of which 1 ms to minimize.
[2022-05-17 18:50:04] [INFO ] Deduced a trap composed of 159 places in 168 ms of which 0 ms to minimize.
[2022-05-17 18:50:05] [INFO ] Deduced a trap composed of 160 places in 180 ms of which 1 ms to minimize.
[2022-05-17 18:50:05] [INFO ] Deduced a trap composed of 164 places in 175 ms of which 0 ms to minimize.
[2022-05-17 18:50:05] [INFO ] Deduced a trap composed of 166 places in 172 ms of which 1 ms to minimize.
[2022-05-17 18:50:05] [INFO ] Deduced a trap composed of 162 places in 174 ms of which 0 ms to minimize.
[2022-05-17 18:50:05] [INFO ] Deduced a trap composed of 164 places in 175 ms of which 0 ms to minimize.
[2022-05-17 18:50:06] [INFO ] Deduced a trap composed of 156 places in 174 ms of which 1 ms to minimize.
[2022-05-17 18:50:06] [INFO ] Deduced a trap composed of 162 places in 174 ms of which 1 ms to minimize.
[2022-05-17 18:50:06] [INFO ] Deduced a trap composed of 158 places in 169 ms of which 0 ms to minimize.
[2022-05-17 18:50:06] [INFO ] Deduced a trap composed of 164 places in 174 ms of which 1 ms to minimize.
[2022-05-17 18:50:06] [INFO ] Deduced a trap composed of 154 places in 174 ms of which 0 ms to minimize.
[2022-05-17 18:50:07] [INFO ] Deduced a trap composed of 164 places in 171 ms of which 0 ms to minimize.
[2022-05-17 18:50:07] [INFO ] Deduced a trap composed of 158 places in 168 ms of which 0 ms to minimize.
[2022-05-17 18:50:07] [INFO ] Deduced a trap composed of 160 places in 169 ms of which 1 ms to minimize.
[2022-05-17 18:50:07] [INFO ] Deduced a trap composed of 152 places in 173 ms of which 0 ms to minimize.
[2022-05-17 18:50:07] [INFO ] Deduced a trap composed of 162 places in 174 ms of which 0 ms to minimize.
[2022-05-17 18:50:08] [INFO ] Deduced a trap composed of 160 places in 174 ms of which 0 ms to minimize.
[2022-05-17 18:50:08] [INFO ] Deduced a trap composed of 160 places in 174 ms of which 0 ms to minimize.
[2022-05-17 18:50:08] [INFO ] Deduced a trap composed of 158 places in 172 ms of which 1 ms to minimize.
[2022-05-17 18:50:08] [INFO ] Deduced a trap composed of 156 places in 161 ms of which 0 ms to minimize.
[2022-05-17 18:50:08] [INFO ] Deduced a trap composed of 166 places in 170 ms of which 1 ms to minimize.
[2022-05-17 18:50:09] [INFO ] Deduced a trap composed of 166 places in 171 ms of which 1 ms to minimize.
[2022-05-17 18:50:09] [INFO ] Deduced a trap composed of 162 places in 170 ms of which 0 ms to minimize.
[2022-05-17 18:50:09] [INFO ] Deduced a trap composed of 158 places in 166 ms of which 1 ms to minimize.
[2022-05-17 18:50:09] [INFO ] Deduced a trap composed of 162 places in 176 ms of which 1 ms to minimize.
[2022-05-17 18:50:09] [INFO ] Deduced a trap composed of 162 places in 179 ms of which 0 ms to minimize.
[2022-05-17 18:50:10] [INFO ] Deduced a trap composed of 156 places in 177 ms of which 0 ms to minimize.
[2022-05-17 18:53:35] [INFO ] Trap strengthening (SAT) tested/added 89/89 trap constraints in 224704 ms
[2022-05-17 18:53:35] [INFO ] After 224935ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2022-05-17 18:53:35] [INFO ] After 225011ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
[2022-05-17 18:53:36] [INFO ] Flatten gal took : 157 ms
[2022-05-17 18:53:36] [INFO ] Flatten gal took : 120 ms
[2022-05-17 18:53:36] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10316755916000498729.gal : 26 ms
[2022-05-17 18:53:36] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3082731834494862723.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms17563594119242839876;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality10316755916000498729.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3082731834494862723.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...320
Loading property file /tmp/ReachabilityCardinality3082731834494862723.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 389
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :389 after 399
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :399 after 433
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :433 after 534
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :534 after 769
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :769 after 1262
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :1262 after 2760
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :2760 after 5148
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :5148 after 230782
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :230782 after 235888
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :235888 after 299019
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :299019 after 425613
Detected timeout of ITS tools.
[2022-05-17 18:53:51] [INFO ] Flatten gal took : 74 ms
[2022-05-17 18:53:51] [INFO ] Applying decomposition
[2022-05-17 18:53:51] [INFO ] Flatten gal took : 69 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph16509098090846344667.txt' '-o' '/tmp/graph16509098090846344667.bin' '-w' '/tmp/graph16509098090846344667.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph16509098090846344667.bin' '-l' '-1' '-v' '-w' '/tmp/graph16509098090846344667.weights' '-q' '0' '-e' '0.001'
[2022-05-17 18:53:51] [INFO ] Decomposing Gal with order
[2022-05-17 18:53:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 18:53:52] [INFO ] Removed a total of 3168 redundant transitions.
[2022-05-17 18:53:52] [INFO ] Flatten gal took : 258 ms
[2022-05-17 18:53:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 51 labels/synchronizations in 65 ms.
[2022-05-17 18:53:52] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14033243529993554640.gal : 15 ms
[2022-05-17 18:53:52] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4322297687177651392.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms17563594119242839876;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality14033243529993554640.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4322297687177651392.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...299
Loading property file /tmp/ReachabilityCardinality4322297687177651392.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :1 after 9369
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :9369 after 9369
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :9369 after 365932
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :365932 after 365932
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :365932 after 366487
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :366487 after 373282
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :373282 after 453072
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :453072 after 581147
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :581147 after 676817
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :676817 after 1.45013e+06
SDD proceeding with computation,1 properties remain. new max is 131072
SDD size :1.45013e+06 after 2.0855e+07
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin18261443979215027037
[2022-05-17 18:54:07] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18261443979215027037
Running compilation step : cd /tmp/ltsmin18261443979215027037;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1949 ms.
Running link step : cd /tmp/ltsmin18261443979215027037;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin18261443979215027037;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'AtomicProp==true'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 410 transition count 972
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 9 place count 410 transition count 971
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 11 place count 409 transition count 971
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 409 transition count 970
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 13 place count 408 transition count 970
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 2 with 10 rules applied. Total rules applied 23 place count 408 transition count 960
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 33 place count 398 transition count 960
Applied a total of 33 rules in 77 ms. Remains 398 /410 variables (removed 12) and now considering 960/981 (removed 21) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 960 rows 398 cols
[2022-05-17 18:54:22] [INFO ] Computed 62 place invariants in 8 ms
[2022-05-17 18:54:22] [INFO ] [Real]Absence check using 55 positive place invariants in 10 ms returned sat
[2022-05-17 18:54:22] [INFO ] [Real]Absence check using 55 positive and 7 generalized place invariants in 8 ms returned sat
[2022-05-17 18:54:22] [INFO ] After 90ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 18:54:22] [INFO ] [Nat]Absence check using 55 positive place invariants in 10 ms returned sat
[2022-05-17 18:54:22] [INFO ] [Nat]Absence check using 55 positive and 7 generalized place invariants in 9 ms returned sat
[2022-05-17 18:54:22] [INFO ] After 216ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 18:54:23] [INFO ] Deduced a trap composed of 160 places in 178 ms of which 0 ms to minimize.
[2022-05-17 18:54:23] [INFO ] Deduced a trap composed of 162 places in 171 ms of which 0 ms to minimize.
[2022-05-17 18:54:23] [INFO ] Deduced a trap composed of 158 places in 167 ms of which 0 ms to minimize.
[2022-05-17 18:54:23] [INFO ] Deduced a trap composed of 160 places in 164 ms of which 1 ms to minimize.
[2022-05-17 18:54:23] [INFO ] Deduced a trap composed of 158 places in 171 ms of which 1 ms to minimize.
[2022-05-17 18:54:24] [INFO ] Deduced a trap composed of 158 places in 170 ms of which 0 ms to minimize.
[2022-05-17 18:54:24] [INFO ] Deduced a trap composed of 158 places in 177 ms of which 1 ms to minimize.
[2022-05-17 18:54:24] [INFO ] Deduced a trap composed of 154 places in 173 ms of which 1 ms to minimize.
[2022-05-17 18:54:24] [INFO ] Deduced a trap composed of 162 places in 175 ms of which 1 ms to minimize.
[2022-05-17 18:54:24] [INFO ] Deduced a trap composed of 164 places in 174 ms of which 0 ms to minimize.
[2022-05-17 18:54:25] [INFO ] Deduced a trap composed of 160 places in 176 ms of which 0 ms to minimize.
[2022-05-17 18:54:25] [INFO ] Deduced a trap composed of 156 places in 171 ms of which 0 ms to minimize.
[2022-05-17 18:54:25] [INFO ] Deduced a trap composed of 160 places in 176 ms of which 1 ms to minimize.
[2022-05-17 18:54:25] [INFO ] Deduced a trap composed of 156 places in 169 ms of which 1 ms to minimize.
[2022-05-17 18:54:25] [INFO ] Deduced a trap composed of 154 places in 172 ms of which 1 ms to minimize.
[2022-05-17 18:54:26] [INFO ] Deduced a trap composed of 158 places in 168 ms of which 0 ms to minimize.
[2022-05-17 18:54:26] [INFO ] Deduced a trap composed of 160 places in 171 ms of which 0 ms to minimize.
[2022-05-17 18:54:26] [INFO ] Deduced a trap composed of 158 places in 171 ms of which 0 ms to minimize.
[2022-05-17 18:54:26] [INFO ] Deduced a trap composed of 158 places in 169 ms of which 0 ms to minimize.
[2022-05-17 18:54:26] [INFO ] Deduced a trap composed of 160 places in 177 ms of which 0 ms to minimize.
[2022-05-17 18:54:27] [INFO ] Deduced a trap composed of 152 places in 169 ms of which 0 ms to minimize.
[2022-05-17 18:54:27] [INFO ] Deduced a trap composed of 160 places in 170 ms of which 0 ms to minimize.
[2022-05-17 18:54:27] [INFO ] Deduced a trap composed of 162 places in 167 ms of which 1 ms to minimize.
[2022-05-17 18:54:27] [INFO ] Deduced a trap composed of 154 places in 172 ms of which 0 ms to minimize.
[2022-05-17 18:54:28] [INFO ] Deduced a trap composed of 160 places in 171 ms of which 0 ms to minimize.
[2022-05-17 18:54:28] [INFO ] Deduced a trap composed of 156 places in 169 ms of which 0 ms to minimize.
[2022-05-17 18:54:28] [INFO ] Deduced a trap composed of 160 places in 170 ms of which 1 ms to minimize.
[2022-05-17 18:54:28] [INFO ] Deduced a trap composed of 158 places in 171 ms of which 0 ms to minimize.
[2022-05-17 18:54:28] [INFO ] Deduced a trap composed of 156 places in 173 ms of which 0 ms to minimize.
[2022-05-17 18:54:29] [INFO ] Deduced a trap composed of 160 places in 177 ms of which 0 ms to minimize.
[2022-05-17 18:54:29] [INFO ] Deduced a trap composed of 160 places in 172 ms of which 1 ms to minimize.
[2022-05-17 18:54:29] [INFO ] Deduced a trap composed of 156 places in 169 ms of which 1 ms to minimize.
[2022-05-17 18:54:29] [INFO ] Deduced a trap composed of 152 places in 168 ms of which 1 ms to minimize.
[2022-05-17 18:54:29] [INFO ] Deduced a trap composed of 158 places in 193 ms of which 0 ms to minimize.
[2022-05-17 18:54:30] [INFO ] Deduced a trap composed of 160 places in 172 ms of which 0 ms to minimize.
[2022-05-17 18:54:30] [INFO ] Deduced a trap composed of 160 places in 170 ms of which 1 ms to minimize.
[2022-05-17 18:54:30] [INFO ] Deduced a trap composed of 160 places in 172 ms of which 1 ms to minimize.
[2022-05-17 18:54:30] [INFO ] Deduced a trap composed of 158 places in 176 ms of which 0 ms to minimize.
[2022-05-17 18:54:30] [INFO ] Deduced a trap composed of 164 places in 172 ms of which 0 ms to minimize.
[2022-05-17 18:54:31] [INFO ] Deduced a trap composed of 164 places in 178 ms of which 0 ms to minimize.
[2022-05-17 18:54:31] [INFO ] Deduced a trap composed of 158 places in 172 ms of which 0 ms to minimize.
[2022-05-17 18:54:31] [INFO ] Deduced a trap composed of 160 places in 170 ms of which 0 ms to minimize.
[2022-05-17 18:54:31] [INFO ] Deduced a trap composed of 154 places in 178 ms of which 0 ms to minimize.
[2022-05-17 18:54:31] [INFO ] Deduced a trap composed of 160 places in 173 ms of which 0 ms to minimize.
[2022-05-17 18:54:32] [INFO ] Deduced a trap composed of 156 places in 178 ms of which 0 ms to minimize.
[2022-05-17 18:54:32] [INFO ] Deduced a trap composed of 158 places in 174 ms of which 1 ms to minimize.
[2022-05-17 18:54:32] [INFO ] Deduced a trap composed of 160 places in 177 ms of which 1 ms to minimize.
[2022-05-17 18:54:32] [INFO ] Deduced a trap composed of 156 places in 170 ms of which 1 ms to minimize.
[2022-05-17 18:54:33] [INFO ] Deduced a trap composed of 164 places in 177 ms of which 1 ms to minimize.
[2022-05-17 18:54:33] [INFO ] Deduced a trap composed of 158 places in 178 ms of which 0 ms to minimize.
[2022-05-17 18:54:33] [INFO ] Deduced a trap composed of 162 places in 173 ms of which 1 ms to minimize.
[2022-05-17 18:54:34] [INFO ] Deduced a trap composed of 160 places in 168 ms of which 1 ms to minimize.
[2022-05-17 18:54:34] [INFO ] Deduced a trap composed of 160 places in 170 ms of which 0 ms to minimize.
[2022-05-17 18:54:34] [INFO ] Deduced a trap composed of 158 places in 175 ms of which 0 ms to minimize.
[2022-05-17 18:54:34] [INFO ] Deduced a trap composed of 158 places in 173 ms of which 0 ms to minimize.
[2022-05-17 18:54:34] [INFO ] Deduced a trap composed of 164 places in 176 ms of which 0 ms to minimize.
[2022-05-17 18:54:35] [INFO ] Deduced a trap composed of 160 places in 170 ms of which 1 ms to minimize.
[2022-05-17 18:54:35] [INFO ] Deduced a trap composed of 156 places in 179 ms of which 0 ms to minimize.
[2022-05-17 18:54:35] [INFO ] Deduced a trap composed of 154 places in 170 ms of which 1 ms to minimize.
[2022-05-17 18:54:35] [INFO ] Deduced a trap composed of 156 places in 169 ms of which 0 ms to minimize.
[2022-05-17 18:54:36] [INFO ] Deduced a trap composed of 156 places in 170 ms of which 0 ms to minimize.
[2022-05-17 18:54:36] [INFO ] Deduced a trap composed of 160 places in 171 ms of which 1 ms to minimize.
[2022-05-17 18:54:36] [INFO ] Deduced a trap composed of 159 places in 172 ms of which 1 ms to minimize.
[2022-05-17 18:54:36] [INFO ] Deduced a trap composed of 160 places in 173 ms of which 0 ms to minimize.
[2022-05-17 18:54:36] [INFO ] Deduced a trap composed of 164 places in 174 ms of which 0 ms to minimize.
[2022-05-17 18:54:37] [INFO ] Deduced a trap composed of 166 places in 178 ms of which 1 ms to minimize.
[2022-05-17 18:54:37] [INFO ] Deduced a trap composed of 162 places in 171 ms of which 0 ms to minimize.
[2022-05-17 18:54:37] [INFO ] Deduced a trap composed of 164 places in 169 ms of which 0 ms to minimize.
[2022-05-17 18:54:37] [INFO ] Deduced a trap composed of 156 places in 166 ms of which 0 ms to minimize.
[2022-05-17 18:54:37] [INFO ] Deduced a trap composed of 162 places in 167 ms of which 1 ms to minimize.
[2022-05-17 18:54:38] [INFO ] Deduced a trap composed of 158 places in 168 ms of which 0 ms to minimize.
[2022-05-17 18:54:38] [INFO ] Deduced a trap composed of 164 places in 168 ms of which 1 ms to minimize.
[2022-05-17 18:54:38] [INFO ] Deduced a trap composed of 154 places in 172 ms of which 0 ms to minimize.
[2022-05-17 18:54:38] [INFO ] Deduced a trap composed of 164 places in 168 ms of which 0 ms to minimize.
[2022-05-17 18:54:38] [INFO ] Deduced a trap composed of 158 places in 178 ms of which 1 ms to minimize.
[2022-05-17 18:54:39] [INFO ] Deduced a trap composed of 160 places in 172 ms of which 1 ms to minimize.
[2022-05-17 18:54:39] [INFO ] Deduced a trap composed of 152 places in 180 ms of which 1 ms to minimize.
[2022-05-17 18:54:39] [INFO ] Deduced a trap composed of 162 places in 175 ms of which 1 ms to minimize.
[2022-05-17 18:54:39] [INFO ] Deduced a trap composed of 160 places in 172 ms of which 0 ms to minimize.
[2022-05-17 18:54:39] [INFO ] Deduced a trap composed of 160 places in 168 ms of which 0 ms to minimize.
[2022-05-17 18:54:40] [INFO ] Deduced a trap composed of 158 places in 169 ms of which 0 ms to minimize.
[2022-05-17 18:54:40] [INFO ] Deduced a trap composed of 156 places in 169 ms of which 1 ms to minimize.
[2022-05-17 18:54:40] [INFO ] Deduced a trap composed of 166 places in 166 ms of which 1 ms to minimize.
[2022-05-17 18:54:40] [INFO ] Deduced a trap composed of 166 places in 175 ms of which 1 ms to minimize.
[2022-05-17 18:54:40] [INFO ] Deduced a trap composed of 162 places in 174 ms of which 0 ms to minimize.
[2022-05-17 18:54:41] [INFO ] Deduced a trap composed of 158 places in 168 ms of which 0 ms to minimize.
[2022-05-17 18:54:41] [INFO ] Deduced a trap composed of 162 places in 179 ms of which 1 ms to minimize.
[2022-05-17 18:54:41] [INFO ] Deduced a trap composed of 162 places in 169 ms of which 0 ms to minimize.
[2022-05-17 18:54:41] [INFO ] Deduced a trap composed of 156 places in 168 ms of which 0 ms to minimize.
[2022-05-17 18:58:07] [INFO ] Trap strengthening (SAT) tested/added 89/89 trap constraints in 224713 ms
[2022-05-17 18:58:07] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-17 18:58:07] [INFO ] After 225015ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
[2022-05-17 18:58:07] [INFO ] Flatten gal took : 61 ms
[2022-05-17 18:58:07] [INFO ] Flatten gal took : 59 ms
[2022-05-17 18:58:07] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17057800631781464408.gal : 13 ms
[2022-05-17 18:58:07] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13967110411723122886.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality17057800631781464408.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13967110411723122886.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...321
Loading property file /tmp/ReachabilityCardinality13967110411723122886.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 389
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :389 after 399
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :399 after 433
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :433 after 534
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :534 after 769
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :769 after 1262
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :1262 after 2760
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :2760 after 5148
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :5148 after 230782
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :230782 after 235888
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :235888 after 299019
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :299019 after 425613
Detected timeout of ITS tools.
[2022-05-17 18:58:22] [INFO ] Flatten gal took : 53 ms
[2022-05-17 18:58:22] [INFO ] Applying decomposition
[2022-05-17 18:58:22] [INFO ] Flatten gal took : 53 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph8480914364982553507.txt' '-o' '/tmp/graph8480914364982553507.bin' '-w' '/tmp/graph8480914364982553507.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph8480914364982553507.bin' '-l' '-1' '-v' '-w' '/tmp/graph8480914364982553507.weights' '-q' '0' '-e' '0.001'
[2022-05-17 18:58:23] [INFO ] Decomposing Gal with order
[2022-05-17 18:58:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 18:58:23] [INFO ] Removed a total of 2927 redundant transitions.
[2022-05-17 18:58:23] [INFO ] Flatten gal took : 157 ms
[2022-05-17 18:58:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 167 labels/synchronizations in 45 ms.
[2022-05-17 18:58:23] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16927059773983234164.gal : 8 ms
[2022-05-17 18:58:23] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4281468951308144366.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality16927059773983234164.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4281468951308144366.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...299
Loading property file /tmp/ReachabilityCardinality4281468951308144366.prop.
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin13935310668886547971
[2022-05-17 18:58:38] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13935310668886547971
Running compilation step : cd /tmp/ltsmin13935310668886547971;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1845 ms.
Running link step : cd /tmp/ltsmin13935310668886547971;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin13935310668886547971;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'qltransition_11==true'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-17 18:58:53] [INFO ] Flatten gal took : 48 ms
[2022-05-17 18:58:53] [INFO ] Flatten gal took : 48 ms
[2022-05-17 18:58:53] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability8173889573213230217.gal : 5 ms
[2022-05-17 18:58:53] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability3963327856998583356.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityFireability8173889573213230217.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability3963327856998583356.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...319
Loading property file /tmp/ReachabilityFireability3963327856998583356.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 8
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :8 after 64
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :64 after 129
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :129 after 130
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :130 after 131
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :131 after 149
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :149 after 229
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :229 after 824
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :824 after 1311
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :1311 after 6148
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :6148 after 29402
Detected timeout of ITS tools.
[2022-05-17 18:58:56] [INFO ] Flatten gal took : 45 ms
[2022-05-17 18:58:56] [INFO ] Applying decomposition
[2022-05-17 18:58:56] [INFO ] Flatten gal took : 45 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph3948060334291506760.txt' '-o' '/tmp/graph3948060334291506760.bin' '-w' '/tmp/graph3948060334291506760.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph3948060334291506760.bin' '-l' '-1' '-v' '-w' '/tmp/graph3948060334291506760.weights' '-q' '0' '-e' '0.001'
[2022-05-17 18:58:56] [INFO ] Decomposing Gal with order
[2022-05-17 18:58:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 18:58:56] [INFO ] Removed a total of 2740 redundant transitions.
[2022-05-17 18:58:56] [INFO ] Flatten gal took : 100 ms
[2022-05-17 18:58:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 260 labels/synchronizations in 33 ms.
[2022-05-17 18:58:57] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability14428157328883904151.gal : 8 ms
[2022-05-17 18:58:57] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability10921485428111501731.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityFireability14428157328883904151.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability10921485428111501731.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...300
Loading property file /tmp/ReachabilityFireability10921485428111501731.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :1 after 1
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin3732883740185446306
[2022-05-17 18:59:00] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3732883740185446306
Running compilation step : cd /tmp/ltsmin3732883740185446306;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '2' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1856 ms.
Running link step : cd /tmp/ltsmin3732883740185446306;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin3732883740185446306;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'qltransition_11==true'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-17 18:59:03] [INFO ] Flatten gal took : 43 ms
[2022-05-17 18:59:03] [INFO ] Flatten gal took : 44 ms
[2022-05-17 18:59:03] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability9006539013640070095.gal : 6 ms
[2022-05-17 18:59:03] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability12617065228874790061.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityFireability9006539013640070095.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability12617065228874790061.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...320
Loading property file /tmp/ReachabilityFireability12617065228874790061.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 8
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :8 after 64
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :64 after 129
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :129 after 130
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :130 after 131
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :131 after 149
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :149 after 229
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :229 after 824
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :824 after 1311
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :1311 after 6148
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :6148 after 29402
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :29402 after 96986
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :96986 after 248582
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :248582 after 599618
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :599618 after 1.62585e+06
Detected timeout of ITS tools.
[2022-05-17 18:59:33] [INFO ] Flatten gal took : 43 ms
[2022-05-17 18:59:33] [INFO ] Applying decomposition
[2022-05-17 18:59:33] [INFO ] Flatten gal took : 42 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph7276641477223070952.txt' '-o' '/tmp/graph7276641477223070952.bin' '-w' '/tmp/graph7276641477223070952.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph7276641477223070952.bin' '-l' '-1' '-v' '-w' '/tmp/graph7276641477223070952.weights' '-q' '0' '-e' '0.001'
[2022-05-17 18:59:33] [INFO ] Decomposing Gal with order
[2022-05-17 18:59:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 18:59:33] [INFO ] Removed a total of 656 redundant transitions.
[2022-05-17 18:59:33] [INFO ] Flatten gal took : 83 ms
[2022-05-17 18:59:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 266 labels/synchronizations in 12 ms.
[2022-05-17 18:59:33] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability18052325110702866216.gal : 8 ms
[2022-05-17 18:59:33] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability12097102703880506825.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityFireability18052325110702866216.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability12097102703880506825.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...300
Loading property file /tmp/ReachabilityFireability12097102703880506825.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :1 after 2049
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :2049 after 2051
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :2051 after 2055
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :2055 after 2063
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :2063 after 2074
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :2074 after 2110
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :2110 after 2174
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :2174 after 2347
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin4664872508469858132
[2022-05-17 19:00:03] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4664872508469858132
Running compilation step : cd /tmp/ltsmin4664872508469858132;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '6' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1834 ms.
Running link step : cd /tmp/ltsmin4664872508469858132;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin4664872508469858132;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'qltransition_11==true'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-17 19:00:33] [INFO ] Flatten gal took : 44 ms
[2022-05-17 19:00:33] [INFO ] Flatten gal took : 43 ms
[2022-05-17 19:00:33] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability5815381024768303584.gal : 6 ms
[2022-05-17 19:00:33] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability12557655843124753738.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityFireability5815381024768303584.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability12557655843124753738.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...320
Loading property file /tmp/ReachabilityFireability12557655843124753738.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 8
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :8 after 64
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :64 after 129
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :129 after 130
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :130 after 131
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :131 after 149
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :149 after 229
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :229 after 824
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :824 after 1311
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :1311 after 6148
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :6148 after 29402
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :29402 after 96986
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :96986 after 248582
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :248582 after 599618
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :599618 after 1.62585e+06
SDD proceeding with computation,1 properties remain. new max is 131072
SDD size :1.62585e+06 after 3.99829e+06
SDD proceeding with computation,1 properties remain. new max is 262144
SDD size :3.99829e+06 after 4.16985e+07
Detected timeout of ITS tools.
[2022-05-17 19:05:34] [INFO ] Flatten gal took : 43 ms
[2022-05-17 19:05:34] [INFO ] Applying decomposition
[2022-05-17 19:05:34] [INFO ] Flatten gal took : 42 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph489145986221051649.txt' '-o' '/tmp/graph489145986221051649.bin' '-w' '/tmp/graph489145986221051649.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph489145986221051649.bin' '-l' '-1' '-v' '-w' '/tmp/graph489145986221051649.weights' '-q' '0' '-e' '0.001'
[2022-05-17 19:05:34] [INFO ] Decomposing Gal with order
[2022-05-17 19:05:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 19:05:34] [INFO ] Removed a total of 2740 redundant transitions.
[2022-05-17 19:05:34] [INFO ] Flatten gal took : 111 ms
[2022-05-17 19:05:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 281 labels/synchronizations in 20 ms.
[2022-05-17 19:05:34] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability9412422864187991945.gal : 5 ms
[2022-05-17 19:05:34] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability5425218036741433638.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityFireability9412422864187991945.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability5425218036741433638.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...298
Loading property file /tmp/ReachabilityFireability5425218036741433638.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :1 after 2082
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :2082 after 2082
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :2082 after 2082
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :2082 after 2507
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :2507 after 2652
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin17972250767900701817
[2022-05-17 19:10:34] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17972250767900701817
Running compilation step : cd /tmp/ltsmin17972250767900701817;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '60' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1835 ms.
Running link step : cd /tmp/ltsmin17972250767900701817;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin17972250767900701817;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'qltransition_11==true'

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="PolyORBNT-COL-S10J20"
export BK_EXAMINATION="QuasiLiveness"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
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 PolyORBNT-COL-S10J20, examination is QuasiLiveness"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r175-tall-165277024500482"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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