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.r488-tall-171631132900545.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 ltsminxred
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 r488-tall-171631132900545
=====================================================================

--------------------
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 1717193783195

Invoking MCC driver with
BK_TOOL=ltsminxred
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 ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 22:16:24] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-31 22:16:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 22:16:24] [INFO ] Load time of PNML (sax parser for PT used): 62 ms
[2024-05-31 22:16:24] [INFO ] Transformed 216 places.
[2024-05-31 22:16:24] [INFO ] Transformed 198 transitions.
[2024-05-31 22:16:24] [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 15 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-31 22:16:24] [INFO ] Computed 22 invariants in 28 ms
[2024-05-31 22:16:24] [INFO ] Implicit Places using invariants in 262 ms returned []
[2024-05-31 22:16:24] [INFO ] Invariant cache hit.
[2024-05-31 22:16:25] [INFO ] Implicit Places using invariants and state equation in 199 ms returned []
Implicit Place search using SMT with State Equation took 488 ms to find 0 implicit places.
Running 197 sub problems to find dead transitions.
[2024-05-31 22:16:25] [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-31 22:16:27] [INFO ] Deduced a trap composed of 86 places in 94 ms of which 20 ms to minimize.
[2024-05-31 22:16:27] [INFO ] Deduced a trap composed of 95 places in 84 ms of which 1 ms to minimize.
[2024-05-31 22:16:27] [INFO ] Deduced a trap composed of 41 places in 71 ms of which 2 ms to minimize.
[2024-05-31 22:16:27] [INFO ] Deduced a trap composed of 88 places in 61 ms of which 2 ms to minimize.
[2024-05-31 22:16:27] [INFO ] Deduced a trap composed of 57 places in 46 ms of which 1 ms to minimize.
[2024-05-31 22:16:27] [INFO ] Deduced a trap composed of 111 places in 61 ms of which 2 ms to minimize.
[2024-05-31 22:16:28] [INFO ] Deduced a trap composed of 54 places in 47 ms of which 1 ms to minimize.
[2024-05-31 22:16:28] [INFO ] Deduced a trap composed of 52 places in 35 ms of which 1 ms to minimize.
[2024-05-31 22:16:28] [INFO ] Deduced a trap composed of 55 places in 63 ms of which 2 ms to minimize.
[2024-05-31 22:16:28] [INFO ] Deduced a trap composed of 93 places in 55 ms of which 1 ms to minimize.
[2024-05-31 22:16:28] [INFO ] Deduced a trap composed of 94 places in 57 ms of which 2 ms to minimize.
[2024-05-31 22:16:28] [INFO ] Deduced a trap composed of 52 places in 30 ms of which 1 ms to minimize.
[2024-05-31 22:16:28] [INFO ] Deduced a trap composed of 49 places in 30 ms of which 1 ms to minimize.
[2024-05-31 22:16:28] [INFO ] Deduced a trap composed of 112 places in 55 ms of which 1 ms to minimize.
[2024-05-31 22:16:28] [INFO ] Deduced a trap composed of 55 places in 55 ms of which 2 ms to minimize.
[2024-05-31 22:16:28] [INFO ] Deduced a trap composed of 16 places in 64 ms of which 1 ms to minimize.
[2024-05-31 22:16:28] [INFO ] Deduced a trap composed of 103 places in 67 ms of which 1 ms to minimize.
[2024-05-31 22:16:28] [INFO ] Deduced a trap composed of 18 places in 69 ms of which 1 ms to minimize.
[2024-05-31 22:16:29] [INFO ] Deduced a trap composed of 89 places in 60 ms of which 1 ms to minimize.
[2024-05-31 22:16:29] [INFO ] Deduced a trap composed of 50 places in 67 ms of which 1 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-31 22:16:30] [INFO ] Deduced a trap composed of 109 places in 64 ms of which 1 ms to minimize.
[2024-05-31 22:16:30] [INFO ] Deduced a trap composed of 112 places in 59 ms of which 2 ms to minimize.
[2024-05-31 22:16:30] [INFO ] Deduced a trap composed of 118 places in 60 ms of which 2 ms to minimize.
[2024-05-31 22:16:31] [INFO ] Deduced a trap composed of 25 places in 64 ms of which 2 ms to minimize.
[2024-05-31 22:16:31] [INFO ] Deduced a trap composed of 109 places in 65 ms of which 2 ms to minimize.
[2024-05-31 22:16:31] [INFO ] Deduced a trap composed of 70 places in 47 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-31 22:16:34] [INFO ] Deduced a trap composed of 29 places in 50 ms of which 1 ms to minimize.
[2024-05-31 22:16:34] [INFO ] Deduced a trap composed of 69 places in 67 ms of which 2 ms to minimize.
[2024-05-31 22:16:35] [INFO ] Deduced a trap composed of 91 places in 58 ms of which 2 ms to minimize.
[2024-05-31 22:16:35] [INFO ] Deduced a trap composed of 90 places in 62 ms of which 2 ms to minimize.
[2024-05-31 22:16:35] [INFO ] Deduced a trap composed of 102 places in 54 ms of which 1 ms to minimize.
[2024-05-31 22:16:35] [INFO ] Deduced a trap composed of 97 places in 59 ms of which 1 ms to minimize.
[2024-05-31 22:16:35] [INFO ] Deduced a trap composed of 88 places in 59 ms of which 1 ms to minimize.
[2024-05-31 22:16:35] [INFO ] Deduced a trap composed of 102 places in 58 ms of which 1 ms to minimize.
[2024-05-31 22:16:35] [INFO ] Deduced a trap composed of 104 places in 58 ms of which 2 ms to minimize.
[2024-05-31 22:16:36] [INFO ] Deduced a trap composed of 105 places in 59 ms of which 1 ms to minimize.
[2024-05-31 22:16:36] [INFO ] Deduced a trap composed of 88 places in 51 ms of which 1 ms to minimize.
[2024-05-31 22:16:36] [INFO ] Deduced a trap composed of 82 places in 51 ms of which 1 ms to minimize.
[2024-05-31 22:16:36] [INFO ] Deduced a trap composed of 101 places in 54 ms of which 2 ms to minimize.
[2024-05-31 22:16:36] [INFO ] Deduced a trap composed of 106 places in 62 ms of which 1 ms to minimize.
[2024-05-31 22:16:36] [INFO ] Deduced a trap composed of 96 places in 63 ms of which 2 ms to minimize.
[2024-05-31 22:16:36] [INFO ] Deduced a trap composed of 111 places in 59 ms of which 1 ms to minimize.
[2024-05-31 22:16:36] [INFO ] Deduced a trap composed of 124 places in 60 ms of which 2 ms to minimize.
[2024-05-31 22:16:36] [INFO ] Deduced a trap composed of 104 places in 61 ms of which 2 ms to minimize.
[2024-05-31 22:16:36] [INFO ] Deduced a trap composed of 119 places in 56 ms of which 2 ms to minimize.
[2024-05-31 22:16:36] [INFO ] Deduced a trap composed of 105 places in 55 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-31 22:16:37] [INFO ] Deduced a trap composed of 43 places in 64 ms of which 1 ms to minimize.
[2024-05-31 22:16:37] [INFO ] Deduced a trap composed of 68 places in 69 ms of which 1 ms to minimize.
[2024-05-31 22:16:37] [INFO ] Deduced a trap composed of 97 places in 63 ms of which 1 ms to minimize.
[2024-05-31 22:16:38] [INFO ] Deduced a trap composed of 108 places in 69 ms of which 2 ms to minimize.
[2024-05-31 22:16:38] [INFO ] Deduced a trap composed of 103 places in 68 ms of which 3 ms to minimize.
[2024-05-31 22:16:38] [INFO ] Deduced a trap composed of 100 places in 58 ms of which 1 ms to minimize.
[2024-05-31 22:16:38] [INFO ] Deduced a trap composed of 112 places in 55 ms of which 2 ms to minimize.
[2024-05-31 22:16:38] [INFO ] Deduced a trap composed of 113 places in 55 ms of which 2 ms to minimize.
[2024-05-31 22:16:38] [INFO ] Deduced a trap composed of 113 places in 54 ms of which 1 ms to minimize.
[2024-05-31 22:16:38] [INFO ] Deduced a trap composed of 115 places in 56 ms of which 2 ms to minimize.
[2024-05-31 22:16:38] [INFO ] Deduced a trap composed of 62 places in 56 ms of which 4 ms to minimize.
[2024-05-31 22:16:38] [INFO ] Deduced a trap composed of 48 places in 66 ms of which 2 ms to minimize.
[2024-05-31 22:16:38] [INFO ] Deduced a trap composed of 112 places in 65 ms of which 1 ms to minimize.
[2024-05-31 22:16:38] [INFO ] Deduced a trap composed of 113 places in 61 ms of which 2 ms to minimize.
[2024-05-31 22:16:39] [INFO ] Deduced a trap composed of 112 places in 57 ms of which 2 ms to minimize.
[2024-05-31 22:16:39] [INFO ] Deduced a trap composed of 122 places in 64 ms of which 1 ms to minimize.
[2024-05-31 22:16:39] [INFO ] Deduced a trap composed of 111 places in 55 ms of which 1 ms to minimize.
[2024-05-31 22:16:39] [INFO ] Deduced a trap composed of 115 places in 59 ms of which 2 ms to minimize.
[2024-05-31 22:16:39] [INFO ] Deduced a trap composed of 96 places in 61 ms of which 1 ms to minimize.
[2024-05-31 22:16:39] [INFO ] Deduced a trap composed of 79 places in 54 ms of which 2 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-31 22:16:41] [INFO ] Deduced a trap composed of 121 places in 68 ms of which 1 ms to minimize.
[2024-05-31 22:16:41] [INFO ] Deduced a trap composed of 110 places in 60 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-31 22:16:43] [INFO ] Deduced a trap composed of 88 places in 64 ms of which 2 ms to minimize.
[2024-05-31 22:16:43] [INFO ] Deduced a trap composed of 108 places in 64 ms of which 2 ms to minimize.
[2024-05-31 22:16:44] [INFO ] Deduced a trap composed of 86 places in 64 ms of which 1 ms to minimize.
[2024-05-31 22:16:44] [INFO ] Deduced a trap composed of 111 places in 63 ms of which 1 ms to minimize.
[2024-05-31 22:16:44] [INFO ] Deduced a trap composed of 135 places in 55 ms of which 1 ms to minimize.
[2024-05-31 22:16:44] [INFO ] Deduced a trap composed of 140 places in 56 ms of which 2 ms to minimize.
[2024-05-31 22:16:44] [INFO ] Deduced a trap composed of 133 places in 57 ms of which 1 ms to minimize.
[2024-05-31 22:16:44] [INFO ] Deduced a trap composed of 115 places in 64 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-31 22:16:45] [INFO ] Deduced a trap composed of 88 places in 62 ms of which 2 ms to minimize.
[2024-05-31 22:16:46] [INFO ] Deduced a trap composed of 115 places in 73 ms of which 2 ms to minimize.
[2024-05-31 22:16:46] [INFO ] Deduced a trap composed of 123 places in 68 ms of which 2 ms to minimize.
[2024-05-31 22:16:47] [INFO ] Deduced a trap composed of 116 places in 61 ms of which 2 ms to minimize.
[2024-05-31 22:16:47] [INFO ] Deduced a trap composed of 122 places in 74 ms of which 2 ms to minimize.
[2024-05-31 22:16:47] [INFO ] Deduced a trap composed of 123 places in 57 ms of which 2 ms to minimize.
[2024-05-31 22:16:47] [INFO ] Deduced a trap composed of 126 places in 55 ms of which 1 ms to minimize.
[2024-05-31 22:16:47] [INFO ] Deduced a trap composed of 127 places in 54 ms of which 1 ms to minimize.
[2024-05-31 22:16:47] [INFO ] Deduced a trap composed of 117 places in 61 ms of which 2 ms to minimize.
[2024-05-31 22:16:47] [INFO ] Deduced a trap composed of 120 places in 63 ms of which 1 ms to minimize.
[2024-05-31 22:16:47] [INFO ] Deduced a trap composed of 119 places in 53 ms of which 1 ms to minimize.
[2024-05-31 22:16:47] [INFO ] Deduced a trap composed of 129 places in 56 ms of which 2 ms to minimize.
[2024-05-31 22:16:47] [INFO ] Deduced a trap composed of 105 places in 54 ms of which 1 ms to minimize.
[2024-05-31 22:16:47] [INFO ] Deduced a trap composed of 115 places in 54 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-31 22:16:52] [INFO ] Deduced a trap composed of 105 places in 71 ms of which 2 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 30026 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-31 22:16:57] [INFO ] Deduced a trap composed of 114 places in 61 ms of which 1 ms to minimize.
[2024-05-31 22:16:57] [INFO ] Deduced a trap composed of 115 places in 51 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-31 22:17:11] [INFO ] Deduced a trap composed of 132 places in 66 ms of which 1 ms to minimize.
[2024-05-31 22:17:11] [INFO ] Deduced a trap composed of 132 places in 64 ms of which 6 ms to minimize.
[2024-05-31 22:17:11] [INFO ] Deduced a trap composed of 141 places in 53 ms of which 2 ms to minimize.
[2024-05-31 22:17:11] [INFO ] Deduced a trap composed of 132 places in 61 ms of which 1 ms to minimize.
[2024-05-31 22:17:11] [INFO ] Deduced a trap composed of 124 places in 60 ms of which 2 ms to minimize.
[2024-05-31 22:17:11] [INFO ] Deduced a trap composed of 141 places in 62 ms of which 1 ms to minimize.
[2024-05-31 22:17:11] [INFO ] Deduced a trap composed of 138 places in 57 ms of which 1 ms to minimize.
[2024-05-31 22:17:11] [INFO ] Deduced a trap composed of 141 places in 62 ms of which 1 ms to minimize.
[2024-05-31 22:17:11] [INFO ] Deduced a trap composed of 133 places in 57 ms of which 1 ms to minimize.
[2024-05-31 22:17:11] [INFO ] Deduced a trap composed of 141 places in 56 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-31 22:17:21] [INFO ] Deduced a trap composed of 38 places in 57 ms of which 1 ms to minimize.
[2024-05-31 22:17:23] [INFO ] Deduced a trap composed of 82 places in 62 ms of which 1 ms to minimize.
[2024-05-31 22:17:23] [INFO ] Deduced a trap composed of 106 places in 58 ms of which 1 ms to minimize.
[2024-05-31 22:17:23] [INFO ] Deduced a trap composed of 40 places in 55 ms of which 2 ms to minimize.
[2024-05-31 22:17:23] [INFO ] Deduced a trap composed of 80 places in 54 ms of which 2 ms to minimize.
[2024-05-31 22:17:24] [INFO ] Deduced a trap composed of 90 places in 59 ms of which 2 ms to minimize.
[2024-05-31 22:17:24] [INFO ] Deduced a trap composed of 97 places in 61 ms of which 1 ms to minimize.
[2024-05-31 22:17:24] [INFO ] Deduced a trap composed of 102 places in 55 ms of which 2 ms to minimize.
[2024-05-31 22:17:24] [INFO ] Deduced a trap composed of 89 places in 53 ms of which 1 ms to minimize.
[2024-05-31 22:17:24] [INFO ] Deduced a trap composed of 97 places in 58 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 411/411 variables, and 545 constraints, problems are : Problem set: 0 solved, 197 unsolved in 30021 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: 113/113 constraints]
After SMT, in 60135ms problems are : Problem set: 0 solved, 197 unsolved
Search for dead transitions found 0 dead transitions in 60156ms
Starting structural reductions in LTL mode, iteration 1 : 213/216 places, 198/198 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60688 ms. Remains : 213/216 places, 198/198 transitions.
Support contains 122 out of 213 places after structural reductions.
[2024-05-31 22:17:25] [INFO ] Flatten gal took : 36 ms
[2024-05-31 22:17:25] [INFO ] Flatten gal took : 14 ms
[2024-05-31 22:17:25] [INFO ] Input system was already deterministic with 198 transitions.
RANDOM walk for 40000 steps (1339 resets) in 2017 ms. (19 steps per ms) remains 76/97 properties
BEST_FIRST walk for 4000 steps (111 resets) in 85 ms. (46 steps per ms) remains 76/76 properties
BEST_FIRST walk for 4000 steps (116 resets) in 72 ms. (54 steps per ms) remains 76/76 properties
BEST_FIRST walk for 4001 steps (114 resets) in 43 ms. (90 steps per ms) remains 76/76 properties
BEST_FIRST walk for 4002 steps (116 resets) in 59 ms. (66 steps per ms) remains 76/76 properties
BEST_FIRST walk for 4000 steps (114 resets) in 29 ms. (133 steps per ms) remains 76/76 properties
BEST_FIRST walk for 4001 steps (116 resets) in 52 ms. (75 steps per ms) remains 76/76 properties
BEST_FIRST walk for 4001 steps (112 resets) in 29 ms. (133 steps per ms) remains 76/76 properties
BEST_FIRST walk for 4001 steps (115 resets) in 41 ms. (95 steps per ms) remains 76/76 properties
BEST_FIRST walk for 4000 steps (111 resets) in 34 ms. (114 steps per ms) remains 76/76 properties
BEST_FIRST walk for 4001 steps (112 resets) in 33 ms. (117 steps per ms) remains 76/76 properties
BEST_FIRST walk for 4001 steps (109 resets) in 28 ms. (137 steps per ms) remains 76/76 properties
BEST_FIRST walk for 4001 steps (112 resets) in 28 ms. (137 steps per ms) remains 76/76 properties
BEST_FIRST walk for 4001 steps (112 resets) in 28 ms. (137 steps per ms) remains 76/76 properties
BEST_FIRST walk for 4000 steps (111 resets) in 29 ms. (133 steps per ms) remains 76/76 properties
BEST_FIRST walk for 4000 steps (116 resets) in 40 ms. (97 steps per ms) remains 76/76 properties
BEST_FIRST walk for 4000 steps (110 resets) in 36 ms. (108 steps per ms) remains 76/76 properties
BEST_FIRST walk for 4000 steps (113 resets) in 37 ms. (105 steps per ms) remains 76/76 properties
BEST_FIRST walk for 4001 steps (116 resets) in 43 ms. (90 steps per ms) remains 76/76 properties
BEST_FIRST walk for 4000 steps (118 resets) in 33 ms. (117 steps per ms) remains 76/76 properties
BEST_FIRST walk for 4000 steps (117 resets) in 28 ms. (137 steps per ms) remains 76/76 properties
BEST_FIRST walk for 4001 steps (113 resets) in 37 ms. (105 steps per ms) remains 76/76 properties
BEST_FIRST walk for 4000 steps (141 resets) in 58 ms. (67 steps per ms) remains 76/76 properties
BEST_FIRST walk for 4000 steps (109 resets) in 37 ms. (105 steps per ms) remains 76/76 properties
BEST_FIRST walk for 4000 steps (111 resets) in 42 ms. (93 steps per ms) remains 76/76 properties
BEST_FIRST walk for 4000 steps (111 resets) in 78 ms. (50 steps per ms) remains 76/76 properties
BEST_FIRST walk for 4000 steps (108 resets) in 32 ms. (121 steps per ms) remains 76/76 properties
BEST_FIRST walk for 4001 steps (115 resets) in 37 ms. (105 steps per ms) remains 76/76 properties
BEST_FIRST walk for 4001 steps (107 resets) in 38 ms. (102 steps per ms) remains 76/76 properties
BEST_FIRST walk for 4001 steps (112 resets) in 70 ms. (56 steps per ms) remains 76/76 properties
BEST_FIRST walk for 4001 steps (115 resets) in 36 ms. (108 steps per ms) remains 76/76 properties
BEST_FIRST walk for 4001 steps (113 resets) in 37 ms. (105 steps per ms) remains 76/76 properties
BEST_FIRST walk for 4000 steps (104 resets) in 36 ms. (108 steps per ms) remains 76/76 properties
BEST_FIRST walk for 4001 steps (112 resets) in 36 ms. (108 steps per ms) remains 76/76 properties
BEST_FIRST walk for 4001 steps (121 resets) in 51 ms. (76 steps per ms) remains 76/76 properties
BEST_FIRST walk for 4000 steps (115 resets) in 67 ms. (58 steps per ms) remains 76/76 properties
BEST_FIRST walk for 4000 steps (115 resets) in 48 ms. (81 steps per ms) remains 76/76 properties
BEST_FIRST walk for 4002 steps (104 resets) in 63 ms. (62 steps per ms) remains 76/76 properties
BEST_FIRST walk for 4000 steps (115 resets) in 40 ms. (97 steps per ms) remains 76/76 properties
BEST_FIRST walk for 4002 steps (114 resets) in 38 ms. (102 steps per ms) remains 76/76 properties
BEST_FIRST walk for 4001 steps (111 resets) in 38 ms. (102 steps per ms) remains 76/76 properties
BEST_FIRST walk for 4002 steps (115 resets) in 62 ms. (63 steps per ms) remains 76/76 properties
BEST_FIRST walk for 4002 steps (111 resets) in 31 ms. (125 steps per ms) remains 76/76 properties
BEST_FIRST walk for 4000 steps (107 resets) in 26 ms. (148 steps per ms) remains 76/76 properties
BEST_FIRST walk for 4001 steps (117 resets) in 26 ms. (148 steps per ms) remains 76/76 properties
BEST_FIRST walk for 4000 steps (109 resets) in 27 ms. (142 steps per ms) remains 76/76 properties
BEST_FIRST walk for 4002 steps (104 resets) in 35 ms. (111 steps per ms) remains 76/76 properties
BEST_FIRST walk for 4000 steps (113 resets) in 25 ms. (153 steps per ms) remains 76/76 properties
BEST_FIRST walk for 4001 steps (111 resets) in 34 ms. (114 steps per ms) remains 76/76 properties
BEST_FIRST walk for 4001 steps (122 resets) in 28 ms. (137 steps per ms) remains 76/76 properties
BEST_FIRST walk for 4001 steps (114 resets) in 32 ms. (121 steps per ms) remains 76/76 properties
[2024-05-31 22:17:27] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 76 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) 103/200 variables, 5/5 constraints. Problems are: Problem set: 16 solved, 60 unsolved
Problem AtomicPropp80 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/200 variables, 3/8 constraints. Problems are: Problem set: 17 solved, 59 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/200 variables, 0/8 constraints. Problems are: Problem set: 17 solved, 59 unsolved
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp46 is UNSAT
Problem AtomicPropp76 is UNSAT
At refinement iteration 4 (OVERLAPS) 13/213 variables, 14/22 constraints. Problems are: Problem set: 20 solved, 56 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/213 variables, 0/22 constraints. Problems are: Problem set: 20 solved, 56 unsolved
At refinement iteration 6 (OVERLAPS) 198/411 variables, 213/235 constraints. Problems are: Problem set: 20 solved, 56 unsolved
[2024-05-31 22:17:28] [INFO ] Deduced a trap composed of 29 places in 76 ms of which 2 ms to minimize.
[2024-05-31 22:17:28] [INFO ] Deduced a trap composed of 31 places in 57 ms of which 1 ms to minimize.
[2024-05-31 22:17:28] [INFO ] Deduced a trap composed of 81 places in 53 ms of which 1 ms to minimize.
[2024-05-31 22:17:28] [INFO ] Deduced a trap composed of 35 places in 41 ms of which 1 ms to minimize.
[2024-05-31 22:17:28] [INFO ] Deduced a trap composed of 86 places in 65 ms of which 1 ms to minimize.
[2024-05-31 22:17:28] [INFO ] Deduced a trap composed of 84 places in 57 ms of which 1 ms to minimize.
Problem AtomicPropp26 is UNSAT
[2024-05-31 22:17:28] [INFO ] Deduced a trap composed of 36 places in 74 ms of which 1 ms to minimize.
[2024-05-31 22:17:28] [INFO ] Deduced a trap composed of 43 places in 50 ms of which 1 ms to minimize.
Problem AtomicPropp31 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/411 variables, 8/243 constraints. Problems are: Problem set: 22 solved, 54 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/411 variables, 0/243 constraints. Problems are: Problem set: 22 solved, 54 unsolved
At refinement iteration 9 (OVERLAPS) 0/411 variables, 0/243 constraints. Problems are: Problem set: 22 solved, 54 unsolved
No progress, stopping.
After SMT solving in domain Real declared 411/411 variables, and 243 constraints, problems are : Problem set: 22 solved, 54 unsolved in 2868 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 213/213 constraints, PredecessorRefiner: 76/76 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 22 solved, 54 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 0/0 constraints. Problems are: Problem set: 22 solved, 54 unsolved
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp33 is UNSAT
At refinement iteration 1 (OVERLAPS) 126/197 variables, 5/5 constraints. Problems are: Problem set: 24 solved, 52 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/197 variables, 2/7 constraints. Problems are: Problem set: 24 solved, 52 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/197 variables, 4/11 constraints. Problems are: Problem set: 24 solved, 52 unsolved
[2024-05-31 22:17:30] [INFO ] Deduced a trap composed of 37 places in 30 ms of which 0 ms to minimize.
Problem AtomicPropp69 is UNSAT
[2024-05-31 22:17:30] [INFO ] Deduced a trap composed of 123 places in 61 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/197 variables, 2/13 constraints. Problems are: Problem set: 25 solved, 51 unsolved
[2024-05-31 22:17:31] [INFO ] Deduced a trap composed of 140 places in 50 ms of which 1 ms to minimize.
[2024-05-31 22:17:31] [INFO ] Deduced a trap composed of 112 places in 49 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/197 variables, 2/15 constraints. Problems are: Problem set: 25 solved, 51 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/197 variables, 0/15 constraints. Problems are: Problem set: 25 solved, 51 unsolved
At refinement iteration 7 (OVERLAPS) 16/213 variables, 15/30 constraints. Problems are: Problem set: 25 solved, 51 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/213 variables, 4/34 constraints. Problems are: Problem set: 25 solved, 51 unsolved
[2024-05-31 22:17:31] [INFO ] Deduced a trap composed of 90 places in 53 ms of which 1 ms to minimize.
[2024-05-31 22:17:31] [INFO ] Deduced a trap composed of 109 places in 51 ms of which 1 ms to minimize.
[2024-05-31 22:17:31] [INFO ] Deduced a trap composed of 69 places in 70 ms of which 2 ms to minimize.
[2024-05-31 22:17:31] [INFO ] Deduced a trap composed of 68 places in 60 ms of which 2 ms to minimize.
[2024-05-31 22:17:31] [INFO ] Deduced a trap composed of 41 places in 52 ms of which 1 ms to minimize.
[2024-05-31 22:17:31] [INFO ] Deduced a trap composed of 64 places in 49 ms of which 1 ms to minimize.
[2024-05-31 22:17:31] [INFO ] Deduced a trap composed of 69 places in 40 ms of which 1 ms to minimize.
[2024-05-31 22:17:31] [INFO ] Deduced a trap composed of 79 places in 44 ms of which 1 ms to minimize.
[2024-05-31 22:17:32] [INFO ] Deduced a trap composed of 69 places in 59 ms of which 1 ms to minimize.
[2024-05-31 22:17:32] [INFO ] Deduced a trap composed of 90 places in 54 ms of which 2 ms to minimize.
[2024-05-31 22:17:32] [INFO ] Deduced a trap composed of 88 places in 53 ms of which 1 ms to minimize.
[2024-05-31 22:17:32] [INFO ] Deduced a trap composed of 48 places in 45 ms of which 1 ms to minimize.
[2024-05-31 22:17:32] [INFO ] Deduced a trap composed of 79 places in 41 ms of which 1 ms to minimize.
[2024-05-31 22:17:32] [INFO ] Deduced a trap composed of 80 places in 44 ms of which 1 ms to minimize.
[2024-05-31 22:17:32] [INFO ] Deduced a trap composed of 78 places in 54 ms of which 2 ms to minimize.
[2024-05-31 22:17:32] [INFO ] Deduced a trap composed of 97 places in 53 ms of which 1 ms to minimize.
[2024-05-31 22:17:32] [INFO ] Deduced a trap composed of 98 places in 51 ms of which 2 ms to minimize.
[2024-05-31 22:17:32] [INFO ] Deduced a trap composed of 90 places in 43 ms of which 1 ms to minimize.
[2024-05-31 22:17:32] [INFO ] Deduced a trap composed of 86 places in 49 ms of which 1 ms to minimize.
[2024-05-31 22:17:32] [INFO ] Deduced a trap composed of 57 places in 40 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/213 variables, 20/54 constraints. Problems are: Problem set: 25 solved, 51 unsolved
[2024-05-31 22:17:32] [INFO ] Deduced a trap composed of 68 places in 39 ms of which 1 ms to minimize.
[2024-05-31 22:17:32] [INFO ] Deduced a trap composed of 93 places in 58 ms of which 1 ms to minimize.
[2024-05-31 22:17:32] [INFO ] Deduced a trap composed of 58 places in 53 ms of which 1 ms to minimize.
[2024-05-31 22:17:33] [INFO ] Deduced a trap composed of 86 places in 57 ms of which 1 ms to minimize.
[2024-05-31 22:17:33] [INFO ] Deduced a trap composed of 84 places in 50 ms of which 1 ms to minimize.
[2024-05-31 22:17:33] [INFO ] Deduced a trap composed of 92 places in 51 ms of which 1 ms to minimize.
[2024-05-31 22:17:33] [INFO ] Deduced a trap composed of 96 places in 58 ms of which 1 ms to minimize.
[2024-05-31 22:17:33] [INFO ] Deduced a trap composed of 119 places in 53 ms of which 1 ms to minimize.
[2024-05-31 22:17:33] [INFO ] Deduced a trap composed of 69 places in 42 ms of which 1 ms to minimize.
[2024-05-31 22:17:33] [INFO ] Deduced a trap composed of 68 places in 50 ms of which 1 ms to minimize.
[2024-05-31 22:17:33] [INFO ] Deduced a trap composed of 88 places in 60 ms of which 1 ms to minimize.
[2024-05-31 22:17:33] [INFO ] Deduced a trap composed of 97 places in 52 ms of which 1 ms to minimize.
[2024-05-31 22:17:33] [INFO ] Deduced a trap composed of 108 places in 53 ms of which 1 ms to minimize.
[2024-05-31 22:17:33] [INFO ] Deduced a trap composed of 103 places in 51 ms of which 1 ms to minimize.
[2024-05-31 22:17:33] [INFO ] Deduced a trap composed of 92 places in 50 ms of which 2 ms to minimize.
[2024-05-31 22:17:33] [INFO ] Deduced a trap composed of 78 places in 49 ms of which 2 ms to minimize.
[2024-05-31 22:17:33] [INFO ] Deduced a trap composed of 77 places in 49 ms of which 1 ms to minimize.
[2024-05-31 22:17:33] [INFO ] Deduced a trap composed of 104 places in 49 ms of which 1 ms to minimize.
[2024-05-31 22:17:33] [INFO ] Deduced a trap composed of 94 places in 50 ms of which 2 ms to minimize.
[2024-05-31 22:17:34] [INFO ] Deduced a trap composed of 89 places in 46 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/213 variables, 20/74 constraints. Problems are: Problem set: 25 solved, 51 unsolved
[2024-05-31 22:17:34] [INFO ] Deduced a trap composed of 78 places in 51 ms of which 1 ms to minimize.
[2024-05-31 22:17:34] [INFO ] Deduced a trap composed of 106 places in 50 ms of which 1 ms to minimize.
[2024-05-31 22:17:34] [INFO ] Deduced a trap composed of 98 places in 49 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/213 variables, 3/77 constraints. Problems are: Problem set: 25 solved, 51 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/213 variables, 0/77 constraints. Problems are: Problem set: 25 solved, 51 unsolved
At refinement iteration 13 (OVERLAPS) 198/411 variables, 213/290 constraints. Problems are: Problem set: 25 solved, 51 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 411/411 variables, and 341 constraints, problems are : Problem set: 25 solved, 51 unsolved in 5008 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 213/213 constraints, PredecessorRefiner: 51/76 constraints, Known Traps: 55/55 constraints]
After SMT, in 7902ms problems are : Problem set: 25 solved, 51 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 64 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 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 213 transition count 186
Reduce places removed 12 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 1 with 19 rules applied. Total rules applied 31 place count 201 transition count 179
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 38 place count 194 transition count 179
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 38 place count 194 transition count 173
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 50 place count 188 transition count 173
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 76 place count 175 transition count 160
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 80 place count 173 transition count 160
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 81 place count 173 transition count 159
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 82 place count 172 transition count 159
Free-agglomeration rule (complex) applied 9 times.
Iterating global reduction 4 with 9 rules applied. Total rules applied 91 place count 172 transition count 150
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 100 place count 163 transition count 150
Partial Free-agglomeration rule applied 10 times.
Drop transitions (Partial Free agglomeration) removed 10 transitions
Iterating global reduction 5 with 10 rules applied. Total rules applied 110 place count 163 transition count 150
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 111 place count 163 transition count 150
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 112 place count 162 transition count 149
Applied a total of 112 rules in 78 ms. Remains 162 /213 variables (removed 51) and now considering 149/198 (removed 49) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 78 ms. Remains : 162/213 places, 149/198 transitions.
RANDOM walk for 40000 steps (3536 resets) in 753 ms. (53 steps per ms) remains 36/51 properties
BEST_FIRST walk for 4003 steps (250 resets) in 26 ms. (148 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4000 steps (250 resets) in 30 ms. (129 steps per ms) remains 35/36 properties
BEST_FIRST walk for 4001 steps (267 resets) in 21 ms. (181 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4002 steps (262 resets) in 35 ms. (111 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4001 steps (263 resets) in 21 ms. (181 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4001 steps (266 resets) in 32 ms. (121 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4000 steps (267 resets) in 30 ms. (129 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4000 steps (259 resets) in 24 ms. (160 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4001 steps (263 resets) in 32 ms. (121 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (260 resets) in 34 ms. (114 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4001 steps (266 resets) in 25 ms. (153 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4001 steps (260 resets) in 24 ms. (160 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4001 steps (264 resets) in 27 ms. (142 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4001 steps (261 resets) in 21 ms. (181 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4001 steps (267 resets) in 31 ms. (125 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4000 steps (259 resets) in 24 ms. (160 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4002 steps (260 resets) in 24 ms. (160 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4000 steps (265 resets) in 30 ms. (129 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4000 steps (245 resets) in 30 ms. (129 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 4002 steps (268 resets) in 18 ms. (210 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4001 steps (259 resets) in 25 ms. (153 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4000 steps (246 resets) in 24 ms. (160 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4000 steps (247 resets) in 32 ms. (121 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4000 steps (274 resets) in 20 ms. (190 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4001 steps (261 resets) in 24 ms. (160 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4001 steps (266 resets) in 21 ms. (181 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4001 steps (261 resets) in 29 ms. (133 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4001 steps (242 resets) in 24 ms. (160 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4001 steps (258 resets) in 25 ms. (153 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4000 steps (254 resets) in 36 ms. (108 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4002 steps (252 resets) in 21 ms. (181 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4001 steps (264 resets) in 20 ms. (190 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4000 steps (250 resets) in 25 ms. (153 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4001 steps (268 resets) in 25 ms. (153 steps per ms) remains 35/35 properties
// Phase 1: matrix 149 rows 162 cols
[2024-05-31 22:17:35] [INFO ] Computed 22 invariants in 3 ms
[2024-05-31 22:17:35] [INFO ] State equation strengthened by 2 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 1 (OVERLAPS) 34/78 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/78 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 4 (OVERLAPS) 79/157 variables, 16/19 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/157 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 6 (OVERLAPS) 2/159 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/159 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 8 (OVERLAPS) 1/160 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/160 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 10 (OVERLAPS) 149/309 variables, 160/181 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/309 variables, 2/183 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/309 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 13 (OVERLAPS) 2/311 variables, 2/185 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/311 variables, 1/186 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/311 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 16 (OVERLAPS) 0/311 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 35 unsolved
No progress, stopping.
After SMT solving in domain Real declared 311/311 variables, and 186 constraints, problems are : Problem set: 0 solved, 35 unsolved in 1283 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 19/19 constraints, State Equation: 162/162 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 35/35 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 35 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 1 (OVERLAPS) 34/78 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/78 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 4 (OVERLAPS) 79/157 variables, 16/19 constraints. Problems are: Problem set: 0 solved, 35 unsolved
[2024-05-31 22:17:37] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 1 ms to minimize.
[2024-05-31 22:17:37] [INFO ] Deduced a trap composed of 75 places in 45 ms of which 1 ms to minimize.
[2024-05-31 22:17:37] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 1 ms to minimize.
[2024-05-31 22:17:37] [INFO ] Deduced a trap composed of 28 places in 42 ms of which 1 ms to minimize.
[2024-05-31 22:17:37] [INFO ] Deduced a trap composed of 25 places in 40 ms of which 1 ms to minimize.
[2024-05-31 22:17:37] [INFO ] Deduced a trap composed of 7 places in 39 ms of which 1 ms to minimize.
[2024-05-31 22:17:37] [INFO ] Deduced a trap composed of 30 places in 37 ms of which 1 ms to minimize.
[2024-05-31 22:17:37] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 0 ms to minimize.
[2024-05-31 22:17:37] [INFO ] Deduced a trap composed of 51 places in 36 ms of which 1 ms to minimize.
[2024-05-31 22:17:37] [INFO ] Deduced a trap composed of 27 places in 43 ms of which 1 ms to minimize.
[2024-05-31 22:17:37] [INFO ] Deduced a trap composed of 32 places in 36 ms of which 1 ms to minimize.
[2024-05-31 22:17:37] [INFO ] Deduced a trap composed of 42 places in 37 ms of which 1 ms to minimize.
[2024-05-31 22:17:37] [INFO ] Deduced a trap composed of 31 places in 33 ms of which 0 ms to minimize.
[2024-05-31 22:17:37] [INFO ] Deduced a trap composed of 54 places in 56 ms of which 2 ms to minimize.
[2024-05-31 22:17:37] [INFO ] Deduced a trap composed of 37 places in 35 ms of which 0 ms to minimize.
[2024-05-31 22:17:37] [INFO ] Deduced a trap composed of 41 places in 41 ms of which 0 ms to minimize.
[2024-05-31 22:17:38] [INFO ] Deduced a trap composed of 48 places in 36 ms of which 1 ms to minimize.
[2024-05-31 22:17:38] [INFO ] Deduced a trap composed of 49 places in 38 ms of which 1 ms to minimize.
[2024-05-31 22:17:38] [INFO ] Deduced a trap composed of 46 places in 34 ms of which 1 ms to minimize.
[2024-05-31 22:17:38] [INFO ] Deduced a trap composed of 57 places in 45 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/157 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 35 unsolved
[2024-05-31 22:17:38] [INFO ] Deduced a trap composed of 33 places in 47 ms of which 1 ms to minimize.
[2024-05-31 22:17:38] [INFO ] Deduced a trap composed of 86 places in 53 ms of which 2 ms to minimize.
[2024-05-31 22:17:38] [INFO ] Deduced a trap composed of 46 places in 50 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/157 variables, 3/42 constraints. Problems are: Problem set: 0 solved, 35 unsolved
[2024-05-31 22:17:38] [INFO ] Deduced a trap composed of 76 places in 44 ms of which 1 ms to minimize.
[2024-05-31 22:17:38] [INFO ] Deduced a trap composed of 50 places in 47 ms of which 1 ms to minimize.
[2024-05-31 22:17:38] [INFO ] Deduced a trap composed of 70 places in 43 ms of which 1 ms to minimize.
[2024-05-31 22:17:38] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 1 ms to minimize.
[2024-05-31 22:17:38] [INFO ] Deduced a trap composed of 55 places in 43 ms of which 1 ms to minimize.
[2024-05-31 22:17:39] [INFO ] Deduced a trap composed of 62 places in 48 ms of which 1 ms to minimize.
[2024-05-31 22:17:39] [INFO ] Deduced a trap composed of 62 places in 47 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/157 variables, 7/49 constraints. Problems are: Problem set: 0 solved, 35 unsolved
[2024-05-31 22:17:39] [INFO ] Deduced a trap composed of 26 places in 45 ms of which 1 ms to minimize.
[2024-05-31 22:17:39] [INFO ] Deduced a trap composed of 60 places in 43 ms of which 1 ms to minimize.
[2024-05-31 22:17:39] [INFO ] Deduced a trap composed of 62 places in 50 ms of which 2 ms to minimize.
[2024-05-31 22:17:39] [INFO ] Deduced a trap composed of 74 places in 44 ms of which 1 ms to minimize.
[2024-05-31 22:17:39] [INFO ] Deduced a trap composed of 75 places in 40 ms of which 1 ms to minimize.
[2024-05-31 22:17:39] [INFO ] Deduced a trap composed of 70 places in 41 ms of which 1 ms to minimize.
[2024-05-31 22:17:39] [INFO ] Deduced a trap composed of 53 places in 42 ms of which 1 ms to minimize.
[2024-05-31 22:17:39] [INFO ] Deduced a trap composed of 61 places in 40 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/157 variables, 8/57 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/157 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 10 (OVERLAPS) 2/159 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/159 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 12 (OVERLAPS) 1/160 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 35 unsolved
[2024-05-31 22:17:40] [INFO ] Deduced a trap composed of 54 places in 41 ms of which 0 ms to minimize.
[2024-05-31 22:17:40] [INFO ] Deduced a trap composed of 47 places in 37 ms of which 1 ms to minimize.
[2024-05-31 22:17:40] [INFO ] Deduced a trap composed of 55 places in 38 ms of which 1 ms to minimize.
[2024-05-31 22:17:40] [INFO ] Deduced a trap composed of 55 places in 36 ms of which 1 ms to minimize.
[2024-05-31 22:17:40] [INFO ] Deduced a trap composed of 55 places in 34 ms of which 1 ms to minimize.
[2024-05-31 22:17:40] [INFO ] Deduced a trap composed of 58 places in 36 ms of which 1 ms to minimize.
[2024-05-31 22:17:40] [INFO ] Deduced a trap composed of 37 places in 39 ms of which 1 ms to minimize.
[2024-05-31 22:17:40] [INFO ] Deduced a trap composed of 80 places in 48 ms of which 1 ms to minimize.
[2024-05-31 22:17:40] [INFO ] Deduced a trap composed of 63 places in 42 ms of which 1 ms to minimize.
[2024-05-31 22:17:40] [INFO ] Deduced a trap composed of 58 places in 45 ms of which 1 ms to minimize.
[2024-05-31 22:17:40] [INFO ] Deduced a trap composed of 65 places in 45 ms of which 1 ms to minimize.
[2024-05-31 22:17:40] [INFO ] Deduced a trap composed of 60 places in 41 ms of which 1 ms to minimize.
[2024-05-31 22:17:40] [INFO ] Deduced a trap composed of 59 places in 46 ms of which 1 ms to minimize.
[2024-05-31 22:17:40] [INFO ] Deduced a trap composed of 70 places in 49 ms of which 1 ms to minimize.
[2024-05-31 22:17:40] [INFO ] Deduced a trap composed of 61 places in 42 ms of which 1 ms to minimize.
[2024-05-31 22:17:40] [INFO ] Deduced a trap composed of 51 places in 39 ms of which 1 ms to minimize.
[2024-05-31 22:17:40] [INFO ] Deduced a trap composed of 72 places in 38 ms of which 1 ms to minimize.
[2024-05-31 22:17:40] [INFO ] Deduced a trap composed of 58 places in 41 ms of which 1 ms to minimize.
[2024-05-31 22:17:40] [INFO ] Deduced a trap composed of 61 places in 41 ms of which 1 ms to minimize.
[2024-05-31 22:17:40] [INFO ] Deduced a trap composed of 53 places in 40 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/160 variables, 20/79 constraints. Problems are: Problem set: 0 solved, 35 unsolved
[2024-05-31 22:17:41] [INFO ] Deduced a trap composed of 73 places in 52 ms of which 1 ms to minimize.
[2024-05-31 22:17:41] [INFO ] Deduced a trap composed of 71 places in 47 ms of which 1 ms to minimize.
[2024-05-31 22:17:41] [INFO ] Deduced a trap composed of 73 places in 48 ms of which 1 ms to minimize.
[2024-05-31 22:17:41] [INFO ] Deduced a trap composed of 74 places in 44 ms of which 1 ms to minimize.
[2024-05-31 22:17:41] [INFO ] Deduced a trap composed of 74 places in 55 ms of which 1 ms to minimize.
[2024-05-31 22:17:41] [INFO ] Deduced a trap composed of 81 places in 48 ms of which 2 ms to minimize.
[2024-05-31 22:17:41] [INFO ] Deduced a trap composed of 85 places in 47 ms of which 1 ms to minimize.
[2024-05-31 22:17:41] [INFO ] Deduced a trap composed of 76 places in 49 ms of which 1 ms to minimize.
[2024-05-31 22:17:41] [INFO ] Deduced a trap composed of 80 places in 49 ms of which 1 ms to minimize.
[2024-05-31 22:17:41] [INFO ] Deduced a trap composed of 32 places in 51 ms of which 1 ms to minimize.
[2024-05-31 22:17:41] [INFO ] Deduced a trap composed of 77 places in 51 ms of which 1 ms to minimize.
[2024-05-31 22:17:41] [INFO ] Deduced a trap composed of 74 places in 46 ms of which 1 ms to minimize.
[2024-05-31 22:17:41] [INFO ] Deduced a trap composed of 56 places in 42 ms of which 1 ms to minimize.
[2024-05-31 22:17:41] [INFO ] Deduced a trap composed of 66 places in 36 ms of which 1 ms to minimize.
[2024-05-31 22:17:41] [INFO ] Deduced a trap composed of 39 places in 31 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/160 variables, 15/94 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/160 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 16 (OVERLAPS) 149/309 variables, 160/254 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/309 variables, 2/256 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/309 variables, 35/291 constraints. Problems are: Problem set: 0 solved, 35 unsolved
[2024-05-31 22:17:42] [INFO ] Deduced a trap composed of 74 places in 57 ms of which 1 ms to minimize.
[2024-05-31 22:17:42] [INFO ] Deduced a trap composed of 65 places in 57 ms of which 1 ms to minimize.
[2024-05-31 22:17:43] [INFO ] Deduced a trap composed of 11 places in 52 ms of which 1 ms to minimize.
[2024-05-31 22:17:43] [INFO ] Deduced a trap composed of 51 places in 56 ms of which 1 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/309 variables, 4/295 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/309 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 21 (OVERLAPS) 2/311 variables, 2/297 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/311 variables, 1/298 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/311 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 35 unsolved
[2024-05-31 22:17:45] [INFO ] Deduced a trap composed of 71 places in 55 ms of which 2 ms to minimize.
[2024-05-31 22:17:45] [INFO ] Deduced a trap composed of 46 places in 55 ms of which 1 ms to minimize.
At refinement iteration 24 (OVERLAPS) 0/311 variables, 2/300 constraints. Problems are: Problem set: 0 solved, 35 unsolved
[2024-05-31 22:17:45] [INFO ] Deduced a trap composed of 84 places in 58 ms of which 1 ms to minimize.
At refinement iteration 25 (INCLUDED_ONLY) 0/311 variables, 1/301 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/311 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 27 (OVERLAPS) 0/311 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 35 unsolved
No progress, stopping.
After SMT solving in domain Int declared 311/311 variables, and 301 constraints, problems are : Problem set: 0 solved, 35 unsolved in 10915 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 19/19 constraints, State Equation: 162/162 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 35/35 constraints, Known Traps: 80/80 constraints]
After SMT, in 12213ms problems are : Problem set: 0 solved, 35 unsolved
Fused 35 Parikh solutions to 30 different solutions.
Parikh walk visited 0 properties in 7349 ms.
Support contains 44 out of 162 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 162/162 places, 149/149 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 162 transition count 146
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 4 rules applied. Total rules applied 7 place count 159 transition count 145
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 8 place count 158 transition count 145
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 8 place count 158 transition count 144
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 10 place count 157 transition count 144
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 24 place count 150 transition count 137
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 26 place count 149 transition count 137
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 28 place count 149 transition count 135
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 30 place count 147 transition count 135
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 4 with 8 rules applied. Total rules applied 38 place count 147 transition count 127
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 46 place count 139 transition count 127
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 47 place count 139 transition count 127
Applied a total of 47 rules in 30 ms. Remains 139 /162 variables (removed 23) and now considering 127/149 (removed 22) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 139/162 places, 127/149 transitions.
RANDOM walk for 40000 steps (4178 resets) in 412 ms. (96 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4001 steps (294 resets) in 26 ms. (148 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4001 steps (280 resets) in 24 ms. (160 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4001 steps (284 resets) in 23 ms. (166 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4001 steps (312 resets) in 30 ms. (129 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4000 steps (298 resets) in 24 ms. (160 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4002 steps (300 resets) in 33 ms. (117 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4000 steps (303 resets) in 22 ms. (173 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4000 steps (281 resets) in 26 ms. (148 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4001 steps (297 resets) in 25 ms. (153 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4000 steps (302 resets) in 22 ms. (173 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4001 steps (296 resets) in 23 ms. (166 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4002 steps (276 resets) in 30 ms. (129 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4000 steps (293 resets) in 27 ms. (142 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4002 steps (294 resets) in 25 ms. (153 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4001 steps (285 resets) in 34 ms. (114 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (299 resets) in 31 ms. (125 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4002 steps (287 resets) in 26 ms. (148 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4002 steps (294 resets) in 22 ms. (174 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (287 resets) in 26 ms. (148 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4000 steps (298 resets) in 19 ms. (200 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (288 resets) in 21 ms. (181 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4001 steps (299 resets) in 33 ms. (117 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4002 steps (295 resets) in 22 ms. (174 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4001 steps (299 resets) in 29 ms. (133 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4002 steps (293 resets) in 17 ms. (222 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4001 steps (296 resets) in 16 ms. (235 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4001 steps (279 resets) in 18 ms. (210 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4001 steps (298 resets) in 21 ms. (181 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4001 steps (290 resets) in 18 ms. (210 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4001 steps (280 resets) in 18 ms. (210 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4001 steps (277 resets) in 17 ms. (222 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4000 steps (293 resets) in 17 ms. (222 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (285 resets) in 15 ms. (250 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4000 steps (297 resets) in 17 ms. (222 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4000 steps (303 resets) in 17 ms. (222 steps per ms) remains 35/35 properties
Interrupted probabilistic random walk after 231291 steps, run timeout after 3001 ms. (steps per millisecond=77 ) properties seen :22 out of 35
Probabilistic random walk after 231291 steps, saw 115693 distinct states, run finished after 3004 ms. (steps per millisecond=76 ) properties seen :22
// Phase 1: matrix 127 rows 139 cols
[2024-05-31 22:17:58] [INFO ] Computed 22 invariants in 3 ms
[2024-05-31 22:17:58] [INFO ] State equation strengthened by 8 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) 69/85 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/85 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (OVERLAPS) 49/134 variables, 13/19 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/134 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (OVERLAPS) 1/135 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/135 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (OVERLAPS) 127/262 variables, 135/155 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/262 variables, 8/163 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/262 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 11 (OVERLAPS) 4/266 variables, 4/167 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/266 variables, 2/169 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/266 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 14 (OVERLAPS) 0/266 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Real declared 266/266 variables, and 169 constraints, problems are : Problem set: 0 solved, 13 unsolved in 394 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 139/139 constraints, ReadFeed: 8/8 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) 69/85 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/85 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (OVERLAPS) 49/134 variables, 13/19 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-05-31 22:17:59] [INFO ] Deduced a trap composed of 7 places in 49 ms of which 1 ms to minimize.
[2024-05-31 22:17:59] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 1 ms to minimize.
[2024-05-31 22:17:59] [INFO ] Deduced a trap composed of 27 places in 45 ms of which 1 ms to minimize.
[2024-05-31 22:17:59] [INFO ] Deduced a trap composed of 5 places in 38 ms of which 1 ms to minimize.
[2024-05-31 22:17:59] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 1 ms to minimize.
[2024-05-31 22:17:59] [INFO ] Deduced a trap composed of 59 places in 39 ms of which 1 ms to minimize.
[2024-05-31 22:17:59] [INFO ] Deduced a trap composed of 26 places in 38 ms of which 1 ms to minimize.
[2024-05-31 22:17:59] [INFO ] Deduced a trap composed of 42 places in 39 ms of which 3 ms to minimize.
[2024-05-31 22:17:59] [INFO ] Deduced a trap composed of 30 places in 25 ms of which 0 ms to minimize.
[2024-05-31 22:17:59] [INFO ] Deduced a trap composed of 31 places in 40 ms of which 1 ms to minimize.
[2024-05-31 22:17:59] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 1 ms to minimize.
[2024-05-31 22:17:59] [INFO ] Deduced a trap composed of 31 places in 25 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/134 variables, 12/31 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/134 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (OVERLAPS) 1/135 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/135 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (OVERLAPS) 127/262 variables, 135/167 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/262 variables, 8/175 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/262 variables, 12/187 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-05-31 22:18:00] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 1 ms to minimize.
[2024-05-31 22:18:00] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 1 ms to minimize.
[2024-05-31 22:18:00] [INFO ] Deduced a trap composed of 37 places in 48 ms of which 1 ms to minimize.
[2024-05-31 22:18:00] [INFO ] Deduced a trap composed of 38 places in 45 ms of which 1 ms to minimize.
[2024-05-31 22:18:00] [INFO ] Deduced a trap composed of 46 places in 38 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/262 variables, 5/192 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-05-31 22:18:00] [INFO ] Deduced a trap composed of 39 places in 48 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/262 variables, 1/193 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/262 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 15 (OVERLAPS) 4/266 variables, 4/197 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/266 variables, 2/199 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/266 variables, 1/200 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-05-31 22:18:00] [INFO ] Deduced a trap composed of 20 places in 53 ms of which 1 ms to minimize.
[2024-05-31 22:18:00] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 1 ms to minimize.
[2024-05-31 22:18:01] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 1 ms to minimize.
[2024-05-31 22:18:01] [INFO ] Deduced a trap composed of 54 places in 40 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/266 variables, 4/204 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-05-31 22:18:01] [INFO ] Deduced a trap composed of 38 places in 40 ms of which 1 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/266 variables, 1/205 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/266 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 21 (OVERLAPS) 0/266 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Int declared 266/266 variables, and 205 constraints, problems are : Problem set: 0 solved, 13 unsolved in 2559 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 139/139 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 23/23 constraints]
After SMT, in 2961ms problems are : Problem set: 0 solved, 13 unsolved
Fused 13 Parikh solutions to 11 different solutions.
Parikh walk visited 0 properties in 20733 ms.
Support contains 16 out of 139 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 139/139 places, 127/127 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 139 transition count 119
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 131 transition count 119
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 16 place count 131 transition count 117
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 20 place count 129 transition count 117
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 42 place count 118 transition count 106
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 46 place count 116 transition count 106
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 47 place count 116 transition count 105
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 48 place count 115 transition count 105
Free-agglomeration rule (complex) applied 7 times.
Iterating global reduction 3 with 7 rules applied. Total rules applied 55 place count 115 transition count 98
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 62 place count 108 transition count 98
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 4 with 5 rules applied. Total rules applied 67 place count 108 transition count 98
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 68 place count 107 transition count 97
Applied a total of 68 rules in 25 ms. Remains 107 /139 variables (removed 32) and now considering 97/127 (removed 30) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 107/139 places, 97/127 transitions.
RANDOM walk for 40000 steps (5489 resets) in 226 ms. (176 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40001 steps (3483 resets) in 160 ms. (248 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40000 steps (3552 resets) in 139 ms. (285 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40001 steps (3532 resets) in 143 ms. (277 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40000 steps (3481 resets) in 211 ms. (188 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (3532 resets) in 166 ms. (239 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (3523 resets) in 104 ms. (380 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40000 steps (3547 resets) in 86 ms. (459 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40001 steps (3559 resets) in 83 ms. (476 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40000 steps (3524 resets) in 81 ms. (487 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40001 steps (3548 resets) in 84 ms. (470 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40000 steps (3535 resets) in 80 ms. (493 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (3541 resets) in 82 ms. (481 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (3530 resets) in 79 ms. (500 steps per ms) remains 13/13 properties
Interrupted probabilistic random walk after 237683 steps, run timeout after 3001 ms. (steps per millisecond=79 ) properties seen :0 out of 13
Probabilistic random walk after 237683 steps, saw 118897 distinct states, run finished after 3001 ms. (steps per millisecond=79 ) properties seen :0
// Phase 1: matrix 97 rows 107 cols
[2024-05-31 22:18:26] [INFO ] Computed 22 invariants in 2 ms
[2024-05-31 22:18:26] [INFO ] State equation strengthened by 14 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, 19/20 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (OVERLAPS) 97/200 variables, 103/123 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/200 variables, 14/137 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/200 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (OVERLAPS) 4/204 variables, 4/141 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/204 variables, 2/143 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/204 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 11 (OVERLAPS) 0/204 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Real declared 204/204 variables, and 143 constraints, problems are : Problem set: 0 solved, 13 unsolved in 324 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 19/19 constraints, State Equation: 107/107 constraints, ReadFeed: 14/14 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, 19/20 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-05-31 22:18:26] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 1 ms to minimize.
[2024-05-31 22:18:26] [INFO ] Deduced a trap composed of 8 places in 41 ms of which 1 ms to minimize.
[2024-05-31 22:18:26] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 1 ms to minimize.
[2024-05-31 22:18:26] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 1 ms to minimize.
[2024-05-31 22:18:26] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 1 ms to minimize.
[2024-05-31 22:18:26] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 1 ms to minimize.
[2024-05-31 22:18:26] [INFO ] Deduced a trap composed of 11 places in 37 ms of which 1 ms to minimize.
[2024-05-31 22:18:26] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
[2024-05-31 22:18:26] [INFO ] Deduced a trap composed of 6 places in 24 ms of which 0 ms to minimize.
[2024-05-31 22:18:26] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 1 ms to minimize.
[2024-05-31 22:18:27] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 1 ms to minimize.
[2024-05-31 22:18:27] [INFO ] Deduced a trap composed of 18 places in 24 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 12/32 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/103 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (OVERLAPS) 97/200 variables, 103/135 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/200 variables, 14/149 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/200 variables, 12/161 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-05-31 22:18:27] [INFO ] Deduced a trap composed of 12 places in 49 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/200 variables, 1/162 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-05-31 22:18:27] [INFO ] Deduced a trap composed of 36 places in 43 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/200 variables, 1/163 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/200 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 12 (OVERLAPS) 4/204 variables, 4/167 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/204 variables, 2/169 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/204 variables, 1/170 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-05-31 22:18:27] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 0 ms to minimize.
[2024-05-31 22:18:27] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/204 variables, 2/172 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/204 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 17 (OVERLAPS) 0/204 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Int declared 204/204 variables, and 172 constraints, problems are : Problem set: 0 solved, 13 unsolved in 1575 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 19/19 constraints, State Equation: 107/107 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 16/16 constraints]
After SMT, in 1906ms problems are : Problem set: 0 solved, 13 unsolved
Fused 13 Parikh solutions to 11 different solutions.
Parikh walk visited 0 properties in 17033 ms.
Support contains 16 out of 107 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 107/107 places, 97/97 transitions.
Applied a total of 0 rules in 7 ms. Remains 107 /107 variables (removed 0) and now considering 97/97 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 107/107 places, 97/97 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 107/107 places, 97/97 transitions.
Applied a total of 0 rules in 3 ms. Remains 107 /107 variables (removed 0) and now considering 97/97 (removed 0) transitions.
[2024-05-31 22:18:45] [INFO ] Invariant cache hit.
[2024-05-31 22:18:45] [INFO ] Implicit Places using invariants in 89 ms returned [20, 25, 74, 80, 104]
[2024-05-31 22:18:45] [INFO ] Actually due to overlaps returned [80, 74]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 91 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 105/107 places, 97/97 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 105 transition count 96
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 104 transition count 96
Applied a total of 2 rules in 6 ms. Remains 104 /105 variables (removed 1) and now considering 96/97 (removed 1) transitions.
// Phase 1: matrix 96 rows 104 cols
[2024-05-31 22:18:45] [INFO ] Computed 20 invariants in 5 ms
[2024-05-31 22:18:45] [INFO ] Implicit Places using invariants in 77 ms returned [20, 25, 101]
[2024-05-31 22:18:45] [INFO ] Actually due to overlaps returned [101]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 79 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 103/107 places, 96/97 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 103 transition count 96
Applied a total of 1 rules in 9 ms. Remains 103 /103 variables (removed 0) and now considering 96/96 (removed 0) transitions.
// Phase 1: matrix 96 rows 103 cols
[2024-05-31 22:18:45] [INFO ] Computed 19 invariants in 3 ms
[2024-05-31 22:18:45] [INFO ] Implicit Places using invariants in 77 ms returned [20, 25]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 78 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 101/107 places, 96/97 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 101 transition count 95
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 100 transition count 95
Applied a total of 2 rules in 6 ms. Remains 100 /101 variables (removed 1) and now considering 95/96 (removed 1) transitions.
// Phase 1: matrix 95 rows 100 cols
[2024-05-31 22:18:45] [INFO ] Computed 17 invariants in 3 ms
[2024-05-31 22:18:45] [INFO ] Implicit Places using invariants in 64 ms returned []
[2024-05-31 22:18:45] [INFO ] Invariant cache hit.
[2024-05-31 22:18:45] [INFO ] State equation strengthened by 14 read => feed constraints.
[2024-05-31 22:18:45] [INFO ] Implicit Places using invariants and state equation in 220 ms returned []
Implicit Place search using SMT with State Equation took 286 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 4 : 100/107 places, 95/97 transitions.
Finished structural reductions in REACHABILITY mode , in 4 iterations and 558 ms. Remains : 100/107 places, 95/97 transitions.
RANDOM walk for 40000 steps (6286 resets) in 167 ms. (238 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40001 steps (3847 resets) in 76 ms. (519 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40000 steps (3821 resets) in 78 ms. (506 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (3836 resets) in 73 ms. (540 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (3815 resets) in 81 ms. (487 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40001 steps (3784 resets) in 77 ms. (512 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (3772 resets) in 77 ms. (512 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (3756 resets) in 75 ms. (526 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40001 steps (3779 resets) in 74 ms. (533 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (3802 resets) in 80 ms. (493 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (3868 resets) in 76 ms. (519 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (3883 resets) in 78 ms. (506 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (3798 resets) in 75 ms. (526 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40001 steps (3800 resets) in 75 ms. (526 steps per ms) remains 13/13 properties
Interrupted probabilistic random walk after 268565 steps, run timeout after 3001 ms. (steps per millisecond=89 ) properties seen :0 out of 13
Probabilistic random walk after 268565 steps, saw 134314 distinct states, run finished after 3001 ms. (steps per millisecond=89 ) properties seen :0
[2024-05-31 22:18:49] [INFO ] Invariant cache hit.
[2024-05-31 22:18:49] [INFO ] State equation strengthened by 14 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) 58/74 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/74 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (OVERLAPS) 22/96 variables, 12/15 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (OVERLAPS) 95/191 variables, 96/111 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 14/125 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/191 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (OVERLAPS) 4/195 variables, 4/129 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/195 variables, 2/131 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/195 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 11 (OVERLAPS) 0/195 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Real declared 195/195 variables, and 131 constraints, problems are : Problem set: 0 solved, 13 unsolved in 286 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 100/100 constraints, ReadFeed: 14/14 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) 58/74 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/74 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (OVERLAPS) 22/96 variables, 12/15 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-05-31 22:18:49] [INFO ] Deduced a trap composed of 8 places in 47 ms of which 1 ms to minimize.
[2024-05-31 22:18:49] [INFO ] Deduced a trap composed of 6 places in 40 ms of which 1 ms to minimize.
[2024-05-31 22:18:49] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 0 ms to minimize.
[2024-05-31 22:18:49] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
[2024-05-31 22:18:49] [INFO ] Deduced a trap composed of 37 places in 34 ms of which 1 ms to minimize.
[2024-05-31 22:18:49] [INFO ] Deduced a trap composed of 8 places in 33 ms of which 1 ms to minimize.
[2024-05-31 22:18:49] [INFO ] Deduced a trap composed of 35 places in 39 ms of which 0 ms to minimize.
[2024-05-31 22:18:49] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 1 ms to minimize.
[2024-05-31 22:18:49] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 1 ms to minimize.
[2024-05-31 22:18:49] [INFO ] Deduced a trap composed of 35 places in 33 ms of which 1 ms to minimize.
[2024-05-31 22:18:49] [INFO ] Deduced a trap composed of 34 places in 33 ms of which 1 ms to minimize.
[2024-05-31 22:18:49] [INFO ] Deduced a trap composed of 38 places in 32 ms of which 0 ms to minimize.
[2024-05-31 22:18:49] [INFO ] Deduced a trap composed of 33 places in 32 ms of which 1 ms to minimize.
[2024-05-31 22:18:49] [INFO ] Deduced a trap composed of 17 places in 22 ms of which 1 ms to minimize.
[2024-05-31 22:18:50] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 0 ms to minimize.
[2024-05-31 22:18:50] [INFO ] Deduced a trap composed of 18 places in 21 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 16/31 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/96 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (OVERLAPS) 95/191 variables, 96/127 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/191 variables, 14/141 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/191 variables, 12/153 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-05-31 22:18:50] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 1 ms to minimize.
[2024-05-31 22:18:50] [INFO ] Deduced a trap composed of 33 places in 39 ms of which 1 ms to minimize.
[2024-05-31 22:18:50] [INFO ] Deduced a trap composed of 33 places in 41 ms of which 1 ms to minimize.
[2024-05-31 22:18:50] [INFO ] Deduced a trap composed of 38 places in 41 ms of which 1 ms to minimize.
[2024-05-31 22:18:50] [INFO ] Deduced a trap composed of 43 places in 33 ms of which 1 ms to minimize.
[2024-05-31 22:18:50] [INFO ] Deduced a trap composed of 41 places in 31 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/191 variables, 6/159 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/191 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 11 (OVERLAPS) 4/195 variables, 4/163 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/195 variables, 2/165 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/195 variables, 1/166 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-05-31 22:18:50] [INFO ] Deduced a trap composed of 8 places in 37 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/195 variables, 1/167 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/195 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 16 (OVERLAPS) 0/195 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Int declared 195/195 variables, and 167 constraints, problems are : Problem set: 0 solved, 13 unsolved in 1745 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 100/100 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 23/23 constraints]
After SMT, in 2035ms problems are : Problem set: 0 solved, 13 unsolved
Fused 13 Parikh solutions to 11 different solutions.
Parikh walk visited 0 properties in 12366 ms.
Support contains 16 out of 100 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 100/100 places, 95/95 transitions.
Applied a total of 0 rules in 3 ms. Remains 100 /100 variables (removed 0) and now considering 95/95 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 100/100 places, 95/95 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 100/100 places, 95/95 transitions.
Applied a total of 0 rules in 3 ms. Remains 100 /100 variables (removed 0) and now considering 95/95 (removed 0) transitions.
[2024-05-31 22:19:03] [INFO ] Invariant cache hit.
[2024-05-31 22:19:03] [INFO ] Implicit Places using invariants in 57 ms returned []
[2024-05-31 22:19:03] [INFO ] Invariant cache hit.
[2024-05-31 22:19:03] [INFO ] State equation strengthened by 14 read => feed constraints.
[2024-05-31 22:19:03] [INFO ] Implicit Places using invariants and state equation in 193 ms returned []
Implicit Place search using SMT with State Equation took 251 ms to find 0 implicit places.
[2024-05-31 22:19:03] [INFO ] Redundant transitions in 2 ms returned []
Running 94 sub problems to find dead transitions.
[2024-05-31 22:19:03] [INFO ] Invariant cache hit.
[2024-05-31 22:19:03] [INFO ] State equation strengthened by 14 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 3 (OVERLAPS) 2/100 variables, 3/17 constraints. Problems are: Problem set: 0 solved, 94 unsolved
[2024-05-31 22:19:04] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 1 ms to minimize.
[2024-05-31 22:19:04] [INFO ] Deduced a trap composed of 46 places in 38 ms of which 0 ms to minimize.
[2024-05-31 22:19:04] [INFO ] Deduced a trap composed of 46 places in 35 ms of which 0 ms to minimize.
[2024-05-31 22:19:04] [INFO ] Deduced a trap composed of 40 places in 35 ms of which 0 ms to minimize.
[2024-05-31 22:19:04] [INFO ] Deduced a trap composed of 44 places in 39 ms of which 1 ms to minimize.
[2024-05-31 22:19:04] [INFO ] Deduced a trap composed of 43 places in 41 ms of which 0 ms to minimize.
[2024-05-31 22:19:04] [INFO ] Deduced a trap composed of 34 places in 42 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 7/24 constraints. Problems are: Problem set: 0 solved, 94 unsolved
[2024-05-31 22:19:04] [INFO ] Deduced a trap composed of 46 places in 42 ms of which 1 ms to minimize.
[2024-05-31 22:19:04] [INFO ] Deduced a trap composed of 49 places in 35 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/100 variables, 2/26 constraints. Problems are: Problem set: 0 solved, 94 unsolved
[2024-05-31 22:19:05] [INFO ] Deduced a trap composed of 45 places in 41 ms of which 1 ms to minimize.
[2024-05-31 22:19:05] [INFO ] Deduced a trap composed of 48 places in 33 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/100 variables, 2/28 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/100 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 8 (OVERLAPS) 95/195 variables, 100/128 constraints. Problems are: Problem set: 0 solved, 94 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/195 variables, 14/142 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/195 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 11 (OVERLAPS) 0/195 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 94 unsolved
No progress, stopping.
After SMT solving in domain Real declared 195/195 variables, and 142 constraints, problems are : Problem set: 0 solved, 94 unsolved in 3114 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 100/100 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 94/94 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 94 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 3 (OVERLAPS) 2/100 variables, 3/17 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 11/28 constraints. Problems are: Problem set: 0 solved, 94 unsolved
[2024-05-31 22:19:07] [INFO ] Deduced a trap composed of 12 places in 43 ms of which 1 ms to minimize.
[2024-05-31 22:19:07] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/100 variables, 2/30 constraints. Problems are: Problem set: 0 solved, 94 unsolved
[2024-05-31 22:19:07] [INFO ] Deduced a trap composed of 41 places in 42 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/100 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 94 unsolved
[2024-05-31 22:19:07] [INFO ] Deduced a trap composed of 40 places in 42 ms of which 0 ms to minimize.
[2024-05-31 22:19:07] [INFO ] Deduced a trap composed of 38 places in 45 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/100 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/100 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 9 (OVERLAPS) 95/195 variables, 100/133 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/195 variables, 14/147 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/195 variables, 94/241 constraints. Problems are: Problem set: 0 solved, 94 unsolved
[2024-05-31 22:19:09] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/195 variables, 1/242 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/195 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 14 (OVERLAPS) 0/195 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 94 unsolved
No progress, stopping.
After SMT solving in domain Int declared 195/195 variables, and 242 constraints, problems are : Problem set: 0 solved, 94 unsolved in 5592 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 100/100 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 94/94 constraints, Known Traps: 17/17 constraints]
After SMT, in 8734ms problems are : Problem set: 0 solved, 94 unsolved
Search for dead transitions found 0 dead transitions in 8735ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8997 ms. Remains : 100/100 places, 95/95 transitions.
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-31 22:19:12] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-05-31 22:19:12] [INFO ] Flatten gal took : 17 ms
[2024-05-31 22:19:12] [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-31 22:19:12] [INFO ] Flatten gal took : 12 ms
[2024-05-31 22:19:12] [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 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 3 ms. Remains : 212/213 places, 198/198 transitions.
[2024-05-31 22:19:12] [INFO ] Flatten gal took : 9 ms
[2024-05-31 22:19:12] [INFO ] Flatten gal took : 10 ms
[2024-05-31 22:19:12] [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-31 22:19:12] [INFO ] Flatten gal took : 9 ms
[2024-05-31 22:19:12] [INFO ] Flatten gal took : 10 ms
[2024-05-31 22:19:12] [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-31 22:19:12] [INFO ] Flatten gal took : 8 ms
[2024-05-31 22:19:12] [INFO ] Flatten gal took : 8 ms
[2024-05-31 22:19:12] [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-31 22:19:12] [INFO ] Flatten gal took : 8 ms
[2024-05-31 22:19:12] [INFO ] Flatten gal took : 8 ms
[2024-05-31 22:19:12] [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 1 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-31 22:19:12] [INFO ] Flatten gal took : 5 ms
[2024-05-31 22:19:12] [INFO ] Flatten gal took : 5 ms
[2024-05-31 22:19:12] [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 4 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 4 ms. Remains : 213/213 places, 198/198 transitions.
[2024-05-31 22:19:12] [INFO ] Flatten gal took : 7 ms
[2024-05-31 22:19:12] [INFO ] Flatten gal took : 8 ms
[2024-05-31 22:19:12] [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-31 22:19:12] [INFO ] Flatten gal took : 8 ms
[2024-05-31 22:19:12] [INFO ] Flatten gal took : 8 ms
[2024-05-31 22:19:12] [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-31 22:19:12] [INFO ] Flatten gal took : 7 ms
[2024-05-31 22:19:12] [INFO ] Flatten gal took : 7 ms
[2024-05-31 22:19:12] [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.0 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 21 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 21 ms. Remains : 125/213 places, 111/198 transitions.
[2024-05-31 22:19:12] [INFO ] Flatten gal took : 4 ms
[2024-05-31 22:19:12] [INFO ] Flatten gal took : 4 ms
[2024-05-31 22:19:12] [INFO ] Input system was already deterministic with 111 transitions.
RANDOM walk for 40000 steps (4167 resets) in 39 ms. (1000 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (2709 resets) in 25 ms. (1538 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 3893 steps, run visited all 1 properties in 11 ms. (steps per millisecond=353 )
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 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-31 22:19:12] [INFO ] Flatten gal took : 6 ms
[2024-05-31 22:19:12] [INFO ] Flatten gal took : 7 ms
[2024-05-31 22:19:12] [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.0 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 0 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 16 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 16 ms. Remains : 129/213 places, 115/198 transitions.
[2024-05-31 22:19:13] [INFO ] Flatten gal took : 4 ms
[2024-05-31 22:19:13] [INFO ] Flatten gal took : 5 ms
[2024-05-31 22:19:13] [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-31 22:19:13] [INFO ] Flatten gal took : 6 ms
[2024-05-31 22:19:13] [INFO ] Flatten gal took : 7 ms
[2024-05-31 22:19:13] [INFO ] Input system was already deterministic with 198 transitions.
[2024-05-31 22:19:13] [INFO ] Flatten gal took : 7 ms
[2024-05-31 22:19:13] [INFO ] Flatten gal took : 7 ms
[2024-05-31 22:19:13] [INFO ] Export to MCC of 11 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 2 ms.
[2024-05-31 22:19:13] [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 168796 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : DoubleExponent-PT-004-CTLCardinality-2024-01
Could not compute solution for formula : DoubleExponent-PT-004-CTLCardinality-2024-02
Could not compute solution for formula : DoubleExponent-PT-004-CTLCardinality-2024-03
Could not compute solution for formula : DoubleExponent-PT-004-CTLCardinality-2024-04
Could not compute solution for formula : DoubleExponent-PT-004-CTLCardinality-2024-06
Could not compute solution for formula : DoubleExponent-PT-004-CTLCardinality-2024-08
Could not compute solution for formula : DoubleExponent-PT-004-CTLCardinality-2024-09
Could not compute solution for formula : DoubleExponent-PT-004-CTLCardinality-2024-10
Could not compute solution for formula : DoubleExponent-PT-004-CTLCardinality-2023-13
Could not compute solution for formula : DoubleExponent-PT-004-CTLCardinality-2023-14
Could not compute solution for formula : DoubleExponent-PT-004-CTLCardinality-2023-15

BK_STOP 1717193953443

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ 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
mcc2024
ctl formula name DoubleExponent-PT-004-CTLCardinality-2024-01
ctl formula formula --ctl=/tmp/1575/ctl_0_
ctl formula name DoubleExponent-PT-004-CTLCardinality-2024-02
ctl formula formula --ctl=/tmp/1575/ctl_1_
ctl formula name DoubleExponent-PT-004-CTLCardinality-2024-03
ctl formula formula --ctl=/tmp/1575/ctl_2_
ctl formula name DoubleExponent-PT-004-CTLCardinality-2024-04
ctl formula formula --ctl=/tmp/1575/ctl_3_
ctl formula name DoubleExponent-PT-004-CTLCardinality-2024-06
ctl formula formula --ctl=/tmp/1575/ctl_4_
ctl formula name DoubleExponent-PT-004-CTLCardinality-2024-08
ctl formula formula --ctl=/tmp/1575/ctl_5_
ctl formula name DoubleExponent-PT-004-CTLCardinality-2024-09
ctl formula formula --ctl=/tmp/1575/ctl_6_
ctl formula name DoubleExponent-PT-004-CTLCardinality-2024-10
ctl formula formula --ctl=/tmp/1575/ctl_7_
ctl formula name DoubleExponent-PT-004-CTLCardinality-2023-13
ctl formula formula --ctl=/tmp/1575/ctl_8_
ctl formula name DoubleExponent-PT-004-CTLCardinality-2023-14
ctl formula formula --ctl=/tmp/1575/ctl_9_
ctl formula name DoubleExponent-PT-004-CTLCardinality-2023-15
ctl formula formula --ctl=/tmp/1575/ctl_10_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc

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="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
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 r488-tall-171631132900545"
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 ;