Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2022-input.r016-tajo-165245743600307.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2022-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
....................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is AutoFlight-PT-24b, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r016-tajo-165245743600307
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 792K
-rw-r--r-- 1 mcc users 8.0K Apr 30 01:42 CTLCardinality.txt
-rw-r--r-- 1 mcc users 89K Apr 30 01:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Apr 30 01:41 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K Apr 30 01:41 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.7K May 9 07:05 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 9 07:05 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 9 07:05 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 07:05 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 07:05 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 07:05 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 4 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 538K May 10 09:33 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 1652772925732

Running Version 202205111006
[2022-05-17 07:35:27] [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 07:35:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-17 07:35:27] [INFO ] Load time of PNML (sax parser for PT used): 159 ms
[2022-05-17 07:35:27] [INFO ] Transformed 2230 places.
[2022-05-17 07:35:27] [INFO ] Transformed 2228 transitions.
[2022-05-17 07:35:27] [INFO ] Found NUPN structural information;
[2022-05-17 07:35:27] [INFO ] Parsed PT model containing 2230 places and 2228 transitions in 298 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 2230/2230 places, 2228/2228 transitions.
Drop transitions removed 892 transitions
Trivial Post-agglo rules discarded 892 transitions
Performed 892 trivial Post agglomeration. Transition count delta: 892
Iterating post reduction 0 with 892 rules applied. Total rules applied 892 place count 2230 transition count 1336
Reduce places removed 892 places and 0 transitions.
Ensure Unique test removed 120 transitions
Reduce isomorphic transitions removed 120 transitions.
Drop transitions removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 1 with 1060 rules applied. Total rules applied 1952 place count 1338 transition count 1168
Reduce places removed 48 places and 0 transitions.
Iterating post reduction 2 with 48 rules applied. Total rules applied 2000 place count 1290 transition count 1168
Performed 295 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 295 Pre rules applied. Total rules applied 2000 place count 1290 transition count 873
Deduced a syphon composed of 295 places in 26 ms
Reduce places removed 295 places and 0 transitions.
Iterating global reduction 3 with 590 rules applied. Total rules applied 2590 place count 995 transition count 873
Discarding 242 places :
Symmetric choice reduction at 3 with 242 rule applications. Total rules 2832 place count 753 transition count 631
Iterating global reduction 3 with 242 rules applied. Total rules applied 3074 place count 753 transition count 631
Performed 72 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 72 Pre rules applied. Total rules applied 3074 place count 753 transition count 559
Deduced a syphon composed of 72 places in 2 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 3 with 144 rules applied. Total rules applied 3218 place count 681 transition count 559
Performed 170 Post agglomeration using F-continuation condition.Transition count delta: 170
Deduced a syphon composed of 170 places in 0 ms
Reduce places removed 170 places and 0 transitions.
Iterating global reduction 3 with 340 rules applied. Total rules applied 3558 place count 511 transition count 389
Applied a total of 3558 rules in 386 ms. Remains 511 /2230 variables (removed 1719) and now considering 389/2228 (removed 1839) transitions.
// Phase 1: matrix 389 rows 511 cols
[2022-05-17 07:35:27] [INFO ] Computed 148 place invariants in 24 ms
[2022-05-17 07:35:28] [INFO ] Implicit Places using invariants in 640 ms returned [169, 170, 171, 172, 173, 174, 175, 176, 177, 178, 179, 180, 181, 182, 183, 184, 185, 186, 187, 188, 189, 190, 191, 192, 193, 194, 195, 196, 197, 198, 199, 200, 201, 202, 203, 204, 205, 206, 207, 208, 209, 210, 211, 212, 213, 214, 215, 216, 217, 291, 365, 371, 377, 383, 389, 395, 401, 407, 413, 419, 425, 431, 437, 443, 449, 455, 461, 467, 473, 479, 485, 491, 497, 503, 510]
Discarding 75 places :
Implicit Place search using SMT only with invariants took 670 ms to find 75 implicit places.
Starting structural reductions in LIVENESS mode, iteration 1 : 436/2230 places, 389/2228 transitions.
Drop transitions removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 0 with 48 rules applied. Total rules applied 48 place count 436 transition count 341
Reduce places removed 48 places and 0 transitions.
Iterating post reduction 1 with 48 rules applied. Total rules applied 96 place count 388 transition count 341
Discarding 25 places :
Symmetric choice reduction at 2 with 25 rule applications. Total rules 121 place count 363 transition count 316
Iterating global reduction 2 with 25 rules applied. Total rules applied 146 place count 363 transition count 316
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 147 place count 362 transition count 315
Iterating global reduction 2 with 1 rules applied. Total rules applied 148 place count 362 transition count 315
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 149 place count 361 transition count 314
Iterating global reduction 2 with 1 rules applied. Total rules applied 150 place count 361 transition count 314
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 151 place count 360 transition count 313
Iterating global reduction 2 with 1 rules applied. Total rules applied 152 place count 360 transition count 313
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 153 place count 359 transition count 312
Iterating global reduction 2 with 1 rules applied. Total rules applied 154 place count 359 transition count 312
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 155 place count 358 transition count 311
Iterating global reduction 2 with 1 rules applied. Total rules applied 156 place count 358 transition count 311
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 157 place count 357 transition count 310
Iterating global reduction 2 with 1 rules applied. Total rules applied 158 place count 357 transition count 310
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 159 place count 356 transition count 309
Iterating global reduction 2 with 1 rules applied. Total rules applied 160 place count 356 transition count 309
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 161 place count 355 transition count 308
Iterating global reduction 2 with 1 rules applied. Total rules applied 162 place count 355 transition count 308
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 163 place count 354 transition count 307
Iterating global reduction 2 with 1 rules applied. Total rules applied 164 place count 354 transition count 307
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 165 place count 353 transition count 306
Iterating global reduction 2 with 1 rules applied. Total rules applied 166 place count 353 transition count 306
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 167 place count 352 transition count 305
Iterating global reduction 2 with 1 rules applied. Total rules applied 168 place count 352 transition count 305
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 169 place count 351 transition count 304
Iterating global reduction 2 with 1 rules applied. Total rules applied 170 place count 351 transition count 304
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 171 place count 350 transition count 303
Iterating global reduction 2 with 1 rules applied. Total rules applied 172 place count 350 transition count 303
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 173 place count 349 transition count 302
Iterating global reduction 2 with 1 rules applied. Total rules applied 174 place count 349 transition count 302
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 175 place count 348 transition count 301
Iterating global reduction 2 with 1 rules applied. Total rules applied 176 place count 348 transition count 301
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 177 place count 347 transition count 300
Iterating global reduction 2 with 1 rules applied. Total rules applied 178 place count 347 transition count 300
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 179 place count 346 transition count 299
Iterating global reduction 2 with 1 rules applied. Total rules applied 180 place count 346 transition count 299
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 181 place count 345 transition count 298
Iterating global reduction 2 with 1 rules applied. Total rules applied 182 place count 345 transition count 298
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 183 place count 344 transition count 297
Iterating global reduction 2 with 1 rules applied. Total rules applied 184 place count 344 transition count 297
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 185 place count 343 transition count 296
Iterating global reduction 2 with 1 rules applied. Total rules applied 186 place count 343 transition count 296
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 187 place count 342 transition count 295
Iterating global reduction 2 with 1 rules applied. Total rules applied 188 place count 342 transition count 295
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 189 place count 341 transition count 294
Iterating global reduction 2 with 1 rules applied. Total rules applied 190 place count 341 transition count 294
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 191 place count 340 transition count 293
Iterating global reduction 2 with 1 rules applied. Total rules applied 192 place count 340 transition count 293
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 193 place count 339 transition count 292
Iterating global reduction 2 with 1 rules applied. Total rules applied 194 place count 339 transition count 292
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 196 place count 338 transition count 291
Applied a total of 196 rules in 220 ms. Remains 338 /436 variables (removed 98) and now considering 291/389 (removed 98) transitions.
// Phase 1: matrix 291 rows 338 cols
[2022-05-17 07:35:28] [INFO ] Computed 73 place invariants in 2 ms
[2022-05-17 07:35:28] [INFO ] Implicit Places using invariants in 156 ms returned []
// Phase 1: matrix 291 rows 338 cols
[2022-05-17 07:35:28] [INFO ] Computed 73 place invariants in 9 ms
[2022-05-17 07:35:28] [INFO ] State equation strengthened by 72 read => feed constraints.
[2022-05-17 07:35:29] [INFO ] Implicit Places using invariants and state equation in 441 ms returned []
Implicit Place search using SMT with State Equation took 602 ms to find 0 implicit places.
Starting structural reductions in LIVENESS mode, iteration 2 : 338/2230 places, 291/2228 transitions.
Finished structural reductions, in 2 iterations. Remains : 338/2230 places, 291/2228 transitions.
Discarding 121 transitions out of 291. Remains 170
Initial state reduction rules removed 1 formulas.
Incomplete random walk after 10000 steps, including 125 resets, run finished after 679 ms. (steps per millisecond=14 ) properties (out of 169) seen :97
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 72) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 72) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 72) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 72) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 72) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 72) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 72) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 72) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 72) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 72) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 72) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 72) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 72) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 72) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 72) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 72) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 72) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 72) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 72) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 72) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 72) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 72) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 72) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 72) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 72) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 72) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 72) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 72) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 72) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 72) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 72) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 72) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 72) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 72) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 72) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 72) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 72) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 72) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 72) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 72) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 72) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 72) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 72) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 72) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 72) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 72) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 72) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 72) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 72) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 72) seen :0
Running SMT prover for 72 properties.
// Phase 1: matrix 291 rows 338 cols
[2022-05-17 07:35:30] [INFO ] Computed 73 place invariants in 5 ms
[2022-05-17 07:35:30] [INFO ] [Real]Absence check using 73 positive place invariants in 9 ms returned sat
[2022-05-17 07:35:31] [INFO ] After 1694ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:72
[2022-05-17 07:35:32] [INFO ] [Nat]Absence check using 73 positive place invariants in 17 ms returned sat
[2022-05-17 07:35:33] [INFO ] After 914ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :72
[2022-05-17 07:35:33] [INFO ] State equation strengthened by 72 read => feed constraints.
[2022-05-17 07:35:34] [INFO ] After 1250ms SMT Verify possible using 72 Read/Feed constraints in natural domain returned unsat :0 sat :72
[2022-05-17 07:35:36] [INFO ] After 3561ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :72
Attempting to minimize the solution found.
Minimization took 1414 ms.
[2022-05-17 07:35:38] [INFO ] After 6574ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :72
Parikh walk visited 32 properties in 8514 ms.
Support contains 80 out of 338 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 338/338 places, 291/291 transitions.
Free-agglomeration rule applied 74 times.
Iterating global reduction 0 with 74 rules applied. Total rules applied 74 place count 338 transition count 217
Reduce places removed 74 places and 0 transitions.
Iterating post reduction 0 with 74 rules applied. Total rules applied 148 place count 264 transition count 217
Applied a total of 148 rules in 40 ms. Remains 264 /338 variables (removed 74) and now considering 217/291 (removed 74) transitions.
Finished structural reductions, in 1 iterations. Remains : 264/338 places, 217/291 transitions.
Interrupted random walk after 808764 steps, including 10657 resets, run timeout after 30001 ms. (steps per millisecond=26 ) properties seen 4
Incomplete Best-First random walk after 100001 steps, including 82 resets, run finished after 378 ms. (steps per millisecond=264 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 100001 steps, including 83 resets, run finished after 388 ms. (steps per millisecond=257 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 100001 steps, including 80 resets, run finished after 389 ms. (steps per millisecond=257 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 100001 steps, including 85 resets, run finished after 375 ms. (steps per millisecond=266 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 100001 steps, including 81 resets, run finished after 372 ms. (steps per millisecond=268 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 100001 steps, including 82 resets, run finished after 367 ms. (steps per millisecond=272 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 100001 steps, including 83 resets, run finished after 388 ms. (steps per millisecond=257 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 100001 steps, including 78 resets, run finished after 390 ms. (steps per millisecond=256 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 100001 steps, including 82 resets, run finished after 385 ms. (steps per millisecond=259 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 100001 steps, including 83 resets, run finished after 369 ms. (steps per millisecond=271 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 100001 steps, including 81 resets, run finished after 396 ms. (steps per millisecond=252 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 100001 steps, including 81 resets, run finished after 403 ms. (steps per millisecond=248 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 100001 steps, including 76 resets, run finished after 333 ms. (steps per millisecond=300 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 100001 steps, including 71 resets, run finished after 327 ms. (steps per millisecond=305 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 100000 steps, including 73 resets, run finished after 324 ms. (steps per millisecond=308 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 100001 steps, including 78 resets, run finished after 320 ms. (steps per millisecond=312 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 100001 steps, including 71 resets, run finished after 326 ms. (steps per millisecond=306 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 100001 steps, including 83 resets, run finished after 325 ms. (steps per millisecond=307 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 100001 steps, including 76 resets, run finished after 408 ms. (steps per millisecond=245 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 100001 steps, including 79 resets, run finished after 409 ms. (steps per millisecond=244 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 100001 steps, including 74 resets, run finished after 396 ms. (steps per millisecond=252 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 100001 steps, including 77 resets, run finished after 348 ms. (steps per millisecond=287 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 100001 steps, including 73 resets, run finished after 428 ms. (steps per millisecond=233 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 100001 steps, including 80 resets, run finished after 332 ms. (steps per millisecond=301 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 100001 steps, including 74 resets, run finished after 322 ms. (steps per millisecond=310 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 100001 steps, including 80 resets, run finished after 321 ms. (steps per millisecond=311 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 100001 steps, including 77 resets, run finished after 316 ms. (steps per millisecond=316 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 100001 steps, including 77 resets, run finished after 308 ms. (steps per millisecond=324 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 100001 steps, including 75 resets, run finished after 302 ms. (steps per millisecond=331 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 100001 steps, including 76 resets, run finished after 309 ms. (steps per millisecond=323 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 100001 steps, including 76 resets, run finished after 311 ms. (steps per millisecond=321 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 100001 steps, including 74 resets, run finished after 310 ms. (steps per millisecond=322 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 100001 steps, including 77 resets, run finished after 311 ms. (steps per millisecond=321 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 100001 steps, including 72 resets, run finished after 305 ms. (steps per millisecond=327 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 100001 steps, including 77 resets, run finished after 306 ms. (steps per millisecond=326 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 100001 steps, including 76 resets, run finished after 294 ms. (steps per millisecond=340 ) properties (out of 36) seen :0
Running SMT prover for 36 properties.
// Phase 1: matrix 217 rows 264 cols
[2022-05-17 07:36:29] [INFO ] Computed 73 place invariants in 1 ms
[2022-05-17 07:36:29] [INFO ] [Real]Absence check using 73 positive place invariants in 10 ms returned sat
[2022-05-17 07:36:30] [INFO ] After 654ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:36
[2022-05-17 07:36:30] [INFO ] [Nat]Absence check using 73 positive place invariants in 10 ms returned sat
[2022-05-17 07:36:30] [INFO ] After 375ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :36
[2022-05-17 07:36:30] [INFO ] State equation strengthened by 120 read => feed constraints.
[2022-05-17 07:36:31] [INFO ] After 639ms SMT Verify possible using 120 Read/Feed constraints in natural domain returned unsat :0 sat :36
[2022-05-17 07:36:32] [INFO ] After 1379ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :36
Attempting to minimize the solution found.
Minimization took 419 ms.
[2022-05-17 07:36:32] [INFO ] After 2460ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :36
Parikh walk visited 12 properties in 1927 ms.
Support contains 48 out of 264 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 264/264 places, 217/217 transitions.
Applied a total of 0 rules in 19 ms. Remains 264 /264 variables (removed 0) and now considering 217/217 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 264/264 places, 217/217 transitions.
Interrupted random walk after 882013 steps, including 11569 resets, run timeout after 30001 ms. (steps per millisecond=29 ) properties seen 0
Incomplete Best-First random walk after 100001 steps, including 77 resets, run finished after 290 ms. (steps per millisecond=344 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 100001 steps, including 78 resets, run finished after 284 ms. (steps per millisecond=352 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 100001 steps, including 70 resets, run finished after 287 ms. (steps per millisecond=348 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 100001 steps, including 73 resets, run finished after 286 ms. (steps per millisecond=349 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 100001 steps, including 77 resets, run finished after 282 ms. (steps per millisecond=354 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 100001 steps, including 69 resets, run finished after 294 ms. (steps per millisecond=340 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 100001 steps, including 79 resets, run finished after 290 ms. (steps per millisecond=344 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 100001 steps, including 72 resets, run finished after 288 ms. (steps per millisecond=347 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 100001 steps, including 72 resets, run finished after 288 ms. (steps per millisecond=347 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 100001 steps, including 74 resets, run finished after 282 ms. (steps per millisecond=354 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 100001 steps, including 74 resets, run finished after 283 ms. (steps per millisecond=353 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 100001 steps, including 72 resets, run finished after 283 ms. (steps per millisecond=353 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 100001 steps, including 76 resets, run finished after 285 ms. (steps per millisecond=350 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 100001 steps, including 71 resets, run finished after 280 ms. (steps per millisecond=357 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 100001 steps, including 79 resets, run finished after 286 ms. (steps per millisecond=349 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 100001 steps, including 78 resets, run finished after 292 ms. (steps per millisecond=342 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 100001 steps, including 75 resets, run finished after 300 ms. (steps per millisecond=333 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 100001 steps, including 74 resets, run finished after 303 ms. (steps per millisecond=330 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 100001 steps, including 73 resets, run finished after 307 ms. (steps per millisecond=325 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 100001 steps, including 78 resets, run finished after 307 ms. (steps per millisecond=325 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 100001 steps, including 74 resets, run finished after 314 ms. (steps per millisecond=318 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 100001 steps, including 72 resets, run finished after 304 ms. (steps per millisecond=328 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 100001 steps, including 75 resets, run finished after 304 ms. (steps per millisecond=328 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 100001 steps, including 80 resets, run finished after 299 ms. (steps per millisecond=334 ) properties (out of 24) seen :0
Interrupted probabilistic random walk after 17990044 steps, run timeout after 111001 ms. (steps per millisecond=162 ) properties seen :{}
Probabilistic random walk after 17990044 steps, saw 2214091 distinct states, run finished after 111005 ms. (steps per millisecond=162 ) properties seen :0
Running SMT prover for 24 properties.
// Phase 1: matrix 217 rows 264 cols
[2022-05-17 07:39:02] [INFO ] Computed 73 place invariants in 1 ms
[2022-05-17 07:39:02] [INFO ] [Real]Absence check using 73 positive place invariants in 9 ms returned sat
[2022-05-17 07:39:03] [INFO ] After 550ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:24
[2022-05-17 07:39:03] [INFO ] [Nat]Absence check using 73 positive place invariants in 9 ms returned sat
[2022-05-17 07:39:03] [INFO ] After 305ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :24
[2022-05-17 07:39:03] [INFO ] State equation strengthened by 120 read => feed constraints.
[2022-05-17 07:39:04] [INFO ] After 350ms SMT Verify possible using 120 Read/Feed constraints in natural domain returned unsat :0 sat :24
[2022-05-17 07:39:04] [INFO ] After 886ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :24
Attempting to minimize the solution found.
Minimization took 296 ms.
[2022-05-17 07:39:04] [INFO ] After 1678ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :24
Parikh walk visited 0 properties in 2686 ms.
Support contains 48 out of 264 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 264/264 places, 217/217 transitions.
Applied a total of 0 rules in 9 ms. Remains 264 /264 variables (removed 0) and now considering 217/217 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 264/264 places, 217/217 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 264/264 places, 217/217 transitions.
Applied a total of 0 rules in 8 ms. Remains 264 /264 variables (removed 0) and now considering 217/217 (removed 0) transitions.
// Phase 1: matrix 217 rows 264 cols
[2022-05-17 07:39:07] [INFO ] Computed 73 place invariants in 1 ms
[2022-05-17 07:39:07] [INFO ] Implicit Places using invariants in 368 ms returned [1, 2, 6, 7, 11, 12, 16, 17, 21, 22, 26, 27, 31, 32, 36, 37, 41, 42, 46, 47, 51, 52, 56, 57, 61, 62, 66, 67, 71, 72, 76, 77, 81, 82, 86, 87, 91, 92, 96, 97, 101, 102, 106, 107, 111, 112, 116, 117]
Discarding 48 places :
Implicit Place search using SMT only with invariants took 372 ms to find 48 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 216/264 places, 217/217 transitions.
Graph (trivial) has 96 edges and 216 vertex of which 25 / 216 are part of one of the 1 SCC in 8 ms
Free SCC test removed 24 places
Drop transitions removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Drop transitions removed 46 transitions
Trivial Post-agglo rules discarded 46 transitions
Performed 46 trivial Post agglomeration. Transition count delta: 46
Iterating post reduction 0 with 46 rules applied. Total rules applied 47 place count 192 transition count 123
Reduce places removed 46 places and 0 transitions.
Iterating post reduction 1 with 46 rules applied. Total rules applied 93 place count 146 transition count 123
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 95 place count 145 transition count 123
Applied a total of 95 rules in 32 ms. Remains 145 /216 variables (removed 71) and now considering 123/217 (removed 94) transitions.
// Phase 1: matrix 123 rows 145 cols
[2022-05-17 07:39:07] [INFO ] Computed 25 place invariants in 0 ms
[2022-05-17 07:39:08] [INFO ] Implicit Places using invariants in 112 ms returned []
// Phase 1: matrix 123 rows 145 cols
[2022-05-17 07:39:08] [INFO ] Computed 25 place invariants in 1 ms
[2022-05-17 07:39:08] [INFO ] State equation strengthened by 25 read => feed constraints.
[2022-05-17 07:39:08] [INFO ] Implicit Places using invariants and state equation in 129 ms returned []
Implicit Place search using SMT with State Equation took 245 ms to find 0 implicit places.
Starting structural reductions in SAFETY mode, iteration 2 : 145/264 places, 123/217 transitions.
Finished structural reductions, in 2 iterations. Remains : 145/264 places, 123/217 transitions.
Interrupted random walk after 754154 steps, including 26927 resets, run timeout after 30001 ms. (steps per millisecond=25 ) properties seen 0
Incomplete Best-First random walk after 100001 steps, including 153 resets, run finished after 311 ms. (steps per millisecond=321 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 100001 steps, including 154 resets, run finished after 177 ms. (steps per millisecond=564 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 100001 steps, including 154 resets, run finished after 236 ms. (steps per millisecond=423 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 100001 steps, including 153 resets, run finished after 299 ms. (steps per millisecond=334 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 100001 steps, including 154 resets, run finished after 315 ms. (steps per millisecond=317 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 100001 steps, including 153 resets, run finished after 312 ms. (steps per millisecond=320 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 100001 steps, including 153 resets, run finished after 284 ms. (steps per millisecond=352 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 100001 steps, including 153 resets, run finished after 257 ms. (steps per millisecond=389 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 100001 steps, including 154 resets, run finished after 167 ms. (steps per millisecond=598 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 100001 steps, including 153 resets, run finished after 255 ms. (steps per millisecond=392 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 100001 steps, including 154 resets, run finished after 307 ms. (steps per millisecond=325 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 100001 steps, including 152 resets, run finished after 341 ms. (steps per millisecond=293 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 100001 steps, including 153 resets, run finished after 166 ms. (steps per millisecond=602 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 100001 steps, including 154 resets, run finished after 244 ms. (steps per millisecond=409 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 100001 steps, including 152 resets, run finished after 382 ms. (steps per millisecond=261 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 100001 steps, including 153 resets, run finished after 250 ms. (steps per millisecond=400 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 100001 steps, including 154 resets, run finished after 297 ms. (steps per millisecond=336 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 100001 steps, including 153 resets, run finished after 264 ms. (steps per millisecond=378 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 100001 steps, including 152 resets, run finished after 194 ms. (steps per millisecond=515 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 100001 steps, including 153 resets, run finished after 241 ms. (steps per millisecond=414 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 100001 steps, including 154 resets, run finished after 299 ms. (steps per millisecond=334 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 100001 steps, including 154 resets, run finished after 268 ms. (steps per millisecond=373 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 100001 steps, including 157 resets, run finished after 274 ms. (steps per millisecond=364 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 100001 steps, including 153 resets, run finished after 265 ms. (steps per millisecond=377 ) properties (out of 24) seen :0
Interrupted probabilistic random walk after 14439517 steps, run timeout after 108001 ms. (steps per millisecond=133 ) properties seen :{}
Probabilistic random walk after 14439517 steps, saw 1633506 distinct states, run finished after 108004 ms. (steps per millisecond=133 ) properties seen :0
Running SMT prover for 24 properties.
// Phase 1: matrix 123 rows 145 cols
[2022-05-17 07:41:32] [INFO ] Computed 25 place invariants in 1 ms
[2022-05-17 07:41:32] [INFO ] [Real]Absence check using 25 positive place invariants in 3 ms returned sat
[2022-05-17 07:41:33] [INFO ] After 382ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:24
[2022-05-17 07:41:33] [INFO ] [Nat]Absence check using 25 positive place invariants in 7 ms returned sat
[2022-05-17 07:41:33] [INFO ] After 194ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :24
[2022-05-17 07:41:33] [INFO ] State equation strengthened by 25 read => feed constraints.
[2022-05-17 07:41:33] [INFO ] After 201ms SMT Verify possible using 25 Read/Feed constraints in natural domain returned unsat :0 sat :24
[2022-05-17 07:41:33] [INFO ] After 489ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :24
Attempting to minimize the solution found.
Minimization took 149 ms.
[2022-05-17 07:41:33] [INFO ] After 994ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :24
Parikh walk visited 0 properties in 1819 ms.
Support contains 48 out of 145 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 145/145 places, 123/123 transitions.
Applied a total of 0 rules in 3 ms. Remains 145 /145 variables (removed 0) and now considering 123/123 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 145/145 places, 123/123 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 145/145 places, 123/123 transitions.
Applied a total of 0 rules in 3 ms. Remains 145 /145 variables (removed 0) and now considering 123/123 (removed 0) transitions.
// Phase 1: matrix 123 rows 145 cols
[2022-05-17 07:41:35] [INFO ] Computed 25 place invariants in 0 ms
[2022-05-17 07:41:35] [INFO ] Implicit Places using invariants in 109 ms returned []
// Phase 1: matrix 123 rows 145 cols
[2022-05-17 07:41:35] [INFO ] Computed 25 place invariants in 0 ms
[2022-05-17 07:41:36] [INFO ] State equation strengthened by 25 read => feed constraints.
[2022-05-17 07:41:36] [INFO ] Implicit Places using invariants and state equation in 154 ms returned []
Implicit Place search using SMT with State Equation took 265 ms to find 0 implicit places.
[2022-05-17 07:41:36] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 123 rows 145 cols
[2022-05-17 07:41:36] [INFO ] Computed 25 place invariants in 8 ms
[2022-05-17 07:41:36] [INFO ] Dead Transitions using invariants and state equation in 105 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 145/145 places, 123/123 transitions.
Incomplete random walk after 100000 steps, including 3564 resets, run finished after 3791 ms. (steps per millisecond=26 ) properties (out of 48) seen :24
Running SMT prover for 24 properties.
// Phase 1: matrix 123 rows 145 cols
[2022-05-17 07:41:40] [INFO ] Computed 25 place invariants in 0 ms
[2022-05-17 07:41:40] [INFO ] [Real]Absence check using 25 positive place invariants in 3 ms returned sat
[2022-05-17 07:41:40] [INFO ] After 108ms SMT Verify possible using state equation in real domain returned unsat :0 sat :24
[2022-05-17 07:41:40] [INFO ] State equation strengthened by 25 read => feed constraints.
[2022-05-17 07:41:40] [INFO ] After 123ms SMT Verify possible using 25 Read/Feed constraints in real domain returned unsat :0 sat :1 real:23
[2022-05-17 07:41:40] [INFO ] After 134ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:24
[2022-05-17 07:41:40] [INFO ] After 358ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:24
[2022-05-17 07:41:40] [INFO ] [Nat]Absence check using 25 positive place invariants in 3 ms returned sat
[2022-05-17 07:41:40] [INFO ] After 109ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :24
[2022-05-17 07:41:40] [INFO ] After 104ms SMT Verify possible using 25 Read/Feed constraints in natural domain returned unsat :0 sat :24
[2022-05-17 07:41:40] [INFO ] After 340ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :24
Attempting to minimize the solution found.
Minimization took 118 ms.
[2022-05-17 07:41:41] [INFO ] After 684ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :24
Interrupted random walk after 574854 steps, including 20551 resets, run timeout after 30001 ms. (steps per millisecond=19 ) properties seen 0
Incomplete Best-First random walk after 100001 steps, including 153 resets, run finished after 164 ms. (steps per millisecond=609 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 100001 steps, including 153 resets, run finished after 171 ms. (steps per millisecond=584 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 100001 steps, including 152 resets, run finished after 165 ms. (steps per millisecond=606 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 100001 steps, including 154 resets, run finished after 163 ms. (steps per millisecond=613 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 100001 steps, including 152 resets, run finished after 166 ms. (steps per millisecond=602 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 100001 steps, including 153 resets, run finished after 165 ms. (steps per millisecond=606 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 100001 steps, including 154 resets, run finished after 170 ms. (steps per millisecond=588 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 100001 steps, including 153 resets, run finished after 160 ms. (steps per millisecond=625 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 100001 steps, including 153 resets, run finished after 159 ms. (steps per millisecond=628 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 100001 steps, including 153 resets, run finished after 163 ms. (steps per millisecond=613 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 100001 steps, including 154 resets, run finished after 203 ms. (steps per millisecond=492 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 100001 steps, including 153 resets, run finished after 552 ms. (steps per millisecond=181 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 100001 steps, including 154 resets, run finished after 169 ms. (steps per millisecond=591 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 100001 steps, including 153 resets, run finished after 225 ms. (steps per millisecond=444 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 100001 steps, including 153 resets, run finished after 163 ms. (steps per millisecond=613 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 100001 steps, including 154 resets, run finished after 160 ms. (steps per millisecond=625 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 100001 steps, including 153 resets, run finished after 197 ms. (steps per millisecond=507 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 100001 steps, including 155 resets, run finished after 155 ms. (steps per millisecond=645 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 100001 steps, including 153 resets, run finished after 161 ms. (steps per millisecond=621 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 100001 steps, including 154 resets, run finished after 263 ms. (steps per millisecond=380 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 100001 steps, including 153 resets, run finished after 186 ms. (steps per millisecond=537 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 100001 steps, including 154 resets, run finished after 169 ms. (steps per millisecond=591 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 100001 steps, including 157 resets, run finished after 187 ms. (steps per millisecond=534 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 100000 steps, including 154 resets, run finished after 162 ms. (steps per millisecond=617 ) properties (out of 24) seen :0
Interrupted probabilistic random walk after 15989491 steps, run timeout after 102001 ms. (steps per millisecond=156 ) properties seen :{}
Probabilistic random walk after 15989491 steps, saw 1784130 distinct states, run finished after 102003 ms. (steps per millisecond=156 ) properties seen :0
Running SMT prover for 24 properties.
// Phase 1: matrix 123 rows 145 cols
[2022-05-17 07:43:57] [INFO ] Computed 25 place invariants in 1 ms
[2022-05-17 07:43:57] [INFO ] [Real]Absence check using 25 positive place invariants in 3 ms returned sat
[2022-05-17 07:43:57] [INFO ] After 294ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:24
[2022-05-17 07:43:58] [INFO ] [Nat]Absence check using 25 positive place invariants in 4 ms returned sat
[2022-05-17 07:43:58] [INFO ] After 151ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :24
[2022-05-17 07:43:58] [INFO ] State equation strengthened by 25 read => feed constraints.
[2022-05-17 07:43:58] [INFO ] After 159ms SMT Verify possible using 25 Read/Feed constraints in natural domain returned unsat :0 sat :24
[2022-05-17 07:43:58] [INFO ] After 362ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :24
Attempting to minimize the solution found.
Minimization took 137 ms.
[2022-05-17 07:43:58] [INFO ] After 828ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :24
Parikh walk visited 0 properties in 1247 ms.
Support contains 48 out of 145 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 145/145 places, 123/123 transitions.
Applied a total of 0 rules in 3 ms. Remains 145 /145 variables (removed 0) and now considering 123/123 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 145/145 places, 123/123 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 145/145 places, 123/123 transitions.
Applied a total of 0 rules in 3 ms. Remains 145 /145 variables (removed 0) and now considering 123/123 (removed 0) transitions.
// Phase 1: matrix 123 rows 145 cols
[2022-05-17 07:44:00] [INFO ] Computed 25 place invariants in 0 ms
[2022-05-17 07:44:00] [INFO ] Implicit Places using invariants in 408 ms returned []
// Phase 1: matrix 123 rows 145 cols
[2022-05-17 07:44:00] [INFO ] Computed 25 place invariants in 1 ms
[2022-05-17 07:44:00] [INFO ] State equation strengthened by 25 read => feed constraints.
[2022-05-17 07:44:00] [INFO ] Implicit Places using invariants and state equation in 186 ms returned []
Implicit Place search using SMT with State Equation took 608 ms to find 0 implicit places.
[2022-05-17 07:44:00] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 123 rows 145 cols
[2022-05-17 07:44:00] [INFO ] Computed 25 place invariants in 1 ms
[2022-05-17 07:44:00] [INFO ] Dead Transitions using invariants and state equation in 71 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 145/145 places, 123/123 transitions.
Incomplete random walk after 100000 steps, including 3561 resets, run finished after 3307 ms. (steps per millisecond=30 ) properties (out of 48) seen :24
Running SMT prover for 24 properties.
// Phase 1: matrix 123 rows 145 cols
[2022-05-17 07:44:04] [INFO ] Computed 25 place invariants in 1 ms
[2022-05-17 07:44:04] [INFO ] [Real]Absence check using 25 positive place invariants in 3 ms returned sat
[2022-05-17 07:44:04] [INFO ] After 106ms SMT Verify possible using state equation in real domain returned unsat :0 sat :24
[2022-05-17 07:44:04] [INFO ] State equation strengthened by 25 read => feed constraints.
[2022-05-17 07:44:04] [INFO ] After 117ms SMT Verify possible using 25 Read/Feed constraints in real domain returned unsat :0 sat :1 real:23
[2022-05-17 07:44:04] [INFO ] After 127ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:24
[2022-05-17 07:44:04] [INFO ] After 348ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:24
[2022-05-17 07:44:04] [INFO ] [Nat]Absence check using 25 positive place invariants in 3 ms returned sat
[2022-05-17 07:44:04] [INFO ] After 107ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :24
[2022-05-17 07:44:04] [INFO ] After 96ms SMT Verify possible using 25 Read/Feed constraints in natural domain returned unsat :0 sat :24
[2022-05-17 07:44:04] [INFO ] After 262ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :24
Attempting to minimize the solution found.
Minimization took 87 ms.
[2022-05-17 07:44:04] [INFO ] After 571ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :24
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Incomplete random walk after 10000 steps, including 357 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2331299 steps, run timeout after 3001 ms. (steps per millisecond=776 ) properties seen :{}
Probabilistic random walk after 2331299 steps, saw 299482 distinct states, run finished after 3001 ms. (steps per millisecond=776 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 123 rows 145 cols
[2022-05-17 07:44:08] [INFO ] Computed 25 place invariants in 2 ms
[2022-05-17 07:44:08] [INFO ] [Real]Absence check using 25 positive place invariants in 6 ms returned sat
[2022-05-17 07:44:08] [INFO ] After 51ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-05-17 07:44:08] [INFO ] State equation strengthened by 25 read => feed constraints.
[2022-05-17 07:44:08] [INFO ] After 10ms SMT Verify possible using 25 Read/Feed constraints in real domain returned unsat :0 sat :1
[2022-05-17 07:44:08] [INFO ] After 19ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 5 ms.
[2022-05-17 07:44:08] [INFO ] After 138ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 145 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 145/145 places, 123/123 transitions.
Free-agglomeration rule applied 48 times.
Iterating global reduction 0 with 48 rules applied. Total rules applied 48 place count 145 transition count 75
Reduce places removed 48 places and 0 transitions.
Iterating post reduction 0 with 48 rules applied. Total rules applied 96 place count 97 transition count 75
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 97 place count 96 transition count 74
Iterating global reduction 1 with 1 rules applied. Total rules applied 98 place count 96 transition count 74
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 99 place count 95 transition count 73
Iterating global reduction 1 with 1 rules applied. Total rules applied 100 place count 95 transition count 73
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 101 place count 94 transition count 72
Iterating global reduction 1 with 1 rules applied. Total rules applied 102 place count 94 transition count 72
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 103 place count 93 transition count 71
Iterating global reduction 1 with 1 rules applied. Total rules applied 104 place count 93 transition count 71
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 105 place count 92 transition count 70
Iterating global reduction 1 with 1 rules applied. Total rules applied 106 place count 92 transition count 70
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 107 place count 91 transition count 69
Iterating global reduction 1 with 1 rules applied. Total rules applied 108 place count 91 transition count 69
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 109 place count 90 transition count 68
Iterating global reduction 1 with 1 rules applied. Total rules applied 110 place count 90 transition count 68
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 111 place count 89 transition count 67
Iterating global reduction 1 with 1 rules applied. Total rules applied 112 place count 89 transition count 67
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 113 place count 88 transition count 66
Iterating global reduction 1 with 1 rules applied. Total rules applied 114 place count 88 transition count 66
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 115 place count 87 transition count 65
Iterating global reduction 1 with 1 rules applied. Total rules applied 116 place count 87 transition count 65
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 117 place count 86 transition count 64
Iterating global reduction 1 with 1 rules applied. Total rules applied 118 place count 86 transition count 64
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 119 place count 85 transition count 63
Iterating global reduction 1 with 1 rules applied. Total rules applied 120 place count 85 transition count 63
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 121 place count 84 transition count 62
Iterating global reduction 1 with 1 rules applied. Total rules applied 122 place count 84 transition count 62
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 123 place count 83 transition count 61
Iterating global reduction 1 with 1 rules applied. Total rules applied 124 place count 83 transition count 61
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 125 place count 82 transition count 60
Iterating global reduction 1 with 1 rules applied. Total rules applied 126 place count 82 transition count 60
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 127 place count 81 transition count 59
Iterating global reduction 1 with 1 rules applied. Total rules applied 128 place count 81 transition count 59
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 129 place count 80 transition count 58
Iterating global reduction 1 with 1 rules applied. Total rules applied 130 place count 80 transition count 58
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 131 place count 79 transition count 57
Iterating global reduction 1 with 1 rules applied. Total rules applied 132 place count 79 transition count 57
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 133 place count 78 transition count 56
Iterating global reduction 1 with 1 rules applied. Total rules applied 134 place count 78 transition count 56
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 135 place count 77 transition count 55
Iterating global reduction 1 with 1 rules applied. Total rules applied 136 place count 77 transition count 55
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 137 place count 76 transition count 54
Iterating global reduction 1 with 1 rules applied. Total rules applied 138 place count 76 transition count 54
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 139 place count 75 transition count 53
Iterating global reduction 1 with 1 rules applied. Total rules applied 140 place count 75 transition count 53
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 141 place count 74 transition count 52
Iterating global reduction 1 with 1 rules applied. Total rules applied 142 place count 74 transition count 52
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 143 place count 73 transition count 51
Iterating global reduction 1 with 1 rules applied. Total rules applied 144 place count 73 transition count 51
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 146 place count 73 transition count 49
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 147 place count 72 transition count 48
Reduce places removed 24 places and 0 transitions.
Drop transitions removed 44 transitions
Trivial Post-agglo rules discarded 44 transitions
Performed 44 trivial Post agglomeration. Transition count delta: 44
Iterating post reduction 2 with 68 rules applied. Total rules applied 215 place count 48 transition count 4
Reduce places removed 44 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 45 rules applied. Total rules applied 260 place count 4 transition count 3
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 261 place count 3 transition count 3
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 261 place count 3 transition count 2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 263 place count 2 transition count 2
Applied a total of 263 rules in 31 ms. Remains 2 /145 variables (removed 143) and now considering 2/123 (removed 121) transitions.
Finished structural reductions, in 1 iterations. Remains : 2/145 places, 2/123 transitions.
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Incomplete random walk after 10000 steps, including 356 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 15 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 3088595 steps, run timeout after 3001 ms. (steps per millisecond=1029 ) properties seen :{}
Probabilistic random walk after 3088595 steps, saw 393968 distinct states, run finished after 3001 ms. (steps per millisecond=1029 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 123 rows 145 cols
[2022-05-17 07:44:11] [INFO ] Computed 25 place invariants in 2 ms
[2022-05-17 07:44:11] [INFO ] [Real]Absence check using 25 positive place invariants in 4 ms returned sat
[2022-05-17 07:44:11] [INFO ] After 44ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-05-17 07:44:11] [INFO ] State equation strengthened by 25 read => feed constraints.
[2022-05-17 07:44:11] [INFO ] After 8ms SMT Verify possible using 25 Read/Feed constraints in real domain returned unsat :0 sat :1
[2022-05-17 07:44:11] [INFO ] After 18ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 5 ms.
[2022-05-17 07:44:11] [INFO ] After 132ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 1 out of 145 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 145/145 places, 123/123 transitions.
Free-agglomeration rule applied 48 times.
Iterating global reduction 0 with 48 rules applied. Total rules applied 48 place count 145 transition count 75
Reduce places removed 48 places and 0 transitions.
Iterating post reduction 0 with 48 rules applied. Total rules applied 96 place count 97 transition count 75
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 97 place count 96 transition count 74
Iterating global reduction 1 with 1 rules applied. Total rules applied 98 place count 96 transition count 74
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 99 place count 95 transition count 73
Iterating global reduction 1 with 1 rules applied. Total rules applied 100 place count 95 transition count 73
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 101 place count 94 transition count 72
Iterating global reduction 1 with 1 rules applied. Total rules applied 102 place count 94 transition count 72
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 103 place count 93 transition count 71
Iterating global reduction 1 with 1 rules applied. Total rules applied 104 place count 93 transition count 71
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 105 place count 92 transition count 70
Iterating global reduction 1 with 1 rules applied. Total rules applied 106 place count 92 transition count 70
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 107 place count 91 transition count 69
Iterating global reduction 1 with 1 rules applied. Total rules applied 108 place count 91 transition count 69
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 109 place count 90 transition count 68
Iterating global reduction 1 with 1 rules applied. Total rules applied 110 place count 90 transition count 68
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 111 place count 89 transition count 67
Iterating global reduction 1 with 1 rules applied. Total rules applied 112 place count 89 transition count 67
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 113 place count 88 transition count 66
Iterating global reduction 1 with 1 rules applied. Total rules applied 114 place count 88 transition count 66
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 115 place count 87 transition count 65
Iterating global reduction 1 with 1 rules applied. Total rules applied 116 place count 87 transition count 65
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 117 place count 86 transition count 64
Iterating global reduction 1 with 1 rules applied. Total rules applied 118 place count 86 transition count 64
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 119 place count 85 transition count 63
Iterating global reduction 1 with 1 rules applied. Total rules applied 120 place count 85 transition count 63
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 121 place count 84 transition count 62
Iterating global reduction 1 with 1 rules applied. Total rules applied 122 place count 84 transition count 62
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 123 place count 83 transition count 61
Iterating global reduction 1 with 1 rules applied. Total rules applied 124 place count 83 transition count 61
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 125 place count 82 transition count 60
Iterating global reduction 1 with 1 rules applied. Total rules applied 126 place count 82 transition count 60
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 127 place count 81 transition count 59
Iterating global reduction 1 with 1 rules applied. Total rules applied 128 place count 81 transition count 59
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 129 place count 80 transition count 58
Iterating global reduction 1 with 1 rules applied. Total rules applied 130 place count 80 transition count 58
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 131 place count 79 transition count 57
Iterating global reduction 1 with 1 rules applied. Total rules applied 132 place count 79 transition count 57
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 133 place count 78 transition count 56
Iterating global reduction 1 with 1 rules applied. Total rules applied 134 place count 78 transition count 56
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 135 place count 77 transition count 55
Iterating global reduction 1 with 1 rules applied. Total rules applied 136 place count 77 transition count 55
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 137 place count 76 transition count 54
Iterating global reduction 1 with 1 rules applied. Total rules applied 138 place count 76 transition count 54
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 139 place count 75 transition count 53
Iterating global reduction 1 with 1 rules applied. Total rules applied 140 place count 75 transition count 53
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 141 place count 74 transition count 52
Iterating global reduction 1 with 1 rules applied. Total rules applied 142 place count 74 transition count 52
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 143 place count 73 transition count 51
Iterating global reduction 1 with 1 rules applied. Total rules applied 144 place count 73 transition count 51
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 146 place count 73 transition count 49
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 147 place count 72 transition count 48
Reduce places removed 24 places and 0 transitions.
Drop transitions removed 44 transitions
Trivial Post-agglo rules discarded 44 transitions
Performed 44 trivial Post agglomeration. Transition count delta: 44
Iterating post reduction 2 with 68 rules applied. Total rules applied 215 place count 48 transition count 4
Reduce places removed 44 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 45 rules applied. Total rules applied 260 place count 4 transition count 3
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 261 place count 3 transition count 3
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 261 place count 3 transition count 2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 263 place count 2 transition count 2
Applied a total of 263 rules in 59 ms. Remains 2 /145 variables (removed 143) and now considering 2/123 (removed 121) transitions.
Finished structural reductions, in 1 iterations. Remains : 2/145 places, 2/123 transitions.
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Incomplete random walk after 10000 steps, including 362 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2774201 steps, run timeout after 3001 ms. (steps per millisecond=924 ) properties seen :{}
Probabilistic random walk after 2774201 steps, saw 354182 distinct states, run finished after 3001 ms. (steps per millisecond=924 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 123 rows 145 cols
[2022-05-17 07:44:14] [INFO ] Computed 25 place invariants in 1 ms
[2022-05-17 07:44:14] [INFO ] [Real]Absence check using 25 positive place invariants in 6 ms returned sat
[2022-05-17 07:44:14] [INFO ] After 49ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-05-17 07:44:14] [INFO ] State equation strengthened by 25 read => feed constraints.
[2022-05-17 07:44:14] [INFO ] After 11ms SMT Verify possible using 25 Read/Feed constraints in real domain returned unsat :0 sat :1
[2022-05-17 07:44:14] [INFO ] After 21ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 5 ms.
[2022-05-17 07:44:14] [INFO ] After 133ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 145 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 145/145 places, 123/123 transitions.
Free-agglomeration rule applied 48 times.
Iterating global reduction 0 with 48 rules applied. Total rules applied 48 place count 145 transition count 75
Reduce places removed 48 places and 0 transitions.
Iterating post reduction 0 with 48 rules applied. Total rules applied 96 place count 97 transition count 75
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 97 place count 96 transition count 74
Iterating global reduction 1 with 1 rules applied. Total rules applied 98 place count 96 transition count 74
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 99 place count 95 transition count 73
Iterating global reduction 1 with 1 rules applied. Total rules applied 100 place count 95 transition count 73
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 101 place count 94 transition count 72
Iterating global reduction 1 with 1 rules applied. Total rules applied 102 place count 94 transition count 72
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 103 place count 93 transition count 71
Iterating global reduction 1 with 1 rules applied. Total rules applied 104 place count 93 transition count 71
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 105 place count 92 transition count 70
Iterating global reduction 1 with 1 rules applied. Total rules applied 106 place count 92 transition count 70
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 107 place count 91 transition count 69
Iterating global reduction 1 with 1 rules applied. Total rules applied 108 place count 91 transition count 69
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 109 place count 90 transition count 68
Iterating global reduction 1 with 1 rules applied. Total rules applied 110 place count 90 transition count 68
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 111 place count 89 transition count 67
Iterating global reduction 1 with 1 rules applied. Total rules applied 112 place count 89 transition count 67
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 113 place count 88 transition count 66
Iterating global reduction 1 with 1 rules applied. Total rules applied 114 place count 88 transition count 66
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 115 place count 87 transition count 65
Iterating global reduction 1 with 1 rules applied. Total rules applied 116 place count 87 transition count 65
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 117 place count 86 transition count 64
Iterating global reduction 1 with 1 rules applied. Total rules applied 118 place count 86 transition count 64
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 119 place count 85 transition count 63
Iterating global reduction 1 with 1 rules applied. Total rules applied 120 place count 85 transition count 63
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 121 place count 84 transition count 62
Iterating global reduction 1 with 1 rules applied. Total rules applied 122 place count 84 transition count 62
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 123 place count 83 transition count 61
Iterating global reduction 1 with 1 rules applied. Total rules applied 124 place count 83 transition count 61
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 125 place count 82 transition count 60
Iterating global reduction 1 with 1 rules applied. Total rules applied 126 place count 82 transition count 60
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 127 place count 81 transition count 59
Iterating global reduction 1 with 1 rules applied. Total rules applied 128 place count 81 transition count 59
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 129 place count 80 transition count 58
Iterating global reduction 1 with 1 rules applied. Total rules applied 130 place count 80 transition count 58
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 131 place count 79 transition count 57
Iterating global reduction 1 with 1 rules applied. Total rules applied 132 place count 79 transition count 57
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 133 place count 78 transition count 56
Iterating global reduction 1 with 1 rules applied. Total rules applied 134 place count 78 transition count 56
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 135 place count 77 transition count 55
Iterating global reduction 1 with 1 rules applied. Total rules applied 136 place count 77 transition count 55
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 137 place count 76 transition count 54
Iterating global reduction 1 with 1 rules applied. Total rules applied 138 place count 76 transition count 54
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 139 place count 75 transition count 53
Iterating global reduction 1 with 1 rules applied. Total rules applied 140 place count 75 transition count 53
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 141 place count 74 transition count 52
Iterating global reduction 1 with 1 rules applied. Total rules applied 142 place count 74 transition count 52
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 143 place count 73 transition count 51
Iterating global reduction 1 with 1 rules applied. Total rules applied 144 place count 73 transition count 51
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 146 place count 73 transition count 49
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 147 place count 72 transition count 48
Reduce places removed 24 places and 0 transitions.
Drop transitions removed 44 transitions
Trivial Post-agglo rules discarded 44 transitions
Performed 44 trivial Post agglomeration. Transition count delta: 44
Iterating post reduction 2 with 68 rules applied. Total rules applied 215 place count 48 transition count 4
Reduce places removed 44 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 45 rules applied. Total rules applied 260 place count 4 transition count 3
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 261 place count 3 transition count 3
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 261 place count 3 transition count 2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 263 place count 2 transition count 2
Applied a total of 263 rules in 54 ms. Remains 2 /145 variables (removed 143) and now considering 2/123 (removed 121) transitions.
Finished structural reductions, in 1 iterations. Remains : 2/145 places, 2/123 transitions.
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Incomplete random walk after 10000 steps, including 358 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2321820 steps, run timeout after 3003 ms. (steps per millisecond=773 ) properties seen :{}
Probabilistic random walk after 2321820 steps, saw 298686 distinct states, run finished after 3003 ms. (steps per millisecond=773 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 123 rows 145 cols
[2022-05-17 07:44:17] [INFO ] Computed 25 place invariants in 1 ms
[2022-05-17 07:44:17] [INFO ] [Real]Absence check using 25 positive place invariants in 6 ms returned sat
[2022-05-17 07:44:17] [INFO ] After 50ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-05-17 07:44:17] [INFO ] State equation strengthened by 25 read => feed constraints.
[2022-05-17 07:44:17] [INFO ] After 12ms SMT Verify possible using 25 Read/Feed constraints in real domain returned unsat :0 sat :1
[2022-05-17 07:44:17] [INFO ] After 22ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 7 ms.
[2022-05-17 07:44:17] [INFO ] After 160ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 145 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 145/145 places, 123/123 transitions.
Free-agglomeration rule applied 48 times.
Iterating global reduction 0 with 48 rules applied. Total rules applied 48 place count 145 transition count 75
Reduce places removed 48 places and 0 transitions.
Iterating post reduction 0 with 48 rules applied. Total rules applied 96 place count 97 transition count 75
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 97 place count 96 transition count 74
Iterating global reduction 1 with 1 rules applied. Total rules applied 98 place count 96 transition count 74
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 99 place count 95 transition count 73
Iterating global reduction 1 with 1 rules applied. Total rules applied 100 place count 95 transition count 73
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 101 place count 94 transition count 72
Iterating global reduction 1 with 1 rules applied. Total rules applied 102 place count 94 transition count 72
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 103 place count 93 transition count 71
Iterating global reduction 1 with 1 rules applied. Total rules applied 104 place count 93 transition count 71
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 105 place count 92 transition count 70
Iterating global reduction 1 with 1 rules applied. Total rules applied 106 place count 92 transition count 70
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 107 place count 91 transition count 69
Iterating global reduction 1 with 1 rules applied. Total rules applied 108 place count 91 transition count 69
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 109 place count 90 transition count 68
Iterating global reduction 1 with 1 rules applied. Total rules applied 110 place count 90 transition count 68
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 111 place count 89 transition count 67
Iterating global reduction 1 with 1 rules applied. Total rules applied 112 place count 89 transition count 67
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 113 place count 88 transition count 66
Iterating global reduction 1 with 1 rules applied. Total rules applied 114 place count 88 transition count 66
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 115 place count 87 transition count 65
Iterating global reduction 1 with 1 rules applied. Total rules applied 116 place count 87 transition count 65
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 117 place count 86 transition count 64
Iterating global reduction 1 with 1 rules applied. Total rules applied 118 place count 86 transition count 64
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 119 place count 85 transition count 63
Iterating global reduction 1 with 1 rules applied. Total rules applied 120 place count 85 transition count 63
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 121 place count 84 transition count 62
Iterating global reduction 1 with 1 rules applied. Total rules applied 122 place count 84 transition count 62
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 123 place count 83 transition count 61
Iterating global reduction 1 with 1 rules applied. Total rules applied 124 place count 83 transition count 61
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 125 place count 82 transition count 60
Iterating global reduction 1 with 1 rules applied. Total rules applied 126 place count 82 transition count 60
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 127 place count 81 transition count 59
Iterating global reduction 1 with 1 rules applied. Total rules applied 128 place count 81 transition count 59
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 129 place count 80 transition count 58
Iterating global reduction 1 with 1 rules applied. Total rules applied 130 place count 80 transition count 58
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 131 place count 79 transition count 57
Iterating global reduction 1 with 1 rules applied. Total rules applied 132 place count 79 transition count 57
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 133 place count 78 transition count 56
Iterating global reduction 1 with 1 rules applied. Total rules applied 134 place count 78 transition count 56
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 135 place count 77 transition count 55
Iterating global reduction 1 with 1 rules applied. Total rules applied 136 place count 77 transition count 55
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 137 place count 76 transition count 54
Iterating global reduction 1 with 1 rules applied. Total rules applied 138 place count 76 transition count 54
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 139 place count 75 transition count 53
Iterating global reduction 1 with 1 rules applied. Total rules applied 140 place count 75 transition count 53
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 141 place count 74 transition count 52
Iterating global reduction 1 with 1 rules applied. Total rules applied 142 place count 74 transition count 52
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 143 place count 73 transition count 51
Iterating global reduction 1 with 1 rules applied. Total rules applied 144 place count 73 transition count 51
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 146 place count 73 transition count 49
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 147 place count 72 transition count 48
Reduce places removed 24 places and 0 transitions.
Drop transitions removed 44 transitions
Trivial Post-agglo rules discarded 44 transitions
Performed 44 trivial Post agglomeration. Transition count delta: 44
Iterating post reduction 2 with 68 rules applied. Total rules applied 215 place count 48 transition count 4
Reduce places removed 44 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 45 rules applied. Total rules applied 260 place count 4 transition count 3
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 261 place count 3 transition count 3
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 261 place count 3 transition count 2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 263 place count 2 transition count 2
Applied a total of 263 rules in 27 ms. Remains 2 /145 variables (removed 143) and now considering 2/123 (removed 121) transitions.
Finished structural reductions, in 1 iterations. Remains : 2/145 places, 2/123 transitions.
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Incomplete random walk after 10000 steps, including 358 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 3286826 steps, run timeout after 3001 ms. (steps per millisecond=1095 ) properties seen :{}
Probabilistic random walk after 3286826 steps, saw 420390 distinct states, run finished after 3001 ms. (steps per millisecond=1095 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 123 rows 145 cols
[2022-05-17 07:44:20] [INFO ] Computed 25 place invariants in 1 ms
[2022-05-17 07:44:20] [INFO ] [Real]Absence check using 25 positive place invariants in 6 ms returned sat
[2022-05-17 07:44:21] [INFO ] After 47ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-05-17 07:44:21] [INFO ] State equation strengthened by 25 read => feed constraints.
[2022-05-17 07:44:21] [INFO ] After 10ms SMT Verify possible using 25 Read/Feed constraints in real domain returned unsat :0 sat :1
[2022-05-17 07:44:21] [INFO ] After 19ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 9 ms.
[2022-05-17 07:44:21] [INFO ] After 132ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 145 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 145/145 places, 123/123 transitions.
Free-agglomeration rule applied 48 times.
Iterating global reduction 0 with 48 rules applied. Total rules applied 48 place count 145 transition count 75
Reduce places removed 48 places and 0 transitions.
Iterating post reduction 0 with 48 rules applied. Total rules applied 96 place count 97 transition count 75
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 97 place count 96 transition count 74
Iterating global reduction 1 with 1 rules applied. Total rules applied 98 place count 96 transition count 74
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 99 place count 95 transition count 73
Iterating global reduction 1 with 1 rules applied. Total rules applied 100 place count 95 transition count 73
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 101 place count 94 transition count 72
Iterating global reduction 1 with 1 rules applied. Total rules applied 102 place count 94 transition count 72
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 103 place count 93 transition count 71
Iterating global reduction 1 with 1 rules applied. Total rules applied 104 place count 93 transition count 71
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 105 place count 92 transition count 70
Iterating global reduction 1 with 1 rules applied. Total rules applied 106 place count 92 transition count 70
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 107 place count 91 transition count 69
Iterating global reduction 1 with 1 rules applied. Total rules applied 108 place count 91 transition count 69
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 109 place count 90 transition count 68
Iterating global reduction 1 with 1 rules applied. Total rules applied 110 place count 90 transition count 68
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 111 place count 89 transition count 67
Iterating global reduction 1 with 1 rules applied. Total rules applied 112 place count 89 transition count 67
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 113 place count 88 transition count 66
Iterating global reduction 1 with 1 rules applied. Total rules applied 114 place count 88 transition count 66
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 115 place count 87 transition count 65
Iterating global reduction 1 with 1 rules applied. Total rules applied 116 place count 87 transition count 65
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 117 place count 86 transition count 64
Iterating global reduction 1 with 1 rules applied. Total rules applied 118 place count 86 transition count 64
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 119 place count 85 transition count 63
Iterating global reduction 1 with 1 rules applied. Total rules applied 120 place count 85 transition count 63
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 121 place count 84 transition count 62
Iterating global reduction 1 with 1 rules applied. Total rules applied 122 place count 84 transition count 62
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 123 place count 83 transition count 61
Iterating global reduction 1 with 1 rules applied. Total rules applied 124 place count 83 transition count 61
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 125 place count 82 transition count 60
Iterating global reduction 1 with 1 rules applied. Total rules applied 126 place count 82 transition count 60
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 127 place count 81 transition count 59
Iterating global reduction 1 with 1 rules applied. Total rules applied 128 place count 81 transition count 59
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 129 place count 80 transition count 58
Iterating global reduction 1 with 1 rules applied. Total rules applied 130 place count 80 transition count 58
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 131 place count 79 transition count 57
Iterating global reduction 1 with 1 rules applied. Total rules applied 132 place count 79 transition count 57
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 133 place count 78 transition count 56
Iterating global reduction 1 with 1 rules applied. Total rules applied 134 place count 78 transition count 56
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 135 place count 77 transition count 55
Iterating global reduction 1 with 1 rules applied. Total rules applied 136 place count 77 transition count 55
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 137 place count 76 transition count 54
Iterating global reduction 1 with 1 rules applied. Total rules applied 138 place count 76 transition count 54
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 139 place count 75 transition count 53
Iterating global reduction 1 with 1 rules applied. Total rules applied 140 place count 75 transition count 53
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 141 place count 74 transition count 52
Iterating global reduction 1 with 1 rules applied. Total rules applied 142 place count 74 transition count 52
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 143 place count 73 transition count 51
Iterating global reduction 1 with 1 rules applied. Total rules applied 144 place count 73 transition count 51
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 146 place count 73 transition count 49
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 147 place count 72 transition count 48
Reduce places removed 24 places and 0 transitions.
Drop transitions removed 44 transitions
Trivial Post-agglo rules discarded 44 transitions
Performed 44 trivial Post agglomeration. Transition count delta: 44
Iterating post reduction 2 with 68 rules applied. Total rules applied 215 place count 48 transition count 4
Reduce places removed 44 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 45 rules applied. Total rules applied 260 place count 4 transition count 3
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 261 place count 3 transition count 3
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 261 place count 3 transition count 2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 263 place count 2 transition count 2
Applied a total of 263 rules in 24 ms. Remains 2 /145 variables (removed 143) and now considering 2/123 (removed 121) transitions.
Finished structural reductions, in 1 iterations. Remains : 2/145 places, 2/123 transitions.
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=0 )
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Incomplete random walk after 10000 steps, including 355 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 3097738 steps, run timeout after 3001 ms. (steps per millisecond=1032 ) properties seen :{}
Probabilistic random walk after 3097738 steps, saw 395688 distinct states, run finished after 3001 ms. (steps per millisecond=1032 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 123 rows 145 cols
[2022-05-17 07:44:24] [INFO ] Computed 25 place invariants in 1 ms
[2022-05-17 07:44:24] [INFO ] [Real]Absence check using 25 positive place invariants in 6 ms returned sat
[2022-05-17 07:44:24] [INFO ] After 49ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-05-17 07:44:24] [INFO ] State equation strengthened by 25 read => feed constraints.
[2022-05-17 07:44:24] [INFO ] After 10ms SMT Verify possible using 25 Read/Feed constraints in real domain returned unsat :0 sat :1
[2022-05-17 07:44:24] [INFO ] After 19ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 5 ms.
[2022-05-17 07:44:24] [INFO ] After 132ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 145 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 145/145 places, 123/123 transitions.
Free-agglomeration rule applied 48 times.
Iterating global reduction 0 with 48 rules applied. Total rules applied 48 place count 145 transition count 75
Reduce places removed 48 places and 0 transitions.
Iterating post reduction 0 with 48 rules applied. Total rules applied 96 place count 97 transition count 75
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 97 place count 96 transition count 74
Iterating global reduction 1 with 1 rules applied. Total rules applied 98 place count 96 transition count 74
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 99 place count 95 transition count 73
Iterating global reduction 1 with 1 rules applied. Total rules applied 100 place count 95 transition count 73
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 101 place count 94 transition count 72
Iterating global reduction 1 with 1 rules applied. Total rules applied 102 place count 94 transition count 72
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 103 place count 93 transition count 71
Iterating global reduction 1 with 1 rules applied. Total rules applied 104 place count 93 transition count 71
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 105 place count 92 transition count 70
Iterating global reduction 1 with 1 rules applied. Total rules applied 106 place count 92 transition count 70
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 107 place count 91 transition count 69
Iterating global reduction 1 with 1 rules applied. Total rules applied 108 place count 91 transition count 69
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 109 place count 90 transition count 68
Iterating global reduction 1 with 1 rules applied. Total rules applied 110 place count 90 transition count 68
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 111 place count 89 transition count 67
Iterating global reduction 1 with 1 rules applied. Total rules applied 112 place count 89 transition count 67
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 113 place count 88 transition count 66
Iterating global reduction 1 with 1 rules applied. Total rules applied 114 place count 88 transition count 66
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 115 place count 87 transition count 65
Iterating global reduction 1 with 1 rules applied. Total rules applied 116 place count 87 transition count 65
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 117 place count 86 transition count 64
Iterating global reduction 1 with 1 rules applied. Total rules applied 118 place count 86 transition count 64
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 119 place count 85 transition count 63
Iterating global reduction 1 with 1 rules applied. Total rules applied 120 place count 85 transition count 63
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 121 place count 84 transition count 62
Iterating global reduction 1 with 1 rules applied. Total rules applied 122 place count 84 transition count 62
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 123 place count 83 transition count 61
Iterating global reduction 1 with 1 rules applied. Total rules applied 124 place count 83 transition count 61
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 125 place count 82 transition count 60
Iterating global reduction 1 with 1 rules applied. Total rules applied 126 place count 82 transition count 60
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 127 place count 81 transition count 59
Iterating global reduction 1 with 1 rules applied. Total rules applied 128 place count 81 transition count 59
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 129 place count 80 transition count 58
Iterating global reduction 1 with 1 rules applied. Total rules applied 130 place count 80 transition count 58
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 131 place count 79 transition count 57
Iterating global reduction 1 with 1 rules applied. Total rules applied 132 place count 79 transition count 57
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 133 place count 78 transition count 56
Iterating global reduction 1 with 1 rules applied. Total rules applied 134 place count 78 transition count 56
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 135 place count 77 transition count 55
Iterating global reduction 1 with 1 rules applied. Total rules applied 136 place count 77 transition count 55
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 137 place count 76 transition count 54
Iterating global reduction 1 with 1 rules applied. Total rules applied 138 place count 76 transition count 54
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 139 place count 75 transition count 53
Iterating global reduction 1 with 1 rules applied. Total rules applied 140 place count 75 transition count 53
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 141 place count 74 transition count 52
Iterating global reduction 1 with 1 rules applied. Total rules applied 142 place count 74 transition count 52
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 143 place count 73 transition count 51
Iterating global reduction 1 with 1 rules applied. Total rules applied 144 place count 73 transition count 51
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 146 place count 73 transition count 49
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 147 place count 72 transition count 48
Reduce places removed 24 places and 0 transitions.
Drop transitions removed 44 transitions
Trivial Post-agglo rules discarded 44 transitions
Performed 44 trivial Post agglomeration. Transition count delta: 44
Iterating post reduction 2 with 68 rules applied. Total rules applied 215 place count 48 transition count 4
Reduce places removed 44 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 45 rules applied. Total rules applied 260 place count 4 transition count 3
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 261 place count 3 transition count 3
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 261 place count 3 transition count 2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 263 place count 2 transition count 2
Applied a total of 263 rules in 22 ms. Remains 2 /145 variables (removed 143) and now considering 2/123 (removed 121) transitions.
Finished structural reductions, in 1 iterations. Remains : 2/145 places, 2/123 transitions.
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Incomplete random walk after 10000 steps, including 354 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 3357888 steps, run timeout after 3001 ms. (steps per millisecond=1118 ) properties seen :{}
Probabilistic random walk after 3357888 steps, saw 428252 distinct states, run finished after 3001 ms. (steps per millisecond=1118 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 123 rows 145 cols
[2022-05-17 07:44:27] [INFO ] Computed 25 place invariants in 1 ms
[2022-05-17 07:44:27] [INFO ] [Real]Absence check using 25 positive place invariants in 5 ms returned sat
[2022-05-17 07:44:27] [INFO ] After 47ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-05-17 07:44:27] [INFO ] State equation strengthened by 25 read => feed constraints.
[2022-05-17 07:44:27] [INFO ] After 10ms SMT Verify possible using 25 Read/Feed constraints in real domain returned unsat :0 sat :1
[2022-05-17 07:44:27] [INFO ] After 19ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 5 ms.
[2022-05-17 07:44:27] [INFO ] After 137ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 145 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 145/145 places, 123/123 transitions.
Free-agglomeration rule applied 48 times.
Iterating global reduction 0 with 48 rules applied. Total rules applied 48 place count 145 transition count 75
Reduce places removed 48 places and 0 transitions.
Iterating post reduction 0 with 48 rules applied. Total rules applied 96 place count 97 transition count 75
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 97 place count 96 transition count 74
Iterating global reduction 1 with 1 rules applied. Total rules applied 98 place count 96 transition count 74
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 99 place count 95 transition count 73
Iterating global reduction 1 with 1 rules applied. Total rules applied 100 place count 95 transition count 73
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 101 place count 94 transition count 72
Iterating global reduction 1 with 1 rules applied. Total rules applied 102 place count 94 transition count 72
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 103 place count 93 transition count 71
Iterating global reduction 1 with 1 rules applied. Total rules applied 104 place count 93 transition count 71
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 105 place count 92 transition count 70
Iterating global reduction 1 with 1 rules applied. Total rules applied 106 place count 92 transition count 70
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 107 place count 91 transition count 69
Iterating global reduction 1 with 1 rules applied. Total rules applied 108 place count 91 transition count 69
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 109 place count 90 transition count 68
Iterating global reduction 1 with 1 rules applied. Total rules applied 110 place count 90 transition count 68
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 111 place count 89 transition count 67
Iterating global reduction 1 with 1 rules applied. Total rules applied 112 place count 89 transition count 67
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 113 place count 88 transition count 66
Iterating global reduction 1 with 1 rules applied. Total rules applied 114 place count 88 transition count 66
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 115 place count 87 transition count 65
Iterating global reduction 1 with 1 rules applied. Total rules applied 116 place count 87 transition count 65
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 117 place count 86 transition count 64
Iterating global reduction 1 with 1 rules applied. Total rules applied 118 place count 86 transition count 64
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 119 place count 85 transition count 63
Iterating global reduction 1 with 1 rules applied. Total rules applied 120 place count 85 transition count 63
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 121 place count 84 transition count 62
Iterating global reduction 1 with 1 rules applied. Total rules applied 122 place count 84 transition count 62
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 123 place count 83 transition count 61
Iterating global reduction 1 with 1 rules applied. Total rules applied 124 place count 83 transition count 61
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 125 place count 82 transition count 60
Iterating global reduction 1 with 1 rules applied. Total rules applied 126 place count 82 transition count 60
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 127 place count 81 transition count 59
Iterating global reduction 1 with 1 rules applied. Total rules applied 128 place count 81 transition count 59
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 129 place count 80 transition count 58
Iterating global reduction 1 with 1 rules applied. Total rules applied 130 place count 80 transition count 58
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 131 place count 79 transition count 57
Iterating global reduction 1 with 1 rules applied. Total rules applied 132 place count 79 transition count 57
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 133 place count 78 transition count 56
Iterating global reduction 1 with 1 rules applied. Total rules applied 134 place count 78 transition count 56
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 135 place count 77 transition count 55
Iterating global reduction 1 with 1 rules applied. Total rules applied 136 place count 77 transition count 55
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 137 place count 76 transition count 54
Iterating global reduction 1 with 1 rules applied. Total rules applied 138 place count 76 transition count 54
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 139 place count 75 transition count 53
Iterating global reduction 1 with 1 rules applied. Total rules applied 140 place count 75 transition count 53
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 141 place count 74 transition count 52
Iterating global reduction 1 with 1 rules applied. Total rules applied 142 place count 74 transition count 52
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 143 place count 73 transition count 51
Iterating global reduction 1 with 1 rules applied. Total rules applied 144 place count 73 transition count 51
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 146 place count 73 transition count 49
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 147 place count 72 transition count 48
Reduce places removed 24 places and 0 transitions.
Drop transitions removed 44 transitions
Trivial Post-agglo rules discarded 44 transitions
Performed 44 trivial Post agglomeration. Transition count delta: 44
Iterating post reduction 2 with 68 rules applied. Total rules applied 215 place count 48 transition count 4
Reduce places removed 44 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 45 rules applied. Total rules applied 260 place count 4 transition count 3
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 261 place count 3 transition count 3
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 261 place count 3 transition count 2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 263 place count 2 transition count 2
Applied a total of 263 rules in 29 ms. Remains 2 /145 variables (removed 143) and now considering 2/123 (removed 121) transitions.
Finished structural reductions, in 1 iterations. Remains : 2/145 places, 2/123 transitions.
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Incomplete random walk after 10000 steps, including 356 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 3215566 steps, run timeout after 3001 ms. (steps per millisecond=1071 ) properties seen :{}
Probabilistic random walk after 3215566 steps, saw 411672 distinct states, run finished after 3001 ms. (steps per millisecond=1071 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 123 rows 145 cols
[2022-05-17 07:44:30] [INFO ] Computed 25 place invariants in 3 ms
[2022-05-17 07:44:30] [INFO ] [Real]Absence check using 25 positive place invariants in 6 ms returned sat
[2022-05-17 07:44:30] [INFO ] After 47ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-05-17 07:44:30] [INFO ] State equation strengthened by 25 read => feed constraints.
[2022-05-17 07:44:30] [INFO ] After 10ms SMT Verify possible using 25 Read/Feed constraints in real domain returned unsat :0 sat :1
[2022-05-17 07:44:30] [INFO ] After 19ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 5 ms.
[2022-05-17 07:44:30] [INFO ] After 125ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 145 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 145/145 places, 123/123 transitions.
Free-agglomeration rule applied 48 times.
Iterating global reduction 0 with 48 rules applied. Total rules applied 48 place count 145 transition count 75
Reduce places removed 48 places and 0 transitions.
Iterating post reduction 0 with 48 rules applied. Total rules applied 96 place count 97 transition count 75
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 97 place count 96 transition count 74
Iterating global reduction 1 with 1 rules applied. Total rules applied 98 place count 96 transition count 74
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 99 place count 95 transition count 73
Iterating global reduction 1 with 1 rules applied. Total rules applied 100 place count 95 transition count 73
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 101 place count 94 transition count 72
Iterating global reduction 1 with 1 rules applied. Total rules applied 102 place count 94 transition count 72
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 103 place count 93 transition count 71
Iterating global reduction 1 with 1 rules applied. Total rules applied 104 place count 93 transition count 71
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 105 place count 92 transition count 70
Iterating global reduction 1 with 1 rules applied. Total rules applied 106 place count 92 transition count 70
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 107 place count 91 transition count 69
Iterating global reduction 1 with 1 rules applied. Total rules applied 108 place count 91 transition count 69
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 109 place count 90 transition count 68
Iterating global reduction 1 with 1 rules applied. Total rules applied 110 place count 90 transition count 68
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 111 place count 89 transition count 67
Iterating global reduction 1 with 1 rules applied. Total rules applied 112 place count 89 transition count 67
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 113 place count 88 transition count 66
Iterating global reduction 1 with 1 rules applied. Total rules applied 114 place count 88 transition count 66
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 115 place count 87 transition count 65
Iterating global reduction 1 with 1 rules applied. Total rules applied 116 place count 87 transition count 65
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 117 place count 86 transition count 64
Iterating global reduction 1 with 1 rules applied. Total rules applied 118 place count 86 transition count 64
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 119 place count 85 transition count 63
Iterating global reduction 1 with 1 rules applied. Total rules applied 120 place count 85 transition count 63
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 121 place count 84 transition count 62
Iterating global reduction 1 with 1 rules applied. Total rules applied 122 place count 84 transition count 62
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 123 place count 83 transition count 61
Iterating global reduction 1 with 1 rules applied. Total rules applied 124 place count 83 transition count 61
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 125 place count 82 transition count 60
Iterating global reduction 1 with 1 rules applied. Total rules applied 126 place count 82 transition count 60
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 127 place count 81 transition count 59
Iterating global reduction 1 with 1 rules applied. Total rules applied 128 place count 81 transition count 59
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 129 place count 80 transition count 58
Iterating global reduction 1 with 1 rules applied. Total rules applied 130 place count 80 transition count 58
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 131 place count 79 transition count 57
Iterating global reduction 1 with 1 rules applied. Total rules applied 132 place count 79 transition count 57
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 133 place count 78 transition count 56
Iterating global reduction 1 with 1 rules applied. Total rules applied 134 place count 78 transition count 56
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 135 place count 77 transition count 55
Iterating global reduction 1 with 1 rules applied. Total rules applied 136 place count 77 transition count 55
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 137 place count 76 transition count 54
Iterating global reduction 1 with 1 rules applied. Total rules applied 138 place count 76 transition count 54
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 139 place count 75 transition count 53
Iterating global reduction 1 with 1 rules applied. Total rules applied 140 place count 75 transition count 53
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 141 place count 74 transition count 52
Iterating global reduction 1 with 1 rules applied. Total rules applied 142 place count 74 transition count 52
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 143 place count 73 transition count 51
Iterating global reduction 1 with 1 rules applied. Total rules applied 144 place count 73 transition count 51
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 146 place count 73 transition count 49
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 147 place count 72 transition count 48
Reduce places removed 24 places and 0 transitions.
Drop transitions removed 44 transitions
Trivial Post-agglo rules discarded 44 transitions
Performed 44 trivial Post agglomeration. Transition count delta: 44
Iterating post reduction 2 with 68 rules applied. Total rules applied 215 place count 48 transition count 4
Reduce places removed 44 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 45 rules applied. Total rules applied 260 place count 4 transition count 3
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 261 place count 3 transition count 3
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 261 place count 3 transition count 2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 263 place count 2 transition count 2
Applied a total of 263 rules in 24 ms. Remains 2 /145 variables (removed 143) and now considering 2/123 (removed 121) transitions.
Finished structural reductions, in 1 iterations. Remains : 2/145 places, 2/123 transitions.
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Incomplete random walk after 10000 steps, including 358 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 3415730 steps, run timeout after 3001 ms. (steps per millisecond=1138 ) properties seen :{}
Probabilistic random walk after 3415730 steps, saw 434480 distinct states, run finished after 3001 ms. (steps per millisecond=1138 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 123 rows 145 cols
[2022-05-17 07:44:33] [INFO ] Computed 25 place invariants in 1 ms
[2022-05-17 07:44:33] [INFO ] [Real]Absence check using 25 positive place invariants in 7 ms returned sat
[2022-05-17 07:44:33] [INFO ] After 58ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-05-17 07:44:33] [INFO ] State equation strengthened by 25 read => feed constraints.
[2022-05-17 07:44:33] [INFO ] After 11ms SMT Verify possible using 25 Read/Feed constraints in real domain returned unsat :0 sat :1
[2022-05-17 07:44:33] [INFO ] After 21ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 16 ms.
[2022-05-17 07:44:33] [INFO ] After 158ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 145 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 145/145 places, 123/123 transitions.
Free-agglomeration rule applied 48 times.
Iterating global reduction 0 with 48 rules applied. Total rules applied 48 place count 145 transition count 75
Reduce places removed 48 places and 0 transitions.
Iterating post reduction 0 with 48 rules applied. Total rules applied 96 place count 97 transition count 75
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 97 place count 96 transition count 74
Iterating global reduction 1 with 1 rules applied. Total rules applied 98 place count 96 transition count 74
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 99 place count 95 transition count 73
Iterating global reduction 1 with 1 rules applied. Total rules applied 100 place count 95 transition count 73
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 101 place count 94 transition count 72
Iterating global reduction 1 with 1 rules applied. Total rules applied 102 place count 94 transition count 72
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 103 place count 93 transition count 71
Iterating global reduction 1 with 1 rules applied. Total rules applied 104 place count 93 transition count 71
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 105 place count 92 transition count 70
Iterating global reduction 1 with 1 rules applied. Total rules applied 106 place count 92 transition count 70
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 107 place count 91 transition count 69
Iterating global reduction 1 with 1 rules applied. Total rules applied 108 place count 91 transition count 69
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 109 place count 90 transition count 68
Iterating global reduction 1 with 1 rules applied. Total rules applied 110 place count 90 transition count 68
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 111 place count 89 transition count 67
Iterating global reduction 1 with 1 rules applied. Total rules applied 112 place count 89 transition count 67
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 113 place count 88 transition count 66
Iterating global reduction 1 with 1 rules applied. Total rules applied 114 place count 88 transition count 66
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 115 place count 87 transition count 65
Iterating global reduction 1 with 1 rules applied. Total rules applied 116 place count 87 transition count 65
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 117 place count 86 transition count 64
Iterating global reduction 1 with 1 rules applied. Total rules applied 118 place count 86 transition count 64
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 119 place count 85 transition count 63
Iterating global reduction 1 with 1 rules applied. Total rules applied 120 place count 85 transition count 63
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 121 place count 84 transition count 62
Iterating global reduction 1 with 1 rules applied. Total rules applied 122 place count 84 transition count 62
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 123 place count 83 transition count 61
Iterating global reduction 1 with 1 rules applied. Total rules applied 124 place count 83 transition count 61
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 125 place count 82 transition count 60
Iterating global reduction 1 with 1 rules applied. Total rules applied 126 place count 82 transition count 60
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 127 place count 81 transition count 59
Iterating global reduction 1 with 1 rules applied. Total rules applied 128 place count 81 transition count 59
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 129 place count 80 transition count 58
Iterating global reduction 1 with 1 rules applied. Total rules applied 130 place count 80 transition count 58
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 131 place count 79 transition count 57
Iterating global reduction 1 with 1 rules applied. Total rules applied 132 place count 79 transition count 57
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 133 place count 78 transition count 56
Iterating global reduction 1 with 1 rules applied. Total rules applied 134 place count 78 transition count 56
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 135 place count 77 transition count 55
Iterating global reduction 1 with 1 rules applied. Total rules applied 136 place count 77 transition count 55
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 137 place count 76 transition count 54
Iterating global reduction 1 with 1 rules applied. Total rules applied 138 place count 76 transition count 54
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 139 place count 75 transition count 53
Iterating global reduction 1 with 1 rules applied. Total rules applied 140 place count 75 transition count 53
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 141 place count 74 transition count 52
Iterating global reduction 1 with 1 rules applied. Total rules applied 142 place count 74 transition count 52
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 143 place count 73 transition count 51
Iterating global reduction 1 with 1 rules applied. Total rules applied 144 place count 73 transition count 51
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 146 place count 73 transition count 49
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 147 place count 72 transition count 48
Reduce places removed 24 places and 0 transitions.
Drop transitions removed 44 transitions
Trivial Post-agglo rules discarded 44 transitions
Performed 44 trivial Post agglomeration. Transition count delta: 44
Iterating post reduction 2 with 68 rules applied. Total rules applied 215 place count 48 transition count 4
Reduce places removed 44 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 45 rules applied. Total rules applied 260 place count 4 transition count 3
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 261 place count 3 transition count 3
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 261 place count 3 transition count 2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 263 place count 2 transition count 2
Applied a total of 263 rules in 15 ms. Remains 2 /145 variables (removed 143) and now considering 2/123 (removed 121) transitions.
Finished structural reductions, in 1 iterations. Remains : 2/145 places, 2/123 transitions.
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Incomplete random walk after 10000 steps, including 359 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 3252746 steps, run timeout after 3001 ms. (steps per millisecond=1083 ) properties seen :{}
Probabilistic random walk after 3252746 steps, saw 416432 distinct states, run finished after 3001 ms. (steps per millisecond=1083 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 123 rows 145 cols
[2022-05-17 07:44:36] [INFO ] Computed 25 place invariants in 1 ms
[2022-05-17 07:44:36] [INFO ] [Real]Absence check using 25 positive place invariants in 6 ms returned sat
[2022-05-17 07:44:36] [INFO ] After 47ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-05-17 07:44:36] [INFO ] State equation strengthened by 25 read => feed constraints.
[2022-05-17 07:44:37] [INFO ] After 10ms SMT Verify possible using 25 Read/Feed constraints in real domain returned unsat :0 sat :1
[2022-05-17 07:44:37] [INFO ] After 18ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 5 ms.
[2022-05-17 07:44:37] [INFO ] After 124ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 145 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 145/145 places, 123/123 transitions.
Free-agglomeration rule applied 48 times.
Iterating global reduction 0 with 48 rules applied. Total rules applied 48 place count 145 transition count 75
Reduce places removed 48 places and 0 transitions.
Iterating post reduction 0 with 48 rules applied. Total rules applied 96 place count 97 transition count 75
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 97 place count 96 transition count 74
Iterating global reduction 1 with 1 rules applied. Total rules applied 98 place count 96 transition count 74
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 99 place count 95 transition count 73
Iterating global reduction 1 with 1 rules applied. Total rules applied 100 place count 95 transition count 73
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 101 place count 94 transition count 72
Iterating global reduction 1 with 1 rules applied. Total rules applied 102 place count 94 transition count 72
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 103 place count 93 transition count 71
Iterating global reduction 1 with 1 rules applied. Total rules applied 104 place count 93 transition count 71
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 105 place count 92 transition count 70
Iterating global reduction 1 with 1 rules applied. Total rules applied 106 place count 92 transition count 70
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 107 place count 91 transition count 69
Iterating global reduction 1 with 1 rules applied. Total rules applied 108 place count 91 transition count 69
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 109 place count 90 transition count 68
Iterating global reduction 1 with 1 rules applied. Total rules applied 110 place count 90 transition count 68
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 111 place count 89 transition count 67
Iterating global reduction 1 with 1 rules applied. Total rules applied 112 place count 89 transition count 67
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 113 place count 88 transition count 66
Iterating global reduction 1 with 1 rules applied. Total rules applied 114 place count 88 transition count 66
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 115 place count 87 transition count 65
Iterating global reduction 1 with 1 rules applied. Total rules applied 116 place count 87 transition count 65
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 117 place count 86 transition count 64
Iterating global reduction 1 with 1 rules applied. Total rules applied 118 place count 86 transition count 64
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 119 place count 85 transition count 63
Iterating global reduction 1 with 1 rules applied. Total rules applied 120 place count 85 transition count 63
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 121 place count 84 transition count 62
Iterating global reduction 1 with 1 rules applied. Total rules applied 122 place count 84 transition count 62
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 123 place count 83 transition count 61
Iterating global reduction 1 with 1 rules applied. Total rules applied 124 place count 83 transition count 61
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 125 place count 82 transition count 60
Iterating global reduction 1 with 1 rules applied. Total rules applied 126 place count 82 transition count 60
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 127 place count 81 transition count 59
Iterating global reduction 1 with 1 rules applied. Total rules applied 128 place count 81 transition count 59
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 129 place count 80 transition count 58
Iterating global reduction 1 with 1 rules applied. Total rules applied 130 place count 80 transition count 58
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 131 place count 79 transition count 57
Iterating global reduction 1 with 1 rules applied. Total rules applied 132 place count 79 transition count 57
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 133 place count 78 transition count 56
Iterating global reduction 1 with 1 rules applied. Total rules applied 134 place count 78 transition count 56
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 135 place count 77 transition count 55
Iterating global reduction 1 with 1 rules applied. Total rules applied 136 place count 77 transition count 55
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 137 place count 76 transition count 54
Iterating global reduction 1 with 1 rules applied. Total rules applied 138 place count 76 transition count 54
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 139 place count 75 transition count 53
Iterating global reduction 1 with 1 rules applied. Total rules applied 140 place count 75 transition count 53
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 141 place count 74 transition count 52
Iterating global reduction 1 with 1 rules applied. Total rules applied 142 place count 74 transition count 52
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 143 place count 73 transition count 51
Iterating global reduction 1 with 1 rules applied. Total rules applied 144 place count 73 transition count 51
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 146 place count 73 transition count 49
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 147 place count 72 transition count 48
Reduce places removed 24 places and 0 transitions.
Drop transitions removed 44 transitions
Trivial Post-agglo rules discarded 44 transitions
Performed 44 trivial Post agglomeration. Transition count delta: 44
Iterating post reduction 2 with 68 rules applied. Total rules applied 215 place count 48 transition count 4
Reduce places removed 44 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 45 rules applied. Total rules applied 260 place count 4 transition count 3
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 261 place count 3 transition count 3
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 261 place count 3 transition count 2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 263 place count 2 transition count 2
Applied a total of 263 rules in 13 ms. Remains 2 /145 variables (removed 143) and now considering 2/123 (removed 121) transitions.
Finished structural reductions, in 1 iterations. Remains : 2/145 places, 2/123 transitions.
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Incomplete random walk after 10000 steps, including 357 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 3266401 steps, run timeout after 3001 ms. (steps per millisecond=1088 ) properties seen :{}
Probabilistic random walk after 3266401 steps, saw 417838 distinct states, run finished after 3001 ms. (steps per millisecond=1088 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 123 rows 145 cols
[2022-05-17 07:44:40] [INFO ] Computed 25 place invariants in 1 ms
[2022-05-17 07:44:40] [INFO ] [Real]Absence check using 25 positive place invariants in 6 ms returned sat
[2022-05-17 07:44:40] [INFO ] After 47ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-05-17 07:44:40] [INFO ] State equation strengthened by 25 read => feed constraints.
[2022-05-17 07:44:40] [INFO ] After 10ms SMT Verify possible using 25 Read/Feed constraints in real domain returned unsat :0 sat :1
[2022-05-17 07:44:40] [INFO ] After 19ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 5 ms.
[2022-05-17 07:44:40] [INFO ] After 123ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 145 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 145/145 places, 123/123 transitions.
Free-agglomeration rule applied 48 times.
Iterating global reduction 0 with 48 rules applied. Total rules applied 48 place count 145 transition count 75
Reduce places removed 48 places and 0 transitions.
Iterating post reduction 0 with 48 rules applied. Total rules applied 96 place count 97 transition count 75
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 97 place count 96 transition count 74
Iterating global reduction 1 with 1 rules applied. Total rules applied 98 place count 96 transition count 74
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 99 place count 95 transition count 73
Iterating global reduction 1 with 1 rules applied. Total rules applied 100 place count 95 transition count 73
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 101 place count 94 transition count 72
Iterating global reduction 1 with 1 rules applied. Total rules applied 102 place count 94 transition count 72
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 103 place count 93 transition count 71
Iterating global reduction 1 with 1 rules applied. Total rules applied 104 place count 93 transition count 71
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 105 place count 92 transition count 70
Iterating global reduction 1 with 1 rules applied. Total rules applied 106 place count 92 transition count 70
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 107 place count 91 transition count 69
Iterating global reduction 1 with 1 rules applied. Total rules applied 108 place count 91 transition count 69
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 109 place count 90 transition count 68
Iterating global reduction 1 with 1 rules applied. Total rules applied 110 place count 90 transition count 68
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 111 place count 89 transition count 67
Iterating global reduction 1 with 1 rules applied. Total rules applied 112 place count 89 transition count 67
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 113 place count 88 transition count 66
Iterating global reduction 1 with 1 rules applied. Total rules applied 114 place count 88 transition count 66
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 115 place count 87 transition count 65
Iterating global reduction 1 with 1 rules applied. Total rules applied 116 place count 87 transition count 65
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 117 place count 86 transition count 64
Iterating global reduction 1 with 1 rules applied. Total rules applied 118 place count 86 transition count 64
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 119 place count 85 transition count 63
Iterating global reduction 1 with 1 rules applied. Total rules applied 120 place count 85 transition count 63
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 121 place count 84 transition count 62
Iterating global reduction 1 with 1 rules applied. Total rules applied 122 place count 84 transition count 62
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 123 place count 83 transition count 61
Iterating global reduction 1 with 1 rules applied. Total rules applied 124 place count 83 transition count 61
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 125 place count 82 transition count 60
Iterating global reduction 1 with 1 rules applied. Total rules applied 126 place count 82 transition count 60
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 127 place count 81 transition count 59
Iterating global reduction 1 with 1 rules applied. Total rules applied 128 place count 81 transition count 59
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 129 place count 80 transition count 58
Iterating global reduction 1 with 1 rules applied. Total rules applied 130 place count 80 transition count 58
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 131 place count 79 transition count 57
Iterating global reduction 1 with 1 rules applied. Total rules applied 132 place count 79 transition count 57
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 133 place count 78 transition count 56
Iterating global reduction 1 with 1 rules applied. Total rules applied 134 place count 78 transition count 56
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 135 place count 77 transition count 55
Iterating global reduction 1 with 1 rules applied. Total rules applied 136 place count 77 transition count 55
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 137 place count 76 transition count 54
Iterating global reduction 1 with 1 rules applied. Total rules applied 138 place count 76 transition count 54
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 139 place count 75 transition count 53
Iterating global reduction 1 with 1 rules applied. Total rules applied 140 place count 75 transition count 53
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 141 place count 74 transition count 52
Iterating global reduction 1 with 1 rules applied. Total rules applied 142 place count 74 transition count 52
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 143 place count 73 transition count 51
Iterating global reduction 1 with 1 rules applied. Total rules applied 144 place count 73 transition count 51
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 146 place count 73 transition count 49
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 147 place count 72 transition count 48
Reduce places removed 24 places and 0 transitions.
Drop transitions removed 44 transitions
Trivial Post-agglo rules discarded 44 transitions
Performed 44 trivial Post agglomeration. Transition count delta: 44
Iterating post reduction 2 with 68 rules applied. Total rules applied 215 place count 48 transition count 4
Reduce places removed 44 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 45 rules applied. Total rules applied 260 place count 4 transition count 3
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 261 place count 3 transition count 3
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 261 place count 3 transition count 2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 263 place count 2 transition count 2
Applied a total of 263 rules in 23 ms. Remains 2 /145 variables (removed 143) and now considering 2/123 (removed 121) transitions.
Finished structural reductions, in 1 iterations. Remains : 2/145 places, 2/123 transitions.
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Incomplete random walk after 10000 steps, including 355 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 3391163 steps, run timeout after 3001 ms. (steps per millisecond=1130 ) properties seen :{}
Probabilistic random walk after 3391163 steps, saw 431140 distinct states, run finished after 3001 ms. (steps per millisecond=1130 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 123 rows 145 cols
[2022-05-17 07:44:43] [INFO ] Computed 25 place invariants in 1 ms
[2022-05-17 07:44:43] [INFO ] [Real]Absence check using 25 positive place invariants in 6 ms returned sat
[2022-05-17 07:44:43] [INFO ] After 48ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-05-17 07:44:43] [INFO ] State equation strengthened by 25 read => feed constraints.
[2022-05-17 07:44:43] [INFO ] After 10ms SMT Verify possible using 25 Read/Feed constraints in real domain returned unsat :0 sat :1
[2022-05-17 07:44:43] [INFO ] After 18ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 6 ms.
[2022-05-17 07:44:43] [INFO ] After 126ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 145 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 145/145 places, 123/123 transitions.
Free-agglomeration rule applied 48 times.
Iterating global reduction 0 with 48 rules applied. Total rules applied 48 place count 145 transition count 75
Reduce places removed 48 places and 0 transitions.
Iterating post reduction 0 with 48 rules applied. Total rules applied 96 place count 97 transition count 75
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 97 place count 96 transition count 74
Iterating global reduction 1 with 1 rules applied. Total rules applied 98 place count 96 transition count 74
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 99 place count 95 transition count 73
Iterating global reduction 1 with 1 rules applied. Total rules applied 100 place count 95 transition count 73
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 101 place count 94 transition count 72
Iterating global reduction 1 with 1 rules applied. Total rules applied 102 place count 94 transition count 72
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 103 place count 93 transition count 71
Iterating global reduction 1 with 1 rules applied. Total rules applied 104 place count 93 transition count 71
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 105 place count 92 transition count 70
Iterating global reduction 1 with 1 rules applied. Total rules applied 106 place count 92 transition count 70
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 107 place count 91 transition count 69
Iterating global reduction 1 with 1 rules applied. Total rules applied 108 place count 91 transition count 69
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 109 place count 90 transition count 68
Iterating global reduction 1 with 1 rules applied. Total rules applied 110 place count 90 transition count 68
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 111 place count 89 transition count 67
Iterating global reduction 1 with 1 rules applied. Total rules applied 112 place count 89 transition count 67
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 113 place count 88 transition count 66
Iterating global reduction 1 with 1 rules applied. Total rules applied 114 place count 88 transition count 66
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 115 place count 87 transition count 65
Iterating global reduction 1 with 1 rules applied. Total rules applied 116 place count 87 transition count 65
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 117 place count 86 transition count 64
Iterating global reduction 1 with 1 rules applied. Total rules applied 118 place count 86 transition count 64
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 119 place count 85 transition count 63
Iterating global reduction 1 with 1 rules applied. Total rules applied 120 place count 85 transition count 63
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 121 place count 84 transition count 62
Iterating global reduction 1 with 1 rules applied. Total rules applied 122 place count 84 transition count 62
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 123 place count 83 transition count 61
Iterating global reduction 1 with 1 rules applied. Total rules applied 124 place count 83 transition count 61
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 125 place count 82 transition count 60
Iterating global reduction 1 with 1 rules applied. Total rules applied 126 place count 82 transition count 60
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 127 place count 81 transition count 59
Iterating global reduction 1 with 1 rules applied. Total rules applied 128 place count 81 transition count 59
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 129 place count 80 transition count 58
Iterating global reduction 1 with 1 rules applied. Total rules applied 130 place count 80 transition count 58
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 131 place count 79 transition count 57
Iterating global reduction 1 with 1 rules applied. Total rules applied 132 place count 79 transition count 57
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 133 place count 78 transition count 56
Iterating global reduction 1 with 1 rules applied. Total rules applied 134 place count 78 transition count 56
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 135 place count 77 transition count 55
Iterating global reduction 1 with 1 rules applied. Total rules applied 136 place count 77 transition count 55
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 137 place count 76 transition count 54
Iterating global reduction 1 with 1 rules applied. Total rules applied 138 place count 76 transition count 54
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 139 place count 75 transition count 53
Iterating global reduction 1 with 1 rules applied. Total rules applied 140 place count 75 transition count 53
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 141 place count 74 transition count 52
Iterating global reduction 1 with 1 rules applied. Total rules applied 142 place count 74 transition count 52
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 143 place count 73 transition count 51
Iterating global reduction 1 with 1 rules applied. Total rules applied 144 place count 73 transition count 51
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 146 place count 73 transition count 49
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 147 place count 72 transition count 48
Reduce places removed 24 places and 0 transitions.
Drop transitions removed 44 transitions
Trivial Post-agglo rules discarded 44 transitions
Performed 44 trivial Post agglomeration. Transition count delta: 44
Iterating post reduction 2 with 68 rules applied. Total rules applied 215 place count 48 transition count 4
Reduce places removed 44 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 45 rules applied. Total rules applied 260 place count 4 transition count 3
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 261 place count 3 transition count 3
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 261 place count 3 transition count 2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 263 place count 2 transition count 2
Applied a total of 263 rules in 43 ms. Remains 2 /145 variables (removed 143) and now considering 2/123 (removed 121) transitions.
Finished structural reductions, in 1 iterations. Remains : 2/145 places, 2/123 transitions.
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Incomplete random walk after 10000 steps, including 357 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 15 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2985845 steps, run timeout after 3001 ms. (steps per millisecond=994 ) properties seen :{}
Probabilistic random walk after 2985845 steps, saw 379792 distinct states, run finished after 3001 ms. (steps per millisecond=994 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 123 rows 145 cols
[2022-05-17 07:44:46] [INFO ] Computed 25 place invariants in 1 ms
[2022-05-17 07:44:46] [INFO ] [Real]Absence check using 25 positive place invariants in 8 ms returned sat
[2022-05-17 07:44:46] [INFO ] After 63ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-05-17 07:44:46] [INFO ] State equation strengthened by 25 read => feed constraints.
[2022-05-17 07:44:46] [INFO ] After 13ms SMT Verify possible using 25 Read/Feed constraints in real domain returned unsat :0 sat :1
[2022-05-17 07:44:46] [INFO ] After 23ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 6 ms.
[2022-05-17 07:44:46] [INFO ] After 174ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 145 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 145/145 places, 123/123 transitions.
Free-agglomeration rule applied 48 times.
Iterating global reduction 0 with 48 rules applied. Total rules applied 48 place count 145 transition count 75
Reduce places removed 48 places and 0 transitions.
Iterating post reduction 0 with 48 rules applied. Total rules applied 96 place count 97 transition count 75
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 97 place count 96 transition count 74
Iterating global reduction 1 with 1 rules applied. Total rules applied 98 place count 96 transition count 74
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 99 place count 95 transition count 73
Iterating global reduction 1 with 1 rules applied. Total rules applied 100 place count 95 transition count 73
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 101 place count 94 transition count 72
Iterating global reduction 1 with 1 rules applied. Total rules applied 102 place count 94 transition count 72
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 103 place count 93 transition count 71
Iterating global reduction 1 with 1 rules applied. Total rules applied 104 place count 93 transition count 71
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 105 place count 92 transition count 70
Iterating global reduction 1 with 1 rules applied. Total rules applied 106 place count 92 transition count 70
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 107 place count 91 transition count 69
Iterating global reduction 1 with 1 rules applied. Total rules applied 108 place count 91 transition count 69
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 109 place count 90 transition count 68
Iterating global reduction 1 with 1 rules applied. Total rules applied 110 place count 90 transition count 68
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 111 place count 89 transition count 67
Iterating global reduction 1 with 1 rules applied. Total rules applied 112 place count 89 transition count 67
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 113 place count 88 transition count 66
Iterating global reduction 1 with 1 rules applied. Total rules applied 114 place count 88 transition count 66
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 115 place count 87 transition count 65
Iterating global reduction 1 with 1 rules applied. Total rules applied 116 place count 87 transition count 65
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 117 place count 86 transition count 64
Iterating global reduction 1 with 1 rules applied. Total rules applied 118 place count 86 transition count 64
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 119 place count 85 transition count 63
Iterating global reduction 1 with 1 rules applied. Total rules applied 120 place count 85 transition count 63
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 121 place count 84 transition count 62
Iterating global reduction 1 with 1 rules applied. Total rules applied 122 place count 84 transition count 62
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 123 place count 83 transition count 61
Iterating global reduction 1 with 1 rules applied. Total rules applied 124 place count 83 transition count 61
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 125 place count 82 transition count 60
Iterating global reduction 1 with 1 rules applied. Total rules applied 126 place count 82 transition count 60
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 127 place count 81 transition count 59
Iterating global reduction 1 with 1 rules applied. Total rules applied 128 place count 81 transition count 59
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 129 place count 80 transition count 58
Iterating global reduction 1 with 1 rules applied. Total rules applied 130 place count 80 transition count 58
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 131 place count 79 transition count 57
Iterating global reduction 1 with 1 rules applied. Total rules applied 132 place count 79 transition count 57
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 133 place count 78 transition count 56
Iterating global reduction 1 with 1 rules applied. Total rules applied 134 place count 78 transition count 56
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 135 place count 77 transition count 55
Iterating global reduction 1 with 1 rules applied. Total rules applied 136 place count 77 transition count 55
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 137 place count 76 transition count 54
Iterating global reduction 1 with 1 rules applied. Total rules applied 138 place count 76 transition count 54
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 139 place count 75 transition count 53
Iterating global reduction 1 with 1 rules applied. Total rules applied 140 place count 75 transition count 53
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 141 place count 74 transition count 52
Iterating global reduction 1 with 1 rules applied. Total rules applied 142 place count 74 transition count 52
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 143 place count 73 transition count 51
Iterating global reduction 1 with 1 rules applied. Total rules applied 144 place count 73 transition count 51
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 146 place count 73 transition count 49
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 147 place count 72 transition count 48
Reduce places removed 24 places and 0 transitions.
Drop transitions removed 44 transitions
Trivial Post-agglo rules discarded 44 transitions
Performed 44 trivial Post agglomeration. Transition count delta: 44
Iterating post reduction 2 with 68 rules applied. Total rules applied 215 place count 48 transition count 4
Reduce places removed 44 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 45 rules applied. Total rules applied 260 place count 4 transition count 3
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 261 place count 3 transition count 3
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 261 place count 3 transition count 2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 263 place count 2 transition count 2
Applied a total of 263 rules in 29 ms. Remains 2 /145 variables (removed 143) and now considering 2/123 (removed 121) transitions.
Finished structural reductions, in 1 iterations. Remains : 2/145 places, 2/123 transitions.
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Incomplete random walk after 10000 steps, including 355 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2400967 steps, run timeout after 3001 ms. (steps per millisecond=800 ) properties seen :{}
Probabilistic random walk after 2400967 steps, saw 306210 distinct states, run finished after 3001 ms. (steps per millisecond=800 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 123 rows 145 cols
[2022-05-17 07:44:49] [INFO ] Computed 25 place invariants in 1 ms
[2022-05-17 07:44:49] [INFO ] [Real]Absence check using 25 positive place invariants in 6 ms returned sat
[2022-05-17 07:44:49] [INFO ] After 46ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-05-17 07:44:49] [INFO ] State equation strengthened by 25 read => feed constraints.
[2022-05-17 07:44:49] [INFO ] After 10ms SMT Verify possible using 25 Read/Feed constraints in real domain returned unsat :0 sat :1
[2022-05-17 07:44:49] [INFO ] After 18ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 8 ms.
[2022-05-17 07:44:49] [INFO ] After 130ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 145 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 145/145 places, 123/123 transitions.
Free-agglomeration rule applied 48 times.
Iterating global reduction 0 with 48 rules applied. Total rules applied 48 place count 145 transition count 75
Reduce places removed 48 places and 0 transitions.
Iterating post reduction 0 with 48 rules applied. Total rules applied 96 place count 97 transition count 75
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 97 place count 96 transition count 74
Iterating global reduction 1 with 1 rules applied. Total rules applied 98 place count 96 transition count 74
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 99 place count 95 transition count 73
Iterating global reduction 1 with 1 rules applied. Total rules applied 100 place count 95 transition count 73
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 101 place count 94 transition count 72
Iterating global reduction 1 with 1 rules applied. Total rules applied 102 place count 94 transition count 72
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 103 place count 93 transition count 71
Iterating global reduction 1 with 1 rules applied. Total rules applied 104 place count 93 transition count 71
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 105 place count 92 transition count 70
Iterating global reduction 1 with 1 rules applied. Total rules applied 106 place count 92 transition count 70
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 107 place count 91 transition count 69
Iterating global reduction 1 with 1 rules applied. Total rules applied 108 place count 91 transition count 69
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 109 place count 90 transition count 68
Iterating global reduction 1 with 1 rules applied. Total rules applied 110 place count 90 transition count 68
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 111 place count 89 transition count 67
Iterating global reduction 1 with 1 rules applied. Total rules applied 112 place count 89 transition count 67
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 113 place count 88 transition count 66
Iterating global reduction 1 with 1 rules applied. Total rules applied 114 place count 88 transition count 66
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 115 place count 87 transition count 65
Iterating global reduction 1 with 1 rules applied. Total rules applied 116 place count 87 transition count 65
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 117 place count 86 transition count 64
Iterating global reduction 1 with 1 rules applied. Total rules applied 118 place count 86 transition count 64
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 119 place count 85 transition count 63
Iterating global reduction 1 with 1 rules applied. Total rules applied 120 place count 85 transition count 63
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 121 place count 84 transition count 62
Iterating global reduction 1 with 1 rules applied. Total rules applied 122 place count 84 transition count 62
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 123 place count 83 transition count 61
Iterating global reduction 1 with 1 rules applied. Total rules applied 124 place count 83 transition count 61
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 125 place count 82 transition count 60
Iterating global reduction 1 with 1 rules applied. Total rules applied 126 place count 82 transition count 60
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 127 place count 81 transition count 59
Iterating global reduction 1 with 1 rules applied. Total rules applied 128 place count 81 transition count 59
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 129 place count 80 transition count 58
Iterating global reduction 1 with 1 rules applied. Total rules applied 130 place count 80 transition count 58
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 131 place count 79 transition count 57
Iterating global reduction 1 with 1 rules applied. Total rules applied 132 place count 79 transition count 57
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 133 place count 78 transition count 56
Iterating global reduction 1 with 1 rules applied. Total rules applied 134 place count 78 transition count 56
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 135 place count 77 transition count 55
Iterating global reduction 1 with 1 rules applied. Total rules applied 136 place count 77 transition count 55
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 137 place count 76 transition count 54
Iterating global reduction 1 with 1 rules applied. Total rules applied 138 place count 76 transition count 54
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 139 place count 75 transition count 53
Iterating global reduction 1 with 1 rules applied. Total rules applied 140 place count 75 transition count 53
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 141 place count 74 transition count 52
Iterating global reduction 1 with 1 rules applied. Total rules applied 142 place count 74 transition count 52
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 143 place count 73 transition count 51
Iterating global reduction 1 with 1 rules applied. Total rules applied 144 place count 73 transition count 51
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 146 place count 73 transition count 49
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 147 place count 72 transition count 48
Reduce places removed 24 places and 0 transitions.
Drop transitions removed 44 transitions
Trivial Post-agglo rules discarded 44 transitions
Performed 44 trivial Post agglomeration. Transition count delta: 44
Iterating post reduction 2 with 68 rules applied. Total rules applied 215 place count 48 transition count 4
Reduce places removed 44 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 45 rules applied. Total rules applied 260 place count 4 transition count 3
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 261 place count 3 transition count 3
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 261 place count 3 transition count 2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 263 place count 2 transition count 2
Applied a total of 263 rules in 20 ms. Remains 2 /145 variables (removed 143) and now considering 2/123 (removed 121) transitions.
Finished structural reductions, in 1 iterations. Remains : 2/145 places, 2/123 transitions.
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Incomplete random walk after 10000 steps, including 357 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 3094820 steps, run timeout after 3001 ms. (steps per millisecond=1031 ) properties seen :{}
Probabilistic random walk after 3094820 steps, saw 395198 distinct states, run finished after 3001 ms. (steps per millisecond=1031 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 123 rows 145 cols
[2022-05-17 07:44:52] [INFO ] Computed 25 place invariants in 1 ms
[2022-05-17 07:44:52] [INFO ] [Real]Absence check using 25 positive place invariants in 6 ms returned sat
[2022-05-17 07:44:52] [INFO ] After 50ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-05-17 07:44:52] [INFO ] State equation strengthened by 25 read => feed constraints.
[2022-05-17 07:44:52] [INFO ] After 10ms SMT Verify possible using 25 Read/Feed constraints in real domain returned unsat :0 sat :1
[2022-05-17 07:44:52] [INFO ] After 19ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 6 ms.
[2022-05-17 07:44:53] [INFO ] After 134ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 145 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 145/145 places, 123/123 transitions.
Free-agglomeration rule applied 48 times.
Iterating global reduction 0 with 48 rules applied. Total rules applied 48 place count 145 transition count 75
Reduce places removed 48 places and 0 transitions.
Iterating post reduction 0 with 48 rules applied. Total rules applied 96 place count 97 transition count 75
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 97 place count 96 transition count 74
Iterating global reduction 1 with 1 rules applied. Total rules applied 98 place count 96 transition count 74
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 99 place count 95 transition count 73
Iterating global reduction 1 with 1 rules applied. Total rules applied 100 place count 95 transition count 73
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 101 place count 94 transition count 72
Iterating global reduction 1 with 1 rules applied. Total rules applied 102 place count 94 transition count 72
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 103 place count 93 transition count 71
Iterating global reduction 1 with 1 rules applied. Total rules applied 104 place count 93 transition count 71
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 105 place count 92 transition count 70
Iterating global reduction 1 with 1 rules applied. Total rules applied 106 place count 92 transition count 70
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 107 place count 91 transition count 69
Iterating global reduction 1 with 1 rules applied. Total rules applied 108 place count 91 transition count 69
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 109 place count 90 transition count 68
Iterating global reduction 1 with 1 rules applied. Total rules applied 110 place count 90 transition count 68
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 111 place count 89 transition count 67
Iterating global reduction 1 with 1 rules applied. Total rules applied 112 place count 89 transition count 67
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 113 place count 88 transition count 66
Iterating global reduction 1 with 1 rules applied. Total rules applied 114 place count 88 transition count 66
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 115 place count 87 transition count 65
Iterating global reduction 1 with 1 rules applied. Total rules applied 116 place count 87 transition count 65
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 117 place count 86 transition count 64
Iterating global reduction 1 with 1 rules applied. Total rules applied 118 place count 86 transition count 64
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 119 place count 85 transition count 63
Iterating global reduction 1 with 1 rules applied. Total rules applied 120 place count 85 transition count 63
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 121 place count 84 transition count 62
Iterating global reduction 1 with 1 rules applied. Total rules applied 122 place count 84 transition count 62
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 123 place count 83 transition count 61
Iterating global reduction 1 with 1 rules applied. Total rules applied 124 place count 83 transition count 61
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 125 place count 82 transition count 60
Iterating global reduction 1 with 1 rules applied. Total rules applied 126 place count 82 transition count 60
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 127 place count 81 transition count 59
Iterating global reduction 1 with 1 rules applied. Total rules applied 128 place count 81 transition count 59
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 129 place count 80 transition count 58
Iterating global reduction 1 with 1 rules applied. Total rules applied 130 place count 80 transition count 58
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 131 place count 79 transition count 57
Iterating global reduction 1 with 1 rules applied. Total rules applied 132 place count 79 transition count 57
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 133 place count 78 transition count 56
Iterating global reduction 1 with 1 rules applied. Total rules applied 134 place count 78 transition count 56
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 135 place count 77 transition count 55
Iterating global reduction 1 with 1 rules applied. Total rules applied 136 place count 77 transition count 55
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 137 place count 76 transition count 54
Iterating global reduction 1 with 1 rules applied. Total rules applied 138 place count 76 transition count 54
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 139 place count 75 transition count 53
Iterating global reduction 1 with 1 rules applied. Total rules applied 140 place count 75 transition count 53
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 141 place count 74 transition count 52
Iterating global reduction 1 with 1 rules applied. Total rules applied 142 place count 74 transition count 52
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 143 place count 73 transition count 51
Iterating global reduction 1 with 1 rules applied. Total rules applied 144 place count 73 transition count 51
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 146 place count 73 transition count 49
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 147 place count 72 transition count 48
Reduce places removed 24 places and 0 transitions.
Drop transitions removed 44 transitions
Trivial Post-agglo rules discarded 44 transitions
Performed 44 trivial Post agglomeration. Transition count delta: 44
Iterating post reduction 2 with 68 rules applied. Total rules applied 215 place count 48 transition count 4
Reduce places removed 44 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 45 rules applied. Total rules applied 260 place count 4 transition count 3
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 261 place count 3 transition count 3
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 261 place count 3 transition count 2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 263 place count 2 transition count 2
Applied a total of 263 rules in 15 ms. Remains 2 /145 variables (removed 143) and now considering 2/123 (removed 121) transitions.
Finished structural reductions, in 1 iterations. Remains : 2/145 places, 2/123 transitions.
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Incomplete random walk after 10000 steps, including 358 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 3379760 steps, run timeout after 3001 ms. (steps per millisecond=1126 ) properties seen :{}
Probabilistic random walk after 3379760 steps, saw 430260 distinct states, run finished after 3001 ms. (steps per millisecond=1126 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 123 rows 145 cols
[2022-05-17 07:44:56] [INFO ] Computed 25 place invariants in 1 ms
[2022-05-17 07:44:56] [INFO ] [Real]Absence check using 25 positive place invariants in 5 ms returned sat
[2022-05-17 07:44:56] [INFO ] After 44ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-05-17 07:44:56] [INFO ] State equation strengthened by 25 read => feed constraints.
[2022-05-17 07:44:56] [INFO ] After 10ms SMT Verify possible using 25 Read/Feed constraints in real domain returned unsat :0 sat :1
[2022-05-17 07:44:56] [INFO ] After 19ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 6 ms.
[2022-05-17 07:44:56] [INFO ] After 122ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 145 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 145/145 places, 123/123 transitions.
Free-agglomeration rule applied 48 times.
Iterating global reduction 0 with 48 rules applied. Total rules applied 48 place count 145 transition count 75
Reduce places removed 48 places and 0 transitions.
Iterating post reduction 0 with 48 rules applied. Total rules applied 96 place count 97 transition count 75
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 97 place count 96 transition count 74
Iterating global reduction 1 with 1 rules applied. Total rules applied 98 place count 96 transition count 74
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 99 place count 95 transition count 73
Iterating global reduction 1 with 1 rules applied. Total rules applied 100 place count 95 transition count 73
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 101 place count 94 transition count 72
Iterating global reduction 1 with 1 rules applied. Total rules applied 102 place count 94 transition count 72
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 103 place count 93 transition count 71
Iterating global reduction 1 with 1 rules applied. Total rules applied 104 place count 93 transition count 71
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 105 place count 92 transition count 70
Iterating global reduction 1 with 1 rules applied. Total rules applied 106 place count 92 transition count 70
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 107 place count 91 transition count 69
Iterating global reduction 1 with 1 rules applied. Total rules applied 108 place count 91 transition count 69
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 109 place count 90 transition count 68
Iterating global reduction 1 with 1 rules applied. Total rules applied 110 place count 90 transition count 68
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 111 place count 89 transition count 67
Iterating global reduction 1 with 1 rules applied. Total rules applied 112 place count 89 transition count 67
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 113 place count 88 transition count 66
Iterating global reduction 1 with 1 rules applied. Total rules applied 114 place count 88 transition count 66
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 115 place count 87 transition count 65
Iterating global reduction 1 with 1 rules applied. Total rules applied 116 place count 87 transition count 65
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 117 place count 86 transition count 64
Iterating global reduction 1 with 1 rules applied. Total rules applied 118 place count 86 transition count 64
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 119 place count 85 transition count 63
Iterating global reduction 1 with 1 rules applied. Total rules applied 120 place count 85 transition count 63
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 121 place count 84 transition count 62
Iterating global reduction 1 with 1 rules applied. Total rules applied 122 place count 84 transition count 62
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 123 place count 83 transition count 61
Iterating global reduction 1 with 1 rules applied. Total rules applied 124 place count 83 transition count 61
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 125 place count 82 transition count 60
Iterating global reduction 1 with 1 rules applied. Total rules applied 126 place count 82 transition count 60
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 127 place count 81 transition count 59
Iterating global reduction 1 with 1 rules applied. Total rules applied 128 place count 81 transition count 59
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 129 place count 80 transition count 58
Iterating global reduction 1 with 1 rules applied. Total rules applied 130 place count 80 transition count 58
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 131 place count 79 transition count 57
Iterating global reduction 1 with 1 rules applied. Total rules applied 132 place count 79 transition count 57
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 133 place count 78 transition count 56
Iterating global reduction 1 with 1 rules applied. Total rules applied 134 place count 78 transition count 56
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 135 place count 77 transition count 55
Iterating global reduction 1 with 1 rules applied. Total rules applied 136 place count 77 transition count 55
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 137 place count 76 transition count 54
Iterating global reduction 1 with 1 rules applied. Total rules applied 138 place count 76 transition count 54
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 139 place count 75 transition count 53
Iterating global reduction 1 with 1 rules applied. Total rules applied 140 place count 75 transition count 53
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 141 place count 74 transition count 52
Iterating global reduction 1 with 1 rules applied. Total rules applied 142 place count 74 transition count 52
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 143 place count 73 transition count 51
Iterating global reduction 1 with 1 rules applied. Total rules applied 144 place count 73 transition count 51
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 146 place count 73 transition count 49
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 147 place count 72 transition count 48
Reduce places removed 24 places and 0 transitions.
Drop transitions removed 44 transitions
Trivial Post-agglo rules discarded 44 transitions
Performed 44 trivial Post agglomeration. Transition count delta: 44
Iterating post reduction 2 with 68 rules applied. Total rules applied 215 place count 48 transition count 4
Reduce places removed 44 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 45 rules applied. Total rules applied 260 place count 4 transition count 3
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 261 place count 3 transition count 3
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 261 place count 3 transition count 2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 263 place count 2 transition count 2
Applied a total of 263 rules in 40 ms. Remains 2 /145 variables (removed 143) and now considering 2/123 (removed 121) transitions.
Finished structural reductions, in 1 iterations. Remains : 2/145 places, 2/123 transitions.
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Incomplete random walk after 10000 steps, including 356 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2619473 steps, run timeout after 3001 ms. (steps per millisecond=872 ) properties seen :{}
Probabilistic random walk after 2619473 steps, saw 332388 distinct states, run finished after 3001 ms. (steps per millisecond=872 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 123 rows 145 cols
[2022-05-17 07:44:59] [INFO ] Computed 25 place invariants in 1 ms
[2022-05-17 07:44:59] [INFO ] [Real]Absence check using 25 positive place invariants in 7 ms returned sat
[2022-05-17 07:44:59] [INFO ] After 46ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-05-17 07:44:59] [INFO ] State equation strengthened by 25 read => feed constraints.
[2022-05-17 07:44:59] [INFO ] After 11ms SMT Verify possible using 25 Read/Feed constraints in real domain returned unsat :0 sat :1
[2022-05-17 07:44:59] [INFO ] After 22ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 6 ms.
[2022-05-17 07:44:59] [INFO ] After 142ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 145 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 145/145 places, 123/123 transitions.
Free-agglomeration rule applied 48 times.
Iterating global reduction 0 with 48 rules applied. Total rules applied 48 place count 145 transition count 75
Reduce places removed 48 places and 0 transitions.
Iterating post reduction 0 with 48 rules applied. Total rules applied 96 place count 97 transition count 75
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 97 place count 96 transition count 74
Iterating global reduction 1 with 1 rules applied. Total rules applied 98 place count 96 transition count 74
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 99 place count 95 transition count 73
Iterating global reduction 1 with 1 rules applied. Total rules applied 100 place count 95 transition count 73
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 101 place count 94 transition count 72
Iterating global reduction 1 with 1 rules applied. Total rules applied 102 place count 94 transition count 72
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 103 place count 93 transition count 71
Iterating global reduction 1 with 1 rules applied. Total rules applied 104 place count 93 transition count 71
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 105 place count 92 transition count 70
Iterating global reduction 1 with 1 rules applied. Total rules applied 106 place count 92 transition count 70
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 107 place count 91 transition count 69
Iterating global reduction 1 with 1 rules applied. Total rules applied 108 place count 91 transition count 69
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 109 place count 90 transition count 68
Iterating global reduction 1 with 1 rules applied. Total rules applied 110 place count 90 transition count 68
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 111 place count 89 transition count 67
Iterating global reduction 1 with 1 rules applied. Total rules applied 112 place count 89 transition count 67
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 113 place count 88 transition count 66
Iterating global reduction 1 with 1 rules applied. Total rules applied 114 place count 88 transition count 66
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 115 place count 87 transition count 65
Iterating global reduction 1 with 1 rules applied. Total rules applied 116 place count 87 transition count 65
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 117 place count 86 transition count 64
Iterating global reduction 1 with 1 rules applied. Total rules applied 118 place count 86 transition count 64
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 119 place count 85 transition count 63
Iterating global reduction 1 with 1 rules applied. Total rules applied 120 place count 85 transition count 63
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 121 place count 84 transition count 62
Iterating global reduction 1 with 1 rules applied. Total rules applied 122 place count 84 transition count 62
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 123 place count 83 transition count 61
Iterating global reduction 1 with 1 rules applied. Total rules applied 124 place count 83 transition count 61
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 125 place count 82 transition count 60
Iterating global reduction 1 with 1 rules applied. Total rules applied 126 place count 82 transition count 60
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 127 place count 81 transition count 59
Iterating global reduction 1 with 1 rules applied. Total rules applied 128 place count 81 transition count 59
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 129 place count 80 transition count 58
Iterating global reduction 1 with 1 rules applied. Total rules applied 130 place count 80 transition count 58
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 131 place count 79 transition count 57
Iterating global reduction 1 with 1 rules applied. Total rules applied 132 place count 79 transition count 57
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 133 place count 78 transition count 56
Iterating global reduction 1 with 1 rules applied. Total rules applied 134 place count 78 transition count 56
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 135 place count 77 transition count 55
Iterating global reduction 1 with 1 rules applied. Total rules applied 136 place count 77 transition count 55
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 137 place count 76 transition count 54
Iterating global reduction 1 with 1 rules applied. Total rules applied 138 place count 76 transition count 54
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 139 place count 75 transition count 53
Iterating global reduction 1 with 1 rules applied. Total rules applied 140 place count 75 transition count 53
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 141 place count 74 transition count 52
Iterating global reduction 1 with 1 rules applied. Total rules applied 142 place count 74 transition count 52
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 143 place count 73 transition count 51
Iterating global reduction 1 with 1 rules applied. Total rules applied 144 place count 73 transition count 51
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 146 place count 73 transition count 49
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 147 place count 72 transition count 48
Reduce places removed 24 places and 0 transitions.
Drop transitions removed 44 transitions
Trivial Post-agglo rules discarded 44 transitions
Performed 44 trivial Post agglomeration. Transition count delta: 44
Iterating post reduction 2 with 68 rules applied. Total rules applied 215 place count 48 transition count 4
Reduce places removed 44 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 45 rules applied. Total rules applied 260 place count 4 transition count 3
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 261 place count 3 transition count 3
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 261 place count 3 transition count 2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 263 place count 2 transition count 2
Applied a total of 263 rules in 22 ms. Remains 2 /145 variables (removed 143) and now considering 2/123 (removed 121) transitions.
Finished structural reductions, in 1 iterations. Remains : 2/145 places, 2/123 transitions.
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Incomplete random walk after 10000 steps, including 358 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2969463 steps, run timeout after 3001 ms. (steps per millisecond=989 ) properties seen :{}
Probabilistic random walk after 2969463 steps, saw 377340 distinct states, run finished after 3001 ms. (steps per millisecond=989 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 123 rows 145 cols
[2022-05-17 07:45:02] [INFO ] Computed 25 place invariants in 1 ms
[2022-05-17 07:45:02] [INFO ] [Real]Absence check using 25 positive place invariants in 6 ms returned sat
[2022-05-17 07:45:02] [INFO ] After 47ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-05-17 07:45:02] [INFO ] State equation strengthened by 25 read => feed constraints.
[2022-05-17 07:45:02] [INFO ] After 12ms SMT Verify possible using 25 Read/Feed constraints in real domain returned unsat :0 sat :1
[2022-05-17 07:45:02] [INFO ] After 22ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 6 ms.
[2022-05-17 07:45:02] [INFO ] After 142ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 145 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 145/145 places, 123/123 transitions.
Free-agglomeration rule applied 48 times.
Iterating global reduction 0 with 48 rules applied. Total rules applied 48 place count 145 transition count 75
Reduce places removed 48 places and 0 transitions.
Iterating post reduction 0 with 48 rules applied. Total rules applied 96 place count 97 transition count 75
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 97 place count 96 transition count 74
Iterating global reduction 1 with 1 rules applied. Total rules applied 98 place count 96 transition count 74
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 99 place count 95 transition count 73
Iterating global reduction 1 with 1 rules applied. Total rules applied 100 place count 95 transition count 73
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 101 place count 94 transition count 72
Iterating global reduction 1 with 1 rules applied. Total rules applied 102 place count 94 transition count 72
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 103 place count 93 transition count 71
Iterating global reduction 1 with 1 rules applied. Total rules applied 104 place count 93 transition count 71
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 105 place count 92 transition count 70
Iterating global reduction 1 with 1 rules applied. Total rules applied 106 place count 92 transition count 70
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 107 place count 91 transition count 69
Iterating global reduction 1 with 1 rules applied. Total rules applied 108 place count 91 transition count 69
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 109 place count 90 transition count 68
Iterating global reduction 1 with 1 rules applied. Total rules applied 110 place count 90 transition count 68
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 111 place count 89 transition count 67
Iterating global reduction 1 with 1 rules applied. Total rules applied 112 place count 89 transition count 67
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 113 place count 88 transition count 66
Iterating global reduction 1 with 1 rules applied. Total rules applied 114 place count 88 transition count 66
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 115 place count 87 transition count 65
Iterating global reduction 1 with 1 rules applied. Total rules applied 116 place count 87 transition count 65
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 117 place count 86 transition count 64
Iterating global reduction 1 with 1 rules applied. Total rules applied 118 place count 86 transition count 64
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 119 place count 85 transition count 63
Iterating global reduction 1 with 1 rules applied. Total rules applied 120 place count 85 transition count 63
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 121 place count 84 transition count 62
Iterating global reduction 1 with 1 rules applied. Total rules applied 122 place count 84 transition count 62
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 123 place count 83 transition count 61
Iterating global reduction 1 with 1 rules applied. Total rules applied 124 place count 83 transition count 61
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 125 place count 82 transition count 60
Iterating global reduction 1 with 1 rules applied. Total rules applied 126 place count 82 transition count 60
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 127 place count 81 transition count 59
Iterating global reduction 1 with 1 rules applied. Total rules applied 128 place count 81 transition count 59
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 129 place count 80 transition count 58
Iterating global reduction 1 with 1 rules applied. Total rules applied 130 place count 80 transition count 58
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 131 place count 79 transition count 57
Iterating global reduction 1 with 1 rules applied. Total rules applied 132 place count 79 transition count 57
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 133 place count 78 transition count 56
Iterating global reduction 1 with 1 rules applied. Total rules applied 134 place count 78 transition count 56
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 135 place count 77 transition count 55
Iterating global reduction 1 with 1 rules applied. Total rules applied 136 place count 77 transition count 55
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 137 place count 76 transition count 54
Iterating global reduction 1 with 1 rules applied. Total rules applied 138 place count 76 transition count 54
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 139 place count 75 transition count 53
Iterating global reduction 1 with 1 rules applied. Total rules applied 140 place count 75 transition count 53
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 141 place count 74 transition count 52
Iterating global reduction 1 with 1 rules applied. Total rules applied 142 place count 74 transition count 52
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 143 place count 73 transition count 51
Iterating global reduction 1 with 1 rules applied. Total rules applied 144 place count 73 transition count 51
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 146 place count 73 transition count 49
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 147 place count 72 transition count 48
Reduce places removed 24 places and 0 transitions.
Drop transitions removed 44 transitions
Trivial Post-agglo rules discarded 44 transitions
Performed 44 trivial Post agglomeration. Transition count delta: 44
Iterating post reduction 2 with 68 rules applied. Total rules applied 215 place count 48 transition count 4
Reduce places removed 44 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 45 rules applied. Total rules applied 260 place count 4 transition count 3
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 261 place count 3 transition count 3
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 261 place count 3 transition count 2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 263 place count 2 transition count 2
Applied a total of 263 rules in 23 ms. Remains 2 /145 variables (removed 143) and now considering 2/123 (removed 121) transitions.
Finished structural reductions, in 1 iterations. Remains : 2/145 places, 2/123 transitions.
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Incomplete random walk after 10000 steps, including 355 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 3256510 steps, run timeout after 3001 ms. (steps per millisecond=1085 ) properties seen :{}
Probabilistic random walk after 3256510 steps, saw 416842 distinct states, run finished after 3013 ms. (steps per millisecond=1080 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 123 rows 145 cols
[2022-05-17 07:45:05] [INFO ] Computed 25 place invariants in 3 ms
[2022-05-17 07:45:05] [INFO ] [Real]Absence check using 25 positive place invariants in 6 ms returned sat
[2022-05-17 07:45:05] [INFO ] After 46ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-05-17 07:45:05] [INFO ] State equation strengthened by 25 read => feed constraints.
[2022-05-17 07:45:05] [INFO ] After 11ms SMT Verify possible using 25 Read/Feed constraints in real domain returned unsat :0 sat :1
[2022-05-17 07:45:05] [INFO ] After 19ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 5 ms.
[2022-05-17 07:45:05] [INFO ] After 160ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 145 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 145/145 places, 123/123 transitions.
Free-agglomeration rule applied 48 times.
Iterating global reduction 0 with 48 rules applied. Total rules applied 48 place count 145 transition count 75
Reduce places removed 48 places and 0 transitions.
Iterating post reduction 0 with 48 rules applied. Total rules applied 96 place count 97 transition count 75
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 97 place count 96 transition count 74
Iterating global reduction 1 with 1 rules applied. Total rules applied 98 place count 96 transition count 74
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 99 place count 95 transition count 73
Iterating global reduction 1 with 1 rules applied. Total rules applied 100 place count 95 transition count 73
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 101 place count 94 transition count 72
Iterating global reduction 1 with 1 rules applied. Total rules applied 102 place count 94 transition count 72
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 103 place count 93 transition count 71
Iterating global reduction 1 with 1 rules applied. Total rules applied 104 place count 93 transition count 71
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 105 place count 92 transition count 70
Iterating global reduction 1 with 1 rules applied. Total rules applied 106 place count 92 transition count 70
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 107 place count 91 transition count 69
Iterating global reduction 1 with 1 rules applied. Total rules applied 108 place count 91 transition count 69
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 109 place count 90 transition count 68
Iterating global reduction 1 with 1 rules applied. Total rules applied 110 place count 90 transition count 68
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 111 place count 89 transition count 67
Iterating global reduction 1 with 1 rules applied. Total rules applied 112 place count 89 transition count 67
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 113 place count 88 transition count 66
Iterating global reduction 1 with 1 rules applied. Total rules applied 114 place count 88 transition count 66
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 115 place count 87 transition count 65
Iterating global reduction 1 with 1 rules applied. Total rules applied 116 place count 87 transition count 65
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 117 place count 86 transition count 64
Iterating global reduction 1 with 1 rules applied. Total rules applied 118 place count 86 transition count 64
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 119 place count 85 transition count 63
Iterating global reduction 1 with 1 rules applied. Total rules applied 120 place count 85 transition count 63
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 121 place count 84 transition count 62
Iterating global reduction 1 with 1 rules applied. Total rules applied 122 place count 84 transition count 62
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 123 place count 83 transition count 61
Iterating global reduction 1 with 1 rules applied. Total rules applied 124 place count 83 transition count 61
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 125 place count 82 transition count 60
Iterating global reduction 1 with 1 rules applied. Total rules applied 126 place count 82 transition count 60
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 127 place count 81 transition count 59
Iterating global reduction 1 with 1 rules applied. Total rules applied 128 place count 81 transition count 59
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 129 place count 80 transition count 58
Iterating global reduction 1 with 1 rules applied. Total rules applied 130 place count 80 transition count 58
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 131 place count 79 transition count 57
Iterating global reduction 1 with 1 rules applied. Total rules applied 132 place count 79 transition count 57
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 133 place count 78 transition count 56
Iterating global reduction 1 with 1 rules applied. Total rules applied 134 place count 78 transition count 56
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 135 place count 77 transition count 55
Iterating global reduction 1 with 1 rules applied. Total rules applied 136 place count 77 transition count 55
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 137 place count 76 transition count 54
Iterating global reduction 1 with 1 rules applied. Total rules applied 138 place count 76 transition count 54
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 139 place count 75 transition count 53
Iterating global reduction 1 with 1 rules applied. Total rules applied 140 place count 75 transition count 53
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 141 place count 74 transition count 52
Iterating global reduction 1 with 1 rules applied. Total rules applied 142 place count 74 transition count 52
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 143 place count 73 transition count 51
Iterating global reduction 1 with 1 rules applied. Total rules applied 144 place count 73 transition count 51
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 146 place count 73 transition count 49
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 147 place count 72 transition count 48
Reduce places removed 24 places and 0 transitions.
Drop transitions removed 44 transitions
Trivial Post-agglo rules discarded 44 transitions
Performed 44 trivial Post agglomeration. Transition count delta: 44
Iterating post reduction 2 with 68 rules applied. Total rules applied 215 place count 48 transition count 4
Reduce places removed 44 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 45 rules applied. Total rules applied 260 place count 4 transition count 3
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 261 place count 3 transition count 3
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 261 place count 3 transition count 2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 263 place count 2 transition count 2
Applied a total of 263 rules in 29 ms. Remains 2 /145 variables (removed 143) and now considering 2/123 (removed 121) transitions.
Finished structural reductions, in 1 iterations. Remains : 2/145 places, 2/123 transitions.
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Incomplete random walk after 10000 steps, including 357 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 3055659 steps, run timeout after 3001 ms. (steps per millisecond=1018 ) properties seen :{}
Probabilistic random walk after 3055659 steps, saw 389648 distinct states, run finished after 3001 ms. (steps per millisecond=1018 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 123 rows 145 cols
[2022-05-17 07:45:08] [INFO ] Computed 25 place invariants in 1 ms
[2022-05-17 07:45:08] [INFO ] [Real]Absence check using 25 positive place invariants in 7 ms returned sat
[2022-05-17 07:45:09] [INFO ] After 57ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-05-17 07:45:09] [INFO ] State equation strengthened by 25 read => feed constraints.
[2022-05-17 07:45:09] [INFO ] After 12ms SMT Verify possible using 25 Read/Feed constraints in real domain returned unsat :0 sat :1
[2022-05-17 07:45:09] [INFO ] After 22ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 6 ms.
[2022-05-17 07:45:09] [INFO ] After 176ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 145 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 145/145 places, 123/123 transitions.
Free-agglomeration rule applied 48 times.
Iterating global reduction 0 with 48 rules applied. Total rules applied 48 place count 145 transition count 75
Reduce places removed 48 places and 0 transitions.
Iterating post reduction 0 with 48 rules applied. Total rules applied 96 place count 97 transition count 75
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 97 place count 96 transition count 74
Iterating global reduction 1 with 1 rules applied. Total rules applied 98 place count 96 transition count 74
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 99 place count 95 transition count 73
Iterating global reduction 1 with 1 rules applied. Total rules applied 100 place count 95 transition count 73
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 101 place count 94 transition count 72
Iterating global reduction 1 with 1 rules applied. Total rules applied 102 place count 94 transition count 72
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 103 place count 93 transition count 71
Iterating global reduction 1 with 1 rules applied. Total rules applied 104 place count 93 transition count 71
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 105 place count 92 transition count 70
Iterating global reduction 1 with 1 rules applied. Total rules applied 106 place count 92 transition count 70
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 107 place count 91 transition count 69
Iterating global reduction 1 with 1 rules applied. Total rules applied 108 place count 91 transition count 69
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 109 place count 90 transition count 68
Iterating global reduction 1 with 1 rules applied. Total rules applied 110 place count 90 transition count 68
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 111 place count 89 transition count 67
Iterating global reduction 1 with 1 rules applied. Total rules applied 112 place count 89 transition count 67
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 113 place count 88 transition count 66
Iterating global reduction 1 with 1 rules applied. Total rules applied 114 place count 88 transition count 66
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 115 place count 87 transition count 65
Iterating global reduction 1 with 1 rules applied. Total rules applied 116 place count 87 transition count 65
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 117 place count 86 transition count 64
Iterating global reduction 1 with 1 rules applied. Total rules applied 118 place count 86 transition count 64
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 119 place count 85 transition count 63
Iterating global reduction 1 with 1 rules applied. Total rules applied 120 place count 85 transition count 63
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 121 place count 84 transition count 62
Iterating global reduction 1 with 1 rules applied. Total rules applied 122 place count 84 transition count 62
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 123 place count 83 transition count 61
Iterating global reduction 1 with 1 rules applied. Total rules applied 124 place count 83 transition count 61
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 125 place count 82 transition count 60
Iterating global reduction 1 with 1 rules applied. Total rules applied 126 place count 82 transition count 60
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 127 place count 81 transition count 59
Iterating global reduction 1 with 1 rules applied. Total rules applied 128 place count 81 transition count 59
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 129 place count 80 transition count 58
Iterating global reduction 1 with 1 rules applied. Total rules applied 130 place count 80 transition count 58
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 131 place count 79 transition count 57
Iterating global reduction 1 with 1 rules applied. Total rules applied 132 place count 79 transition count 57
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 133 place count 78 transition count 56
Iterating global reduction 1 with 1 rules applied. Total rules applied 134 place count 78 transition count 56
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 135 place count 77 transition count 55
Iterating global reduction 1 with 1 rules applied. Total rules applied 136 place count 77 transition count 55
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 137 place count 76 transition count 54
Iterating global reduction 1 with 1 rules applied. Total rules applied 138 place count 76 transition count 54
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 139 place count 75 transition count 53
Iterating global reduction 1 with 1 rules applied. Total rules applied 140 place count 75 transition count 53
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 141 place count 74 transition count 52
Iterating global reduction 1 with 1 rules applied. Total rules applied 142 place count 74 transition count 52
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 143 place count 73 transition count 51
Iterating global reduction 1 with 1 rules applied. Total rules applied 144 place count 73 transition count 51
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 146 place count 73 transition count 49
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 147 place count 72 transition count 48
Reduce places removed 24 places and 0 transitions.
Drop transitions removed 44 transitions
Trivial Post-agglo rules discarded 44 transitions
Performed 44 trivial Post agglomeration. Transition count delta: 44
Iterating post reduction 2 with 68 rules applied. Total rules applied 215 place count 48 transition count 4
Reduce places removed 44 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 45 rules applied. Total rules applied 260 place count 4 transition count 3
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 261 place count 3 transition count 3
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 261 place count 3 transition count 2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 263 place count 2 transition count 2
Applied a total of 263 rules in 27 ms. Remains 2 /145 variables (removed 143) and now considering 2/123 (removed 121) transitions.
Finished structural reductions, in 1 iterations. Remains : 2/145 places, 2/123 transitions.
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Incomplete random walk after 10000 steps, including 355 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2615784 steps, run timeout after 3001 ms. (steps per millisecond=871 ) properties seen :{}
Probabilistic random walk after 2615784 steps, saw 332030 distinct states, run finished after 3001 ms. (steps per millisecond=871 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 123 rows 145 cols
[2022-05-17 07:45:12] [INFO ] Computed 25 place invariants in 1 ms
[2022-05-17 07:45:12] [INFO ] [Real]Absence check using 25 positive place invariants in 7 ms returned sat
[2022-05-17 07:45:12] [INFO ] After 54ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-05-17 07:45:12] [INFO ] State equation strengthened by 25 read => feed constraints.
[2022-05-17 07:45:12] [INFO ] After 13ms SMT Verify possible using 25 Read/Feed constraints in real domain returned unsat :0 sat :1
[2022-05-17 07:45:12] [INFO ] After 36ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 6 ms.
[2022-05-17 07:45:12] [INFO ] After 163ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 145 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 145/145 places, 123/123 transitions.
Free-agglomeration rule applied 48 times.
Iterating global reduction 0 with 48 rules applied. Total rules applied 48 place count 145 transition count 75
Reduce places removed 48 places and 0 transitions.
Iterating post reduction 0 with 48 rules applied. Total rules applied 96 place count 97 transition count 75
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 97 place count 96 transition count 74
Iterating global reduction 1 with 1 rules applied. Total rules applied 98 place count 96 transition count 74
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 99 place count 95 transition count 73
Iterating global reduction 1 with 1 rules applied. Total rules applied 100 place count 95 transition count 73
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 101 place count 94 transition count 72
Iterating global reduction 1 with 1 rules applied. Total rules applied 102 place count 94 transition count 72
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 103 place count 93 transition count 71
Iterating global reduction 1 with 1 rules applied. Total rules applied 104 place count 93 transition count 71
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 105 place count 92 transition count 70
Iterating global reduction 1 with 1 rules applied. Total rules applied 106 place count 92 transition count 70
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 107 place count 91 transition count 69
Iterating global reduction 1 with 1 rules applied. Total rules applied 108 place count 91 transition count 69
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 109 place count 90 transition count 68
Iterating global reduction 1 with 1 rules applied. Total rules applied 110 place count 90 transition count 68
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 111 place count 89 transition count 67
Iterating global reduction 1 with 1 rules applied. Total rules applied 112 place count 89 transition count 67
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 113 place count 88 transition count 66
Iterating global reduction 1 with 1 rules applied. Total rules applied 114 place count 88 transition count 66
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 115 place count 87 transition count 65
Iterating global reduction 1 with 1 rules applied. Total rules applied 116 place count 87 transition count 65
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 117 place count 86 transition count 64
Iterating global reduction 1 with 1 rules applied. Total rules applied 118 place count 86 transition count 64
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 119 place count 85 transition count 63
Iterating global reduction 1 with 1 rules applied. Total rules applied 120 place count 85 transition count 63
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 121 place count 84 transition count 62
Iterating global reduction 1 with 1 rules applied. Total rules applied 122 place count 84 transition count 62
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 123 place count 83 transition count 61
Iterating global reduction 1 with 1 rules applied. Total rules applied 124 place count 83 transition count 61
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 125 place count 82 transition count 60
Iterating global reduction 1 with 1 rules applied. Total rules applied 126 place count 82 transition count 60
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 127 place count 81 transition count 59
Iterating global reduction 1 with 1 rules applied. Total rules applied 128 place count 81 transition count 59
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 129 place count 80 transition count 58
Iterating global reduction 1 with 1 rules applied. Total rules applied 130 place count 80 transition count 58
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 131 place count 79 transition count 57
Iterating global reduction 1 with 1 rules applied. Total rules applied 132 place count 79 transition count 57
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 133 place count 78 transition count 56
Iterating global reduction 1 with 1 rules applied. Total rules applied 134 place count 78 transition count 56
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 135 place count 77 transition count 55
Iterating global reduction 1 with 1 rules applied. Total rules applied 136 place count 77 transition count 55
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 137 place count 76 transition count 54
Iterating global reduction 1 with 1 rules applied. Total rules applied 138 place count 76 transition count 54
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 139 place count 75 transition count 53
Iterating global reduction 1 with 1 rules applied. Total rules applied 140 place count 75 transition count 53
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 141 place count 74 transition count 52
Iterating global reduction 1 with 1 rules applied. Total rules applied 142 place count 74 transition count 52
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 143 place count 73 transition count 51
Iterating global reduction 1 with 1 rules applied. Total rules applied 144 place count 73 transition count 51
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 146 place count 73 transition count 49
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 147 place count 72 transition count 48
Reduce places removed 24 places and 0 transitions.
Drop transitions removed 44 transitions
Trivial Post-agglo rules discarded 44 transitions
Performed 44 trivial Post agglomeration. Transition count delta: 44
Iterating post reduction 2 with 68 rules applied. Total rules applied 215 place count 48 transition count 4
Reduce places removed 44 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 45 rules applied. Total rules applied 260 place count 4 transition count 3
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 261 place count 3 transition count 3
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 261 place count 3 transition count 2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 263 place count 2 transition count 2
Applied a total of 263 rules in 25 ms. Remains 2 /145 variables (removed 143) and now considering 2/123 (removed 121) transitions.
Finished structural reductions, in 1 iterations. Remains : 2/145 places, 2/123 transitions.
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Incomplete random walk after 10000 steps, including 357 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 3287784 steps, run timeout after 3001 ms. (steps per millisecond=1095 ) properties seen :{}
Probabilistic random walk after 3287784 steps, saw 420534 distinct states, run finished after 3001 ms. (steps per millisecond=1095 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 123 rows 145 cols
[2022-05-17 07:45:15] [INFO ] Computed 25 place invariants in 1 ms
[2022-05-17 07:45:15] [INFO ] [Real]Absence check using 25 positive place invariants in 6 ms returned sat
[2022-05-17 07:45:15] [INFO ] After 57ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-05-17 07:45:15] [INFO ] State equation strengthened by 25 read => feed constraints.
[2022-05-17 07:45:15] [INFO ] After 12ms SMT Verify possible using 25 Read/Feed constraints in real domain returned unsat :0 sat :1
[2022-05-17 07:45:15] [INFO ] After 24ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 8 ms.
[2022-05-17 07:45:15] [INFO ] After 157ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 145 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 145/145 places, 123/123 transitions.
Free-agglomeration rule applied 48 times.
Iterating global reduction 0 with 48 rules applied. Total rules applied 48 place count 145 transition count 75
Reduce places removed 48 places and 0 transitions.
Iterating post reduction 0 with 48 rules applied. Total rules applied 96 place count 97 transition count 75
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 97 place count 96 transition count 74
Iterating global reduction 1 with 1 rules applied. Total rules applied 98 place count 96 transition count 74
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 99 place count 95 transition count 73
Iterating global reduction 1 with 1 rules applied. Total rules applied 100 place count 95 transition count 73
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 101 place count 94 transition count 72
Iterating global reduction 1 with 1 rules applied. Total rules applied 102 place count 94 transition count 72
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 103 place count 93 transition count 71
Iterating global reduction 1 with 1 rules applied. Total rules applied 104 place count 93 transition count 71
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 105 place count 92 transition count 70
Iterating global reduction 1 with 1 rules applied. Total rules applied 106 place count 92 transition count 70
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 107 place count 91 transition count 69
Iterating global reduction 1 with 1 rules applied. Total rules applied 108 place count 91 transition count 69
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 109 place count 90 transition count 68
Iterating global reduction 1 with 1 rules applied. Total rules applied 110 place count 90 transition count 68
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 111 place count 89 transition count 67
Iterating global reduction 1 with 1 rules applied. Total rules applied 112 place count 89 transition count 67
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 113 place count 88 transition count 66
Iterating global reduction 1 with 1 rules applied. Total rules applied 114 place count 88 transition count 66
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 115 place count 87 transition count 65
Iterating global reduction 1 with 1 rules applied. Total rules applied 116 place count 87 transition count 65
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 117 place count 86 transition count 64
Iterating global reduction 1 with 1 rules applied. Total rules applied 118 place count 86 transition count 64
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 119 place count 85 transition count 63
Iterating global reduction 1 with 1 rules applied. Total rules applied 120 place count 85 transition count 63
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 121 place count 84 transition count 62
Iterating global reduction 1 with 1 rules applied. Total rules applied 122 place count 84 transition count 62
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 123 place count 83 transition count 61
Iterating global reduction 1 with 1 rules applied. Total rules applied 124 place count 83 transition count 61
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 125 place count 82 transition count 60
Iterating global reduction 1 with 1 rules applied. Total rules applied 126 place count 82 transition count 60
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 127 place count 81 transition count 59
Iterating global reduction 1 with 1 rules applied. Total rules applied 128 place count 81 transition count 59
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 129 place count 80 transition count 58
Iterating global reduction 1 with 1 rules applied. Total rules applied 130 place count 80 transition count 58
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 131 place count 79 transition count 57
Iterating global reduction 1 with 1 rules applied. Total rules applied 132 place count 79 transition count 57
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 133 place count 78 transition count 56
Iterating global reduction 1 with 1 rules applied. Total rules applied 134 place count 78 transition count 56
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 135 place count 77 transition count 55
Iterating global reduction 1 with 1 rules applied. Total rules applied 136 place count 77 transition count 55
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 137 place count 76 transition count 54
Iterating global reduction 1 with 1 rules applied. Total rules applied 138 place count 76 transition count 54
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 139 place count 75 transition count 53
Iterating global reduction 1 with 1 rules applied. Total rules applied 140 place count 75 transition count 53
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 141 place count 74 transition count 52
Iterating global reduction 1 with 1 rules applied. Total rules applied 142 place count 74 transition count 52
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 143 place count 73 transition count 51
Iterating global reduction 1 with 1 rules applied. Total rules applied 144 place count 73 transition count 51
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 146 place count 73 transition count 49
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 147 place count 72 transition count 48
Reduce places removed 24 places and 0 transitions.
Drop transitions removed 44 transitions
Trivial Post-agglo rules discarded 44 transitions
Performed 44 trivial Post agglomeration. Transition count delta: 44
Iterating post reduction 2 with 68 rules applied. Total rules applied 215 place count 48 transition count 4
Reduce places removed 44 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 45 rules applied. Total rules applied 260 place count 4 transition count 3
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 261 place count 3 transition count 3
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 261 place count 3 transition count 2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 263 place count 2 transition count 2
Applied a total of 263 rules in 23 ms. Remains 2 /145 variables (removed 143) and now considering 2/123 (removed 121) transitions.
Finished structural reductions, in 1 iterations. Remains : 2/145 places, 2/123 transitions.
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Incomplete random walk after 10000 steps, including 357 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2570027 steps, run timeout after 3001 ms. (steps per millisecond=856 ) properties seen :{}
Probabilistic random walk after 2570027 steps, saw 326320 distinct states, run finished after 3001 ms. (steps per millisecond=856 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 123 rows 145 cols
[2022-05-17 07:45:18] [INFO ] Computed 25 place invariants in 1 ms
[2022-05-17 07:45:18] [INFO ] [Real]Absence check using 25 positive place invariants in 6 ms returned sat
[2022-05-17 07:45:18] [INFO ] After 44ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-05-17 07:45:18] [INFO ] State equation strengthened by 25 read => feed constraints.
[2022-05-17 07:45:18] [INFO ] After 9ms SMT Verify possible using 25 Read/Feed constraints in real domain returned unsat :0 sat :1
[2022-05-17 07:45:18] [INFO ] After 18ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 6 ms.
[2022-05-17 07:45:18] [INFO ] After 119ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 145 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 145/145 places, 123/123 transitions.
Free-agglomeration rule applied 48 times.
Iterating global reduction 0 with 48 rules applied. Total rules applied 48 place count 145 transition count 75
Reduce places removed 48 places and 0 transitions.
Iterating post reduction 0 with 48 rules applied. Total rules applied 96 place count 97 transition count 75
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 97 place count 96 transition count 74
Iterating global reduction 1 with 1 rules applied. Total rules applied 98 place count 96 transition count 74
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 99 place count 95 transition count 73
Iterating global reduction 1 with 1 rules applied. Total rules applied 100 place count 95 transition count 73
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 101 place count 94 transition count 72
Iterating global reduction 1 with 1 rules applied. Total rules applied 102 place count 94 transition count 72
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 103 place count 93 transition count 71
Iterating global reduction 1 with 1 rules applied. Total rules applied 104 place count 93 transition count 71
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 105 place count 92 transition count 70
Iterating global reduction 1 with 1 rules applied. Total rules applied 106 place count 92 transition count 70
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 107 place count 91 transition count 69
Iterating global reduction 1 with 1 rules applied. Total rules applied 108 place count 91 transition count 69
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 109 place count 90 transition count 68
Iterating global reduction 1 with 1 rules applied. Total rules applied 110 place count 90 transition count 68
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 111 place count 89 transition count 67
Iterating global reduction 1 with 1 rules applied. Total rules applied 112 place count 89 transition count 67
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 113 place count 88 transition count 66
Iterating global reduction 1 with 1 rules applied. Total rules applied 114 place count 88 transition count 66
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 115 place count 87 transition count 65
Iterating global reduction 1 with 1 rules applied. Total rules applied 116 place count 87 transition count 65
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 117 place count 86 transition count 64
Iterating global reduction 1 with 1 rules applied. Total rules applied 118 place count 86 transition count 64
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 119 place count 85 transition count 63
Iterating global reduction 1 with 1 rules applied. Total rules applied 120 place count 85 transition count 63
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 121 place count 84 transition count 62
Iterating global reduction 1 with 1 rules applied. Total rules applied 122 place count 84 transition count 62
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 123 place count 83 transition count 61
Iterating global reduction 1 with 1 rules applied. Total rules applied 124 place count 83 transition count 61
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 125 place count 82 transition count 60
Iterating global reduction 1 with 1 rules applied. Total rules applied 126 place count 82 transition count 60
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 127 place count 81 transition count 59
Iterating global reduction 1 with 1 rules applied. Total rules applied 128 place count 81 transition count 59
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 129 place count 80 transition count 58
Iterating global reduction 1 with 1 rules applied. Total rules applied 130 place count 80 transition count 58
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 131 place count 79 transition count 57
Iterating global reduction 1 with 1 rules applied. Total rules applied 132 place count 79 transition count 57
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 133 place count 78 transition count 56
Iterating global reduction 1 with 1 rules applied. Total rules applied 134 place count 78 transition count 56
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 135 place count 77 transition count 55
Iterating global reduction 1 with 1 rules applied. Total rules applied 136 place count 77 transition count 55
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 137 place count 76 transition count 54
Iterating global reduction 1 with 1 rules applied. Total rules applied 138 place count 76 transition count 54
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 139 place count 75 transition count 53
Iterating global reduction 1 with 1 rules applied. Total rules applied 140 place count 75 transition count 53
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 141 place count 74 transition count 52
Iterating global reduction 1 with 1 rules applied. Total rules applied 142 place count 74 transition count 52
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 143 place count 73 transition count 51
Iterating global reduction 1 with 1 rules applied. Total rules applied 144 place count 73 transition count 51
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 146 place count 73 transition count 49
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 147 place count 72 transition count 48
Reduce places removed 24 places and 0 transitions.
Drop transitions removed 44 transitions
Trivial Post-agglo rules discarded 44 transitions
Performed 44 trivial Post agglomeration. Transition count delta: 44
Iterating post reduction 2 with 68 rules applied. Total rules applied 215 place count 48 transition count 4
Reduce places removed 44 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 45 rules applied. Total rules applied 260 place count 4 transition count 3
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 261 place count 3 transition count 3
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 261 place count 3 transition count 2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 263 place count 2 transition count 2
Applied a total of 263 rules in 14 ms. Remains 2 /145 variables (removed 143) and now considering 2/123 (removed 121) transitions.
Finished structural reductions, in 1 iterations. Remains : 2/145 places, 2/123 transitions.
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Incomplete random walk after 10000 steps, including 356 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 3008017 steps, run timeout after 3001 ms. (steps per millisecond=1002 ) properties seen :{}
Probabilistic random walk after 3008017 steps, saw 383512 distinct states, run finished after 3001 ms. (steps per millisecond=1002 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 123 rows 145 cols
[2022-05-17 07:45:21] [INFO ] Computed 25 place invariants in 2 ms
[2022-05-17 07:45:21] [INFO ] [Real]Absence check using 25 positive place invariants in 5 ms returned sat
[2022-05-17 07:45:21] [INFO ] After 64ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-05-17 07:45:21] [INFO ] State equation strengthened by 25 read => feed constraints.
[2022-05-17 07:45:21] [INFO ] After 10ms SMT Verify possible using 25 Read/Feed constraints in real domain returned unsat :0 sat :1
[2022-05-17 07:45:21] [INFO ] After 21ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 7 ms.
[2022-05-17 07:45:21] [INFO ] After 152ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 145 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 145/145 places, 123/123 transitions.
Free-agglomeration rule applied 48 times.
Iterating global reduction 0 with 48 rules applied. Total rules applied 48 place count 145 transition count 75
Reduce places removed 48 places and 0 transitions.
Iterating post reduction 0 with 48 rules applied. Total rules applied 96 place count 97 transition count 75
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 97 place count 96 transition count 74
Iterating global reduction 1 with 1 rules applied. Total rules applied 98 place count 96 transition count 74
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 99 place count 95 transition count 73
Iterating global reduction 1 with 1 rules applied. Total rules applied 100 place count 95 transition count 73
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 101 place count 94 transition count 72
Iterating global reduction 1 with 1 rules applied. Total rules applied 102 place count 94 transition count 72
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 103 place count 93 transition count 71
Iterating global reduction 1 with 1 rules applied. Total rules applied 104 place count 93 transition count 71
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 105 place count 92 transition count 70
Iterating global reduction 1 with 1 rules applied. Total rules applied 106 place count 92 transition count 70
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 107 place count 91 transition count 69
Iterating global reduction 1 with 1 rules applied. Total rules applied 108 place count 91 transition count 69
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 109 place count 90 transition count 68
Iterating global reduction 1 with 1 rules applied. Total rules applied 110 place count 90 transition count 68
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 111 place count 89 transition count 67
Iterating global reduction 1 with 1 rules applied. Total rules applied 112 place count 89 transition count 67
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 113 place count 88 transition count 66
Iterating global reduction 1 with 1 rules applied. Total rules applied 114 place count 88 transition count 66
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 115 place count 87 transition count 65
Iterating global reduction 1 with 1 rules applied. Total rules applied 116 place count 87 transition count 65
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 117 place count 86 transition count 64
Iterating global reduction 1 with 1 rules applied. Total rules applied 118 place count 86 transition count 64
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 119 place count 85 transition count 63
Iterating global reduction 1 with 1 rules applied. Total rules applied 120 place count 85 transition count 63
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 121 place count 84 transition count 62
Iterating global reduction 1 with 1 rules applied. Total rules applied 122 place count 84 transition count 62
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 123 place count 83 transition count 61
Iterating global reduction 1 with 1 rules applied. Total rules applied 124 place count 83 transition count 61
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 125 place count 82 transition count 60
Iterating global reduction 1 with 1 rules applied. Total rules applied 126 place count 82 transition count 60
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 127 place count 81 transition count 59
Iterating global reduction 1 with 1 rules applied. Total rules applied 128 place count 81 transition count 59
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 129 place count 80 transition count 58
Iterating global reduction 1 with 1 rules applied. Total rules applied 130 place count 80 transition count 58
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 131 place count 79 transition count 57
Iterating global reduction 1 with 1 rules applied. Total rules applied 132 place count 79 transition count 57
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 133 place count 78 transition count 56
Iterating global reduction 1 with 1 rules applied. Total rules applied 134 place count 78 transition count 56
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 135 place count 77 transition count 55
Iterating global reduction 1 with 1 rules applied. Total rules applied 136 place count 77 transition count 55
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 137 place count 76 transition count 54
Iterating global reduction 1 with 1 rules applied. Total rules applied 138 place count 76 transition count 54
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 139 place count 75 transition count 53
Iterating global reduction 1 with 1 rules applied. Total rules applied 140 place count 75 transition count 53
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 141 place count 74 transition count 52
Iterating global reduction 1 with 1 rules applied. Total rules applied 142 place count 74 transition count 52
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 143 place count 73 transition count 51
Iterating global reduction 1 with 1 rules applied. Total rules applied 144 place count 73 transition count 51
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 146 place count 73 transition count 49
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 147 place count 72 transition count 48
Reduce places removed 24 places and 0 transitions.
Drop transitions removed 45 transitions
Trivial Post-agglo rules discarded 45 transitions
Performed 45 trivial Post agglomeration. Transition count delta: 45
Iterating post reduction 2 with 69 rules applied. Total rules applied 216 place count 48 transition count 3
Reduce places removed 45 places and 0 transitions.
Iterating post reduction 3 with 45 rules applied. Total rules applied 261 place count 3 transition count 3
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 261 place count 3 transition count 2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 263 place count 2 transition count 2
Applied a total of 263 rules in 21 ms. Remains 2 /145 variables (removed 143) and now considering 2/123 (removed 121) transitions.
Finished structural reductions, in 1 iterations. Remains : 2/145 places, 2/123 transitions.
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Applied a total of 0 rules in 2 ms. Remains 145 /145 variables (removed 0) and now considering 123/123 (removed 0) transitions.
Running SMT prover for 24 properties.
// Phase 1: matrix 123 rows 145 cols
[2022-05-17 07:45:21] [INFO ] Computed 25 place invariants in 1 ms
[2022-05-17 07:45:22] [INFO ] [Real]Absence check using 25 positive place invariants in 4 ms returned sat
[2022-05-17 07:45:22] [INFO ] After 340ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:24
[2022-05-17 07:45:22] [INFO ] [Nat]Absence check using 25 positive place invariants in 5 ms returned sat
[2022-05-17 07:45:22] [INFO ] After 190ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :24
[2022-05-17 07:45:22] [INFO ] After 426ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :24
Attempting to minimize the solution found.
Minimization took 175 ms.
[2022-05-17 07:45:23] [INFO ] After 768ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :24
[2022-05-17 07:45:23] [INFO ] Flatten gal took : 51 ms
[2022-05-17 07:45:23] [INFO ] Flatten gal took : 13 ms
[2022-05-17 07:45:23] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2087131317407964646.gal : 10 ms
[2022-05-17 07:45:23] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11266804231907617197.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/ReachabilityCardinality2087131317407964646.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11266804231907617197.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/ReachabilityCardinality11266804231907617197.prop.
SDD proceeding with computation,24 properties remain. new max is 4
SDD size :1 after 37
SDD proceeding with computation,24 properties remain. new max is 8
SDD size :37 after 2197
SDD proceeding with computation,24 properties remain. new max is 16
SDD size :2197 after 1.06289e+06
SDD proceeding with computation,24 properties remain. new max is 32
SDD size :1.06289e+06 after 1.2914e+08
SDD proceeding with computation,24 properties remain. new max is 64
SDD size :1.2914e+08 after 8.03539e+08
SDD proceeding with computation,24 properties remain. new max is 128
SDD size :8.03539e+08 after 7.07817e+11
Reachability property qltransition_264 is true.
Reachability property qltransition_257 is true.
SDD proceeding with computation,22 properties remain. new max is 128
SDD size :7.07817e+11 after 1.15064e+12
SDD proceeding with computation,22 properties remain. new max is 256
SDD size :1.15064e+12 after 8.57559e+12
SDD proceeding with computation,22 properties remain. new max is 512
SDD size :8.57559e+12 after 8.7805e+12
SDD proceeding with computation,22 properties remain. new max is 1024
SDD size :8.7805e+12 after 1.13018e+13
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,2.03349e+13,0.188729,10640,2,3131,17,35498,28,0,727,25703,0
Total reachable state count : 20334926626633

Verifying 24 reachability properties.
Reachability property qltransition_131 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
qltransition\_131,16,0.189403,10904,2,159,17,35498,28,0,730,25703,0
Reachability property qltransition_136 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
qltransition\_136,24,0.189933,10904,2,178,17,35498,28,0,732,25703,0
Reachability property qltransition_144 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
qltransition\_144,72,0.190328,10904,2,246,17,35498,28,0,734,25703,0
Reachability property qltransition_150 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
qltransition\_150,108,0.190724,10904,2,334,17,35498,28,0,736,25703,0
Reachability property qltransition_156 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
qltransition\_156,324,0.191145,10904,2,405,17,35498,28,0,738,25703,0
Reachability property qltransition_161 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
qltransition\_161,1458,0.19166,10904,2,644,17,35498,28,0,740,25703,0
Reachability property qltransition_168 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
qltransition\_168,2187,0.192185,10904,2,767,17,35498,28,0,742,25703,0
Reachability property qltransition_172 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
qltransition\_172,6561,0.192729,10904,2,830,17,35498,28,0,744,25703,0
Reachability property qltransition_180 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
qltransition\_180,19683,0.193261,10904,2,849,17,35498,28,0,746,25703,0
Reachability property qltransition_186 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
qltransition\_186,59049,0.193813,10904,2,860,17,35498,28,0,748,25703,0
Reachability property qltransition_192 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
qltransition\_192,177147,0.194358,10904,2,869,17,35498,28,0,750,25703,0
Reachability property qltransition_197 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
qltransition\_197,531441,0.194908,10904,2,875,17,35498,28,0,752,25703,0
Reachability property qltransition_204 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
qltransition\_204,1.59432e+06,0.195445,10904,2,881,18,35498,28,0,754,25703,0
Reachability property qltransition_208 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
qltransition\_208,3.18865e+06,0.19599,10904,2,884,19,35498,28,0,756,25703,0
Reachability property qltransition_216 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
qltransition\_216,9.56594e+06,0.196528,10904,2,891,20,35498,28,0,758,25703,0
Reachability property qltransition_222 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
qltransition\_222,9.56594e+06,0.197055,10904,2,891,21,35498,28,0,760,25703,0
Reachability property qltransition_227 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
qltransition\_227,5.73956e+07,0.197586,10904,2,914,22,35498,28,0,762,25703,0
Reachability property qltransition_232 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
qltransition\_232,8.60934e+07,0.198111,10904,2,922,23,35498,28,0,764,25703,0
Reachability property qltransition_240 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
qltransition\_240,2.5828e+08,0.19865,10904,2,941,24,35498,28,0,766,25703,0
Reachability property qltransition_246 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
qltransition\_246,2.5828e+08,0.19915,10904,2,941,25,35498,28,0,768,25703,0
Reachability property qltransition_252 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
qltransition\_252,7.74841e+08,0.199692,10904,2,973,26,35498,28,0,770,25703,0
Reachability property qltransition_257 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
qltransition\_257,7.74841e+08,0.200225,10904,2,973,27,35498,29,0,773,25703,0
Reachability property qltransition_264 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
qltransition\_264,4374,0.200785,10904,2,821,28,35498,30,0,776,25703,0
Reachability property qltransition_267 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
qltransition\_267,486,0.201256,10904,2,530,29,35498,30,0,778,25703,0
[2022-05-17 07:45:23] [INFO ] Flatten gal took : 17 ms
[2022-05-17 07:45:23] [INFO ] Flatten gal took : 15 ms
[2022-05-17 07:45:23] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability16792482081095487839.gal : 10 ms
[2022-05-17 07:45:23] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability12571682602183636801.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/ReachabilityFireability16792482081095487839.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability12571682602183636801.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/ReachabilityFireability12571682602183636801.prop.
SDD proceeding with computation,24 properties remain. new max is 4
SDD size :1 after 37
SDD proceeding with computation,24 properties remain. new max is 8
SDD size :37 after 2197
SDD proceeding with computation,24 properties remain. new max is 16
SDD size :2197 after 531451
SDD proceeding with computation,24 properties remain. new max is 32
SDD size :531451 after 1.59432e+06
SDD proceeding with computation,24 properties remain. new max is 64
SDD size :1.59432e+06 after 1.89406e+09
SDD proceeding with computation,24 properties remain. new max is 128
SDD size :1.89406e+09 after 8.36828e+10
Reachability property qltransition_264 is true.
Reachability property qltransition_257 is true.
SDD proceeding with computation,22 properties remain. new max is 128
SDD size :8.36828e+10 after 1.41447e+12
Reachability property qltransition_267 is true.
Reachability property qltransition_252 is true.
Reachability property qltransition_246 is true.
Reachability property qltransition_240 is true.
Reachability property qltransition_232 is true.
Reachability property qltransition_227 is true.
Reachability property qltransition_222 is true.
Reachability property qltransition_216 is true.
Reachability property qltransition_208 is true.
Reachability property qltransition_204 is true.
Reachability property qltransition_197 is true.
Reachability property qltransition_192 is true.
Reachability property qltransition_186 is true.
Reachability property qltransition_180 is true.
Reachability property qltransition_172 is true.
Reachability property qltransition_168 is true.
Reachability property qltransition_161 is true.
Reachability property qltransition_156 is true.
Reachability property qltransition_150 is true.
Reachability property qltransition_144 is true.
Reachability property qltransition_136 is true.
Reachability property qltransition_131 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 129 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,2.14101e+12,0.159876,8796,2,3007,36,20746,6,0,705,13273,0
Total reachable state count : 2141014762378

Verifying 24 reachability properties.
Reachability property qltransition_131 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
qltransition\_131,36,0.160632,8796,2,240,36,20746,7,0,709,13273,0
Reachability property qltransition_136 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
qltransition\_136,8,0.161512,9060,2,157,36,20746,8,0,712,13273,0
Reachability property qltransition_144 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
qltransition\_144,24,0.16194,9060,2,188,36,20746,9,0,715,13273,0
Reachability property qltransition_150 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
qltransition\_150,54,0.162531,9060,2,306,36,20746,10,0,718,13273,0
Reachability property qltransition_156 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
qltransition\_156,324,0.163049,9060,2,392,36,20746,11,0,721,13273,0
Reachability property qltransition_161 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
qltransition\_161,972,0.163477,9060,2,483,36,20746,12,0,724,13273,0
Reachability property qltransition_168 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
qltransition\_168,2187,0.163922,9060,2,529,36,20746,13,0,727,13273,0
Reachability property qltransition_172 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
qltransition\_172,6561,0.164335,9060,2,557,36,20746,14,0,730,13273,0
Reachability property qltransition_180 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
qltransition\_180,19683,0.164727,9060,2,574,36,20746,15,0,733,13273,0
Reachability property qltransition_186 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
qltransition\_186,59049,0.165125,9060,2,581,36,20746,16,0,736,13273,0
Reachability property qltransition_192 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
qltransition\_192,177147,0.165543,9060,2,585,36,20746,17,0,739,13273,0
Reachability property qltransition_197 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
qltransition\_197,531441,0.165981,9060,2,588,36,20746,18,0,742,13273,0
Reachability property qltransition_204 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
qltransition\_204,1.59432e+06,0.166517,9060,2,592,36,20746,19,0,745,13273,0
Reachability property qltransition_208 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
qltransition\_208,3.18865e+06,0.166944,9060,2,594,36,20746,20,0,748,13273,0
Reachability property qltransition_216 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
qltransition\_216,9.56594e+06,0.167326,9060,2,601,36,20746,21,0,751,13273,0
Reachability property qltransition_222 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
qltransition\_222,2.86978e+07,0.167711,9060,2,612,36,20746,22,0,754,13273,0
Reachability property qltransition_227 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
qltransition\_227,1.2914e+08,0.168085,9060,2,641,36,20746,23,0,757,13273,0
Reachability property qltransition_232 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
qltransition\_232,3.8742e+08,0.168479,9060,2,663,36,20746,24,0,760,13273,0
Reachability property qltransition_240 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
qltransition\_240,3.8742e+08,0.16884,9060,2,663,36,20746,25,0,763,13273,0
Reachability property qltransition_246 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
qltransition\_246,1.16226e+09,0.169228,9060,2,680,36,20746,26,0,766,13273,0
Reachability property qltransition_252 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
qltransition\_252,1.16226e+09,0.169594,9060,2,680,36,20746,27,0,769,13273,0
Reachability property qltransition_257 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
qltransition\_257,8.60934e+07,0.169985,9060,2,638,36,20746,28,0,772,13273,0
Reachability property qltransition_264 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
qltransition\_264,4374,0.170395,9060,2,541,36,20746,29,0,775,13273,0
Reachability property qltransition_267 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
qltransition\_267,1458,0.170814,9060,2,506,36,20746,30,0,778,13273,0
Able to resolve query QuasiLiveness after proving 170 properties.
FORMULA QuasiLiveness TRUE TECHNIQUES RANDOM_WALK PARIKH_WALK DECISION_DIAGRAMS COLLATERAL_PROCESSING TOPOLOGICAL INITIAL_STATE
Total runtime 596774 ms.

BK_STOP 1652773523869

--------------------
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
++ 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 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="AutoFlight-PT-24b"
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 AutoFlight-PT-24b, 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 r016-tajo-165245743600307"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/AutoFlight-PT-24b.tgz
mv AutoFlight-PT-24b 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 ;