fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r393-oct2-167903717300634
Last Updated
May 14, 2023

About the Execution of LTSMin+red for ShieldPPPt-PT-020B

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
8813.871 3600000.00 14185132.00 73.80 [undef] Time out reached

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r393-oct2-167903717300634.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is ShieldPPPt-PT-020B, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r393-oct2-167903717300634
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 764K
-rw-r--r-- 1 mcc users 6.7K Feb 25 21:08 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K Feb 25 21:08 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K Feb 25 21:08 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K Feb 25 21:08 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 17:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 17:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 17:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 17:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.6K Feb 25 21:09 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 83K Feb 25 21:09 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.3K Feb 25 21:09 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 59K Feb 25 21:09 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:00 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:00 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 376K Mar 5 18:23 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1679463982764

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPt-PT-020B
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-22 05:46:25] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-22 05:46:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 05:46:25] [INFO ] Load time of PNML (sax parser for PT used): 190 ms
[2023-03-22 05:46:25] [INFO ] Transformed 1563 places.
[2023-03-22 05:46:25] [INFO ] Transformed 1423 transitions.
[2023-03-22 05:46:25] [INFO ] Found NUPN structural information;
[2023-03-22 05:46:25] [INFO ] Parsed PT model containing 1563 places and 1423 transitions and 3566 arcs in 326 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 7 ms.
Support contains 104 out of 1563 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1563/1563 places, 1423/1423 transitions.
Discarding 195 places :
Symmetric choice reduction at 0 with 195 rule applications. Total rules 195 place count 1368 transition count 1228
Iterating global reduction 0 with 195 rules applied. Total rules applied 390 place count 1368 transition count 1228
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 391 place count 1367 transition count 1227
Iterating global reduction 0 with 1 rules applied. Total rules applied 392 place count 1367 transition count 1227
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 393 place count 1366 transition count 1226
Iterating global reduction 0 with 1 rules applied. Total rules applied 394 place count 1366 transition count 1226
Applied a total of 394 rules in 589 ms. Remains 1366 /1563 variables (removed 197) and now considering 1226/1423 (removed 197) transitions.
// Phase 1: matrix 1226 rows 1366 cols
[2023-03-22 05:46:26] [INFO ] Computed 221 place invariants in 56 ms
[2023-03-22 05:46:27] [INFO ] Implicit Places using invariants in 1252 ms returned []
[2023-03-22 05:46:27] [INFO ] Invariant cache hit.
[2023-03-22 05:46:29] [INFO ] Implicit Places using invariants and state equation in 1947 ms returned []
Implicit Place search using SMT with State Equation took 3274 ms to find 0 implicit places.
[2023-03-22 05:46:29] [INFO ] Invariant cache hit.
[2023-03-22 05:46:30] [INFO ] Dead Transitions using invariants and state equation in 845 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1366/1563 places, 1226/1423 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4710 ms. Remains : 1366/1563 places, 1226/1423 transitions.
Support contains 104 out of 1366 places after structural reductions.
[2023-03-22 05:46:30] [INFO ] Flatten gal took : 148 ms
[2023-03-22 05:46:31] [INFO ] Flatten gal took : 134 ms
[2023-03-22 05:46:31] [INFO ] Input system was already deterministic with 1226 transitions.
Support contains 103 out of 1366 places (down from 104) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 599 ms. (steps per millisecond=16 ) properties (out of 71) seen :39
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 32) 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 32) 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 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 32) 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 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 32) 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 32) 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 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 32) 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 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 32) 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 32) 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 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 32) 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 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 32) 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 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 32) 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 32) 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 32) 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 32) 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 32) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 32) 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 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 32) 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 32) seen :0
Running SMT prover for 32 properties.
[2023-03-22 05:46:32] [INFO ] Invariant cache hit.
[2023-03-22 05:46:33] [INFO ] [Real]Absence check using 221 positive place invariants in 151 ms returned sat
[2023-03-22 05:46:33] [INFO ] After 1571ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:32
[2023-03-22 05:46:35] [INFO ] [Nat]Absence check using 221 positive place invariants in 255 ms returned sat
[2023-03-22 05:46:38] [INFO ] After 2327ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :32
[2023-03-22 05:46:39] [INFO ] Deduced a trap composed of 30 places in 371 ms of which 7 ms to minimize.
[2023-03-22 05:46:39] [INFO ] Deduced a trap composed of 26 places in 258 ms of which 1 ms to minimize.
[2023-03-22 05:46:39] [INFO ] Deduced a trap composed of 32 places in 295 ms of which 2 ms to minimize.
[2023-03-22 05:46:40] [INFO ] Deduced a trap composed of 30 places in 329 ms of which 26 ms to minimize.
[2023-03-22 05:46:40] [INFO ] Deduced a trap composed of 20 places in 211 ms of which 15 ms to minimize.
[2023-03-22 05:46:40] [INFO ] Deduced a trap composed of 23 places in 431 ms of which 1 ms to minimize.
[2023-03-22 05:46:41] [INFO ] Deduced a trap composed of 28 places in 472 ms of which 2 ms to minimize.
[2023-03-22 05:46:41] [INFO ] Deduced a trap composed of 30 places in 468 ms of which 14 ms to minimize.
[2023-03-22 05:46:42] [INFO ] Deduced a trap composed of 16 places in 198 ms of which 0 ms to minimize.
[2023-03-22 05:46:42] [INFO ] Deduced a trap composed of 28 places in 227 ms of which 1 ms to minimize.
[2023-03-22 05:46:42] [INFO ] Deduced a trap composed of 21 places in 436 ms of which 0 ms to minimize.
[2023-03-22 05:46:43] [INFO ] Deduced a trap composed of 26 places in 163 ms of which 0 ms to minimize.
[2023-03-22 05:46:43] [INFO ] Deduced a trap composed of 22 places in 206 ms of which 0 ms to minimize.
[2023-03-22 05:46:43] [INFO ] Deduced a trap composed of 30 places in 186 ms of which 0 ms to minimize.
[2023-03-22 05:46:43] [INFO ] Deduced a trap composed of 24 places in 162 ms of which 1 ms to minimize.
[2023-03-22 05:46:44] [INFO ] Deduced a trap composed of 23 places in 240 ms of which 0 ms to minimize.
[2023-03-22 05:46:44] [INFO ] Deduced a trap composed of 31 places in 141 ms of which 0 ms to minimize.
[2023-03-22 05:46:44] [INFO ] Deduced a trap composed of 28 places in 125 ms of which 1 ms to minimize.
[2023-03-22 05:46:44] [INFO ] Deduced a trap composed of 42 places in 113 ms of which 1 ms to minimize.
[2023-03-22 05:46:44] [INFO ] Deduced a trap composed of 39 places in 131 ms of which 1 ms to minimize.
[2023-03-22 05:46:44] [INFO ] Deduced a trap composed of 35 places in 160 ms of which 0 ms to minimize.
[2023-03-22 05:46:45] [INFO ] Deduced a trap composed of 33 places in 114 ms of which 1 ms to minimize.
[2023-03-22 05:46:45] [INFO ] Deduced a trap composed of 33 places in 75 ms of which 1 ms to minimize.
[2023-03-22 05:46:45] [INFO ] Trap strengthening (SAT) tested/added 24/23 trap constraints in 6674 ms
[2023-03-22 05:46:45] [INFO ] Deduced a trap composed of 24 places in 145 ms of which 13 ms to minimize.
[2023-03-22 05:46:45] [INFO ] Deduced a trap composed of 27 places in 123 ms of which 0 ms to minimize.
[2023-03-22 05:46:45] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 425 ms
[2023-03-22 05:46:46] [INFO ] Deduced a trap composed of 36 places in 220 ms of which 0 ms to minimize.
[2023-03-22 05:46:46] [INFO ] Deduced a trap composed of 26 places in 240 ms of which 1 ms to minimize.
[2023-03-22 05:46:46] [INFO ] Deduced a trap composed of 29 places in 214 ms of which 1 ms to minimize.
[2023-03-22 05:46:47] [INFO ] Deduced a trap composed of 39 places in 135 ms of which 1 ms to minimize.
[2023-03-22 05:46:47] [INFO ] Deduced a trap composed of 27 places in 175 ms of which 1 ms to minimize.
[2023-03-22 05:46:47] [INFO ] Deduced a trap composed of 32 places in 185 ms of which 1 ms to minimize.
[2023-03-22 05:46:47] [INFO ] Deduced a trap composed of 29 places in 210 ms of which 0 ms to minimize.
[2023-03-22 05:46:48] [INFO ] Deduced a trap composed of 34 places in 201 ms of which 0 ms to minimize.
[2023-03-22 05:46:48] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1979 ms
[2023-03-22 05:46:48] [INFO ] Deduced a trap composed of 34 places in 124 ms of which 7 ms to minimize.
[2023-03-22 05:46:48] [INFO ] Deduced a trap composed of 34 places in 138 ms of which 1 ms to minimize.
[2023-03-22 05:46:48] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 399 ms
[2023-03-22 05:46:48] [INFO ] Deduced a trap composed of 22 places in 181 ms of which 0 ms to minimize.
[2023-03-22 05:46:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 250 ms
[2023-03-22 05:46:49] [INFO ] Deduced a trap composed of 33 places in 245 ms of which 0 ms to minimize.
[2023-03-22 05:46:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 331 ms
[2023-03-22 05:46:49] [INFO ] Deduced a trap composed of 20 places in 143 ms of which 0 ms to minimize.
[2023-03-22 05:46:50] [INFO ] Deduced a trap composed of 20 places in 220 ms of which 1 ms to minimize.
[2023-03-22 05:46:50] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 474 ms
[2023-03-22 05:46:50] [INFO ] Deduced a trap composed of 29 places in 238 ms of which 7 ms to minimize.
[2023-03-22 05:46:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 339 ms
[2023-03-22 05:46:51] [INFO ] Deduced a trap composed of 24 places in 144 ms of which 0 ms to minimize.
[2023-03-22 05:46:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 231 ms
[2023-03-22 05:46:51] [INFO ] Deduced a trap composed of 32 places in 135 ms of which 0 ms to minimize.
[2023-03-22 05:46:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 218 ms
[2023-03-22 05:46:51] [INFO ] Deduced a trap composed of 32 places in 147 ms of which 1 ms to minimize.
[2023-03-22 05:46:52] [INFO ] Deduced a trap composed of 38 places in 121 ms of which 0 ms to minimize.
[2023-03-22 05:46:52] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 430 ms
[2023-03-22 05:46:52] [INFO ] Deduced a trap composed of 26 places in 133 ms of which 1 ms to minimize.
[2023-03-22 05:46:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 227 ms
[2023-03-22 05:46:52] [INFO ] After 16557ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :32
Attempting to minimize the solution found.
Minimization took 1727 ms.
[2023-03-22 05:46:54] [INFO ] After 20627ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :32
Fused 32 Parikh solutions to 31 different solutions.
Parikh walk visited 0 properties in 1692 ms.
Support contains 57 out of 1366 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1366/1366 places, 1226/1226 transitions.
Drop transitions removed 245 transitions
Trivial Post-agglo rules discarded 245 transitions
Performed 245 trivial Post agglomeration. Transition count delta: 245
Iterating post reduction 0 with 245 rules applied. Total rules applied 245 place count 1366 transition count 981
Reduce places removed 245 places and 0 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Iterating post reduction 1 with 254 rules applied. Total rules applied 499 place count 1121 transition count 972
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 508 place count 1112 transition count 972
Performed 149 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 149 Pre rules applied. Total rules applied 508 place count 1112 transition count 823
Deduced a syphon composed of 149 places in 2 ms
Reduce places removed 149 places and 0 transitions.
Iterating global reduction 3 with 298 rules applied. Total rules applied 806 place count 963 transition count 823
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 819 place count 950 transition count 810
Iterating global reduction 3 with 13 rules applied. Total rules applied 832 place count 950 transition count 810
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 832 place count 950 transition count 801
Deduced a syphon composed of 9 places in 6 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 850 place count 941 transition count 801
Performed 320 Post agglomeration using F-continuation condition.Transition count delta: 320
Deduced a syphon composed of 320 places in 1 ms
Reduce places removed 320 places and 0 transitions.
Iterating global reduction 3 with 640 rules applied. Total rules applied 1490 place count 621 transition count 481
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1491 place count 621 transition count 480
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1493 place count 620 transition count 479
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 50 places in 0 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 4 with 100 rules applied. Total rules applied 1593 place count 570 transition count 479
Free-agglomeration rule applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1595 place count 570 transition count 477
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 1597 place count 568 transition count 477
Partial Free-agglomeration rule applied 54 times.
Drop transitions removed 54 transitions
Iterating global reduction 5 with 54 rules applied. Total rules applied 1651 place count 568 transition count 477
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1652 place count 567 transition count 476
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1653 place count 566 transition count 476
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 1653 place count 566 transition count 474
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 1657 place count 564 transition count 474
Applied a total of 1657 rules in 440 ms. Remains 564 /1366 variables (removed 802) and now considering 474/1226 (removed 752) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 440 ms. Remains : 564/1366 places, 474/1226 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 310 ms. (steps per millisecond=32 ) properties (out of 32) seen :10
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=19 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 22) 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 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 22) 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 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 22) seen :0
Running SMT prover for 22 properties.
// Phase 1: matrix 474 rows 564 cols
[2023-03-22 05:46:57] [INFO ] Computed 220 place invariants in 2 ms
[2023-03-22 05:46:57] [INFO ] [Real]Absence check using 220 positive place invariants in 25 ms returned sat
[2023-03-22 05:46:57] [INFO ] After 407ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:22
[2023-03-22 05:46:58] [INFO ] [Nat]Absence check using 220 positive place invariants in 46 ms returned sat
[2023-03-22 05:46:59] [INFO ] After 678ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :22
[2023-03-22 05:46:59] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-03-22 05:46:59] [INFO ] After 356ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :22
[2023-03-22 05:46:59] [INFO ] Deduced a trap composed of 8 places in 146 ms of which 0 ms to minimize.
[2023-03-22 05:46:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 186 ms
[2023-03-22 05:46:59] [INFO ] Deduced a trap composed of 3 places in 124 ms of which 1 ms to minimize.
[2023-03-22 05:46:59] [INFO ] Deduced a trap composed of 5 places in 97 ms of which 0 ms to minimize.
[2023-03-22 05:46:59] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 297 ms
[2023-03-22 05:47:00] [INFO ] Deduced a trap composed of 5 places in 107 ms of which 0 ms to minimize.
[2023-03-22 05:47:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 144 ms
[2023-03-22 05:47:01] [INFO ] Deduced a trap composed of 6 places in 249 ms of which 14 ms to minimize.
[2023-03-22 05:47:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 309 ms
[2023-03-22 05:47:01] [INFO ] Deduced a trap composed of 6 places in 358 ms of which 1 ms to minimize.
[2023-03-22 05:47:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 428 ms
[2023-03-22 05:47:01] [INFO ] After 2801ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :22
Attempting to minimize the solution found.
Minimization took 743 ms.
[2023-03-22 05:47:02] [INFO ] After 4899ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :22
Parikh walk visited 0 properties in 278 ms.
Support contains 35 out of 564 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 564/564 places, 474/474 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 564 transition count 472
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 562 transition count 472
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 4 place count 562 transition count 463
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 22 place count 553 transition count 463
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 3 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 40 place count 544 transition count 454
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 50 place count 539 transition count 454
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 52 place count 539 transition count 454
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 53 place count 538 transition count 453
Applied a total of 53 rules in 84 ms. Remains 538 /564 variables (removed 26) and now considering 453/474 (removed 21) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 84 ms. Remains : 538/564 places, 453/474 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 383 ms. (steps per millisecond=26 ) properties (out of 22) seen :1
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 21) seen :0
Interrupted probabilistic random walk after 93106 steps, run timeout after 3002 ms. (steps per millisecond=31 ) properties seen :{}
Probabilistic random walk after 93106 steps, saw 84906 distinct states, run finished after 3022 ms. (steps per millisecond=30 ) properties seen :0
Running SMT prover for 21 properties.
// Phase 1: matrix 453 rows 538 cols
[2023-03-22 05:47:06] [INFO ] Computed 220 place invariants in 3 ms
[2023-03-22 05:47:06] [INFO ] [Real]Absence check using 220 positive place invariants in 72 ms returned sat
[2023-03-22 05:47:06] [INFO ] After 345ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:21
[2023-03-22 05:47:07] [INFO ] [Nat]Absence check using 220 positive place invariants in 53 ms returned sat
[2023-03-22 05:47:08] [INFO ] After 869ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :21
[2023-03-22 05:47:08] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-22 05:47:09] [INFO ] After 716ms SMT Verify possible using 14 Read/Feed constraints in natural domain returned unsat :0 sat :21
[2023-03-22 05:47:09] [INFO ] Deduced a trap composed of 7 places in 137 ms of which 1 ms to minimize.
[2023-03-22 05:47:09] [INFO ] Deduced a trap composed of 8 places in 245 ms of which 1 ms to minimize.
[2023-03-22 05:47:09] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 465 ms
[2023-03-22 05:47:09] [INFO ] Deduced a trap composed of 6 places in 79 ms of which 1 ms to minimize.
[2023-03-22 05:47:10] [INFO ] Deduced a trap composed of 5 places in 198 ms of which 1 ms to minimize.
[2023-03-22 05:47:10] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 322 ms
[2023-03-22 05:47:10] [INFO ] Deduced a trap composed of 3 places in 123 ms of which 1 ms to minimize.
[2023-03-22 05:47:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 181 ms
[2023-03-22 05:47:10] [INFO ] Deduced a trap composed of 7 places in 77 ms of which 1 ms to minimize.
[2023-03-22 05:47:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 129 ms
[2023-03-22 05:47:11] [INFO ] Deduced a trap composed of 6 places in 264 ms of which 1 ms to minimize.
[2023-03-22 05:47:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 323 ms
[2023-03-22 05:47:11] [INFO ] After 2923ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :21
Attempting to minimize the solution found.
Minimization took 795 ms.
[2023-03-22 05:47:12] [INFO ] After 5320ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :21
Parikh walk visited 1 properties in 394 ms.
Support contains 31 out of 538 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 538/538 places, 453/453 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 538 transition count 452
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 537 transition count 452
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 537 transition count 451
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 4 place count 536 transition count 451
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 8 place count 534 transition count 449
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 9 place count 533 transition count 448
Applied a total of 9 rules in 43 ms. Remains 533 /538 variables (removed 5) and now considering 448/453 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43 ms. Remains : 533/538 places, 448/453 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 420 ms. (steps per millisecond=23 ) properties (out of 20) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 19) 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 19) 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 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 19) 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 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 19) seen :0
Interrupted probabilistic random walk after 102114 steps, run timeout after 3001 ms. (steps per millisecond=34 ) properties seen :{}
Probabilistic random walk after 102114 steps, saw 92309 distinct states, run finished after 3003 ms. (steps per millisecond=34 ) properties seen :0
Running SMT prover for 19 properties.
// Phase 1: matrix 448 rows 533 cols
[2023-03-22 05:47:16] [INFO ] Computed 220 place invariants in 4 ms
[2023-03-22 05:47:16] [INFO ] After 186ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:19
[2023-03-22 05:47:16] [INFO ] [Nat]Absence check using 220 positive place invariants in 51 ms returned sat
[2023-03-22 05:47:17] [INFO ] After 560ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :19
[2023-03-22 05:47:17] [INFO ] State equation strengthened by 13 read => feed constraints.
[2023-03-22 05:47:18] [INFO ] After 553ms SMT Verify possible using 13 Read/Feed constraints in natural domain returned unsat :0 sat :19
[2023-03-22 05:47:18] [INFO ] Deduced a trap composed of 5 places in 205 ms of which 1 ms to minimize.
[2023-03-22 05:47:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 263 ms
[2023-03-22 05:47:18] [INFO ] Deduced a trap composed of 6 places in 220 ms of which 1 ms to minimize.
[2023-03-22 05:47:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 302 ms
[2023-03-22 05:47:19] [INFO ] Deduced a trap composed of 3 places in 193 ms of which 40 ms to minimize.
[2023-03-22 05:47:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 227 ms
[2023-03-22 05:47:19] [INFO ] Deduced a trap composed of 6 places in 149 ms of which 0 ms to minimize.
[2023-03-22 05:47:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 185 ms
[2023-03-22 05:47:20] [INFO ] After 2522ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :19
Attempting to minimize the solution found.
Minimization took 589 ms.
[2023-03-22 05:47:20] [INFO ] After 4286ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :19
Fused 19 Parikh solutions to 18 different solutions.
Parikh walk visited 0 properties in 155 ms.
Support contains 30 out of 533 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 533/533 places, 448/448 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 533 transition count 447
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 532 transition count 447
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 531 transition count 447
Applied a total of 4 rules in 24 ms. Remains 531 /533 variables (removed 2) and now considering 447/448 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 531/533 places, 447/448 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 301 ms. (steps per millisecond=33 ) properties (out of 19) seen :1
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 18) seen :0
Interrupted probabilistic random walk after 76273 steps, run timeout after 3001 ms. (steps per millisecond=25 ) properties seen :{}
Probabilistic random walk after 76273 steps, saw 68936 distinct states, run finished after 3001 ms. (steps per millisecond=25 ) properties seen :0
Running SMT prover for 18 properties.
// Phase 1: matrix 447 rows 531 cols
[2023-03-22 05:47:24] [INFO ] Computed 220 place invariants in 2 ms
[2023-03-22 05:47:24] [INFO ] After 211ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:18
[2023-03-22 05:47:24] [INFO ] [Nat]Absence check using 220 positive place invariants in 66 ms returned sat
[2023-03-22 05:47:26] [INFO ] After 667ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :18
[2023-03-22 05:47:26] [INFO ] State equation strengthened by 13 read => feed constraints.
[2023-03-22 05:47:26] [INFO ] After 325ms SMT Verify possible using 13 Read/Feed constraints in natural domain returned unsat :0 sat :18
[2023-03-22 05:47:26] [INFO ] Deduced a trap composed of 5 places in 142 ms of which 1 ms to minimize.
[2023-03-22 05:47:26] [INFO ] Deduced a trap composed of 3 places in 136 ms of which 37 ms to minimize.
[2023-03-22 05:47:27] [INFO ] Deduced a trap composed of 6 places in 105 ms of which 0 ms to minimize.
[2023-03-22 05:47:27] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 485 ms
[2023-03-22 05:47:27] [INFO ] Deduced a trap composed of 8 places in 174 ms of which 26 ms to minimize.
[2023-03-22 05:47:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 213 ms
[2023-03-22 05:47:27] [INFO ] Deduced a trap composed of 6 places in 70 ms of which 0 ms to minimize.
[2023-03-22 05:47:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 120 ms
[2023-03-22 05:47:28] [INFO ] Deduced a trap composed of 6 places in 180 ms of which 0 ms to minimize.
[2023-03-22 05:47:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 209 ms
[2023-03-22 05:47:28] [INFO ] After 2028ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :18
Attempting to minimize the solution found.
Minimization took 387 ms.
[2023-03-22 05:47:28] [INFO ] After 4020ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :18
Parikh walk visited 0 properties in 263 ms.
Support contains 29 out of 531 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 531/531 places, 447/447 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 530 transition count 446
Applied a total of 2 rules in 25 ms. Remains 530 /531 variables (removed 1) and now considering 446/447 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 530/531 places, 446/447 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 425 ms. (steps per millisecond=23 ) properties (out of 18) seen :3
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 15) seen :0
Running SMT prover for 15 properties.
// Phase 1: matrix 446 rows 530 cols
[2023-03-22 05:47:29] [INFO ] Computed 220 place invariants in 1 ms
[2023-03-22 05:47:29] [INFO ] After 203ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:15
[2023-03-22 05:47:29] [INFO ] [Nat]Absence check using 220 positive place invariants in 82 ms returned sat
[2023-03-22 05:47:30] [INFO ] After 431ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :15
[2023-03-22 05:47:30] [INFO ] State equation strengthened by 13 read => feed constraints.
[2023-03-22 05:47:30] [INFO ] After 500ms SMT Verify possible using 13 Read/Feed constraints in natural domain returned unsat :0 sat :15
[2023-03-22 05:47:31] [INFO ] Deduced a trap composed of 7 places in 78 ms of which 0 ms to minimize.
[2023-03-22 05:47:31] [INFO ] Deduced a trap composed of 6 places in 95 ms of which 1 ms to minimize.
[2023-03-22 05:47:31] [INFO ] Deduced a trap composed of 9 places in 146 ms of which 0 ms to minimize.
[2023-03-22 05:47:31] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 405 ms
[2023-03-22 05:47:31] [INFO ] Deduced a trap composed of 3 places in 109 ms of which 0 ms to minimize.
[2023-03-22 05:47:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 155 ms
[2023-03-22 05:47:32] [INFO ] After 1591ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :15
Attempting to minimize the solution found.
Minimization took 466 ms.
[2023-03-22 05:47:32] [INFO ] After 2975ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :15
Parikh walk visited 1 properties in 142 ms.
Support contains 20 out of 530 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 530/530 places, 446/446 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 530 transition count 444
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 528 transition count 444
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 4 place count 528 transition count 442
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 8 place count 526 transition count 442
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 12 place count 524 transition count 440
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 14 place count 522 transition count 438
Applied a total of 14 rules in 62 ms. Remains 522 /530 variables (removed 8) and now considering 438/446 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62 ms. Remains : 522/530 places, 438/446 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 171 ms. (steps per millisecond=58 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 14) seen :0
Interrupted probabilistic random walk after 128343 steps, run timeout after 3004 ms. (steps per millisecond=42 ) properties seen :{}
Probabilistic random walk after 128343 steps, saw 111262 distinct states, run finished after 3005 ms. (steps per millisecond=42 ) properties seen :0
Running SMT prover for 14 properties.
// Phase 1: matrix 438 rows 522 cols
[2023-03-22 05:47:36] [INFO ] Computed 220 place invariants in 2 ms
[2023-03-22 05:47:37] [INFO ] After 206ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:14
[2023-03-22 05:47:37] [INFO ] [Nat]Absence check using 220 positive place invariants in 26 ms returned sat
[2023-03-22 05:47:38] [INFO ] After 507ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :14
[2023-03-22 05:47:38] [INFO ] State equation strengthened by 11 read => feed constraints.
[2023-03-22 05:47:38] [INFO ] After 412ms SMT Verify possible using 11 Read/Feed constraints in natural domain returned unsat :0 sat :14
[2023-03-22 05:47:38] [INFO ] Deduced a trap composed of 5 places in 170 ms of which 1 ms to minimize.
[2023-03-22 05:47:38] [INFO ] Deduced a trap composed of 5 places in 140 ms of which 0 ms to minimize.
[2023-03-22 05:47:38] [INFO ] Deduced a trap composed of 6 places in 94 ms of which 9 ms to minimize.
[2023-03-22 05:47:39] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 486 ms
[2023-03-22 05:47:39] [INFO ] Deduced a trap composed of 3 places in 298 ms of which 0 ms to minimize.
[2023-03-22 05:47:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 340 ms
[2023-03-22 05:47:39] [INFO ] Deduced a trap composed of 3 places in 163 ms of which 1 ms to minimize.
[2023-03-22 05:47:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 202 ms
[2023-03-22 05:47:40] [INFO ] After 1959ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :14
Attempting to minimize the solution found.
Minimization took 249 ms.
[2023-03-22 05:47:40] [INFO ] After 3151ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :14
Parikh walk visited 0 properties in 114 ms.
Support contains 20 out of 522 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 522/522 places, 438/438 transitions.
Applied a total of 0 rules in 9 ms. Remains 522 /522 variables (removed 0) and now considering 438/438 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 522/522 places, 438/438 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 522/522 places, 438/438 transitions.
Applied a total of 0 rules in 9 ms. Remains 522 /522 variables (removed 0) and now considering 438/438 (removed 0) transitions.
[2023-03-22 05:47:40] [INFO ] Invariant cache hit.
[2023-03-22 05:47:40] [INFO ] Implicit Places using invariants in 460 ms returned [505, 509]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 463 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 520/522 places, 438/438 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 518 transition count 436
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 518 transition count 436
Applied a total of 4 rules in 20 ms. Remains 518 /520 variables (removed 2) and now considering 436/438 (removed 2) transitions.
// Phase 1: matrix 436 rows 518 cols
[2023-03-22 05:47:40] [INFO ] Computed 218 place invariants in 1 ms
[2023-03-22 05:47:41] [INFO ] Implicit Places using invariants in 448 ms returned []
[2023-03-22 05:47:41] [INFO ] Invariant cache hit.
[2023-03-22 05:47:41] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-22 05:47:42] [INFO ] Implicit Places using invariants and state equation in 715 ms returned []
Implicit Place search using SMT with State Equation took 1178 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 518/522 places, 436/438 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1680 ms. Remains : 518/522 places, 436/438 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 166 ms. (steps per millisecond=60 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 119 ms. (steps per millisecond=84 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 14) seen :0
Interrupted probabilistic random walk after 134242 steps, run timeout after 3001 ms. (steps per millisecond=44 ) properties seen :{}
Probabilistic random walk after 134242 steps, saw 116635 distinct states, run finished after 3001 ms. (steps per millisecond=44 ) properties seen :0
Running SMT prover for 14 properties.
[2023-03-22 05:47:46] [INFO ] Invariant cache hit.
[2023-03-22 05:47:46] [INFO ] After 207ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:14
[2023-03-22 05:47:46] [INFO ] [Nat]Absence check using 218 positive place invariants in 89 ms returned sat
[2023-03-22 05:47:48] [INFO ] After 814ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :14
[2023-03-22 05:47:48] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-22 05:47:48] [INFO ] After 548ms SMT Verify possible using 9 Read/Feed constraints in natural domain returned unsat :0 sat :14
[2023-03-22 05:47:48] [INFO ] Deduced a trap composed of 6 places in 217 ms of which 0 ms to minimize.
[2023-03-22 05:47:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 276 ms
[2023-03-22 05:47:49] [INFO ] Deduced a trap composed of 5 places in 93 ms of which 1 ms to minimize.
[2023-03-22 05:47:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 118 ms
[2023-03-22 05:47:49] [INFO ] Deduced a trap composed of 6 places in 89 ms of which 1 ms to minimize.
[2023-03-22 05:47:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 119 ms
[2023-03-22 05:47:49] [INFO ] Deduced a trap composed of 7 places in 136 ms of which 1 ms to minimize.
[2023-03-22 05:47:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 166 ms
[2023-03-22 05:47:49] [INFO ] Deduced a trap composed of 3 places in 78 ms of which 0 ms to minimize.
[2023-03-22 05:47:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 118 ms
[2023-03-22 05:47:49] [INFO ] Deduced a trap composed of 5 places in 118 ms of which 1 ms to minimize.
[2023-03-22 05:47:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 165 ms
[2023-03-22 05:47:49] [INFO ] After 1887ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :14
Attempting to minimize the solution found.
Minimization took 348 ms.
[2023-03-22 05:47:50] [INFO ] After 3715ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :14
Parikh walk visited 0 properties in 159 ms.
Support contains 20 out of 518 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 518/518 places, 436/436 transitions.
Applied a total of 0 rules in 8 ms. Remains 518 /518 variables (removed 0) and now considering 436/436 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 518/518 places, 436/436 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 518/518 places, 436/436 transitions.
Applied a total of 0 rules in 9 ms. Remains 518 /518 variables (removed 0) and now considering 436/436 (removed 0) transitions.
[2023-03-22 05:47:50] [INFO ] Invariant cache hit.
[2023-03-22 05:47:51] [INFO ] Implicit Places using invariants in 505 ms returned []
[2023-03-22 05:47:51] [INFO ] Invariant cache hit.
[2023-03-22 05:47:51] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-22 05:47:51] [INFO ] Implicit Places using invariants and state equation in 658 ms returned []
Implicit Place search using SMT with State Equation took 1170 ms to find 0 implicit places.
[2023-03-22 05:47:51] [INFO ] Redundant transitions in 22 ms returned []
[2023-03-22 05:47:51] [INFO ] Invariant cache hit.
[2023-03-22 05:47:52] [INFO ] Dead Transitions using invariants and state equation in 317 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1550 ms. Remains : 518/518 places, 436/436 transitions.
Partial Free-agglomeration rule applied 107 times.
Drop transitions removed 107 transitions
Iterating global reduction 0 with 107 rules applied. Total rules applied 107 place count 518 transition count 436
Applied a total of 107 rules in 53 ms. Remains 518 /518 variables (removed 0) and now considering 436/436 (removed 0) transitions.
Running SMT prover for 14 properties.
// Phase 1: matrix 436 rows 518 cols
[2023-03-22 05:47:52] [INFO ] Computed 218 place invariants in 2 ms
[2023-03-22 05:47:52] [INFO ] After 220ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:14
[2023-03-22 05:47:52] [INFO ] [Nat]Absence check using 218 positive place invariants in 79 ms returned sat
[2023-03-22 05:47:53] [INFO ] After 672ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :14
[2023-03-22 05:47:53] [INFO ] State equation strengthened by 97 read => feed constraints.
[2023-03-22 05:47:54] [INFO ] After 420ms SMT Verify possible using 97 Read/Feed constraints in natural domain returned unsat :0 sat :14
[2023-03-22 05:47:54] [INFO ] Deduced a trap composed of 5 places in 120 ms of which 0 ms to minimize.
[2023-03-22 05:47:54] [INFO ] Deduced a trap composed of 6 places in 137 ms of which 1 ms to minimize.
[2023-03-22 05:47:54] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 333 ms
[2023-03-22 05:47:54] [INFO ] Deduced a trap composed of 5 places in 275 ms of which 1 ms to minimize.
[2023-03-22 05:47:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 322 ms
[2023-03-22 05:47:55] [INFO ] Deduced a trap composed of 6 places in 148 ms of which 0 ms to minimize.
[2023-03-22 05:47:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 192 ms
[2023-03-22 05:47:55] [INFO ] After 1805ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :14
Attempting to minimize the solution found.
Minimization took 497 ms.
[2023-03-22 05:47:55] [INFO ] After 3624ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :14
[2023-03-22 05:47:56] [INFO ] Flatten gal took : 67 ms
[2023-03-22 05:47:56] [INFO ] Flatten gal took : 58 ms
[2023-03-22 05:47:56] [INFO ] Input system was already deterministic with 1226 transitions.
Computed a total of 327 stabilizing places and 327 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 1366/1366 places, 1226/1226 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 1342 transition count 1202
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 1342 transition count 1202
Applied a total of 48 rules in 129 ms. Remains 1342 /1366 variables (removed 24) and now considering 1202/1226 (removed 24) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 129 ms. Remains : 1342/1366 places, 1202/1226 transitions.
[2023-03-22 05:47:56] [INFO ] Flatten gal took : 70 ms
[2023-03-22 05:47:56] [INFO ] Flatten gal took : 33 ms
[2023-03-22 05:47:56] [INFO ] Input system was already deterministic with 1202 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1366/1366 places, 1226/1226 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 1346 transition count 1206
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 1346 transition count 1206
Applied a total of 40 rules in 104 ms. Remains 1346 /1366 variables (removed 20) and now considering 1206/1226 (removed 20) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 117 ms. Remains : 1346/1366 places, 1206/1226 transitions.
[2023-03-22 05:47:56] [INFO ] Flatten gal took : 55 ms
[2023-03-22 05:47:56] [INFO ] Flatten gal took : 55 ms
[2023-03-22 05:47:56] [INFO ] Input system was already deterministic with 1206 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1366/1366 places, 1226/1226 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 1342 transition count 1202
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 1342 transition count 1202
Applied a total of 48 rules in 223 ms. Remains 1342 /1366 variables (removed 24) and now considering 1202/1226 (removed 24) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 223 ms. Remains : 1342/1366 places, 1202/1226 transitions.
[2023-03-22 05:47:57] [INFO ] Flatten gal took : 28 ms
[2023-03-22 05:47:57] [INFO ] Flatten gal took : 39 ms
[2023-03-22 05:47:57] [INFO ] Input system was already deterministic with 1202 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1366/1366 places, 1226/1226 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 1344 transition count 1204
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 1344 transition count 1204
Applied a total of 44 rules in 148 ms. Remains 1344 /1366 variables (removed 22) and now considering 1204/1226 (removed 22) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 148 ms. Remains : 1344/1366 places, 1204/1226 transitions.
[2023-03-22 05:47:57] [INFO ] Flatten gal took : 29 ms
[2023-03-22 05:47:57] [INFO ] Flatten gal took : 29 ms
[2023-03-22 05:47:57] [INFO ] Input system was already deterministic with 1204 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1366/1366 places, 1226/1226 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 1342 transition count 1202
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 1342 transition count 1202
Applied a total of 48 rules in 112 ms. Remains 1342 /1366 variables (removed 24) and now considering 1202/1226 (removed 24) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 112 ms. Remains : 1342/1366 places, 1202/1226 transitions.
[2023-03-22 05:47:57] [INFO ] Flatten gal took : 24 ms
[2023-03-22 05:47:57] [INFO ] Flatten gal took : 24 ms
[2023-03-22 05:47:57] [INFO ] Input system was already deterministic with 1202 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1366/1366 places, 1226/1226 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 1342 transition count 1202
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 1342 transition count 1202
Applied a total of 48 rules in 104 ms. Remains 1342 /1366 variables (removed 24) and now considering 1202/1226 (removed 24) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 104 ms. Remains : 1342/1366 places, 1202/1226 transitions.
[2023-03-22 05:47:58] [INFO ] Flatten gal took : 23 ms
[2023-03-22 05:47:58] [INFO ] Flatten gal took : 24 ms
[2023-03-22 05:47:58] [INFO ] Input system was already deterministic with 1202 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1366/1366 places, 1226/1226 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 277 transitions
Trivial Post-agglo rules discarded 277 transitions
Performed 277 trivial Post agglomeration. Transition count delta: 277
Iterating post reduction 0 with 277 rules applied. Total rules applied 277 place count 1365 transition count 948
Reduce places removed 277 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 278 rules applied. Total rules applied 555 place count 1088 transition count 947
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 556 place count 1087 transition count 947
Performed 144 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 144 Pre rules applied. Total rules applied 556 place count 1087 transition count 803
Deduced a syphon composed of 144 places in 1 ms
Reduce places removed 144 places and 0 transitions.
Iterating global reduction 3 with 288 rules applied. Total rules applied 844 place count 943 transition count 803
Discarding 19 places :
Symmetric choice reduction at 3 with 19 rule applications. Total rules 863 place count 924 transition count 784
Iterating global reduction 3 with 19 rules applied. Total rules applied 882 place count 924 transition count 784
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 19 Pre rules applied. Total rules applied 882 place count 924 transition count 765
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 3 with 38 rules applied. Total rules applied 920 place count 905 transition count 765
Performed 312 Post agglomeration using F-continuation condition.Transition count delta: 312
Deduced a syphon composed of 312 places in 0 ms
Reduce places removed 312 places and 0 transitions.
Iterating global reduction 3 with 624 rules applied. Total rules applied 1544 place count 593 transition count 453
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1545 place count 593 transition count 452
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1547 place count 592 transition count 451
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1549 place count 590 transition count 449
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1550 place count 589 transition count 449
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 1550 place count 589 transition count 447
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 1554 place count 587 transition count 447
Applied a total of 1554 rules in 206 ms. Remains 587 /1366 variables (removed 779) and now considering 447/1226 (removed 779) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 206 ms. Remains : 587/1366 places, 447/1226 transitions.
[2023-03-22 05:47:58] [INFO ] Flatten gal took : 18 ms
[2023-03-22 05:47:58] [INFO ] Flatten gal took : 13 ms
[2023-03-22 05:47:58] [INFO ] Input system was already deterministic with 447 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1366/1366 places, 1226/1226 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 279 transitions
Trivial Post-agglo rules discarded 279 transitions
Performed 279 trivial Post agglomeration. Transition count delta: 279
Iterating post reduction 0 with 279 rules applied. Total rules applied 279 place count 1365 transition count 946
Reduce places removed 279 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 280 rules applied. Total rules applied 559 place count 1086 transition count 945
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 560 place count 1085 transition count 945
Performed 146 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 146 Pre rules applied. Total rules applied 560 place count 1085 transition count 799
Deduced a syphon composed of 146 places in 1 ms
Reduce places removed 146 places and 0 transitions.
Iterating global reduction 3 with 292 rules applied. Total rules applied 852 place count 939 transition count 799
Discarding 22 places :
Symmetric choice reduction at 3 with 22 rule applications. Total rules 874 place count 917 transition count 777
Iterating global reduction 3 with 22 rules applied. Total rules applied 896 place count 917 transition count 777
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 21 Pre rules applied. Total rules applied 896 place count 917 transition count 756
Deduced a syphon composed of 21 places in 1 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 3 with 42 rules applied. Total rules applied 938 place count 896 transition count 756
Performed 310 Post agglomeration using F-continuation condition.Transition count delta: 310
Deduced a syphon composed of 310 places in 0 ms
Reduce places removed 310 places and 0 transitions.
Iterating global reduction 3 with 620 rules applied. Total rules applied 1558 place count 586 transition count 446
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1559 place count 586 transition count 445
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1561 place count 585 transition count 444
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1563 place count 583 transition count 442
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1564 place count 582 transition count 442
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 1564 place count 582 transition count 440
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 1568 place count 580 transition count 440
Applied a total of 1568 rules in 176 ms. Remains 580 /1366 variables (removed 786) and now considering 440/1226 (removed 786) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 176 ms. Remains : 580/1366 places, 440/1226 transitions.
[2023-03-22 05:47:58] [INFO ] Flatten gal took : 14 ms
[2023-03-22 05:47:58] [INFO ] Flatten gal took : 14 ms
[2023-03-22 05:47:58] [INFO ] Input system was already deterministic with 440 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1366/1366 places, 1226/1226 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 1344 transition count 1204
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 1344 transition count 1204
Applied a total of 44 rules in 183 ms. Remains 1344 /1366 variables (removed 22) and now considering 1204/1226 (removed 22) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 183 ms. Remains : 1344/1366 places, 1204/1226 transitions.
[2023-03-22 05:47:59] [INFO ] Flatten gal took : 50 ms
[2023-03-22 05:47:59] [INFO ] Flatten gal took : 24 ms
[2023-03-22 05:47:59] [INFO ] Input system was already deterministic with 1204 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1366/1366 places, 1226/1226 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 1341 transition count 1201
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 1341 transition count 1201
Applied a total of 50 rules in 111 ms. Remains 1341 /1366 variables (removed 25) and now considering 1201/1226 (removed 25) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 111 ms. Remains : 1341/1366 places, 1201/1226 transitions.
[2023-03-22 05:47:59] [INFO ] Flatten gal took : 22 ms
[2023-03-22 05:47:59] [INFO ] Flatten gal took : 23 ms
[2023-03-22 05:47:59] [INFO ] Input system was already deterministic with 1201 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1366/1366 places, 1226/1226 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 1341 transition count 1201
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 1341 transition count 1201
Applied a total of 50 rules in 110 ms. Remains 1341 /1366 variables (removed 25) and now considering 1201/1226 (removed 25) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 110 ms. Remains : 1341/1366 places, 1201/1226 transitions.
[2023-03-22 05:47:59] [INFO ] Flatten gal took : 24 ms
[2023-03-22 05:47:59] [INFO ] Flatten gal took : 24 ms
[2023-03-22 05:47:59] [INFO ] Input system was already deterministic with 1201 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1366/1366 places, 1226/1226 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 279 transitions
Trivial Post-agglo rules discarded 279 transitions
Performed 279 trivial Post agglomeration. Transition count delta: 279
Iterating post reduction 0 with 279 rules applied. Total rules applied 279 place count 1365 transition count 946
Reduce places removed 279 places and 0 transitions.
Iterating post reduction 1 with 279 rules applied. Total rules applied 558 place count 1086 transition count 946
Performed 146 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 146 Pre rules applied. Total rules applied 558 place count 1086 transition count 800
Deduced a syphon composed of 146 places in 2 ms
Reduce places removed 146 places and 0 transitions.
Iterating global reduction 2 with 292 rules applied. Total rules applied 850 place count 940 transition count 800
Discarding 23 places :
Symmetric choice reduction at 2 with 23 rule applications. Total rules 873 place count 917 transition count 777
Iterating global reduction 2 with 23 rules applied. Total rules applied 896 place count 917 transition count 777
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 22 Pre rules applied. Total rules applied 896 place count 917 transition count 755
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 44 rules applied. Total rules applied 940 place count 895 transition count 755
Performed 307 Post agglomeration using F-continuation condition.Transition count delta: 307
Deduced a syphon composed of 307 places in 0 ms
Reduce places removed 307 places and 0 transitions.
Iterating global reduction 2 with 614 rules applied. Total rules applied 1554 place count 588 transition count 448
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1555 place count 588 transition count 447
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1557 place count 587 transition count 446
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1559 place count 585 transition count 444
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1560 place count 584 transition count 444
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 1560 place count 584 transition count 442
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 1564 place count 582 transition count 442
Applied a total of 1564 rules in 219 ms. Remains 582 /1366 variables (removed 784) and now considering 442/1226 (removed 784) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 219 ms. Remains : 582/1366 places, 442/1226 transitions.
[2023-03-22 05:47:59] [INFO ] Flatten gal took : 11 ms
[2023-03-22 05:47:59] [INFO ] Flatten gal took : 12 ms
[2023-03-22 05:47:59] [INFO ] Input system was already deterministic with 442 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1366/1366 places, 1226/1226 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 278 transitions
Trivial Post-agglo rules discarded 278 transitions
Performed 278 trivial Post agglomeration. Transition count delta: 278
Iterating post reduction 0 with 278 rules applied. Total rules applied 278 place count 1365 transition count 947
Reduce places removed 278 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 281 rules applied. Total rules applied 559 place count 1087 transition count 944
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 562 place count 1084 transition count 944
Performed 145 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 145 Pre rules applied. Total rules applied 562 place count 1084 transition count 799
Deduced a syphon composed of 145 places in 1 ms
Reduce places removed 145 places and 0 transitions.
Iterating global reduction 3 with 290 rules applied. Total rules applied 852 place count 939 transition count 799
Discarding 21 places :
Symmetric choice reduction at 3 with 21 rule applications. Total rules 873 place count 918 transition count 778
Iterating global reduction 3 with 21 rules applied. Total rules applied 894 place count 918 transition count 778
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 20 Pre rules applied. Total rules applied 894 place count 918 transition count 758
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 40 rules applied. Total rules applied 934 place count 898 transition count 758
Performed 310 Post agglomeration using F-continuation condition.Transition count delta: 310
Deduced a syphon composed of 310 places in 0 ms
Reduce places removed 310 places and 0 transitions.
Iterating global reduction 3 with 620 rules applied. Total rules applied 1554 place count 588 transition count 448
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1555 place count 588 transition count 447
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1557 place count 587 transition count 446
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1559 place count 585 transition count 444
Applied a total of 1559 rules in 176 ms. Remains 585 /1366 variables (removed 781) and now considering 444/1226 (removed 782) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 177 ms. Remains : 585/1366 places, 444/1226 transitions.
[2023-03-22 05:48:00] [INFO ] Flatten gal took : 12 ms
[2023-03-22 05:48:00] [INFO ] Flatten gal took : 13 ms
[2023-03-22 05:48:00] [INFO ] Input system was already deterministic with 444 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1366/1366 places, 1226/1226 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 277 transitions
Trivial Post-agglo rules discarded 277 transitions
Performed 277 trivial Post agglomeration. Transition count delta: 277
Iterating post reduction 0 with 277 rules applied. Total rules applied 277 place count 1365 transition count 948
Reduce places removed 277 places and 0 transitions.
Iterating post reduction 1 with 277 rules applied. Total rules applied 554 place count 1088 transition count 948
Performed 147 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 147 Pre rules applied. Total rules applied 554 place count 1088 transition count 801
Deduced a syphon composed of 147 places in 1 ms
Reduce places removed 147 places and 0 transitions.
Iterating global reduction 2 with 294 rules applied. Total rules applied 848 place count 941 transition count 801
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 870 place count 919 transition count 779
Iterating global reduction 2 with 22 rules applied. Total rules applied 892 place count 919 transition count 779
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 20 Pre rules applied. Total rules applied 892 place count 919 transition count 759
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 932 place count 899 transition count 759
Performed 309 Post agglomeration using F-continuation condition.Transition count delta: 309
Deduced a syphon composed of 309 places in 0 ms
Reduce places removed 309 places and 0 transitions.
Iterating global reduction 2 with 618 rules applied. Total rules applied 1550 place count 590 transition count 450
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1551 place count 590 transition count 449
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1553 place count 589 transition count 448
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 1554 place count 589 transition count 448
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1556 place count 587 transition count 446
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1557 place count 586 transition count 446
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 1557 place count 586 transition count 444
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 1561 place count 584 transition count 444
Applied a total of 1561 rules in 175 ms. Remains 584 /1366 variables (removed 782) and now considering 444/1226 (removed 782) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 175 ms. Remains : 584/1366 places, 444/1226 transitions.
[2023-03-22 05:48:00] [INFO ] Flatten gal took : 12 ms
[2023-03-22 05:48:00] [INFO ] Flatten gal took : 13 ms
[2023-03-22 05:48:00] [INFO ] Input system was already deterministic with 444 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1366/1366 places, 1226/1226 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 275 transitions
Trivial Post-agglo rules discarded 275 transitions
Performed 275 trivial Post agglomeration. Transition count delta: 275
Iterating post reduction 0 with 275 rules applied. Total rules applied 275 place count 1365 transition count 950
Reduce places removed 275 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 278 rules applied. Total rules applied 553 place count 1090 transition count 947
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 556 place count 1087 transition count 947
Performed 145 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 145 Pre rules applied. Total rules applied 556 place count 1087 transition count 802
Deduced a syphon composed of 145 places in 1 ms
Reduce places removed 145 places and 0 transitions.
Iterating global reduction 3 with 290 rules applied. Total rules applied 846 place count 942 transition count 802
Discarding 23 places :
Symmetric choice reduction at 3 with 23 rule applications. Total rules 869 place count 919 transition count 779
Iterating global reduction 3 with 23 rules applied. Total rules applied 892 place count 919 transition count 779
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 22 Pre rules applied. Total rules applied 892 place count 919 transition count 757
Deduced a syphon composed of 22 places in 1 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 3 with 44 rules applied. Total rules applied 936 place count 897 transition count 757
Performed 308 Post agglomeration using F-continuation condition.Transition count delta: 308
Deduced a syphon composed of 308 places in 1 ms
Reduce places removed 308 places and 0 transitions.
Iterating global reduction 3 with 616 rules applied. Total rules applied 1552 place count 589 transition count 449
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1553 place count 589 transition count 448
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1555 place count 588 transition count 447
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1557 place count 586 transition count 445
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1558 place count 585 transition count 445
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 1558 place count 585 transition count 443
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 1562 place count 583 transition count 443
Applied a total of 1562 rules in 141 ms. Remains 583 /1366 variables (removed 783) and now considering 443/1226 (removed 783) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 141 ms. Remains : 583/1366 places, 443/1226 transitions.
[2023-03-22 05:48:00] [INFO ] Flatten gal took : 12 ms
[2023-03-22 05:48:00] [INFO ] Flatten gal took : 12 ms
[2023-03-22 05:48:00] [INFO ] Input system was already deterministic with 443 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1366/1366 places, 1226/1226 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 1342 transition count 1202
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 1342 transition count 1202
Applied a total of 48 rules in 102 ms. Remains 1342 /1366 variables (removed 24) and now considering 1202/1226 (removed 24) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 102 ms. Remains : 1342/1366 places, 1202/1226 transitions.
[2023-03-22 05:48:00] [INFO ] Flatten gal took : 26 ms
[2023-03-22 05:48:00] [INFO ] Flatten gal took : 27 ms
[2023-03-22 05:48:00] [INFO ] Input system was already deterministic with 1202 transitions.
[2023-03-22 05:48:00] [INFO ] Flatten gal took : 27 ms
[2023-03-22 05:48:00] [INFO ] Flatten gal took : 27 ms
[2023-03-22 05:48:00] [INFO ] Export to MCC of 16 properties in file /home/mcc/execution/CTLFireability.sr.xml took 3 ms.
[2023-03-22 05:48:00] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1366 places, 1226 transitions and 3172 arcs took 5 ms.
Total runtime 95598 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --ctl=/tmp/828/ctl_0_ --ctl=/tmp/828/ctl_1_ --ctl=/tmp/828/ctl_2_ --ctl=/tmp/828/ctl_3_ --ctl=/tmp/828/ctl_4_ --ctl=/tmp/828/ctl_5_ --ctl=/tmp/828/ctl_6_ --ctl=/tmp/828/ctl_7_ --ctl=/tmp/828/ctl_8_ --ctl=/tmp/828/ctl_9_ --ctl=/tmp/828/ctl_10_ --ctl=/tmp/828/ctl_11_ --ctl=/tmp/828/ctl_12_ --ctl=/tmp/828/ctl_13_ --ctl=/tmp/828/ctl_14_ --ctl=/tmp/828/ctl_15_ --mu-par --mu-opt
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393220 kB
MemFree: 7328584 kB
After kill :
MemTotal: 16393220 kB
MemFree: 16095900 kB

BK_TIME_CONFINEMENT_REACHED

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -timeout 360 -rebuildPNML
mcc2023

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="ShieldPPPt-PT-020B"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
echo " Input is ShieldPPPt-PT-020B, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r393-oct2-167903717300634"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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