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.r179-tall-171640602400809.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is HealthRecord-PT-15, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r179-tall-171640602400809
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 492K
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 22 14:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:18 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 18:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 12 20:33 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 118K Apr 12 20:33 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Apr 12 20:30 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 59K Apr 12 20:30 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:48 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:48 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 73K 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 HealthRecord-PT-15-CTLCardinality-2024-00
FORMULA_NAME HealthRecord-PT-15-CTLCardinality-2024-01
FORMULA_NAME HealthRecord-PT-15-CTLCardinality-2024-02
FORMULA_NAME HealthRecord-PT-15-CTLCardinality-2024-03
FORMULA_NAME HealthRecord-PT-15-CTLCardinality-2024-04
FORMULA_NAME HealthRecord-PT-15-CTLCardinality-2024-05
FORMULA_NAME HealthRecord-PT-15-CTLCardinality-2024-06
FORMULA_NAME HealthRecord-PT-15-CTLCardinality-2024-07
FORMULA_NAME HealthRecord-PT-15-CTLCardinality-2024-08
FORMULA_NAME HealthRecord-PT-15-CTLCardinality-2024-09
FORMULA_NAME HealthRecord-PT-15-CTLCardinality-2024-10
FORMULA_NAME HealthRecord-PT-15-CTLCardinality-2024-11
FORMULA_NAME HealthRecord-PT-15-CTLCardinality-2023-12
FORMULA_NAME HealthRecord-PT-15-CTLCardinality-2023-13
FORMULA_NAME HealthRecord-PT-15-CTLCardinality-2023-14
FORMULA_NAME HealthRecord-PT-15-CTLCardinality-2023-15

=== Now, execution of the tool begins

BK_START 1716491292144

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=HealthRecord-PT-15
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-23 19:08:13] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-23 19:08:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 19:08:13] [INFO ] Load time of PNML (sax parser for PT used): 73 ms
[2024-05-23 19:08:13] [INFO ] Transformed 163 places.
[2024-05-23 19:08:13] [INFO ] Transformed 348 transitions.
[2024-05-23 19:08:13] [INFO ] Found NUPN structural information;
[2024-05-23 19:08:13] [INFO ] Parsed PT model containing 163 places and 348 transitions and 919 arcs in 167 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 14 ms.
Ensure Unique test removed 29 transitions
Reduce redundant transitions removed 29 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA HealthRecord-PT-15-CTLCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-15-CTLCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 87 out of 163 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 163/163 places, 319/319 transitions.
Discarding 37 places :
Symmetric choice reduction at 0 with 37 rule applications. Total rules 37 place count 126 transition count 248
Iterating global reduction 0 with 37 rules applied. Total rules applied 74 place count 126 transition count 248
Applied a total of 74 rules in 21 ms. Remains 126 /163 variables (removed 37) and now considering 248/319 (removed 71) transitions.
[2024-05-23 19:08:13] [INFO ] Flow matrix only has 239 transitions (discarded 9 similar events)
// Phase 1: matrix 239 rows 126 cols
[2024-05-23 19:08:13] [INFO ] Computed 15 invariants in 19 ms
[2024-05-23 19:08:13] [INFO ] Implicit Places using invariants in 228 ms returned []
[2024-05-23 19:08:13] [INFO ] Flow matrix only has 239 transitions (discarded 9 similar events)
[2024-05-23 19:08:13] [INFO ] Invariant cache hit.
[2024-05-23 19:08:13] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-23 19:08:13] [INFO ] Implicit Places using invariants and state equation in 136 ms returned []
Implicit Place search using SMT with State Equation took 389 ms to find 0 implicit places.
Running 247 sub problems to find dead transitions.
[2024-05-23 19:08:13] [INFO ] Flow matrix only has 239 transitions (discarded 9 similar events)
[2024-05-23 19:08:13] [INFO ] Invariant cache hit.
[2024-05-23 19:08:13] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 1 (OVERLAPS) 1/126 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 247 unsolved
[2024-05-23 19:08:15] [INFO ] Deduced a trap composed of 57 places in 89 ms of which 16 ms to minimize.
[2024-05-23 19:08:15] [INFO ] Deduced a trap composed of 12 places in 69 ms of which 2 ms to minimize.
[2024-05-23 19:08:15] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 1 ms to minimize.
[2024-05-23 19:08:15] [INFO ] Deduced a trap composed of 31 places in 42 ms of which 1 ms to minimize.
[2024-05-23 19:08:15] [INFO ] Deduced a trap composed of 42 places in 45 ms of which 1 ms to minimize.
[2024-05-23 19:08:15] [INFO ] Deduced a trap composed of 40 places in 42 ms of which 1 ms to minimize.
[2024-05-23 19:08:15] [INFO ] Deduced a trap composed of 42 places in 48 ms of which 1 ms to minimize.
[2024-05-23 19:08:15] [INFO ] Deduced a trap composed of 35 places in 39 ms of which 2 ms to minimize.
[2024-05-23 19:08:16] [INFO ] Deduced a trap composed of 42 places in 39 ms of which 1 ms to minimize.
[2024-05-23 19:08:16] [INFO ] Deduced a trap composed of 31 places in 37 ms of which 1 ms to minimize.
[2024-05-23 19:08:16] [INFO ] Deduced a trap composed of 32 places in 43 ms of which 1 ms to minimize.
[2024-05-23 19:08:16] [INFO ] Deduced a trap composed of 44 places in 42 ms of which 1 ms to minimize.
[2024-05-23 19:08:16] [INFO ] Deduced a trap composed of 36 places in 43 ms of which 1 ms to minimize.
[2024-05-23 19:08:16] [INFO ] Deduced a trap composed of 43 places in 41 ms of which 1 ms to minimize.
[2024-05-23 19:08:16] [INFO ] Deduced a trap composed of 41 places in 41 ms of which 1 ms to minimize.
[2024-05-23 19:08:16] [INFO ] Deduced a trap composed of 31 places in 39 ms of which 1 ms to minimize.
[2024-05-23 19:08:16] [INFO ] Deduced a trap composed of 32 places in 43 ms of which 1 ms to minimize.
[2024-05-23 19:08:16] [INFO ] Deduced a trap composed of 41 places in 45 ms of which 1 ms to minimize.
[2024-05-23 19:08:16] [INFO ] Deduced a trap composed of 36 places in 46 ms of which 1 ms to minimize.
[2024-05-23 19:08:16] [INFO ] Deduced a trap composed of 30 places in 42 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 20/35 constraints. Problems are: Problem set: 0 solved, 247 unsolved
[2024-05-23 19:08:17] [INFO ] Deduced a trap composed of 27 places in 42 ms of which 1 ms to minimize.
[2024-05-23 19:08:17] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 1 ms to minimize.
[2024-05-23 19:08:17] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
[2024-05-23 19:08:17] [INFO ] Deduced a trap composed of 31 places in 44 ms of which 1 ms to minimize.
[2024-05-23 19:08:17] [INFO ] Deduced a trap composed of 34 places in 36 ms of which 0 ms to minimize.
[2024-05-23 19:08:17] [INFO ] Deduced a trap composed of 34 places in 31 ms of which 0 ms to minimize.
[2024-05-23 19:08:17] [INFO ] Deduced a trap composed of 35 places in 31 ms of which 1 ms to minimize.
[2024-05-23 19:08:17] [INFO ] Deduced a trap composed of 31 places in 48 ms of which 1 ms to minimize.
[2024-05-23 19:08:17] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
[2024-05-23 19:08:17] [INFO ] Deduced a trap composed of 38 places in 45 ms of which 1 ms to minimize.
[2024-05-23 19:08:17] [INFO ] Deduced a trap composed of 25 places in 31 ms of which 0 ms to minimize.
[2024-05-23 19:08:17] [INFO ] Deduced a trap composed of 25 places in 32 ms of which 0 ms to minimize.
[2024-05-23 19:08:17] [INFO ] Deduced a trap composed of 36 places in 37 ms of which 0 ms to minimize.
[2024-05-23 19:08:17] [INFO ] Deduced a trap composed of 35 places in 35 ms of which 1 ms to minimize.
[2024-05-23 19:08:17] [INFO ] Deduced a trap composed of 34 places in 36 ms of which 3 ms to minimize.
[2024-05-23 19:08:17] [INFO ] Deduced a trap composed of 28 places in 35 ms of which 1 ms to minimize.
[2024-05-23 19:08:17] [INFO ] Deduced a trap composed of 28 places in 34 ms of which 1 ms to minimize.
[2024-05-23 19:08:18] [INFO ] Deduced a trap composed of 32 places in 45 ms of which 0 ms to minimize.
[2024-05-23 19:08:18] [INFO ] Deduced a trap composed of 33 places in 70 ms of which 1 ms to minimize.
[2024-05-23 19:08:18] [INFO ] Deduced a trap composed of 34 places in 40 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 20/55 constraints. Problems are: Problem set: 0 solved, 247 unsolved
[2024-05-23 19:08:18] [INFO ] Deduced a trap composed of 25 places in 34 ms of which 1 ms to minimize.
[2024-05-23 19:08:18] [INFO ] Deduced a trap composed of 43 places in 51 ms of which 1 ms to minimize.
[2024-05-23 19:08:18] [INFO ] Deduced a trap composed of 35 places in 49 ms of which 1 ms to minimize.
[2024-05-23 19:08:18] [INFO ] Deduced a trap composed of 32 places in 47 ms of which 0 ms to minimize.
[2024-05-23 19:08:18] [INFO ] Deduced a trap composed of 37 places in 42 ms of which 1 ms to minimize.
[2024-05-23 19:08:18] [INFO ] Deduced a trap composed of 36 places in 34 ms of which 1 ms to minimize.
[2024-05-23 19:08:18] [INFO ] Deduced a trap composed of 41 places in 45 ms of which 1 ms to minimize.
[2024-05-23 19:08:18] [INFO ] Deduced a trap composed of 46 places in 41 ms of which 1 ms to minimize.
[2024-05-23 19:08:18] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
[2024-05-23 19:08:18] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 1 ms to minimize.
[2024-05-23 19:08:18] [INFO ] Deduced a trap composed of 36 places in 37 ms of which 1 ms to minimize.
[2024-05-23 19:08:18] [INFO ] Deduced a trap composed of 45 places in 47 ms of which 1 ms to minimize.
[2024-05-23 19:08:18] [INFO ] Deduced a trap composed of 40 places in 38 ms of which 1 ms to minimize.
[2024-05-23 19:08:19] [INFO ] Deduced a trap composed of 33 places in 46 ms of which 1 ms to minimize.
[2024-05-23 19:08:19] [INFO ] Deduced a trap composed of 38 places in 37 ms of which 1 ms to minimize.
[2024-05-23 19:08:19] [INFO ] Deduced a trap composed of 33 places in 39 ms of which 1 ms to minimize.
[2024-05-23 19:08:19] [INFO ] Deduced a trap composed of 37 places in 56 ms of which 8 ms to minimize.
[2024-05-23 19:08:19] [INFO ] Deduced a trap composed of 40 places in 45 ms of which 1 ms to minimize.
[2024-05-23 19:08:19] [INFO ] Deduced a trap composed of 41 places in 45 ms of which 1 ms to minimize.
[2024-05-23 19:08:19] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/126 variables, 20/75 constraints. Problems are: Problem set: 0 solved, 247 unsolved
[2024-05-23 19:08:19] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 0 ms to minimize.
[2024-05-23 19:08:19] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 1 ms to minimize.
[2024-05-23 19:08:19] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 0 ms to minimize.
[2024-05-23 19:08:19] [INFO ] Deduced a trap composed of 32 places in 40 ms of which 2 ms to minimize.
[2024-05-23 19:08:19] [INFO ] Deduced a trap composed of 31 places in 40 ms of which 1 ms to minimize.
[2024-05-23 19:08:19] [INFO ] Deduced a trap composed of 32 places in 44 ms of which 0 ms to minimize.
[2024-05-23 19:08:19] [INFO ] Deduced a trap composed of 31 places in 39 ms of which 1 ms to minimize.
[2024-05-23 19:08:20] [INFO ] Deduced a trap composed of 31 places in 38 ms of which 1 ms to minimize.
[2024-05-23 19:08:20] [INFO ] Deduced a trap composed of 31 places in 50 ms of which 1 ms to minimize.
[2024-05-23 19:08:20] [INFO ] Deduced a trap composed of 39 places in 50 ms of which 1 ms to minimize.
[2024-05-23 19:08:20] [INFO ] Deduced a trap composed of 36 places in 49 ms of which 1 ms to minimize.
[2024-05-23 19:08:20] [INFO ] Deduced a trap composed of 37 places in 41 ms of which 1 ms to minimize.
[2024-05-23 19:08:20] [INFO ] Deduced a trap composed of 37 places in 34 ms of which 0 ms to minimize.
[2024-05-23 19:08:20] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
[2024-05-23 19:08:20] [INFO ] Deduced a trap composed of 36 places in 52 ms of which 1 ms to minimize.
[2024-05-23 19:08:20] [INFO ] Deduced a trap composed of 33 places in 38 ms of which 0 ms to minimize.
[2024-05-23 19:08:20] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 1 ms to minimize.
[2024-05-23 19:08:20] [INFO ] Deduced a trap composed of 31 places in 32 ms of which 1 ms to minimize.
[2024-05-23 19:08:20] [INFO ] Deduced a trap composed of 22 places in 47 ms of which 1 ms to minimize.
[2024-05-23 19:08:20] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/126 variables, 20/95 constraints. Problems are: Problem set: 0 solved, 247 unsolved
[2024-05-23 19:08:21] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 1 ms to minimize.
[2024-05-23 19:08:21] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 0 ms to minimize.
[2024-05-23 19:08:21] [INFO ] Deduced a trap composed of 33 places in 43 ms of which 1 ms to minimize.
[2024-05-23 19:08:21] [INFO ] Deduced a trap composed of 29 places in 42 ms of which 0 ms to minimize.
[2024-05-23 19:08:22] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 1 ms to minimize.
[2024-05-23 19:08:22] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
[2024-05-23 19:08:22] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 0 ms to minimize.
[2024-05-23 19:08:22] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
[2024-05-23 19:08:22] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 1 ms to minimize.
[2024-05-23 19:08:22] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 0 ms to minimize.
[2024-05-23 19:08:22] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 0 ms to minimize.
[2024-05-23 19:08:22] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
[2024-05-23 19:08:22] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
[2024-05-23 19:08:22] [INFO ] Deduced a trap composed of 25 places in 42 ms of which 0 ms to minimize.
[2024-05-23 19:08:22] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 1 ms to minimize.
[2024-05-23 19:08:22] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 0 ms to minimize.
[2024-05-23 19:08:22] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
[2024-05-23 19:08:22] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 0 ms to minimize.
[2024-05-23 19:08:22] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
[2024-05-23 19:08:22] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/126 variables, 20/115 constraints. Problems are: Problem set: 0 solved, 247 unsolved
[2024-05-23 19:08:23] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 0 ms to minimize.
[2024-05-23 19:08:23] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 1 ms to minimize.
[2024-05-23 19:08:23] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 0 ms to minimize.
[2024-05-23 19:08:23] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 1 ms to minimize.
[2024-05-23 19:08:23] [INFO ] Deduced a trap composed of 39 places in 43 ms of which 0 ms to minimize.
[2024-05-23 19:08:23] [INFO ] Deduced a trap composed of 47 places in 46 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/126 variables, 6/121 constraints. Problems are: Problem set: 0 solved, 247 unsolved
[2024-05-23 19:08:24] [INFO ] Deduced a trap composed of 34 places in 47 ms of which 0 ms to minimize.
[2024-05-23 19:08:24] [INFO ] Deduced a trap composed of 39 places in 42 ms of which 1 ms to minimize.
[2024-05-23 19:08:24] [INFO ] Deduced a trap composed of 38 places in 52 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/126 variables, 3/124 constraints. Problems are: Problem set: 0 solved, 247 unsolved
[2024-05-23 19:08:26] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 0 ms to minimize.
[2024-05-23 19:08:26] [INFO ] Deduced a trap composed of 51 places in 46 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/126 variables, 2/126 constraints. Problems are: Problem set: 0 solved, 247 unsolved
[2024-05-23 19:08:27] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
[2024-05-23 19:08:27] [INFO ] Deduced a trap composed of 17 places in 22 ms of which 1 ms to minimize.
[2024-05-23 19:08:27] [INFO ] Deduced a trap composed of 38 places in 56 ms of which 0 ms to minimize.
[2024-05-23 19:08:27] [INFO ] Deduced a trap composed of 38 places in 47 ms of which 1 ms to minimize.
[2024-05-23 19:08:27] [INFO ] Deduced a trap composed of 40 places in 48 ms of which 0 ms to minimize.
[2024-05-23 19:08:27] [INFO ] Deduced a trap composed of 37 places in 38 ms of which 1 ms to minimize.
[2024-05-23 19:08:27] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 1 ms to minimize.
[2024-05-23 19:08:27] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 0 ms to minimize.
[2024-05-23 19:08:27] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 6 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/126 variables, 9/135 constraints. Problems are: Problem set: 0 solved, 247 unsolved
[2024-05-23 19:08:28] [INFO ] Deduced a trap composed of 48 places in 58 ms of which 1 ms to minimize.
[2024-05-23 19:08:28] [INFO ] Deduced a trap composed of 30 places in 65 ms of which 1 ms to minimize.
[2024-05-23 19:08:28] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
[2024-05-23 19:08:28] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 1 ms to minimize.
[2024-05-23 19:08:28] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/126 variables, 5/140 constraints. Problems are: Problem set: 0 solved, 247 unsolved
[2024-05-23 19:08:30] [INFO ] Deduced a trap composed of 42 places in 53 ms of which 1 ms to minimize.
[2024-05-23 19:08:30] [INFO ] Deduced a trap composed of 44 places in 44 ms of which 1 ms to minimize.
[2024-05-23 19:08:30] [INFO ] Deduced a trap composed of 40 places in 46 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/126 variables, 3/143 constraints. Problems are: Problem set: 0 solved, 247 unsolved
[2024-05-23 19:08:31] [INFO ] Deduced a trap composed of 41 places in 49 ms of which 1 ms to minimize.
[2024-05-23 19:08:31] [INFO ] Deduced a trap composed of 43 places in 47 ms of which 1 ms to minimize.
[2024-05-23 19:08:31] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/126 variables, 3/146 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/126 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 16 (OVERLAPS) 238/364 variables, 126/272 constraints. Problems are: Problem set: 0 solved, 247 unsolved
[2024-05-23 19:08:33] [INFO ] Deduced a trap composed of 39 places in 61 ms of which 1 ms to minimize.
[2024-05-23 19:08:34] [INFO ] Deduced a trap composed of 18 places in 60 ms of which 1 ms to minimize.
[2024-05-23 19:08:34] [INFO ] Deduced a trap composed of 33 places in 58 ms of which 1 ms to minimize.
[2024-05-23 19:08:34] [INFO ] Deduced a trap composed of 33 places in 49 ms of which 1 ms to minimize.
[2024-05-23 19:08:34] [INFO ] Deduced a trap composed of 38 places in 49 ms of which 0 ms to minimize.
[2024-05-23 19:08:34] [INFO ] Deduced a trap composed of 36 places in 56 ms of which 1 ms to minimize.
[2024-05-23 19:08:34] [INFO ] Deduced a trap composed of 32 places in 44 ms of which 0 ms to minimize.
[2024-05-23 19:08:34] [INFO ] Deduced a trap composed of 33 places in 49 ms of which 1 ms to minimize.
[2024-05-23 19:08:34] [INFO ] Deduced a trap composed of 41 places in 52 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/364 variables, 9/281 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/364 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 19 (OVERLAPS) 1/365 variables, 1/282 constraints. Problems are: Problem set: 0 solved, 247 unsolved
[2024-05-23 19:08:38] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 0 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/365 variables, 1/283 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/365 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 247 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 365/365 variables, and 283 constraints, problems are : Problem set: 0 solved, 247 unsolved in 30051 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 126/126 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 247/247 constraints, Known Traps: 141/141 constraints]
Escalating to Integer solving :Problem set: 0 solved, 247 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 1 (OVERLAPS) 1/126 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 141/156 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 5 (OVERLAPS) 238/364 variables, 126/282 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/364 variables, 247/529 constraints. Problems are: Problem set: 0 solved, 247 unsolved
[2024-05-23 19:08:48] [INFO ] Deduced a trap composed of 40 places in 53 ms of which 0 ms to minimize.
[2024-05-23 19:08:48] [INFO ] Deduced a trap composed of 38 places in 49 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/364 variables, 2/531 constraints. Problems are: Problem set: 0 solved, 247 unsolved
[2024-05-23 19:08:53] [INFO ] Deduced a trap composed of 32 places in 53 ms of which 1 ms to minimize.
[2024-05-23 19:08:54] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/364 variables, 2/533 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/364 variables, 0/533 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 10 (OVERLAPS) 1/365 variables, 1/534 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/365 variables, 0/534 constraints. Problems are: Problem set: 0 solved, 247 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 365/365 variables, and 534 constraints, problems are : Problem set: 0 solved, 247 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 126/126 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 247/247 constraints, Known Traps: 145/145 constraints]
After SMT, in 60268ms problems are : Problem set: 0 solved, 247 unsolved
Search for dead transitions found 0 dead transitions in 60286ms
Starting structural reductions in LTL mode, iteration 1 : 126/163 places, 248/319 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60717 ms. Remains : 126/163 places, 248/319 transitions.
Support contains 87 out of 126 places after structural reductions.
[2024-05-23 19:09:14] [INFO ] Flatten gal took : 51 ms
[2024-05-23 19:09:14] [INFO ] Flatten gal took : 19 ms
[2024-05-23 19:09:14] [INFO ] Input system was already deterministic with 248 transitions.
Support contains 77 out of 126 places (down from 87) after GAL structural reductions.
RANDOM walk for 40000 steps (3680 resets) in 2080 ms. (19 steps per ms) remains 32/55 properties
BEST_FIRST walk for 4003 steps (43 resets) in 32 ms. (121 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (48 resets) in 43 ms. (91 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (47 resets) in 14 ms. (266 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4002 steps (48 resets) in 23 ms. (166 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (48 resets) in 21 ms. (182 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (45 resets) in 26 ms. (148 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (47 resets) in 27 ms. (143 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (47 resets) in 22 ms. (174 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (50 resets) in 14 ms. (266 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (45 resets) in 11 ms. (333 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (47 resets) in 9 ms. (400 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (42 resets) in 20 ms. (190 steps per ms) remains 31/32 properties
BEST_FIRST walk for 4004 steps (45 resets) in 12 ms. (308 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (44 resets) in 11 ms. (333 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (45 resets) in 24 ms. (160 steps per ms) remains 29/31 properties
BEST_FIRST walk for 4004 steps (45 resets) in 11 ms. (333 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (47 resets) in 9 ms. (400 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (45 resets) in 14 ms. (266 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (48 resets) in 24 ms. (160 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (47 resets) in 12 ms. (307 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (48 resets) in 12 ms. (308 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (48 resets) in 12 ms. (308 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (46 resets) in 15 ms. (250 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (50 resets) in 10 ms. (364 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (47 resets) in 15 ms. (250 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (49 resets) in 20 ms. (190 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (43 resets) in 15 ms. (250 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (46 resets) in 19 ms. (200 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (43 resets) in 11 ms. (333 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (45 resets) in 16 ms. (235 steps per ms) remains 29/29 properties
[2024-05-23 19:09:15] [INFO ] Flow matrix only has 239 transitions (discarded 9 similar events)
[2024-05-23 19:09:15] [INFO ] Invariant cache hit.
[2024-05-23 19:09:15] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 1 (OVERLAPS) 45/84 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 3 (OVERLAPS) 42/126 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 29 unsolved
[2024-05-23 19:09:15] [INFO ] Deduced a trap composed of 17 places in 59 ms of which 1 ms to minimize.
Problem AtomicPropp24 is UNSAT
[2024-05-23 19:09:15] [INFO ] Deduced a trap composed of 32 places in 52 ms of which 1 ms to minimize.
[2024-05-23 19:09:15] [INFO ] Deduced a trap composed of 35 places in 49 ms of which 0 ms to minimize.
[2024-05-23 19:09:15] [INFO ] Deduced a trap composed of 39 places in 46 ms of which 1 ms to minimize.
[2024-05-23 19:09:15] [INFO ] Deduced a trap composed of 35 places in 44 ms of which 1 ms to minimize.
[2024-05-23 19:09:15] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 1 ms to minimize.
[2024-05-23 19:09:15] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 1 ms to minimize.
[2024-05-23 19:09:16] [INFO ] Deduced a trap composed of 37 places in 45 ms of which 1 ms to minimize.
[2024-05-23 19:09:16] [INFO ] Deduced a trap composed of 36 places in 42 ms of which 1 ms to minimize.
[2024-05-23 19:09:16] [INFO ] Deduced a trap composed of 38 places in 43 ms of which 1 ms to minimize.
[2024-05-23 19:09:16] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 0 ms to minimize.
[2024-05-23 19:09:16] [INFO ] Deduced a trap composed of 40 places in 43 ms of which 1 ms to minimize.
[2024-05-23 19:09:16] [INFO ] Deduced a trap composed of 41 places in 39 ms of which 1 ms to minimize.
[2024-05-23 19:09:16] [INFO ] Deduced a trap composed of 44 places in 43 ms of which 1 ms to minimize.
[2024-05-23 19:09:16] [INFO ] Deduced a trap composed of 39 places in 40 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 15/30 constraints. Problems are: Problem set: 1 solved, 28 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/126 variables, 0/30 constraints. Problems are: Problem set: 1 solved, 28 unsolved
At refinement iteration 6 (OVERLAPS) 238/364 variables, 126/156 constraints. Problems are: Problem set: 1 solved, 28 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/364 variables, 0/156 constraints. Problems are: Problem set: 1 solved, 28 unsolved
At refinement iteration 8 (OVERLAPS) 1/365 variables, 1/157 constraints. Problems are: Problem set: 1 solved, 28 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/365 variables, 0/157 constraints. Problems are: Problem set: 1 solved, 28 unsolved
At refinement iteration 10 (OVERLAPS) 0/365 variables, 0/157 constraints. Problems are: Problem set: 1 solved, 28 unsolved
No progress, stopping.
After SMT solving in domain Real declared 365/365 variables, and 157 constraints, problems are : Problem set: 1 solved, 28 unsolved in 1734 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 126/126 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 29/29 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 1 solved, 28 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 28 unsolved
At refinement iteration 1 (OVERLAPS) 46/84 variables, 7/7 constraints. Problems are: Problem set: 1 solved, 28 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 1/8 constraints. Problems are: Problem set: 1 solved, 28 unsolved
[2024-05-23 19:09:17] [INFO ] Deduced a trap composed of 30 places in 32 ms of which 1 ms to minimize.
[2024-05-23 19:09:17] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 1 ms to minimize.
[2024-05-23 19:09:17] [INFO ] Deduced a trap composed of 33 places in 34 ms of which 1 ms to minimize.
[2024-05-23 19:09:17] [INFO ] Deduced a trap composed of 39 places in 36 ms of which 1 ms to minimize.
[2024-05-23 19:09:17] [INFO ] Deduced a trap composed of 39 places in 32 ms of which 1 ms to minimize.
[2024-05-23 19:09:17] [INFO ] Deduced a trap composed of 38 places in 33 ms of which 1 ms to minimize.
[2024-05-23 19:09:17] [INFO ] Deduced a trap composed of 32 places in 34 ms of which 1 ms to minimize.
[2024-05-23 19:09:17] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 1 ms to minimize.
[2024-05-23 19:09:17] [INFO ] Deduced a trap composed of 32 places in 35 ms of which 1 ms to minimize.
[2024-05-23 19:09:17] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 1 ms to minimize.
[2024-05-23 19:09:17] [INFO ] Deduced a trap composed of 29 places in 32 ms of which 0 ms to minimize.
[2024-05-23 19:09:17] [INFO ] Deduced a trap composed of 30 places in 41 ms of which 1 ms to minimize.
[2024-05-23 19:09:17] [INFO ] Deduced a trap composed of 39 places in 41 ms of which 1 ms to minimize.
[2024-05-23 19:09:17] [INFO ] Deduced a trap composed of 43 places in 40 ms of which 1 ms to minimize.
[2024-05-23 19:09:17] [INFO ] Deduced a trap composed of 37 places in 36 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/84 variables, 15/23 constraints. Problems are: Problem set: 1 solved, 28 unsolved
[2024-05-23 19:09:17] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/84 variables, 1/24 constraints. Problems are: Problem set: 1 solved, 28 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/84 variables, 0/24 constraints. Problems are: Problem set: 1 solved, 28 unsolved
At refinement iteration 6 (OVERLAPS) 42/126 variables, 8/32 constraints. Problems are: Problem set: 1 solved, 28 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/126 variables, 14/46 constraints. Problems are: Problem set: 1 solved, 28 unsolved
[2024-05-23 19:09:18] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 1 ms to minimize.
[2024-05-23 19:09:18] [INFO ] Deduced a trap composed of 31 places in 58 ms of which 1 ms to minimize.
[2024-05-23 19:09:18] [INFO ] Deduced a trap composed of 37 places in 50 ms of which 1 ms to minimize.
[2024-05-23 19:09:18] [INFO ] Deduced a trap composed of 39 places in 55 ms of which 1 ms to minimize.
[2024-05-23 19:09:18] [INFO ] Deduced a trap composed of 38 places in 50 ms of which 1 ms to minimize.
[2024-05-23 19:09:18] [INFO ] Deduced a trap composed of 38 places in 55 ms of which 0 ms to minimize.
[2024-05-23 19:09:18] [INFO ] Deduced a trap composed of 43 places in 52 ms of which 1 ms to minimize.
[2024-05-23 19:09:18] [INFO ] Deduced a trap composed of 41 places in 55 ms of which 0 ms to minimize.
[2024-05-23 19:09:18] [INFO ] Deduced a trap composed of 41 places in 45 ms of which 1 ms to minimize.
[2024-05-23 19:09:18] [INFO ] Deduced a trap composed of 19 places in 52 ms of which 0 ms to minimize.
[2024-05-23 19:09:18] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 0 ms to minimize.
[2024-05-23 19:09:18] [INFO ] Deduced a trap composed of 17 places in 55 ms of which 1 ms to minimize.
[2024-05-23 19:09:18] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 0 ms to minimize.
[2024-05-23 19:09:18] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 0 ms to minimize.
[2024-05-23 19:09:18] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 0 ms to minimize.
[2024-05-23 19:09:18] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 0 ms to minimize.
[2024-05-23 19:09:18] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 1 ms to minimize.
[2024-05-23 19:09:19] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 1 ms to minimize.
[2024-05-23 19:09:19] [INFO ] Deduced a trap composed of 45 places in 51 ms of which 1 ms to minimize.
[2024-05-23 19:09:19] [INFO ] Deduced a trap composed of 32 places in 53 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/126 variables, 20/66 constraints. Problems are: Problem set: 1 solved, 28 unsolved
[2024-05-23 19:09:19] [INFO ] Deduced a trap composed of 37 places in 41 ms of which 1 ms to minimize.
[2024-05-23 19:09:19] [INFO ] Deduced a trap composed of 36 places in 52 ms of which 1 ms to minimize.
[2024-05-23 19:09:19] [INFO ] Deduced a trap composed of 39 places in 51 ms of which 1 ms to minimize.
[2024-05-23 19:09:19] [INFO ] Deduced a trap composed of 36 places in 50 ms of which 1 ms to minimize.
[2024-05-23 19:09:19] [INFO ] Deduced a trap composed of 34 places in 51 ms of which 1 ms to minimize.
[2024-05-23 19:09:19] [INFO ] Deduced a trap composed of 36 places in 53 ms of which 1 ms to minimize.
[2024-05-23 19:09:19] [INFO ] Deduced a trap composed of 38 places in 40 ms of which 1 ms to minimize.
[2024-05-23 19:09:19] [INFO ] Deduced a trap composed of 39 places in 39 ms of which 1 ms to minimize.
[2024-05-23 19:09:19] [INFO ] Deduced a trap composed of 43 places in 40 ms of which 1 ms to minimize.
[2024-05-23 19:09:19] [INFO ] Deduced a trap composed of 41 places in 47 ms of which 1 ms to minimize.
[2024-05-23 19:09:19] [INFO ] Deduced a trap composed of 45 places in 45 ms of which 1 ms to minimize.
[2024-05-23 19:09:19] [INFO ] Deduced a trap composed of 41 places in 41 ms of which 1 ms to minimize.
[2024-05-23 19:09:19] [INFO ] Deduced a trap composed of 39 places in 37 ms of which 1 ms to minimize.
[2024-05-23 19:09:19] [INFO ] Deduced a trap composed of 41 places in 40 ms of which 1 ms to minimize.
[2024-05-23 19:09:19] [INFO ] Deduced a trap composed of 38 places in 36 ms of which 1 ms to minimize.
[2024-05-23 19:09:19] [INFO ] Deduced a trap composed of 40 places in 37 ms of which 0 ms to minimize.
[2024-05-23 19:09:20] [INFO ] Deduced a trap composed of 40 places in 47 ms of which 0 ms to minimize.
[2024-05-23 19:09:20] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/126 variables, 18/84 constraints. Problems are: Problem set: 1 solved, 28 unsolved
[2024-05-23 19:09:20] [INFO ] Deduced a trap composed of 44 places in 49 ms of which 1 ms to minimize.
[2024-05-23 19:09:20] [INFO ] Deduced a trap composed of 31 places in 45 ms of which 1 ms to minimize.
[2024-05-23 19:09:20] [INFO ] Deduced a trap composed of 30 places in 44 ms of which 1 ms to minimize.
[2024-05-23 19:09:20] [INFO ] Deduced a trap composed of 31 places in 55 ms of which 1 ms to minimize.
[2024-05-23 19:09:20] [INFO ] Deduced a trap composed of 36 places in 48 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/126 variables, 5/89 constraints. Problems are: Problem set: 1 solved, 28 unsolved
[2024-05-23 19:09:20] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 0 ms to minimize.
[2024-05-23 19:09:20] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 1 ms to minimize.
[2024-05-23 19:09:20] [INFO ] Deduced a trap composed of 21 places in 26 ms of which 0 ms to minimize.
[2024-05-23 19:09:20] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 0 ms to minimize.
[2024-05-23 19:09:20] [INFO ] Deduced a trap composed of 37 places in 64 ms of which 1 ms to minimize.
[2024-05-23 19:09:20] [INFO ] Deduced a trap composed of 45 places in 43 ms of which 0 ms to minimize.
[2024-05-23 19:09:20] [INFO ] Deduced a trap composed of 41 places in 39 ms of which 1 ms to minimize.
[2024-05-23 19:09:20] [INFO ] Deduced a trap composed of 40 places in 38 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/126 variables, 8/97 constraints. Problems are: Problem set: 1 solved, 28 unsolved
[2024-05-23 19:09:21] [INFO ] Deduced a trap composed of 39 places in 48 ms of which 1 ms to minimize.
[2024-05-23 19:09:21] [INFO ] Deduced a trap composed of 39 places in 40 ms of which 1 ms to minimize.
[2024-05-23 19:09:21] [INFO ] Deduced a trap composed of 35 places in 35 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/126 variables, 3/100 constraints. Problems are: Problem set: 1 solved, 28 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/126 variables, 0/100 constraints. Problems are: Problem set: 1 solved, 28 unsolved
At refinement iteration 14 (OVERLAPS) 238/364 variables, 126/226 constraints. Problems are: Problem set: 1 solved, 28 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/364 variables, 28/254 constraints. Problems are: Problem set: 1 solved, 28 unsolved
[2024-05-23 19:09:21] [INFO ] Deduced a trap composed of 34 places in 50 ms of which 1 ms to minimize.
[2024-05-23 19:09:21] [INFO ] Deduced a trap composed of 31 places in 43 ms of which 2 ms to minimize.
[2024-05-23 19:09:21] [INFO ] Deduced a trap composed of 39 places in 40 ms of which 1 ms to minimize.
[2024-05-23 19:09:21] [INFO ] Deduced a trap composed of 41 places in 47 ms of which 0 ms to minimize.
[2024-05-23 19:09:21] [INFO ] Deduced a trap composed of 40 places in 37 ms of which 0 ms to minimize.
[2024-05-23 19:09:21] [INFO ] Deduced a trap composed of 38 places in 34 ms of which 0 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/364 variables, 6/260 constraints. Problems are: Problem set: 1 solved, 28 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 364/365 variables, and 260 constraints, problems are : Problem set: 1 solved, 28 unsolved in 5011 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 126/126 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 28/29 constraints, Known Traps: 91/91 constraints]
After SMT, in 6761ms problems are : Problem set: 1 solved, 28 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 38 out of 126 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 248/248 transitions.
Graph (trivial) has 101 edges and 126 vertex of which 4 / 126 are part of one of the 2 SCC in 4 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (complete) has 541 edges and 124 vertex of which 121 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 0 output transitions
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 30 place count 93 transition count 179
Iterating global reduction 0 with 28 rules applied. Total rules applied 58 place count 93 transition count 179
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 62 place count 89 transition count 171
Iterating global reduction 0 with 4 rules applied. Total rules applied 66 place count 89 transition count 171
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 71 place count 89 transition count 166
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -45
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 1 with 16 rules applied. Total rules applied 87 place count 81 transition count 211
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 91 place count 81 transition count 207
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 92 place count 81 transition count 206
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 93 place count 80 transition count 206
Partial Free-agglomeration rule applied 19 times.
Drop transitions (Partial Free agglomeration) removed 19 transitions
Iterating global reduction 2 with 19 rules applied. Total rules applied 112 place count 80 transition count 206
Applied a total of 112 rules in 70 ms. Remains 80 /126 variables (removed 46) and now considering 206/248 (removed 42) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 70 ms. Remains : 80/126 places, 206/248 transitions.
RANDOM walk for 40000 steps (6283 resets) in 784 ms. (50 steps per ms) remains 17/28 properties
BEST_FIRST walk for 4004 steps (79 resets) in 11 ms. (333 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (83 resets) in 11 ms. (333 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4001 steps (86 resets) in 12 ms. (307 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (79 resets) in 12 ms. (308 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (74 resets) in 12 ms. (308 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (80 resets) in 12 ms. (308 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (86 resets) in 12 ms. (308 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (89 resets) in 13 ms. (286 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (87 resets) in 12 ms. (308 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (95 resets) in 11 ms. (333 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (80 resets) in 10 ms. (363 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (86 resets) in 12 ms. (308 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (88 resets) in 14 ms. (266 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (85 resets) in 12 ms. (307 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (71 resets) in 13 ms. (285 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (84 resets) in 10 ms. (364 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (86 resets) in 13 ms. (285 steps per ms) remains 17/17 properties
[2024-05-23 19:09:22] [INFO ] Flow matrix only has 187 transitions (discarded 19 similar events)
// Phase 1: matrix 187 rows 80 cols
[2024-05-23 19:09:22] [INFO ] Computed 12 invariants in 3 ms
[2024-05-23 19:09:22] [INFO ] State equation strengthened by 24 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (OVERLAPS) 35/59 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (OVERLAPS) 21/80 variables, 8/12 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/80 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (OVERLAPS) 187/267 variables, 80/92 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/267 variables, 24/116 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/267 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (OVERLAPS) 0/267 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 267/267 variables, and 116 constraints, problems are : Problem set: 0 solved, 17 unsolved in 309 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 80/80 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 17 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (OVERLAPS) 35/59 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
[2024-05-23 19:09:22] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 1 ms to minimize.
[2024-05-23 19:09:22] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 1 ms to minimize.
[2024-05-23 19:09:22] [INFO ] Deduced a trap composed of 29 places in 41 ms of which 1 ms to minimize.
[2024-05-23 19:09:22] [INFO ] Deduced a trap composed of 31 places in 30 ms of which 1 ms to minimize.
[2024-05-23 19:09:23] [INFO ] Deduced a trap composed of 34 places in 37 ms of which 0 ms to minimize.
[2024-05-23 19:09:23] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 0 ms to minimize.
[2024-05-23 19:09:23] [INFO ] Deduced a trap composed of 31 places in 32 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 7/11 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 21/80 variables, 8/19 constraints. Problems are: Problem set: 0 solved, 17 unsolved
[2024-05-23 19:09:23] [INFO ] Deduced a trap composed of 23 places in 54 ms of which 1 ms to minimize.
[2024-05-23 19:09:23] [INFO ] Deduced a trap composed of 22 places in 47 ms of which 1 ms to minimize.
[2024-05-23 19:09:23] [INFO ] Deduced a trap composed of 25 places in 47 ms of which 1 ms to minimize.
[2024-05-23 19:09:23] [INFO ] Deduced a trap composed of 29 places in 46 ms of which 1 ms to minimize.
[2024-05-23 19:09:23] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 1 ms to minimize.
[2024-05-23 19:09:23] [INFO ] Deduced a trap composed of 27 places in 47 ms of which 1 ms to minimize.
[2024-05-23 19:09:23] [INFO ] Deduced a trap composed of 11 places in 47 ms of which 1 ms to minimize.
[2024-05-23 19:09:23] [INFO ] Deduced a trap composed of 11 places in 50 ms of which 1 ms to minimize.
[2024-05-23 19:09:23] [INFO ] Deduced a trap composed of 28 places in 48 ms of which 1 ms to minimize.
[2024-05-23 19:09:23] [INFO ] Deduced a trap composed of 29 places in 44 ms of which 1 ms to minimize.
[2024-05-23 19:09:23] [INFO ] Deduced a trap composed of 10 places in 58 ms of which 0 ms to minimize.
[2024-05-23 19:09:23] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 1 ms to minimize.
[2024-05-23 19:09:23] [INFO ] Deduced a trap composed of 11 places in 35 ms of which 1 ms to minimize.
[2024-05-23 19:09:23] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 1 ms to minimize.
[2024-05-23 19:09:23] [INFO ] Deduced a trap composed of 25 places in 40 ms of which 0 ms to minimize.
[2024-05-23 19:09:23] [INFO ] Deduced a trap composed of 27 places in 46 ms of which 1 ms to minimize.
[2024-05-23 19:09:24] [INFO ] Deduced a trap composed of 10 places in 38 ms of which 1 ms to minimize.
[2024-05-23 19:09:24] [INFO ] Deduced a trap composed of 23 places in 56 ms of which 1 ms to minimize.
[2024-05-23 19:09:24] [INFO ] Deduced a trap composed of 14 places in 53 ms of which 0 ms to minimize.
[2024-05-23 19:09:24] [INFO ] Deduced a trap composed of 25 places in 41 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/80 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 17 unsolved
[2024-05-23 19:09:24] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 1 ms to minimize.
[2024-05-23 19:09:24] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 0 ms to minimize.
[2024-05-23 19:09:24] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/80 variables, 3/42 constraints. Problems are: Problem set: 0 solved, 17 unsolved
[2024-05-23 19:09:24] [INFO ] Deduced a trap composed of 24 places in 53 ms of which 1 ms to minimize.
[2024-05-23 19:09:24] [INFO ] Deduced a trap composed of 27 places in 51 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/80 variables, 2/44 constraints. Problems are: Problem set: 0 solved, 17 unsolved
[2024-05-23 19:09:24] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/80 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 17 unsolved
[2024-05-23 19:09:24] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/80 variables, 1/46 constraints. Problems are: Problem set: 0 solved, 17 unsolved
[2024-05-23 19:09:24] [INFO ] Deduced a trap composed of 21 places in 54 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/80 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/80 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 12 (OVERLAPS) 187/267 variables, 80/127 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/267 variables, 24/151 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/267 variables, 17/168 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/267 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 16 (OVERLAPS) 0/267 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 267/267 variables, and 168 constraints, problems are : Problem set: 0 solved, 17 unsolved in 2628 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 80/80 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 35/35 constraints]
After SMT, in 2951ms problems are : Problem set: 0 solved, 17 unsolved
Fused 17 Parikh solutions to 15 different solutions.
Parikh walk visited 15 properties in 1619 ms.
Support contains 2 out of 80 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 80/80 places, 206/206 transitions.
Graph (complete) has 440 edges and 80 vertex of which 76 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.0 ms
Discarding 4 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 76 transition count 205
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 75 transition count 205
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 24 place count 54 transition count 163
Iterating global reduction 2 with 21 rules applied. Total rules applied 45 place count 54 transition count 163
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 50 place count 49 transition count 151
Iterating global reduction 2 with 5 rules applied. Total rules applied 55 place count 49 transition count 151
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 60 place count 49 transition count 146
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 62 place count 48 transition count 145
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -16
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 68 place count 45 transition count 161
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 69 place count 44 transition count 158
Iterating global reduction 3 with 1 rules applied. Total rules applied 70 place count 44 transition count 158
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 71 place count 43 transition count 152
Iterating global reduction 3 with 1 rules applied. Total rules applied 72 place count 43 transition count 152
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 73 place count 42 transition count 150
Iterating global reduction 3 with 1 rules applied. Total rules applied 74 place count 42 transition count 150
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 78 place count 42 transition count 146
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 80 place count 42 transition count 144
Free-agglomeration rule applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 82 place count 42 transition count 142
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 84 place count 40 transition count 142
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 85 place count 40 transition count 141
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 86 place count 39 transition count 141
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 88 place count 39 transition count 141
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 89 place count 38 transition count 131
Iterating global reduction 6 with 1 rules applied. Total rules applied 90 place count 38 transition count 131
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 91 place count 37 transition count 129
Iterating global reduction 6 with 1 rules applied. Total rules applied 92 place count 37 transition count 129
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 98 place count 37 transition count 123
Applied a total of 98 rules in 74 ms. Remains 37 /80 variables (removed 43) and now considering 123/206 (removed 83) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 74 ms. Remains : 37/80 places, 123/206 transitions.
RANDOM walk for 40000 steps (8761 resets) in 1261 ms. (31 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (1071 resets) in 73 ms. (540 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (1082 resets) in 29 ms. (1333 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 6988 steps, run visited all 2 properties in 36 ms. (steps per millisecond=194 )
Probabilistic random walk after 6988 steps, saw 1925 distinct states, run finished after 39 ms. (steps per millisecond=179 ) properties seen :2
Successfully simplified 1 atomic propositions for a total of 14 simplifications.
[2024-05-23 19:09:27] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-05-23 19:09:27] [INFO ] Flatten gal took : 12 ms
FORMULA HealthRecord-PT-15-CTLCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-23 19:09:27] [INFO ] Flatten gal took : 12 ms
[2024-05-23 19:09:27] [INFO ] Input system was already deterministic with 248 transitions.
Support contains 65 out of 126 places (down from 69) after GAL structural reductions.
Computed a total of 13 stabilizing places and 22 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 126/126 places, 248/248 transitions.
Graph (trivial) has 111 edges and 126 vertex of which 4 / 126 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 45 places :
Symmetric choice reduction at 0 with 45 rule applications. Total rules 46 place count 79 transition count 162
Iterating global reduction 0 with 45 rules applied. Total rules applied 91 place count 79 transition count 162
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 95 place count 75 transition count 154
Iterating global reduction 0 with 4 rules applied. Total rules applied 99 place count 75 transition count 154
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 102 place count 75 transition count 151
Applied a total of 102 rules in 12 ms. Remains 75 /126 variables (removed 51) and now considering 151/248 (removed 97) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 12 ms. Remains : 75/126 places, 151/248 transitions.
[2024-05-23 19:09:27] [INFO ] Flatten gal took : 7 ms
[2024-05-23 19:09:27] [INFO ] Flatten gal took : 8 ms
[2024-05-23 19:09:27] [INFO ] Input system was already deterministic with 151 transitions.
Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 248/248 transitions.
Discarding 61 places :
Symmetric choice reduction at 0 with 61 rule applications. Total rules 61 place count 65 transition count 132
Iterating global reduction 0 with 61 rules applied. Total rules applied 122 place count 65 transition count 132
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 132 place count 55 transition count 112
Iterating global reduction 0 with 10 rules applied. Total rules applied 142 place count 55 transition count 112
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 151 place count 55 transition count 103
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 154 place count 52 transition count 94
Iterating global reduction 1 with 3 rules applied. Total rules applied 157 place count 52 transition count 94
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 160 place count 49 transition count 88
Iterating global reduction 1 with 3 rules applied. Total rules applied 163 place count 49 transition count 88
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 172 place count 49 transition count 79
Applied a total of 172 rules in 6 ms. Remains 49 /126 variables (removed 77) and now considering 79/248 (removed 169) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 49/126 places, 79/248 transitions.
[2024-05-23 19:09:27] [INFO ] Flatten gal took : 4 ms
[2024-05-23 19:09:27] [INFO ] Flatten gal took : 5 ms
[2024-05-23 19:09:27] [INFO ] Input system was already deterministic with 79 transitions.
Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 248/248 transitions.
Discarding 57 places :
Symmetric choice reduction at 0 with 57 rule applications. Total rules 57 place count 69 transition count 140
Iterating global reduction 0 with 57 rules applied. Total rules applied 114 place count 69 transition count 140
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 123 place count 60 transition count 122
Iterating global reduction 0 with 9 rules applied. Total rules applied 132 place count 60 transition count 122
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 138 place count 60 transition count 116
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 139 place count 59 transition count 113
Iterating global reduction 1 with 1 rules applied. Total rules applied 140 place count 59 transition count 113
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 141 place count 58 transition count 111
Iterating global reduction 1 with 1 rules applied. Total rules applied 142 place count 58 transition count 111
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 145 place count 58 transition count 108
Applied a total of 145 rules in 5 ms. Remains 58 /126 variables (removed 68) and now considering 108/248 (removed 140) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 58/126 places, 108/248 transitions.
[2024-05-23 19:09:27] [INFO ] Flatten gal took : 6 ms
[2024-05-23 19:09:27] [INFO ] Flatten gal took : 6 ms
[2024-05-23 19:09:27] [INFO ] Input system was already deterministic with 108 transitions.
Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 248/248 transitions.
Discarding 61 places :
Symmetric choice reduction at 0 with 61 rule applications. Total rules 61 place count 65 transition count 132
Iterating global reduction 0 with 61 rules applied. Total rules applied 122 place count 65 transition count 132
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 131 place count 56 transition count 114
Iterating global reduction 0 with 9 rules applied. Total rules applied 140 place count 56 transition count 114
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 146 place count 56 transition count 108
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 148 place count 54 transition count 102
Iterating global reduction 1 with 2 rules applied. Total rules applied 150 place count 54 transition count 102
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 152 place count 52 transition count 98
Iterating global reduction 1 with 2 rules applied. Total rules applied 154 place count 52 transition count 98
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 160 place count 52 transition count 92
Applied a total of 160 rules in 5 ms. Remains 52 /126 variables (removed 74) and now considering 92/248 (removed 156) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 52/126 places, 92/248 transitions.
[2024-05-23 19:09:27] [INFO ] Flatten gal took : 5 ms
[2024-05-23 19:09:27] [INFO ] Flatten gal took : 5 ms
[2024-05-23 19:09:27] [INFO ] Input system was already deterministic with 92 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 126/126 places, 248/248 transitions.
Graph (trivial) has 177 edges and 126 vertex of which 6 / 126 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 59 places :
Symmetric choice reduction at 0 with 59 rule applications. Total rules 60 place count 63 transition count 131
Iterating global reduction 0 with 59 rules applied. Total rules applied 119 place count 63 transition count 131
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 129 place count 53 transition count 111
Iterating global reduction 0 with 10 rules applied. Total rules applied 139 place count 53 transition count 111
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 148 place count 53 transition count 102
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 151 place count 50 transition count 93
Iterating global reduction 1 with 3 rules applied. Total rules applied 154 place count 50 transition count 93
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 157 place count 47 transition count 87
Iterating global reduction 1 with 3 rules applied. Total rules applied 160 place count 47 transition count 87
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 169 place count 47 transition count 78
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 172 place count 47 transition count 75
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 176 place count 45 transition count 73
Applied a total of 176 rules in 13 ms. Remains 45 /126 variables (removed 81) and now considering 73/248 (removed 175) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 13 ms. Remains : 45/126 places, 73/248 transitions.
[2024-05-23 19:09:27] [INFO ] Flatten gal took : 3 ms
[2024-05-23 19:09:27] [INFO ] Flatten gal took : 3 ms
[2024-05-23 19:09:27] [INFO ] Input system was already deterministic with 73 transitions.
Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 248/248 transitions.
Discarding 59 places :
Symmetric choice reduction at 0 with 59 rule applications. Total rules 59 place count 67 transition count 135
Iterating global reduction 0 with 59 rules applied. Total rules applied 118 place count 67 transition count 135
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 127 place count 58 transition count 117
Iterating global reduction 0 with 9 rules applied. Total rules applied 136 place count 58 transition count 117
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 145 place count 58 transition count 108
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 147 place count 56 transition count 102
Iterating global reduction 1 with 2 rules applied. Total rules applied 149 place count 56 transition count 102
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 151 place count 54 transition count 98
Iterating global reduction 1 with 2 rules applied. Total rules applied 153 place count 54 transition count 98
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 159 place count 54 transition count 92
Applied a total of 159 rules in 4 ms. Remains 54 /126 variables (removed 72) and now considering 92/248 (removed 156) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 54/126 places, 92/248 transitions.
[2024-05-23 19:09:27] [INFO ] Flatten gal took : 4 ms
[2024-05-23 19:09:27] [INFO ] Flatten gal took : 4 ms
[2024-05-23 19:09:27] [INFO ] Input system was already deterministic with 92 transitions.
Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 248/248 transitions.
Discarding 57 places :
Symmetric choice reduction at 0 with 57 rule applications. Total rules 57 place count 69 transition count 140
Iterating global reduction 0 with 57 rules applied. Total rules applied 114 place count 69 transition count 140
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 122 place count 61 transition count 124
Iterating global reduction 0 with 8 rules applied. Total rules applied 130 place count 61 transition count 124
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 139 place count 61 transition count 115
Applied a total of 139 rules in 3 ms. Remains 61 /126 variables (removed 65) and now considering 115/248 (removed 133) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 61/126 places, 115/248 transitions.
[2024-05-23 19:09:27] [INFO ] Flatten gal took : 5 ms
[2024-05-23 19:09:27] [INFO ] Flatten gal took : 6 ms
[2024-05-23 19:09:27] [INFO ] Input system was already deterministic with 115 transitions.
Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 248/248 transitions.
Discarding 58 places :
Symmetric choice reduction at 0 with 58 rule applications. Total rules 58 place count 68 transition count 138
Iterating global reduction 0 with 58 rules applied. Total rules applied 116 place count 68 transition count 138
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 126 place count 58 transition count 118
Iterating global reduction 0 with 10 rules applied. Total rules applied 136 place count 58 transition count 118
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 144 place count 58 transition count 110
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 146 place count 56 transition count 104
Iterating global reduction 1 with 2 rules applied. Total rules applied 148 place count 56 transition count 104
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 149 place count 55 transition count 102
Iterating global reduction 1 with 1 rules applied. Total rules applied 150 place count 55 transition count 102
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 153 place count 55 transition count 99
Applied a total of 153 rules in 3 ms. Remains 55 /126 variables (removed 71) and now considering 99/248 (removed 149) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 55/126 places, 99/248 transitions.
[2024-05-23 19:09:27] [INFO ] Flatten gal took : 5 ms
[2024-05-23 19:09:27] [INFO ] Flatten gal took : 4 ms
[2024-05-23 19:09:27] [INFO ] Input system was already deterministic with 99 transitions.
Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 248/248 transitions.
Discarding 57 places :
Symmetric choice reduction at 0 with 57 rule applications. Total rules 57 place count 69 transition count 140
Iterating global reduction 0 with 57 rules applied. Total rules applied 114 place count 69 transition count 140
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 123 place count 60 transition count 122
Iterating global reduction 0 with 9 rules applied. Total rules applied 132 place count 60 transition count 122
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 141 place count 60 transition count 113
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 142 place count 59 transition count 110
Iterating global reduction 1 with 1 rules applied. Total rules applied 143 place count 59 transition count 110
Applied a total of 143 rules in 2 ms. Remains 59 /126 variables (removed 67) and now considering 110/248 (removed 138) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 59/126 places, 110/248 transitions.
[2024-05-23 19:09:27] [INFO ] Flatten gal took : 5 ms
[2024-05-23 19:09:27] [INFO ] Flatten gal took : 5 ms
[2024-05-23 19:09:27] [INFO ] Input system was already deterministic with 110 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 126/126 places, 248/248 transitions.
Graph (trivial) has 170 edges and 126 vertex of which 6 / 126 are part of one of the 3 SCC in 1 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 57 places :
Symmetric choice reduction at 0 with 57 rule applications. Total rules 58 place count 65 transition count 136
Iterating global reduction 0 with 57 rules applied. Total rules applied 115 place count 65 transition count 136
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 124 place count 56 transition count 118
Iterating global reduction 0 with 9 rules applied. Total rules applied 133 place count 56 transition count 118
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 139 place count 56 transition count 112
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 142 place count 53 transition count 103
Iterating global reduction 1 with 3 rules applied. Total rules applied 145 place count 53 transition count 103
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 148 place count 50 transition count 97
Iterating global reduction 1 with 3 rules applied. Total rules applied 151 place count 50 transition count 97
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 160 place count 50 transition count 88
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 162 place count 50 transition count 86
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 164 place count 49 transition count 85
Applied a total of 164 rules in 12 ms. Remains 49 /126 variables (removed 77) and now considering 85/248 (removed 163) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 12 ms. Remains : 49/126 places, 85/248 transitions.
[2024-05-23 19:09:27] [INFO ] Flatten gal took : 4 ms
[2024-05-23 19:09:27] [INFO ] Flatten gal took : 4 ms
[2024-05-23 19:09:27] [INFO ] Input system was already deterministic with 85 transitions.
Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 248/248 transitions.
Discarding 57 places :
Symmetric choice reduction at 0 with 57 rule applications. Total rules 57 place count 69 transition count 140
Iterating global reduction 0 with 57 rules applied. Total rules applied 114 place count 69 transition count 140
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 123 place count 60 transition count 122
Iterating global reduction 0 with 9 rules applied. Total rules applied 132 place count 60 transition count 122
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 137 place count 60 transition count 117
Applied a total of 137 rules in 2 ms. Remains 60 /126 variables (removed 66) and now considering 117/248 (removed 131) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 60/126 places, 117/248 transitions.
[2024-05-23 19:09:27] [INFO ] Flatten gal took : 5 ms
[2024-05-23 19:09:27] [INFO ] Flatten gal took : 6 ms
[2024-05-23 19:09:27] [INFO ] Input system was already deterministic with 117 transitions.
Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 248/248 transitions.
Discarding 52 places :
Symmetric choice reduction at 0 with 52 rule applications. Total rules 52 place count 74 transition count 148
Iterating global reduction 0 with 52 rules applied. Total rules applied 104 place count 74 transition count 148
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 112 place count 66 transition count 132
Iterating global reduction 0 with 8 rules applied. Total rules applied 120 place count 66 transition count 132
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 122 place count 66 transition count 130
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 124 place count 64 transition count 124
Iterating global reduction 1 with 2 rules applied. Total rules applied 126 place count 64 transition count 124
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 128 place count 62 transition count 120
Iterating global reduction 1 with 2 rules applied. Total rules applied 130 place count 62 transition count 120
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 135 place count 62 transition count 115
Applied a total of 135 rules in 3 ms. Remains 62 /126 variables (removed 64) and now considering 115/248 (removed 133) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 62/126 places, 115/248 transitions.
[2024-05-23 19:09:27] [INFO ] Flatten gal took : 4 ms
[2024-05-23 19:09:27] [INFO ] Flatten gal took : 4 ms
[2024-05-23 19:09:27] [INFO ] Input system was already deterministic with 115 transitions.
Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 248/248 transitions.
Discarding 56 places :
Symmetric choice reduction at 0 with 56 rule applications. Total rules 56 place count 70 transition count 142
Iterating global reduction 0 with 56 rules applied. Total rules applied 112 place count 70 transition count 142
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 121 place count 61 transition count 124
Iterating global reduction 0 with 9 rules applied. Total rules applied 130 place count 61 transition count 124
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 139 place count 61 transition count 115
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 141 place count 59 transition count 109
Iterating global reduction 1 with 2 rules applied. Total rules applied 143 place count 59 transition count 109
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 145 place count 57 transition count 105
Iterating global reduction 1 with 2 rules applied. Total rules applied 147 place count 57 transition count 105
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 153 place count 57 transition count 99
Applied a total of 153 rules in 2 ms. Remains 57 /126 variables (removed 69) and now considering 99/248 (removed 149) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 57/126 places, 99/248 transitions.
[2024-05-23 19:09:27] [INFO ] Flatten gal took : 4 ms
[2024-05-23 19:09:27] [INFO ] Flatten gal took : 4 ms
[2024-05-23 19:09:27] [INFO ] Input system was already deterministic with 99 transitions.
[2024-05-23 19:09:27] [INFO ] Flatten gal took : 8 ms
[2024-05-23 19:09:27] [INFO ] Flatten gal took : 9 ms
[2024-05-23 19:09:27] [INFO ] Export to MCC of 13 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 3 ms.
[2024-05-23 19:09:27] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 126 places, 248 transitions and 712 arcs took 2 ms.
Total runtime 74776 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running HealthRecord-PT-15

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/411/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 126
TRANSITIONS: 248
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.005s, Sys 0.000s]


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


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

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

Process ID: 1376
MODEL NAME: /home/mcc/execution/411/model
126 places, 248 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA HealthRecord-PT-15-CTLCardinality-2024-05 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA HealthRecord-PT-15-CTLCardinality-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA HealthRecord-PT-15-CTLCardinality-2024-07 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA HealthRecord-PT-15-CTLCardinality-2024-09 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA HealthRecord-PT-15-CTLCardinality-2024-08 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA HealthRecord-PT-15-CTLCardinality-2024-11 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA HealthRecord-PT-15-CTLCardinality-2024-10 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA HealthRecord-PT-15-CTLCardinality-2023-12 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA HealthRecord-PT-15-CTLCardinality-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA HealthRecord-PT-15-CTLCardinality-2023-15 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA HealthRecord-PT-15-CTLCardinality-2023-13 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA HealthRecord-PT-15-CTLCardinality-2024-04 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA HealthRecord-PT-15-CTLCardinality-2023-14 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716491385649

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

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="HealthRecord-PT-15"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is HealthRecord-PT-15, 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 r179-tall-171640602400809"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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