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-165277024500492.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-S10J40, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r175-tall-165277024500492
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 364K
-rw-r--r-- 1 mcc users 9.4K Apr 30 03:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 97K Apr 30 03:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Apr 30 03:45 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K Apr 30 03:45 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.3K 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 93K 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 1652814136712

Running Version 202205111006
[2022-05-17 19:02:17] [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 19:02:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-17 19:02:17] [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 19:02:18] [WARNING] Using fallBack plugin, rng conformance not checked
[2022-05-17 19:02:18] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 618 ms
[2022-05-17 19:02:18] [INFO ] Imported 48 HL places and 38 HL transitions for a total of 894 PT places and 12462.0 transition bindings in 22 ms.
[2022-05-17 19:02:18] [INFO ] Unfolded HLPN to a Petri net with 894 places and 12380 transitions 114079 arcs in 176 ms.
[2022-05-17 19:02:18] [INFO ] Unfolded 38 HLPN properties in 3 ms.
Initial state reduction rules removed 2 formulas.
[2022-05-17 19:02:18] [INFO ] Reduced 9285 identical enabling conditions.
[2022-05-17 19:02:18] [INFO ] Reduced 780 identical enabling conditions.
[2022-05-17 19:02:18] [INFO ] Reduced 45 identical enabling conditions.
Deduced a syphon composed of 40 places in 26 ms
Reduce places removed 40 places and 40 transitions.
Ensure Unique test removed 10110 transitions
Reduce redundant transitions removed 10110 transitions.
Incomplete random walk after 10000 steps, including 560 resets, run finished after 1216 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 36 ms. (steps per millisecond=27 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1000 steps, including 10 resets, run finished after 20 ms. (steps per millisecond=50 ) 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 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 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 17 ms. (steps per millisecond=58 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1000 steps, including 11 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1000 steps, including 9 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 17 ms. (steps per millisecond=58 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 11 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 93 ms. (steps per millisecond=10 ) properties (out of 30) seen :3
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 27) seen :16
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 11) 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 11) seen :0
Running SMT prover for 11 properties.
[2022-05-17 19:02:20] [INFO ] Flow matrix only has 2221 transitions (discarded 9 similar events)
// Phase 1: matrix 2221 rows 854 cols
[2022-05-17 19:02:20] [INFO ] Computed 112 place invariants in 159 ms
[2022-05-17 19:02:22] [INFO ] [Real]Absence check using 105 positive place invariants in 61 ms returned sat
[2022-05-17 19:02:22] [INFO ] [Real]Absence check using 105 positive and 7 generalized place invariants in 22 ms returned sat
[2022-05-17 19:02:24] [INFO ] After 1470ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:9
[2022-05-17 19:02:24] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-17 19:02:24] [INFO ] After 230ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :2 real:9
[2022-05-17 19:02:24] [INFO ] After 512ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :2 real:9
Attempting to minimize the solution found.
Minimization took 157 ms.
[2022-05-17 19:02:25] [INFO ] After 2876ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :2 real:9
[2022-05-17 19:02:25] [INFO ] [Nat]Absence check using 105 positive place invariants in 37 ms returned sat
[2022-05-17 19:02:25] [INFO ] [Nat]Absence check using 105 positive and 7 generalized place invariants in 20 ms returned sat
[2022-05-17 19:02:29] [INFO ] After 3542ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
[2022-05-17 19:02:36] [INFO ] After 6989ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :11
[2022-05-17 19:02:38] [INFO ] After 9494ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :11
Attempting to minimize the solution found.
Minimization took 1648 ms.
[2022-05-17 19:02:40] [INFO ] After 15244ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :11
Parikh walk visited 0 properties in 1405 ms.
Support contains 147 out of 854 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 854/854 places, 2230/2230 transitions.
Ensure Unique test removed 10 places
Drop transitions removed 45 transitions
Trivial Post-agglo rules discarded 45 transitions
Performed 45 trivial Post agglomeration. Transition count delta: 45
Iterating post reduction 0 with 55 rules applied. Total rules applied 55 place count 844 transition count 2185
Reduce places removed 45 places and 0 transitions.
Iterating post reduction 1 with 45 rules applied. Total rules applied 100 place count 799 transition count 2185
Performed 43 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 43 Pre rules applied. Total rules applied 100 place count 799 transition count 2142
Deduced a syphon composed of 43 places in 2 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 2 with 86 rules applied. Total rules applied 186 place count 756 transition count 2142
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 187 place count 755 transition count 2141
Iterating global reduction 2 with 1 rules applied. Total rules applied 188 place count 755 transition count 2141
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 192 place count 753 transition count 2139
Applied a total of 192 rules in 328 ms. Remains 753 /854 variables (removed 101) and now considering 2139/2230 (removed 91) transitions.
[2022-05-17 19:02:42] [INFO ] Flow matrix only has 2130 transitions (discarded 9 similar events)
// Phase 1: matrix 2130 rows 753 cols
[2022-05-17 19:02:42] [INFO ] Computed 102 place invariants in 80 ms
[2022-05-17 19:02:43] [INFO ] Dead Transitions using invariants and state equation in 1005 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 : 753/854 places, 1524/2230 transitions.
Applied a total of 0 rules in 42 ms. Remains 753 /753 variables (removed 0) and now considering 1524/1524 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 753/854 places, 1524/2230 transitions.
Incomplete random walk after 1000000 steps, including 65473 resets, run finished after 7577 ms. (steps per millisecond=131 ) properties (out of 11) seen :10
Incomplete Best-First random walk after 1000001 steps, including 8047 resets, run finished after 1609 ms. (steps per millisecond=621 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2022-05-17 19:02:52] [INFO ] Flow matrix only has 1515 transitions (discarded 9 similar events)
// Phase 1: matrix 1515 rows 753 cols
[2022-05-17 19:02:52] [INFO ] Computed 102 place invariants in 31 ms
[2022-05-17 19:02:52] [INFO ] [Real]Absence check using 95 positive place invariants in 21 ms returned sat
[2022-05-17 19:02:52] [INFO ] [Real]Absence check using 95 positive and 7 generalized place invariants in 15 ms returned sat
[2022-05-17 19:02:52] [INFO ] After 140ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 19:02:52] [INFO ] [Nat]Absence check using 95 positive place invariants in 19 ms returned sat
[2022-05-17 19:02:52] [INFO ] [Nat]Absence check using 95 positive and 7 generalized place invariants in 13 ms returned sat
[2022-05-17 19:02:53] [INFO ] After 482ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 19:02:53] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-17 19:02:53] [INFO ] After 91ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 19:02:53] [INFO ] Deduced a trap composed of 302 places in 341 ms of which 1 ms to minimize.
[2022-05-17 19:02:53] [INFO ] Deduced a trap composed of 308 places in 331 ms of which 0 ms to minimize.
[2022-05-17 19:02:54] [INFO ] Deduced a trap composed of 308 places in 329 ms of which 1 ms to minimize.
[2022-05-17 19:02:54] [INFO ] Deduced a trap composed of 298 places in 321 ms of which 1 ms to minimize.
[2022-05-17 19:02:55] [INFO ] Deduced a trap composed of 304 places in 322 ms of which 1 ms to minimize.
[2022-05-17 19:02:55] [INFO ] Deduced a trap composed of 306 places in 318 ms of which 1 ms to minimize.
[2022-05-17 19:02:55] [INFO ] Deduced a trap composed of 296 places in 315 ms of which 1 ms to minimize.
[2022-05-17 19:02:56] [INFO ] Deduced a trap composed of 292 places in 315 ms of which 0 ms to minimize.
[2022-05-17 19:02:56] [INFO ] Deduced a trap composed of 302 places in 319 ms of which 0 ms to minimize.
[2022-05-17 19:02:57] [INFO ] Deduced a trap composed of 308 places in 316 ms of which 1 ms to minimize.
[2022-05-17 19:02:57] [INFO ] Deduced a trap composed of 302 places in 322 ms of which 0 ms to minimize.
[2022-05-17 19:02:57] [INFO ] Deduced a trap composed of 298 places in 317 ms of which 2 ms to minimize.
[2022-05-17 19:02:58] [INFO ] Deduced a trap composed of 298 places in 320 ms of which 0 ms to minimize.
[2022-05-17 19:02:58] [INFO ] Deduced a trap composed of 294 places in 321 ms of which 1 ms to minimize.
[2022-05-17 19:02:58] [INFO ] Deduced a trap composed of 286 places in 310 ms of which 1 ms to minimize.
[2022-05-17 19:02:59] [INFO ] Deduced a trap composed of 284 places in 312 ms of which 0 ms to minimize.
[2022-05-17 19:02:59] [INFO ] Deduced a trap composed of 302 places in 316 ms of which 1 ms to minimize.
[2022-05-17 19:03:00] [INFO ] Deduced a trap composed of 310 places in 316 ms of which 0 ms to minimize.
[2022-05-17 19:03:00] [INFO ] Deduced a trap composed of 300 places in 314 ms of which 1 ms to minimize.
[2022-05-17 19:03:00] [INFO ] Deduced a trap composed of 302 places in 315 ms of which 1 ms to minimize.
[2022-05-17 19:03:01] [INFO ] Deduced a trap composed of 308 places in 318 ms of which 1 ms to minimize.
[2022-05-17 19:03:01] [INFO ] Deduced a trap composed of 306 places in 317 ms of which 1 ms to minimize.
[2022-05-17 19:03:01] [INFO ] Deduced a trap composed of 298 places in 318 ms of which 1 ms to minimize.
[2022-05-17 19:03:02] [INFO ] Deduced a trap composed of 298 places in 312 ms of which 1 ms to minimize.
[2022-05-17 19:03:02] [INFO ] Deduced a trap composed of 298 places in 314 ms of which 1 ms to minimize.
[2022-05-17 19:03:03] [INFO ] Deduced a trap composed of 294 places in 311 ms of which 0 ms to minimize.
[2022-05-17 19:03:04] [INFO ] Deduced a trap composed of 292 places in 338 ms of which 0 ms to minimize.
[2022-05-17 19:03:09] [INFO ] Deduced a trap composed of 298 places in 320 ms of which 1 ms to minimize.
[2022-05-17 19:03:09] [INFO ] Deduced a trap composed of 302 places in 310 ms of which 1 ms to minimize.
[2022-05-17 19:03:10] [INFO ] Deduced a trap composed of 302 places in 303 ms of which 0 ms to minimize.
[2022-05-17 19:03:10] [INFO ] Deduced a trap composed of 312 places in 302 ms of which 0 ms to minimize.
[2022-05-17 19:03:11] [INFO ] Deduced a trap composed of 316 places in 312 ms of which 1 ms to minimize.
[2022-05-17 19:03:11] [INFO ] Deduced a trap composed of 312 places in 307 ms of which 3 ms to minimize.
[2022-05-17 19:03:11] [INFO ] Deduced a trap composed of 312 places in 298 ms of which 1 ms to minimize.
[2022-05-17 19:03:12] [INFO ] Deduced a trap composed of 296 places in 301 ms of which 1 ms to minimize.
[2022-05-17 19:03:12] [INFO ] Deduced a trap composed of 304 places in 302 ms of which 1 ms to minimize.
[2022-05-17 19:03:13] [INFO ] Deduced a trap composed of 302 places in 305 ms of which 1 ms to minimize.
[2022-05-17 19:03:13] [INFO ] Deduced a trap composed of 300 places in 301 ms of which 1 ms to minimize.
[2022-05-17 19:03:13] [INFO ] Deduced a trap composed of 304 places in 320 ms of which 1 ms to minimize.
[2022-05-17 19:03:14] [INFO ] Deduced a trap composed of 302 places in 305 ms of which 1 ms to minimize.
[2022-05-17 19:03:14] [INFO ] Deduced a trap composed of 304 places in 306 ms of which 0 ms to minimize.
[2022-05-17 19:03:15] [INFO ] Deduced a trap composed of 298 places in 303 ms of which 1 ms to minimize.
[2022-05-17 19:03:15] [INFO ] Deduced a trap composed of 298 places in 302 ms of which 1 ms to minimize.
[2022-05-17 19:03:15] [INFO ] Deduced a trap composed of 298 places in 301 ms of which 1 ms to minimize.
[2022-05-17 19:03:16] [INFO ] Deduced a trap composed of 296 places in 301 ms of which 0 ms to minimize.
[2022-05-17 19:03:16] [INFO ] Deduced a trap composed of 296 places in 300 ms of which 1 ms to minimize.
[2022-05-17 19:03:17] [INFO ] Deduced a trap composed of 304 places in 298 ms of which 0 ms to minimize.
[2022-05-17 19:03:17] [INFO ] Deduced a trap composed of 308 places in 309 ms of which 1 ms to minimize.
[2022-05-17 19:03:17] [INFO ] Deduced a trap composed of 300 places in 300 ms of which 1 ms to minimize.
[2022-05-17 19:03:18] [INFO ] Deduced a trap composed of 296 places in 297 ms of which 0 ms to minimize.
[2022-05-17 19:03:18] [INFO ] Deduced a trap composed of 297 places in 310 ms of which 1 ms to minimize.
[2022-05-17 19:03:20] [INFO ] Deduced a trap composed of 304 places in 301 ms of which 1 ms to minimize.
[2022-05-17 19:03:20] [INFO ] Deduced a trap composed of 304 places in 298 ms of which 1 ms to minimize.
[2022-05-17 19:03:21] [INFO ] Deduced a trap composed of 306 places in 302 ms of which 1 ms to minimize.
[2022-05-17 19:03:22] [INFO ] Deduced a trap composed of 298 places in 297 ms of which 1 ms to minimize.
[2022-05-17 19:03:22] [INFO ] Deduced a trap composed of 312 places in 303 ms of which 1 ms to minimize.
[2022-05-17 19:03:23] [INFO ] Deduced a trap composed of 302 places in 303 ms of which 0 ms to minimize.
[2022-05-17 19:03:23] [INFO ] Deduced a trap composed of 300 places in 306 ms of which 0 ms to minimize.
[2022-05-17 19:03:23] [INFO ] Deduced a trap composed of 304 places in 305 ms of which 0 ms to minimize.
[2022-05-17 19:03:24] [INFO ] Deduced a trap composed of 296 places in 302 ms of which 1 ms to minimize.
[2022-05-17 19:03:25] [INFO ] Deduced a trap composed of 302 places in 310 ms of which 1 ms to minimize.
[2022-05-17 19:03:25] [INFO ] Deduced a trap composed of 310 places in 301 ms of which 2 ms to minimize.
[2022-05-17 19:03:26] [INFO ] Deduced a trap composed of 294 places in 303 ms of which 0 ms to minimize.
[2022-05-17 19:03:26] [INFO ] Deduced a trap composed of 298 places in 299 ms of which 1 ms to minimize.
[2022-05-17 19:03:27] [INFO ] Deduced a trap composed of 296 places in 303 ms of which 2 ms to minimize.
[2022-05-17 19:03:27] [INFO ] Deduced a trap composed of 310 places in 299 ms of which 2 ms to minimize.
[2022-05-17 19:03:28] [INFO ] Deduced a trap composed of 304 places in 298 ms of which 1 ms to minimize.
[2022-05-17 19:03:28] [INFO ] Deduced a trap composed of 298 places in 305 ms of which 1 ms to minimize.
[2022-05-17 19:03:28] [INFO ] Deduced a trap composed of 306 places in 298 ms of which 1 ms to minimize.
[2022-05-17 19:03:29] [INFO ] Deduced a trap composed of 310 places in 308 ms of which 0 ms to minimize.
[2022-05-17 19:03:30] [INFO ] Deduced a trap composed of 304 places in 306 ms of which 1 ms to minimize.
[2022-05-17 19:03:31] [INFO ] Deduced a trap composed of 298 places in 304 ms of which 1 ms to minimize.
[2022-05-17 19:03:40] [INFO ] Trap strengthening (SAT) tested/added 72/72 trap constraints in 46897 ms
[2022-05-17 19:03:40] [INFO ] After 47168ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2022-05-17 19:03:40] [INFO ] After 47783ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 19 ms.
Support contains 1 out of 753 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 753/753 places, 1524/1524 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 753 transition count 1523
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 752 transition count 1523
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 752 transition count 1521
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 6 place count 750 transition count 1521
Applied a total of 6 rules in 76 ms. Remains 750 /753 variables (removed 3) and now considering 1521/1524 (removed 3) transitions.
Finished structural reductions, in 1 iterations. Remains : 750/753 places, 1521/1524 transitions.
Incomplete random walk after 1000000 steps, including 72780 resets, run finished after 10177 ms. (steps per millisecond=98 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 8313 resets, run finished after 1873 ms. (steps per millisecond=533 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 4908371 steps, run timeout after 36001 ms. (steps per millisecond=136 ) properties seen :{}
Probabilistic random walk after 4908371 steps, saw 840124 distinct states, run finished after 36003 ms. (steps per millisecond=136 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-17 19:04:28] [INFO ] Flow matrix only has 1512 transitions (discarded 9 similar events)
// Phase 1: matrix 1512 rows 750 cols
[2022-05-17 19:04:28] [INFO ] Computed 102 place invariants in 30 ms
[2022-05-17 19:04:28] [INFO ] [Real]Absence check using 95 positive place invariants in 22 ms returned sat
[2022-05-17 19:04:28] [INFO ] [Real]Absence check using 95 positive and 7 generalized place invariants in 16 ms returned sat
[2022-05-17 19:04:28] [INFO ] After 150ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 19:04:28] [INFO ] [Nat]Absence check using 95 positive place invariants in 19 ms returned sat
[2022-05-17 19:04:28] [INFO ] [Nat]Absence check using 95 positive and 7 generalized place invariants in 14 ms returned sat
[2022-05-17 19:04:29] [INFO ] After 391ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 19:04:29] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-17 19:04:29] [INFO ] After 588ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 19:04:30] [INFO ] Deduced a trap composed of 300 places in 324 ms of which 0 ms to minimize.
[2022-05-17 19:04:30] [INFO ] Deduced a trap composed of 296 places in 300 ms of which 1 ms to minimize.
[2022-05-17 19:04:30] [INFO ] Deduced a trap composed of 306 places in 312 ms of which 1 ms to minimize.
[2022-05-17 19:04:31] [INFO ] Deduced a trap composed of 294 places in 304 ms of which 0 ms to minimize.
[2022-05-17 19:04:31] [INFO ] Deduced a trap composed of 300 places in 298 ms of which 1 ms to minimize.
[2022-05-17 19:04:31] [INFO ] Deduced a trap composed of 294 places in 305 ms of which 1 ms to minimize.
[2022-05-17 19:04:32] [INFO ] Deduced a trap composed of 298 places in 323 ms of which 1 ms to minimize.
[2022-05-17 19:04:32] [INFO ] Deduced a trap composed of 300 places in 309 ms of which 1 ms to minimize.
[2022-05-17 19:04:33] [INFO ] Deduced a trap composed of 292 places in 300 ms of which 0 ms to minimize.
[2022-05-17 19:04:33] [INFO ] Deduced a trap composed of 304 places in 297 ms of which 1 ms to minimize.
[2022-05-17 19:04:33] [INFO ] Deduced a trap composed of 306 places in 298 ms of which 0 ms to minimize.
[2022-05-17 19:04:34] [INFO ] Deduced a trap composed of 296 places in 297 ms of which 0 ms to minimize.
[2022-05-17 19:04:34] [INFO ] Deduced a trap composed of 308 places in 292 ms of which 1 ms to minimize.
[2022-05-17 19:04:35] [INFO ] Deduced a trap composed of 302 places in 302 ms of which 0 ms to minimize.
[2022-05-17 19:04:35] [INFO ] Deduced a trap composed of 294 places in 299 ms of which 0 ms to minimize.
[2022-05-17 19:04:35] [INFO ] Deduced a trap composed of 300 places in 306 ms of which 1 ms to minimize.
[2022-05-17 19:04:36] [INFO ] Deduced a trap composed of 294 places in 301 ms of which 0 ms to minimize.
[2022-05-17 19:04:36] [INFO ] Deduced a trap composed of 302 places in 298 ms of which 1 ms to minimize.
[2022-05-17 19:04:37] [INFO ] Deduced a trap composed of 300 places in 300 ms of which 0 ms to minimize.
[2022-05-17 19:04:37] [INFO ] Deduced a trap composed of 305 places in 312 ms of which 1 ms to minimize.
[2022-05-17 19:04:37] [INFO ] Deduced a trap composed of 292 places in 304 ms of which 0 ms to minimize.
[2022-05-17 19:04:38] [INFO ] Deduced a trap composed of 302 places in 300 ms of which 0 ms to minimize.
[2022-05-17 19:04:38] [INFO ] Deduced a trap composed of 300 places in 297 ms of which 0 ms to minimize.
[2022-05-17 19:04:39] [INFO ] Deduced a trap composed of 300 places in 295 ms of which 0 ms to minimize.
[2022-05-17 19:04:39] [INFO ] Deduced a trap composed of 296 places in 308 ms of which 0 ms to minimize.
[2022-05-17 19:04:39] [INFO ] Deduced a trap composed of 302 places in 303 ms of which 1 ms to minimize.
[2022-05-17 19:04:40] [INFO ] Deduced a trap composed of 294 places in 297 ms of which 1 ms to minimize.
[2022-05-17 19:04:40] [INFO ] Deduced a trap composed of 294 places in 291 ms of which 0 ms to minimize.
[2022-05-17 19:04:40] [INFO ] Deduced a trap composed of 294 places in 297 ms of which 0 ms to minimize.
[2022-05-17 19:04:41] [INFO ] Deduced a trap composed of 302 places in 304 ms of which 1 ms to minimize.
[2022-05-17 19:04:41] [INFO ] Deduced a trap composed of 302 places in 299 ms of which 0 ms to minimize.
[2022-05-17 19:04:42] [INFO ] Deduced a trap composed of 294 places in 297 ms of which 1 ms to minimize.
[2022-05-17 19:04:42] [INFO ] Deduced a trap composed of 300 places in 303 ms of which 1 ms to minimize.
[2022-05-17 19:04:42] [INFO ] Deduced a trap composed of 306 places in 303 ms of which 1 ms to minimize.
[2022-05-17 19:04:43] [INFO ] Deduced a trap composed of 300 places in 294 ms of which 0 ms to minimize.
[2022-05-17 19:04:43] [INFO ] Deduced a trap composed of 302 places in 296 ms of which 1 ms to minimize.
[2022-05-17 19:04:43] [INFO ] Deduced a trap composed of 298 places in 298 ms of which 0 ms to minimize.
[2022-05-17 19:04:44] [INFO ] Deduced a trap composed of 300 places in 303 ms of which 1 ms to minimize.
[2022-05-17 19:04:44] [INFO ] Deduced a trap composed of 302 places in 308 ms of which 1 ms to minimize.
[2022-05-17 19:04:45] [INFO ] Deduced a trap composed of 302 places in 292 ms of which 1 ms to minimize.
[2022-05-17 19:04:45] [INFO ] Deduced a trap composed of 302 places in 304 ms of which 1 ms to minimize.
[2022-05-17 19:04:45] [INFO ] Deduced a trap composed of 296 places in 292 ms of which 0 ms to minimize.
[2022-05-17 19:04:46] [INFO ] Deduced a trap composed of 300 places in 291 ms of which 1 ms to minimize.
[2022-05-17 19:04:46] [INFO ] Deduced a trap composed of 296 places in 298 ms of which 1 ms to minimize.
[2022-05-17 19:04:46] [INFO ] Deduced a trap composed of 296 places in 302 ms of which 0 ms to minimize.
[2022-05-17 19:04:47] [INFO ] Deduced a trap composed of 308 places in 302 ms of which 0 ms to minimize.
[2022-05-17 19:04:48] [INFO ] Deduced a trap composed of 302 places in 296 ms of which 0 ms to minimize.
[2022-05-17 19:04:48] [INFO ] Deduced a trap composed of 304 places in 302 ms of which 1 ms to minimize.
[2022-05-17 19:04:48] [INFO ] Deduced a trap composed of 300 places in 300 ms of which 1 ms to minimize.
[2022-05-17 19:04:49] [INFO ] Deduced a trap composed of 296 places in 295 ms of which 0 ms to minimize.
[2022-05-17 19:04:49] [INFO ] Deduced a trap composed of 306 places in 306 ms of which 1 ms to minimize.
[2022-05-17 19:04:50] [INFO ] Deduced a trap composed of 300 places in 298 ms of which 0 ms to minimize.
[2022-05-17 19:04:51] [INFO ] Deduced a trap composed of 300 places in 301 ms of which 0 ms to minimize.
[2022-05-17 19:04:51] [INFO ] Deduced a trap composed of 306 places in 310 ms of which 0 ms to minimize.
[2022-05-17 19:04:52] [INFO ] Deduced a trap composed of 294 places in 295 ms of which 0 ms to minimize.
[2022-05-17 19:04:52] [INFO ] Deduced a trap composed of 302 places in 299 ms of which 0 ms to minimize.
[2022-05-17 19:04:53] [INFO ] Deduced a trap composed of 294 places in 300 ms of which 0 ms to minimize.
[2022-05-17 19:04:54] [INFO ] Deduced a trap composed of 298 places in 307 ms of which 0 ms to minimize.
[2022-05-17 19:04:54] [INFO ] Deduced a trap composed of 304 places in 307 ms of which 0 ms to minimize.
[2022-05-17 19:04:55] [INFO ] Deduced a trap composed of 304 places in 301 ms of which 1 ms to minimize.
[2022-05-17 19:04:55] [INFO ] Deduced a trap composed of 302 places in 303 ms of which 0 ms to minimize.
[2022-05-17 19:04:56] [INFO ] Deduced a trap composed of 300 places in 298 ms of which 1 ms to minimize.
[2022-05-17 19:04:56] [INFO ] Deduced a trap composed of 296 places in 297 ms of which 1 ms to minimize.
[2022-05-17 19:04:56] [INFO ] Deduced a trap composed of 290 places in 294 ms of which 1 ms to minimize.
[2022-05-17 19:04:57] [INFO ] Deduced a trap composed of 312 places in 296 ms of which 1 ms to minimize.
[2022-05-17 19:04:57] [INFO ] Deduced a trap composed of 296 places in 300 ms of which 1 ms to minimize.
[2022-05-17 19:04:58] [INFO ] Deduced a trap composed of 294 places in 301 ms of which 1 ms to minimize.
[2022-05-17 19:04:58] [INFO ] Deduced a trap composed of 298 places in 296 ms of which 1 ms to minimize.
[2022-05-17 19:04:59] [INFO ] Deduced a trap composed of 302 places in 302 ms of which 0 ms to minimize.
[2022-05-17 19:04:59] [INFO ] Deduced a trap composed of 304 places in 298 ms of which 1 ms to minimize.
[2022-05-17 19:05:00] [INFO ] Deduced a trap composed of 298 places in 300 ms of which 0 ms to minimize.
[2022-05-17 19:05:01] [INFO ] Deduced a trap composed of 304 places in 308 ms of which 0 ms to minimize.
[2022-05-17 19:05:01] [INFO ] Deduced a trap composed of 292 places in 302 ms of which 0 ms to minimize.
[2022-05-17 19:05:01] [INFO ] Deduced a trap composed of 304 places in 320 ms of which 1 ms to minimize.
[2022-05-17 19:05:02] [INFO ] Deduced a trap composed of 290 places in 314 ms of which 0 ms to minimize.
[2022-05-17 19:05:02] [INFO ] Deduced a trap composed of 298 places in 301 ms of which 1 ms to minimize.
[2022-05-17 19:05:02] [INFO ] Deduced a trap composed of 300 places in 308 ms of which 1 ms to minimize.
[2022-05-17 19:05:03] [INFO ] Deduced a trap composed of 308 places in 304 ms of which 0 ms to minimize.
[2022-05-17 19:05:05] [INFO ] Deduced a trap composed of 304 places in 301 ms of which 1 ms to minimize.
[2022-05-17 19:05:07] [INFO ] Deduced a trap composed of 302 places in 311 ms of which 0 ms to minimize.
[2022-05-17 19:05:08] [INFO ] Deduced a trap composed of 302 places in 300 ms of which 1 ms to minimize.
[2022-05-17 19:05:08] [INFO ] Deduced a trap composed of 298 places in 299 ms of which 1 ms to minimize.
[2022-05-17 19:05:09] [INFO ] Deduced a trap composed of 298 places in 303 ms of which 0 ms to minimize.
[2022-05-17 19:05:09] [INFO ] Deduced a trap composed of 302 places in 293 ms of which 1 ms to minimize.
[2022-05-17 19:05:16] [INFO ] Deduced a trap composed of 302 places in 300 ms of which 1 ms to minimize.
[2022-05-17 19:05:17] [INFO ] Deduced a trap composed of 300 places in 299 ms of which 1 ms to minimize.
[2022-05-17 19:05:17] [INFO ] Deduced a trap composed of 306 places in 292 ms of which 1 ms to minimize.
[2022-05-17 19:05:19] [INFO ] Deduced a trap composed of 302 places in 299 ms of which 1 ms to minimize.
[2022-05-17 19:05:19] [INFO ] Deduced a trap composed of 302 places in 299 ms of which 1 ms to minimize.
[2022-05-17 19:05:25] [INFO ] Deduced a trap composed of 308 places in 305 ms of which 1 ms to minimize.
[2022-05-17 19:05:25] [INFO ] Deduced a trap composed of 308 places in 307 ms of which 1 ms to minimize.
[2022-05-17 19:05:26] [INFO ] Deduced a trap composed of 300 places in 303 ms of which 0 ms to minimize.
[2022-05-17 19:05:26] [INFO ] Deduced a trap composed of 300 places in 303 ms of which 0 ms to minimize.
[2022-05-17 19:05:27] [INFO ] Deduced a trap composed of 310 places in 300 ms of which 1 ms to minimize.
[2022-05-17 19:05:27] [INFO ] Deduced a trap composed of 306 places in 299 ms of which 1 ms to minimize.
[2022-05-17 19:05:28] [INFO ] Deduced a trap composed of 312 places in 294 ms of which 1 ms to minimize.
[2022-05-17 19:05:28] [INFO ] Deduced a trap composed of 302 places in 296 ms of which 0 ms to minimize.
[2022-05-17 19:05:28] [INFO ] Deduced a trap composed of 294 places in 294 ms of which 0 ms to minimize.
[2022-05-17 19:05:32] [INFO ] Deduced a trap composed of 310 places in 301 ms of which 1 ms to minimize.
[2022-05-17 19:05:32] [INFO ] Deduced a trap composed of 300 places in 302 ms of which 1 ms to minimize.
[2022-05-17 19:05:33] [INFO ] Deduced a trap composed of 300 places in 299 ms of which 0 ms to minimize.
[2022-05-17 19:05:33] [INFO ] Deduced a trap composed of 300 places in 305 ms of which 1 ms to minimize.
[2022-05-17 19:05:38] [INFO ] Deduced a trap composed of 298 places in 302 ms of which 1 ms to minimize.
[2022-05-17 19:05:41] [INFO ] Deduced a trap composed of 302 places in 296 ms of which 0 ms to minimize.
[2022-05-17 19:05:42] [INFO ] Deduced a trap composed of 300 places in 316 ms of which 0 ms to minimize.
[2022-05-17 19:05:46] [INFO ] Deduced a trap composed of 300 places in 296 ms of which 1 ms to minimize.
[2022-05-17 19:05:55] [INFO ] Trap strengthening (SAT) tested/added 106/106 trap constraints in 85853 ms
[2022-05-17 19:05:55] [INFO ] After 86711ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2022-05-17 19:05:55] [INFO ] After 87237ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 22 ms.
Support contains 1 out of 750 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 750/750 places, 1521/1521 transitions.
Applied a total of 0 rules in 38 ms. Remains 750 /750 variables (removed 0) and now considering 1521/1521 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 750/750 places, 1521/1521 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 750/750 places, 1521/1521 transitions.
Applied a total of 0 rules in 45 ms. Remains 750 /750 variables (removed 0) and now considering 1521/1521 (removed 0) transitions.
[2022-05-17 19:05:55] [INFO ] Flow matrix only has 1512 transitions (discarded 9 similar events)
// Phase 1: matrix 1512 rows 750 cols
[2022-05-17 19:05:56] [INFO ] Computed 102 place invariants in 24 ms
[2022-05-17 19:05:56] [INFO ] Implicit Places using invariants in 581 ms returned []
[2022-05-17 19:05:56] [INFO ] Flow matrix only has 1512 transitions (discarded 9 similar events)
// Phase 1: matrix 1512 rows 750 cols
[2022-05-17 19:05:56] [INFO ] Computed 102 place invariants in 27 ms
[2022-05-17 19:05:57] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-17 19:06:01] [INFO ] Implicit Places using invariants and state equation in 4528 ms returned []
Implicit Place search using SMT with State Equation took 5114 ms to find 0 implicit places.
[2022-05-17 19:06:01] [INFO ] Redundant transitions in 101 ms returned []
[2022-05-17 19:06:01] [INFO ] Flow matrix only has 1512 transitions (discarded 9 similar events)
// Phase 1: matrix 1512 rows 750 cols
[2022-05-17 19:06:01] [INFO ] Computed 102 place invariants in 21 ms
[2022-05-17 19:06:01] [INFO ] Dead Transitions using invariants and state equation in 682 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 750/750 places, 1521/1521 transitions.
Incomplete random walk after 100000 steps, including 7242 resets, run finished after 1034 ms. (steps per millisecond=96 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2022-05-17 19:06:02] [INFO ] Flow matrix only has 1512 transitions (discarded 9 similar events)
// Phase 1: matrix 1512 rows 750 cols
[2022-05-17 19:06:02] [INFO ] Computed 102 place invariants in 28 ms
[2022-05-17 19:06:03] [INFO ] [Real]Absence check using 95 positive place invariants in 22 ms returned sat
[2022-05-17 19:06:03] [INFO ] [Real]Absence check using 95 positive and 7 generalized place invariants in 15 ms returned sat
[2022-05-17 19:06:03] [INFO ] After 141ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 19:06:03] [INFO ] [Nat]Absence check using 95 positive place invariants in 21 ms returned sat
[2022-05-17 19:06:03] [INFO ] [Nat]Absence check using 95 positive and 7 generalized place invariants in 15 ms returned sat
[2022-05-17 19:06:03] [INFO ] After 381ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 19:06:03] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-17 19:06:04] [INFO ] After 602ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 19:06:04] [INFO ] Deduced a trap composed of 300 places in 312 ms of which 1 ms to minimize.
[2022-05-17 19:06:04] [INFO ] Deduced a trap composed of 296 places in 308 ms of which 0 ms to minimize.
[2022-05-17 19:06:05] [INFO ] Deduced a trap composed of 306 places in 312 ms of which 0 ms to minimize.
[2022-05-17 19:06:05] [INFO ] Deduced a trap composed of 294 places in 300 ms of which 0 ms to minimize.
[2022-05-17 19:06:06] [INFO ] Deduced a trap composed of 300 places in 305 ms of which 0 ms to minimize.
[2022-05-17 19:06:06] [INFO ] Deduced a trap composed of 294 places in 294 ms of which 0 ms to minimize.
[2022-05-17 19:06:06] [INFO ] Deduced a trap composed of 298 places in 296 ms of which 1 ms to minimize.
[2022-05-17 19:06:07] [INFO ] Deduced a trap composed of 300 places in 306 ms of which 1 ms to minimize.
[2022-05-17 19:06:07] [INFO ] Deduced a trap composed of 292 places in 304 ms of which 1 ms to minimize.
[2022-05-17 19:06:07] [INFO ] Deduced a trap composed of 304 places in 301 ms of which 1 ms to minimize.
[2022-05-17 19:06:08] [INFO ] Deduced a trap composed of 306 places in 303 ms of which 1 ms to minimize.
[2022-05-17 19:06:08] [INFO ] Deduced a trap composed of 296 places in 292 ms of which 1 ms to minimize.
[2022-05-17 19:06:09] [INFO ] Deduced a trap composed of 308 places in 297 ms of which 1 ms to minimize.
[2022-05-17 19:06:09] [INFO ] Deduced a trap composed of 302 places in 298 ms of which 0 ms to minimize.
[2022-05-17 19:06:09] [INFO ] Deduced a trap composed of 294 places in 306 ms of which 1 ms to minimize.
[2022-05-17 19:06:10] [INFO ] Deduced a trap composed of 300 places in 306 ms of which 1 ms to minimize.
[2022-05-17 19:06:10] [INFO ] Deduced a trap composed of 294 places in 298 ms of which 1 ms to minimize.
[2022-05-17 19:06:11] [INFO ] Deduced a trap composed of 302 places in 304 ms of which 1 ms to minimize.
[2022-05-17 19:06:11] [INFO ] Deduced a trap composed of 300 places in 309 ms of which 1 ms to minimize.
[2022-05-17 19:06:11] [INFO ] Deduced a trap composed of 305 places in 325 ms of which 1 ms to minimize.
[2022-05-17 19:06:12] [INFO ] Deduced a trap composed of 292 places in 304 ms of which 0 ms to minimize.
[2022-05-17 19:06:12] [INFO ] Deduced a trap composed of 302 places in 319 ms of which 1 ms to minimize.
[2022-05-17 19:06:13] [INFO ] Deduced a trap composed of 300 places in 318 ms of which 0 ms to minimize.
[2022-05-17 19:06:13] [INFO ] Deduced a trap composed of 300 places in 297 ms of which 1 ms to minimize.
[2022-05-17 19:06:13] [INFO ] Deduced a trap composed of 296 places in 300 ms of which 1 ms to minimize.
[2022-05-17 19:06:14] [INFO ] Deduced a trap composed of 302 places in 294 ms of which 1 ms to minimize.
[2022-05-17 19:06:14] [INFO ] Deduced a trap composed of 294 places in 299 ms of which 1 ms to minimize.
[2022-05-17 19:06:15] [INFO ] Deduced a trap composed of 294 places in 307 ms of which 1 ms to minimize.
[2022-05-17 19:06:15] [INFO ] Deduced a trap composed of 294 places in 304 ms of which 0 ms to minimize.
[2022-05-17 19:06:15] [INFO ] Deduced a trap composed of 302 places in 298 ms of which 1 ms to minimize.
[2022-05-17 19:06:16] [INFO ] Deduced a trap composed of 302 places in 303 ms of which 0 ms to minimize.
[2022-05-17 19:06:16] [INFO ] Deduced a trap composed of 294 places in 301 ms of which 1 ms to minimize.
[2022-05-17 19:06:16] [INFO ] Deduced a trap composed of 300 places in 309 ms of which 1 ms to minimize.
[2022-05-17 19:06:17] [INFO ] Deduced a trap composed of 306 places in 301 ms of which 1 ms to minimize.
[2022-05-17 19:06:17] [INFO ] Deduced a trap composed of 300 places in 297 ms of which 1 ms to minimize.
[2022-05-17 19:06:18] [INFO ] Deduced a trap composed of 302 places in 303 ms of which 1 ms to minimize.
[2022-05-17 19:06:18] [INFO ] Deduced a trap composed of 298 places in 304 ms of which 0 ms to minimize.
[2022-05-17 19:06:18] [INFO ] Deduced a trap composed of 300 places in 303 ms of which 1 ms to minimize.
[2022-05-17 19:06:19] [INFO ] Deduced a trap composed of 302 places in 301 ms of which 1 ms to minimize.
[2022-05-17 19:06:19] [INFO ] Deduced a trap composed of 302 places in 303 ms of which 1 ms to minimize.
[2022-05-17 19:06:19] [INFO ] Deduced a trap composed of 302 places in 303 ms of which 1 ms to minimize.
[2022-05-17 19:06:20] [INFO ] Deduced a trap composed of 296 places in 300 ms of which 1 ms to minimize.
[2022-05-17 19:06:20] [INFO ] Deduced a trap composed of 300 places in 299 ms of which 1 ms to minimize.
[2022-05-17 19:06:21] [INFO ] Deduced a trap composed of 296 places in 298 ms of which 1 ms to minimize.
[2022-05-17 19:06:21] [INFO ] Deduced a trap composed of 296 places in 295 ms of which 1 ms to minimize.
[2022-05-17 19:06:21] [INFO ] Deduced a trap composed of 308 places in 298 ms of which 1 ms to minimize.
[2022-05-17 19:06:22] [INFO ] Deduced a trap composed of 302 places in 302 ms of which 1 ms to minimize.
[2022-05-17 19:06:22] [INFO ] Deduced a trap composed of 304 places in 295 ms of which 0 ms to minimize.
[2022-05-17 19:06:23] [INFO ] Deduced a trap composed of 300 places in 304 ms of which 0 ms to minimize.
[2022-05-17 19:06:23] [INFO ] Deduced a trap composed of 296 places in 306 ms of which 1 ms to minimize.
[2022-05-17 19:06:24] [INFO ] Deduced a trap composed of 306 places in 306 ms of which 0 ms to minimize.
[2022-05-17 19:06:24] [INFO ] Deduced a trap composed of 300 places in 308 ms of which 3 ms to minimize.
[2022-05-17 19:06:25] [INFO ] Deduced a trap composed of 300 places in 311 ms of which 1 ms to minimize.
[2022-05-17 19:06:26] [INFO ] Deduced a trap composed of 306 places in 301 ms of which 0 ms to minimize.
[2022-05-17 19:06:26] [INFO ] Deduced a trap composed of 294 places in 301 ms of which 0 ms to minimize.
[2022-05-17 19:06:27] [INFO ] Deduced a trap composed of 302 places in 302 ms of which 1 ms to minimize.
[2022-05-17 19:06:28] [INFO ] Deduced a trap composed of 294 places in 304 ms of which 0 ms to minimize.
[2022-05-17 19:06:28] [INFO ] Deduced a trap composed of 298 places in 310 ms of which 0 ms to minimize.
[2022-05-17 19:06:29] [INFO ] Deduced a trap composed of 304 places in 313 ms of which 0 ms to minimize.
[2022-05-17 19:06:29] [INFO ] Deduced a trap composed of 304 places in 305 ms of which 1 ms to minimize.
[2022-05-17 19:06:30] [INFO ] Deduced a trap composed of 302 places in 310 ms of which 1 ms to minimize.
[2022-05-17 19:06:30] [INFO ] Deduced a trap composed of 300 places in 298 ms of which 0 ms to minimize.
[2022-05-17 19:06:31] [INFO ] Deduced a trap composed of 296 places in 300 ms of which 0 ms to minimize.
[2022-05-17 19:06:31] [INFO ] Deduced a trap composed of 290 places in 303 ms of which 0 ms to minimize.
[2022-05-17 19:06:31] [INFO ] Deduced a trap composed of 312 places in 312 ms of which 1 ms to minimize.
[2022-05-17 19:06:32] [INFO ] Deduced a trap composed of 296 places in 317 ms of which 0 ms to minimize.
[2022-05-17 19:06:32] [INFO ] Deduced a trap composed of 294 places in 305 ms of which 1 ms to minimize.
[2022-05-17 19:06:33] [INFO ] Deduced a trap composed of 298 places in 302 ms of which 2 ms to minimize.
[2022-05-17 19:06:34] [INFO ] Deduced a trap composed of 302 places in 295 ms of which 1 ms to minimize.
[2022-05-17 19:06:34] [INFO ] Deduced a trap composed of 304 places in 293 ms of which 1 ms to minimize.
[2022-05-17 19:06:34] [INFO ] Deduced a trap composed of 298 places in 291 ms of which 1 ms to minimize.
[2022-05-17 19:06:35] [INFO ] Deduced a trap composed of 304 places in 302 ms of which 0 ms to minimize.
[2022-05-17 19:06:36] [INFO ] Deduced a trap composed of 292 places in 300 ms of which 1 ms to minimize.
[2022-05-17 19:06:36] [INFO ] Deduced a trap composed of 304 places in 297 ms of which 1 ms to minimize.
[2022-05-17 19:06:36] [INFO ] Deduced a trap composed of 290 places in 299 ms of which 0 ms to minimize.
[2022-05-17 19:06:37] [INFO ] Deduced a trap composed of 298 places in 297 ms of which 1 ms to minimize.
[2022-05-17 19:06:37] [INFO ] Deduced a trap composed of 300 places in 297 ms of which 1 ms to minimize.
[2022-05-17 19:06:37] [INFO ] Deduced a trap composed of 308 places in 294 ms of which 1 ms to minimize.
[2022-05-17 19:06:39] [INFO ] Deduced a trap composed of 304 places in 303 ms of which 1 ms to minimize.
[2022-05-17 19:06:42] [INFO ] Deduced a trap composed of 302 places in 303 ms of which 1 ms to minimize.
[2022-05-17 19:06:42] [INFO ] Deduced a trap composed of 302 places in 297 ms of which 1 ms to minimize.
[2022-05-17 19:06:43] [INFO ] Deduced a trap composed of 298 places in 296 ms of which 1 ms to minimize.
[2022-05-17 19:06:43] [INFO ] Deduced a trap composed of 298 places in 304 ms of which 0 ms to minimize.
[2022-05-17 19:06:43] [INFO ] Deduced a trap composed of 302 places in 309 ms of which 1 ms to minimize.
[2022-05-17 19:06:50] [INFO ] Deduced a trap composed of 302 places in 306 ms of which 1 ms to minimize.
[2022-05-17 19:06:51] [INFO ] Deduced a trap composed of 300 places in 303 ms of which 0 ms to minimize.
[2022-05-17 19:06:52] [INFO ] Deduced a trap composed of 306 places in 303 ms of which 1 ms to minimize.
[2022-05-17 19:06:53] [INFO ] Deduced a trap composed of 302 places in 300 ms of which 1 ms to minimize.
[2022-05-17 19:06:54] [INFO ] Deduced a trap composed of 302 places in 294 ms of which 0 ms to minimize.
[2022-05-17 19:06:59] [INFO ] Deduced a trap composed of 308 places in 303 ms of which 0 ms to minimize.
[2022-05-17 19:07:00] [INFO ] Deduced a trap composed of 308 places in 304 ms of which 0 ms to minimize.
[2022-05-17 19:07:00] [INFO ] Deduced a trap composed of 300 places in 298 ms of which 0 ms to minimize.
[2022-05-17 19:07:01] [INFO ] Deduced a trap composed of 300 places in 309 ms of which 1 ms to minimize.
[2022-05-17 19:07:01] [INFO ] Deduced a trap composed of 310 places in 302 ms of which 1 ms to minimize.
[2022-05-17 19:07:02] [INFO ] Deduced a trap composed of 306 places in 296 ms of which 0 ms to minimize.
[2022-05-17 19:07:02] [INFO ] Deduced a trap composed of 312 places in 295 ms of which 1 ms to minimize.
[2022-05-17 19:07:02] [INFO ] Deduced a trap composed of 302 places in 303 ms of which 1 ms to minimize.
[2022-05-17 19:07:03] [INFO ] Deduced a trap composed of 294 places in 302 ms of which 1 ms to minimize.
[2022-05-17 19:07:06] [INFO ] Deduced a trap composed of 310 places in 315 ms of which 0 ms to minimize.
[2022-05-17 19:07:07] [INFO ] Deduced a trap composed of 300 places in 304 ms of which 1 ms to minimize.
[2022-05-17 19:07:07] [INFO ] Deduced a trap composed of 300 places in 306 ms of which 0 ms to minimize.
[2022-05-17 19:07:08] [INFO ] Deduced a trap composed of 300 places in 311 ms of which 1 ms to minimize.
[2022-05-17 19:07:12] [INFO ] Deduced a trap composed of 298 places in 306 ms of which 0 ms to minimize.
[2022-05-17 19:07:16] [INFO ] Deduced a trap composed of 302 places in 299 ms of which 1 ms to minimize.
[2022-05-17 19:07:16] [INFO ] Deduced a trap composed of 300 places in 316 ms of which 1 ms to minimize.
[2022-05-17 19:07:21] [INFO ] Deduced a trap composed of 300 places in 304 ms of which 0 ms to minimize.
[2022-05-17 19:07:30] [INFO ] Trap strengthening (SAT) tested/added 106/106 trap constraints in 86151 ms
[2022-05-17 19:07:30] [INFO ] After 87021ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2022-05-17 19:07:30] [INFO ] After 87546ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Incomplete random walk after 1000000 steps, including 72590 resets, run finished after 9707 ms. (steps per millisecond=103 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 8225 resets, run finished after 1758 ms. (steps per millisecond=568 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 4511792 steps, run timeout after 33001 ms. (steps per millisecond=136 ) properties seen :{}
Probabilistic random walk after 4511792 steps, saw 769683 distinct states, run finished after 33001 ms. (steps per millisecond=136 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-17 19:08:15] [INFO ] Flow matrix only has 1512 transitions (discarded 9 similar events)
// Phase 1: matrix 1512 rows 750 cols
[2022-05-17 19:08:15] [INFO ] Computed 102 place invariants in 23 ms
[2022-05-17 19:08:15] [INFO ] [Real]Absence check using 95 positive place invariants in 22 ms returned sat
[2022-05-17 19:08:15] [INFO ] [Real]Absence check using 95 positive and 7 generalized place invariants in 16 ms returned sat
[2022-05-17 19:08:15] [INFO ] After 146ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 19:08:15] [INFO ] [Nat]Absence check using 95 positive place invariants in 22 ms returned sat
[2022-05-17 19:08:15] [INFO ] [Nat]Absence check using 95 positive and 7 generalized place invariants in 16 ms returned sat
[2022-05-17 19:08:15] [INFO ] After 393ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 19:08:15] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-17 19:08:16] [INFO ] After 613ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 19:08:16] [INFO ] Deduced a trap composed of 300 places in 334 ms of which 1 ms to minimize.
[2022-05-17 19:08:17] [INFO ] Deduced a trap composed of 296 places in 322 ms of which 1 ms to minimize.
[2022-05-17 19:08:17] [INFO ] Deduced a trap composed of 306 places in 313 ms of which 1 ms to minimize.
[2022-05-17 19:08:17] [INFO ] Deduced a trap composed of 294 places in 312 ms of which 0 ms to minimize.
[2022-05-17 19:08:18] [INFO ] Deduced a trap composed of 300 places in 310 ms of which 1 ms to minimize.
[2022-05-17 19:08:18] [INFO ] Deduced a trap composed of 294 places in 301 ms of which 1 ms to minimize.
[2022-05-17 19:08:19] [INFO ] Deduced a trap composed of 298 places in 304 ms of which 0 ms to minimize.
[2022-05-17 19:08:19] [INFO ] Deduced a trap composed of 300 places in 298 ms of which 0 ms to minimize.
[2022-05-17 19:08:19] [INFO ] Deduced a trap composed of 292 places in 307 ms of which 0 ms to minimize.
[2022-05-17 19:08:20] [INFO ] Deduced a trap composed of 304 places in 303 ms of which 1 ms to minimize.
[2022-05-17 19:08:20] [INFO ] Deduced a trap composed of 306 places in 303 ms of which 1 ms to minimize.
[2022-05-17 19:08:20] [INFO ] Deduced a trap composed of 296 places in 301 ms of which 1 ms to minimize.
[2022-05-17 19:08:21] [INFO ] Deduced a trap composed of 308 places in 305 ms of which 1 ms to minimize.
[2022-05-17 19:08:21] [INFO ] Deduced a trap composed of 302 places in 309 ms of which 0 ms to minimize.
[2022-05-17 19:08:22] [INFO ] Deduced a trap composed of 294 places in 313 ms of which 0 ms to minimize.
[2022-05-17 19:08:22] [INFO ] Deduced a trap composed of 300 places in 297 ms of which 1 ms to minimize.
[2022-05-17 19:08:23] [INFO ] Deduced a trap composed of 294 places in 295 ms of which 1 ms to minimize.
[2022-05-17 19:08:23] [INFO ] Deduced a trap composed of 302 places in 299 ms of which 1 ms to minimize.
[2022-05-17 19:08:23] [INFO ] Deduced a trap composed of 300 places in 299 ms of which 1 ms to minimize.
[2022-05-17 19:08:24] [INFO ] Deduced a trap composed of 305 places in 314 ms of which 1 ms to minimize.
[2022-05-17 19:08:24] [INFO ] Deduced a trap composed of 292 places in 305 ms of which 0 ms to minimize.
[2022-05-17 19:08:25] [INFO ] Deduced a trap composed of 302 places in 306 ms of which 1 ms to minimize.
[2022-05-17 19:08:25] [INFO ] Deduced a trap composed of 300 places in 306 ms of which 0 ms to minimize.
[2022-05-17 19:08:25] [INFO ] Deduced a trap composed of 300 places in 304 ms of which 1 ms to minimize.
[2022-05-17 19:08:26] [INFO ] Deduced a trap composed of 296 places in 310 ms of which 1 ms to minimize.
[2022-05-17 19:08:26] [INFO ] Deduced a trap composed of 302 places in 299 ms of which 1 ms to minimize.
[2022-05-17 19:08:27] [INFO ] Deduced a trap composed of 294 places in 311 ms of which 0 ms to minimize.
[2022-05-17 19:08:27] [INFO ] Deduced a trap composed of 294 places in 302 ms of which 1 ms to minimize.
[2022-05-17 19:08:27] [INFO ] Deduced a trap composed of 294 places in 299 ms of which 1 ms to minimize.
[2022-05-17 19:08:28] [INFO ] Deduced a trap composed of 302 places in 300 ms of which 0 ms to minimize.
[2022-05-17 19:08:28] [INFO ] Deduced a trap composed of 302 places in 300 ms of which 0 ms to minimize.
[2022-05-17 19:08:28] [INFO ] Deduced a trap composed of 294 places in 310 ms of which 0 ms to minimize.
[2022-05-17 19:08:29] [INFO ] Deduced a trap composed of 300 places in 300 ms of which 1 ms to minimize.
[2022-05-17 19:08:29] [INFO ] Deduced a trap composed of 306 places in 306 ms of which 0 ms to minimize.
[2022-05-17 19:08:30] [INFO ] Deduced a trap composed of 300 places in 303 ms of which 1 ms to minimize.
[2022-05-17 19:08:30] [INFO ] Deduced a trap composed of 302 places in 298 ms of which 0 ms to minimize.
[2022-05-17 19:08:30] [INFO ] Deduced a trap composed of 298 places in 299 ms of which 0 ms to minimize.
[2022-05-17 19:08:31] [INFO ] Deduced a trap composed of 300 places in 310 ms of which 1 ms to minimize.
[2022-05-17 19:08:31] [INFO ] Deduced a trap composed of 302 places in 300 ms of which 0 ms to minimize.
[2022-05-17 19:08:31] [INFO ] Deduced a trap composed of 302 places in 300 ms of which 1 ms to minimize.
[2022-05-17 19:08:32] [INFO ] Deduced a trap composed of 302 places in 296 ms of which 1 ms to minimize.
[2022-05-17 19:08:32] [INFO ] Deduced a trap composed of 296 places in 292 ms of which 1 ms to minimize.
[2022-05-17 19:08:32] [INFO ] Deduced a trap composed of 300 places in 302 ms of which 1 ms to minimize.
[2022-05-17 19:08:33] [INFO ] Deduced a trap composed of 296 places in 304 ms of which 1 ms to minimize.
[2022-05-17 19:08:33] [INFO ] Deduced a trap composed of 296 places in 308 ms of which 1 ms to minimize.
[2022-05-17 19:08:34] [INFO ] Deduced a trap composed of 308 places in 303 ms of which 1 ms to minimize.
[2022-05-17 19:08:34] [INFO ] Deduced a trap composed of 302 places in 305 ms of which 0 ms to minimize.
[2022-05-17 19:08:35] [INFO ] Deduced a trap composed of 304 places in 302 ms of which 1 ms to minimize.
[2022-05-17 19:08:35] [INFO ] Deduced a trap composed of 300 places in 301 ms of which 0 ms to minimize.
[2022-05-17 19:08:36] [INFO ] Deduced a trap composed of 296 places in 295 ms of which 1 ms to minimize.
[2022-05-17 19:08:36] [INFO ] Deduced a trap composed of 306 places in 296 ms of which 1 ms to minimize.
[2022-05-17 19:08:37] [INFO ] Deduced a trap composed of 300 places in 300 ms of which 1 ms to minimize.
[2022-05-17 19:08:37] [INFO ] Deduced a trap composed of 300 places in 303 ms of which 1 ms to minimize.
[2022-05-17 19:08:38] [INFO ] Deduced a trap composed of 306 places in 307 ms of which 0 ms to minimize.
[2022-05-17 19:08:38] [INFO ] Deduced a trap composed of 294 places in 302 ms of which 1 ms to minimize.
[2022-05-17 19:08:39] [INFO ] Deduced a trap composed of 302 places in 308 ms of which 1 ms to minimize.
[2022-05-17 19:08:40] [INFO ] Deduced a trap composed of 294 places in 306 ms of which 1 ms to minimize.
[2022-05-17 19:08:40] [INFO ] Deduced a trap composed of 298 places in 305 ms of which 1 ms to minimize.
[2022-05-17 19:08:41] [INFO ] Deduced a trap composed of 304 places in 306 ms of which 1 ms to minimize.
[2022-05-17 19:08:42] [INFO ] Deduced a trap composed of 304 places in 303 ms of which 0 ms to minimize.
[2022-05-17 19:08:42] [INFO ] Deduced a trap composed of 302 places in 302 ms of which 1 ms to minimize.
[2022-05-17 19:08:42] [INFO ] Deduced a trap composed of 300 places in 304 ms of which 1 ms to minimize.
[2022-05-17 19:08:43] [INFO ] Deduced a trap composed of 296 places in 298 ms of which 1 ms to minimize.
[2022-05-17 19:08:43] [INFO ] Deduced a trap composed of 290 places in 304 ms of which 1 ms to minimize.
[2022-05-17 19:08:44] [INFO ] Deduced a trap composed of 312 places in 305 ms of which 1 ms to minimize.
[2022-05-17 19:08:44] [INFO ] Deduced a trap composed of 296 places in 306 ms of which 0 ms to minimize.
[2022-05-17 19:08:44] [INFO ] Deduced a trap composed of 294 places in 306 ms of which 1 ms to minimize.
[2022-05-17 19:08:45] [INFO ] Deduced a trap composed of 298 places in 307 ms of which 1 ms to minimize.
[2022-05-17 19:08:46] [INFO ] Deduced a trap composed of 302 places in 305 ms of which 1 ms to minimize.
[2022-05-17 19:08:46] [INFO ] Deduced a trap composed of 304 places in 307 ms of which 1 ms to minimize.
[2022-05-17 19:08:47] [INFO ] Deduced a trap composed of 298 places in 303 ms of which 1 ms to minimize.
[2022-05-17 19:08:47] [INFO ] Deduced a trap composed of 304 places in 304 ms of which 0 ms to minimize.
[2022-05-17 19:08:48] [INFO ] Deduced a trap composed of 292 places in 300 ms of which 0 ms to minimize.
[2022-05-17 19:08:48] [INFO ] Deduced a trap composed of 304 places in 302 ms of which 0 ms to minimize.
[2022-05-17 19:08:49] [INFO ] Deduced a trap composed of 290 places in 298 ms of which 0 ms to minimize.
[2022-05-17 19:08:49] [INFO ] Deduced a trap composed of 298 places in 302 ms of which 1 ms to minimize.
[2022-05-17 19:08:49] [INFO ] Deduced a trap composed of 300 places in 303 ms of which 0 ms to minimize.
[2022-05-17 19:08:50] [INFO ] Deduced a trap composed of 308 places in 300 ms of which 1 ms to minimize.
[2022-05-17 19:08:52] [INFO ] Deduced a trap composed of 304 places in 302 ms of which 1 ms to minimize.
[2022-05-17 19:08:54] [INFO ] Deduced a trap composed of 302 places in 303 ms of which 0 ms to minimize.
[2022-05-17 19:08:55] [INFO ] Deduced a trap composed of 302 places in 303 ms of which 1 ms to minimize.
[2022-05-17 19:08:55] [INFO ] Deduced a trap composed of 298 places in 306 ms of which 1 ms to minimize.
[2022-05-17 19:08:55] [INFO ] Deduced a trap composed of 298 places in 308 ms of which 0 ms to minimize.
[2022-05-17 19:08:56] [INFO ] Deduced a trap composed of 302 places in 302 ms of which 1 ms to minimize.
[2022-05-17 19:09:02] [INFO ] Deduced a trap composed of 302 places in 299 ms of which 0 ms to minimize.
[2022-05-17 19:09:04] [INFO ] Deduced a trap composed of 300 places in 305 ms of which 1 ms to minimize.
[2022-05-17 19:09:04] [INFO ] Deduced a trap composed of 306 places in 304 ms of which 1 ms to minimize.
[2022-05-17 19:09:06] [INFO ] Deduced a trap composed of 302 places in 310 ms of which 1 ms to minimize.
[2022-05-17 19:09:06] [INFO ] Deduced a trap composed of 302 places in 298 ms of which 1 ms to minimize.
[2022-05-17 19:09:12] [INFO ] Deduced a trap composed of 308 places in 302 ms of which 0 ms to minimize.
[2022-05-17 19:09:12] [INFO ] Deduced a trap composed of 308 places in 312 ms of which 1 ms to minimize.
[2022-05-17 19:09:13] [INFO ] Deduced a trap composed of 300 places in 300 ms of which 1 ms to minimize.
[2022-05-17 19:09:13] [INFO ] Deduced a trap composed of 300 places in 303 ms of which 1 ms to minimize.
[2022-05-17 19:09:14] [INFO ] Deduced a trap composed of 310 places in 297 ms of which 1 ms to minimize.
[2022-05-17 19:09:14] [INFO ] Deduced a trap composed of 306 places in 292 ms of which 0 ms to minimize.
[2022-05-17 19:09:15] [INFO ] Deduced a trap composed of 312 places in 303 ms of which 1 ms to minimize.
[2022-05-17 19:09:15] [INFO ] Deduced a trap composed of 302 places in 299 ms of which 1 ms to minimize.
[2022-05-17 19:09:15] [INFO ] Deduced a trap composed of 294 places in 304 ms of which 0 ms to minimize.
[2022-05-17 19:09:19] [INFO ] Deduced a trap composed of 310 places in 301 ms of which 0 ms to minimize.
[2022-05-17 19:09:19] [INFO ] Deduced a trap composed of 300 places in 302 ms of which 0 ms to minimize.
[2022-05-17 19:09:20] [INFO ] Deduced a trap composed of 300 places in 306 ms of which 1 ms to minimize.
[2022-05-17 19:09:20] [INFO ] Deduced a trap composed of 300 places in 306 ms of which 1 ms to minimize.
[2022-05-17 19:09:25] [INFO ] Deduced a trap composed of 298 places in 304 ms of which 1 ms to minimize.
[2022-05-17 19:09:28] [INFO ] Deduced a trap composed of 302 places in 297 ms of which 1 ms to minimize.
[2022-05-17 19:09:29] [INFO ] Deduced a trap composed of 300 places in 304 ms of which 1 ms to minimize.
[2022-05-17 19:09:33] [INFO ] Deduced a trap composed of 300 places in 307 ms of which 1 ms to minimize.
[2022-05-17 19:09:42] [INFO ] Trap strengthening (SAT) tested/added 106/106 trap constraints in 86300 ms
[2022-05-17 19:09:42] [INFO ] After 87047ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2022-05-17 19:09:42] [INFO ] After 87586ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 16 ms.
Support contains 1 out of 750 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 750/750 places, 1521/1521 transitions.
Applied a total of 0 rules in 45 ms. Remains 750 /750 variables (removed 0) and now considering 1521/1521 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 750/750 places, 1521/1521 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 750/750 places, 1521/1521 transitions.
Applied a total of 0 rules in 31 ms. Remains 750 /750 variables (removed 0) and now considering 1521/1521 (removed 0) transitions.
[2022-05-17 19:09:42] [INFO ] Flow matrix only has 1512 transitions (discarded 9 similar events)
// Phase 1: matrix 1512 rows 750 cols
[2022-05-17 19:09:42] [INFO ] Computed 102 place invariants in 20 ms
[2022-05-17 19:09:43] [INFO ] Implicit Places using invariants in 542 ms returned []
[2022-05-17 19:09:43] [INFO ] Flow matrix only has 1512 transitions (discarded 9 similar events)
// Phase 1: matrix 1512 rows 750 cols
[2022-05-17 19:09:43] [INFO ] Computed 102 place invariants in 27 ms
[2022-05-17 19:09:43] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-17 19:09:47] [INFO ] Implicit Places using invariants and state equation in 4292 ms returned []
Implicit Place search using SMT with State Equation took 4836 ms to find 0 implicit places.
[2022-05-17 19:09:47] [INFO ] Redundant transitions in 75 ms returned []
[2022-05-17 19:09:47] [INFO ] Flow matrix only has 1512 transitions (discarded 9 similar events)
// Phase 1: matrix 1512 rows 750 cols
[2022-05-17 19:09:47] [INFO ] Computed 102 place invariants in 23 ms
[2022-05-17 19:09:48] [INFO ] Dead Transitions using invariants and state equation in 670 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 750/750 places, 1521/1521 transitions.
Incomplete random walk after 100000 steps, including 7331 resets, run finished after 963 ms. (steps per millisecond=103 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2022-05-17 19:09:49] [INFO ] Flow matrix only has 1512 transitions (discarded 9 similar events)
// Phase 1: matrix 1512 rows 750 cols
[2022-05-17 19:09:49] [INFO ] Computed 102 place invariants in 25 ms
[2022-05-17 19:09:49] [INFO ] [Real]Absence check using 95 positive place invariants in 21 ms returned sat
[2022-05-17 19:09:49] [INFO ] [Real]Absence check using 95 positive and 7 generalized place invariants in 16 ms returned sat
[2022-05-17 19:09:49] [INFO ] After 143ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 19:09:49] [INFO ] [Nat]Absence check using 95 positive place invariants in 20 ms returned sat
[2022-05-17 19:09:49] [INFO ] [Nat]Absence check using 95 positive and 7 generalized place invariants in 16 ms returned sat
[2022-05-17 19:09:50] [INFO ] After 387ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 19:09:50] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-17 19:09:50] [INFO ] After 613ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 19:09:51] [INFO ] Deduced a trap composed of 300 places in 324 ms of which 1 ms to minimize.
[2022-05-17 19:09:51] [INFO ] Deduced a trap composed of 296 places in 307 ms of which 0 ms to minimize.
[2022-05-17 19:09:51] [INFO ] Deduced a trap composed of 306 places in 298 ms of which 0 ms to minimize.
[2022-05-17 19:09:52] [INFO ] Deduced a trap composed of 294 places in 305 ms of which 1 ms to minimize.
[2022-05-17 19:09:52] [INFO ] Deduced a trap composed of 300 places in 307 ms of which 1 ms to minimize.
[2022-05-17 19:09:53] [INFO ] Deduced a trap composed of 294 places in 302 ms of which 0 ms to minimize.
[2022-05-17 19:09:53] [INFO ] Deduced a trap composed of 298 places in 301 ms of which 0 ms to minimize.
[2022-05-17 19:09:53] [INFO ] Deduced a trap composed of 300 places in 306 ms of which 1 ms to minimize.
[2022-05-17 19:09:54] [INFO ] Deduced a trap composed of 292 places in 299 ms of which 0 ms to minimize.
[2022-05-17 19:09:54] [INFO ] Deduced a trap composed of 304 places in 297 ms of which 1 ms to minimize.
[2022-05-17 19:09:54] [INFO ] Deduced a trap composed of 306 places in 297 ms of which 0 ms to minimize.
[2022-05-17 19:09:55] [INFO ] Deduced a trap composed of 296 places in 292 ms of which 0 ms to minimize.
[2022-05-17 19:09:55] [INFO ] Deduced a trap composed of 308 places in 297 ms of which 1 ms to minimize.
[2022-05-17 19:09:56] [INFO ] Deduced a trap composed of 302 places in 293 ms of which 1 ms to minimize.
[2022-05-17 19:09:56] [INFO ] Deduced a trap composed of 294 places in 296 ms of which 0 ms to minimize.
[2022-05-17 19:09:56] [INFO ] Deduced a trap composed of 300 places in 299 ms of which 0 ms to minimize.
[2022-05-17 19:09:57] [INFO ] Deduced a trap composed of 294 places in 294 ms of which 0 ms to minimize.
[2022-05-17 19:09:57] [INFO ] Deduced a trap composed of 302 places in 301 ms of which 0 ms to minimize.
[2022-05-17 19:09:57] [INFO ] Deduced a trap composed of 300 places in 301 ms of which 1 ms to minimize.
[2022-05-17 19:09:58] [INFO ] Deduced a trap composed of 305 places in 309 ms of which 1 ms to minimize.
[2022-05-17 19:09:58] [INFO ] Deduced a trap composed of 292 places in 298 ms of which 0 ms to minimize.
[2022-05-17 19:09:59] [INFO ] Deduced a trap composed of 302 places in 299 ms of which 0 ms to minimize.
[2022-05-17 19:09:59] [INFO ] Deduced a trap composed of 300 places in 305 ms of which 1 ms to minimize.
[2022-05-17 19:10:00] [INFO ] Deduced a trap composed of 300 places in 304 ms of which 1 ms to minimize.
[2022-05-17 19:10:00] [INFO ] Deduced a trap composed of 296 places in 308 ms of which 1 ms to minimize.
[2022-05-17 19:10:00] [INFO ] Deduced a trap composed of 302 places in 311 ms of which 1 ms to minimize.
[2022-05-17 19:10:01] [INFO ] Deduced a trap composed of 294 places in 311 ms of which 1 ms to minimize.
[2022-05-17 19:10:01] [INFO ] Deduced a trap composed of 294 places in 312 ms of which 0 ms to minimize.
[2022-05-17 19:10:02] [INFO ] Deduced a trap composed of 294 places in 314 ms of which 1 ms to minimize.
[2022-05-17 19:10:02] [INFO ] Deduced a trap composed of 302 places in 310 ms of which 0 ms to minimize.
[2022-05-17 19:10:02] [INFO ] Deduced a trap composed of 302 places in 311 ms of which 1 ms to minimize.
[2022-05-17 19:10:03] [INFO ] Deduced a trap composed of 294 places in 311 ms of which 1 ms to minimize.
[2022-05-17 19:10:03] [INFO ] Deduced a trap composed of 300 places in 313 ms of which 1 ms to minimize.
[2022-05-17 19:10:04] [INFO ] Deduced a trap composed of 306 places in 302 ms of which 1 ms to minimize.
[2022-05-17 19:10:04] [INFO ] Deduced a trap composed of 300 places in 306 ms of which 0 ms to minimize.
[2022-05-17 19:10:04] [INFO ] Deduced a trap composed of 302 places in 306 ms of which 0 ms to minimize.
[2022-05-17 19:10:05] [INFO ] Deduced a trap composed of 298 places in 307 ms of which 1 ms to minimize.
[2022-05-17 19:10:05] [INFO ] Deduced a trap composed of 300 places in 304 ms of which 0 ms to minimize.
[2022-05-17 19:10:05] [INFO ] Deduced a trap composed of 302 places in 302 ms of which 0 ms to minimize.
[2022-05-17 19:10:06] [INFO ] Deduced a trap composed of 302 places in 306 ms of which 0 ms to minimize.
[2022-05-17 19:10:06] [INFO ] Deduced a trap composed of 302 places in 298 ms of which 1 ms to minimize.
[2022-05-17 19:10:06] [INFO ] Deduced a trap composed of 296 places in 299 ms of which 1 ms to minimize.
[2022-05-17 19:10:07] [INFO ] Deduced a trap composed of 300 places in 311 ms of which 1 ms to minimize.
[2022-05-17 19:10:07] [INFO ] Deduced a trap composed of 296 places in 300 ms of which 0 ms to minimize.
[2022-05-17 19:10:08] [INFO ] Deduced a trap composed of 296 places in 305 ms of which 0 ms to minimize.
[2022-05-17 19:10:08] [INFO ] Deduced a trap composed of 308 places in 297 ms of which 1 ms to minimize.
[2022-05-17 19:10:09] [INFO ] Deduced a trap composed of 302 places in 295 ms of which 1 ms to minimize.
[2022-05-17 19:10:09] [INFO ] Deduced a trap composed of 304 places in 297 ms of which 1 ms to minimize.
[2022-05-17 19:10:10] [INFO ] Deduced a trap composed of 300 places in 300 ms of which 1 ms to minimize.
[2022-05-17 19:10:10] [INFO ] Deduced a trap composed of 296 places in 296 ms of which 1 ms to minimize.
[2022-05-17 19:10:10] [INFO ] Deduced a trap composed of 306 places in 304 ms of which 0 ms to minimize.
[2022-05-17 19:10:11] [INFO ] Deduced a trap composed of 300 places in 303 ms of which 0 ms to minimize.
[2022-05-17 19:10:12] [INFO ] Deduced a trap composed of 300 places in 301 ms of which 1 ms to minimize.
[2022-05-17 19:10:12] [INFO ] Deduced a trap composed of 306 places in 300 ms of which 0 ms to minimize.
[2022-05-17 19:10:13] [INFO ] Deduced a trap composed of 294 places in 294 ms of which 1 ms to minimize.
[2022-05-17 19:10:14] [INFO ] Deduced a trap composed of 302 places in 312 ms of which 0 ms to minimize.
[2022-05-17 19:10:14] [INFO ] Deduced a trap composed of 294 places in 304 ms of which 0 ms to minimize.
[2022-05-17 19:10:15] [INFO ] Deduced a trap composed of 298 places in 301 ms of which 1 ms to minimize.
[2022-05-17 19:10:15] [INFO ] Deduced a trap composed of 304 places in 306 ms of which 1 ms to minimize.
[2022-05-17 19:10:16] [INFO ] Deduced a trap composed of 304 places in 303 ms of which 0 ms to minimize.
[2022-05-17 19:10:16] [INFO ] Deduced a trap composed of 302 places in 308 ms of which 0 ms to minimize.
[2022-05-17 19:10:17] [INFO ] Deduced a trap composed of 300 places in 307 ms of which 0 ms to minimize.
[2022-05-17 19:10:17] [INFO ] Deduced a trap composed of 296 places in 300 ms of which 1 ms to minimize.
[2022-05-17 19:10:18] [INFO ] Deduced a trap composed of 290 places in 305 ms of which 1 ms to minimize.
[2022-05-17 19:10:18] [INFO ] Deduced a trap composed of 312 places in 304 ms of which 1 ms to minimize.
[2022-05-17 19:10:18] [INFO ] Deduced a trap composed of 296 places in 304 ms of which 1 ms to minimize.
[2022-05-17 19:10:19] [INFO ] Deduced a trap composed of 294 places in 302 ms of which 1 ms to minimize.
[2022-05-17 19:10:20] [INFO ] Deduced a trap composed of 298 places in 315 ms of which 1 ms to minimize.
[2022-05-17 19:10:20] [INFO ] Deduced a trap composed of 302 places in 304 ms of which 1 ms to minimize.
[2022-05-17 19:10:21] [INFO ] Deduced a trap composed of 304 places in 305 ms of which 1 ms to minimize.
[2022-05-17 19:10:21] [INFO ] Deduced a trap composed of 298 places in 301 ms of which 0 ms to minimize.
[2022-05-17 19:10:22] [INFO ] Deduced a trap composed of 304 places in 302 ms of which 0 ms to minimize.
[2022-05-17 19:10:22] [INFO ] Deduced a trap composed of 292 places in 312 ms of which 1 ms to minimize.
[2022-05-17 19:10:23] [INFO ] Deduced a trap composed of 304 places in 300 ms of which 1 ms to minimize.
[2022-05-17 19:10:23] [INFO ] Deduced a trap composed of 290 places in 299 ms of which 1 ms to minimize.
[2022-05-17 19:10:23] [INFO ] Deduced a trap composed of 298 places in 298 ms of which 0 ms to minimize.
[2022-05-17 19:10:24] [INFO ] Deduced a trap composed of 300 places in 305 ms of which 1 ms to minimize.
[2022-05-17 19:10:24] [INFO ] Deduced a trap composed of 308 places in 297 ms of which 1 ms to minimize.
[2022-05-17 19:10:26] [INFO ] Deduced a trap composed of 304 places in 305 ms of which 1 ms to minimize.
[2022-05-17 19:10:29] [INFO ] Deduced a trap composed of 302 places in 302 ms of which 0 ms to minimize.
[2022-05-17 19:10:29] [INFO ] Deduced a trap composed of 302 places in 294 ms of which 1 ms to minimize.
[2022-05-17 19:10:29] [INFO ] Deduced a trap composed of 298 places in 305 ms of which 1 ms to minimize.
[2022-05-17 19:10:30] [INFO ] Deduced a trap composed of 298 places in 297 ms of which 1 ms to minimize.
[2022-05-17 19:10:30] [INFO ] Deduced a trap composed of 302 places in 304 ms of which 0 ms to minimize.
[2022-05-17 19:10:37] [INFO ] Deduced a trap composed of 302 places in 303 ms of which 1 ms to minimize.
[2022-05-17 19:10:38] [INFO ] Deduced a trap composed of 300 places in 303 ms of which 1 ms to minimize.
[2022-05-17 19:10:38] [INFO ] Deduced a trap composed of 306 places in 297 ms of which 1 ms to minimize.
[2022-05-17 19:10:40] [INFO ] Deduced a trap composed of 302 places in 321 ms of which 0 ms to minimize.
[2022-05-17 19:10:40] [INFO ] Deduced a trap composed of 302 places in 299 ms of which 0 ms to minimize.
[2022-05-17 19:10:46] [INFO ] Deduced a trap composed of 308 places in 300 ms of which 0 ms to minimize.
[2022-05-17 19:10:47] [INFO ] Deduced a trap composed of 308 places in 298 ms of which 1 ms to minimize.
[2022-05-17 19:10:47] [INFO ] Deduced a trap composed of 300 places in 295 ms of which 1 ms to minimize.
[2022-05-17 19:10:48] [INFO ] Deduced a trap composed of 300 places in 302 ms of which 0 ms to minimize.
[2022-05-17 19:10:48] [INFO ] Deduced a trap composed of 310 places in 307 ms of which 1 ms to minimize.
[2022-05-17 19:10:49] [INFO ] Deduced a trap composed of 306 places in 302 ms of which 1 ms to minimize.
[2022-05-17 19:10:49] [INFO ] Deduced a trap composed of 312 places in 301 ms of which 1 ms to minimize.
[2022-05-17 19:10:49] [INFO ] Deduced a trap composed of 302 places in 297 ms of which 1 ms to minimize.
[2022-05-17 19:10:50] [INFO ] Deduced a trap composed of 294 places in 297 ms of which 1 ms to minimize.
[2022-05-17 19:10:53] [INFO ] Deduced a trap composed of 310 places in 310 ms of which 1 ms to minimize.
[2022-05-17 19:10:54] [INFO ] Deduced a trap composed of 300 places in 317 ms of which 0 ms to minimize.
[2022-05-17 19:10:54] [INFO ] Deduced a trap composed of 300 places in 312 ms of which 0 ms to minimize.
[2022-05-17 19:10:55] [INFO ] Deduced a trap composed of 300 places in 305 ms of which 1 ms to minimize.
[2022-05-17 19:10:59] [INFO ] Deduced a trap composed of 298 places in 313 ms of which 1 ms to minimize.
[2022-05-17 19:11:03] [INFO ] Deduced a trap composed of 302 places in 303 ms of which 1 ms to minimize.
[2022-05-17 19:11:04] [INFO ] Deduced a trap composed of 300 places in 308 ms of which 1 ms to minimize.
[2022-05-17 19:11:08] [INFO ] Deduced a trap composed of 300 places in 306 ms of which 1 ms to minimize.
[2022-05-17 19:11:17] [INFO ] Trap strengthening (SAT) tested/added 106/106 trap constraints in 86720 ms
[2022-05-17 19:11:17] [INFO ] After 87600ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2022-05-17 19:11:17] [INFO ] After 88133ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Incomplete random walk after 10000 steps, including 719 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 100 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 403665 steps, run timeout after 3001 ms. (steps per millisecond=134 ) properties seen :{}
Probabilistic random walk after 403665 steps, saw 64887 distinct states, run finished after 3001 ms. (steps per millisecond=134 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-17 19:11:20] [INFO ] Flow matrix only has 1512 transitions (discarded 9 similar events)
// Phase 1: matrix 1512 rows 750 cols
[2022-05-17 19:11:20] [INFO ] Computed 102 place invariants in 26 ms
[2022-05-17 19:11:21] [INFO ] [Real]Absence check using 95 positive place invariants in 21 ms returned sat
[2022-05-17 19:11:21] [INFO ] [Real]Absence check using 95 positive and 7 generalized place invariants in 16 ms returned sat
[2022-05-17 19:11:21] [INFO ] After 139ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 19:11:21] [INFO ] [Nat]Absence check using 95 positive place invariants in 21 ms returned sat
[2022-05-17 19:11:21] [INFO ] [Nat]Absence check using 95 positive and 7 generalized place invariants in 15 ms returned sat
[2022-05-17 19:11:21] [INFO ] After 403ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 19:11:21] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-17 19:11:22] [INFO ] After 549ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 19:11:22] [INFO ] Deduced a trap composed of 302 places in 297 ms of which 1 ms to minimize.
[2022-05-17 19:11:22] [INFO ] Deduced a trap composed of 304 places in 313 ms of which 1 ms to minimize.
[2022-05-17 19:11:23] [INFO ] Deduced a trap composed of 298 places in 304 ms of which 0 ms to minimize.
[2022-05-17 19:11:23] [INFO ] Deduced a trap composed of 298 places in 297 ms of which 0 ms to minimize.
[2022-05-17 19:11:23] [INFO ] Deduced a trap composed of 312 places in 300 ms of which 0 ms to minimize.
[2022-05-17 19:11:24] [INFO ] Deduced a trap composed of 284 places in 301 ms of which 0 ms to minimize.
[2022-05-17 19:11:24] [INFO ] Deduced a trap composed of 300 places in 318 ms of which 1 ms to minimize.
[2022-05-17 19:11:25] [INFO ] Deduced a trap composed of 292 places in 307 ms of which 1 ms to minimize.
[2022-05-17 19:11:25] [INFO ] Deduced a trap composed of 300 places in 299 ms of which 0 ms to minimize.
[2022-05-17 19:11:25] [INFO ] Deduced a trap composed of 302 places in 297 ms of which 0 ms to minimize.
[2022-05-17 19:11:26] [INFO ] Deduced a trap composed of 306 places in 309 ms of which 1 ms to minimize.
[2022-05-17 19:11:26] [INFO ] Deduced a trap composed of 306 places in 299 ms of which 0 ms to minimize.
[2022-05-17 19:11:27] [INFO ] Deduced a trap composed of 298 places in 307 ms of which 1 ms to minimize.
[2022-05-17 19:11:27] [INFO ] Deduced a trap composed of 294 places in 300 ms of which 0 ms to minimize.
[2022-05-17 19:11:27] [INFO ] Deduced a trap composed of 304 places in 305 ms of which 1 ms to minimize.
[2022-05-17 19:11:28] [INFO ] Deduced a trap composed of 304 places in 302 ms of which 1 ms to minimize.
[2022-05-17 19:11:28] [INFO ] Deduced a trap composed of 302 places in 298 ms of which 0 ms to minimize.
[2022-05-17 19:11:28] [INFO ] Deduced a trap composed of 310 places in 299 ms of which 1 ms to minimize.
[2022-05-17 19:11:29] [INFO ] Deduced a trap composed of 294 places in 304 ms of which 0 ms to minimize.
[2022-05-17 19:11:29] [INFO ] Deduced a trap composed of 302 places in 303 ms of which 1 ms to minimize.
[2022-05-17 19:11:30] [INFO ] Deduced a trap composed of 304 places in 306 ms of which 1 ms to minimize.
[2022-05-17 19:11:30] [INFO ] Deduced a trap composed of 302 places in 312 ms of which 1 ms to minimize.
[2022-05-17 19:11:30] [INFO ] Deduced a trap composed of 302 places in 306 ms of which 1 ms to minimize.
[2022-05-17 19:11:31] [INFO ] Deduced a trap composed of 310 places in 306 ms of which 1 ms to minimize.
[2022-05-17 19:11:31] [INFO ] Deduced a trap composed of 290 places in 319 ms of which 0 ms to minimize.
[2022-05-17 19:11:32] [INFO ] Deduced a trap composed of 313 places in 331 ms of which 1 ms to minimize.
[2022-05-17 19:11:32] [INFO ] Deduced a trap composed of 298 places in 319 ms of which 1 ms to minimize.
[2022-05-17 19:11:32] [INFO ] Deduced a trap composed of 308 places in 308 ms of which 1 ms to minimize.
[2022-05-17 19:11:33] [INFO ] Deduced a trap composed of 300 places in 310 ms of which 0 ms to minimize.
[2022-05-17 19:11:33] [INFO ] Deduced a trap composed of 304 places in 308 ms of which 0 ms to minimize.
[2022-05-17 19:11:34] [INFO ] Deduced a trap composed of 298 places in 308 ms of which 1 ms to minimize.
[2022-05-17 19:11:34] [INFO ] Deduced a trap composed of 294 places in 306 ms of which 1 ms to minimize.
[2022-05-17 19:11:34] [INFO ] Deduced a trap composed of 296 places in 310 ms of which 1 ms to minimize.
[2022-05-17 19:11:35] [INFO ] Deduced a trap composed of 306 places in 303 ms of which 1 ms to minimize.
[2022-05-17 19:11:35] [INFO ] Deduced a trap composed of 308 places in 304 ms of which 0 ms to minimize.
[2022-05-17 19:11:36] [INFO ] Deduced a trap composed of 302 places in 306 ms of which 1 ms to minimize.
[2022-05-17 19:11:36] [INFO ] Deduced a trap composed of 294 places in 313 ms of which 1 ms to minimize.
[2022-05-17 19:11:37] [INFO ] Deduced a trap composed of 302 places in 305 ms of which 1 ms to minimize.
[2022-05-17 19:11:37] [INFO ] Deduced a trap composed of 308 places in 308 ms of which 0 ms to minimize.
[2022-05-17 19:11:37] [INFO ] Deduced a trap composed of 306 places in 301 ms of which 0 ms to minimize.
[2022-05-17 19:11:38] [INFO ] Deduced a trap composed of 298 places in 304 ms of which 1 ms to minimize.
[2022-05-17 19:11:38] [INFO ] Deduced a trap composed of 304 places in 314 ms of which 0 ms to minimize.
[2022-05-17 19:11:38] [INFO ] Deduced a trap composed of 300 places in 312 ms of which 1 ms to minimize.
[2022-05-17 19:11:39] [INFO ] Deduced a trap composed of 311 places in 306 ms of which 0 ms to minimize.
[2022-05-17 19:11:39] [INFO ] Deduced a trap composed of 304 places in 312 ms of which 1 ms to minimize.
[2022-05-17 19:11:40] [INFO ] Deduced a trap composed of 301 places in 321 ms of which 1 ms to minimize.
[2022-05-17 19:11:40] [INFO ] Deduced a trap composed of 305 places in 319 ms of which 0 ms to minimize.
[2022-05-17 19:11:41] [INFO ] Deduced a trap composed of 298 places in 308 ms of which 1 ms to minimize.
[2022-05-17 19:11:41] [INFO ] Deduced a trap composed of 309 places in 313 ms of which 1 ms to minimize.
[2022-05-17 19:11:41] [INFO ] Deduced a trap composed of 296 places in 309 ms of which 1 ms to minimize.
[2022-05-17 19:11:42] [INFO ] Deduced a trap composed of 298 places in 308 ms of which 1 ms to minimize.
[2022-05-17 19:11:42] [INFO ] Deduced a trap composed of 292 places in 307 ms of which 1 ms to minimize.
[2022-05-17 19:11:42] [INFO ] Deduced a trap composed of 298 places in 307 ms of which 1 ms to minimize.
[2022-05-17 19:11:43] [INFO ] Deduced a trap composed of 302 places in 301 ms of which 1 ms to minimize.
[2022-05-17 19:11:43] [INFO ] Deduced a trap composed of 300 places in 305 ms of which 1 ms to minimize.
[2022-05-17 19:11:44] [INFO ] Deduced a trap composed of 294 places in 306 ms of which 0 ms to minimize.
[2022-05-17 19:11:44] [INFO ] Deduced a trap composed of 302 places in 306 ms of which 1 ms to minimize.
[2022-05-17 19:11:44] [INFO ] Deduced a trap composed of 300 places in 315 ms of which 0 ms to minimize.
[2022-05-17 19:11:45] [INFO ] Deduced a trap composed of 302 places in 301 ms of which 0 ms to minimize.
[2022-05-17 19:11:45] [INFO ] Deduced a trap composed of 292 places in 305 ms of which 1 ms to minimize.
[2022-05-17 19:11:46] [INFO ] Deduced a trap composed of 300 places in 309 ms of which 1 ms to minimize.
[2022-05-17 19:11:46] [INFO ] Deduced a trap composed of 304 places in 304 ms of which 0 ms to minimize.
[2022-05-17 19:11:46] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-17 19:11:46] [INFO ] After 25295ms 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 750 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 750/750 places, 1521/1521 transitions.
Applied a total of 0 rules in 37 ms. Remains 750 /750 variables (removed 0) and now considering 1521/1521 (removed 0) transitions.
[2022-05-17 19:11:46] [INFO ] Flow matrix only has 1512 transitions (discarded 9 similar events)
// Phase 1: matrix 1512 rows 750 cols
[2022-05-17 19:11:46] [INFO ] Computed 102 place invariants in 26 ms
[2022-05-17 19:11:47] [INFO ] Dead Transitions using invariants and state equation in 707 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 750/750 places, 1521/1521 transitions.
Incomplete random walk after 10000 steps, including 751 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 78 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 401020 steps, run timeout after 3001 ms. (steps per millisecond=133 ) properties seen :{}
Probabilistic random walk after 401020 steps, saw 64483 distinct states, run finished after 3001 ms. (steps per millisecond=133 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-17 19:11:50] [INFO ] Flow matrix only has 1512 transitions (discarded 9 similar events)
// Phase 1: matrix 1512 rows 750 cols
[2022-05-17 19:11:50] [INFO ] Computed 102 place invariants in 24 ms
[2022-05-17 19:11:50] [INFO ] [Real]Absence check using 95 positive place invariants in 21 ms returned sat
[2022-05-17 19:11:50] [INFO ] [Real]Absence check using 95 positive and 7 generalized place invariants in 16 ms returned sat
[2022-05-17 19:11:50] [INFO ] After 141ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 19:11:50] [INFO ] [Nat]Absence check using 95 positive place invariants in 21 ms returned sat
[2022-05-17 19:11:50] [INFO ] [Nat]Absence check using 95 positive and 7 generalized place invariants in 16 ms returned sat
[2022-05-17 19:11:51] [INFO ] After 415ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 19:11:51] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-17 19:11:51] [INFO ] After 560ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 19:11:51] [INFO ] Deduced a trap composed of 302 places in 307 ms of which 1 ms to minimize.
[2022-05-17 19:11:52] [INFO ] Deduced a trap composed of 304 places in 311 ms of which 1 ms to minimize.
[2022-05-17 19:11:52] [INFO ] Deduced a trap composed of 298 places in 319 ms of which 0 ms to minimize.
[2022-05-17 19:11:53] [INFO ] Deduced a trap composed of 298 places in 317 ms of which 1 ms to minimize.
[2022-05-17 19:11:53] [INFO ] Deduced a trap composed of 312 places in 316 ms of which 1 ms to minimize.
[2022-05-17 19:11:53] [INFO ] Deduced a trap composed of 284 places in 312 ms of which 1 ms to minimize.
[2022-05-17 19:11:54] [INFO ] Deduced a trap composed of 300 places in 307 ms of which 1 ms to minimize.
[2022-05-17 19:11:54] [INFO ] Deduced a trap composed of 292 places in 308 ms of which 1 ms to minimize.
[2022-05-17 19:11:54] [INFO ] Deduced a trap composed of 300 places in 305 ms of which 1 ms to minimize.
[2022-05-17 19:11:55] [INFO ] Deduced a trap composed of 302 places in 311 ms of which 0 ms to minimize.
[2022-05-17 19:11:55] [INFO ] Deduced a trap composed of 306 places in 316 ms of which 1 ms to minimize.
[2022-05-17 19:11:56] [INFO ] Deduced a trap composed of 306 places in 310 ms of which 1 ms to minimize.
[2022-05-17 19:11:56] [INFO ] Deduced a trap composed of 298 places in 307 ms of which 1 ms to minimize.
[2022-05-17 19:11:56] [INFO ] Deduced a trap composed of 294 places in 307 ms of which 1 ms to minimize.
[2022-05-17 19:11:57] [INFO ] Deduced a trap composed of 304 places in 316 ms of which 1 ms to minimize.
[2022-05-17 19:11:57] [INFO ] Deduced a trap composed of 304 places in 310 ms of which 0 ms to minimize.
[2022-05-17 19:11:57] [INFO ] Deduced a trap composed of 302 places in 299 ms of which 0 ms to minimize.
[2022-05-17 19:11:58] [INFO ] Deduced a trap composed of 310 places in 302 ms of which 1 ms to minimize.
[2022-05-17 19:11:58] [INFO ] Deduced a trap composed of 294 places in 295 ms of which 1 ms to minimize.
[2022-05-17 19:11:59] [INFO ] Deduced a trap composed of 302 places in 300 ms of which 1 ms to minimize.
[2022-05-17 19:11:59] [INFO ] Deduced a trap composed of 304 places in 309 ms of which 0 ms to minimize.
[2022-05-17 19:12:00] [INFO ] Deduced a trap composed of 302 places in 310 ms of which 1 ms to minimize.
[2022-05-17 19:12:00] [INFO ] Deduced a trap composed of 302 places in 300 ms of which 1 ms to minimize.
[2022-05-17 19:12:00] [INFO ] Deduced a trap composed of 310 places in 306 ms of which 1 ms to minimize.
[2022-05-17 19:12:01] [INFO ] Deduced a trap composed of 290 places in 312 ms of which 1 ms to minimize.
[2022-05-17 19:12:01] [INFO ] Deduced a trap composed of 313 places in 315 ms of which 1 ms to minimize.
[2022-05-17 19:12:01] [INFO ] Deduced a trap composed of 298 places in 306 ms of which 1 ms to minimize.
[2022-05-17 19:12:02] [INFO ] Deduced a trap composed of 308 places in 295 ms of which 1 ms to minimize.
[2022-05-17 19:12:02] [INFO ] Deduced a trap composed of 300 places in 294 ms of which 0 ms to minimize.
[2022-05-17 19:12:03] [INFO ] Deduced a trap composed of 304 places in 303 ms of which 0 ms to minimize.
[2022-05-17 19:12:03] [INFO ] Deduced a trap composed of 298 places in 304 ms of which 1 ms to minimize.
[2022-05-17 19:12:03] [INFO ] Deduced a trap composed of 294 places in 314 ms of which 1 ms to minimize.
[2022-05-17 19:12:04] [INFO ] Deduced a trap composed of 296 places in 300 ms of which 1 ms to minimize.
[2022-05-17 19:12:04] [INFO ] Deduced a trap composed of 306 places in 299 ms of which 0 ms to minimize.
[2022-05-17 19:12:05] [INFO ] Deduced a trap composed of 308 places in 305 ms of which 0 ms to minimize.
[2022-05-17 19:12:05] [INFO ] Deduced a trap composed of 302 places in 302 ms of which 1 ms to minimize.
[2022-05-17 19:12:05] [INFO ] Deduced a trap composed of 294 places in 302 ms of which 0 ms to minimize.
[2022-05-17 19:12:06] [INFO ] Deduced a trap composed of 302 places in 306 ms of which 1 ms to minimize.
[2022-05-17 19:12:06] [INFO ] Deduced a trap composed of 308 places in 294 ms of which 0 ms to minimize.
[2022-05-17 19:12:07] [INFO ] Deduced a trap composed of 306 places in 301 ms of which 0 ms to minimize.
[2022-05-17 19:12:07] [INFO ] Deduced a trap composed of 298 places in 307 ms of which 1 ms to minimize.
[2022-05-17 19:12:07] [INFO ] Deduced a trap composed of 304 places in 305 ms of which 0 ms to minimize.
[2022-05-17 19:12:08] [INFO ] Deduced a trap composed of 300 places in 304 ms of which 0 ms to minimize.
[2022-05-17 19:12:08] [INFO ] Deduced a trap composed of 311 places in 302 ms of which 0 ms to minimize.
[2022-05-17 19:12:08] [INFO ] Deduced a trap composed of 304 places in 305 ms of which 0 ms to minimize.
[2022-05-17 19:12:09] [INFO ] Deduced a trap composed of 301 places in 323 ms of which 0 ms to minimize.
[2022-05-17 19:12:09] [INFO ] Deduced a trap composed of 305 places in 305 ms of which 1 ms to minimize.
[2022-05-17 19:12:10] [INFO ] Deduced a trap composed of 298 places in 312 ms of which 1 ms to minimize.
[2022-05-17 19:12:10] [INFO ] Deduced a trap composed of 309 places in 304 ms of which 1 ms to minimize.
[2022-05-17 19:12:11] [INFO ] Deduced a trap composed of 296 places in 300 ms of which 1 ms to minimize.
[2022-05-17 19:12:11] [INFO ] Deduced a trap composed of 298 places in 308 ms of which 1 ms to minimize.
[2022-05-17 19:12:11] [INFO ] Deduced a trap composed of 292 places in 302 ms of which 1 ms to minimize.
[2022-05-17 19:12:12] [INFO ] Deduced a trap composed of 298 places in 296 ms of which 0 ms to minimize.
[2022-05-17 19:12:12] [INFO ] Deduced a trap composed of 302 places in 303 ms of which 1 ms to minimize.
[2022-05-17 19:12:12] [INFO ] Deduced a trap composed of 300 places in 300 ms of which 1 ms to minimize.
[2022-05-17 19:12:13] [INFO ] Deduced a trap composed of 294 places in 300 ms of which 1 ms to minimize.
[2022-05-17 19:12:13] [INFO ] Deduced a trap composed of 302 places in 304 ms of which 0 ms to minimize.
[2022-05-17 19:12:14] [INFO ] Deduced a trap composed of 300 places in 304 ms of which 0 ms to minimize.
[2022-05-17 19:12:14] [INFO ] Deduced a trap composed of 302 places in 312 ms of which 1 ms to minimize.
[2022-05-17 19:12:14] [INFO ] Deduced a trap composed of 292 places in 313 ms of which 1 ms to minimize.
[2022-05-17 19:12:15] [INFO ] Deduced a trap composed of 300 places in 301 ms of which 1 ms to minimize.
[2022-05-17 19:12:15] [INFO ] Deduced a trap composed of 304 places in 302 ms of which 1 ms to minimize.
[2022-05-17 19:12:15] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-17 19:12:15] [INFO ] After 25130ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 750 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 750/750 places, 1521/1521 transitions.
Applied a total of 0 rules in 29 ms. Remains 750 /750 variables (removed 0) and now considering 1521/1521 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 750/750 places, 1521/1521 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 750/750 places, 1521/1521 transitions.
Applied a total of 0 rules in 28 ms. Remains 750 /750 variables (removed 0) and now considering 1521/1521 (removed 0) transitions.
[2022-05-17 19:12:15] [INFO ] Flow matrix only has 1512 transitions (discarded 9 similar events)
// Phase 1: matrix 1512 rows 750 cols
[2022-05-17 19:12:15] [INFO ] Computed 102 place invariants in 24 ms
[2022-05-17 19:12:16] [INFO ] Implicit Places using invariants in 580 ms returned []
[2022-05-17 19:12:16] [INFO ] Flow matrix only has 1512 transitions (discarded 9 similar events)
// Phase 1: matrix 1512 rows 750 cols
[2022-05-17 19:12:16] [INFO ] Computed 102 place invariants in 28 ms
[2022-05-17 19:12:16] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-17 19:12:20] [INFO ] Implicit Places using invariants and state equation in 4241 ms returned []
Implicit Place search using SMT with State Equation took 4823 ms to find 0 implicit places.
[2022-05-17 19:12:20] [INFO ] Redundant transitions in 25 ms returned []
[2022-05-17 19:12:20] [INFO ] Flow matrix only has 1512 transitions (discarded 9 similar events)
// Phase 1: matrix 1512 rows 750 cols
[2022-05-17 19:12:20] [INFO ] Computed 102 place invariants in 25 ms
[2022-05-17 19:12:21] [INFO ] Dead Transitions using invariants and state equation in 698 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 750/750 places, 1521/1521 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 750 transition count 1512
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 750 transition count 1511
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 749 transition count 1511
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 749 transition count 1510
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 13 place count 748 transition count 1510
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 2 with 10 rules applied. Total rules applied 23 place count 748 transition count 1500
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 33 place count 738 transition count 1500
Applied a total of 33 rules in 135 ms. Remains 738 /750 variables (removed 12) and now considering 1500/1521 (removed 21) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 1500 rows 738 cols
[2022-05-17 19:12:21] [INFO ] Computed 102 place invariants in 24 ms
[2022-05-17 19:12:21] [INFO ] [Real]Absence check using 95 positive place invariants in 20 ms returned sat
[2022-05-17 19:12:21] [INFO ] [Real]Absence check using 95 positive and 7 generalized place invariants in 20 ms returned sat
[2022-05-17 19:12:21] [INFO ] After 135ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 19:12:21] [INFO ] [Nat]Absence check using 95 positive place invariants in 20 ms returned sat
[2022-05-17 19:12:21] [INFO ] [Nat]Absence check using 95 positive and 7 generalized place invariants in 15 ms returned sat
[2022-05-17 19:12:22] [INFO ] After 374ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 19:12:22] [INFO ] Deduced a trap composed of 292 places in 275 ms of which 1 ms to minimize.
[2022-05-17 19:12:22] [INFO ] Deduced a trap composed of 302 places in 279 ms of which 1 ms to minimize.
[2022-05-17 19:12:22] [INFO ] Deduced a trap composed of 298 places in 277 ms of which 1 ms to minimize.
[2022-05-17 19:12:23] [INFO ] Deduced a trap composed of 294 places in 289 ms of which 0 ms to minimize.
[2022-05-17 19:12:23] [INFO ] Deduced a trap composed of 288 places in 282 ms of which 0 ms to minimize.
[2022-05-17 19:12:23] [INFO ] Deduced a trap composed of 298 places in 280 ms of which 1 ms to minimize.
[2022-05-17 19:12:24] [INFO ] Deduced a trap composed of 292 places in 269 ms of which 0 ms to minimize.
[2022-05-17 19:12:24] [INFO ] Deduced a trap composed of 300 places in 271 ms of which 1 ms to minimize.
[2022-05-17 19:12:24] [INFO ] Deduced a trap composed of 308 places in 273 ms of which 1 ms to minimize.
[2022-05-17 19:12:25] [INFO ] Deduced a trap composed of 298 places in 284 ms of which 1 ms to minimize.
[2022-05-17 19:12:25] [INFO ] Deduced a trap composed of 296 places in 275 ms of which 1 ms to minimize.
[2022-05-17 19:12:25] [INFO ] Deduced a trap composed of 288 places in 279 ms of which 1 ms to minimize.
[2022-05-17 19:12:26] [INFO ] Deduced a trap composed of 300 places in 273 ms of which 0 ms to minimize.
[2022-05-17 19:12:26] [INFO ] Deduced a trap composed of 302 places in 266 ms of which 0 ms to minimize.
[2022-05-17 19:12:26] [INFO ] Deduced a trap composed of 304 places in 278 ms of which 1 ms to minimize.
[2022-05-17 19:12:27] [INFO ] Deduced a trap composed of 296 places in 266 ms of which 1 ms to minimize.
[2022-05-17 19:12:27] [INFO ] Deduced a trap composed of 302 places in 271 ms of which 0 ms to minimize.
[2022-05-17 19:12:27] [INFO ] Deduced a trap composed of 296 places in 275 ms of which 1 ms to minimize.
[2022-05-17 19:12:28] [INFO ] Deduced a trap composed of 294 places in 276 ms of which 0 ms to minimize.
[2022-05-17 19:12:28] [INFO ] Deduced a trap composed of 302 places in 267 ms of which 0 ms to minimize.
[2022-05-17 19:12:28] [INFO ] Deduced a trap composed of 294 places in 273 ms of which 1 ms to minimize.
[2022-05-17 19:12:29] [INFO ] Deduced a trap composed of 290 places in 270 ms of which 0 ms to minimize.
[2022-05-17 19:12:29] [INFO ] Deduced a trap composed of 288 places in 281 ms of which 0 ms to minimize.
[2022-05-17 19:12:29] [INFO ] Deduced a trap composed of 290 places in 275 ms of which 1 ms to minimize.
[2022-05-17 19:12:30] [INFO ] Deduced a trap composed of 306 places in 271 ms of which 1 ms to minimize.
[2022-05-17 19:12:30] [INFO ] Deduced a trap composed of 298 places in 271 ms of which 0 ms to minimize.
[2022-05-17 19:12:30] [INFO ] Deduced a trap composed of 296 places in 279 ms of which 1 ms to minimize.
[2022-05-17 19:12:31] [INFO ] Deduced a trap composed of 296 places in 277 ms of which 0 ms to minimize.
[2022-05-17 19:12:31] [INFO ] Deduced a trap composed of 298 places in 278 ms of which 0 ms to minimize.
[2022-05-17 19:12:31] [INFO ] Deduced a trap composed of 300 places in 276 ms of which 0 ms to minimize.
[2022-05-17 19:12:32] [INFO ] Deduced a trap composed of 302 places in 278 ms of which 0 ms to minimize.
[2022-05-17 19:12:32] [INFO ] Deduced a trap composed of 304 places in 267 ms of which 1 ms to minimize.
[2022-05-17 19:12:32] [INFO ] Deduced a trap composed of 298 places in 281 ms of which 0 ms to minimize.
[2022-05-17 19:12:33] [INFO ] Deduced a trap composed of 306 places in 275 ms of which 1 ms to minimize.
[2022-05-17 19:12:33] [INFO ] Deduced a trap composed of 302 places in 275 ms of which 0 ms to minimize.
[2022-05-17 19:12:33] [INFO ] Deduced a trap composed of 300 places in 278 ms of which 1 ms to minimize.
[2022-05-17 19:12:34] [INFO ] Deduced a trap composed of 296 places in 276 ms of which 0 ms to minimize.
[2022-05-17 19:12:34] [INFO ] Deduced a trap composed of 306 places in 283 ms of which 1 ms to minimize.
[2022-05-17 19:12:34] [INFO ] Deduced a trap composed of 298 places in 273 ms of which 1 ms to minimize.
[2022-05-17 19:12:35] [INFO ] Deduced a trap composed of 296 places in 275 ms of which 0 ms to minimize.
[2022-05-17 19:12:35] [INFO ] Deduced a trap composed of 298 places in 272 ms of which 1 ms to minimize.
[2022-05-17 19:12:35] [INFO ] Deduced a trap composed of 300 places in 275 ms of which 1 ms to minimize.
[2022-05-17 19:12:36] [INFO ] Deduced a trap composed of 300 places in 272 ms of which 0 ms to minimize.
[2022-05-17 19:12:36] [INFO ] Deduced a trap composed of 298 places in 276 ms of which 1 ms to minimize.
[2022-05-17 19:12:36] [INFO ] Deduced a trap composed of 292 places in 279 ms of which 0 ms to minimize.
[2022-05-17 19:12:37] [INFO ] Deduced a trap composed of 302 places in 270 ms of which 1 ms to minimize.
[2022-05-17 19:12:37] [INFO ] Deduced a trap composed of 298 places in 282 ms of which 1 ms to minimize.
[2022-05-17 19:12:37] [INFO ] Deduced a trap composed of 296 places in 277 ms of which 0 ms to minimize.
[2022-05-17 19:12:38] [INFO ] Deduced a trap composed of 294 places in 276 ms of which 1 ms to minimize.
[2022-05-17 19:12:38] [INFO ] Deduced a trap composed of 296 places in 269 ms of which 1 ms to minimize.
[2022-05-17 19:12:38] [INFO ] Deduced a trap composed of 298 places in 271 ms of which 0 ms to minimize.
[2022-05-17 19:12:38] [INFO ] Deduced a trap composed of 298 places in 272 ms of which 1 ms to minimize.
[2022-05-17 19:12:39] [INFO ] Deduced a trap composed of 296 places in 277 ms of which 0 ms to minimize.
[2022-05-17 19:12:39] [INFO ] Deduced a trap composed of 298 places in 274 ms of which 0 ms to minimize.
[2022-05-17 19:12:39] [INFO ] Deduced a trap composed of 296 places in 283 ms of which 1 ms to minimize.
[2022-05-17 19:12:40] [INFO ] Deduced a trap composed of 298 places in 275 ms of which 1 ms to minimize.
[2022-05-17 19:12:40] [INFO ] Deduced a trap composed of 292 places in 271 ms of which 1 ms to minimize.
[2022-05-17 19:12:40] [INFO ] Deduced a trap composed of 288 places in 280 ms of which 0 ms to minimize.
[2022-05-17 19:12:41] [INFO ] Deduced a trap composed of 296 places in 273 ms of which 0 ms to minimize.
[2022-05-17 19:12:41] [INFO ] Deduced a trap composed of 304 places in 273 ms of which 1 ms to minimize.
[2022-05-17 19:12:41] [INFO ] Deduced a trap composed of 304 places in 275 ms of which 0 ms to minimize.
[2022-05-17 19:12:42] [INFO ] Deduced a trap composed of 302 places in 274 ms of which 0 ms to minimize.
[2022-05-17 19:12:42] [INFO ] Deduced a trap composed of 302 places in 269 ms of which 0 ms to minimize.
[2022-05-17 19:12:42] [INFO ] Deduced a trap composed of 304 places in 271 ms of which 0 ms to minimize.
[2022-05-17 19:12:43] [INFO ] Deduced a trap composed of 294 places in 266 ms of which 0 ms to minimize.
[2022-05-17 19:12:43] [INFO ] Deduced a trap composed of 300 places in 277 ms of which 0 ms to minimize.
[2022-05-17 19:12:43] [INFO ] Deduced a trap composed of 300 places in 279 ms of which 0 ms to minimize.
[2022-05-17 19:12:46] [INFO ] Deduced a trap composed of 292 places in 279 ms of which 1 ms to minimize.
[2022-05-17 19:12:46] [INFO ] Deduced a trap composed of 292 places in 278 ms of which 1 ms to minimize.
[2022-05-17 19:12:46] [INFO ] Deduced a trap composed of 290 places in 278 ms of which 1 ms to minimize.
[2022-05-17 19:12:47] [INFO ] Deduced a trap composed of 296 places in 271 ms of which 0 ms to minimize.
[2022-05-17 19:12:47] [INFO ] Deduced a trap composed of 298 places in 279 ms of which 0 ms to minimize.
[2022-05-17 19:12:47] [INFO ] Deduced a trap composed of 300 places in 279 ms of which 1 ms to minimize.
[2022-05-17 19:12:49] [INFO ] Deduced a trap composed of 304 places in 286 ms of which 1 ms to minimize.
[2022-05-17 19:12:50] [INFO ] Deduced a trap composed of 298 places in 273 ms of which 1 ms to minimize.
[2022-05-17 19:12:50] [INFO ] Deduced a trap composed of 302 places in 270 ms of which 1 ms to minimize.
[2022-05-17 19:12:50] [INFO ] Deduced a trap composed of 298 places in 273 ms of which 0 ms to minimize.
[2022-05-17 19:12:51] [INFO ] Deduced a trap composed of 298 places in 276 ms of which 1 ms to minimize.
[2022-05-17 19:12:51] [INFO ] Deduced a trap composed of 300 places in 276 ms of which 1 ms to minimize.
[2022-05-17 19:12:51] [INFO ] Deduced a trap composed of 298 places in 270 ms of which 1 ms to minimize.
[2022-05-17 19:12:52] [INFO ] Deduced a trap composed of 294 places in 268 ms of which 1 ms to minimize.
[2022-05-17 19:12:52] [INFO ] Deduced a trap composed of 298 places in 270 ms of which 1 ms to minimize.
[2022-05-17 19:12:52] [INFO ] Deduced a trap composed of 296 places in 272 ms of which 1 ms to minimize.
[2022-05-17 19:12:53] [INFO ] Deduced a trap composed of 294 places in 265 ms of which 0 ms to minimize.
[2022-05-17 19:12:53] [INFO ] Deduced a trap composed of 298 places in 264 ms of which 1 ms to minimize.
[2022-05-17 19:12:53] [INFO ] Deduced a trap composed of 300 places in 286 ms of which 2 ms to minimize.
[2022-05-17 19:12:54] [INFO ] Deduced a trap composed of 298 places in 274 ms of which 1 ms to minimize.
[2022-05-17 19:12:54] [INFO ] Deduced a trap composed of 312 places in 278 ms of which 1 ms to minimize.
[2022-05-17 19:12:54] [INFO ] Deduced a trap composed of 298 places in 271 ms of which 1 ms to minimize.
[2022-05-17 19:12:56] [INFO ] Deduced a trap composed of 292 places in 288 ms of which 1 ms to minimize.
[2022-05-17 19:12:56] [INFO ] Deduced a trap composed of 302 places in 278 ms of which 1 ms to minimize.
[2022-05-17 19:12:56] [INFO ] Deduced a trap composed of 298 places in 276 ms of which 1 ms to minimize.
[2022-05-17 19:12:57] [INFO ] Deduced a trap composed of 296 places in 286 ms of which 1 ms to minimize.
[2022-05-17 19:12:58] [INFO ] Deduced a trap composed of 300 places in 281 ms of which 1 ms to minimize.
[2022-05-17 19:12:59] [INFO ] Deduced a trap composed of 294 places in 283 ms of which 0 ms to minimize.
[2022-05-17 19:12:59] [INFO ] Deduced a trap composed of 302 places in 272 ms of which 0 ms to minimize.
[2022-05-17 19:13:00] [INFO ] Deduced a trap composed of 296 places in 279 ms of which 1 ms to minimize.
[2022-05-17 19:13:05] [INFO ] Deduced a trap composed of 290 places in 281 ms of which 1 ms to minimize.
[2022-05-17 19:13:06] [INFO ] Deduced a trap composed of 298 places in 270 ms of which 1 ms to minimize.
[2022-05-17 19:13:06] [INFO ] Deduced a trap composed of 300 places in 268 ms of which 1 ms to minimize.
[2022-05-17 19:13:06] [INFO ] Deduced a trap composed of 294 places in 266 ms of which 1 ms to minimize.
[2022-05-17 19:13:07] [INFO ] Deduced a trap composed of 296 places in 277 ms of which 1 ms to minimize.
[2022-05-17 19:13:07] [INFO ] Deduced a trap composed of 302 places in 282 ms of which 0 ms to minimize.
[2022-05-17 19:13:07] [INFO ] Deduced a trap composed of 304 places in 283 ms of which 1 ms to minimize.
[2022-05-17 19:13:08] [INFO ] Deduced a trap composed of 298 places in 270 ms of which 0 ms to minimize.
[2022-05-17 19:13:08] [INFO ] Deduced a trap composed of 296 places in 267 ms of which 1 ms to minimize.
[2022-05-17 19:13:08] [INFO ] Deduced a trap composed of 286 places in 285 ms of which 1 ms to minimize.
[2022-05-17 19:13:09] [INFO ] Deduced a trap composed of 302 places in 289 ms of which 1 ms to minimize.
[2022-05-17 19:13:11] [INFO ] Deduced a trap composed of 298 places in 280 ms of which 0 ms to minimize.
[2022-05-17 19:13:12] [INFO ] Deduced a trap composed of 300 places in 279 ms of which 1 ms to minimize.
[2022-05-17 19:13:12] [INFO ] Deduced a trap composed of 302 places in 272 ms of which 0 ms to minimize.
[2022-05-17 19:13:12] [INFO ] Deduced a trap composed of 292 places in 272 ms of which 1 ms to minimize.
[2022-05-17 19:13:13] [INFO ] Deduced a trap composed of 298 places in 278 ms of which 1 ms to minimize.
[2022-05-17 19:13:14] [INFO ] Deduced a trap composed of 304 places in 282 ms of which 0 ms to minimize.
[2022-05-17 19:13:15] [INFO ] Deduced a trap composed of 300 places in 282 ms of which 1 ms to minimize.
[2022-05-17 19:13:15] [INFO ] Deduced a trap composed of 302 places in 277 ms of which 1 ms to minimize.
[2022-05-17 19:13:15] [INFO ] Deduced a trap composed of 292 places in 280 ms of which 1 ms to minimize.
[2022-05-17 19:13:16] [INFO ] Deduced a trap composed of 296 places in 281 ms of which 0 ms to minimize.
[2022-05-17 19:13:16] [INFO ] Deduced a trap composed of 294 places in 276 ms of which 1 ms to minimize.
[2022-05-17 19:13:16] [INFO ] Deduced a trap composed of 292 places in 275 ms of which 1 ms to minimize.
[2022-05-17 19:13:17] [INFO ] Deduced a trap composed of 298 places in 276 ms of which 0 ms to minimize.
[2022-05-17 19:13:17] [INFO ] Deduced a trap composed of 304 places in 269 ms of which 0 ms to minimize.
[2022-05-17 19:13:17] [INFO ] Deduced a trap composed of 296 places in 272 ms of which 1 ms to minimize.
[2022-05-17 19:13:18] [INFO ] Deduced a trap composed of 300 places in 273 ms of which 1 ms to minimize.
[2022-05-17 19:13:18] [INFO ] Deduced a trap composed of 294 places in 274 ms of which 0 ms to minimize.
[2022-05-17 19:13:18] [INFO ] Deduced a trap composed of 296 places in 264 ms of which 0 ms to minimize.
[2022-05-17 19:13:19] [INFO ] Deduced a trap composed of 304 places in 279 ms of which 1 ms to minimize.
[2022-05-17 19:13:19] [INFO ] Deduced a trap composed of 298 places in 278 ms of which 1 ms to minimize.
[2022-05-17 19:13:19] [INFO ] Deduced a trap composed of 292 places in 274 ms of which 0 ms to minimize.
[2022-05-17 19:13:20] [INFO ] Deduced a trap composed of 294 places in 267 ms of which 1 ms to minimize.
[2022-05-17 19:13:20] [INFO ] Deduced a trap composed of 296 places in 270 ms of which 0 ms to minimize.
[2022-05-17 19:13:20] [INFO ] Deduced a trap composed of 302 places in 272 ms of which 1 ms to minimize.
[2022-05-17 19:13:21] [INFO ] Deduced a trap composed of 288 places in 269 ms of which 1 ms to minimize.
[2022-05-17 19:13:21] [INFO ] Deduced a trap composed of 282 places in 276 ms of which 0 ms to minimize.
[2022-05-17 19:13:21] [INFO ] Deduced a trap composed of 298 places in 272 ms of which 1 ms to minimize.
[2022-05-17 19:13:22] [INFO ] Deduced a trap composed of 304 places in 269 ms of which 1 ms to minimize.
[2022-05-17 19:13:22] [INFO ] Deduced a trap composed of 300 places in 276 ms of which 1 ms to minimize.
[2022-05-17 19:13:22] [INFO ] Deduced a trap composed of 300 places in 272 ms of which 0 ms to minimize.
[2022-05-17 19:13:23] [INFO ] Deduced a trap composed of 302 places in 280 ms of which 1 ms to minimize.
[2022-05-17 19:13:23] [INFO ] Deduced a trap composed of 294 places in 278 ms of which 1 ms to minimize.
[2022-05-17 19:16:06] [INFO ] Trap strengthening (SAT) tested/added 140/140 trap constraints in 224492 ms
[2022-05-17 19:16:06] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-17 19:16:06] [INFO ] After 225026ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
[2022-05-17 19:16:06] [INFO ] Flatten gal took : 203 ms
[2022-05-17 19:16:06] [INFO ] Flatten gal took : 139 ms
[2022-05-17 19:16:06] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14749416097488617558.gal : 30 ms
[2022-05-17 19:16:06] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1945018229488965127.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms9123695374240587897;'/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/ReachabilityCardinality14749416097488617558.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1945018229488965127.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/ReachabilityCardinality1945018229488965127.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 22
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :22 after 24
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :24 after 26
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :26 after 28
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :28 after 30
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :30 after 32
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :32 after 36
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :36 after 42
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :42 after 56
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :56 after 1827
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :1827 after 1882
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :1882 after 2271
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :2271 after 2458
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :2458 after 2971
Detected timeout of ITS tools.
[2022-05-17 19:16:22] [INFO ] Flatten gal took : 99 ms
[2022-05-17 19:16:22] [INFO ] Applying decomposition
[2022-05-17 19:16:22] [INFO ] Flatten gal took : 89 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/graph9924735719792707963.txt' '-o' '/tmp/graph9924735719792707963.bin' '-w' '/tmp/graph9924735719792707963.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph9924735719792707963.bin' '-l' '-1' '-v' '-w' '/tmp/graph9924735719792707963.weights' '-q' '0' '-e' '0.001'
[2022-05-17 19:16:22] [INFO ] Decomposing Gal with order
[2022-05-17 19:16:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 19:16:22] [INFO ] Removed a total of 1833 redundant transitions.
[2022-05-17 19:16:23] [INFO ] Flatten gal took : 431 ms
[2022-05-17 19:16:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 481 labels/synchronizations in 59 ms.
[2022-05-17 19:16:23] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality677706226718117515.gal : 22 ms
[2022-05-17 19:16:23] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1617312389467550179.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms9123695374240587897;'/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/ReachabilityCardinality677706226718117515.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1617312389467550179.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...297
Loading property file /tmp/ReachabilityCardinality1617312389467550179.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 1
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :1 after 4.12168e+07
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :4.12168e+07 after 4.12259e+07
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :4.12259e+07 after 4.12479e+07
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :4.12479e+07 after 4.12907e+07
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin16969654263342828335
[2022-05-17 19:16:38] [INFO ] Built C files in 32ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16969654263342828335
Running compilation step : cd /tmp/ltsmin16969654263342828335;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16969654263342828335;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16969654263342828335;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
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 750 transition count 1512
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 750 transition count 1511
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 749 transition count 1511
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 749 transition count 1510
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 13 place count 748 transition count 1510
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 2 with 10 rules applied. Total rules applied 23 place count 748 transition count 1500
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 33 place count 738 transition count 1500
Applied a total of 33 rules in 134 ms. Remains 738 /750 variables (removed 12) and now considering 1500/1521 (removed 21) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 1500 rows 738 cols
[2022-05-17 19:16:41] [INFO ] Computed 102 place invariants in 32 ms
[2022-05-17 19:16:41] [INFO ] [Real]Absence check using 95 positive place invariants in 22 ms returned sat
[2022-05-17 19:16:41] [INFO ] [Real]Absence check using 95 positive and 7 generalized place invariants in 14 ms returned sat
[2022-05-17 19:16:41] [INFO ] After 138ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 19:16:41] [INFO ] [Nat]Absence check using 95 positive place invariants in 21 ms returned sat
[2022-05-17 19:16:41] [INFO ] [Nat]Absence check using 95 positive and 7 generalized place invariants in 15 ms returned sat
[2022-05-17 19:16:42] [INFO ] After 366ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 19:16:42] [INFO ] Deduced a trap composed of 292 places in 273 ms of which 1 ms to minimize.
[2022-05-17 19:16:42] [INFO ] Deduced a trap composed of 302 places in 271 ms of which 1 ms to minimize.
[2022-05-17 19:16:43] [INFO ] Deduced a trap composed of 298 places in 274 ms of which 1 ms to minimize.
[2022-05-17 19:16:43] [INFO ] Deduced a trap composed of 294 places in 291 ms of which 0 ms to minimize.
[2022-05-17 19:16:43] [INFO ] Deduced a trap composed of 288 places in 274 ms of which 0 ms to minimize.
[2022-05-17 19:16:44] [INFO ] Deduced a trap composed of 298 places in 280 ms of which 1 ms to minimize.
[2022-05-17 19:16:44] [INFO ] Deduced a trap composed of 292 places in 274 ms of which 1 ms to minimize.
[2022-05-17 19:16:44] [INFO ] Deduced a trap composed of 300 places in 275 ms of which 0 ms to minimize.
[2022-05-17 19:16:45] [INFO ] Deduced a trap composed of 308 places in 273 ms of which 1 ms to minimize.
[2022-05-17 19:16:45] [INFO ] Deduced a trap composed of 298 places in 278 ms of which 1 ms to minimize.
[2022-05-17 19:16:45] [INFO ] Deduced a trap composed of 296 places in 282 ms of which 1 ms to minimize.
[2022-05-17 19:16:46] [INFO ] Deduced a trap composed of 288 places in 283 ms of which 0 ms to minimize.
[2022-05-17 19:16:46] [INFO ] Deduced a trap composed of 300 places in 275 ms of which 1 ms to minimize.
[2022-05-17 19:16:46] [INFO ] Deduced a trap composed of 302 places in 272 ms of which 0 ms to minimize.
[2022-05-17 19:16:47] [INFO ] Deduced a trap composed of 304 places in 274 ms of which 0 ms to minimize.
[2022-05-17 19:16:47] [INFO ] Deduced a trap composed of 296 places in 272 ms of which 0 ms to minimize.
[2022-05-17 19:16:47] [INFO ] Deduced a trap composed of 302 places in 268 ms of which 0 ms to minimize.
[2022-05-17 19:16:48] [INFO ] Deduced a trap composed of 296 places in 277 ms of which 1 ms to minimize.
[2022-05-17 19:16:48] [INFO ] Deduced a trap composed of 294 places in 278 ms of which 1 ms to minimize.
[2022-05-17 19:16:48] [INFO ] Deduced a trap composed of 302 places in 273 ms of which 1 ms to minimize.
[2022-05-17 19:16:49] [INFO ] Deduced a trap composed of 294 places in 269 ms of which 1 ms to minimize.
[2022-05-17 19:16:49] [INFO ] Deduced a trap composed of 290 places in 274 ms of which 1 ms to minimize.
[2022-05-17 19:16:49] [INFO ] Deduced a trap composed of 288 places in 278 ms of which 0 ms to minimize.
[2022-05-17 19:16:49] [INFO ] Deduced a trap composed of 290 places in 275 ms of which 0 ms to minimize.
[2022-05-17 19:16:50] [INFO ] Deduced a trap composed of 306 places in 270 ms of which 1 ms to minimize.
[2022-05-17 19:16:50] [INFO ] Deduced a trap composed of 298 places in 265 ms of which 1 ms to minimize.
[2022-05-17 19:16:50] [INFO ] Deduced a trap composed of 296 places in 264 ms of which 1 ms to minimize.
[2022-05-17 19:16:51] [INFO ] Deduced a trap composed of 296 places in 270 ms of which 0 ms to minimize.
[2022-05-17 19:16:51] [INFO ] Deduced a trap composed of 298 places in 272 ms of which 1 ms to minimize.
[2022-05-17 19:16:51] [INFO ] Deduced a trap composed of 300 places in 269 ms of which 1 ms to minimize.
[2022-05-17 19:16:52] [INFO ] Deduced a trap composed of 302 places in 272 ms of which 1 ms to minimize.
[2022-05-17 19:16:52] [INFO ] Deduced a trap composed of 304 places in 267 ms of which 1 ms to minimize.
[2022-05-17 19:16:52] [INFO ] Deduced a trap composed of 298 places in 266 ms of which 0 ms to minimize.
[2022-05-17 19:16:53] [INFO ] Deduced a trap composed of 306 places in 267 ms of which 0 ms to minimize.
[2022-05-17 19:16:53] [INFO ] Deduced a trap composed of 302 places in 268 ms of which 1 ms to minimize.
[2022-05-17 19:16:53] [INFO ] Deduced a trap composed of 300 places in 267 ms of which 1 ms to minimize.
[2022-05-17 19:16:54] [INFO ] Deduced a trap composed of 296 places in 274 ms of which 1 ms to minimize.
[2022-05-17 19:16:54] [INFO ] Deduced a trap composed of 306 places in 276 ms of which 1 ms to minimize.
[2022-05-17 19:16:54] [INFO ] Deduced a trap composed of 298 places in 271 ms of which 0 ms to minimize.
[2022-05-17 19:16:55] [INFO ] Deduced a trap composed of 296 places in 277 ms of which 0 ms to minimize.
[2022-05-17 19:16:55] [INFO ] Deduced a trap composed of 298 places in 273 ms of which 0 ms to minimize.
[2022-05-17 19:16:55] [INFO ] Deduced a trap composed of 300 places in 271 ms of which 1 ms to minimize.
[2022-05-17 19:16:56] [INFO ] Deduced a trap composed of 300 places in 278 ms of which 1 ms to minimize.
[2022-05-17 19:16:56] [INFO ] Deduced a trap composed of 298 places in 275 ms of which 0 ms to minimize.
[2022-05-17 19:16:56] [INFO ] Deduced a trap composed of 292 places in 267 ms of which 1 ms to minimize.
[2022-05-17 19:16:57] [INFO ] Deduced a trap composed of 302 places in 278 ms of which 0 ms to minimize.
[2022-05-17 19:16:57] [INFO ] Deduced a trap composed of 298 places in 276 ms of which 0 ms to minimize.
[2022-05-17 19:16:57] [INFO ] Deduced a trap composed of 296 places in 265 ms of which 1 ms to minimize.
[2022-05-17 19:16:58] [INFO ] Deduced a trap composed of 294 places in 271 ms of which 0 ms to minimize.
[2022-05-17 19:16:58] [INFO ] Deduced a trap composed of 296 places in 274 ms of which 1 ms to minimize.
[2022-05-17 19:16:58] [INFO ] Deduced a trap composed of 298 places in 265 ms of which 1 ms to minimize.
[2022-05-17 19:16:59] [INFO ] Deduced a trap composed of 298 places in 267 ms of which 1 ms to minimize.
[2022-05-17 19:16:59] [INFO ] Deduced a trap composed of 296 places in 264 ms of which 1 ms to minimize.
[2022-05-17 19:16:59] [INFO ] Deduced a trap composed of 298 places in 276 ms of which 1 ms to minimize.
[2022-05-17 19:17:00] [INFO ] Deduced a trap composed of 296 places in 281 ms of which 0 ms to minimize.
[2022-05-17 19:17:00] [INFO ] Deduced a trap composed of 298 places in 276 ms of which 1 ms to minimize.
[2022-05-17 19:17:00] [INFO ] Deduced a trap composed of 292 places in 271 ms of which 1 ms to minimize.
[2022-05-17 19:17:00] [INFO ] Deduced a trap composed of 288 places in 273 ms of which 1 ms to minimize.
[2022-05-17 19:17:01] [INFO ] Deduced a trap composed of 296 places in 266 ms of which 1 ms to minimize.
[2022-05-17 19:17:01] [INFO ] Deduced a trap composed of 304 places in 269 ms of which 1 ms to minimize.
[2022-05-17 19:17:01] [INFO ] Deduced a trap composed of 304 places in 267 ms of which 0 ms to minimize.
[2022-05-17 19:17:02] [INFO ] Deduced a trap composed of 302 places in 270 ms of which 1 ms to minimize.
[2022-05-17 19:17:02] [INFO ] Deduced a trap composed of 302 places in 270 ms of which 1 ms to minimize.
[2022-05-17 19:17:02] [INFO ] Deduced a trap composed of 304 places in 281 ms of which 0 ms to minimize.
[2022-05-17 19:17:03] [INFO ] Deduced a trap composed of 294 places in 276 ms of which 1 ms to minimize.
[2022-05-17 19:17:03] [INFO ] Deduced a trap composed of 300 places in 271 ms of which 1 ms to minimize.
[2022-05-17 19:17:03] [INFO ] Deduced a trap composed of 300 places in 278 ms of which 1 ms to minimize.
[2022-05-17 19:17:06] [INFO ] Deduced a trap composed of 292 places in 274 ms of which 1 ms to minimize.
[2022-05-17 19:17:06] [INFO ] Deduced a trap composed of 292 places in 277 ms of which 0 ms to minimize.
[2022-05-17 19:17:06] [INFO ] Deduced a trap composed of 290 places in 280 ms of which 1 ms to minimize.
[2022-05-17 19:17:07] [INFO ] Deduced a trap composed of 296 places in 273 ms of which 1 ms to minimize.
[2022-05-17 19:17:07] [INFO ] Deduced a trap composed of 298 places in 273 ms of which 1 ms to minimize.
[2022-05-17 19:17:07] [INFO ] Deduced a trap composed of 300 places in 276 ms of which 1 ms to minimize.
[2022-05-17 19:17:09] [INFO ] Deduced a trap composed of 304 places in 277 ms of which 0 ms to minimize.
[2022-05-17 19:17:10] [INFO ] Deduced a trap composed of 298 places in 272 ms of which 1 ms to minimize.
[2022-05-17 19:17:10] [INFO ] Deduced a trap composed of 302 places in 274 ms of which 1 ms to minimize.
[2022-05-17 19:17:10] [INFO ] Deduced a trap composed of 298 places in 280 ms of which 0 ms to minimize.
[2022-05-17 19:17:11] [INFO ] Deduced a trap composed of 298 places in 277 ms of which 1 ms to minimize.
[2022-05-17 19:17:11] [INFO ] Deduced a trap composed of 300 places in 278 ms of which 0 ms to minimize.
[2022-05-17 19:17:11] [INFO ] Deduced a trap composed of 298 places in 279 ms of which 0 ms to minimize.
[2022-05-17 19:17:12] [INFO ] Deduced a trap composed of 294 places in 277 ms of which 1 ms to minimize.
[2022-05-17 19:17:12] [INFO ] Deduced a trap composed of 298 places in 277 ms of which 0 ms to minimize.
[2022-05-17 19:17:12] [INFO ] Deduced a trap composed of 296 places in 276 ms of which 1 ms to minimize.
[2022-05-17 19:17:13] [INFO ] Deduced a trap composed of 294 places in 272 ms of which 1 ms to minimize.
[2022-05-17 19:17:13] [INFO ] Deduced a trap composed of 298 places in 269 ms of which 1 ms to minimize.
[2022-05-17 19:17:13] [INFO ] Deduced a trap composed of 300 places in 268 ms of which 0 ms to minimize.
[2022-05-17 19:17:14] [INFO ] Deduced a trap composed of 298 places in 279 ms of which 0 ms to minimize.
[2022-05-17 19:17:14] [INFO ] Deduced a trap composed of 312 places in 272 ms of which 1 ms to minimize.
[2022-05-17 19:17:14] [INFO ] Deduced a trap composed of 298 places in 277 ms of which 1 ms to minimize.
[2022-05-17 19:17:16] [INFO ] Deduced a trap composed of 292 places in 286 ms of which 0 ms to minimize.
[2022-05-17 19:17:16] [INFO ] Deduced a trap composed of 302 places in 290 ms of which 0 ms to minimize.
[2022-05-17 19:17:16] [INFO ] Deduced a trap composed of 298 places in 283 ms of which 0 ms to minimize.
[2022-05-17 19:17:17] [INFO ] Deduced a trap composed of 296 places in 276 ms of which 0 ms to minimize.
[2022-05-17 19:17:18] [INFO ] Deduced a trap composed of 300 places in 275 ms of which 1 ms to minimize.
[2022-05-17 19:17:19] [INFO ] Deduced a trap composed of 294 places in 268 ms of which 0 ms to minimize.
[2022-05-17 19:17:19] [INFO ] Deduced a trap composed of 302 places in 267 ms of which 1 ms to minimize.
[2022-05-17 19:17:20] [INFO ] Deduced a trap composed of 296 places in 273 ms of which 1 ms to minimize.
[2022-05-17 19:17:25] [INFO ] Deduced a trap composed of 290 places in 275 ms of which 1 ms to minimize.
[2022-05-17 19:17:25] [INFO ] Deduced a trap composed of 298 places in 279 ms of which 1 ms to minimize.
[2022-05-17 19:17:26] [INFO ] Deduced a trap composed of 300 places in 278 ms of which 0 ms to minimize.
[2022-05-17 19:17:26] [INFO ] Deduced a trap composed of 294 places in 278 ms of which 1 ms to minimize.
[2022-05-17 19:17:26] [INFO ] Deduced a trap composed of 296 places in 269 ms of which 1 ms to minimize.
[2022-05-17 19:17:27] [INFO ] Deduced a trap composed of 302 places in 271 ms of which 1 ms to minimize.
[2022-05-17 19:17:27] [INFO ] Deduced a trap composed of 304 places in 262 ms of which 1 ms to minimize.
[2022-05-17 19:17:27] [INFO ] Deduced a trap composed of 298 places in 289 ms of which 1 ms to minimize.
[2022-05-17 19:17:28] [INFO ] Deduced a trap composed of 296 places in 276 ms of which 0 ms to minimize.
[2022-05-17 19:17:28] [INFO ] Deduced a trap composed of 286 places in 269 ms of which 1 ms to minimize.
[2022-05-17 19:17:29] [INFO ] Deduced a trap composed of 302 places in 269 ms of which 0 ms to minimize.
[2022-05-17 19:17:31] [INFO ] Deduced a trap composed of 298 places in 275 ms of which 0 ms to minimize.
[2022-05-17 19:17:31] [INFO ] Deduced a trap composed of 300 places in 280 ms of which 0 ms to minimize.
[2022-05-17 19:17:32] [INFO ] Deduced a trap composed of 302 places in 276 ms of which 1 ms to minimize.
[2022-05-17 19:17:32] [INFO ] Deduced a trap composed of 292 places in 283 ms of which 1 ms to minimize.
[2022-05-17 19:17:32] [INFO ] Deduced a trap composed of 298 places in 273 ms of which 1 ms to minimize.
[2022-05-17 19:17:34] [INFO ] Deduced a trap composed of 304 places in 275 ms of which 0 ms to minimize.
[2022-05-17 19:17:34] [INFO ] Deduced a trap composed of 300 places in 272 ms of which 0 ms to minimize.
[2022-05-17 19:17:35] [INFO ] Deduced a trap composed of 302 places in 276 ms of which 1 ms to minimize.
[2022-05-17 19:17:35] [INFO ] Deduced a trap composed of 292 places in 276 ms of which 1 ms to minimize.
[2022-05-17 19:17:35] [INFO ] Deduced a trap composed of 296 places in 270 ms of which 1 ms to minimize.
[2022-05-17 19:17:36] [INFO ] Deduced a trap composed of 294 places in 277 ms of which 1 ms to minimize.
[2022-05-17 19:17:36] [INFO ] Deduced a trap composed of 292 places in 282 ms of which 1 ms to minimize.
[2022-05-17 19:17:36] [INFO ] Deduced a trap composed of 298 places in 282 ms of which 1 ms to minimize.
[2022-05-17 19:17:37] [INFO ] Deduced a trap composed of 304 places in 276 ms of which 1 ms to minimize.
[2022-05-17 19:17:37] [INFO ] Deduced a trap composed of 296 places in 272 ms of which 0 ms to minimize.
[2022-05-17 19:17:37] [INFO ] Deduced a trap composed of 300 places in 281 ms of which 0 ms to minimize.
[2022-05-17 19:17:38] [INFO ] Deduced a trap composed of 294 places in 285 ms of which 4 ms to minimize.
[2022-05-17 19:17:38] [INFO ] Deduced a trap composed of 296 places in 272 ms of which 1 ms to minimize.
[2022-05-17 19:17:38] [INFO ] Deduced a trap composed of 304 places in 278 ms of which 1 ms to minimize.
[2022-05-17 19:17:39] [INFO ] Deduced a trap composed of 298 places in 274 ms of which 0 ms to minimize.
[2022-05-17 19:17:39] [INFO ] Deduced a trap composed of 292 places in 279 ms of which 1 ms to minimize.
[2022-05-17 19:17:39] [INFO ] Deduced a trap composed of 294 places in 273 ms of which 1 ms to minimize.
[2022-05-17 19:17:40] [INFO ] Deduced a trap composed of 296 places in 286 ms of which 1 ms to minimize.
[2022-05-17 19:17:40] [INFO ] Deduced a trap composed of 302 places in 267 ms of which 1 ms to minimize.
[2022-05-17 19:17:40] [INFO ] Deduced a trap composed of 288 places in 276 ms of which 1 ms to minimize.
[2022-05-17 19:17:41] [INFO ] Deduced a trap composed of 282 places in 272 ms of which 1 ms to minimize.
[2022-05-17 19:17:41] [INFO ] Deduced a trap composed of 298 places in 268 ms of which 0 ms to minimize.
[2022-05-17 19:17:41] [INFO ] Deduced a trap composed of 304 places in 271 ms of which 1 ms to minimize.
[2022-05-17 19:17:42] [INFO ] Deduced a trap composed of 300 places in 270 ms of which 1 ms to minimize.
[2022-05-17 19:17:42] [INFO ] Deduced a trap composed of 300 places in 273 ms of which 0 ms to minimize.
[2022-05-17 19:17:42] [INFO ] Deduced a trap composed of 302 places in 270 ms of which 0 ms to minimize.
[2022-05-17 19:17:43] [INFO ] Deduced a trap composed of 294 places in 275 ms of which 1 ms to minimize.
[2022-05-17 19:20:26] [INFO ] Trap strengthening (SAT) tested/added 140/140 trap constraints in 224502 ms
[2022-05-17 19:20:26] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-17 19:20:26] [INFO ] After 225020ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
[2022-05-17 19:20:26] [INFO ] Flatten gal took : 78 ms
[2022-05-17 19:20:26] [INFO ] Flatten gal took : 73 ms
[2022-05-17 19:20:26] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8590296891126789999.gal : 14 ms
[2022-05-17 19:20:26] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17811219220644746308.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/ReachabilityCardinality8590296891126789999.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17811219220644746308.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/ReachabilityCardinality17811219220644746308.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 22
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :22 after 24
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :24 after 26
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :26 after 28
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :28 after 30
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :30 after 32
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :32 after 36
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :36 after 42
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :42 after 56
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :56 after 1827
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :1827 after 1882
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :1882 after 2271
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :2271 after 2458
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :2458 after 2971
Detected timeout of ITS tools.
[2022-05-17 19:20:41] [INFO ] Flatten gal took : 73 ms
[2022-05-17 19:20:41] [INFO ] Applying decomposition
[2022-05-17 19:20:42] [INFO ] Flatten gal took : 74 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/graph8738088190629446058.txt' '-o' '/tmp/graph8738088190629446058.bin' '-w' '/tmp/graph8738088190629446058.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph8738088190629446058.bin' '-l' '-1' '-v' '-w' '/tmp/graph8738088190629446058.weights' '-q' '0' '-e' '0.001'
[2022-05-17 19:20:42] [INFO ] Decomposing Gal with order
[2022-05-17 19:20:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 19:20:42] [INFO ] Removed a total of 1713 redundant transitions.
[2022-05-17 19:20:42] [INFO ] Flatten gal took : 255 ms
[2022-05-17 19:20:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 727 labels/synchronizations in 64 ms.
[2022-05-17 19:20:42] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality725388490408487113.gal : 13 ms
[2022-05-17 19:20:42] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11197282816331452015.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/ReachabilityCardinality725388490408487113.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11197282816331452015.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/ReachabilityCardinality11197282816331452015.prop.
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin866195996467850109
[2022-05-17 19:20:57] [INFO ] Built C files in 35ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin866195996467850109
Running compilation step : cd /tmp/ltsmin866195996467850109;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin866195996467850109;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin866195996467850109;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-17 19:21:00] [INFO ] Flatten gal took : 70 ms
[2022-05-17 19:21:00] [INFO ] Flatten gal took : 77 ms
[2022-05-17 19:21:00] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability7402506002376203299.gal : 11 ms
[2022-05-17 19:21:00] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability7562175462642521560.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/ReachabilityFireability7402506002376203299.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability7562175462642521560.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/ReachabilityFireability7562175462642521560.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :2 after 4
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :4 after 32
Detected timeout of ITS tools.
[2022-05-17 19:21:03] [INFO ] Flatten gal took : 66 ms
[2022-05-17 19:21:03] [INFO ] Applying decomposition
[2022-05-17 19:21:04] [INFO ] Flatten gal took : 68 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/graph10134592675994595300.txt' '-o' '/tmp/graph10134592675994595300.bin' '-w' '/tmp/graph10134592675994595300.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph10134592675994595300.bin' '-l' '-1' '-v' '-w' '/tmp/graph10134592675994595300.weights' '-q' '0' '-e' '0.001'
[2022-05-17 19:21:04] [INFO ] Decomposing Gal with order
[2022-05-17 19:21:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 19:21:04] [INFO ] Removed a total of 3400 redundant transitions.
[2022-05-17 19:21:04] [INFO ] Flatten gal took : 187 ms
[2022-05-17 19:21:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 419 labels/synchronizations in 45 ms.
[2022-05-17 19:21:04] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability13767412265700398084.gal : 13 ms
[2022-05-17 19:21:04] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability1949395552525364764.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/ReachabilityFireability13767412265700398084.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability1949395552525364764.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/ReachabilityFireability1949395552525364764.prop.
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin11090689027713299704
[2022-05-17 19:21:07] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11090689027713299704
Running compilation step : cd /tmp/ltsmin11090689027713299704;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11090689027713299704;'/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' killed by timeout after 2 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11090689027713299704;'/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' killed by timeout after 2 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-17 19:21:09] [INFO ] Flatten gal took : 68 ms
[2022-05-17 19:21:09] [INFO ] Flatten gal took : 68 ms
[2022-05-17 19:21:09] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability10202964477243693247.gal : 9 ms
[2022-05-17 19:21:09] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability14924940415780209592.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/ReachabilityFireability10202964477243693247.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability14924940415780209592.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/ReachabilityFireability14924940415780209592.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :2 after 4
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :4 after 32
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :32 after 160
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :160 after 176
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :176 after 393
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :393 after 1149
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :1149 after 1707
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :1707 after 2025
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :2025 after 7569
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :7569 after 33332
Detected timeout of ITS tools.
[2022-05-17 19:21:39] [INFO ] Flatten gal took : 70 ms
[2022-05-17 19:21:39] [INFO ] Applying decomposition
[2022-05-17 19:21:39] [INFO ] Flatten gal took : 67 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/graph14641012047604109744.txt' '-o' '/tmp/graph14641012047604109744.bin' '-w' '/tmp/graph14641012047604109744.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph14641012047604109744.bin' '-l' '-1' '-v' '-w' '/tmp/graph14641012047604109744.weights' '-q' '0' '-e' '0.001'
[2022-05-17 19:21:40] [INFO ] Decomposing Gal with order
[2022-05-17 19:21:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 19:21:40] [INFO ] Removed a total of 3402 redundant transitions.
[2022-05-17 19:21:40] [INFO ] Flatten gal took : 151 ms
[2022-05-17 19:21:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 423 labels/synchronizations in 28 ms.
[2022-05-17 19:21:40] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability3321694172196240290.gal : 10 ms
[2022-05-17 19:21:40] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability17462777535499414209.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/ReachabilityFireability3321694172196240290.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability17462777535499414209.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/ReachabilityFireability17462777535499414209.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 334581
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :334581 after 334581
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :334581 after 334581
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :334581 after 334581
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :334581 after 595815
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :595815 after 595871
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :595871 after 731619
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :731619 after 732058
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :732058 after 735197
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :735197 after 736566
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin939656712412612848
[2022-05-17 19:22:10] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin939656712412612848
Running compilation step : cd /tmp/ltsmin939656712412612848;'/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 3008 ms.
Running link step : cd /tmp/ltsmin939656712412612848;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 50 ms.
Running LTSmin : cd /tmp/ltsmin939656712412612848;'/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:22:40] [INFO ] Flatten gal took : 64 ms
[2022-05-17 19:22:40] [INFO ] Flatten gal took : 65 ms
[2022-05-17 19:22:40] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability2433032584333373330.gal : 7 ms
[2022-05-17 19:22:40] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability3897417599730591825.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/ReachabilityFireability2433032584333373330.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability3897417599730591825.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/ReachabilityFireability3897417599730591825.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :2 after 4
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :4 after 32
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :32 after 160
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :160 after 176
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :176 after 393
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :393 after 1149
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :1149 after 1707
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :1707 after 2025
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :2025 after 7569
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :7569 after 33332
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :33332 after 95779
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :95779 after 197441
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :197441 after 514794
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :514794 after 1.08327e+06
Detected timeout of ITS tools.
[2022-05-17 19:27:40] [INFO ] Flatten gal took : 63 ms
[2022-05-17 19:27:40] [INFO ] Applying decomposition
[2022-05-17 19:27:41] [INFO ] Flatten gal took : 61 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/graph6193262350340858817.txt' '-o' '/tmp/graph6193262350340858817.bin' '-w' '/tmp/graph6193262350340858817.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph6193262350340858817.bin' '-l' '-1' '-v' '-w' '/tmp/graph6193262350340858817.weights' '-q' '0' '-e' '0.001'
[2022-05-17 19:27:41] [INFO ] Decomposing Gal with order
[2022-05-17 19:27:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 19:27:41] [INFO ] Removed a total of 3400 redundant transitions.
[2022-05-17 19:27:41] [INFO ] Flatten gal took : 168 ms
[2022-05-17 19:27:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 421 labels/synchronizations in 29 ms.
[2022-05-17 19:27:41] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability17577280958956956818.gal : 11 ms
[2022-05-17 19:27:41] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability7791815410932384478.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/ReachabilityFireability17577280958956956818.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability7791815410932384478.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/ReachabilityFireability7791815410932384478.prop.

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-S10J40"
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-S10J40, 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-165277024500492"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PolyORBNT-COL-S10J40.tgz
mv PolyORBNT-COL-S10J40 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 ;