Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r135-tall-171631131300545.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is DoubleExponent-PT-004, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r135-tall-171631131300545
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 476K
-rw-r--r-- 1 mcc users 7.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 39K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K May 19 07:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 19 15:46 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:16 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 18:14 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.6K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 102K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.5K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 51K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 19 07:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 19 15:25 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 67K May 18 16:42 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 DoubleExponent-PT-004-CTLCardinality-2024-00
FORMULA_NAME DoubleExponent-PT-004-CTLCardinality-2024-01
FORMULA_NAME DoubleExponent-PT-004-CTLCardinality-2024-02
FORMULA_NAME DoubleExponent-PT-004-CTLCardinality-2024-03
FORMULA_NAME DoubleExponent-PT-004-CTLCardinality-2024-04
FORMULA_NAME DoubleExponent-PT-004-CTLCardinality-2024-05
FORMULA_NAME DoubleExponent-PT-004-CTLCardinality-2024-06
FORMULA_NAME DoubleExponent-PT-004-CTLCardinality-2024-07
FORMULA_NAME DoubleExponent-PT-004-CTLCardinality-2024-08
FORMULA_NAME DoubleExponent-PT-004-CTLCardinality-2024-09
FORMULA_NAME DoubleExponent-PT-004-CTLCardinality-2024-10
FORMULA_NAME DoubleExponent-PT-004-CTLCardinality-2024-11
FORMULA_NAME DoubleExponent-PT-004-CTLCardinality-2023-12
FORMULA_NAME DoubleExponent-PT-004-CTLCardinality-2023-13
FORMULA_NAME DoubleExponent-PT-004-CTLCardinality-2023-14
FORMULA_NAME DoubleExponent-PT-004-CTLCardinality-2023-15

=== Now, execution of the tool begins

BK_START 1716376306102

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DoubleExponent-PT-004
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-22 11:11:47] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-22 11:11:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 11:11:47] [INFO ] Load time of PNML (sax parser for PT used): 71 ms
[2024-05-22 11:11:47] [INFO ] Transformed 216 places.
[2024-05-22 11:11:47] [INFO ] Transformed 198 transitions.
[2024-05-22 11:11:47] [INFO ] Parsed PT model containing 216 places and 198 transitions and 558 arcs in 167 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 16 ms.
Support contains 122 out of 216 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 216/216 places, 198/198 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 213 transition count 198
Applied a total of 3 rules in 24 ms. Remains 213 /216 variables (removed 3) and now considering 198/198 (removed 0) transitions.
// Phase 1: matrix 198 rows 213 cols
[2024-05-22 11:11:47] [INFO ] Computed 22 invariants in 27 ms
[2024-05-22 11:11:47] [INFO ] Implicit Places using invariants in 268 ms returned []
[2024-05-22 11:11:47] [INFO ] Invariant cache hit.
[2024-05-22 11:11:48] [INFO ] Implicit Places using invariants and state equation in 233 ms returned []
Implicit Place search using SMT with State Equation took 529 ms to find 0 implicit places.
Running 197 sub problems to find dead transitions.
[2024-05-22 11:11:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/211 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/211 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 2 (OVERLAPS) 2/213 variables, 5/22 constraints. Problems are: Problem set: 0 solved, 197 unsolved
[2024-05-22 11:11:50] [INFO ] Deduced a trap composed of 86 places in 91 ms of which 17 ms to minimize.
[2024-05-22 11:11:50] [INFO ] Deduced a trap composed of 95 places in 71 ms of which 2 ms to minimize.
[2024-05-22 11:11:50] [INFO ] Deduced a trap composed of 41 places in 66 ms of which 1 ms to minimize.
[2024-05-22 11:11:50] [INFO ] Deduced a trap composed of 88 places in 57 ms of which 2 ms to minimize.
[2024-05-22 11:11:50] [INFO ] Deduced a trap composed of 57 places in 45 ms of which 1 ms to minimize.
[2024-05-22 11:11:50] [INFO ] Deduced a trap composed of 111 places in 59 ms of which 2 ms to minimize.
[2024-05-22 11:11:51] [INFO ] Deduced a trap composed of 54 places in 39 ms of which 1 ms to minimize.
[2024-05-22 11:11:51] [INFO ] Deduced a trap composed of 52 places in 39 ms of which 1 ms to minimize.
[2024-05-22 11:11:51] [INFO ] Deduced a trap composed of 55 places in 67 ms of which 1 ms to minimize.
[2024-05-22 11:11:51] [INFO ] Deduced a trap composed of 93 places in 56 ms of which 2 ms to minimize.
[2024-05-22 11:11:51] [INFO ] Deduced a trap composed of 94 places in 59 ms of which 1 ms to minimize.
[2024-05-22 11:11:51] [INFO ] Deduced a trap composed of 52 places in 34 ms of which 1 ms to minimize.
[2024-05-22 11:11:51] [INFO ] Deduced a trap composed of 49 places in 28 ms of which 1 ms to minimize.
[2024-05-22 11:11:51] [INFO ] Deduced a trap composed of 112 places in 60 ms of which 2 ms to minimize.
[2024-05-22 11:11:51] [INFO ] Deduced a trap composed of 55 places in 70 ms of which 2 ms to minimize.
[2024-05-22 11:11:51] [INFO ] Deduced a trap composed of 16 places in 58 ms of which 1 ms to minimize.
[2024-05-22 11:11:51] [INFO ] Deduced a trap composed of 103 places in 65 ms of which 1 ms to minimize.
[2024-05-22 11:11:51] [INFO ] Deduced a trap composed of 18 places in 64 ms of which 2 ms to minimize.
[2024-05-22 11:11:51] [INFO ] Deduced a trap composed of 89 places in 62 ms of which 2 ms to minimize.
[2024-05-22 11:11:52] [INFO ] Deduced a trap composed of 50 places in 65 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/213 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 197 unsolved
[2024-05-22 11:11:53] [INFO ] Deduced a trap composed of 109 places in 57 ms of which 2 ms to minimize.
[2024-05-22 11:11:53] [INFO ] Deduced a trap composed of 112 places in 61 ms of which 1 ms to minimize.
[2024-05-22 11:11:53] [INFO ] Deduced a trap composed of 118 places in 56 ms of which 1 ms to minimize.
[2024-05-22 11:11:53] [INFO ] Deduced a trap composed of 25 places in 65 ms of which 1 ms to minimize.
[2024-05-22 11:11:54] [INFO ] Deduced a trap composed of 109 places in 62 ms of which 2 ms to minimize.
[2024-05-22 11:11:54] [INFO ] Deduced a trap composed of 70 places in 52 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/213 variables, 6/48 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/213 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 6 (OVERLAPS) 198/411 variables, 213/261 constraints. Problems are: Problem set: 0 solved, 197 unsolved
[2024-05-22 11:11:57] [INFO ] Deduced a trap composed of 29 places in 48 ms of which 1 ms to minimize.
[2024-05-22 11:11:57] [INFO ] Deduced a trap composed of 69 places in 63 ms of which 1 ms to minimize.
[2024-05-22 11:11:58] [INFO ] Deduced a trap composed of 91 places in 69 ms of which 1 ms to minimize.
[2024-05-22 11:11:58] [INFO ] Deduced a trap composed of 90 places in 64 ms of which 2 ms to minimize.
[2024-05-22 11:11:58] [INFO ] Deduced a trap composed of 102 places in 58 ms of which 2 ms to minimize.
[2024-05-22 11:11:58] [INFO ] Deduced a trap composed of 97 places in 59 ms of which 1 ms to minimize.
[2024-05-22 11:11:58] [INFO ] Deduced a trap composed of 88 places in 56 ms of which 1 ms to minimize.
[2024-05-22 11:11:58] [INFO ] Deduced a trap composed of 102 places in 57 ms of which 2 ms to minimize.
[2024-05-22 11:11:58] [INFO ] Deduced a trap composed of 104 places in 63 ms of which 3 ms to minimize.
[2024-05-22 11:11:58] [INFO ] Deduced a trap composed of 105 places in 59 ms of which 1 ms to minimize.
[2024-05-22 11:11:58] [INFO ] Deduced a trap composed of 88 places in 50 ms of which 2 ms to minimize.
[2024-05-22 11:11:59] [INFO ] Deduced a trap composed of 82 places in 49 ms of which 1 ms to minimize.
[2024-05-22 11:11:59] [INFO ] Deduced a trap composed of 101 places in 52 ms of which 3 ms to minimize.
[2024-05-22 11:11:59] [INFO ] Deduced a trap composed of 106 places in 63 ms of which 3 ms to minimize.
[2024-05-22 11:11:59] [INFO ] Deduced a trap composed of 96 places in 60 ms of which 1 ms to minimize.
[2024-05-22 11:11:59] [INFO ] Deduced a trap composed of 111 places in 55 ms of which 2 ms to minimize.
[2024-05-22 11:11:59] [INFO ] Deduced a trap composed of 124 places in 57 ms of which 2 ms to minimize.
[2024-05-22 11:11:59] [INFO ] Deduced a trap composed of 104 places in 56 ms of which 2 ms to minimize.
[2024-05-22 11:11:59] [INFO ] Deduced a trap composed of 119 places in 56 ms of which 2 ms to minimize.
[2024-05-22 11:11:59] [INFO ] Deduced a trap composed of 105 places in 60 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/411 variables, 20/281 constraints. Problems are: Problem set: 0 solved, 197 unsolved
[2024-05-22 11:11:59] [INFO ] Deduced a trap composed of 43 places in 63 ms of which 2 ms to minimize.
[2024-05-22 11:12:00] [INFO ] Deduced a trap composed of 68 places in 65 ms of which 2 ms to minimize.
[2024-05-22 11:12:00] [INFO ] Deduced a trap composed of 97 places in 62 ms of which 2 ms to minimize.
[2024-05-22 11:12:01] [INFO ] Deduced a trap composed of 108 places in 60 ms of which 1 ms to minimize.
[2024-05-22 11:12:01] [INFO ] Deduced a trap composed of 103 places in 60 ms of which 2 ms to minimize.
[2024-05-22 11:12:01] [INFO ] Deduced a trap composed of 100 places in 57 ms of which 1 ms to minimize.
[2024-05-22 11:12:01] [INFO ] Deduced a trap composed of 112 places in 61 ms of which 2 ms to minimize.
[2024-05-22 11:12:01] [INFO ] Deduced a trap composed of 113 places in 57 ms of which 1 ms to minimize.
[2024-05-22 11:12:01] [INFO ] Deduced a trap composed of 113 places in 63 ms of which 1 ms to minimize.
[2024-05-22 11:12:01] [INFO ] Deduced a trap composed of 115 places in 59 ms of which 4 ms to minimize.
[2024-05-22 11:12:01] [INFO ] Deduced a trap composed of 62 places in 62 ms of which 2 ms to minimize.
[2024-05-22 11:12:01] [INFO ] Deduced a trap composed of 48 places in 58 ms of which 2 ms to minimize.
[2024-05-22 11:12:01] [INFO ] Deduced a trap composed of 112 places in 61 ms of which 1 ms to minimize.
[2024-05-22 11:12:01] [INFO ] Deduced a trap composed of 113 places in 59 ms of which 1 ms to minimize.
[2024-05-22 11:12:01] [INFO ] Deduced a trap composed of 112 places in 54 ms of which 1 ms to minimize.
[2024-05-22 11:12:02] [INFO ] Deduced a trap composed of 122 places in 67 ms of which 1 ms to minimize.
[2024-05-22 11:12:02] [INFO ] Deduced a trap composed of 111 places in 59 ms of which 2 ms to minimize.
[2024-05-22 11:12:02] [INFO ] Deduced a trap composed of 115 places in 61 ms of which 2 ms to minimize.
[2024-05-22 11:12:02] [INFO ] Deduced a trap composed of 96 places in 62 ms of which 2 ms to minimize.
[2024-05-22 11:12:02] [INFO ] Deduced a trap composed of 79 places in 64 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/411 variables, 20/301 constraints. Problems are: Problem set: 0 solved, 197 unsolved
[2024-05-22 11:12:03] [INFO ] Deduced a trap composed of 121 places in 66 ms of which 2 ms to minimize.
[2024-05-22 11:12:04] [INFO ] Deduced a trap composed of 110 places in 62 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/411 variables, 2/303 constraints. Problems are: Problem set: 0 solved, 197 unsolved
[2024-05-22 11:12:06] [INFO ] Deduced a trap composed of 88 places in 65 ms of which 1 ms to minimize.
[2024-05-22 11:12:06] [INFO ] Deduced a trap composed of 108 places in 69 ms of which 1 ms to minimize.
[2024-05-22 11:12:07] [INFO ] Deduced a trap composed of 86 places in 65 ms of which 2 ms to minimize.
[2024-05-22 11:12:07] [INFO ] Deduced a trap composed of 111 places in 68 ms of which 2 ms to minimize.
[2024-05-22 11:12:07] [INFO ] Deduced a trap composed of 135 places in 58 ms of which 1 ms to minimize.
[2024-05-22 11:12:07] [INFO ] Deduced a trap composed of 140 places in 57 ms of which 1 ms to minimize.
[2024-05-22 11:12:07] [INFO ] Deduced a trap composed of 133 places in 55 ms of which 2 ms to minimize.
[2024-05-22 11:12:07] [INFO ] Deduced a trap composed of 115 places in 57 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/411 variables, 8/311 constraints. Problems are: Problem set: 0 solved, 197 unsolved
[2024-05-22 11:12:08] [INFO ] Deduced a trap composed of 88 places in 57 ms of which 1 ms to minimize.
[2024-05-22 11:12:09] [INFO ] Deduced a trap composed of 115 places in 68 ms of which 2 ms to minimize.
[2024-05-22 11:12:09] [INFO ] Deduced a trap composed of 123 places in 57 ms of which 2 ms to minimize.
[2024-05-22 11:12:10] [INFO ] Deduced a trap composed of 116 places in 61 ms of which 1 ms to minimize.
[2024-05-22 11:12:10] [INFO ] Deduced a trap composed of 122 places in 66 ms of which 1 ms to minimize.
[2024-05-22 11:12:10] [INFO ] Deduced a trap composed of 123 places in 58 ms of which 2 ms to minimize.
[2024-05-22 11:12:10] [INFO ] Deduced a trap composed of 126 places in 57 ms of which 2 ms to minimize.
[2024-05-22 11:12:10] [INFO ] Deduced a trap composed of 127 places in 54 ms of which 1 ms to minimize.
[2024-05-22 11:12:10] [INFO ] Deduced a trap composed of 117 places in 57 ms of which 1 ms to minimize.
[2024-05-22 11:12:10] [INFO ] Deduced a trap composed of 120 places in 58 ms of which 1 ms to minimize.
[2024-05-22 11:12:10] [INFO ] Deduced a trap composed of 119 places in 57 ms of which 1 ms to minimize.
[2024-05-22 11:12:10] [INFO ] Deduced a trap composed of 129 places in 58 ms of which 2 ms to minimize.
[2024-05-22 11:12:10] [INFO ] Deduced a trap composed of 105 places in 57 ms of which 1 ms to minimize.
[2024-05-22 11:12:10] [INFO ] Deduced a trap composed of 115 places in 56 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/411 variables, 14/325 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/411 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 197 unsolved
[2024-05-22 11:12:15] [INFO ] Deduced a trap composed of 105 places in 56 ms of which 1 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/411 variables, 1/326 constraints. Problems are: Problem set: 0 solved, 197 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 411/411 variables, and 326 constraints, problems are : Problem set: 0 solved, 197 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 213/213 constraints, PredecessorRefiner: 197/197 constraints, Known Traps: 91/91 constraints]
Escalating to Integer solving :Problem set: 0 solved, 197 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/211 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/211 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 2 (OVERLAPS) 2/213 variables, 5/22 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/213 variables, 91/113 constraints. Problems are: Problem set: 0 solved, 197 unsolved
[2024-05-22 11:12:20] [INFO ] Deduced a trap composed of 114 places in 58 ms of which 2 ms to minimize.
[2024-05-22 11:12:20] [INFO ] Deduced a trap composed of 115 places in 55 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/213 variables, 2/115 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/213 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 6 (OVERLAPS) 198/411 variables, 213/328 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/411 variables, 197/525 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/411 variables, 0/525 constraints. Problems are: Problem set: 0 solved, 197 unsolved
[2024-05-22 11:12:34] [INFO ] Deduced a trap composed of 132 places in 69 ms of which 3 ms to minimize.
[2024-05-22 11:12:34] [INFO ] Deduced a trap composed of 132 places in 62 ms of which 2 ms to minimize.
[2024-05-22 11:12:34] [INFO ] Deduced a trap composed of 141 places in 60 ms of which 1 ms to minimize.
[2024-05-22 11:12:34] [INFO ] Deduced a trap composed of 132 places in 61 ms of which 1 ms to minimize.
[2024-05-22 11:12:34] [INFO ] Deduced a trap composed of 124 places in 62 ms of which 2 ms to minimize.
[2024-05-22 11:12:34] [INFO ] Deduced a trap composed of 141 places in 57 ms of which 1 ms to minimize.
[2024-05-22 11:12:34] [INFO ] Deduced a trap composed of 138 places in 58 ms of which 1 ms to minimize.
[2024-05-22 11:12:35] [INFO ] Deduced a trap composed of 141 places in 61 ms of which 1 ms to minimize.
[2024-05-22 11:12:35] [INFO ] Deduced a trap composed of 133 places in 58 ms of which 1 ms to minimize.
[2024-05-22 11:12:35] [INFO ] Deduced a trap composed of 141 places in 58 ms of which 1 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/411 variables, 10/535 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/411 variables, 0/535 constraints. Problems are: Problem set: 0 solved, 197 unsolved
[2024-05-22 11:12:44] [INFO ] Deduced a trap composed of 38 places in 51 ms of which 1 ms to minimize.
[2024-05-22 11:12:47] [INFO ] Deduced a trap composed of 82 places in 64 ms of which 1 ms to minimize.
[2024-05-22 11:12:47] [INFO ] Deduced a trap composed of 106 places in 63 ms of which 2 ms to minimize.
[2024-05-22 11:12:47] [INFO ] Deduced a trap composed of 40 places in 65 ms of which 2 ms to minimize.
[2024-05-22 11:12:47] [INFO ] Deduced a trap composed of 80 places in 60 ms of which 1 ms to minimize.
[2024-05-22 11:12:47] [INFO ] Deduced a trap composed of 90 places in 58 ms of which 1 ms to minimize.
[2024-05-22 11:12:47] [INFO ] Deduced a trap composed of 97 places in 61 ms of which 1 ms to minimize.
[2024-05-22 11:12:48] [INFO ] Deduced a trap composed of 102 places in 61 ms of which 1 ms to minimize.
[2024-05-22 11:12:48] [INFO ] Deduced a trap composed of 89 places in 62 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 411/411 variables, and 544 constraints, problems are : Problem set: 0 solved, 197 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 213/213 constraints, PredecessorRefiner: 197/197 constraints, Known Traps: 112/112 constraints]
After SMT, in 60101ms problems are : Problem set: 0 solved, 197 unsolved
Search for dead transitions found 0 dead transitions in 60123ms
Starting structural reductions in LTL mode, iteration 1 : 213/216 places, 198/198 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60697 ms. Remains : 213/216 places, 198/198 transitions.
Support contains 122 out of 213 places after structural reductions.
[2024-05-22 11:12:48] [INFO ] Flatten gal took : 36 ms
[2024-05-22 11:12:48] [INFO ] Flatten gal took : 15 ms
[2024-05-22 11:12:48] [INFO ] Input system was already deterministic with 198 transitions.
RANDOM walk for 40000 steps (1321 resets) in 1919 ms. (20 steps per ms) remains 65/97 properties
BEST_FIRST walk for 4001 steps (113 resets) in 150 ms. (26 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4002 steps (112 resets) in 38 ms. (102 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4001 steps (120 resets) in 36 ms. (108 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4001 steps (111 resets) in 74 ms. (53 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4001 steps (113 resets) in 40 ms. (97 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4000 steps (114 resets) in 33 ms. (117 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4000 steps (112 resets) in 31 ms. (125 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4000 steps (112 resets) in 32 ms. (121 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4000 steps (112 resets) in 27 ms. (142 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4002 steps (108 resets) in 34 ms. (114 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4002 steps (113 resets) in 29 ms. (133 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4000 steps (118 resets) in 30 ms. (129 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4000 steps (111 resets) in 27 ms. (142 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4000 steps (112 resets) in 25 ms. (153 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4000 steps (114 resets) in 36 ms. (108 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4000 steps (118 resets) in 35 ms. (111 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4001 steps (110 resets) in 28 ms. (137 steps per ms) remains 61/65 properties
BEST_FIRST walk for 4000 steps (112 resets) in 40 ms. (97 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4001 steps (115 resets) in 27 ms. (142 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4001 steps (141 resets) in 25 ms. (153 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4000 steps (110 resets) in 27 ms. (142 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4000 steps (116 resets) in 29 ms. (133 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4000 steps (110 resets) in 34 ms. (114 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4001 steps (115 resets) in 50 ms. (78 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4000 steps (119 resets) in 28 ms. (137 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4002 steps (110 resets) in 36 ms. (108 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4000 steps (114 resets) in 29 ms. (133 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4000 steps (113 resets) in 27 ms. (142 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4000 steps (113 resets) in 29 ms. (133 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4000 steps (107 resets) in 30 ms. (129 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4000 steps (107 resets) in 27 ms. (142 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4000 steps (114 resets) in 30 ms. (129 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4001 steps (112 resets) in 25 ms. (153 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4000 steps (109 resets) in 46 ms. (85 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4000 steps (107 resets) in 40 ms. (97 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4002 steps (111 resets) in 50 ms. (78 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4000 steps (105 resets) in 26 ms. (148 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4000 steps (114 resets) in 33 ms. (117 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4000 steps (111 resets) in 45 ms. (86 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4000 steps (117 resets) in 72 ms. (54 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4000 steps (118 resets) in 27 ms. (142 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4000 steps (111 resets) in 27 ms. (142 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4000 steps (112 resets) in 32 ms. (121 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4001 steps (110 resets) in 31 ms. (125 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4001 steps (114 resets) in 64 ms. (61 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4001 steps (111 resets) in 34 ms. (114 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4000 steps (118 resets) in 33 ms. (117 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4001 steps (111 resets) in 45 ms. (86 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4002 steps (109 resets) in 40 ms. (97 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4000 steps (104 resets) in 39 ms. (100 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4000 steps (112 resets) in 37 ms. (105 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4000 steps (116 resets) in 45 ms. (86 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4001 steps (113 resets) in 27 ms. (142 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4001 steps (111 resets) in 21 ms. (181 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4000 steps (118 resets) in 25 ms. (153 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4000 steps (118 resets) in 21 ms. (181 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4000 steps (114 resets) in 24 ms. (160 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4002 steps (113 resets) in 29 ms. (133 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4001 steps (103 resets) in 25 ms. (153 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4001 steps (108 resets) in 21 ms. (181 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4000 steps (109 resets) in 21 ms. (181 steps per ms) remains 61/61 properties
[2024-05-22 11:12:49] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 61 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp38 is UNSAT
Problem AtomicPropp42 is UNSAT
Problem AtomicPropp45 is UNSAT
Problem AtomicPropp50 is UNSAT
Problem AtomicPropp52 is UNSAT
Problem AtomicPropp54 is UNSAT
Problem AtomicPropp61 is UNSAT
Problem AtomicPropp66 is UNSAT
Problem AtomicPropp79 is UNSAT
Problem AtomicPropp81 is UNSAT
Problem AtomicPropp83 is UNSAT
Problem AtomicPropp85 is UNSAT
Problem AtomicPropp90 is UNSAT
Problem AtomicPropp95 is UNSAT
At refinement iteration 1 (OVERLAPS) 112/194 variables, 5/5 constraints. Problems are: Problem set: 16 solved, 45 unsolved
Problem AtomicPropp80 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/194 variables, 1/6 constraints. Problems are: Problem set: 17 solved, 44 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/194 variables, 0/6 constraints. Problems are: Problem set: 17 solved, 44 unsolved
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp46 is UNSAT
Problem AtomicPropp76 is UNSAT
At refinement iteration 4 (OVERLAPS) 19/213 variables, 16/22 constraints. Problems are: Problem set: 20 solved, 41 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/213 variables, 0/22 constraints. Problems are: Problem set: 20 solved, 41 unsolved
At refinement iteration 6 (OVERLAPS) 198/411 variables, 213/235 constraints. Problems are: Problem set: 20 solved, 41 unsolved
[2024-05-22 11:12:51] [INFO ] Deduced a trap composed of 29 places in 73 ms of which 1 ms to minimize.
[2024-05-22 11:12:51] [INFO ] Deduced a trap composed of 43 places in 52 ms of which 1 ms to minimize.
[2024-05-22 11:12:51] [INFO ] Deduced a trap composed of 54 places in 45 ms of which 1 ms to minimize.
Problem AtomicPropp26 is UNSAT
Problem AtomicPropp31 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/411 variables, 3/238 constraints. Problems are: Problem set: 22 solved, 39 unsolved
[2024-05-22 11:12:51] [INFO ] Deduced a trap composed of 36 places in 51 ms of which 1 ms to minimize.
[2024-05-22 11:12:51] [INFO ] Deduced a trap composed of 36 places in 44 ms of which 1 ms to minimize.
[2024-05-22 11:12:51] [INFO ] Deduced a trap composed of 39 places in 47 ms of which 1 ms to minimize.
[2024-05-22 11:12:51] [INFO ] Deduced a trap composed of 103 places in 63 ms of which 1 ms to minimize.
[2024-05-22 11:12:51] [INFO ] Deduced a trap composed of 83 places in 62 ms of which 1 ms to minimize.
[2024-05-22 11:12:51] [INFO ] Deduced a trap composed of 76 places in 58 ms of which 1 ms to minimize.
Problem AtomicPropp69 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/411 variables, 6/244 constraints. Problems are: Problem set: 23 solved, 38 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/411 variables, 0/244 constraints. Problems are: Problem set: 23 solved, 38 unsolved
At refinement iteration 10 (OVERLAPS) 0/411 variables, 0/244 constraints. Problems are: Problem set: 23 solved, 38 unsolved
No progress, stopping.
After SMT solving in domain Real declared 411/411 variables, and 244 constraints, problems are : Problem set: 23 solved, 38 unsolved in 2635 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 213/213 constraints, PredecessorRefiner: 61/61 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 23 solved, 38 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 0/0 constraints. Problems are: Problem set: 23 solved, 38 unsolved
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp33 is UNSAT
At refinement iteration 1 (OVERLAPS) 136/187 variables, 4/4 constraints. Problems are: Problem set: 25 solved, 36 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/187 variables, 1/5 constraints. Problems are: Problem set: 25 solved, 36 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/187 variables, 1/6 constraints. Problems are: Problem set: 25 solved, 36 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/187 variables, 0/6 constraints. Problems are: Problem set: 25 solved, 36 unsolved
At refinement iteration 5 (OVERLAPS) 2/189 variables, 1/7 constraints. Problems are: Problem set: 25 solved, 36 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/189 variables, 0/7 constraints. Problems are: Problem set: 25 solved, 36 unsolved
At refinement iteration 7 (OVERLAPS) 24/213 variables, 16/23 constraints. Problems are: Problem set: 25 solved, 36 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/213 variables, 8/31 constraints. Problems are: Problem set: 25 solved, 36 unsolved
[2024-05-22 11:12:53] [INFO ] Deduced a trap composed of 25 places in 61 ms of which 1 ms to minimize.
[2024-05-22 11:12:53] [INFO ] Deduced a trap composed of 57 places in 55 ms of which 1 ms to minimize.
[2024-05-22 11:12:53] [INFO ] Deduced a trap composed of 70 places in 44 ms of which 1 ms to minimize.
[2024-05-22 11:12:53] [INFO ] Deduced a trap composed of 41 places in 42 ms of which 1 ms to minimize.
[2024-05-22 11:12:53] [INFO ] Deduced a trap composed of 77 places in 43 ms of which 1 ms to minimize.
[2024-05-22 11:12:53] [INFO ] Deduced a trap composed of 70 places in 40 ms of which 1 ms to minimize.
[2024-05-22 11:12:53] [INFO ] Deduced a trap composed of 31 places in 46 ms of which 1 ms to minimize.
[2024-05-22 11:12:53] [INFO ] Deduced a trap composed of 77 places in 50 ms of which 1 ms to minimize.
[2024-05-22 11:12:53] [INFO ] Deduced a trap composed of 81 places in 47 ms of which 1 ms to minimize.
[2024-05-22 11:12:53] [INFO ] Deduced a trap composed of 49 places in 42 ms of which 2 ms to minimize.
[2024-05-22 11:12:53] [INFO ] Deduced a trap composed of 80 places in 41 ms of which 1 ms to minimize.
[2024-05-22 11:12:53] [INFO ] Deduced a trap composed of 47 places in 46 ms of which 1 ms to minimize.
[2024-05-22 11:12:53] [INFO ] Deduced a trap composed of 65 places in 44 ms of which 1 ms to minimize.
[2024-05-22 11:12:53] [INFO ] Deduced a trap composed of 78 places in 43 ms of which 1 ms to minimize.
[2024-05-22 11:12:53] [INFO ] Deduced a trap composed of 88 places in 46 ms of which 1 ms to minimize.
[2024-05-22 11:12:54] [INFO ] Deduced a trap composed of 55 places in 29 ms of which 0 ms to minimize.
[2024-05-22 11:12:54] [INFO ] Deduced a trap composed of 79 places in 45 ms of which 1 ms to minimize.
[2024-05-22 11:12:54] [INFO ] Deduced a trap composed of 74 places in 40 ms of which 1 ms to minimize.
[2024-05-22 11:12:54] [INFO ] Deduced a trap composed of 89 places in 40 ms of which 1 ms to minimize.
[2024-05-22 11:12:54] [INFO ] Deduced a trap composed of 77 places in 41 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/213 variables, 20/51 constraints. Problems are: Problem set: 25 solved, 36 unsolved
[2024-05-22 11:12:54] [INFO ] Deduced a trap composed of 89 places in 43 ms of which 1 ms to minimize.
[2024-05-22 11:12:54] [INFO ] Deduced a trap composed of 68 places in 41 ms of which 1 ms to minimize.
[2024-05-22 11:12:54] [INFO ] Deduced a trap composed of 68 places in 52 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/213 variables, 3/54 constraints. Problems are: Problem set: 25 solved, 36 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/213 variables, 0/54 constraints. Problems are: Problem set: 25 solved, 36 unsolved
At refinement iteration 12 (OVERLAPS) 198/411 variables, 213/267 constraints. Problems are: Problem set: 25 solved, 36 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/411 variables, 36/303 constraints. Problems are: Problem set: 25 solved, 36 unsolved
[2024-05-22 11:12:56] [INFO ] Deduced a trap composed of 49 places in 43 ms of which 1 ms to minimize.
[2024-05-22 11:12:56] [INFO ] Deduced a trap composed of 83 places in 61 ms of which 1 ms to minimize.
[2024-05-22 11:12:56] [INFO ] Deduced a trap composed of 16 places in 59 ms of which 1 ms to minimize.
[2024-05-22 11:12:56] [INFO ] Deduced a trap composed of 78 places in 62 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/411 variables, 4/307 constraints. Problems are: Problem set: 25 solved, 36 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 411/411 variables, and 307 constraints, problems are : Problem set: 25 solved, 36 unsolved in 5012 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 213/213 constraints, PredecessorRefiner: 36/61 constraints, Known Traps: 36/36 constraints]
After SMT, in 7674ms problems are : Problem set: 25 solved, 36 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 46 out of 213 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 213/213 places, 198/198 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 213 transition count 182
Reduce places removed 16 places and 0 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 1 with 24 rules applied. Total rules applied 40 place count 197 transition count 174
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 48 place count 189 transition count 174
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 48 place count 189 transition count 166
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 64 place count 181 transition count 166
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 3 with 42 rules applied. Total rules applied 106 place count 160 transition count 145
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 112 place count 157 transition count 145
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 113 place count 157 transition count 144
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 114 place count 156 transition count 144
Free-agglomeration rule (complex) applied 12 times.
Iterating global reduction 4 with 12 rules applied. Total rules applied 126 place count 156 transition count 132
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 4 with 12 rules applied. Total rules applied 138 place count 144 transition count 132
Partial Free-agglomeration rule applied 11 times.
Drop transitions (Partial Free agglomeration) removed 11 transitions
Iterating global reduction 5 with 11 rules applied. Total rules applied 149 place count 144 transition count 132
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 150 place count 143 transition count 131
Applied a total of 150 rules in 66 ms. Remains 143 /213 variables (removed 70) and now considering 131/198 (removed 67) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66 ms. Remains : 143/213 places, 131/198 transitions.
RANDOM walk for 40000 steps (3553 resets) in 681 ms. (58 steps per ms) remains 35/36 properties
BEST_FIRST walk for 4001 steps (256 resets) in 19 ms. (200 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4000 steps (257 resets) in 17 ms. (222 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4000 steps (273 resets) in 23 ms. (166 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4001 steps (263 resets) in 43 ms. (90 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4000 steps (254 resets) in 42 ms. (93 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4000 steps (261 resets) in 59 ms. (66 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4001 steps (261 resets) in 19 ms. (200 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4001 steps (240 resets) in 41 ms. (95 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4001 steps (267 resets) in 28 ms. (137 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4000 steps (266 resets) in 35 ms. (111 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4001 steps (259 resets) in 50 ms. (78 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4000 steps (269 resets) in 23 ms. (166 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4000 steps (254 resets) in 23 ms. (166 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4002 steps (268 resets) in 33 ms. (117 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4002 steps (260 resets) in 32 ms. (121 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4001 steps (259 resets) in 21 ms. (181 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4001 steps (255 resets) in 26 ms. (148 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4002 steps (245 resets) in 25 ms. (153 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4000 steps (274 resets) in 32 ms. (121 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4002 steps (250 resets) in 22 ms. (174 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4001 steps (272 resets) in 25 ms. (153 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4001 steps (257 resets) in 24 ms. (160 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4000 steps (270 resets) in 23 ms. (166 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4000 steps (262 resets) in 22 ms. (173 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4001 steps (250 resets) in 23 ms. (166 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4000 steps (271 resets) in 61 ms. (64 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4002 steps (254 resets) in 32 ms. (121 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4000 steps (274 resets) in 36 ms. (108 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4001 steps (269 resets) in 36 ms. (108 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4002 steps (268 resets) in 23 ms. (166 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4002 steps (267 resets) in 26 ms. (148 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4001 steps (249 resets) in 35 ms. (111 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4001 steps (276 resets) in 32 ms. (121 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4001 steps (262 resets) in 34 ms. (114 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4002 steps (270 resets) in 30 ms. (129 steps per ms) remains 35/35 properties
Interrupted probabilistic random walk after 248514 steps, run timeout after 3001 ms. (steps per millisecond=82 ) properties seen :22 out of 35
Probabilistic random walk after 248514 steps, saw 124304 distinct states, run finished after 3008 ms. (steps per millisecond=82 ) properties seen :22
// Phase 1: matrix 131 rows 143 cols
[2024-05-22 11:13:01] [INFO ] Computed 22 invariants in 10 ms
[2024-05-22 11:13:01] [INFO ] State equation strengthened by 4 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 61/77 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/77 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (OVERLAPS) 61/138 variables, 18/19 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-05-22 11:13:01] [INFO ] Deduced a trap composed of 14 places in 56 ms of which 1 ms to minimize.
[2024-05-22 11:13:01] [INFO ] Deduced a trap composed of 17 places in 65 ms of which 1 ms to minimize.
[2024-05-22 11:13:01] [INFO ] Deduced a trap composed of 25 places in 44 ms of which 1 ms to minimize.
[2024-05-22 11:13:01] [INFO ] Deduced a trap composed of 39 places in 54 ms of which 5 ms to minimize.
[2024-05-22 11:13:01] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 1 ms to minimize.
[2024-05-22 11:13:01] [INFO ] Deduced a trap composed of 5 places in 37 ms of which 1 ms to minimize.
[2024-05-22 11:13:01] [INFO ] Deduced a trap composed of 28 places in 26 ms of which 1 ms to minimize.
[2024-05-22 11:13:02] [INFO ] Deduced a trap composed of 31 places in 31 ms of which 4 ms to minimize.
[2024-05-22 11:13:02] [INFO ] Deduced a trap composed of 32 places in 31 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/138 variables, 9/28 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-05-22 11:13:02] [INFO ] Deduced a trap composed of 66 places in 48 ms of which 1 ms to minimize.
[2024-05-22 11:13:02] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/138 variables, 2/30 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/138 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (OVERLAPS) 1/139 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-05-22 11:13:02] [INFO ] Deduced a trap composed of 55 places in 50 ms of which 1 ms to minimize.
[2024-05-22 11:13:02] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 1 ms to minimize.
[2024-05-22 11:13:02] [INFO ] Deduced a trap composed of 54 places in 42 ms of which 1 ms to minimize.
[2024-05-22 11:13:02] [INFO ] Deduced a trap composed of 41 places in 42 ms of which 1 ms to minimize.
[2024-05-22 11:13:02] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/139 variables, 5/36 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/139 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 10 (OVERLAPS) 131/270 variables, 139/175 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/270 variables, 4/179 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/270 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 13 (OVERLAPS) 4/274 variables, 4/183 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/274 variables, 2/185 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/274 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 16 (OVERLAPS) 0/274 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Real declared 274/274 variables, and 185 constraints, problems are : Problem set: 0 solved, 13 unsolved in 1345 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 19/19 constraints, State Equation: 143/143 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 13 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 61/77 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/77 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (OVERLAPS) 61/138 variables, 18/19 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/138 variables, 15/34 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-05-22 11:13:03] [INFO ] Deduced a trap composed of 27 places in 32 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/138 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/138 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (OVERLAPS) 1/139 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/139 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/139 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 10 (OVERLAPS) 131/270 variables, 139/176 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/270 variables, 4/180 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/270 variables, 12/192 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/270 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 14 (OVERLAPS) 4/274 variables, 4/196 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/274 variables, 2/198 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/274 variables, 1/199 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-05-22 11:13:03] [INFO ] Deduced a trap composed of 10 places in 47 ms of which 1 ms to minimize.
[2024-05-22 11:13:03] [INFO ] Deduced a trap composed of 42 places in 43 ms of which 1 ms to minimize.
[2024-05-22 11:13:03] [INFO ] Deduced a trap composed of 59 places in 36 ms of which 0 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/274 variables, 3/202 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/274 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 19 (OVERLAPS) 0/274 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Int declared 274/274 variables, and 202 constraints, problems are : Problem set: 0 solved, 13 unsolved in 1369 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 19/19 constraints, State Equation: 143/143 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 20/20 constraints]
After SMT, in 2733ms problems are : Problem set: 0 solved, 13 unsolved
Fused 13 Parikh solutions to 11 different solutions.
Parikh walk visited 0 properties in 14046 ms.
Support contains 16 out of 143 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 131/131 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 143 transition count 122
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 134 transition count 122
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 18 place count 134 transition count 120
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 22 place count 132 transition count 120
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 46 place count 120 transition count 108
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 52 place count 117 transition count 108
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 53 place count 117 transition count 107
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 54 place count 116 transition count 107
Free-agglomeration rule (complex) applied 7 times.
Iterating global reduction 3 with 7 rules applied. Total rules applied 61 place count 116 transition count 100
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 68 place count 109 transition count 100
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 72 place count 109 transition count 100
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 73 place count 108 transition count 99
Applied a total of 73 rules in 30 ms. Remains 108 /143 variables (removed 35) and now considering 99/131 (removed 32) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 108/143 places, 99/131 transitions.
RANDOM walk for 40000 steps (5466 resets) in 438 ms. (91 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (3538 resets) in 125 ms. (317 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40000 steps (3599 resets) in 176 ms. (225 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (3518 resets) in 156 ms. (254 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (3509 resets) in 168 ms. (236 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (3490 resets) in 142 ms. (279 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40001 steps (3545 resets) in 123 ms. (322 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40001 steps (3559 resets) in 88 ms. (449 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (3535 resets) in 84 ms. (470 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40001 steps (3588 resets) in 88 ms. (449 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (3526 resets) in 86 ms. (459 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (3511 resets) in 92 ms. (430 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (3567 resets) in 87 ms. (454 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40001 steps (3588 resets) in 84 ms. (470 steps per ms) remains 13/13 properties
Interrupted probabilistic random walk after 283422 steps, run timeout after 3001 ms. (steps per millisecond=94 ) properties seen :0 out of 13
Probabilistic random walk after 283422 steps, saw 141767 distinct states, run finished after 3001 ms. (steps per millisecond=94 ) properties seen :0
// Phase 1: matrix 99 rows 108 cols
[2024-05-22 11:13:22] [INFO ] Computed 22 invariants in 6 ms
[2024-05-22 11:13:22] [INFO ] State equation strengthened by 13 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 29/45 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (OVERLAPS) 58/103 variables, 18/19 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (OVERLAPS) 1/104 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/104 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (OVERLAPS) 99/203 variables, 104/124 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/203 variables, 13/137 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/203 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 10 (OVERLAPS) 4/207 variables, 4/141 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/207 variables, 2/143 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/207 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 13 (OVERLAPS) 0/207 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Real declared 207/207 variables, and 143 constraints, problems are : Problem set: 0 solved, 13 unsolved in 347 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 19/19 constraints, State Equation: 108/108 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 13 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 29/45 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (OVERLAPS) 58/103 variables, 18/19 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-05-22 11:13:22] [INFO ] Deduced a trap composed of 8 places in 49 ms of which 1 ms to minimize.
[2024-05-22 11:13:22] [INFO ] Deduced a trap composed of 36 places in 43 ms of which 1 ms to minimize.
[2024-05-22 11:13:22] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 1 ms to minimize.
[2024-05-22 11:13:22] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 0 ms to minimize.
[2024-05-22 11:13:22] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 1 ms to minimize.
[2024-05-22 11:13:22] [INFO ] Deduced a trap composed of 14 places in 24 ms of which 0 ms to minimize.
[2024-05-22 11:13:22] [INFO ] Deduced a trap composed of 18 places in 19 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 7/26 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/103 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (OVERLAPS) 1/104 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/104 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (OVERLAPS) 99/203 variables, 104/131 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/203 variables, 13/144 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/203 variables, 12/156 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-05-22 11:13:23] [INFO ] Deduced a trap composed of 36 places in 45 ms of which 0 ms to minimize.
[2024-05-22 11:13:23] [INFO ] Deduced a trap composed of 26 places in 36 ms of which 2 ms to minimize.
[2024-05-22 11:13:23] [INFO ] Deduced a trap composed of 7 places in 38 ms of which 1 ms to minimize.
[2024-05-22 11:13:23] [INFO ] Deduced a trap composed of 32 places in 35 ms of which 1 ms to minimize.
[2024-05-22 11:13:23] [INFO ] Deduced a trap composed of 44 places in 38 ms of which 1 ms to minimize.
[2024-05-22 11:13:23] [INFO ] Deduced a trap composed of 43 places in 40 ms of which 1 ms to minimize.
[2024-05-22 11:13:23] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/203 variables, 7/163 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-05-22 11:13:23] [INFO ] Deduced a trap composed of 28 places in 44 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/203 variables, 1/164 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-05-22 11:13:23] [INFO ] Deduced a trap composed of 11 places in 35 ms of which 1 ms to minimize.
[2024-05-22 11:13:23] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/203 variables, 2/166 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/203 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 15 (OVERLAPS) 4/207 variables, 4/170 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/207 variables, 2/172 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/207 variables, 1/173 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-05-22 11:13:23] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 1 ms to minimize.
[2024-05-22 11:13:23] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 1 ms to minimize.
[2024-05-22 11:13:24] [INFO ] Deduced a trap composed of 8 places in 33 ms of which 0 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/207 variables, 3/176 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/207 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 20 (OVERLAPS) 0/207 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Int declared 207/207 variables, and 176 constraints, problems are : Problem set: 0 solved, 13 unsolved in 1892 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 19/19 constraints, State Equation: 108/108 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 20/20 constraints]
After SMT, in 2251ms problems are : Problem set: 0 solved, 13 unsolved
Fused 13 Parikh solutions to 11 different solutions.
Parikh walk visited 0 properties in 15115 ms.
Support contains 16 out of 108 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 108/108 places, 99/99 transitions.
Applied a total of 0 rules in 4 ms. Remains 108 /108 variables (removed 0) and now considering 99/99 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 108/108 places, 99/99 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 108/108 places, 99/99 transitions.
Applied a total of 0 rules in 3 ms. Remains 108 /108 variables (removed 0) and now considering 99/99 (removed 0) transitions.
[2024-05-22 11:13:39] [INFO ] Invariant cache hit.
[2024-05-22 11:13:39] [INFO ] Implicit Places using invariants in 81 ms returned [20, 25, 74, 80, 105]
[2024-05-22 11:13:39] [INFO ] Actually due to overlaps returned [80, 74]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 84 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 106/108 places, 99/99 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 106 transition count 98
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 105 transition count 98
Applied a total of 2 rules in 7 ms. Remains 105 /106 variables (removed 1) and now considering 98/99 (removed 1) transitions.
// Phase 1: matrix 98 rows 105 cols
[2024-05-22 11:13:39] [INFO ] Computed 20 invariants in 2 ms
[2024-05-22 11:13:39] [INFO ] Implicit Places using invariants in 76 ms returned [20, 25, 102]
[2024-05-22 11:13:39] [INFO ] Actually due to overlaps returned [102]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 78 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 104/108 places, 98/99 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 104 transition count 98
Applied a total of 1 rules in 6 ms. Remains 104 /104 variables (removed 0) and now considering 98/98 (removed 0) transitions.
// Phase 1: matrix 98 rows 104 cols
[2024-05-22 11:13:39] [INFO ] Computed 19 invariants in 2 ms
[2024-05-22 11:13:39] [INFO ] Implicit Places using invariants in 67 ms returned [20, 25]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 68 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 102/108 places, 98/99 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 102 transition count 97
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 101 transition count 97
Applied a total of 2 rules in 6 ms. Remains 101 /102 variables (removed 1) and now considering 97/98 (removed 1) transitions.
// Phase 1: matrix 97 rows 101 cols
[2024-05-22 11:13:39] [INFO ] Computed 17 invariants in 2 ms
[2024-05-22 11:13:39] [INFO ] Implicit Places using invariants in 56 ms returned []
[2024-05-22 11:13:39] [INFO ] Invariant cache hit.
[2024-05-22 11:13:39] [INFO ] State equation strengthened by 13 read => feed constraints.
[2024-05-22 11:13:40] [INFO ] Implicit Places using invariants and state equation in 233 ms returned []
Implicit Place search using SMT with State Equation took 290 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 4 : 101/108 places, 97/99 transitions.
Finished structural reductions in REACHABILITY mode , in 4 iterations and 542 ms. Remains : 101/108 places, 97/99 transitions.
RANDOM walk for 40000 steps (6192 resets) in 169 ms. (235 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40001 steps (3846 resets) in 85 ms. (465 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (3845 resets) in 80 ms. (493 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40001 steps (3856 resets) in 84 ms. (470 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (3832 resets) in 81 ms. (487 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40001 steps (3853 resets) in 79 ms. (500 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (3813 resets) in 83 ms. (476 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (3850 resets) in 78 ms. (506 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40000 steps (3825 resets) in 84 ms. (470 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40000 steps (3853 resets) in 80 ms. (493 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (3834 resets) in 78 ms. (506 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40000 steps (3848 resets) in 81 ms. (487 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (3832 resets) in 80 ms. (493 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (3800 resets) in 89 ms. (444 steps per ms) remains 13/13 properties
Interrupted probabilistic random walk after 288685 steps, run timeout after 3001 ms. (steps per millisecond=96 ) properties seen :0 out of 13
Probabilistic random walk after 288685 steps, saw 144383 distinct states, run finished after 3001 ms. (steps per millisecond=96 ) properties seen :0
[2024-05-22 11:13:43] [INFO ] Invariant cache hit.
[2024-05-22 11:13:43] [INFO ] State equation strengthened by 13 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 20/36 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/36 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (OVERLAPS) 55/91 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/91 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (OVERLAPS) 6/97 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/97 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (OVERLAPS) 97/194 variables, 97/112 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/194 variables, 13/125 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/194 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 11 (OVERLAPS) 4/198 variables, 4/129 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/198 variables, 2/131 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/198 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 14 (OVERLAPS) 0/198 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Real declared 198/198 variables, and 131 constraints, problems are : Problem set: 0 solved, 13 unsolved in 344 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 101/101 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 13 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 20/36 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/36 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (OVERLAPS) 55/91 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-05-22 11:13:43] [INFO ] Deduced a trap composed of 8 places in 42 ms of which 0 ms to minimize.
[2024-05-22 11:13:43] [INFO ] Deduced a trap composed of 45 places in 34 ms of which 0 ms to minimize.
[2024-05-22 11:13:43] [INFO ] Deduced a trap composed of 47 places in 33 ms of which 1 ms to minimize.
[2024-05-22 11:13:44] [INFO ] Deduced a trap composed of 18 places in 21 ms of which 1 ms to minimize.
[2024-05-22 11:13:44] [INFO ] Deduced a trap composed of 18 places in 23 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/91 variables, 5/18 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-05-22 11:13:44] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/91 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/91 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (OVERLAPS) 6/97 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-05-22 11:13:44] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 1 ms to minimize.
[2024-05-22 11:13:44] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 1 ms to minimize.
[2024-05-22 11:13:44] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/97 variables, 3/24 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/97 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 11 (OVERLAPS) 97/194 variables, 97/121 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/194 variables, 13/134 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/194 variables, 12/146 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-05-22 11:13:44] [INFO ] Deduced a trap composed of 7 places in 36 ms of which 1 ms to minimize.
[2024-05-22 11:13:44] [INFO ] Deduced a trap composed of 39 places in 38 ms of which 1 ms to minimize.
[2024-05-22 11:13:44] [INFO ] Deduced a trap composed of 39 places in 38 ms of which 1 ms to minimize.
[2024-05-22 11:13:44] [INFO ] Deduced a trap composed of 42 places in 38 ms of which 1 ms to minimize.
[2024-05-22 11:13:44] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/194 variables, 5/151 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/194 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 16 (OVERLAPS) 4/198 variables, 4/155 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/198 variables, 2/157 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/198 variables, 1/158 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-05-22 11:13:44] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 1 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/198 variables, 1/159 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/198 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 21 (OVERLAPS) 0/198 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Int declared 198/198 variables, and 159 constraints, problems are : Problem set: 0 solved, 13 unsolved in 1483 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 101/101 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 15/15 constraints]
After SMT, in 1833ms problems are : Problem set: 0 solved, 13 unsolved
Fused 13 Parikh solutions to 11 different solutions.
Parikh walk visited 0 properties in 9806 ms.
Support contains 16 out of 101 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 101/101 places, 97/97 transitions.
Applied a total of 0 rules in 3 ms. Remains 101 /101 variables (removed 0) and now considering 97/97 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 101/101 places, 97/97 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 101/101 places, 97/97 transitions.
Applied a total of 0 rules in 3 ms. Remains 101 /101 variables (removed 0) and now considering 97/97 (removed 0) transitions.
[2024-05-22 11:13:55] [INFO ] Invariant cache hit.
[2024-05-22 11:13:55] [INFO ] Implicit Places using invariants in 56 ms returned []
[2024-05-22 11:13:55] [INFO ] Invariant cache hit.
[2024-05-22 11:13:55] [INFO ] State equation strengthened by 13 read => feed constraints.
[2024-05-22 11:13:55] [INFO ] Implicit Places using invariants and state equation in 217 ms returned []
Implicit Place search using SMT with State Equation took 274 ms to find 0 implicit places.
[2024-05-22 11:13:55] [INFO ] Redundant transitions in 2 ms returned []
Running 96 sub problems to find dead transitions.
[2024-05-22 11:13:55] [INFO ] Invariant cache hit.
[2024-05-22 11:13:55] [INFO ] State equation strengthened by 13 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 3 (OVERLAPS) 2/101 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/101 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-22 11:13:56] [INFO ] Deduced a trap composed of 41 places in 46 ms of which 1 ms to minimize.
[2024-05-22 11:13:56] [INFO ] Deduced a trap composed of 51 places in 37 ms of which 1 ms to minimize.
[2024-05-22 11:13:56] [INFO ] Deduced a trap composed of 51 places in 31 ms of which 0 ms to minimize.
[2024-05-22 11:13:56] [INFO ] Deduced a trap composed of 43 places in 37 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/101 variables, 4/21 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-22 11:13:56] [INFO ] Deduced a trap composed of 42 places in 43 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/101 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-22 11:13:57] [INFO ] Deduced a trap composed of 46 places in 42 ms of which 1 ms to minimize.
[2024-05-22 11:13:57] [INFO ] Deduced a trap composed of 45 places in 31 ms of which 1 ms to minimize.
[2024-05-22 11:13:57] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 1 ms to minimize.
[2024-05-22 11:13:57] [INFO ] Deduced a trap composed of 7 places in 37 ms of which 1 ms to minimize.
[2024-05-22 11:13:57] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/101 variables, 5/27 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/101 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 9 (OVERLAPS) 97/198 variables, 101/128 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/198 variables, 13/141 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-22 11:13:58] [INFO ] Deduced a trap composed of 44 places in 44 ms of which 1 ms to minimize.
[2024-05-22 11:13:58] [INFO ] Deduced a trap composed of 50 places in 39 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/198 variables, 2/143 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-22 11:13:58] [INFO ] Deduced a trap composed of 52 places in 42 ms of which 1 ms to minimize.
[2024-05-22 11:13:58] [INFO ] Deduced a trap composed of 52 places in 34 ms of which 1 ms to minimize.
[2024-05-22 11:13:58] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/198 variables, 3/146 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/198 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-22 11:13:59] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 0 ms to minimize.
[2024-05-22 11:13:59] [INFO ] Deduced a trap composed of 28 places in 25 ms of which 1 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/198 variables, 2/148 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/198 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-22 11:14:00] [INFO ] Deduced a trap composed of 53 places in 41 ms of which 1 ms to minimize.
At refinement iteration 16 (OVERLAPS) 0/198 variables, 1/149 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-22 11:14:01] [INFO ] Deduced a trap composed of 50 places in 38 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/198 variables, 1/150 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/198 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 19 (OVERLAPS) 0/198 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Real declared 198/198 variables, and 150 constraints, problems are : Problem set: 0 solved, 96 unsolved in 7255 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 101/101 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 96 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 3 (OVERLAPS) 2/101 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/101 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/101 variables, 19/36 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-22 11:14:03] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 0 ms to minimize.
[2024-05-22 11:14:03] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 1 ms to minimize.
[2024-05-22 11:14:03] [INFO ] Deduced a trap composed of 32 places in 34 ms of which 1 ms to minimize.
[2024-05-22 11:14:03] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/101 variables, 4/40 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-22 11:14:03] [INFO ] Deduced a trap composed of 37 places in 37 ms of which 1 ms to minimize.
[2024-05-22 11:14:03] [INFO ] Deduced a trap composed of 43 places in 35 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/101 variables, 2/42 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/101 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 9 (OVERLAPS) 97/198 variables, 101/143 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/198 variables, 13/156 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/198 variables, 96/252 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/198 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 13 (OVERLAPS) 0/198 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Int declared 198/198 variables, and 252 constraints, problems are : Problem set: 0 solved, 96 unsolved in 4615 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 101/101 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 25/25 constraints]
After SMT, in 11890ms problems are : Problem set: 0 solved, 96 unsolved
Search for dead transitions found 0 dead transitions in 11892ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12177 ms. Remains : 101/101 places, 97/97 transitions.
Attempting over-approximation, by ignoring read arcs.
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 5 Pre rules applied. Total rules applied 0 place count 101 transition count 92
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 96 transition count 92
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 95 transition count 91
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 95 transition count 91
Free-agglomeration rule applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 95 transition count 89
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 16 place count 93 transition count 89
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 93 transition count 88
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 18 place count 92 transition count 88
Applied a total of 18 rules in 14 ms. Remains 92 /101 variables (removed 9) and now considering 88/97 (removed 9) transitions.
Running SMT prover for 13 properties.
// Phase 1: matrix 88 rows 92 cols
[2024-05-22 11:14:07] [INFO ] Computed 17 invariants in 5 ms
[2024-05-22 11:14:07] [INFO ] After 45ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:13
[2024-05-22 11:14:07] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-22 11:14:07] [INFO ] [Nat]Absence check using 5 positive and 12 generalized place invariants in 2 ms returned sat
[2024-05-22 11:14:07] [INFO ] After 86ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :13
[2024-05-22 11:14:07] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 11:14:07] [INFO ] After 72ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :13
TRAPS : Iteration 0
[2024-05-22 11:14:07] [INFO ] Deduced a trap composed of 8 places in 40 ms of which 1 ms to minimize.
[2024-05-22 11:14:07] [INFO ] Deduced a trap composed of 15 places in 21 ms of which 1 ms to minimize.
[2024-05-22 11:14:07] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 78 ms
[2024-05-22 11:14:07] [INFO ] Deduced a trap composed of 38 places in 39 ms of which 1 ms to minimize.
[2024-05-22 11:14:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 50 ms
[2024-05-22 11:14:07] [INFO ] Deduced a trap composed of 34 places in 48 ms of which 2 ms to minimize.
[2024-05-22 11:14:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 59 ms
TRAPS : Iteration 1
[2024-05-22 11:14:07] [INFO ] Deduced a trap composed of 39 places in 42 ms of which 1 ms to minimize.
[2024-05-22 11:14:07] [INFO ] Deduced a trap composed of 40 places in 34 ms of which 2 ms to minimize.
[2024-05-22 11:14:08] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
[2024-05-22 11:14:08] [INFO ] Deduced a trap composed of 18 places in 23 ms of which 1 ms to minimize.
[2024-05-22 11:14:08] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 166 ms
[2024-05-22 11:14:08] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 1 ms to minimize.
[2024-05-22 11:14:08] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 0 ms to minimize.
[2024-05-22 11:14:08] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 76 ms
TRAPS : Iteration 2
[2024-05-22 11:14:08] [INFO ] Deduced a trap composed of 19 places in 24 ms of which 1 ms to minimize.
[2024-05-22 11:14:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 33 ms
[2024-05-22 11:14:08] [INFO ] Deduced a trap composed of 17 places in 21 ms of which 0 ms to minimize.
[2024-05-22 11:14:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 32 ms
TRAPS : Iteration 3
[2024-05-22 11:14:08] [INFO ] After 992ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :13
[2024-05-22 11:14:08] [INFO ] After 1242ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :13
Over-approximation ignoring read arcs solved 0 properties in 1319 ms.
Successfully simplified 25 atomic propositions for a total of 16 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA DoubleExponent-PT-004-CTLCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-004-CTLCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-22 11:14:08] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-05-22 11:14:08] [INFO ] Flatten gal took : 28 ms
[2024-05-22 11:14:08] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA DoubleExponent-PT-004-CTLCardinality-2023-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-004-CTLCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-22 11:14:08] [INFO ] Flatten gal took : 11 ms
[2024-05-22 11:14:08] [INFO ] Input system was already deterministic with 198 transitions.
Support contains 58 out of 213 places (down from 77) after GAL structural reductions.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 357 edges and 213 vertex of which 210 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.3 ms
Starting structural reductions in LTL mode, iteration 0 : 213/213 places, 198/198 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 212 transition count 198
Applied a total of 1 rules in 4 ms. Remains 212 /213 variables (removed 1) and now considering 198/198 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 212/213 places, 198/198 transitions.
[2024-05-22 11:14:08] [INFO ] Flatten gal took : 9 ms
[2024-05-22 11:14:08] [INFO ] Flatten gal took : 12 ms
[2024-05-22 11:14:08] [INFO ] Input system was already deterministic with 198 transitions.
Starting structural reductions in LTL mode, iteration 0 : 213/213 places, 198/198 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 212 transition count 198
Applied a total of 1 rules in 5 ms. Remains 212 /213 variables (removed 1) and now considering 198/198 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 212/213 places, 198/198 transitions.
[2024-05-22 11:14:08] [INFO ] Flatten gal took : 10 ms
[2024-05-22 11:14:08] [INFO ] Flatten gal took : 11 ms
[2024-05-22 11:14:08] [INFO ] Input system was already deterministic with 198 transitions.
Starting structural reductions in LTL mode, iteration 0 : 213/213 places, 198/198 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 212 transition count 198
Applied a total of 1 rules in 4 ms. Remains 212 /213 variables (removed 1) and now considering 198/198 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 212/213 places, 198/198 transitions.
[2024-05-22 11:14:08] [INFO ] Flatten gal took : 10 ms
[2024-05-22 11:14:08] [INFO ] Flatten gal took : 9 ms
[2024-05-22 11:14:08] [INFO ] Input system was already deterministic with 198 transitions.
Starting structural reductions in LTL mode, iteration 0 : 213/213 places, 198/198 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 212 transition count 198
Applied a total of 1 rules in 4 ms. Remains 212 /213 variables (removed 1) and now considering 198/198 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 212/213 places, 198/198 transitions.
[2024-05-22 11:14:08] [INFO ] Flatten gal took : 9 ms
[2024-05-22 11:14:08] [INFO ] Flatten gal took : 9 ms
[2024-05-22 11:14:08] [INFO ] Input system was already deterministic with 198 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 213/213 places, 198/198 transitions.
Graph (complete) has 357 edges and 213 vertex of which 212 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 0 with 42 rules applied. Total rules applied 43 place count 211 transition count 155
Reduce places removed 42 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 45 rules applied. Total rules applied 88 place count 169 transition count 152
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 91 place count 166 transition count 152
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 91 place count 166 transition count 143
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 109 place count 157 transition count 143
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 3 with 52 rules applied. Total rules applied 161 place count 131 transition count 117
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 162 place count 130 transition count 116
Applied a total of 162 rules in 22 ms. Remains 130 /213 variables (removed 83) and now considering 116/198 (removed 82) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 22 ms. Remains : 130/213 places, 116/198 transitions.
[2024-05-22 11:14:08] [INFO ] Flatten gal took : 5 ms
[2024-05-22 11:14:08] [INFO ] Flatten gal took : 6 ms
[2024-05-22 11:14:08] [INFO ] Input system was already deterministic with 116 transitions.
Starting structural reductions in LTL mode, iteration 0 : 213/213 places, 198/198 transitions.
Applied a total of 0 rules in 3 ms. Remains 213 /213 variables (removed 0) and now considering 198/198 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 213/213 places, 198/198 transitions.
[2024-05-22 11:14:08] [INFO ] Flatten gal took : 9 ms
[2024-05-22 11:14:08] [INFO ] Flatten gal took : 9 ms
[2024-05-22 11:14:08] [INFO ] Input system was already deterministic with 198 transitions.
Starting structural reductions in LTL mode, iteration 0 : 213/213 places, 198/198 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 212 transition count 198
Applied a total of 1 rules in 6 ms. Remains 212 /213 variables (removed 1) and now considering 198/198 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 212/213 places, 198/198 transitions.
[2024-05-22 11:14:08] [INFO ] Flatten gal took : 8 ms
[2024-05-22 11:14:08] [INFO ] Flatten gal took : 8 ms
[2024-05-22 11:14:08] [INFO ] Input system was already deterministic with 198 transitions.
Starting structural reductions in LTL mode, iteration 0 : 213/213 places, 198/198 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 212 transition count 198
Applied a total of 1 rules in 4 ms. Remains 212 /213 variables (removed 1) and now considering 198/198 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 212/213 places, 198/198 transitions.
[2024-05-22 11:14:08] [INFO ] Flatten gal took : 8 ms
[2024-05-22 11:14:09] [INFO ] Flatten gal took : 9 ms
[2024-05-22 11:14:09] [INFO ] Input system was already deterministic with 198 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 213/213 places, 198/198 transitions.
Graph (complete) has 357 edges and 213 vertex of which 212 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 0 with 48 rules applied. Total rules applied 49 place count 211 transition count 149
Reduce places removed 48 places and 0 transitions.
Iterating post reduction 1 with 48 rules applied. Total rules applied 97 place count 163 transition count 149
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 97 place count 163 transition count 141
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 113 place count 155 transition count 141
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 171 place count 126 transition count 112
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 172 place count 126 transition count 112
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 173 place count 125 transition count 111
Applied a total of 173 rules in 23 ms. Remains 125 /213 variables (removed 88) and now considering 111/198 (removed 87) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 23 ms. Remains : 125/213 places, 111/198 transitions.
[2024-05-22 11:14:09] [INFO ] Flatten gal took : 5 ms
[2024-05-22 11:14:09] [INFO ] Flatten gal took : 5 ms
[2024-05-22 11:14:09] [INFO ] Input system was already deterministic with 111 transitions.
RANDOM walk for 40000 steps (4069 resets) in 39 ms. (1000 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (2693 resets) in 31 ms. (1250 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 3893 steps, run visited all 1 properties in 10 ms. (steps per millisecond=389 )
Probabilistic random walk after 3893 steps, saw 1973 distinct states, run finished after 13 ms. (steps per millisecond=299 ) properties seen :1
FORMULA DoubleExponent-PT-004-CTLCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Starting structural reductions in LTL mode, iteration 0 : 213/213 places, 198/198 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 212 transition count 198
Applied a total of 1 rules in 3 ms. Remains 212 /213 variables (removed 1) and now considering 198/198 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 212/213 places, 198/198 transitions.
[2024-05-22 11:14:09] [INFO ] Flatten gal took : 8 ms
[2024-05-22 11:14:09] [INFO ] Flatten gal took : 8 ms
[2024-05-22 11:14:09] [INFO ] Input system was already deterministic with 198 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 213/213 places, 198/198 transitions.
Graph (complete) has 357 edges and 213 vertex of which 212 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 45 transitions
Trivial Post-agglo rules discarded 45 transitions
Performed 45 trivial Post agglomeration. Transition count delta: 45
Iterating post reduction 0 with 45 rules applied. Total rules applied 46 place count 211 transition count 152
Reduce places removed 45 places and 0 transitions.
Iterating post reduction 1 with 45 rules applied. Total rules applied 91 place count 166 transition count 152
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 91 place count 166 transition count 145
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 105 place count 159 transition count 145
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 163 place count 130 transition count 116
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 164 place count 129 transition count 115
Applied a total of 164 rules in 17 ms. Remains 129 /213 variables (removed 84) and now considering 115/198 (removed 83) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 17 ms. Remains : 129/213 places, 115/198 transitions.
[2024-05-22 11:14:09] [INFO ] Flatten gal took : 5 ms
[2024-05-22 11:14:09] [INFO ] Flatten gal took : 6 ms
[2024-05-22 11:14:09] [INFO ] Input system was already deterministic with 115 transitions.
Starting structural reductions in LTL mode, iteration 0 : 213/213 places, 198/198 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 212 transition count 198
Applied a total of 1 rules in 4 ms. Remains 212 /213 variables (removed 1) and now considering 198/198 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 212/213 places, 198/198 transitions.
[2024-05-22 11:14:09] [INFO ] Flatten gal took : 7 ms
[2024-05-22 11:14:09] [INFO ] Flatten gal took : 8 ms
[2024-05-22 11:14:09] [INFO ] Input system was already deterministic with 198 transitions.
[2024-05-22 11:14:09] [INFO ] Flatten gal took : 8 ms
[2024-05-22 11:14:09] [INFO ] Flatten gal took : 8 ms
[2024-05-22 11:14:09] [INFO ] Export to MCC of 11 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 2 ms.
[2024-05-22 11:14:09] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 213 places, 198 transitions and 555 arcs took 2 ms.
Total runtime 142001 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running DoubleExponent-PT-004

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/410/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 213
TRANSITIONS: 198
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.003s, Sys 0.002s]


SAVING FILE /home/mcc/execution/410/model (.net / .def) ...
EXPORT TIME: [User 0.000s, Sys 0.000s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 1346
MODEL NAME: /home/mcc/execution/410/model
213 places, 198 transitions.
Enabling coverability test.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Building monolithic NSF...
Building monolithic NSF...
Building monolithic NSF...
Building monolithic NSF...
Start RS construction.
Start RS construction.
Start RS construction.
Start RS construction.
Convergence in 55 steps.
Creating all event NSFs..
Convergence in 55 steps.
Creating all event NSFs..
Convergence in 55 steps.
Creating all event NSFs..
Building monolithic NSF...
Building monolithic NSF...
Building monolithic NSF...
Start RS construction.
Start RS construction.
Convergence in 55 steps.
Creating all event NSFs..
Start RS construction.
Building monolithic NSF...
Start RS construction.
Convergence in 130 steps.
Creating all event NSFs..
Convergence in 130 steps.
Creating all event NSFs..
Convergence in 130 steps.
Creating all event NSFs..
Building monolithic NSF...
Building monolithic NSF...
Building monolithic NSF...
Start RS construction.
Start RS construction.
Start RS construction.
Convergence in 130 steps.
Creating all event NSFs..
Building monolithic NSF...
Start RS construction.
Convergence in 246 steps.
Creating all event NSFs..
Building monolithic NSF...
Convergence in 246 steps.
Creating all event NSFs..
Start RS construction.
Convergence in 246 steps.
Creating all event NSFs..
Building monolithic NSF...
Building monolithic NSF...
Start RS construction.
Convergence in 246 steps.
Creating all event NSFs..
Start RS construction.
Building monolithic NSF...
Start RS construction.
Convergence in 682 steps.
Creating all event NSFs..
Building monolithic NSF...
Start RS construction.
Convergence in 682 steps.
Creating all event NSFs..
Building monolithic NSF...
Start RS construction.
Convergence in 682 steps.
Creating all event NSFs..
Convergence in 682 steps.
Creating all event NSFs..
Building monolithic NSF...
Building monolithic NSF...
Start RS construction.
Start RS construction.
Convergence in 1149 steps.
Creating all event NSFs..
Building monolithic NSF...
Start RS construction.
Convergence in 1149 steps.
Creating all event NSFs..
Building monolithic NSF...
Start RS construction.
Convergence in 1149 steps.
Creating all event NSFs..
Building monolithic NSF...
Start RS construction.
Convergence in 1149 steps.
Creating all event NSFs..
Building monolithic NSF...
Start RS construction.
Convergence in 2257 steps.
Creating all event NSFs..
Building monolithic NSF...
Start RS construction.
Convergence in 2257 steps.
Creating all event NSFs..
Building monolithic NSF...
Start RS construction.
Convergence in 2257 steps.
Convergence in 2257 steps.
Creating all event NSFs..
Building monolithic NSF...
Start RS construction.
CANNOT_COMPUTE
EXITCODE: 87
----------------------------------------------------------------------

BK_STOP 1716376619661

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLCardinality -timeout 360 -rebuildPNML
ERROR: std::bad_alloc

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

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="DoubleExponent-PT-004"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="greatspnxred"
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-5568"
echo " Executing tool greatspnxred"
echo " Input is DoubleExponent-PT-004, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r135-tall-171631131300545"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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