About the Execution of Marcie+red for EisenbergMcGuire-PT-06
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 7227.911 | 3600000.00 | 3664838.00 | 7938.20 | ?????FT????????F | normal |
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-167987247100242.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-06, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r522-tall-167987247100242
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 8.1K Mar 23 15:23 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K Mar 23 15:23 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.1K Mar 23 15:21 CTLFireability.txt
-rw-r--r-- 1 mcc users 67K Mar 23 15:21 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 2.9K Mar 23 07:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 23 07:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Mar 26 22:42 NewModel
-rw-r--r-- 1 mcc users 13K Mar 23 15:23 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 121K Mar 23 15:23 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Mar 23 15:23 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 39K Mar 23 15:23 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 753K 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-06-CTLFireability-00
FORMULA_NAME EisenbergMcGuire-PT-06-CTLFireability-01
FORMULA_NAME EisenbergMcGuire-PT-06-CTLFireability-02
FORMULA_NAME EisenbergMcGuire-PT-06-CTLFireability-03
FORMULA_NAME EisenbergMcGuire-PT-06-CTLFireability-04
FORMULA_NAME EisenbergMcGuire-PT-06-CTLFireability-05
FORMULA_NAME EisenbergMcGuire-PT-06-CTLFireability-06
FORMULA_NAME EisenbergMcGuire-PT-06-CTLFireability-07
FORMULA_NAME EisenbergMcGuire-PT-06-CTLFireability-08
FORMULA_NAME EisenbergMcGuire-PT-06-CTLFireability-09
FORMULA_NAME EisenbergMcGuire-PT-06-CTLFireability-10
FORMULA_NAME EisenbergMcGuire-PT-06-CTLFireability-11
FORMULA_NAME EisenbergMcGuire-PT-06-CTLFireability-12
FORMULA_NAME EisenbergMcGuire-PT-06-CTLFireability-13
FORMULA_NAME EisenbergMcGuire-PT-06-CTLFireability-14
FORMULA_NAME EisenbergMcGuire-PT-06-CTLFireability-15
=== Now, execution of the tool begins
BK_START 1680823539838
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-06
Applying reductions before tool marcie
Invoking reducer
Running Version 202304061127
[2023-04-06 23:25:41] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-04-06 23:25:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-04-06 23:25:41] [INFO ] Load time of PNML (sax parser for PT used): 100 ms
[2023-04-06 23:25:41] [INFO ] Transformed 414 places.
[2023-04-06 23:25:41] [INFO ] Transformed 1296 transitions.
[2023-04-06 23:25:41] [INFO ] Found NUPN structural information;
[2023-04-06 23:25:41] [INFO ] Parsed PT model containing 414 places and 1296 transitions and 5976 arcs in 173 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 11 ms.
Support contains 126 out of 414 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 414/414 places, 1296/1296 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 404 transition count 1236
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 404 transition count 1236
Applied a total of 20 rules in 58 ms. Remains 404 /414 variables (removed 10) and now considering 1236/1296 (removed 60) transitions.
[2023-04-06 23:25:41] [INFO ] Flow matrix only has 642 transitions (discarded 594 similar events)
// Phase 1: matrix 642 rows 404 cols
[2023-04-06 23:25:41] [INFO ] Computed 19 invariants in 21 ms
[2023-04-06 23:25:42] [INFO ] Implicit Places using invariants in 352 ms returned []
[2023-04-06 23:25:42] [INFO ] Flow matrix only has 642 transitions (discarded 594 similar events)
[2023-04-06 23:25:42] [INFO ] Invariant cache hit.
[2023-04-06 23:25:42] [INFO ] State equation strengthened by 264 read => feed constraints.
[2023-04-06 23:25:42] [INFO ] Implicit Places using invariants and state equation in 576 ms returned []
Implicit Place search using SMT with State Equation took 953 ms to find 0 implicit places.
[2023-04-06 23:25:42] [INFO ] Flow matrix only has 642 transitions (discarded 594 similar events)
[2023-04-06 23:25:42] [INFO ] Invariant cache hit.
[2023-04-06 23:25:42] [INFO ] Dead Transitions using invariants and state equation in 373 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 404/414 places, 1236/1296 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1387 ms. Remains : 404/414 places, 1236/1296 transitions.
Support contains 126 out of 404 places after structural reductions.
[2023-04-06 23:25:43] [INFO ] Flatten gal took : 86 ms
[2023-04-06 23:25:43] [INFO ] Flatten gal took : 64 ms
[2023-04-06 23:25:43] [INFO ] Input system was already deterministic with 1236 transitions.
Support contains 122 out of 404 places (down from 126) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 403 ms. (steps per millisecond=24 ) properties (out of 115) seen :32
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 83) 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 83) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 82) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 81) 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 81) 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 81) 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 81) 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 81) 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 81) 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 81) 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 81) 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 81) 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 81) 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 81) 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 81) 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 81) 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 81) 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 81) 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 81) 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 81) 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 81) 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 81) 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 81) 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 81) 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 81) 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 81) 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 81) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 81) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 81) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 81) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 81) 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 81) 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 81) 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 81) 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 81) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 81) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 81) 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 81) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 81) 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 81) 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 81) 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 81) 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 81) 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 81) 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 81) 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 81) 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 81) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 81) 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 81) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 81) 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 81) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 81) seen :0
Running SMT prover for 81 properties.
[2023-04-06 23:25:44] [INFO ] Flow matrix only has 642 transitions (discarded 594 similar events)
[2023-04-06 23:25:44] [INFO ] Invariant cache hit.
[2023-04-06 23:25:45] [INFO ] [Real]Absence check using 13 positive place invariants in 9 ms returned sat
[2023-04-06 23:25:45] [INFO ] [Real]Absence check using 13 positive and 6 generalized place invariants in 3 ms returned sat
[2023-04-06 23:25:46] [INFO ] After 1834ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:80
[2023-04-06 23:25:46] [INFO ] [Nat]Absence check using 13 positive place invariants in 10 ms returned sat
[2023-04-06 23:25:46] [INFO ] [Nat]Absence check using 13 positive and 6 generalized place invariants in 3 ms returned sat
[2023-04-06 23:25:49] [INFO ] After 2061ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :78
[2023-04-06 23:25:49] [INFO ] State equation strengthened by 264 read => feed constraints.
[2023-04-06 23:25:51] [INFO ] After 2490ms SMT Verify possible using 264 Read/Feed constraints in natural domain returned unsat :3 sat :78
[2023-04-06 23:25:52] [INFO ] Deduced a trap composed of 3 places in 131 ms of which 3 ms to minimize.
[2023-04-06 23:25:52] [INFO ] Deduced a trap composed of 3 places in 82 ms of which 1 ms to minimize.
[2023-04-06 23:25:52] [INFO ] Deduced a trap composed of 38 places in 69 ms of which 1 ms to minimize.
[2023-04-06 23:25:52] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 2 ms to minimize.
[2023-04-06 23:25:52] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 462 ms
[2023-04-06 23:25:52] [INFO ] Deduced a trap composed of 3 places in 58 ms of which 1 ms to minimize.
[2023-04-06 23:25:52] [INFO ] Deduced a trap composed of 3 places in 70 ms of which 1 ms to minimize.
[2023-04-06 23:25:52] [INFO ] Deduced a trap composed of 29 places in 51 ms of which 1 ms to minimize.
[2023-04-06 23:25:52] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 282 ms
[2023-04-06 23:25:52] [INFO ] Deduced a trap composed of 26 places in 52 ms of which 1 ms to minimize.
[2023-04-06 23:25:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 101 ms
[2023-04-06 23:25:52] [INFO ] Deduced a trap composed of 20 places in 51 ms of which 1 ms to minimize.
[2023-04-06 23:25:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 96 ms
[2023-04-06 23:25:53] [INFO ] Deduced a trap composed of 23 places in 135 ms of which 0 ms to minimize.
[2023-04-06 23:25:53] [INFO ] Deduced a trap composed of 26 places in 83 ms of which 0 ms to minimize.
[2023-04-06 23:25:53] [INFO ] Deduced a trap composed of 33 places in 71 ms of which 1 ms to minimize.
[2023-04-06 23:25:53] [INFO ] Deduced a trap composed of 32 places in 60 ms of which 1 ms to minimize.
[2023-04-06 23:25:53] [INFO ] Deduced a trap composed of 83 places in 117 ms of which 0 ms to minimize.
[2023-04-06 23:25:53] [INFO ] Deduced a trap composed of 22 places in 108 ms of which 1 ms to minimize.
[2023-04-06 23:25:53] [INFO ] Deduced a trap composed of 26 places in 48 ms of which 0 ms to minimize.
[2023-04-06 23:25:53] [INFO ] Deduced a trap composed of 35 places in 51 ms of which 1 ms to minimize.
[2023-04-06 23:25:53] [INFO ] Deduced a trap composed of 21 places in 92 ms of which 1 ms to minimize.
[2023-04-06 23:25:53] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2023-04-06 23:25:54] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1105 ms
[2023-04-06 23:25:54] [INFO ] Deduced a trap composed of 32 places in 57 ms of which 0 ms to minimize.
[2023-04-06 23:25:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 106 ms
[2023-04-06 23:25:54] [INFO ] Deduced a trap composed of 21 places in 69 ms of which 1 ms to minimize.
[2023-04-06 23:25:54] [INFO ] Deduced a trap composed of 26 places in 55 ms of which 1 ms to minimize.
[2023-04-06 23:25:54] [INFO ] Deduced a trap composed of 14 places in 77 ms of which 1 ms to minimize.
[2023-04-06 23:25:54] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 299 ms
[2023-04-06 23:25:55] [INFO ] Deduced a trap composed of 110 places in 119 ms of which 0 ms to minimize.
[2023-04-06 23:25:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 172 ms
[2023-04-06 23:25:55] [INFO ] Deduced a trap composed of 65 places in 62 ms of which 0 ms to minimize.
[2023-04-06 23:25:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 120 ms
[2023-04-06 23:25:56] [INFO ] Deduced a trap composed of 23 places in 59 ms of which 0 ms to minimize.
[2023-04-06 23:25:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 108 ms
[2023-04-06 23:25:57] [INFO ] Deduced a trap composed of 29 places in 118 ms of which 0 ms to minimize.
[2023-04-06 23:25:57] [INFO ] Deduced a trap composed of 17 places in 117 ms of which 0 ms to minimize.
[2023-04-06 23:25:57] [INFO ] Deduced a trap composed of 107 places in 102 ms of which 1 ms to minimize.
[2023-04-06 23:25:57] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 443 ms
[2023-04-06 23:25:58] [INFO ] Deduced a trap composed of 67 places in 99 ms of which 0 ms to minimize.
[2023-04-06 23:25:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 143 ms
[2023-04-06 23:25:58] [INFO ] Deduced a trap composed of 72 places in 102 ms of which 0 ms to minimize.
[2023-04-06 23:25:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 152 ms
[2023-04-06 23:25:59] [INFO ] After 9705ms SMT Verify possible using trap constraints in natural domain returned unsat :4 sat :77
Attempting to minimize the solution found.
Minimization took 2965 ms.
[2023-04-06 23:26:02] [INFO ] After 15765ms SMT Verify possible using all constraints in natural domain returned unsat :4 sat :77
Fused 81 Parikh solutions to 77 different solutions.
Parikh walk visited 0 properties in 1670 ms.
Support contains 81 out of 404 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 404/404 places, 1236/1236 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 404 transition count 1234
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 402 transition count 1234
Performed 99 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 99 Pre rules applied. Total rules applied 4 place count 402 transition count 1135
Deduced a syphon composed of 99 places in 1 ms
Reduce places removed 99 places and 0 transitions.
Iterating global reduction 2 with 198 rules applied. Total rules applied 202 place count 303 transition count 1135
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 212 place count 293 transition count 1075
Iterating global reduction 2 with 10 rules applied. Total rules applied 222 place count 293 transition count 1075
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 2 with 58 rules applied. Total rules applied 280 place count 264 transition count 1046
Applied a total of 280 rules in 102 ms. Remains 264 /404 variables (removed 140) and now considering 1046/1236 (removed 190) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 102 ms. Remains : 264/404 places, 1046/1236 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 213 ms. (steps per millisecond=46 ) properties (out of 77) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 76) 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 76) 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 76) 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 76) 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 76) 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 76) 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 76) 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 76) 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 76) 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 76) 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 76) 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 76) 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 76) 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 76) 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 76) 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 76) 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 76) 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 76) 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 76) 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 76) 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 76) 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 76) 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 76) 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 76) 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 76) 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 76) 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 76) 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 76) 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 76) 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 76) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 75) 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 75) 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 75) 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 75) 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 75) 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 75) 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 75) 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 75) 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 75) 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 75) 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 75) 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 75) 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 75) 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 75) 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 75) 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 75) 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 75) 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 75) 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 75) 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 75) 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 75) 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 75) 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 75) 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 75) 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 75) 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 75) 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 75) 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 75) 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 75) 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 75) 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 75) 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 75) 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 75) 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 75) 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 75) 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 75) 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 75) 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 75) 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 75) 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 75) 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 75) 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 75) 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 75) 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 75) 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 75) seen :0
Interrupted probabilistic random walk after 239197 steps, run timeout after 3001 ms. (steps per millisecond=79 ) properties seen :{5=1, 6=1, 18=1, 19=1, 24=1, 26=1, 29=1, 34=1, 42=1, 44=1, 49=1, 52=1, 53=1, 63=1, 64=1, 67=1, 69=1, 70=1, 71=1, 72=1, 74=1}
Probabilistic random walk after 239197 steps, saw 105282 distinct states, run finished after 3002 ms. (steps per millisecond=79 ) properties seen :21
Running SMT prover for 54 properties.
[2023-04-06 23:26:07] [INFO ] Flow matrix only has 452 transitions (discarded 594 similar events)
// Phase 1: matrix 452 rows 264 cols
[2023-04-06 23:26:07] [INFO ] Computed 19 invariants in 3 ms
[2023-04-06 23:26:07] [INFO ] [Real]Absence check using 13 positive place invariants in 12 ms returned sat
[2023-04-06 23:26:07] [INFO ] [Real]Absence check using 13 positive and 6 generalized place invariants in 2 ms returned sat
[2023-04-06 23:26:08] [INFO ] After 1257ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:54
[2023-04-06 23:26:08] [INFO ] [Nat]Absence check using 13 positive place invariants in 4 ms returned sat
[2023-04-06 23:26:08] [INFO ] [Nat]Absence check using 13 positive and 6 generalized place invariants in 2 ms returned sat
[2023-04-06 23:26:10] [INFO ] After 966ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :54
[2023-04-06 23:26:10] [INFO ] State equation strengthened by 214 read => feed constraints.
[2023-04-06 23:26:11] [INFO ] After 1075ms SMT Verify possible using 214 Read/Feed constraints in natural domain returned unsat :0 sat :54
[2023-04-06 23:26:11] [INFO ] Deduced a trap composed of 6 places in 63 ms of which 0 ms to minimize.
[2023-04-06 23:26:11] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 1 ms to minimize.
[2023-04-06 23:26:11] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 149 ms
[2023-04-06 23:26:11] [INFO ] Deduced a trap composed of 3 places in 58 ms of which 2 ms to minimize.
[2023-04-06 23:26:11] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 0 ms to minimize.
[2023-04-06 23:26:11] [INFO ] Deduced a trap composed of 11 places in 48 ms of which 0 ms to minimize.
[2023-04-06 23:26:11] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 219 ms
[2023-04-06 23:26:11] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 1 ms to minimize.
[2023-04-06 23:26:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 70 ms
[2023-04-06 23:26:11] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 0 ms to minimize.
[2023-04-06 23:26:11] [INFO ] Deduced a trap composed of 20 places in 74 ms of which 1 ms to minimize.
[2023-04-06 23:26:11] [INFO ] Deduced a trap composed of 30 places in 51 ms of which 1 ms to minimize.
[2023-04-06 23:26:11] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 0 ms to minimize.
[2023-04-06 23:26:12] [INFO ] Deduced a trap composed of 26 places in 50 ms of which 0 ms to minimize.
[2023-04-06 23:26:12] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 0 ms to minimize.
[2023-04-06 23:26:12] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 451 ms
[2023-04-06 23:26:12] [INFO ] Deduced a trap composed of 20 places in 63 ms of which 0 ms to minimize.
[2023-04-06 23:26:12] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 0 ms to minimize.
[2023-04-06 23:26:12] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 160 ms
[2023-04-06 23:26:12] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 0 ms to minimize.
[2023-04-06 23:26:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 84 ms
[2023-04-06 23:26:12] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 0 ms to minimize.
[2023-04-06 23:26:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 80 ms
[2023-04-06 23:26:12] [INFO ] Deduced a trap composed of 49 places in 76 ms of which 1 ms to minimize.
[2023-04-06 23:26:12] [INFO ] Deduced a trap composed of 26 places in 43 ms of which 0 ms to minimize.
[2023-04-06 23:26:12] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 164 ms
[2023-04-06 23:26:12] [INFO ] Deduced a trap composed of 17 places in 59 ms of which 1 ms to minimize.
[2023-04-06 23:26:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 91 ms
[2023-04-06 23:26:13] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 0 ms to minimize.
[2023-04-06 23:26:13] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 1 ms to minimize.
[2023-04-06 23:26:13] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 161 ms
[2023-04-06 23:26:13] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 1 ms to minimize.
[2023-04-06 23:26:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 73 ms
[2023-04-06 23:26:13] [INFO ] Deduced a trap composed of 19 places in 59 ms of which 0 ms to minimize.
[2023-04-06 23:26:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 99 ms
[2023-04-06 23:26:13] [INFO ] Deduced a trap composed of 54 places in 101 ms of which 0 ms to minimize.
[2023-04-06 23:26:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 135 ms
[2023-04-06 23:26:14] [INFO ] Deduced a trap composed of 22 places in 64 ms of which 7 ms to minimize.
[2023-04-06 23:26:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 98 ms
[2023-04-06 23:26:14] [INFO ] Deduced a trap composed of 22 places in 87 ms of which 1 ms to minimize.
[2023-04-06 23:26:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 121 ms
[2023-04-06 23:26:14] [INFO ] After 4896ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :54
Attempting to minimize the solution found.
Minimization took 1288 ms.
[2023-04-06 23:26:16] [INFO ] After 7636ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :54
Parikh walk visited 0 properties in 318 ms.
Support contains 61 out of 264 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 264/264 places, 1046/1046 transitions.
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 9 Pre rules applied. Total rules applied 0 place count 264 transition count 1037
Deduced a syphon composed of 9 places in 8 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 0 with 18 rules applied. Total rules applied 18 place count 255 transition count 1037
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 25 place count 248 transition count 995
Iterating global reduction 0 with 7 rules applied. Total rules applied 32 place count 248 transition count 995
Applied a total of 32 rules in 55 ms. Remains 248 /264 variables (removed 16) and now considering 995/1046 (removed 51) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55 ms. Remains : 248/264 places, 995/1046 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 330 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 :1
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 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 8 ms. (steps per millisecond=125 ) 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 5 ms. (steps per millisecond=200 ) 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
Interrupted probabilistic random walk after 287175 steps, run timeout after 3001 ms. (steps per millisecond=95 ) properties seen :{14=1}
Probabilistic random walk after 287175 steps, saw 92197 distinct states, run finished after 3001 ms. (steps per millisecond=95 ) properties seen :1
Running SMT prover for 52 properties.
[2023-04-06 23:26:20] [INFO ] Flow matrix only has 401 transitions (discarded 594 similar events)
// Phase 1: matrix 401 rows 248 cols
[2023-04-06 23:26:20] [INFO ] Computed 19 invariants in 2 ms
[2023-04-06 23:26:20] [INFO ] [Real]Absence check using 13 positive place invariants in 5 ms returned sat
[2023-04-06 23:26:20] [INFO ] [Real]Absence check using 13 positive and 6 generalized place invariants in 6 ms returned sat
[2023-04-06 23:26:20] [INFO ] After 741ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:52
[2023-04-06 23:26:21] [INFO ] [Nat]Absence check using 13 positive place invariants in 4 ms returned sat
[2023-04-06 23:26:21] [INFO ] [Nat]Absence check using 13 positive and 6 generalized place invariants in 2 ms returned sat
[2023-04-06 23:26:22] [INFO ] After 845ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :52
[2023-04-06 23:26:22] [INFO ] State equation strengthened by 179 read => feed constraints.
[2023-04-06 23:26:23] [INFO ] After 1074ms SMT Verify possible using 179 Read/Feed constraints in natural domain returned unsat :0 sat :52
[2023-04-06 23:26:23] [INFO ] Deduced a trap composed of 23 places in 84 ms of which 1 ms to minimize.
[2023-04-06 23:26:23] [INFO ] Deduced a trap composed of 11 places in 98 ms of which 0 ms to minimize.
[2023-04-06 23:26:23] [INFO ] Deduced a trap composed of 17 places in 90 ms of which 1 ms to minimize.
[2023-04-06 23:26:23] [INFO ] Deduced a trap composed of 42 places in 76 ms of which 0 ms to minimize.
[2023-04-06 23:26:23] [INFO ] Deduced a trap composed of 18 places in 71 ms of which 1 ms to minimize.
[2023-04-06 23:26:23] [INFO ] Deduced a trap composed of 21 places in 58 ms of which 1 ms to minimize.
[2023-04-06 23:26:24] [INFO ] Deduced a trap composed of 35 places in 84 ms of which 2 ms to minimize.
[2023-04-06 23:26:24] [INFO ] Deduced a trap composed of 24 places in 47 ms of which 0 ms to minimize.
[2023-04-06 23:26:24] [INFO ] Deduced a trap composed of 23 places in 79 ms of which 1 ms to minimize.
[2023-04-06 23:26:24] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 866 ms
[2023-04-06 23:26:24] [INFO ] Deduced a trap composed of 3 places in 67 ms of which 2 ms to minimize.
[2023-04-06 23:26:24] [INFO ] Deduced a trap composed of 3 places in 57 ms of which 0 ms to minimize.
[2023-04-06 23:26:24] [INFO ] Deduced a trap composed of 25 places in 49 ms of which 0 ms to minimize.
[2023-04-06 23:26:24] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 0 ms to minimize.
[2023-04-06 23:26:24] [INFO ] Deduced a trap composed of 24 places in 55 ms of which 1 ms to minimize.
[2023-04-06 23:26:24] [INFO ] Deduced a trap composed of 3 places in 52 ms of which 0 ms to minimize.
[2023-04-06 23:26:24] [INFO ] Deduced a trap composed of 12 places in 52 ms of which 0 ms to minimize.
[2023-04-06 23:26:24] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 514 ms
[2023-04-06 23:26:24] [INFO ] Deduced a trap composed of 27 places in 57 ms of which 1 ms to minimize.
[2023-04-06 23:26:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 90 ms
[2023-04-06 23:26:24] [INFO ] Deduced a trap composed of 16 places in 88 ms of which 1 ms to minimize.
[2023-04-06 23:26:25] [INFO ] Deduced a trap composed of 19 places in 78 ms of which 0 ms to minimize.
[2023-04-06 23:26:25] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 0 ms to minimize.
[2023-04-06 23:26:25] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-04-06 23:26:25] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 1 ms to minimize.
[2023-04-06 23:26:25] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 374 ms
[2023-04-06 23:26:25] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 0 ms to minimize.
[2023-04-06 23:26:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 69 ms
[2023-04-06 23:26:25] [INFO ] Deduced a trap composed of 11 places in 58 ms of which 1 ms to minimize.
[2023-04-06 23:26:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 90 ms
[2023-04-06 23:26:25] [INFO ] Deduced a trap composed of 13 places in 86 ms of which 1 ms to minimize.
[2023-04-06 23:26:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 125 ms
[2023-04-06 23:26:26] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 0 ms to minimize.
[2023-04-06 23:26:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 74 ms
[2023-04-06 23:26:27] [INFO ] Deduced a trap composed of 37 places in 49 ms of which 0 ms to minimize.
[2023-04-06 23:26:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 76 ms
[2023-04-06 23:26:27] [INFO ] After 5045ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :52
Attempting to minimize the solution found.
Minimization took 1122 ms.
[2023-04-06 23:26:28] [INFO ] After 7471ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :52
Parikh walk visited 0 properties in 283 ms.
Support contains 60 out of 248 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 248/248 places, 995/995 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 248 transition count 994
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 247 transition count 994
Applied a total of 2 rules in 31 ms. Remains 247 /248 variables (removed 1) and now considering 994/995 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31 ms. Remains : 247/248 places, 994/995 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 168 ms. (steps per millisecond=59 ) properties (out of 52) 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 52) 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 52) 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 52) 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 52) 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 52) 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 52) 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 52) 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 52) 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 52) 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 52) 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 52) 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 52) 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 52) 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 52) 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 52) 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 52) 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 52) 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 52) 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 52) 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 52) 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 52) 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 52) 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 52) 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 52) 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 52) 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 52) 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 52) 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 52) 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 52) 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 52) 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 52) 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 52) 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 52) 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 52) 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 52) 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 52) 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 52) 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 52) 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 52) 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 52) 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 52) 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 52) 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 52) 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 52) 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 52) 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 52) 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 52) 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 52) 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 52) 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 52) seen :0
Interrupted probabilistic random walk after 307426 steps, run timeout after 3001 ms. (steps per millisecond=102 ) properties seen :{}
Probabilistic random walk after 307426 steps, saw 100749 distinct states, run finished after 3001 ms. (steps per millisecond=102 ) properties seen :0
Running SMT prover for 52 properties.
[2023-04-06 23:26:32] [INFO ] Flow matrix only has 400 transitions (discarded 594 similar events)
// Phase 1: matrix 400 rows 247 cols
[2023-04-06 23:26:32] [INFO ] Computed 19 invariants in 2 ms
[2023-04-06 23:26:32] [INFO ] [Real]Absence check using 13 positive place invariants in 5 ms returned sat
[2023-04-06 23:26:32] [INFO ] [Real]Absence check using 13 positive and 6 generalized place invariants in 3 ms returned sat
[2023-04-06 23:26:32] [INFO ] After 702ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:52
[2023-04-06 23:26:33] [INFO ] [Nat]Absence check using 13 positive place invariants in 5 ms returned sat
[2023-04-06 23:26:33] [INFO ] [Nat]Absence check using 13 positive and 6 generalized place invariants in 2 ms returned sat
[2023-04-06 23:26:34] [INFO ] After 830ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :52
[2023-04-06 23:26:34] [INFO ] State equation strengthened by 179 read => feed constraints.
[2023-04-06 23:26:35] [INFO ] After 1037ms SMT Verify possible using 179 Read/Feed constraints in natural domain returned unsat :0 sat :52
[2023-04-06 23:26:35] [INFO ] Deduced a trap composed of 3 places in 83 ms of which 1 ms to minimize.
[2023-04-06 23:26:35] [INFO ] Deduced a trap composed of 3 places in 96 ms of which 0 ms to minimize.
[2023-04-06 23:26:35] [INFO ] Deduced a trap composed of 3 places in 93 ms of which 0 ms to minimize.
[2023-04-06 23:26:35] [INFO ] Deduced a trap composed of 3 places in 83 ms of which 1 ms to minimize.
[2023-04-06 23:26:35] [INFO ] Deduced a trap composed of 18 places in 84 ms of which 0 ms to minimize.
[2023-04-06 23:26:35] [INFO ] Deduced a trap composed of 22 places in 71 ms of which 1 ms to minimize.
[2023-04-06 23:26:35] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 0 ms to minimize.
[2023-04-06 23:26:35] [INFO ] Deduced a trap composed of 19 places in 51 ms of which 0 ms to minimize.
[2023-04-06 23:26:35] [INFO ] Deduced a trap composed of 63 places in 82 ms of which 0 ms to minimize.
[2023-04-06 23:26:36] [INFO ] Deduced a trap composed of 64 places in 77 ms of which 1 ms to minimize.
[2023-04-06 23:26:36] [INFO ] Deduced a trap composed of 11 places in 77 ms of which 0 ms to minimize.
[2023-04-06 23:26:36] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1043 ms
[2023-04-06 23:26:36] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 0 ms to minimize.
[2023-04-06 23:26:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 62 ms
[2023-04-06 23:26:36] [INFO ] Deduced a trap composed of 24 places in 61 ms of which 1 ms to minimize.
[2023-04-06 23:26:36] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 0 ms to minimize.
[2023-04-06 23:26:36] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 0 ms to minimize.
[2023-04-06 23:26:36] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 220 ms
[2023-04-06 23:26:36] [INFO ] Deduced a trap composed of 20 places in 78 ms of which 1 ms to minimize.
[2023-04-06 23:26:36] [INFO ] Deduced a trap composed of 47 places in 72 ms of which 0 ms to minimize.
[2023-04-06 23:26:36] [INFO ] Deduced a trap composed of 27 places in 70 ms of which 0 ms to minimize.
[2023-04-06 23:26:36] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 273 ms
[2023-04-06 23:26:36] [INFO ] Deduced a trap composed of 52 places in 42 ms of which 0 ms to minimize.
[2023-04-06 23:26:36] [INFO ] Deduced a trap composed of 37 places in 40 ms of which 0 ms to minimize.
[2023-04-06 23:26:36] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 131 ms
[2023-04-06 23:26:37] [INFO ] Deduced a trap composed of 24 places in 44 ms of which 0 ms to minimize.
[2023-04-06 23:26:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 73 ms
[2023-04-06 23:26:37] [INFO ] Deduced a trap composed of 26 places in 48 ms of which 1 ms to minimize.
[2023-04-06 23:26:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 79 ms
[2023-04-06 23:26:37] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 0 ms to minimize.
[2023-04-06 23:26:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 78 ms
[2023-04-06 23:26:37] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 0 ms to minimize.
[2023-04-06 23:26:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 63 ms
[2023-04-06 23:26:37] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 0 ms to minimize.
[2023-04-06 23:26:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 67 ms
[2023-04-06 23:26:37] [INFO ] Deduced a trap composed of 35 places in 44 ms of which 0 ms to minimize.
[2023-04-06 23:26:37] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 0 ms to minimize.
[2023-04-06 23:26:37] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 129 ms
[2023-04-06 23:26:38] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 0 ms to minimize.
[2023-04-06 23:26:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 79 ms
[2023-04-06 23:26:38] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 0 ms to minimize.
[2023-04-06 23:26:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 74 ms
[2023-04-06 23:26:39] [INFO ] After 4962ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :52
Attempting to minimize the solution found.
Minimization took 1072 ms.
[2023-04-06 23:26:40] [INFO ] After 7309ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :52
Parikh walk visited 0 properties in 250 ms.
Support contains 60 out of 247 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 247/247 places, 994/994 transitions.
Applied a total of 0 rules in 29 ms. Remains 247 /247 variables (removed 0) and now considering 994/994 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 247/247 places, 994/994 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 247/247 places, 994/994 transitions.
Applied a total of 0 rules in 27 ms. Remains 247 /247 variables (removed 0) and now considering 994/994 (removed 0) transitions.
[2023-04-06 23:26:40] [INFO ] Flow matrix only has 400 transitions (discarded 594 similar events)
[2023-04-06 23:26:40] [INFO ] Invariant cache hit.
[2023-04-06 23:26:40] [INFO ] Implicit Places using invariants in 107 ms returned []
[2023-04-06 23:26:40] [INFO ] Flow matrix only has 400 transitions (discarded 594 similar events)
[2023-04-06 23:26:40] [INFO ] Invariant cache hit.
[2023-04-06 23:26:40] [INFO ] State equation strengthened by 179 read => feed constraints.
[2023-04-06 23:26:40] [INFO ] Implicit Places using invariants and state equation in 393 ms returned []
Implicit Place search using SMT with State Equation took 502 ms to find 0 implicit places.
[2023-04-06 23:26:40] [INFO ] Redundant transitions in 69 ms returned []
[2023-04-06 23:26:40] [INFO ] Flow matrix only has 400 transitions (discarded 594 similar events)
[2023-04-06 23:26:41] [INFO ] Invariant cache hit.
[2023-04-06 23:26:41] [INFO ] Dead Transitions using invariants and state equation in 295 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 905 ms. Remains : 247/247 places, 994/994 transitions.
Graph (trivial) has 458 edges and 247 vertex of which 32 / 247 are part of one of the 6 SCC in 3 ms
Free SCC test removed 26 places
Drop transitions removed 97 transitions
Ensure Unique test removed 582 transitions
Reduce isomorphic transitions removed 679 transitions.
Drop transitions removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 25 rules applied. Total rules applied 26 place count 221 transition count 290
Reduce places removed 25 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 27 rules applied. Total rules applied 53 place count 196 transition count 288
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 55 place count 194 transition count 288
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 55 place count 194 transition count 279
Deduced a syphon composed of 9 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 21 rules applied. Total rules applied 76 place count 182 transition count 279
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 3 with 64 rules applied. Total rules applied 140 place count 150 transition count 247
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 142 place count 150 transition count 245
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -14
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 150 place count 146 transition count 259
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 158 place count 146 transition count 251
Drop transitions removed 17 transitions
Redundant transition composition rules discarded 17 transitions
Iterating global reduction 5 with 17 rules applied. Total rules applied 175 place count 146 transition count 234
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 177 place count 145 transition count 235
Free-agglomeration rule applied 35 times.
Iterating global reduction 5 with 35 rules applied. Total rules applied 212 place count 145 transition count 200
Reduce places removed 35 places and 0 transitions.
Iterating post reduction 5 with 35 rules applied. Total rules applied 247 place count 110 transition count 200
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 6 with 6 rules applied. Total rules applied 253 place count 110 transition count 200
Applied a total of 253 rules in 53 ms. Remains 110 /247 variables (removed 137) and now considering 200/994 (removed 794) transitions.
Running SMT prover for 52 properties.
// Phase 1: matrix 200 rows 110 cols
[2023-04-06 23:26:41] [INFO ] Computed 16 invariants in 3 ms
[2023-04-06 23:26:41] [INFO ] [Real]Absence check using 13 positive place invariants in 3 ms returned sat
[2023-04-06 23:26:41] [INFO ] [Real]Absence check using 13 positive and 3 generalized place invariants in 1 ms returned sat
[2023-04-06 23:26:41] [INFO ] After 360ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:52
[2023-04-06 23:26:41] [INFO ] [Nat]Absence check using 13 positive place invariants in 3 ms returned sat
[2023-04-06 23:26:41] [INFO ] [Nat]Absence check using 13 positive and 3 generalized place invariants in 1 ms returned sat
[2023-04-06 23:26:42] [INFO ] After 426ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :52
[2023-04-06 23:26:42] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-04-06 23:26:42] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2023-04-06 23:26:42] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2023-04-06 23:26:42] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 105 ms
[2023-04-06 23:26:42] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-04-06 23:26:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 38 ms
[2023-04-06 23:26:42] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-04-06 23:26:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 39 ms
[2023-04-06 23:26:42] [INFO ] Deduced a trap composed of 7 places in 24 ms of which 0 ms to minimize.
[2023-04-06 23:26:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 39 ms
[2023-04-06 23:26:43] [INFO ] After 1239ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :52
Attempting to minimize the solution found.
Minimization took 391 ms.
[2023-04-06 23:26:43] [INFO ] After 1850ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :52
Successfully simplified 4 atomic propositions for a total of 16 simplifications.
FORMULA EisenbergMcGuire-PT-06-CTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-04-06 23:26:43] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2023-04-06 23:26:43] [INFO ] Flatten gal took : 46 ms
FORMULA EisenbergMcGuire-PT-06-CTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-04-06 23:26:43] [INFO ] Flatten gal took : 41 ms
[2023-04-06 23:26:43] [INFO ] Input system was already deterministic with 1236 transitions.
Support contains 101 out of 404 places (down from 113) after GAL structural reductions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 404/404 places, 1236/1236 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 386 transition count 1128
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 386 transition count 1128
Applied a total of 36 rules in 15 ms. Remains 386 /404 variables (removed 18) and now considering 1128/1236 (removed 108) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15 ms. Remains : 386/404 places, 1128/1236 transitions.
[2023-04-06 23:26:43] [INFO ] Flatten gal took : 30 ms
[2023-04-06 23:26:43] [INFO ] Flatten gal took : 33 ms
[2023-04-06 23:26:43] [INFO ] Input system was already deterministic with 1128 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 404/404 places, 1236/1236 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 404 transition count 1231
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 399 transition count 1231
Performed 112 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 112 Pre rules applied. Total rules applied 10 place count 399 transition count 1119
Deduced a syphon composed of 112 places in 0 ms
Reduce places removed 112 places and 0 transitions.
Iterating global reduction 2 with 224 rules applied. Total rules applied 234 place count 287 transition count 1119
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 252 place count 269 transition count 1011
Iterating global reduction 2 with 18 rules applied. Total rules applied 270 place count 269 transition count 1011
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 1 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 2 with 58 rules applied. Total rules applied 328 place count 240 transition count 982
Applied a total of 328 rules in 72 ms. Remains 240 /404 variables (removed 164) and now considering 982/1236 (removed 254) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 74 ms. Remains : 240/404 places, 982/1236 transitions.
[2023-04-06 23:26:44] [INFO ] Flatten gal took : 25 ms
[2023-04-06 23:26:44] [INFO ] Flatten gal took : 28 ms
[2023-04-06 23:26:44] [INFO ] Input system was already deterministic with 982 transitions.
Starting structural reductions in LTL mode, iteration 0 : 404/404 places, 1236/1236 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 384 transition count 1116
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 384 transition count 1116
Applied a total of 40 rules in 21 ms. Remains 384 /404 variables (removed 20) and now considering 1116/1236 (removed 120) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 22 ms. Remains : 384/404 places, 1116/1236 transitions.
[2023-04-06 23:26:44] [INFO ] Flatten gal took : 27 ms
[2023-04-06 23:26:44] [INFO ] Flatten gal took : 29 ms
[2023-04-06 23:26:44] [INFO ] Input system was already deterministic with 1116 transitions.
Starting structural reductions in LTL mode, iteration 0 : 404/404 places, 1236/1236 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 384 transition count 1116
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 384 transition count 1116
Applied a total of 40 rules in 16 ms. Remains 384 /404 variables (removed 20) and now considering 1116/1236 (removed 120) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17 ms. Remains : 384/404 places, 1116/1236 transitions.
[2023-04-06 23:26:44] [INFO ] Flatten gal took : 26 ms
[2023-04-06 23:26:44] [INFO ] Flatten gal took : 32 ms
[2023-04-06 23:26:44] [INFO ] Input system was already deterministic with 1116 transitions.
Starting structural reductions in LTL mode, iteration 0 : 404/404 places, 1236/1236 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 386 transition count 1128
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 386 transition count 1128
Applied a total of 36 rules in 15 ms. Remains 386 /404 variables (removed 18) and now considering 1128/1236 (removed 108) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16 ms. Remains : 386/404 places, 1128/1236 transitions.
[2023-04-06 23:26:44] [INFO ] Flatten gal took : 25 ms
[2023-04-06 23:26:44] [INFO ] Flatten gal took : 28 ms
[2023-04-06 23:26:44] [INFO ] Input system was already deterministic with 1128 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 404/404 places, 1236/1236 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 404 transition count 1230
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 398 transition count 1230
Performed 114 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 114 Pre rules applied. Total rules applied 12 place count 398 transition count 1116
Deduced a syphon composed of 114 places in 1 ms
Reduce places removed 114 places and 0 transitions.
Iterating global reduction 2 with 228 rules applied. Total rules applied 240 place count 284 transition count 1116
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 260 place count 264 transition count 996
Iterating global reduction 2 with 20 rules applied. Total rules applied 280 place count 264 transition count 996
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 340 place count 234 transition count 966
Applied a total of 340 rules in 60 ms. Remains 234 /404 variables (removed 170) and now considering 966/1236 (removed 270) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 60 ms. Remains : 234/404 places, 966/1236 transitions.
[2023-04-06 23:26:44] [INFO ] Flatten gal took : 21 ms
[2023-04-06 23:26:44] [INFO ] Flatten gal took : 23 ms
[2023-04-06 23:26:44] [INFO ] Input system was already deterministic with 966 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 3575 steps, run visited all 1 properties in 16 ms. (steps per millisecond=223 )
Probabilistic random walk after 3575 steps, saw 2699 distinct states, run finished after 16 ms. (steps per millisecond=223 ) properties seen :1
FORMULA EisenbergMcGuire-PT-06-CTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Parikh walk visited 0 properties in 0 ms.
Starting structural reductions in SI_CTL mode, iteration 0 : 404/404 places, 1236/1236 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 404 transition count 1231
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 399 transition count 1231
Performed 113 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 113 Pre rules applied. Total rules applied 10 place count 399 transition count 1118
Deduced a syphon composed of 113 places in 1 ms
Reduce places removed 113 places and 0 transitions.
Iterating global reduction 2 with 226 rules applied. Total rules applied 236 place count 286 transition count 1118
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 256 place count 266 transition count 998
Iterating global reduction 2 with 20 rules applied. Total rules applied 276 place count 266 transition count 998
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 336 place count 236 transition count 968
Applied a total of 336 rules in 59 ms. Remains 236 /404 variables (removed 168) and now considering 968/1236 (removed 268) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 60 ms. Remains : 236/404 places, 968/1236 transitions.
[2023-04-06 23:26:44] [INFO ] Flatten gal took : 21 ms
[2023-04-06 23:26:44] [INFO ] Flatten gal took : 23 ms
[2023-04-06 23:26:44] [INFO ] Input system was already deterministic with 968 transitions.
Starting structural reductions in LTL mode, iteration 0 : 404/404 places, 1236/1236 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 384 transition count 1116
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 384 transition count 1116
Applied a total of 40 rules in 17 ms. Remains 384 /404 variables (removed 20) and now considering 1116/1236 (removed 120) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18 ms. Remains : 384/404 places, 1116/1236 transitions.
[2023-04-06 23:26:44] [INFO ] Flatten gal took : 22 ms
[2023-04-06 23:26:44] [INFO ] Flatten gal took : 25 ms
[2023-04-06 23:26:45] [INFO ] Input system was already deterministic with 1116 transitions.
Starting structural reductions in LTL mode, iteration 0 : 404/404 places, 1236/1236 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 389 transition count 1146
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 389 transition count 1146
Applied a total of 30 rules in 16 ms. Remains 389 /404 variables (removed 15) and now considering 1146/1236 (removed 90) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17 ms. Remains : 389/404 places, 1146/1236 transitions.
[2023-04-06 23:26:45] [INFO ] Flatten gal took : 22 ms
[2023-04-06 23:26:45] [INFO ] Flatten gal took : 25 ms
[2023-04-06 23:26:45] [INFO ] Input system was already deterministic with 1146 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 404/404 places, 1236/1236 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 404 transition count 1230
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 398 transition count 1230
Performed 114 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 114 Pre rules applied. Total rules applied 12 place count 398 transition count 1116
Deduced a syphon composed of 114 places in 1 ms
Reduce places removed 114 places and 0 transitions.
Iterating global reduction 2 with 228 rules applied. Total rules applied 240 place count 284 transition count 1116
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 260 place count 264 transition count 996
Iterating global reduction 2 with 20 rules applied. Total rules applied 280 place count 264 transition count 996
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 340 place count 234 transition count 966
Applied a total of 340 rules in 42 ms. Remains 234 /404 variables (removed 170) and now considering 966/1236 (removed 270) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 43 ms. Remains : 234/404 places, 966/1236 transitions.
[2023-04-06 23:26:45] [INFO ] Flatten gal took : 19 ms
[2023-04-06 23:26:45] [INFO ] Flatten gal took : 21 ms
[2023-04-06 23:26:45] [INFO ] Input system was already deterministic with 966 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 404/404 places, 1236/1236 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 404 transition count 1230
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 398 transition count 1230
Performed 110 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 110 Pre rules applied. Total rules applied 12 place count 398 transition count 1120
Deduced a syphon composed of 110 places in 1 ms
Reduce places removed 110 places and 0 transitions.
Iterating global reduction 2 with 220 rules applied. Total rules applied 232 place count 288 transition count 1120
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 249 place count 271 transition count 1018
Iterating global reduction 2 with 17 rules applied. Total rules applied 266 place count 271 transition count 1018
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 326 place count 241 transition count 988
Applied a total of 326 rules in 44 ms. Remains 241 /404 variables (removed 163) and now considering 988/1236 (removed 248) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 45 ms. Remains : 241/404 places, 988/1236 transitions.
[2023-04-06 23:26:45] [INFO ] Flatten gal took : 20 ms
[2023-04-06 23:26:45] [INFO ] Flatten gal took : 22 ms
[2023-04-06 23:26:45] [INFO ] Input system was already deterministic with 988 transitions.
Starting structural reductions in LTL mode, iteration 0 : 404/404 places, 1236/1236 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 384 transition count 1116
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 384 transition count 1116
Applied a total of 40 rules in 9 ms. Remains 384 /404 variables (removed 20) and now considering 1116/1236 (removed 120) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10 ms. Remains : 384/404 places, 1116/1236 transitions.
[2023-04-06 23:26:45] [INFO ] Flatten gal took : 23 ms
[2023-04-06 23:26:45] [INFO ] Flatten gal took : 25 ms
[2023-04-06 23:26:45] [INFO ] Input system was already deterministic with 1116 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 404/404 places, 1236/1236 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 404 transition count 1230
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 398 transition count 1230
Performed 114 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 114 Pre rules applied. Total rules applied 12 place count 398 transition count 1116
Deduced a syphon composed of 114 places in 1 ms
Reduce places removed 114 places and 0 transitions.
Iterating global reduction 2 with 228 rules applied. Total rules applied 240 place count 284 transition count 1116
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 260 place count 264 transition count 996
Iterating global reduction 2 with 20 rules applied. Total rules applied 280 place count 264 transition count 996
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 340 place count 234 transition count 966
Applied a total of 340 rules in 42 ms. Remains 234 /404 variables (removed 170) and now considering 966/1236 (removed 270) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 43 ms. Remains : 234/404 places, 966/1236 transitions.
[2023-04-06 23:26:45] [INFO ] Flatten gal took : 19 ms
[2023-04-06 23:26:45] [INFO ] Flatten gal took : 21 ms
[2023-04-06 23:26:45] [INFO ] Input system was already deterministic with 966 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 879270 steps, run timeout after 3001 ms. (steps per millisecond=292 ) properties seen :{}
Probabilistic random walk after 879270 steps, saw 210289 distinct states, run finished after 3001 ms. (steps per millisecond=292 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-06 23:26:48] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
// Phase 1: matrix 372 rows 234 cols
[2023-04-06 23:26:48] [INFO ] Computed 19 invariants in 6 ms
[2023-04-06 23:26:48] [INFO ] [Real]Absence check using 13 positive place invariants in 4 ms returned sat
[2023-04-06 23:26:48] [INFO ] [Real]Absence check using 13 positive and 6 generalized place invariants in 2 ms returned sat
[2023-04-06 23:26:48] [INFO ] After 145ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 23:26:48] [INFO ] [Nat]Absence check using 13 positive place invariants in 4 ms returned sat
[2023-04-06 23:26:48] [INFO ] [Nat]Absence check using 13 positive and 6 generalized place invariants in 3 ms returned sat
[2023-04-06 23:26:49] [INFO ] After 81ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 23:26:49] [INFO ] State equation strengthened by 164 read => feed constraints.
[2023-04-06 23:26:49] [INFO ] After 33ms SMT Verify possible using 164 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 23:26:49] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 1 ms to minimize.
[2023-04-06 23:26:49] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 1 ms to minimize.
[2023-04-06 23:26:49] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 0 ms to minimize.
[2023-04-06 23:26:49] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-04-06 23:26:49] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 249 ms
[2023-04-06 23:26:49] [INFO ] After 306ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 20 ms.
[2023-04-06 23:26:49] [INFO ] After 469ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 10 ms.
Support contains 3 out of 234 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 234/234 places, 966/966 transitions.
Applied a total of 0 rules in 19 ms. Remains 234 /234 variables (removed 0) and now considering 966/966 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 234/234 places, 966/966 transitions.
Incomplete random walk after 100000 steps, including 2 resets, run finished after 290 ms. (steps per millisecond=344 ) properties (out of 3) seen :2
Running SMT prover for 1 properties.
[2023-04-06 23:26:49] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
[2023-04-06 23:26:49] [INFO ] Invariant cache hit.
[2023-04-06 23:26:49] [INFO ] [Real]Absence check using 13 positive place invariants in 4 ms returned sat
[2023-04-06 23:26:49] [INFO ] [Real]Absence check using 13 positive and 6 generalized place invariants in 2 ms returned sat
[2023-04-06 23:26:49] [INFO ] After 68ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-04-06 23:26:49] [INFO ] State equation strengthened by 164 read => feed constraints.
[2023-04-06 23:26:49] [INFO ] After 18ms SMT Verify possible using 164 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-04-06 23:26:49] [INFO ] After 42ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 23:26:49] [INFO ] After 163ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 23:26:49] [INFO ] [Nat]Absence check using 13 positive place invariants in 3 ms returned sat
[2023-04-06 23:26:49] [INFO ] [Nat]Absence check using 13 positive and 6 generalized place invariants in 2 ms returned sat
[2023-04-06 23:26:49] [INFO ] After 69ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 23:26:49] [INFO ] After 20ms SMT Verify possible using 164 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 23:26:50] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 0 ms to minimize.
[2023-04-06 23:26:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 67 ms
[2023-04-06 23:26:50] [INFO ] After 97ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 5 ms.
[2023-04-06 23:26:50] [INFO ] After 216ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1603 ms. (steps per millisecond=623 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 429 ms. (steps per millisecond=2331 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1792742 steps, run timeout after 6001 ms. (steps per millisecond=298 ) properties seen :{}
Probabilistic random walk after 1792742 steps, saw 376374 distinct states, run finished after 6001 ms. (steps per millisecond=298 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-06 23:26:58] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
[2023-04-06 23:26:58] [INFO ] Invariant cache hit.
[2023-04-06 23:26:58] [INFO ] [Real]Absence check using 13 positive place invariants in 4 ms returned sat
[2023-04-06 23:26:58] [INFO ] [Real]Absence check using 13 positive and 6 generalized place invariants in 2 ms returned sat
[2023-04-06 23:26:58] [INFO ] After 136ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 23:26:58] [INFO ] [Nat]Absence check using 13 positive place invariants in 4 ms returned sat
[2023-04-06 23:26:58] [INFO ] [Nat]Absence check using 13 positive and 6 generalized place invariants in 7 ms returned sat
[2023-04-06 23:26:58] [INFO ] After 82ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 23:26:58] [INFO ] State equation strengthened by 164 read => feed constraints.
[2023-04-06 23:26:58] [INFO ] After 37ms SMT Verify possible using 164 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 23:26:58] [INFO ] Deduced a trap composed of 4 places in 86 ms of which 0 ms to minimize.
[2023-04-06 23:26:58] [INFO ] Deduced a trap composed of 3 places in 73 ms of which 1 ms to minimize.
[2023-04-06 23:26:58] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 1 ms to minimize.
[2023-04-06 23:26:58] [INFO ] Deduced a trap composed of 6 places in 55 ms of which 0 ms to minimize.
[2023-04-06 23:26:58] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 0 ms to minimize.
[2023-04-06 23:26:58] [INFO ] Deduced a trap composed of 36 places in 49 ms of which 0 ms to minimize.
[2023-04-06 23:26:58] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 492 ms
[2023-04-06 23:26:58] [INFO ] After 547ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 21 ms.
[2023-04-06 23:26:58] [INFO ] After 716ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 17 ms.
Support contains 3 out of 234 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 234/234 places, 966/966 transitions.
Applied a total of 0 rules in 17 ms. Remains 234 /234 variables (removed 0) and now considering 966/966 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 234/234 places, 966/966 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 234/234 places, 966/966 transitions.
Applied a total of 0 rules in 17 ms. Remains 234 /234 variables (removed 0) and now considering 966/966 (removed 0) transitions.
[2023-04-06 23:26:58] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
[2023-04-06 23:26:58] [INFO ] Invariant cache hit.
[2023-04-06 23:26:59] [INFO ] Implicit Places using invariants in 160 ms returned []
[2023-04-06 23:26:59] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
[2023-04-06 23:26:59] [INFO ] Invariant cache hit.
[2023-04-06 23:26:59] [INFO ] State equation strengthened by 164 read => feed constraints.
[2023-04-06 23:26:59] [INFO ] Implicit Places using invariants and state equation in 564 ms returned []
Implicit Place search using SMT with State Equation took 727 ms to find 0 implicit places.
[2023-04-06 23:26:59] [INFO ] Redundant transitions in 19 ms returned []
[2023-04-06 23:26:59] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
[2023-04-06 23:26:59] [INFO ] Invariant cache hit.
[2023-04-06 23:27:00] [INFO ] Dead Transitions using invariants and state equation in 294 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1069 ms. Remains : 234/234 places, 966/966 transitions.
Incomplete random walk after 100000 steps, including 2 resets, run finished after 166 ms. (steps per millisecond=602 ) properties (out of 3) seen :2
Running SMT prover for 1 properties.
[2023-04-06 23:27:00] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
[2023-04-06 23:27:00] [INFO ] Invariant cache hit.
[2023-04-06 23:27:00] [INFO ] [Real]Absence check using 13 positive place invariants in 4 ms returned sat
[2023-04-06 23:27:00] [INFO ] [Real]Absence check using 13 positive and 6 generalized place invariants in 2 ms returned sat
[2023-04-06 23:27:00] [INFO ] After 64ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-04-06 23:27:00] [INFO ] State equation strengthened by 164 read => feed constraints.
[2023-04-06 23:27:00] [INFO ] After 15ms SMT Verify possible using 164 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-04-06 23:27:00] [INFO ] After 55ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 23:27:00] [INFO ] After 173ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 23:27:00] [INFO ] [Nat]Absence check using 13 positive place invariants in 4 ms returned sat
[2023-04-06 23:27:00] [INFO ] [Nat]Absence check using 13 positive and 6 generalized place invariants in 3 ms returned sat
[2023-04-06 23:27:00] [INFO ] After 65ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 23:27:00] [INFO ] After 20ms SMT Verify possible using 164 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 23:27:00] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 1 ms to minimize.
[2023-04-06 23:27:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 65 ms
[2023-04-06 23:27:00] [INFO ] After 99ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 8 ms.
[2023-04-06 23:27:00] [INFO ] After 230ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished random walk after 77 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=77 )
Parikh walk visited 0 properties in 0 ms.
Finished random walk after 20 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=20 )
Parikh walk visited 0 properties in 0 ms.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Finished probabilistic random walk after 7859 steps, run visited all 1 properties in 32 ms. (steps per millisecond=245 )
Probabilistic random walk after 7859 steps, saw 5466 distinct states, run finished after 33 ms. (steps per millisecond=238 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Graph (trivial) has 866 edges and 234 vertex of which 36 / 234 are part of one of the 6 SCC in 0 ms
Free SCC test removed 30 places
Drop transitions removed 114 transitions
Ensure Unique test removed 570 transitions
Reduce isomorphic transitions removed 684 transitions.
Drop transitions removed 46 transitions
Trivial Post-agglo rules discarded 46 transitions
Performed 46 trivial Post agglomeration. Transition count delta: 46
Iterating post reduction 0 with 46 rules applied. Total rules applied 47 place count 204 transition count 236
Reduce places removed 46 places and 0 transitions.
Iterating post reduction 1 with 46 rules applied. Total rules applied 93 place count 158 transition count 236
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 93 place count 158 transition count 223
Deduced a syphon composed of 13 places in 0 ms
Ensure Unique test removed 6 places
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 125 place count 139 transition count 223
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: 59
Deduced a syphon composed of 59 places in 0 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 2 with 118 rules applied. Total rules applied 243 place count 80 transition count 164
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 2 with 28 rules applied. Total rules applied 271 place count 80 transition count 136
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 281 place count 75 transition count 136
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 286 place count 75 transition count 131
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 292 place count 75 transition count 125
Free-agglomeration rule applied 31 times.
Iterating global reduction 4 with 31 rules applied. Total rules applied 323 place count 75 transition count 94
Reduce places removed 31 places and 0 transitions.
Iterating post reduction 4 with 31 rules applied. Total rules applied 354 place count 44 transition count 94
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 360 place count 44 transition count 94
Applied a total of 360 rules in 25 ms. Remains 44 /234 variables (removed 190) and now considering 94/966 (removed 872) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 94 rows 44 cols
[2023-04-06 23:27:00] [INFO ] Computed 13 invariants in 1 ms
[2023-04-06 23:27:00] [INFO ] [Real]Absence check using 13 positive place invariants in 2 ms returned sat
[2023-04-06 23:27:00] [INFO ] After 40ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 23:27:00] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2023-04-06 23:27:00] [INFO ] After 18ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 23:27:00] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-04-06 23:27:00] [INFO ] After 6ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 23:27:00] [INFO ] Deduced a trap composed of 2 places in 13 ms of which 0 ms to minimize.
[2023-04-06 23:27:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 19 ms
[2023-04-06 23:27:00] [INFO ] After 29ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 4 ms.
[2023-04-06 23:27:00] [INFO ] After 73ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Starting structural reductions in LTL mode, iteration 0 : 404/404 places, 1236/1236 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 386 transition count 1128
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 386 transition count 1128
Applied a total of 36 rules in 12 ms. Remains 386 /404 variables (removed 18) and now considering 1128/1236 (removed 108) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12 ms. Remains : 386/404 places, 1128/1236 transitions.
[2023-04-06 23:27:00] [INFO ] Flatten gal took : 22 ms
[2023-04-06 23:27:00] [INFO ] Flatten gal took : 24 ms
[2023-04-06 23:27:00] [INFO ] Input system was already deterministic with 1128 transitions.
[2023-04-06 23:27:00] [INFO ] Flatten gal took : 28 ms
[2023-04-06 23:27:01] [INFO ] Flatten gal took : 27 ms
[2023-04-06 23:27:01] [INFO ] Export to MCC of 13 properties in file /home/mcc/execution/CTLFireability.sr.xml took 3 ms.
[2023-04-06 23:27:01] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 404 places, 1236 transitions and 5736 arcs took 6 ms.
Total runtime 79721 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: 404 NrTr: 1236 NrArc: 5736)
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.053sec
net check time: 0m 0.000sec
init dd package: 0m 2.673sec
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 8924608 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16103944 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.003sec
30246 48287 127973 185667 215722 248915 240064 251835 282945 319649 329365 347783 393620 418141 415054 415018 426722 425691 956382 1034840 1096143 1202052 1287527 1248340 1287180 1283548 1276661 1215172 1184411 1168083 1138324 1121104 1585093 1734361 1969575
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-06"
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-06, 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-167987247100242"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/EisenbergMcGuire-PT-06.tgz
mv EisenbergMcGuire-PT-06 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 '
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 ;