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.r522-tall-167987247100266.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool marciexred
Input is EisenbergMcGuire-PT-09, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r522-tall-167987247100266
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.8M
-rw-r--r-- 1 mcc users 6.3K Mar 23 15:21 CTLCardinality.txt
-rw-r--r-- 1 mcc users 59K Mar 23 15:21 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Mar 23 15:19 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Mar 23 15:19 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Mar 23 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Mar 23 07:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.2K Mar 23 07:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 23 07:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Mar 26 22:42 NewModel
-rw-r--r-- 1 mcc users 16K Mar 23 15:23 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 160K Mar 23 15:23 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Mar 23 15:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 79K Mar 23 15:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 23 07:07 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 23 07:07 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 26 22:42 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 26 22:42 instance
-rw-r--r-- 1 mcc users 6 Mar 26 22:42 iscolored
-rw-r--r-- 1 mcc users 2.3M Mar 31 16:48 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 EisenbergMcGuire-PT-09-CTLFireability-00
FORMULA_NAME EisenbergMcGuire-PT-09-CTLFireability-01
FORMULA_NAME EisenbergMcGuire-PT-09-CTLFireability-02
FORMULA_NAME EisenbergMcGuire-PT-09-CTLFireability-03
FORMULA_NAME EisenbergMcGuire-PT-09-CTLFireability-04
FORMULA_NAME EisenbergMcGuire-PT-09-CTLFireability-05
FORMULA_NAME EisenbergMcGuire-PT-09-CTLFireability-06
FORMULA_NAME EisenbergMcGuire-PT-09-CTLFireability-07
FORMULA_NAME EisenbergMcGuire-PT-09-CTLFireability-08
FORMULA_NAME EisenbergMcGuire-PT-09-CTLFireability-09
FORMULA_NAME EisenbergMcGuire-PT-09-CTLFireability-10
FORMULA_NAME EisenbergMcGuire-PT-09-CTLFireability-11
FORMULA_NAME EisenbergMcGuire-PT-09-CTLFireability-12
FORMULA_NAME EisenbergMcGuire-PT-09-CTLFireability-13
FORMULA_NAME EisenbergMcGuire-PT-09-CTLFireability-14
FORMULA_NAME EisenbergMcGuire-PT-09-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1680832085948

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=marciexred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=EisenbergMcGuire-PT-09
Applying reductions before tool marcie
Invoking reducer
Running Version 202304061127
[2023-04-07 01:48:07] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-04-07 01:48:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-04-07 01:48:07] [INFO ] Load time of PNML (sax parser for PT used): 182 ms
[2023-04-07 01:48:07] [INFO ] Transformed 891 places.
[2023-04-07 01:48:07] [INFO ] Transformed 3888 transitions.
[2023-04-07 01:48:07] [INFO ] Found NUPN structural information;
[2023-04-07 01:48:07] [INFO ] Parsed PT model containing 891 places and 3888 transitions and 18792 arcs in 276 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 10 ms.
Support contains 117 out of 891 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 891/891 places, 3888/3888 transitions.
Discarding 61 places :
Symmetric choice reduction at 0 with 61 rule applications. Total rules 61 place count 830 transition count 3339
Iterating global reduction 0 with 61 rules applied. Total rules applied 122 place count 830 transition count 3339
Applied a total of 122 rules in 151 ms. Remains 830 /891 variables (removed 61) and now considering 3339/3888 (removed 549) transitions.
[2023-04-07 01:48:07] [INFO ] Flow matrix only has 1260 transitions (discarded 2079 similar events)
// Phase 1: matrix 1260 rows 830 cols
[2023-04-07 01:48:07] [INFO ] Computed 28 invariants in 31 ms
[2023-04-07 01:48:08] [INFO ] Implicit Places using invariants in 538 ms returned []
[2023-04-07 01:48:08] [INFO ] Flow matrix only has 1260 transitions (discarded 2079 similar events)
[2023-04-07 01:48:08] [INFO ] Invariant cache hit.
[2023-04-07 01:48:08] [INFO ] State equation strengthened by 444 read => feed constraints.
[2023-04-07 01:48:11] [INFO ] Implicit Places using invariants and state equation in 3147 ms returned []
Implicit Place search using SMT with State Equation took 3709 ms to find 0 implicit places.
[2023-04-07 01:48:11] [INFO ] Flow matrix only has 1260 transitions (discarded 2079 similar events)
[2023-04-07 01:48:11] [INFO ] Invariant cache hit.
[2023-04-07 01:48:12] [INFO ] Dead Transitions using invariants and state equation in 1033 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 830/891 places, 3339/3888 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4896 ms. Remains : 830/891 places, 3339/3888 transitions.
Support contains 117 out of 830 places after structural reductions.
[2023-04-07 01:48:13] [INFO ] Flatten gal took : 319 ms
[2023-04-07 01:48:13] [INFO ] Flatten gal took : 142 ms
[2023-04-07 01:48:13] [INFO ] Input system was already deterministic with 3339 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 457 ms. (steps per millisecond=21 ) properties (out of 86) seen :16
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 70) 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 70) 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 70) 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 70) 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 70) 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 70) 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 70) 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 70) 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 70) 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 70) 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 70) 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 70) 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 70) 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 70) 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 70) 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 70) 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 70) 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 70) 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 70) 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 70) 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 70) 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 70) 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 70) 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 70) 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 70) 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 70) 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 70) 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 70) 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 70) 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 70) 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 70) 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 70) 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 70) 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 70) 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 70) 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 70) 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 70) 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 70) 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 70) 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 70) 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 70) 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 70) 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 70) 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 70) 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 70) 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 70) 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 70) 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 70) 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 70) 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 70) seen :0
Running SMT prover for 70 properties.
[2023-04-07 01:48:14] [INFO ] Flow matrix only has 1260 transitions (discarded 2079 similar events)
[2023-04-07 01:48:14] [INFO ] Invariant cache hit.
[2023-04-07 01:48:15] [INFO ] [Real]Absence check using 19 positive place invariants in 22 ms returned sat
[2023-04-07 01:48:15] [INFO ] [Real]Absence check using 19 positive and 9 generalized place invariants in 5 ms returned sat
[2023-04-07 01:48:15] [INFO ] After 1238ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:69
[2023-04-07 01:48:16] [INFO ] [Nat]Absence check using 19 positive place invariants in 22 ms returned sat
[2023-04-07 01:48:16] [INFO ] [Nat]Absence check using 19 positive and 9 generalized place invariants in 10 ms returned sat
[2023-04-07 01:48:21] [INFO ] After 3839ms SMT Verify possible using state equation in natural domain returned unsat :4 sat :66
[2023-04-07 01:48:21] [INFO ] State equation strengthened by 444 read => feed constraints.
[2023-04-07 01:48:26] [INFO ] After 4981ms SMT Verify possible using 444 Read/Feed constraints in natural domain returned unsat :4 sat :66
[2023-04-07 01:48:26] [INFO ] Deduced a trap composed of 36 places in 372 ms of which 6 ms to minimize.
[2023-04-07 01:48:27] [INFO ] Deduced a trap composed of 3 places in 362 ms of which 1 ms to minimize.
[2023-04-07 01:48:27] [INFO ] Deduced a trap composed of 3 places in 352 ms of which 2 ms to minimize.
[2023-04-07 01:48:28] [INFO ] Deduced a trap composed of 88 places in 357 ms of which 1 ms to minimize.
[2023-04-07 01:48:28] [INFO ] Deduced a trap composed of 48 places in 343 ms of which 1 ms to minimize.
[2023-04-07 01:48:28] [INFO ] Deduced a trap composed of 3 places in 174 ms of which 0 ms to minimize.
[2023-04-07 01:48:28] [INFO ] Deduced a trap composed of 3 places in 169 ms of which 0 ms to minimize.
[2023-04-07 01:48:29] [INFO ] Deduced a trap composed of 64 places in 134 ms of which 0 ms to minimize.
[2023-04-07 01:48:29] [INFO ] Deduced a trap composed of 26 places in 131 ms of which 1 ms to minimize.
[2023-04-07 01:48:29] [INFO ] Deduced a trap composed of 3 places in 133 ms of which 1 ms to minimize.
[2023-04-07 01:48:29] [INFO ] Deduced a trap composed of 3 places in 141 ms of which 1 ms to minimize.
[2023-04-07 01:48:29] [INFO ] Deduced a trap composed of 39 places in 109 ms of which 1 ms to minimize.
[2023-04-07 01:48:29] [INFO ] Deduced a trap composed of 29 places in 77 ms of which 0 ms to minimize.
[2023-04-07 01:48:29] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 3631 ms
[2023-04-07 01:48:30] [INFO ] Deduced a trap composed of 3 places in 191 ms of which 1 ms to minimize.
[2023-04-07 01:48:30] [INFO ] Deduced a trap composed of 45 places in 165 ms of which 1 ms to minimize.
[2023-04-07 01:48:30] [INFO ] Deduced a trap composed of 63 places in 173 ms of which 0 ms to minimize.
[2023-04-07 01:48:30] [INFO ] Deduced a trap composed of 50 places in 164 ms of which 0 ms to minimize.
[2023-04-07 01:48:31] [INFO ] Deduced a trap composed of 3 places in 128 ms of which 0 ms to minimize.
[2023-04-07 01:48:31] [INFO ] Deduced a trap composed of 20 places in 125 ms of which 0 ms to minimize.
[2023-04-07 01:48:31] [INFO ] Deduced a trap composed of 23 places in 99 ms of which 2 ms to minimize.
[2023-04-07 01:48:31] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1493 ms
[2023-04-07 01:48:31] [INFO ] Deduced a trap composed of 32 places in 105 ms of which 0 ms to minimize.
[2023-04-07 01:48:31] [INFO ] Deduced a trap composed of 23 places in 113 ms of which 1 ms to minimize.
[2023-04-07 01:48:32] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 368 ms
[2023-04-07 01:48:32] [INFO ] Deduced a trap composed of 44 places in 108 ms of which 0 ms to minimize.
[2023-04-07 01:48:32] [INFO ] Deduced a trap composed of 41 places in 77 ms of which 0 ms to minimize.
[2023-04-07 01:48:32] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 431 ms
[2023-04-07 01:48:32] [INFO ] Deduced a trap composed of 32 places in 67 ms of which 0 ms to minimize.
[2023-04-07 01:48:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 181 ms
[2023-04-07 01:48:33] [INFO ] Deduced a trap composed of 62 places in 78 ms of which 0 ms to minimize.
[2023-04-07 01:48:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 178 ms
[2023-04-07 01:48:33] [INFO ] Deduced a trap composed of 3 places in 100 ms of which 0 ms to minimize.
[2023-04-07 01:48:33] [INFO ] Deduced a trap composed of 35 places in 75 ms of which 0 ms to minimize.
[2023-04-07 01:48:33] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 317 ms
[2023-04-07 01:48:33] [INFO ] Deduced a trap composed of 38 places in 149 ms of which 1 ms to minimize.
[2023-04-07 01:48:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 248 ms
[2023-04-07 01:48:34] [INFO ] Deduced a trap composed of 29 places in 87 ms of which 2 ms to minimize.
[2023-04-07 01:48:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 181 ms
[2023-04-07 01:48:34] [INFO ] Deduced a trap composed of 29 places in 71 ms of which 1 ms to minimize.
[2023-04-07 01:48:34] [INFO ] Deduced a trap composed of 20 places in 81 ms of which 0 ms to minimize.
[2023-04-07 01:48:34] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 299 ms
[2023-04-07 01:48:35] [INFO ] Deduced a trap composed of 38 places in 76 ms of which 0 ms to minimize.
[2023-04-07 01:48:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 181 ms
[2023-04-07 01:48:35] [INFO ] Deduced a trap composed of 17 places in 85 ms of which 1 ms to minimize.
[2023-04-07 01:48:35] [INFO ] Deduced a trap composed of 14 places in 82 ms of which 4 ms to minimize.
[2023-04-07 01:48:35] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 324 ms
[2023-04-07 01:48:36] [INFO ] Deduced a trap composed of 38 places in 77 ms of which 0 ms to minimize.
[2023-04-07 01:48:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 179 ms
[2023-04-07 01:48:37] [INFO ] Deduced a trap composed of 38 places in 75 ms of which 1 ms to minimize.
[2023-04-07 01:48:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 177 ms
[2023-04-07 01:48:38] [INFO ] Deduced a trap composed of 26 places in 68 ms of which 0 ms to minimize.
[2023-04-07 01:48:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 160 ms
[2023-04-07 01:48:39] [INFO ] Deduced a trap composed of 29 places in 84 ms of which 1 ms to minimize.
[2023-04-07 01:48:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 178 ms
[2023-04-07 01:48:40] [INFO ] Deduced a trap composed of 35 places in 86 ms of which 2 ms to minimize.
[2023-04-07 01:48:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 180 ms
[2023-04-07 01:48:40] [INFO ] Deduced a trap composed of 41 places in 77 ms of which 0 ms to minimize.
[2023-04-07 01:48:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 169 ms
[2023-04-07 01:48:40] [INFO ] After 19377ms SMT Verify possible using trap constraints in natural domain returned unsat :5 sat :65
Attempting to minimize the solution found.
Minimization took 1 ms.
[2023-04-07 01:48:40] [INFO ] After 25019ms SMT Verify possible using all constraints in natural domain returned unsat :5 sat :65
Fused 70 Parikh solutions to 65 different solutions.
Parikh walk visited 0 properties in 1971 ms.
Support contains 98 out of 830 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 830/830 places, 3339/3339 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 830 transition count 3334
Reduce places removed 5 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 6 rules applied. Total rules applied 11 place count 825 transition count 3333
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 12 place count 824 transition count 3333
Performed 235 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 235 Pre rules applied. Total rules applied 12 place count 824 transition count 3098
Deduced a syphon composed of 235 places in 3 ms
Reduce places removed 235 places and 0 transitions.
Iterating global reduction 3 with 470 rules applied. Total rules applied 482 place count 589 transition count 3098
Performed 69 Post agglomeration using F-continuation condition.Transition count delta: 69
Deduced a syphon composed of 69 places in 3 ms
Reduce places removed 69 places and 0 transitions.
Iterating global reduction 3 with 138 rules applied. Total rules applied 620 place count 520 transition count 3029
Applied a total of 620 rules in 310 ms. Remains 520 /830 variables (removed 310) and now considering 3029/3339 (removed 310) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 311 ms. Remains : 520/830 places, 3029/3339 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 250 ms. (steps per millisecond=40 ) properties (out of 65) 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 65) 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 65) 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 65) 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 65) 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 65) 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 65) 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 65) 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 65) 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 65) 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 65) 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 65) 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 65) 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 65) 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 65) 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 65) 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 65) 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 65) 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 65) 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 65) 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 65) 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 65) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 64) 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 64) 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 64) 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 64) 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 64) 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 64) 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 64) 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 64) 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 64) 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 64) 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 64) 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 64) 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 64) 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 64) 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 64) 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 64) 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 64) 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 64) 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 64) 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 64) 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 64) 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 64) 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 64) 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 64) 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 64) 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 64) 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 64) 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 64) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 64) 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 64) 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 64) 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 64) 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 64) 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 64) 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 64) 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 64) 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 64) 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 64) 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 64) 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 64) 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 64) 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 64) 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 64) 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 64) seen :0
Interrupted probabilistic random walk after 163650 steps, run timeout after 3001 ms. (steps per millisecond=54 ) properties seen :{10=1, 20=1, 24=1, 29=1, 31=1, 33=1, 34=1, 46=1, 47=1, 52=1}
Probabilistic random walk after 163650 steps, saw 111939 distinct states, run finished after 3001 ms. (steps per millisecond=54 ) properties seen :10
Running SMT prover for 54 properties.
[2023-04-07 01:48:46] [INFO ] Flow matrix only has 950 transitions (discarded 2079 similar events)
// Phase 1: matrix 950 rows 520 cols
[2023-04-07 01:48:46] [INFO ] Computed 28 invariants in 4 ms
[2023-04-07 01:48:47] [INFO ] [Real]Absence check using 19 positive place invariants in 9 ms returned sat
[2023-04-07 01:48:47] [INFO ] [Real]Absence check using 19 positive and 9 generalized place invariants in 8 ms returned sat
[2023-04-07 01:48:47] [INFO ] After 616ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:54
[2023-04-07 01:48:47] [INFO ] [Nat]Absence check using 19 positive place invariants in 10 ms returned sat
[2023-04-07 01:48:47] [INFO ] [Nat]Absence check using 19 positive and 9 generalized place invariants in 4 ms returned sat
[2023-04-07 01:48:49] [INFO ] After 1964ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :54
[2023-04-07 01:48:49] [INFO ] State equation strengthened by 444 read => feed constraints.
[2023-04-07 01:48:52] [INFO ] After 2637ms SMT Verify possible using 444 Read/Feed constraints in natural domain returned unsat :0 sat :54
[2023-04-07 01:48:52] [INFO ] Deduced a trap composed of 3 places in 186 ms of which 1 ms to minimize.
[2023-04-07 01:48:53] [INFO ] Deduced a trap composed of 3 places in 136 ms of which 1 ms to minimize.
[2023-04-07 01:48:53] [INFO ] Deduced a trap composed of 3 places in 139 ms of which 1 ms to minimize.
[2023-04-07 01:48:53] [INFO ] Deduced a trap composed of 48 places in 143 ms of which 0 ms to minimize.
[2023-04-07 01:48:53] [INFO ] Deduced a trap composed of 30 places in 141 ms of which 1 ms to minimize.
[2023-04-07 01:48:53] [INFO ] Deduced a trap composed of 3 places in 144 ms of which 1 ms to minimize.
[2023-04-07 01:48:53] [INFO ] Deduced a trap composed of 26 places in 114 ms of which 1 ms to minimize.
[2023-04-07 01:48:54] [INFO ] Deduced a trap composed of 17 places in 139 ms of which 1 ms to minimize.
[2023-04-07 01:48:54] [INFO ] Deduced a trap composed of 3 places in 115 ms of which 1 ms to minimize.
[2023-04-07 01:48:54] [INFO ] Deduced a trap composed of 27 places in 101 ms of which 1 ms to minimize.
[2023-04-07 01:48:54] [INFO ] Deduced a trap composed of 3 places in 103 ms of which 1 ms to minimize.
[2023-04-07 01:48:54] [INFO ] Deduced a trap composed of 34 places in 85 ms of which 1 ms to minimize.
[2023-04-07 01:48:54] [INFO ] Deduced a trap composed of 3 places in 83 ms of which 1 ms to minimize.
[2023-04-07 01:48:54] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 0 ms to minimize.
[2023-04-07 01:48:54] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 2226 ms
[2023-04-07 01:48:55] [INFO ] Deduced a trap composed of 15 places in 88 ms of which 0 ms to minimize.
[2023-04-07 01:48:55] [INFO ] Deduced a trap composed of 30 places in 65 ms of which 0 ms to minimize.
[2023-04-07 01:48:55] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 259 ms
[2023-04-07 01:48:55] [INFO ] Deduced a trap composed of 32 places in 126 ms of which 1 ms to minimize.
[2023-04-07 01:48:55] [INFO ] Deduced a trap composed of 28 places in 106 ms of which 1 ms to minimize.
[2023-04-07 01:48:55] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 343 ms
[2023-04-07 01:48:55] [INFO ] Deduced a trap composed of 26 places in 105 ms of which 0 ms to minimize.
[2023-04-07 01:48:55] [INFO ] Deduced a trap composed of 22 places in 95 ms of which 0 ms to minimize.
[2023-04-07 01:48:55] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 305 ms
[2023-04-07 01:48:56] [INFO ] Deduced a trap composed of 21 places in 66 ms of which 1 ms to minimize.
[2023-04-07 01:48:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 140 ms
[2023-04-07 01:48:56] [INFO ] Deduced a trap composed of 3 places in 81 ms of which 0 ms to minimize.
[2023-04-07 01:48:56] [INFO ] Deduced a trap composed of 13 places in 60 ms of which 0 ms to minimize.
[2023-04-07 01:48:56] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 250 ms
[2023-04-07 01:48:56] [INFO ] Deduced a trap composed of 25 places in 88 ms of which 0 ms to minimize.
[2023-04-07 01:48:56] [INFO ] Deduced a trap composed of 27 places in 66 ms of which 1 ms to minimize.
[2023-04-07 01:48:56] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 262 ms
[2023-04-07 01:48:57] [INFO ] Deduced a trap composed of 24 places in 100 ms of which 0 ms to minimize.
[2023-04-07 01:48:57] [INFO ] Deduced a trap composed of 21 places in 76 ms of which 3 ms to minimize.
[2023-04-07 01:48:57] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 3 ms to minimize.
[2023-04-07 01:48:57] [INFO ] Deduced a trap composed of 27 places in 62 ms of which 1 ms to minimize.
[2023-04-07 01:48:57] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 477 ms
[2023-04-07 01:48:57] [INFO ] Deduced a trap composed of 24 places in 64 ms of which 0 ms to minimize.
[2023-04-07 01:48:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 130 ms
[2023-04-07 01:48:57] [INFO ] Deduced a trap composed of 39 places in 64 ms of which 0 ms to minimize.
[2023-04-07 01:48:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 130 ms
[2023-04-07 01:48:58] [INFO ] Deduced a trap composed of 17 places in 64 ms of which 1 ms to minimize.
[2023-04-07 01:48:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 134 ms
[2023-04-07 01:48:59] [INFO ] Deduced a trap composed of 59 places in 65 ms of which 1 ms to minimize.
[2023-04-07 01:48:59] [INFO ] Deduced a trap composed of 32 places in 63 ms of which 0 ms to minimize.
[2023-04-07 01:48:59] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 219 ms
[2023-04-07 01:48:59] [INFO ] Deduced a trap composed of 23 places in 65 ms of which 0 ms to minimize.
[2023-04-07 01:48:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 127 ms
[2023-04-07 01:49:00] [INFO ] Deduced a trap composed of 90 places in 218 ms of which 1 ms to minimize.
[2023-04-07 01:49:00] [INFO ] Deduced a trap composed of 35 places in 71 ms of which 0 ms to minimize.
[2023-04-07 01:49:00] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 391 ms
[2023-04-07 01:49:00] [INFO ] Deduced a trap composed of 19 places in 96 ms of which 1 ms to minimize.
[2023-04-07 01:49:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 163 ms
[2023-04-07 01:49:00] [INFO ] Deduced a trap composed of 24 places in 83 ms of which 1 ms to minimize.
[2023-04-07 01:49:01] [INFO ] Deduced a trap composed of 26 places in 72 ms of which 0 ms to minimize.
[2023-04-07 01:49:01] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 280 ms
[2023-04-07 01:49:01] [INFO ] Deduced a trap composed of 11 places in 154 ms of which 1 ms to minimize.
[2023-04-07 01:49:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 221 ms
[2023-04-07 01:49:02] [INFO ] After 12453ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :54
Attempting to minimize the solution found.
Minimization took 2817 ms.
[2023-04-07 01:49:05] [INFO ] After 18105ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :54
Parikh walk visited 0 properties in 516 ms.
Support contains 87 out of 520 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 520/520 places, 3029/3029 transitions.
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 5 Pre rules applied. Total rules applied 0 place count 520 transition count 3024
Deduced a syphon composed of 5 places in 2 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 515 transition count 3024
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 12 place count 513 transition count 3006
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 513 transition count 3006
Applied a total of 14 rules in 151 ms. Remains 513 /520 variables (removed 7) and now considering 3006/3029 (removed 23) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 152 ms. Remains : 513/520 places, 3006/3029 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 327 ms. (steps per millisecond=30 ) properties (out of 54) 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 54) 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 54) 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 54) 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 54) 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 54) 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 54) 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 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 54) 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 54) 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 54) 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 54) 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 54) 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 54) 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 54) 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 54) 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 54) 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 54) 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 54) 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 54) 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 54) 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 54) 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 54) 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 54) 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 54) 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 54) 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 54) 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 54) 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 54) 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 54) 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 54) 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 54) 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 54) 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 54) 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 54) 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 54) 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 54) 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 54) 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 54) 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 54) 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 54) 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 54) 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 54) 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 54) 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 54) 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 54) 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 54) 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 54) 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 54) 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 54) 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 54) seen :0
Interrupted probabilistic random walk after 147790 steps, run timeout after 3001 ms. (steps per millisecond=49 ) properties seen :{0=1}
Probabilistic random walk after 147790 steps, saw 100983 distinct states, run finished after 3001 ms. (steps per millisecond=49 ) properties seen :1
Running SMT prover for 53 properties.
[2023-04-07 01:49:09] [INFO ] Flow matrix only has 927 transitions (discarded 2079 similar events)
// Phase 1: matrix 927 rows 513 cols
[2023-04-07 01:49:09] [INFO ] Computed 28 invariants in 8 ms
[2023-04-07 01:49:10] [INFO ] [Real]Absence check using 19 positive place invariants in 11 ms returned sat
[2023-04-07 01:49:10] [INFO ] [Real]Absence check using 19 positive and 9 generalized place invariants in 4 ms returned sat
[2023-04-07 01:49:10] [INFO ] After 943ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:53
[2023-04-07 01:49:10] [INFO ] [Nat]Absence check using 19 positive place invariants in 14 ms returned sat
[2023-04-07 01:49:10] [INFO ] [Nat]Absence check using 19 positive and 9 generalized place invariants in 4 ms returned sat
[2023-04-07 01:49:13] [INFO ] After 1899ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :53
[2023-04-07 01:49:13] [INFO ] State equation strengthened by 428 read => feed constraints.
[2023-04-07 01:49:15] [INFO ] After 2475ms SMT Verify possible using 428 Read/Feed constraints in natural domain returned unsat :0 sat :53
[2023-04-07 01:49:15] [INFO ] Deduced a trap composed of 3 places in 171 ms of which 0 ms to minimize.
[2023-04-07 01:49:16] [INFO ] Deduced a trap composed of 64 places in 173 ms of which 0 ms to minimize.
[2023-04-07 01:49:16] [INFO ] Deduced a trap composed of 3 places in 148 ms of which 1 ms to minimize.
[2023-04-07 01:49:16] [INFO ] Deduced a trap composed of 54 places in 175 ms of which 0 ms to minimize.
[2023-04-07 01:49:16] [INFO ] Deduced a trap composed of 35 places in 173 ms of which 1 ms to minimize.
[2023-04-07 01:49:16] [INFO ] Deduced a trap composed of 32 places in 150 ms of which 1 ms to minimize.
[2023-04-07 01:49:17] [INFO ] Deduced a trap composed of 31 places in 128 ms of which 0 ms to minimize.
[2023-04-07 01:49:17] [INFO ] Deduced a trap composed of 3 places in 150 ms of which 0 ms to minimize.
[2023-04-07 01:49:17] [INFO ] Deduced a trap composed of 39 places in 148 ms of which 0 ms to minimize.
[2023-04-07 01:49:17] [INFO ] Deduced a trap composed of 23 places in 126 ms of which 0 ms to minimize.
[2023-04-07 01:49:17] [INFO ] Deduced a trap composed of 11 places in 130 ms of which 0 ms to minimize.
[2023-04-07 01:49:17] [INFO ] Deduced a trap composed of 22 places in 113 ms of which 0 ms to minimize.
[2023-04-07 01:49:18] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 2232 ms
[2023-04-07 01:49:18] [INFO ] Deduced a trap composed of 3 places in 87 ms of which 0 ms to minimize.
[2023-04-07 01:49:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 155 ms
[2023-04-07 01:49:18] [INFO ] Deduced a trap composed of 3 places in 175 ms of which 0 ms to minimize.
[2023-04-07 01:49:18] [INFO ] Deduced a trap composed of 30 places in 128 ms of which 1 ms to minimize.
[2023-04-07 01:49:18] [INFO ] Deduced a trap composed of 24 places in 101 ms of which 0 ms to minimize.
[2023-04-07 01:49:18] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 544 ms
[2023-04-07 01:49:19] [INFO ] Deduced a trap composed of 3 places in 63 ms of which 0 ms to minimize.
[2023-04-07 01:49:19] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 0 ms to minimize.
[2023-04-07 01:49:19] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 0 ms to minimize.
[2023-04-07 01:49:19] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 310 ms
[2023-04-07 01:49:19] [INFO ] Deduced a trap composed of 45 places in 119 ms of which 0 ms to minimize.
[2023-04-07 01:49:19] [INFO ] Deduced a trap composed of 38 places in 103 ms of which 0 ms to minimize.
[2023-04-07 01:49:19] [INFO ] Deduced a trap composed of 19 places in 80 ms of which 0 ms to minimize.
[2023-04-07 01:49:19] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 445 ms
[2023-04-07 01:49:19] [INFO ] Deduced a trap composed of 55 places in 65 ms of which 0 ms to minimize.
[2023-04-07 01:49:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 134 ms
[2023-04-07 01:49:20] [INFO ] Deduced a trap composed of 26 places in 93 ms of which 0 ms to minimize.
[2023-04-07 01:49:20] [INFO ] Deduced a trap composed of 38 places in 101 ms of which 0 ms to minimize.
[2023-04-07 01:49:20] [INFO ] Deduced a trap composed of 20 places in 88 ms of which 1 ms to minimize.
[2023-04-07 01:49:20] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 410 ms
[2023-04-07 01:49:20] [INFO ] Deduced a trap composed of 3 places in 72 ms of which 0 ms to minimize.
[2023-04-07 01:49:20] [INFO ] Deduced a trap composed of 27 places in 62 ms of which 1 ms to minimize.
[2023-04-07 01:49:20] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 244 ms
[2023-04-07 01:49:20] [INFO ] Deduced a trap composed of 57 places in 71 ms of which 0 ms to minimize.
[2023-04-07 01:49:20] [INFO ] Deduced a trap composed of 66 places in 72 ms of which 0 ms to minimize.
[2023-04-07 01:49:21] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 0 ms to minimize.
[2023-04-07 01:49:21] [INFO ] Deduced a trap composed of 13 places in 91 ms of which 1 ms to minimize.
[2023-04-07 01:49:21] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 475 ms
[2023-04-07 01:49:21] [INFO ] Deduced a trap composed of 29 places in 65 ms of which 0 ms to minimize.
[2023-04-07 01:49:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 138 ms
[2023-04-07 01:49:21] [INFO ] Deduced a trap composed of 31 places in 57 ms of which 0 ms to minimize.
[2023-04-07 01:49:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 122 ms
[2023-04-07 01:49:21] [INFO ] Deduced a trap composed of 36 places in 58 ms of which 0 ms to minimize.
[2023-04-07 01:49:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 133 ms
[2023-04-07 01:49:21] [INFO ] Deduced a trap composed of 32 places in 94 ms of which 0 ms to minimize.
[2023-04-07 01:49:22] [INFO ] Deduced a trap composed of 21 places in 84 ms of which 1 ms to minimize.
[2023-04-07 01:49:22] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 269 ms
[2023-04-07 01:49:22] [INFO ] Deduced a trap composed of 34 places in 79 ms of which 0 ms to minimize.
[2023-04-07 01:49:22] [INFO ] Deduced a trap composed of 19 places in 62 ms of which 0 ms to minimize.
[2023-04-07 01:49:22] [INFO ] Deduced a trap composed of 23 places in 62 ms of which 0 ms to minimize.
[2023-04-07 01:49:22] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 356 ms
[2023-04-07 01:49:24] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 0 ms to minimize.
[2023-04-07 01:49:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 129 ms
[2023-04-07 01:49:24] [INFO ] Deduced a trap composed of 21 places in 79 ms of which 1 ms to minimize.
[2023-04-07 01:49:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 147 ms
[2023-04-07 01:49:24] [INFO ] Deduced a trap composed of 26 places in 88 ms of which 0 ms to minimize.
[2023-04-07 01:49:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 165 ms
[2023-04-07 01:49:25] [INFO ] Deduced a trap composed of 27 places in 84 ms of which 0 ms to minimize.
[2023-04-07 01:49:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 151 ms
[2023-04-07 01:49:25] [INFO ] After 12630ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :53
Attempting to minimize the solution found.
Minimization took 2579 ms.
[2023-04-07 01:49:28] [INFO ] After 17989ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :53
Parikh walk visited 0 properties in 445 ms.
Support contains 86 out of 513 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 513/513 places, 3006/3006 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 512 transition count 2997
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 512 transition count 2997
Applied a total of 2 rules in 154 ms. Remains 512 /513 variables (removed 1) and now considering 2997/3006 (removed 9) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 154 ms. Remains : 512/513 places, 2997/3006 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 164 ms. (steps per millisecond=60 ) properties (out of 53) 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 53) 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 53) 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 53) 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 53) 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 53) 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 53) 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 53) 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 53) 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 53) 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 53) 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 53) 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 53) 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 53) 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 53) 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 53) 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 53) 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 53) 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 53) 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 53) 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 53) 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 53) 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 53) 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 53) 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 53) 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 53) 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 53) 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 53) 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 53) 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 53) 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 53) 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 53) 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 53) 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 53) 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 53) 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 53) 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 53) 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 53) 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 53) 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 53) 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 53) 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 53) 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 53) 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 53) 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 53) 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 53) 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 53) 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 53) 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 53) 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 53) 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 53) seen :0
Interrupted probabilistic random walk after 157990 steps, run timeout after 3001 ms. (steps per millisecond=52 ) properties seen :{}
Probabilistic random walk after 157990 steps, saw 108030 distinct states, run finished after 3002 ms. (steps per millisecond=52 ) properties seen :0
Running SMT prover for 53 properties.
[2023-04-07 01:49:32] [INFO ] Flow matrix only has 918 transitions (discarded 2079 similar events)
// Phase 1: matrix 918 rows 512 cols
[2023-04-07 01:49:32] [INFO ] Computed 28 invariants in 10 ms
[2023-04-07 01:49:32] [INFO ] [Real]Absence check using 19 positive place invariants in 11 ms returned sat
[2023-04-07 01:49:32] [INFO ] [Real]Absence check using 19 positive and 9 generalized place invariants in 4 ms returned sat
[2023-04-07 01:49:32] [INFO ] After 518ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:53
[2023-04-07 01:49:33] [INFO ] [Nat]Absence check using 19 positive place invariants in 12 ms returned sat
[2023-04-07 01:49:33] [INFO ] [Nat]Absence check using 19 positive and 9 generalized place invariants in 4 ms returned sat
[2023-04-07 01:49:35] [INFO ] After 1837ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :53
[2023-04-07 01:49:35] [INFO ] State equation strengthened by 420 read => feed constraints.
[2023-04-07 01:49:38] [INFO ] After 2396ms SMT Verify possible using 420 Read/Feed constraints in natural domain returned unsat :0 sat :53
[2023-04-07 01:49:38] [INFO ] Deduced a trap composed of 12 places in 172 ms of which 0 ms to minimize.
[2023-04-07 01:49:38] [INFO ] Deduced a trap composed of 30 places in 167 ms of which 1 ms to minimize.
[2023-04-07 01:49:38] [INFO ] Deduced a trap composed of 9 places in 178 ms of which 1 ms to minimize.
[2023-04-07 01:49:38] [INFO ] Deduced a trap composed of 35 places in 169 ms of which 0 ms to minimize.
[2023-04-07 01:49:39] [INFO ] Deduced a trap composed of 34 places in 184 ms of which 1 ms to minimize.
[2023-04-07 01:49:39] [INFO ] Deduced a trap composed of 3 places in 150 ms of which 0 ms to minimize.
[2023-04-07 01:49:39] [INFO ] Deduced a trap composed of 30 places in 168 ms of which 0 ms to minimize.
[2023-04-07 01:49:39] [INFO ] Deduced a trap composed of 45 places in 166 ms of which 0 ms to minimize.
[2023-04-07 01:49:39] [INFO ] Deduced a trap composed of 38 places in 165 ms of which 0 ms to minimize.
[2023-04-07 01:49:40] [INFO ] Deduced a trap composed of 39 places in 171 ms of which 0 ms to minimize.
[2023-04-07 01:49:40] [INFO ] Deduced a trap composed of 19 places in 172 ms of which 0 ms to minimize.
[2023-04-07 01:49:40] [INFO ] Deduced a trap composed of 56 places in 166 ms of which 0 ms to minimize.
[2023-04-07 01:49:40] [INFO ] Deduced a trap composed of 48 places in 167 ms of which 0 ms to minimize.
[2023-04-07 01:49:40] [INFO ] Deduced a trap composed of 35 places in 174 ms of which 0 ms to minimize.
[2023-04-07 01:49:41] [INFO ] Deduced a trap composed of 29 places in 173 ms of which 1 ms to minimize.
[2023-04-07 01:49:41] [INFO ] Deduced a trap composed of 36 places in 185 ms of which 1 ms to minimize.
[2023-04-07 01:49:41] [INFO ] Deduced a trap composed of 17 places in 176 ms of which 0 ms to minimize.
[2023-04-07 01:49:41] [INFO ] Deduced a trap composed of 11 places in 194 ms of which 0 ms to minimize.
[2023-04-07 01:49:41] [INFO ] Deduced a trap composed of 3 places in 167 ms of which 1 ms to minimize.
[2023-04-07 01:49:42] [INFO ] Deduced a trap composed of 30 places in 64 ms of which 0 ms to minimize.
[2023-04-07 01:49:42] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 4013 ms
[2023-04-07 01:49:42] [INFO ] Deduced a trap composed of 3 places in 155 ms of which 1 ms to minimize.
[2023-04-07 01:49:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 218 ms
[2023-04-07 01:49:42] [INFO ] Deduced a trap composed of 3 places in 105 ms of which 0 ms to minimize.
[2023-04-07 01:49:42] [INFO ] Deduced a trap composed of 37 places in 112 ms of which 0 ms to minimize.
[2023-04-07 01:49:42] [INFO ] Deduced a trap composed of 3 places in 132 ms of which 0 ms to minimize.
[2023-04-07 01:49:43] [INFO ] Deduced a trap composed of 54 places in 86 ms of which 0 ms to minimize.
[2023-04-07 01:49:43] [INFO ] Deduced a trap composed of 26 places in 61 ms of which 0 ms to minimize.
[2023-04-07 01:49:43] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 739 ms
[2023-04-07 01:49:43] [INFO ] Deduced a trap composed of 3 places in 96 ms of which 0 ms to minimize.
[2023-04-07 01:49:43] [INFO ] Deduced a trap composed of 24 places in 55 ms of which 0 ms to minimize.
[2023-04-07 01:49:43] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 281 ms
[2023-04-07 01:49:43] [INFO ] Deduced a trap composed of 29 places in 145 ms of which 1 ms to minimize.
[2023-04-07 01:49:43] [INFO ] Deduced a trap composed of 3 places in 127 ms of which 1 ms to minimize.
[2023-04-07 01:49:44] [INFO ] Deduced a trap composed of 47 places in 105 ms of which 0 ms to minimize.
[2023-04-07 01:49:44] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 509 ms
[2023-04-07 01:49:44] [INFO ] Deduced a trap composed of 21 places in 109 ms of which 1 ms to minimize.
[2023-04-07 01:49:44] [INFO ] Deduced a trap composed of 49 places in 105 ms of which 0 ms to minimize.
[2023-04-07 01:49:44] [INFO ] Deduced a trap composed of 13 places in 108 ms of which 0 ms to minimize.
[2023-04-07 01:49:44] [INFO ] Deduced a trap composed of 32 places in 105 ms of which 0 ms to minimize.
[2023-04-07 01:49:44] [INFO ] Deduced a trap composed of 15 places in 85 ms of which 1 ms to minimize.
[2023-04-07 01:49:44] [INFO ] Deduced a trap composed of 22 places in 83 ms of which 1 ms to minimize.
[2023-04-07 01:49:44] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 840 ms
[2023-04-07 01:49:45] [INFO ] Deduced a trap composed of 39 places in 99 ms of which 0 ms to minimize.
[2023-04-07 01:49:45] [INFO ] Deduced a trap composed of 20 places in 97 ms of which 0 ms to minimize.
[2023-04-07 01:49:45] [INFO ] Deduced a trap composed of 27 places in 72 ms of which 1 ms to minimize.
[2023-04-07 01:49:45] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 408 ms
[2023-04-07 01:49:45] [INFO ] Deduced a trap composed of 25 places in 84 ms of which 0 ms to minimize.
[2023-04-07 01:49:45] [INFO ] Deduced a trap composed of 27 places in 73 ms of which 0 ms to minimize.
[2023-04-07 01:49:45] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 258 ms
[2023-04-07 01:49:45] [INFO ] Deduced a trap composed of 19 places in 61 ms of which 1 ms to minimize.
[2023-04-07 01:49:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 127 ms
[2023-04-07 01:49:46] [INFO ] Deduced a trap composed of 38 places in 79 ms of which 0 ms to minimize.
[2023-04-07 01:49:46] [INFO ] Deduced a trap composed of 54 places in 60 ms of which 0 ms to minimize.
[2023-04-07 01:49:46] [INFO ] Deduced a trap composed of 27 places in 74 ms of which 1 ms to minimize.
[2023-04-07 01:49:46] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 358 ms
[2023-04-07 01:49:46] [INFO ] Deduced a trap composed of 35 places in 86 ms of which 0 ms to minimize.
[2023-04-07 01:49:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 235 ms
[2023-04-07 01:49:48] [INFO ] Deduced a trap composed of 32 places in 77 ms of which 1 ms to minimize.
[2023-04-07 01:49:48] [INFO ] Deduced a trap composed of 23 places in 89 ms of which 1 ms to minimize.
[2023-04-07 01:49:48] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 259 ms
[2023-04-07 01:49:48] [INFO ] Deduced a trap composed of 26 places in 61 ms of which 0 ms to minimize.
[2023-04-07 01:49:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 127 ms
[2023-04-07 01:49:48] [INFO ] Deduced a trap composed of 30 places in 61 ms of which 0 ms to minimize.
[2023-04-07 01:49:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 123 ms
[2023-04-07 01:49:49] [INFO ] Deduced a trap composed of 83 places in 188 ms of which 0 ms to minimize.
[2023-04-07 01:49:49] [INFO ] Deduced a trap composed of 73 places in 192 ms of which 1 ms to minimize.
[2023-04-07 01:49:49] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 475 ms
[2023-04-07 01:49:49] [INFO ] Deduced a trap composed of 26 places in 61 ms of which 1 ms to minimize.
[2023-04-07 01:49:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 130 ms
[2023-04-07 01:49:50] [INFO ] Deduced a trap composed of 15 places in 103 ms of which 0 ms to minimize.
[2023-04-07 01:49:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 168 ms
[2023-04-07 01:49:50] [INFO ] Deduced a trap composed of 47 places in 69 ms of which 0 ms to minimize.
[2023-04-07 01:49:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 140 ms
[2023-04-07 01:49:50] [INFO ] After 15300ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :53
Attempting to minimize the solution found.
Minimization took 2715 ms.
[2023-04-07 01:49:53] [INFO ] After 20692ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :53
Parikh walk visited 0 properties in 514 ms.
Support contains 86 out of 512 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 512/512 places, 2997/2997 transitions.
Applied a total of 0 rules in 97 ms. Remains 512 /512 variables (removed 0) and now considering 2997/2997 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 97 ms. Remains : 512/512 places, 2997/2997 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 512/512 places, 2997/2997 transitions.
Applied a total of 0 rules in 100 ms. Remains 512 /512 variables (removed 0) and now considering 2997/2997 (removed 0) transitions.
[2023-04-07 01:49:54] [INFO ] Flow matrix only has 918 transitions (discarded 2079 similar events)
[2023-04-07 01:49:54] [INFO ] Invariant cache hit.
[2023-04-07 01:49:54] [INFO ] Implicit Places using invariants in 399 ms returned []
[2023-04-07 01:49:54] [INFO ] Flow matrix only has 918 transitions (discarded 2079 similar events)
[2023-04-07 01:49:54] [INFO ] Invariant cache hit.
[2023-04-07 01:49:55] [INFO ] State equation strengthened by 420 read => feed constraints.
[2023-04-07 01:49:56] [INFO ] Implicit Places using invariants and state equation in 1989 ms returned []
Implicit Place search using SMT with State Equation took 2390 ms to find 0 implicit places.
[2023-04-07 01:49:56] [INFO ] Redundant transitions in 165 ms returned []
[2023-04-07 01:49:56] [INFO ] Flow matrix only has 918 transitions (discarded 2079 similar events)
[2023-04-07 01:49:56] [INFO ] Invariant cache hit.
[2023-04-07 01:49:57] [INFO ] Dead Transitions using invariants and state equation in 829 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3492 ms. Remains : 512/512 places, 2997/2997 transitions.
Successfully simplified 5 atomic propositions for a total of 16 simplifications.
[2023-04-07 01:49:57] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2023-04-07 01:49:57] [INFO ] Flatten gal took : 91 ms
FORMULA EisenbergMcGuire-PT-09-CTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-04-07 01:49:58] [INFO ] Flatten gal took : 95 ms
[2023-04-07 01:49:58] [INFO ] Input system was already deterministic with 3339 transitions.
Support contains 110 out of 830 places (down from 111) after GAL structural reductions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 830/830 places, 3339/3339 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 820 transition count 3249
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 820 transition count 3249
Applied a total of 20 rules in 49 ms. Remains 820 /830 variables (removed 10) and now considering 3249/3339 (removed 90) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 50 ms. Remains : 820/830 places, 3249/3339 transitions.
[2023-04-07 01:49:58] [INFO ] Flatten gal took : 74 ms
[2023-04-07 01:49:58] [INFO ] Flatten gal took : 84 ms
[2023-04-07 01:49:58] [INFO ] Input system was already deterministic with 3249 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 830/830 places, 3339/3339 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 830 transition count 3331
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 822 transition count 3331
Performed 250 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 250 Pre rules applied. Total rules applied 16 place count 822 transition count 3081
Deduced a syphon composed of 250 places in 3 ms
Reduce places removed 250 places and 0 transitions.
Iterating global reduction 2 with 500 rules applied. Total rules applied 516 place count 572 transition count 3081
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 525 place count 563 transition count 3000
Iterating global reduction 2 with 9 rules applied. Total rules applied 534 place count 563 transition count 3000
Performed 71 Post agglomeration using F-continuation condition.Transition count delta: 71
Deduced a syphon composed of 71 places in 1 ms
Reduce places removed 71 places and 0 transitions.
Iterating global reduction 2 with 142 rules applied. Total rules applied 676 place count 492 transition count 2929
Applied a total of 676 rules in 249 ms. Remains 492 /830 variables (removed 338) and now considering 2929/3339 (removed 410) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 250 ms. Remains : 492/830 places, 2929/3339 transitions.
[2023-04-07 01:49:58] [INFO ] Flatten gal took : 78 ms
[2023-04-07 01:49:59] [INFO ] Flatten gal took : 76 ms
[2023-04-07 01:49:59] [INFO ] Input system was already deterministic with 2929 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 830/830 places, 3339/3339 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 830 transition count 3330
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 821 transition count 3330
Performed 251 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 251 Pre rules applied. Total rules applied 18 place count 821 transition count 3079
Deduced a syphon composed of 251 places in 2 ms
Reduce places removed 251 places and 0 transitions.
Iterating global reduction 2 with 502 rules applied. Total rules applied 520 place count 570 transition count 3079
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 530 place count 560 transition count 2989
Iterating global reduction 2 with 10 rules applied. Total rules applied 540 place count 560 transition count 2989
Performed 71 Post agglomeration using F-continuation condition.Transition count delta: 71
Deduced a syphon composed of 71 places in 1 ms
Reduce places removed 71 places and 0 transitions.
Iterating global reduction 2 with 142 rules applied. Total rules applied 682 place count 489 transition count 2918
Applied a total of 682 rules in 221 ms. Remains 489 /830 variables (removed 341) and now considering 2918/3339 (removed 421) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 235 ms. Remains : 489/830 places, 2918/3339 transitions.
[2023-04-07 01:49:59] [INFO ] Flatten gal took : 98 ms
[2023-04-07 01:49:59] [INFO ] Flatten gal took : 92 ms
[2023-04-07 01:49:59] [INFO ] Input system was already deterministic with 2918 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 830/830 places, 3339/3339 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 830 transition count 3330
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 821 transition count 3330
Performed 252 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 252 Pre rules applied. Total rules applied 18 place count 821 transition count 3078
Deduced a syphon composed of 252 places in 2 ms
Reduce places removed 252 places and 0 transitions.
Iterating global reduction 2 with 504 rules applied. Total rules applied 522 place count 569 transition count 3078
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 532 place count 559 transition count 2988
Iterating global reduction 2 with 10 rules applied. Total rules applied 542 place count 559 transition count 2988
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 2 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 686 place count 487 transition count 2916
Applied a total of 686 rules in 229 ms. Remains 487 /830 variables (removed 343) and now considering 2916/3339 (removed 423) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 230 ms. Remains : 487/830 places, 2916/3339 transitions.
[2023-04-07 01:50:00] [INFO ] Flatten gal took : 62 ms
[2023-04-07 01:50:00] [INFO ] Flatten gal took : 71 ms
[2023-04-07 01:50:00] [INFO ] Input system was already deterministic with 2916 transitions.
Starting structural reductions in LTL mode, iteration 0 : 830/830 places, 3339/3339 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 820 transition count 3249
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 820 transition count 3249
Applied a total of 20 rules in 30 ms. Remains 820 /830 variables (removed 10) and now considering 3249/3339 (removed 90) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30 ms. Remains : 820/830 places, 3249/3339 transitions.
[2023-04-07 01:50:00] [INFO ] Flatten gal took : 66 ms
[2023-04-07 01:50:00] [INFO ] Flatten gal took : 73 ms
[2023-04-07 01:50:00] [INFO ] Input system was already deterministic with 3249 transitions.
Starting structural reductions in LTL mode, iteration 0 : 830/830 places, 3339/3339 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 819 transition count 3240
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 819 transition count 3240
Applied a total of 22 rules in 30 ms. Remains 819 /830 variables (removed 11) and now considering 3240/3339 (removed 99) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31 ms. Remains : 819/830 places, 3240/3339 transitions.
[2023-04-07 01:50:00] [INFO ] Flatten gal took : 80 ms
[2023-04-07 01:50:00] [INFO ] Flatten gal took : 76 ms
[2023-04-07 01:50:01] [INFO ] Input system was already deterministic with 3240 transitions.
Starting structural reductions in LTL mode, iteration 0 : 830/830 places, 3339/3339 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 819 transition count 3240
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 819 transition count 3240
Applied a total of 22 rules in 37 ms. Remains 819 /830 variables (removed 11) and now considering 3240/3339 (removed 99) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 37 ms. Remains : 819/830 places, 3240/3339 transitions.
[2023-04-07 01:50:01] [INFO ] Flatten gal took : 62 ms
[2023-04-07 01:50:01] [INFO ] Flatten gal took : 71 ms
[2023-04-07 01:50:01] [INFO ] Input system was already deterministic with 3240 transitions.
Starting structural reductions in LTL mode, iteration 0 : 830/830 places, 3339/3339 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 819 transition count 3240
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 819 transition count 3240
Applied a total of 22 rules in 37 ms. Remains 819 /830 variables (removed 11) and now considering 3240/3339 (removed 99) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 38 ms. Remains : 819/830 places, 3240/3339 transitions.
[2023-04-07 01:50:01] [INFO ] Flatten gal took : 62 ms
[2023-04-07 01:50:01] [INFO ] Flatten gal took : 72 ms
[2023-04-07 01:50:01] [INFO ] Input system was already deterministic with 3240 transitions.
Starting structural reductions in LTL mode, iteration 0 : 830/830 places, 3339/3339 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 822 transition count 3267
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 822 transition count 3267
Applied a total of 16 rules in 31 ms. Remains 822 /830 variables (removed 8) and now considering 3267/3339 (removed 72) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31 ms. Remains : 822/830 places, 3267/3339 transitions.
[2023-04-07 01:50:01] [INFO ] Flatten gal took : 61 ms
[2023-04-07 01:50:01] [INFO ] Flatten gal took : 70 ms
[2023-04-07 01:50:01] [INFO ] Input system was already deterministic with 3267 transitions.
Starting structural reductions in LTL mode, iteration 0 : 830/830 places, 3339/3339 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 821 transition count 3258
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 821 transition count 3258
Applied a total of 18 rules in 52 ms. Remains 821 /830 variables (removed 9) and now considering 3258/3339 (removed 81) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 52 ms. Remains : 821/830 places, 3258/3339 transitions.
[2023-04-07 01:50:02] [INFO ] Flatten gal took : 59 ms
[2023-04-07 01:50:02] [INFO ] Flatten gal took : 66 ms
[2023-04-07 01:50:02] [INFO ] Input system was already deterministic with 3258 transitions.
Starting structural reductions in LTL mode, iteration 0 : 830/830 places, 3339/3339 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 820 transition count 3249
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 820 transition count 3249
Applied a total of 20 rules in 29 ms. Remains 820 /830 variables (removed 10) and now considering 3249/3339 (removed 90) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 29 ms. Remains : 820/830 places, 3249/3339 transitions.
[2023-04-07 01:50:02] [INFO ] Flatten gal took : 59 ms
[2023-04-07 01:50:02] [INFO ] Flatten gal took : 68 ms
[2023-04-07 01:50:02] [INFO ] Input system was already deterministic with 3249 transitions.
Starting structural reductions in LTL mode, iteration 0 : 830/830 places, 3339/3339 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 820 transition count 3249
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 820 transition count 3249
Applied a total of 20 rules in 36 ms. Remains 820 /830 variables (removed 10) and now considering 3249/3339 (removed 90) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 36 ms. Remains : 820/830 places, 3249/3339 transitions.
[2023-04-07 01:50:02] [INFO ] Flatten gal took : 62 ms
[2023-04-07 01:50:02] [INFO ] Flatten gal took : 71 ms
[2023-04-07 01:50:02] [INFO ] Input system was already deterministic with 3249 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 830/830 places, 3339/3339 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 830 transition count 3330
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 821 transition count 3330
Performed 252 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 252 Pre rules applied. Total rules applied 18 place count 821 transition count 3078
Deduced a syphon composed of 252 places in 2 ms
Reduce places removed 252 places and 0 transitions.
Iterating global reduction 2 with 504 rules applied. Total rules applied 522 place count 569 transition count 3078
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 533 place count 558 transition count 2979
Iterating global reduction 2 with 11 rules applied. Total rules applied 544 place count 558 transition count 2979
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 2 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 688 place count 486 transition count 2907
Applied a total of 688 rules in 160 ms. Remains 486 /830 variables (removed 344) and now considering 2907/3339 (removed 432) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 160 ms. Remains : 486/830 places, 2907/3339 transitions.
[2023-04-07 01:50:03] [INFO ] Flatten gal took : 55 ms
[2023-04-07 01:50:03] [INFO ] Flatten gal took : 62 ms
[2023-04-07 01:50:03] [INFO ] Input system was already deterministic with 2907 transitions.
Starting structural reductions in LTL mode, iteration 0 : 830/830 places, 3339/3339 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 819 transition count 3240
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 819 transition count 3240
Applied a total of 22 rules in 31 ms. Remains 819 /830 variables (removed 11) and now considering 3240/3339 (removed 99) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31 ms. Remains : 819/830 places, 3240/3339 transitions.
[2023-04-07 01:50:03] [INFO ] Flatten gal took : 60 ms
[2023-04-07 01:50:03] [INFO ] Flatten gal took : 66 ms
[2023-04-07 01:50:03] [INFO ] Input system was already deterministic with 3240 transitions.
Starting structural reductions in LTL mode, iteration 0 : 830/830 places, 3339/3339 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 820 transition count 3249
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 820 transition count 3249
Applied a total of 20 rules in 28 ms. Remains 820 /830 variables (removed 10) and now considering 3249/3339 (removed 90) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 29 ms. Remains : 820/830 places, 3249/3339 transitions.
[2023-04-07 01:50:03] [INFO ] Flatten gal took : 59 ms
[2023-04-07 01:50:03] [INFO ] Flatten gal took : 66 ms
[2023-04-07 01:50:03] [INFO ] Input system was already deterministic with 3249 transitions.
[2023-04-07 01:50:04] [INFO ] Flatten gal took : 69 ms
[2023-04-07 01:50:04] [INFO ] Flatten gal took : 68 ms
[2023-04-07 01:50:04] [INFO ] Export to MCC of 15 properties in file /home/mcc/execution/CTLFireability.sr.xml took 5 ms.
[2023-04-07 01:50:04] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 830 places, 3339 transitions and 16596 arcs took 17 ms.
Total runtime 116784 ms.
There are residual formulas that ITS could not solve within timeout
timeout --kill-after=10s --signal=SIGINT 1m for testing only

Marcie built on Linux at 2019-11-18.
A model checker for Generalized Stochastic Petri nets

authors: Alex Tovchigrechko (IDD package and CTL model checking)

Martin Schwarick (Symbolic numerical analysis and CSL model checking)

Christian Rohr (Simulative and approximative numerical model checking)

marcie@informatik.tu-cottbus.de

called as: /home/mcc/BenchKit/bin//../reducer/bin//../../marcie/bin/marcie --net-file=model.pnml --mcc-file=CTLFireability.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: Petri
(NrP: 830 NrTr: 3339 NrArc: 16596)

parse formulas
formulas created successfully
place and transition orderings generation:0m 0.441sec

net check time: 0m 0.004sec

init dd package: 0m 2.692sec

TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393232 kB
MemFree: 9274264 kB
After kill :
MemTotal: 16393232 kB
MemFree: 16101096 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.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -timeout 360 -rebuildPNML
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok


initing FirstDep: 0m 0.023sec

82737 78399 84031 170365 290606 381640 400319 383804 381535 332537 379483 335622 360777 379893 826004 685853 797415 740512 1209181

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="EisenbergMcGuire-PT-09"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="marciexred"
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 marciexred"
echo " Input is EisenbergMcGuire-PT-09, 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 r522-tall-167987247100266"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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