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.r222-tall-165286024800175.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 ShieldIIPs-PT-100B, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r222-tall-165286024800175
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.2M
-rw-r--r-- 1 mcc users 6.5K Apr 29 14:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K Apr 29 14:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Apr 29 14:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Apr 29 14:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.0K May 9 08:49 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 9 08:49 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 9 08:49 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 08:49 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 29 14:58 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 106K Apr 29 14:58 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 29 14:58 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 109K Apr 29 14:58 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 08:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 08:49 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 5 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 1.7M May 10 09:34 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1654268629748

Running Version 202205111006
[2022-06-03 15:03:50] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-06-03 15:03:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-03 15:03:51] [INFO ] Load time of PNML (sax parser for PT used): 290 ms
[2022-06-03 15:03:51] [INFO ] Transformed 6003 places.
[2022-06-03 15:03:51] [INFO ] Transformed 5903 transitions.
[2022-06-03 15:03:51] [INFO ] Found NUPN structural information;
[2022-06-03 15:03:51] [INFO ] Parsed PT model containing 6003 places and 5903 transitions in 646 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 16 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 2 resets, run finished after 721 ms. (steps per millisecond=13 ) properties (out of 16) seen :4
FORMULA ShieldIIPs-PT-100B-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-100B-ReachabilityFireability-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-100B-ReachabilityFireability-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-100B-ReachabilityFireability-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 12) seen :0
Running SMT prover for 12 properties.
// Phase 1: matrix 5903 rows 6003 cols
[2022-06-03 15:03:53] [INFO ] Computed 901 place invariants in 82 ms
[2022-06-03 15:03:56] [INFO ] [Real]Absence check using 901 positive place invariants in 573 ms returned sat
[2022-06-03 15:03:56] [INFO ] After 3165ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:12
[2022-06-03 15:03:58] [INFO ] [Nat]Absence check using 901 positive place invariants in 633 ms returned sat
[2022-06-03 15:04:21] [INFO ] After 21592ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :9
[2022-06-03 15:04:21] [INFO ] After 21605ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :9
Attempting to minimize the solution found.
Minimization took 2 ms.
[2022-06-03 15:04:21] [INFO ] After 25057ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :9
FORMULA ShieldIIPs-PT-100B-ReachabilityFireability-04 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 12 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 10963 ms.
Support contains 307 out of 6003 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 6003/6003 places, 5903/5903 transitions.
Drop transitions removed 457 transitions
Trivial Post-agglo rules discarded 457 transitions
Performed 457 trivial Post agglomeration. Transition count delta: 457
Iterating post reduction 0 with 457 rules applied. Total rules applied 457 place count 6003 transition count 5446
Reduce places removed 457 places and 0 transitions.
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Iterating post reduction 1 with 469 rules applied. Total rules applied 926 place count 5546 transition count 5434
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 938 place count 5534 transition count 5434
Performed 475 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 475 Pre rules applied. Total rules applied 938 place count 5534 transition count 4959
Deduced a syphon composed of 475 places in 24 ms
Reduce places removed 475 places and 0 transitions.
Iterating global reduction 3 with 950 rules applied. Total rules applied 1888 place count 5059 transition count 4959
Discarding 646 places :
Symmetric choice reduction at 3 with 646 rule applications. Total rules 2534 place count 4413 transition count 4313
Iterating global reduction 3 with 646 rules applied. Total rules applied 3180 place count 4413 transition count 4313
Performed 231 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 231 Pre rules applied. Total rules applied 3180 place count 4413 transition count 4082
Deduced a syphon composed of 231 places in 20 ms
Reduce places removed 231 places and 0 transitions.
Iterating global reduction 3 with 462 rules applied. Total rules applied 3642 place count 4182 transition count 4082
Performed 1396 Post agglomeration using F-continuation condition.Transition count delta: 1396
Deduced a syphon composed of 1396 places in 14 ms
Reduce places removed 1396 places and 0 transitions.
Iterating global reduction 3 with 2792 rules applied. Total rules applied 6434 place count 2786 transition count 2686
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 604 times.
Drop transitions removed 604 transitions
Iterating global reduction 3 with 604 rules applied. Total rules applied 7038 place count 2786 transition count 2686
Applied a total of 7038 rules in 2235 ms. Remains 2786 /6003 variables (removed 3217) and now considering 2686/5903 (removed 3217) transitions.
Finished structural reductions, in 1 iterations. Remains : 2786/6003 places, 2686/5903 transitions.
Incomplete random walk after 1000000 steps, including 127 resets, run finished after 29363 ms. (steps per millisecond=34 ) properties (out of 11) seen :8
FORMULA ShieldIIPs-PT-100B-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-100B-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-100B-ReachabilityFireability-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-100B-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-100B-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-100B-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-100B-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-100B-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Interrupted Best-First random walk after 401953 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=80 ) properties seen 1
FORMULA ShieldIIPs-PT-100B-ReachabilityFireability-06 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Interrupted Best-First random walk after 393391 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=78 ) properties seen 0
Interrupted Best-First random walk after 378187 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=75 ) properties seen 0
Running SMT prover for 2 properties.
// Phase 1: matrix 2686 rows 2786 cols
[2022-06-03 15:05:19] [INFO ] Computed 901 place invariants in 121 ms
[2022-06-03 15:05:19] [INFO ] After 459ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-06-03 15:05:20] [INFO ] [Nat]Absence check using 877 positive place invariants in 201 ms returned sat
[2022-06-03 15:05:20] [INFO ] [Nat]Absence check using 877 positive and 24 generalized place invariants in 7 ms returned sat
[2022-06-03 15:05:22] [INFO ] After 2236ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-06-03 15:05:22] [INFO ] State equation strengthened by 4 read => feed constraints.
[2022-06-03 15:05:23] [INFO ] After 910ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-06-03 15:05:24] [INFO ] Deduced a trap composed of 6 places in 393 ms of which 4 ms to minimize.
[2022-06-03 15:05:24] [INFO ] Deduced a trap composed of 15 places in 470 ms of which 2 ms to minimize.
[2022-06-03 15:05:25] [INFO ] Deduced a trap composed of 13 places in 417 ms of which 2 ms to minimize.
[2022-06-03 15:05:25] [INFO ] Deduced a trap composed of 11 places in 388 ms of which 3 ms to minimize.
[2022-06-03 15:05:26] [INFO ] Deduced a trap composed of 6 places in 370 ms of which 2 ms to minimize.
[2022-06-03 15:05:26] [INFO ] Deduced a trap composed of 8 places in 354 ms of which 1 ms to minimize.
[2022-06-03 15:05:27] [INFO ] Deduced a trap composed of 6 places in 379 ms of which 1 ms to minimize.
[2022-06-03 15:05:28] [INFO ] Deduced a trap composed of 6 places in 363 ms of which 1 ms to minimize.
[2022-06-03 15:05:28] [INFO ] Deduced a trap composed of 6 places in 380 ms of which 1 ms to minimize.
[2022-06-03 15:05:29] [INFO ] Deduced a trap composed of 12 places in 359 ms of which 1 ms to minimize.
[2022-06-03 15:05:29] [INFO ] Deduced a trap composed of 10 places in 371 ms of which 1 ms to minimize.
[2022-06-03 15:05:30] [INFO ] Deduced a trap composed of 8 places in 358 ms of which 1 ms to minimize.
[2022-06-03 15:05:30] [INFO ] Deduced a trap composed of 12 places in 354 ms of which 1 ms to minimize.
[2022-06-03 15:05:31] [INFO ] Deduced a trap composed of 15 places in 366 ms of which 1 ms to minimize.
[2022-06-03 15:05:31] [INFO ] Deduced a trap composed of 13 places in 337 ms of which 1 ms to minimize.
[2022-06-03 15:05:32] [INFO ] Deduced a trap composed of 14 places in 349 ms of which 1 ms to minimize.
[2022-06-03 15:05:32] [INFO ] Deduced a trap composed of 21 places in 356 ms of which 1 ms to minimize.
[2022-06-03 15:05:32] [INFO ] Deduced a trap composed of 14 places in 326 ms of which 1 ms to minimize.
[2022-06-03 15:05:33] [INFO ] Deduced a trap composed of 12 places in 327 ms of which 1 ms to minimize.
[2022-06-03 15:05:33] [INFO ] Deduced a trap composed of 12 places in 321 ms of which 1 ms to minimize.
[2022-06-03 15:05:34] [INFO ] Deduced a trap composed of 13 places in 321 ms of which 1 ms to minimize.
[2022-06-03 15:05:34] [INFO ] Deduced a trap composed of 16 places in 335 ms of which 1 ms to minimize.
[2022-06-03 15:05:35] [INFO ] Deduced a trap composed of 11 places in 331 ms of which 1 ms to minimize.
[2022-06-03 15:05:35] [INFO ] Deduced a trap composed of 14 places in 312 ms of which 1 ms to minimize.
[2022-06-03 15:05:36] [INFO ] Deduced a trap composed of 15 places in 310 ms of which 1 ms to minimize.
[2022-06-03 15:05:36] [INFO ] Deduced a trap composed of 13 places in 304 ms of which 1 ms to minimize.
[2022-06-03 15:05:37] [INFO ] Deduced a trap composed of 8 places in 307 ms of which 0 ms to minimize.
[2022-06-03 15:05:37] [INFO ] Deduced a trap composed of 18 places in 328 ms of which 1 ms to minimize.
[2022-06-03 15:05:37] [INFO ] Deduced a trap composed of 13 places in 319 ms of which 1 ms to minimize.
[2022-06-03 15:05:38] [INFO ] Deduced a trap composed of 15 places in 308 ms of which 1 ms to minimize.
[2022-06-03 15:05:38] [INFO ] Deduced a trap composed of 13 places in 305 ms of which 1 ms to minimize.
[2022-06-03 15:05:39] [INFO ] Deduced a trap composed of 15 places in 295 ms of which 1 ms to minimize.
[2022-06-03 15:05:39] [INFO ] Deduced a trap composed of 15 places in 287 ms of which 1 ms to minimize.
[2022-06-03 15:05:39] [INFO ] Deduced a trap composed of 20 places in 296 ms of which 5 ms to minimize.
[2022-06-03 15:05:40] [INFO ] Deduced a trap composed of 19 places in 295 ms of which 1 ms to minimize.
[2022-06-03 15:05:40] [INFO ] Deduced a trap composed of 18 places in 282 ms of which 1 ms to minimize.
[2022-06-03 15:05:41] [INFO ] Deduced a trap composed of 18 places in 282 ms of which 1 ms to minimize.
[2022-06-03 15:05:41] [INFO ] Deduced a trap composed of 19 places in 284 ms of which 1 ms to minimize.
[2022-06-03 15:05:41] [INFO ] Deduced a trap composed of 22 places in 280 ms of which 1 ms to minimize.
[2022-06-03 15:05:42] [INFO ] Deduced a trap composed of 22 places in 276 ms of which 1 ms to minimize.
[2022-06-03 15:05:42] [INFO ] Deduced a trap composed of 20 places in 296 ms of which 1 ms to minimize.
[2022-06-03 15:05:43] [INFO ] Deduced a trap composed of 19 places in 265 ms of which 0 ms to minimize.
[2022-06-03 15:05:43] [INFO ] Deduced a trap composed of 19 places in 256 ms of which 1 ms to minimize.
[2022-06-03 15:05:43] [INFO ] Deduced a trap composed of 26 places in 252 ms of which 1 ms to minimize.
[2022-06-03 15:05:44] [INFO ] Deduced a trap composed of 21 places in 224 ms of which 1 ms to minimize.
[2022-06-03 15:05:44] [INFO ] Deduced a trap composed of 24 places in 227 ms of which 1 ms to minimize.
[2022-06-03 15:05:44] [INFO ] Deduced a trap composed of 33 places in 229 ms of which 0 ms to minimize.
[2022-06-03 15:05:45] [INFO ] Deduced a trap composed of 20 places in 225 ms of which 1 ms to minimize.
[2022-06-03 15:05:45] [INFO ] Deduced a trap composed of 17 places in 236 ms of which 2 ms to minimize.
[2022-06-03 15:05:45] [INFO ] Deduced a trap composed of 20 places in 235 ms of which 1 ms to minimize.
[2022-06-03 15:05:46] [INFO ] Deduced a trap composed of 15 places in 236 ms of which 1 ms to minimize.
[2022-06-03 15:05:46] [INFO ] Deduced a trap composed of 28 places in 238 ms of which 1 ms to minimize.
[2022-06-03 15:05:47] [INFO ] Deduced a trap composed of 17 places in 240 ms of which 1 ms to minimize.
[2022-06-03 15:05:47] [INFO ] Deduced a trap composed of 18 places in 234 ms of which 0 ms to minimize.
[2022-06-03 15:05:47] [INFO ] Deduced a trap composed of 21 places in 235 ms of which 1 ms to minimize.
[2022-06-03 15:05:48] [INFO ] Deduced a trap composed of 13 places in 236 ms of which 1 ms to minimize.
[2022-06-03 15:05:48] [INFO ] Deduced a trap composed of 14 places in 235 ms of which 1 ms to minimize.
[2022-06-03 15:05:48] [INFO ] Deduced a trap composed of 25 places in 241 ms of which 1 ms to minimize.
[2022-06-03 15:05:49] [INFO ] Deduced a trap composed of 15 places in 241 ms of which 1 ms to minimize.
[2022-06-03 15:05:49] [INFO ] Deduced a trap composed of 27 places in 239 ms of which 1 ms to minimize.
[2022-06-03 15:05:49] [INFO ] Deduced a trap composed of 17 places in 219 ms of which 0 ms to minimize.
[2022-06-03 15:05:50] [INFO ] Deduced a trap composed of 20 places in 216 ms of which 0 ms to minimize.
[2022-06-03 15:05:50] [INFO ] Deduced a trap composed of 30 places in 200 ms of which 0 ms to minimize.
[2022-06-03 15:05:50] [INFO ] Deduced a trap composed of 23 places in 190 ms of which 1 ms to minimize.
[2022-06-03 15:05:50] [INFO ] Deduced a trap composed of 23 places in 193 ms of which 1 ms to minimize.
[2022-06-03 15:05:51] [INFO ] Deduced a trap composed of 24 places in 190 ms of which 2 ms to minimize.
[2022-06-03 15:05:51] [INFO ] Deduced a trap composed of 29 places in 186 ms of which 1 ms to minimize.
[2022-06-03 15:05:51] [INFO ] Deduced a trap composed of 26 places in 207 ms of which 16 ms to minimize.
[2022-06-03 15:05:51] [INFO ] Trap strengthening (SAT) tested/added 69/68 trap constraints in 28059 ms
[2022-06-03 15:05:52] [INFO ] Deduced a trap composed of 8 places in 242 ms of which 1 ms to minimize.
[2022-06-03 15:05:53] [INFO ] Deduced a trap composed of 6 places in 228 ms of which 1 ms to minimize.
[2022-06-03 15:05:53] [INFO ] Deduced a trap composed of 10 places in 223 ms of which 1 ms to minimize.
[2022-06-03 15:05:53] [INFO ] Deduced a trap composed of 12 places in 237 ms of which 1 ms to minimize.
[2022-06-03 15:05:54] [INFO ] Deduced a trap composed of 11 places in 222 ms of which 1 ms to minimize.
[2022-06-03 15:05:54] [INFO ] Deduced a trap composed of 9 places in 224 ms of which 1 ms to minimize.
[2022-06-03 15:05:54] [INFO ] Deduced a trap composed of 25 places in 207 ms of which 1 ms to minimize.
[2022-06-03 15:05:55] [INFO ] Deduced a trap composed of 17 places in 209 ms of which 0 ms to minimize.
[2022-06-03 15:05:55] [INFO ] Deduced a trap composed of 14 places in 209 ms of which 0 ms to minimize.
[2022-06-03 15:05:55] [INFO ] Deduced a trap composed of 20 places in 214 ms of which 0 ms to minimize.
[2022-06-03 15:05:56] [INFO ] Deduced a trap composed of 24 places in 216 ms of which 1 ms to minimize.
[2022-06-03 15:05:56] [INFO ] Deduced a trap composed of 20 places in 223 ms of which 1 ms to minimize.
[2022-06-03 15:05:57] [INFO ] Deduced a trap composed of 15 places in 221 ms of which 0 ms to minimize.
[2022-06-03 15:05:57] [INFO ] Deduced a trap composed of 20 places in 182 ms of which 0 ms to minimize.
[2022-06-03 15:05:57] [INFO ] Deduced a trap composed of 34 places in 182 ms of which 0 ms to minimize.
[2022-06-03 15:05:57] [INFO ] Deduced a trap composed of 21 places in 178 ms of which 0 ms to minimize.
[2022-06-03 15:05:58] [INFO ] Deduced a trap composed of 25 places in 177 ms of which 1 ms to minimize.
[2022-06-03 15:05:58] [INFO ] Deduced a trap composed of 30 places in 174 ms of which 0 ms to minimize.
[2022-06-03 15:05:58] [INFO ] Deduced a trap composed of 18 places in 172 ms of which 0 ms to minimize.
[2022-06-03 15:05:59] [INFO ] Deduced a trap composed of 26 places in 168 ms of which 0 ms to minimize.
[2022-06-03 15:05:59] [INFO ] Deduced a trap composed of 25 places in 169 ms of which 0 ms to minimize.
[2022-06-03 15:05:59] [INFO ] Deduced a trap composed of 23 places in 175 ms of which 1 ms to minimize.
[2022-06-03 15:06:00] [INFO ] Deduced a trap composed of 25 places in 170 ms of which 0 ms to minimize.
[2022-06-03 15:06:00] [INFO ] Deduced a trap composed of 24 places in 170 ms of which 0 ms to minimize.
[2022-06-03 15:06:00] [INFO ] Deduced a trap composed of 28 places in 156 ms of which 1 ms to minimize.
[2022-06-03 15:06:01] [INFO ] Deduced a trap composed of 23 places in 151 ms of which 1 ms to minimize.
[2022-06-03 15:06:01] [INFO ] Deduced a trap composed of 22 places in 145 ms of which 0 ms to minimize.
[2022-06-03 15:06:01] [INFO ] Deduced a trap composed of 22 places in 147 ms of which 0 ms to minimize.
[2022-06-03 15:06:01] [INFO ] Deduced a trap composed of 31 places in 149 ms of which 0 ms to minimize.
[2022-06-03 15:06:02] [INFO ] Deduced a trap composed of 28 places in 175 ms of which 0 ms to minimize.
[2022-06-03 15:06:02] [INFO ] Deduced a trap composed of 21 places in 152 ms of which 1 ms to minimize.
[2022-06-03 15:06:02] [INFO ] Deduced a trap composed of 21 places in 145 ms of which 0 ms to minimize.
[2022-06-03 15:06:03] [INFO ] Deduced a trap composed of 22 places in 153 ms of which 0 ms to minimize.
[2022-06-03 15:06:03] [INFO ] Deduced a trap composed of 36 places in 148 ms of which 1 ms to minimize.
[2022-06-03 15:06:03] [INFO ] Trap strengthening (SAT) tested/added 35/34 trap constraints in 11144 ms
[2022-06-03 15:06:03] [INFO ] After 41002ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 1188 ms.
[2022-06-03 15:06:04] [INFO ] After 45049ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 6291 ms.
Support contains 98 out of 2786 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2786/2786 places, 2686/2686 transitions.
Drop transitions removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 0 with 19 rules applied. Total rules applied 19 place count 2786 transition count 2667
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 1 with 19 rules applied. Total rules applied 38 place count 2767 transition count 2667
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 41 Pre rules applied. Total rules applied 38 place count 2767 transition count 2626
Deduced a syphon composed of 41 places in 7 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 2 with 82 rules applied. Total rules applied 120 place count 2726 transition count 2626
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 121 place count 2725 transition count 2625
Iterating global reduction 2 with 1 rules applied. Total rules applied 122 place count 2725 transition count 2625
Performed 132 Post agglomeration using F-continuation condition.Transition count delta: 132
Deduced a syphon composed of 132 places in 8 ms
Reduce places removed 132 places and 0 transitions.
Iterating global reduction 2 with 264 rules applied. Total rules applied 386 place count 2593 transition count 2493
Partial Free-agglomeration rule applied 70 times.
Drop transitions removed 70 transitions
Iterating global reduction 2 with 70 rules applied. Total rules applied 456 place count 2593 transition count 2493
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 457 place count 2592 transition count 2492
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 458 place count 2591 transition count 2492
Applied a total of 458 rules in 496 ms. Remains 2591 /2786 variables (removed 195) and now considering 2492/2686 (removed 194) transitions.
Finished structural reductions, in 1 iterations. Remains : 2591/2786 places, 2492/2686 transitions.
Incomplete random walk after 1000000 steps, including 116 resets, run finished after 24649 ms. (steps per millisecond=40 ) properties (out of 2) seen :0
Interrupted Best-First random walk after 391642 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=78 ) properties seen 0
Interrupted Best-First random walk after 368170 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=73 ) properties seen 0
Interrupted probabilistic random walk after 2205120 steps, run timeout after 102001 ms. (steps per millisecond=21 ) properties seen :{}
Probabilistic random walk after 2205120 steps, saw 698943 distinct states, run finished after 102002 ms. (steps per millisecond=21 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 2492 rows 2591 cols
[2022-06-03 15:08:28] [INFO ] Computed 900 place invariants in 29 ms
[2022-06-03 15:08:28] [INFO ] After 343ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-06-03 15:08:29] [INFO ] [Nat]Absence check using 886 positive place invariants in 166 ms returned sat
[2022-06-03 15:08:29] [INFO ] [Nat]Absence check using 886 positive and 14 generalized place invariants in 3 ms returned sat
[2022-06-03 15:08:31] [INFO ] After 2683ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-06-03 15:08:34] [INFO ] Deduced a trap composed of 3 places in 242 ms of which 1 ms to minimize.
[2022-06-03 15:08:34] [INFO ] Deduced a trap composed of 5 places in 235 ms of which 1 ms to minimize.
[2022-06-03 15:08:35] [INFO ] Deduced a trap composed of 5 places in 251 ms of which 1 ms to minimize.
[2022-06-03 15:08:35] [INFO ] Deduced a trap composed of 11 places in 263 ms of which 1 ms to minimize.
[2022-06-03 15:08:35] [INFO ] Deduced a trap composed of 7 places in 273 ms of which 1 ms to minimize.
[2022-06-03 15:08:36] [INFO ] Deduced a trap composed of 6 places in 258 ms of which 0 ms to minimize.
[2022-06-03 15:08:36] [INFO ] Deduced a trap composed of 6 places in 270 ms of which 1 ms to minimize.
[2022-06-03 15:08:37] [INFO ] Deduced a trap composed of 6 places in 259 ms of which 1 ms to minimize.
[2022-06-03 15:08:37] [INFO ] Deduced a trap composed of 16 places in 246 ms of which 1 ms to minimize.
[2022-06-03 15:08:38] [INFO ] Deduced a trap composed of 11 places in 243 ms of which 0 ms to minimize.
[2022-06-03 15:08:38] [INFO ] Deduced a trap composed of 6 places in 249 ms of which 0 ms to minimize.
[2022-06-03 15:08:39] [INFO ] Deduced a trap composed of 5 places in 241 ms of which 1 ms to minimize.
[2022-06-03 15:08:39] [INFO ] Deduced a trap composed of 9 places in 248 ms of which 1 ms to minimize.
[2022-06-03 15:08:39] [INFO ] Deduced a trap composed of 9 places in 242 ms of which 1 ms to minimize.
[2022-06-03 15:08:40] [INFO ] Deduced a trap composed of 12 places in 244 ms of which 1 ms to minimize.
[2022-06-03 15:08:40] [INFO ] Deduced a trap composed of 9 places in 243 ms of which 0 ms to minimize.
[2022-06-03 15:08:41] [INFO ] Deduced a trap composed of 8 places in 239 ms of which 0 ms to minimize.
[2022-06-03 15:08:41] [INFO ] Deduced a trap composed of 18 places in 239 ms of which 0 ms to minimize.
[2022-06-03 15:08:42] [INFO ] Deduced a trap composed of 15 places in 240 ms of which 0 ms to minimize.
[2022-06-03 15:08:42] [INFO ] Deduced a trap composed of 12 places in 237 ms of which 1 ms to minimize.
[2022-06-03 15:08:42] [INFO ] Deduced a trap composed of 9 places in 241 ms of which 1 ms to minimize.
[2022-06-03 15:08:43] [INFO ] Deduced a trap composed of 10 places in 227 ms of which 1 ms to minimize.
[2022-06-03 15:08:43] [INFO ] Deduced a trap composed of 9 places in 234 ms of which 1 ms to minimize.
[2022-06-03 15:08:44] [INFO ] Deduced a trap composed of 5 places in 220 ms of which 0 ms to minimize.
[2022-06-03 15:08:44] [INFO ] Deduced a trap composed of 10 places in 220 ms of which 1 ms to minimize.
[2022-06-03 15:08:44] [INFO ] Deduced a trap composed of 17 places in 217 ms of which 1 ms to minimize.
[2022-06-03 15:08:45] [INFO ] Deduced a trap composed of 9 places in 213 ms of which 0 ms to minimize.
[2022-06-03 15:08:45] [INFO ] Deduced a trap composed of 17 places in 204 ms of which 1 ms to minimize.
[2022-06-03 15:08:46] [INFO ] Deduced a trap composed of 11 places in 205 ms of which 1 ms to minimize.
[2022-06-03 15:08:46] [INFO ] Deduced a trap composed of 14 places in 196 ms of which 1 ms to minimize.
[2022-06-03 15:08:46] [INFO ] Deduced a trap composed of 7 places in 189 ms of which 1 ms to minimize.
[2022-06-03 15:08:47] [INFO ] Deduced a trap composed of 7 places in 178 ms of which 0 ms to minimize.
[2022-06-03 15:08:47] [INFO ] Deduced a trap composed of 10 places in 169 ms of which 0 ms to minimize.
[2022-06-03 15:08:48] [INFO ] Deduced a trap composed of 10 places in 209 ms of which 0 ms to minimize.
[2022-06-03 15:08:48] [INFO ] Deduced a trap composed of 20 places in 163 ms of which 1 ms to minimize.
[2022-06-03 15:08:48] [INFO ] Deduced a trap composed of 8 places in 126 ms of which 0 ms to minimize.
[2022-06-03 15:08:48] [INFO ] Deduced a trap composed of 14 places in 99 ms of which 1 ms to minimize.
[2022-06-03 15:08:49] [INFO ] Deduced a trap composed of 11 places in 86 ms of which 0 ms to minimize.
[2022-06-03 15:08:49] [INFO ] Trap strengthening (SAT) tested/added 39/38 trap constraints in 15685 ms
[2022-06-03 15:08:50] [INFO ] Deduced a trap composed of 5 places in 322 ms of which 1 ms to minimize.
[2022-06-03 15:08:50] [INFO ] Deduced a trap composed of 10 places in 314 ms of which 1 ms to minimize.
[2022-06-03 15:08:50] [INFO ] Deduced a trap composed of 8 places in 318 ms of which 1 ms to minimize.
[2022-06-03 15:08:51] [INFO ] Deduced a trap composed of 5 places in 306 ms of which 1 ms to minimize.
[2022-06-03 15:08:51] [INFO ] Deduced a trap composed of 5 places in 309 ms of which 1 ms to minimize.
[2022-06-03 15:08:52] [INFO ] Deduced a trap composed of 5 places in 305 ms of which 0 ms to minimize.
[2022-06-03 15:08:52] [INFO ] Deduced a trap composed of 8 places in 300 ms of which 1 ms to minimize.
[2022-06-03 15:08:52] [INFO ] Deduced a trap composed of 8 places in 300 ms of which 1 ms to minimize.
[2022-06-03 15:08:53] [INFO ] Deduced a trap composed of 8 places in 290 ms of which 1 ms to minimize.
[2022-06-03 15:08:53] [INFO ] Deduced a trap composed of 8 places in 316 ms of which 0 ms to minimize.
[2022-06-03 15:08:54] [INFO ] Deduced a trap composed of 5 places in 273 ms of which 1 ms to minimize.
[2022-06-03 15:08:54] [INFO ] Deduced a trap composed of 6 places in 274 ms of which 1 ms to minimize.
[2022-06-03 15:08:54] [INFO ] Deduced a trap composed of 6 places in 279 ms of which 1 ms to minimize.
[2022-06-03 15:08:55] [INFO ] Deduced a trap composed of 17 places in 283 ms of which 1 ms to minimize.
[2022-06-03 15:08:55] [INFO ] Deduced a trap composed of 6 places in 265 ms of which 1 ms to minimize.
[2022-06-03 15:08:56] [INFO ] Deduced a trap composed of 8 places in 265 ms of which 0 ms to minimize.
[2022-06-03 15:08:56] [INFO ] Deduced a trap composed of 8 places in 252 ms of which 1 ms to minimize.
[2022-06-03 15:08:56] [INFO ] Deduced a trap composed of 7 places in 248 ms of which 1 ms to minimize.
[2022-06-03 15:08:57] [INFO ] Deduced a trap composed of 10 places in 256 ms of which 1 ms to minimize.
[2022-06-03 15:08:57] [INFO ] Deduced a trap composed of 5 places in 226 ms of which 0 ms to minimize.
[2022-06-03 15:08:57] [INFO ] Deduced a trap composed of 7 places in 232 ms of which 0 ms to minimize.
[2022-06-03 15:08:58] [INFO ] Deduced a trap composed of 6 places in 232 ms of which 1 ms to minimize.
[2022-06-03 15:08:58] [INFO ] Deduced a trap composed of 8 places in 233 ms of which 0 ms to minimize.
[2022-06-03 15:08:58] [INFO ] Deduced a trap composed of 7 places in 224 ms of which 1 ms to minimize.
[2022-06-03 15:08:59] [INFO ] Deduced a trap composed of 6 places in 219 ms of which 0 ms to minimize.
[2022-06-03 15:08:59] [INFO ] Deduced a trap composed of 8 places in 224 ms of which 0 ms to minimize.
[2022-06-03 15:08:59] [INFO ] Deduced a trap composed of 7 places in 219 ms of which 1 ms to minimize.
[2022-06-03 15:09:00] [INFO ] Deduced a trap composed of 9 places in 223 ms of which 1 ms to minimize.
[2022-06-03 15:09:00] [INFO ] Deduced a trap composed of 8 places in 221 ms of which 1 ms to minimize.
[2022-06-03 15:09:00] [INFO ] Deduced a trap composed of 6 places in 207 ms of which 0 ms to minimize.
[2022-06-03 15:09:00] [INFO ] Deduced a trap composed of 14 places in 218 ms of which 1 ms to minimize.
[2022-06-03 15:09:01] [INFO ] Deduced a trap composed of 7 places in 212 ms of which 0 ms to minimize.
[2022-06-03 15:09:01] [INFO ] Deduced a trap composed of 19 places in 210 ms of which 0 ms to minimize.
[2022-06-03 15:09:01] [INFO ] Deduced a trap composed of 10 places in 213 ms of which 0 ms to minimize.
[2022-06-03 15:09:02] [INFO ] Deduced a trap composed of 6 places in 208 ms of which 1 ms to minimize.
[2022-06-03 15:09:02] [INFO ] Deduced a trap composed of 8 places in 206 ms of which 0 ms to minimize.
[2022-06-03 15:09:02] [INFO ] Deduced a trap composed of 8 places in 205 ms of which 1 ms to minimize.
[2022-06-03 15:09:03] [INFO ] Deduced a trap composed of 18 places in 195 ms of which 0 ms to minimize.
[2022-06-03 15:09:03] [INFO ] Deduced a trap composed of 19 places in 175 ms of which 0 ms to minimize.
[2022-06-03 15:09:03] [INFO ] Deduced a trap composed of 19 places in 175 ms of which 1 ms to minimize.
[2022-06-03 15:09:03] [INFO ] Deduced a trap composed of 10 places in 170 ms of which 0 ms to minimize.
[2022-06-03 15:09:04] [INFO ] Deduced a trap composed of 6 places in 173 ms of which 1 ms to minimize.
[2022-06-03 15:09:04] [INFO ] Deduced a trap composed of 9 places in 170 ms of which 0 ms to minimize.
[2022-06-03 15:09:04] [INFO ] Deduced a trap composed of 13 places in 162 ms of which 0 ms to minimize.
[2022-06-03 15:09:04] [INFO ] Deduced a trap composed of 6 places in 160 ms of which 1 ms to minimize.
[2022-06-03 15:09:05] [INFO ] Deduced a trap composed of 9 places in 156 ms of which 1 ms to minimize.
[2022-06-03 15:09:05] [INFO ] Deduced a trap composed of 13 places in 159 ms of which 1 ms to minimize.
[2022-06-03 15:09:05] [INFO ] Deduced a trap composed of 6 places in 161 ms of which 0 ms to minimize.
[2022-06-03 15:09:05] [INFO ] Deduced a trap composed of 16 places in 158 ms of which 1 ms to minimize.
[2022-06-03 15:09:06] [INFO ] Deduced a trap composed of 10 places in 176 ms of which 1 ms to minimize.
[2022-06-03 15:09:06] [INFO ] Deduced a trap composed of 20 places in 154 ms of which 0 ms to minimize.
[2022-06-03 15:09:06] [INFO ] Deduced a trap composed of 10 places in 151 ms of which 0 ms to minimize.
[2022-06-03 15:09:06] [INFO ] Trap strengthening (SAT) tested/added 53/52 trap constraints in 17202 ms
[2022-06-03 15:09:06] [INFO ] After 37657ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 961 ms.
[2022-06-03 15:09:07] [INFO ] After 39181ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 10856 ms.
Support contains 98 out of 2591 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2591/2591 places, 2492/2492 transitions.
Applied a total of 0 rules in 101 ms. Remains 2591 /2591 variables (removed 0) and now considering 2492/2492 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 2591/2591 places, 2492/2492 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 2591/2591 places, 2492/2492 transitions.
Applied a total of 0 rules in 105 ms. Remains 2591 /2591 variables (removed 0) and now considering 2492/2492 (removed 0) transitions.
// Phase 1: matrix 2492 rows 2591 cols
[2022-06-03 15:09:19] [INFO ] Computed 900 place invariants in 20 ms
[2022-06-03 15:09:20] [INFO ] Implicit Places using invariants in 1712 ms returned []
// Phase 1: matrix 2492 rows 2591 cols
[2022-06-03 15:09:20] [INFO ] Computed 900 place invariants in 29 ms
[2022-06-03 15:09:24] [INFO ] Implicit Places using invariants and state equation in 4103 ms returned []
Implicit Place search using SMT with State Equation took 5818 ms to find 0 implicit places.
[2022-06-03 15:09:25] [INFO ] Redundant transitions in 789 ms returned []
// Phase 1: matrix 2492 rows 2591 cols
[2022-06-03 15:09:25] [INFO ] Computed 900 place invariants in 25 ms
[2022-06-03 15:09:26] [INFO ] Dead Transitions using invariants and state equation in 1390 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2591/2591 places, 2492/2492 transitions.
Incomplete random walk after 1000000 steps, including 117 resets, run finished after 23875 ms. (steps per millisecond=41 ) properties (out of 2) seen :0
Interrupted Best-First random walk after 393519 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=78 ) properties seen 0
Interrupted Best-First random walk after 366137 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=73 ) properties seen 0
Interrupted probabilistic random walk after 2107370 steps, run timeout after 99001 ms. (steps per millisecond=21 ) properties seen :{}
Probabilistic random walk after 2107370 steps, saw 683993 distinct states, run finished after 99001 ms. (steps per millisecond=21 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 2492 rows 2591 cols
[2022-06-03 15:11:39] [INFO ] Computed 900 place invariants in 28 ms
[2022-06-03 15:11:40] [INFO ] After 306ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-06-03 15:11:40] [INFO ] [Nat]Absence check using 886 positive place invariants in 165 ms returned sat
[2022-06-03 15:11:40] [INFO ] [Nat]Absence check using 886 positive and 14 generalized place invariants in 5 ms returned sat
[2022-06-03 15:11:43] [INFO ] After 2760ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-06-03 15:11:45] [INFO ] Deduced a trap composed of 3 places in 236 ms of which 0 ms to minimize.
[2022-06-03 15:11:46] [INFO ] Deduced a trap composed of 5 places in 241 ms of which 1 ms to minimize.
[2022-06-03 15:11:46] [INFO ] Deduced a trap composed of 5 places in 268 ms of which 1 ms to minimize.
[2022-06-03 15:11:47] [INFO ] Deduced a trap composed of 11 places in 267 ms of which 1 ms to minimize.
[2022-06-03 15:11:47] [INFO ] Deduced a trap composed of 7 places in 266 ms of which 1 ms to minimize.
[2022-06-03 15:11:48] [INFO ] Deduced a trap composed of 6 places in 260 ms of which 1 ms to minimize.
[2022-06-03 15:11:48] [INFO ] Deduced a trap composed of 6 places in 257 ms of which 0 ms to minimize.
[2022-06-03 15:11:49] [INFO ] Deduced a trap composed of 6 places in 245 ms of which 0 ms to minimize.
[2022-06-03 15:11:49] [INFO ] Deduced a trap composed of 16 places in 245 ms of which 1 ms to minimize.
[2022-06-03 15:11:49] [INFO ] Deduced a trap composed of 11 places in 250 ms of which 1 ms to minimize.
[2022-06-03 15:11:50] [INFO ] Deduced a trap composed of 6 places in 237 ms of which 1 ms to minimize.
[2022-06-03 15:11:50] [INFO ] Deduced a trap composed of 5 places in 299 ms of which 1 ms to minimize.
[2022-06-03 15:11:51] [INFO ] Deduced a trap composed of 9 places in 247 ms of which 1 ms to minimize.
[2022-06-03 15:11:51] [INFO ] Deduced a trap composed of 9 places in 250 ms of which 0 ms to minimize.
[2022-06-03 15:11:52] [INFO ] Deduced a trap composed of 12 places in 236 ms of which 1 ms to minimize.
[2022-06-03 15:11:52] [INFO ] Deduced a trap composed of 9 places in 234 ms of which 1 ms to minimize.
[2022-06-03 15:11:52] [INFO ] Deduced a trap composed of 8 places in 236 ms of which 1 ms to minimize.
[2022-06-03 15:11:53] [INFO ] Deduced a trap composed of 18 places in 229 ms of which 0 ms to minimize.
[2022-06-03 15:11:53] [INFO ] Deduced a trap composed of 15 places in 224 ms of which 1 ms to minimize.
[2022-06-03 15:11:54] [INFO ] Deduced a trap composed of 12 places in 231 ms of which 1 ms to minimize.
[2022-06-03 15:11:54] [INFO ] Deduced a trap composed of 9 places in 220 ms of which 1 ms to minimize.
[2022-06-03 15:11:54] [INFO ] Deduced a trap composed of 10 places in 214 ms of which 1 ms to minimize.
[2022-06-03 15:11:55] [INFO ] Deduced a trap composed of 9 places in 221 ms of which 1 ms to minimize.
[2022-06-03 15:11:55] [INFO ] Deduced a trap composed of 5 places in 235 ms of which 0 ms to minimize.
[2022-06-03 15:11:56] [INFO ] Deduced a trap composed of 10 places in 213 ms of which 0 ms to minimize.
[2022-06-03 15:11:56] [INFO ] Deduced a trap composed of 17 places in 214 ms of which 1 ms to minimize.
[2022-06-03 15:11:57] [INFO ] Deduced a trap composed of 9 places in 208 ms of which 1 ms to minimize.
[2022-06-03 15:11:57] [INFO ] Deduced a trap composed of 17 places in 215 ms of which 1 ms to minimize.
[2022-06-03 15:11:57] [INFO ] Deduced a trap composed of 11 places in 210 ms of which 1 ms to minimize.
[2022-06-03 15:11:58] [INFO ] Deduced a trap composed of 14 places in 196 ms of which 1 ms to minimize.
[2022-06-03 15:11:58] [INFO ] Deduced a trap composed of 7 places in 190 ms of which 1 ms to minimize.
[2022-06-03 15:11:58] [INFO ] Deduced a trap composed of 7 places in 188 ms of which 0 ms to minimize.
[2022-06-03 15:11:59] [INFO ] Deduced a trap composed of 10 places in 168 ms of which 1 ms to minimize.
[2022-06-03 15:11:59] [INFO ] Deduced a trap composed of 10 places in 157 ms of which 1 ms to minimize.
[2022-06-03 15:12:00] [INFO ] Deduced a trap composed of 20 places in 175 ms of which 0 ms to minimize.
[2022-06-03 15:12:00] [INFO ] Deduced a trap composed of 8 places in 132 ms of which 0 ms to minimize.
[2022-06-03 15:12:00] [INFO ] Deduced a trap composed of 14 places in 97 ms of which 1 ms to minimize.
[2022-06-03 15:12:00] [INFO ] Deduced a trap composed of 11 places in 90 ms of which 1 ms to minimize.
[2022-06-03 15:12:01] [INFO ] Trap strengthening (SAT) tested/added 39/38 trap constraints in 15741 ms
[2022-06-03 15:12:01] [INFO ] Deduced a trap composed of 5 places in 329 ms of which 1 ms to minimize.
[2022-06-03 15:12:02] [INFO ] Deduced a trap composed of 10 places in 312 ms of which 1 ms to minimize.
[2022-06-03 15:12:02] [INFO ] Deduced a trap composed of 8 places in 304 ms of which 1 ms to minimize.
[2022-06-03 15:12:02] [INFO ] Deduced a trap composed of 5 places in 310 ms of which 1 ms to minimize.
[2022-06-03 15:12:03] [INFO ] Deduced a trap composed of 5 places in 304 ms of which 1 ms to minimize.
[2022-06-03 15:12:03] [INFO ] Deduced a trap composed of 5 places in 302 ms of which 1 ms to minimize.
[2022-06-03 15:12:04] [INFO ] Deduced a trap composed of 8 places in 301 ms of which 1 ms to minimize.
[2022-06-03 15:12:04] [INFO ] Deduced a trap composed of 8 places in 300 ms of which 1 ms to minimize.
[2022-06-03 15:12:04] [INFO ] Deduced a trap composed of 8 places in 290 ms of which 1 ms to minimize.
[2022-06-03 15:12:05] [INFO ] Deduced a trap composed of 8 places in 286 ms of which 1 ms to minimize.
[2022-06-03 15:12:05] [INFO ] Deduced a trap composed of 5 places in 281 ms of which 1 ms to minimize.
[2022-06-03 15:12:06] [INFO ] Deduced a trap composed of 6 places in 277 ms of which 1 ms to minimize.
[2022-06-03 15:12:06] [INFO ] Deduced a trap composed of 6 places in 284 ms of which 0 ms to minimize.
[2022-06-03 15:12:06] [INFO ] Deduced a trap composed of 17 places in 276 ms of which 0 ms to minimize.
[2022-06-03 15:12:07] [INFO ] Deduced a trap composed of 6 places in 268 ms of which 1 ms to minimize.
[2022-06-03 15:12:07] [INFO ] Deduced a trap composed of 8 places in 273 ms of which 1 ms to minimize.
[2022-06-03 15:12:08] [INFO ] Deduced a trap composed of 8 places in 257 ms of which 1 ms to minimize.
[2022-06-03 15:12:08] [INFO ] Deduced a trap composed of 7 places in 268 ms of which 0 ms to minimize.
[2022-06-03 15:12:08] [INFO ] Deduced a trap composed of 10 places in 256 ms of which 1 ms to minimize.
[2022-06-03 15:12:09] [INFO ] Deduced a trap composed of 5 places in 235 ms of which 1 ms to minimize.
[2022-06-03 15:12:09] [INFO ] Deduced a trap composed of 7 places in 232 ms of which 1 ms to minimize.
[2022-06-03 15:12:09] [INFO ] Deduced a trap composed of 6 places in 244 ms of which 1 ms to minimize.
[2022-06-03 15:12:10] [INFO ] Deduced a trap composed of 8 places in 229 ms of which 3 ms to minimize.
[2022-06-03 15:12:10] [INFO ] Deduced a trap composed of 7 places in 232 ms of which 1 ms to minimize.
[2022-06-03 15:12:10] [INFO ] Deduced a trap composed of 6 places in 227 ms of which 1 ms to minimize.
[2022-06-03 15:12:11] [INFO ] Deduced a trap composed of 8 places in 225 ms of which 0 ms to minimize.
[2022-06-03 15:12:11] [INFO ] Deduced a trap composed of 7 places in 228 ms of which 1 ms to minimize.
[2022-06-03 15:12:11] [INFO ] Deduced a trap composed of 9 places in 223 ms of which 1 ms to minimize.
[2022-06-03 15:12:12] [INFO ] Deduced a trap composed of 8 places in 215 ms of which 0 ms to minimize.
[2022-06-03 15:12:12] [INFO ] Deduced a trap composed of 6 places in 215 ms of which 0 ms to minimize.
[2022-06-03 15:12:12] [INFO ] Deduced a trap composed of 14 places in 215 ms of which 0 ms to minimize.
[2022-06-03 15:12:13] [INFO ] Deduced a trap composed of 7 places in 214 ms of which 0 ms to minimize.
[2022-06-03 15:12:13] [INFO ] Deduced a trap composed of 19 places in 215 ms of which 1 ms to minimize.
[2022-06-03 15:12:13] [INFO ] Deduced a trap composed of 10 places in 212 ms of which 1 ms to minimize.
[2022-06-03 15:12:13] [INFO ] Deduced a trap composed of 6 places in 202 ms of which 1 ms to minimize.
[2022-06-03 15:12:14] [INFO ] Deduced a trap composed of 8 places in 202 ms of which 0 ms to minimize.
[2022-06-03 15:12:14] [INFO ] Deduced a trap composed of 8 places in 208 ms of which 1 ms to minimize.
[2022-06-03 15:12:14] [INFO ] Deduced a trap composed of 18 places in 193 ms of which 1 ms to minimize.
[2022-06-03 15:12:15] [INFO ] Deduced a trap composed of 19 places in 182 ms of which 0 ms to minimize.
[2022-06-03 15:12:15] [INFO ] Deduced a trap composed of 19 places in 179 ms of which 0 ms to minimize.
[2022-06-03 15:12:15] [INFO ] Deduced a trap composed of 10 places in 177 ms of which 1 ms to minimize.
[2022-06-03 15:12:15] [INFO ] Deduced a trap composed of 6 places in 169 ms of which 0 ms to minimize.
[2022-06-03 15:12:16] [INFO ] Deduced a trap composed of 9 places in 169 ms of which 0 ms to minimize.
[2022-06-03 15:12:16] [INFO ] Deduced a trap composed of 13 places in 156 ms of which 1 ms to minimize.
[2022-06-03 15:12:16] [INFO ] Deduced a trap composed of 6 places in 163 ms of which 0 ms to minimize.
[2022-06-03 15:12:17] [INFO ] Deduced a trap composed of 9 places in 183 ms of which 1 ms to minimize.
[2022-06-03 15:12:17] [INFO ] Deduced a trap composed of 13 places in 160 ms of which 0 ms to minimize.
[2022-06-03 15:12:17] [INFO ] Deduced a trap composed of 6 places in 156 ms of which 0 ms to minimize.
[2022-06-03 15:12:17] [INFO ] Deduced a trap composed of 16 places in 164 ms of which 1 ms to minimize.
[2022-06-03 15:12:18] [INFO ] Deduced a trap composed of 10 places in 170 ms of which 0 ms to minimize.
[2022-06-03 15:12:18] [INFO ] Deduced a trap composed of 20 places in 153 ms of which 0 ms to minimize.
[2022-06-03 15:12:18] [INFO ] Deduced a trap composed of 10 places in 153 ms of which 1 ms to minimize.
[2022-06-03 15:12:18] [INFO ] Trap strengthening (SAT) tested/added 53/52 trap constraints in 17368 ms
[2022-06-03 15:12:18] [INFO ] After 38006ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 978 ms.
[2022-06-03 15:12:19] [INFO ] After 39536ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 10955 ms.
Support contains 98 out of 2591 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2591/2591 places, 2492/2492 transitions.
Applied a total of 0 rules in 102 ms. Remains 2591 /2591 variables (removed 0) and now considering 2492/2492 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 2591/2591 places, 2492/2492 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 2591/2591 places, 2492/2492 transitions.
Applied a total of 0 rules in 105 ms. Remains 2591 /2591 variables (removed 0) and now considering 2492/2492 (removed 0) transitions.
// Phase 1: matrix 2492 rows 2591 cols
[2022-06-03 15:12:30] [INFO ] Computed 900 place invariants in 18 ms
[2022-06-03 15:12:32] [INFO ] Implicit Places using invariants in 1733 ms returned []
// Phase 1: matrix 2492 rows 2591 cols
[2022-06-03 15:12:32] [INFO ] Computed 900 place invariants in 18 ms
[2022-06-03 15:12:36] [INFO ] Implicit Places using invariants and state equation in 4027 ms returned []
Implicit Place search using SMT with State Equation took 5765 ms to find 0 implicit places.
[2022-06-03 15:12:36] [INFO ] Redundant transitions in 221 ms returned []
// Phase 1: matrix 2492 rows 2591 cols
[2022-06-03 15:12:36] [INFO ] Computed 900 place invariants in 22 ms
[2022-06-03 15:12:38] [INFO ] Dead Transitions using invariants and state equation in 1558 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2591/2591 places, 2492/2492 transitions.
Applied a total of 0 rules in 101 ms. Remains 2591 /2591 variables (removed 0) and now considering 2492/2492 (removed 0) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 2492 rows 2591 cols
[2022-06-03 15:12:38] [INFO ] Computed 900 place invariants in 19 ms
[2022-06-03 15:12:38] [INFO ] After 300ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-06-03 15:12:39] [INFO ] [Nat]Absence check using 886 positive place invariants in 164 ms returned sat
[2022-06-03 15:12:39] [INFO ] [Nat]Absence check using 886 positive and 14 generalized place invariants in 16 ms returned sat
[2022-06-03 15:12:42] [INFO ] After 2651ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-06-03 15:12:44] [INFO ] Deduced a trap composed of 3 places in 228 ms of which 0 ms to minimize.
[2022-06-03 15:12:44] [INFO ] Deduced a trap composed of 5 places in 228 ms of which 0 ms to minimize.
[2022-06-03 15:12:45] [INFO ] Deduced a trap composed of 5 places in 262 ms of which 1 ms to minimize.
[2022-06-03 15:12:45] [INFO ] Deduced a trap composed of 11 places in 270 ms of which 1 ms to minimize.
[2022-06-03 15:12:46] [INFO ] Deduced a trap composed of 7 places in 263 ms of which 1 ms to minimize.
[2022-06-03 15:12:46] [INFO ] Deduced a trap composed of 6 places in 258 ms of which 1 ms to minimize.
[2022-06-03 15:12:47] [INFO ] Deduced a trap composed of 6 places in 261 ms of which 1 ms to minimize.
[2022-06-03 15:12:47] [INFO ] Deduced a trap composed of 6 places in 253 ms of which 1 ms to minimize.
[2022-06-03 15:12:47] [INFO ] Deduced a trap composed of 16 places in 255 ms of which 1 ms to minimize.
[2022-06-03 15:12:48] [INFO ] Deduced a trap composed of 11 places in 245 ms of which 1 ms to minimize.
[2022-06-03 15:12:48] [INFO ] Deduced a trap composed of 6 places in 242 ms of which 0 ms to minimize.
[2022-06-03 15:12:49] [INFO ] Deduced a trap composed of 5 places in 249 ms of which 0 ms to minimize.
[2022-06-03 15:12:49] [INFO ] Deduced a trap composed of 9 places in 242 ms of which 0 ms to minimize.
[2022-06-03 15:12:50] [INFO ] Deduced a trap composed of 9 places in 246 ms of which 1 ms to minimize.
[2022-06-03 15:12:50] [INFO ] Deduced a trap composed of 12 places in 242 ms of which 4 ms to minimize.
[2022-06-03 15:12:51] [INFO ] Deduced a trap composed of 9 places in 236 ms of which 1 ms to minimize.
[2022-06-03 15:12:51] [INFO ] Deduced a trap composed of 8 places in 245 ms of which 1 ms to minimize.
[2022-06-03 15:12:51] [INFO ] Deduced a trap composed of 18 places in 237 ms of which 0 ms to minimize.
[2022-06-03 15:12:52] [INFO ] Deduced a trap composed of 15 places in 232 ms of which 1 ms to minimize.
[2022-06-03 15:12:52] [INFO ] Deduced a trap composed of 12 places in 236 ms of which 0 ms to minimize.
[2022-06-03 15:12:53] [INFO ] Deduced a trap composed of 9 places in 227 ms of which 0 ms to minimize.
[2022-06-03 15:12:53] [INFO ] Deduced a trap composed of 10 places in 227 ms of which 1 ms to minimize.
[2022-06-03 15:12:53] [INFO ] Deduced a trap composed of 9 places in 222 ms of which 1 ms to minimize.
[2022-06-03 15:12:54] [INFO ] Deduced a trap composed of 5 places in 225 ms of which 1 ms to minimize.
[2022-06-03 15:12:54] [INFO ] Deduced a trap composed of 10 places in 231 ms of which 1 ms to minimize.
[2022-06-03 15:12:55] [INFO ] Deduced a trap composed of 17 places in 220 ms of which 1 ms to minimize.
[2022-06-03 15:12:55] [INFO ] Deduced a trap composed of 9 places in 226 ms of which 0 ms to minimize.
[2022-06-03 15:12:56] [INFO ] Deduced a trap composed of 17 places in 201 ms of which 1 ms to minimize.
[2022-06-03 15:12:56] [INFO ] Deduced a trap composed of 11 places in 200 ms of which 1 ms to minimize.
[2022-06-03 15:12:56] [INFO ] Deduced a trap composed of 14 places in 203 ms of which 1 ms to minimize.
[2022-06-03 15:12:57] [INFO ] Deduced a trap composed of 7 places in 184 ms of which 1 ms to minimize.
[2022-06-03 15:12:57] [INFO ] Deduced a trap composed of 7 places in 182 ms of which 1 ms to minimize.
[2022-06-03 15:12:57] [INFO ] Deduced a trap composed of 10 places in 166 ms of which 1 ms to minimize.
[2022-06-03 15:12:58] [INFO ] Deduced a trap composed of 10 places in 159 ms of which 0 ms to minimize.
[2022-06-03 15:12:58] [INFO ] Deduced a trap composed of 20 places in 192 ms of which 1 ms to minimize.
[2022-06-03 15:12:58] [INFO ] Deduced a trap composed of 8 places in 127 ms of which 0 ms to minimize.
[2022-06-03 15:12:59] [INFO ] Deduced a trap composed of 14 places in 108 ms of which 0 ms to minimize.
[2022-06-03 15:12:59] [INFO ] Deduced a trap composed of 11 places in 154 ms of which 0 ms to minimize.
[2022-06-03 15:12:59] [INFO ] Trap strengthening (SAT) tested/added 39/38 trap constraints in 15937 ms
[2022-06-03 15:13:00] [INFO ] Deduced a trap composed of 5 places in 317 ms of which 1 ms to minimize.
[2022-06-03 15:13:00] [INFO ] Deduced a trap composed of 10 places in 321 ms of which 0 ms to minimize.
[2022-06-03 15:13:01] [INFO ] Deduced a trap composed of 8 places in 317 ms of which 0 ms to minimize.
[2022-06-03 15:13:01] [INFO ] Deduced a trap composed of 5 places in 310 ms of which 1 ms to minimize.
[2022-06-03 15:13:02] [INFO ] Deduced a trap composed of 5 places in 304 ms of which 0 ms to minimize.
[2022-06-03 15:13:02] [INFO ] Deduced a trap composed of 5 places in 305 ms of which 0 ms to minimize.
[2022-06-03 15:13:02] [INFO ] Deduced a trap composed of 8 places in 305 ms of which 1 ms to minimize.
[2022-06-03 15:13:03] [INFO ] Deduced a trap composed of 8 places in 300 ms of which 1 ms to minimize.
[2022-06-03 15:13:03] [INFO ] Deduced a trap composed of 8 places in 297 ms of which 0 ms to minimize.
[2022-06-03 15:13:04] [INFO ] Deduced a trap composed of 8 places in 288 ms of which 1 ms to minimize.
[2022-06-03 15:13:04] [INFO ] Deduced a trap composed of 5 places in 279 ms of which 1 ms to minimize.
[2022-06-03 15:13:04] [INFO ] Deduced a trap composed of 6 places in 282 ms of which 1 ms to minimize.
[2022-06-03 15:13:05] [INFO ] Deduced a trap composed of 6 places in 276 ms of which 1 ms to minimize.
[2022-06-03 15:13:05] [INFO ] Deduced a trap composed of 17 places in 269 ms of which 1 ms to minimize.
[2022-06-03 15:13:06] [INFO ] Deduced a trap composed of 6 places in 269 ms of which 0 ms to minimize.
[2022-06-03 15:13:06] [INFO ] Deduced a trap composed of 8 places in 265 ms of which 1 ms to minimize.
[2022-06-03 15:13:06] [INFO ] Deduced a trap composed of 8 places in 259 ms of which 1 ms to minimize.
[2022-06-03 15:13:07] [INFO ] Deduced a trap composed of 7 places in 249 ms of which 1 ms to minimize.
[2022-06-03 15:13:07] [INFO ] Deduced a trap composed of 10 places in 247 ms of which 1 ms to minimize.
[2022-06-03 15:13:07] [INFO ] Deduced a trap composed of 5 places in 235 ms of which 1 ms to minimize.
[2022-06-03 15:13:08] [INFO ] Deduced a trap composed of 7 places in 234 ms of which 1 ms to minimize.
[2022-06-03 15:13:08] [INFO ] Deduced a trap composed of 6 places in 229 ms of which 1 ms to minimize.
[2022-06-03 15:13:08] [INFO ] Deduced a trap composed of 8 places in 231 ms of which 1 ms to minimize.
[2022-06-03 15:13:09] [INFO ] Deduced a trap composed of 7 places in 228 ms of which 0 ms to minimize.
[2022-06-03 15:13:09] [INFO ] Deduced a trap composed of 6 places in 221 ms of which 0 ms to minimize.
[2022-06-03 15:13:09] [INFO ] Deduced a trap composed of 8 places in 225 ms of which 0 ms to minimize.
[2022-06-03 15:13:10] [INFO ] Deduced a trap composed of 7 places in 224 ms of which 1 ms to minimize.
[2022-06-03 15:13:10] [INFO ] Deduced a trap composed of 9 places in 223 ms of which 1 ms to minimize.
[2022-06-03 15:13:10] [INFO ] Deduced a trap composed of 8 places in 220 ms of which 0 ms to minimize.
[2022-06-03 15:13:11] [INFO ] Deduced a trap composed of 6 places in 219 ms of which 0 ms to minimize.
[2022-06-03 15:13:11] [INFO ] Deduced a trap composed of 14 places in 218 ms of which 1 ms to minimize.
[2022-06-03 15:13:11] [INFO ] Deduced a trap composed of 7 places in 213 ms of which 1 ms to minimize.
[2022-06-03 15:13:12] [INFO ] Deduced a trap composed of 19 places in 212 ms of which 0 ms to minimize.
[2022-06-03 15:13:12] [INFO ] Deduced a trap composed of 10 places in 210 ms of which 1 ms to minimize.
[2022-06-03 15:13:12] [INFO ] Deduced a trap composed of 6 places in 203 ms of which 0 ms to minimize.
[2022-06-03 15:13:13] [INFO ] Deduced a trap composed of 8 places in 219 ms of which 1 ms to minimize.
[2022-06-03 15:13:13] [INFO ] Deduced a trap composed of 8 places in 201 ms of which 0 ms to minimize.
[2022-06-03 15:13:13] [INFO ] Deduced a trap composed of 18 places in 198 ms of which 1 ms to minimize.
[2022-06-03 15:13:13] [INFO ] Deduced a trap composed of 19 places in 180 ms of which 0 ms to minimize.
[2022-06-03 15:13:14] [INFO ] Deduced a trap composed of 19 places in 173 ms of which 1 ms to minimize.
[2022-06-03 15:13:14] [INFO ] Deduced a trap composed of 10 places in 176 ms of which 0 ms to minimize.
[2022-06-03 15:13:14] [INFO ] Deduced a trap composed of 6 places in 167 ms of which 0 ms to minimize.
[2022-06-03 15:13:14] [INFO ] Deduced a trap composed of 9 places in 171 ms of which 1 ms to minimize.
[2022-06-03 15:13:15] [INFO ] Deduced a trap composed of 13 places in 162 ms of which 1 ms to minimize.
[2022-06-03 15:13:15] [INFO ] Deduced a trap composed of 6 places in 180 ms of which 4 ms to minimize.
[2022-06-03 15:13:15] [INFO ] Deduced a trap composed of 9 places in 164 ms of which 1 ms to minimize.
[2022-06-03 15:13:16] [INFO ] Deduced a trap composed of 13 places in 160 ms of which 1 ms to minimize.
[2022-06-03 15:13:16] [INFO ] Deduced a trap composed of 6 places in 165 ms of which 1 ms to minimize.
[2022-06-03 15:13:16] [INFO ] Deduced a trap composed of 16 places in 158 ms of which 0 ms to minimize.
[2022-06-03 15:13:16] [INFO ] Deduced a trap composed of 10 places in 171 ms of which 1 ms to minimize.
[2022-06-03 15:13:17] [INFO ] Deduced a trap composed of 20 places in 158 ms of which 0 ms to minimize.
[2022-06-03 15:13:17] [INFO ] Deduced a trap composed of 10 places in 153 ms of which 1 ms to minimize.
[2022-06-03 15:13:17] [INFO ] Trap strengthening (SAT) tested/added 53/52 trap constraints in 17379 ms
[2022-06-03 15:13:17] [INFO ] After 38058ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 975 ms.
[2022-06-03 15:13:18] [INFO ] After 39609ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2022-06-03 15:13:19] [INFO ] Flatten gal took : 347 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin15303860358322212590
[2022-06-03 15:13:19] [INFO ] Too many transitions (2492) to apply POR reductions. Disabling POR matrices.
[2022-06-03 15:13:19] [INFO ] Applying decomposition
[2022-06-03 15:13:19] [INFO ] Built C files in 241ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15303860358322212590
Running compilation step : cd /tmp/ltsmin15303860358322212590;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '360' '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'
[2022-06-03 15:13:19] [INFO ] Flatten gal took : 254 ms
[2022-06-03 15:13:19] [INFO ] Flatten gal took : 463 ms
Compilation finished in 7154 ms.
Running link step : cd /tmp/ltsmin15303860358322212590;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 57 ms.
Running LTSmin : cd /tmp/ltsmin15303860358322212590;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'ShieldIIPsPT100BReachabilityFireability08==true'
WARNING : LTSmin timed out (>1800 s) on command cd /tmp/ltsmin15303860358322212590;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'ShieldIIPsPT100BReachabilityFireability08==true'
Running LTSmin : cd /tmp/ltsmin15303860358322212590;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'ShieldIIPsPT100BReachabilityFireability13==true'

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldIIPs-PT-100B"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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