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-171640602200737.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-06, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r179-tall-171640602200737
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 520K
-rw-r--r-- 1 mcc users 6.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 37K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K 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.2K Apr 22 14:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 22 14:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 20:45 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 141K Apr 12 20:45 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.5K Apr 12 20:43 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 75K Apr 12 20:43 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 67K May 18 16:42 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME HealthRecord-PT-06-CTLCardinality-2024-00
FORMULA_NAME HealthRecord-PT-06-CTLCardinality-2024-01
FORMULA_NAME HealthRecord-PT-06-CTLCardinality-2024-02
FORMULA_NAME HealthRecord-PT-06-CTLCardinality-2024-03
FORMULA_NAME HealthRecord-PT-06-CTLCardinality-2024-04
FORMULA_NAME HealthRecord-PT-06-CTLCardinality-2024-05
FORMULA_NAME HealthRecord-PT-06-CTLCardinality-2024-06
FORMULA_NAME HealthRecord-PT-06-CTLCardinality-2024-07
FORMULA_NAME HealthRecord-PT-06-CTLCardinality-2024-08
FORMULA_NAME HealthRecord-PT-06-CTLCardinality-2024-09
FORMULA_NAME HealthRecord-PT-06-CTLCardinality-2024-10
FORMULA_NAME HealthRecord-PT-06-CTLCardinality-2024-11
FORMULA_NAME HealthRecord-PT-06-CTLCardinality-2023-12
FORMULA_NAME HealthRecord-PT-06-CTLCardinality-2023-13
FORMULA_NAME HealthRecord-PT-06-CTLCardinality-2023-14
FORMULA_NAME HealthRecord-PT-06-CTLCardinality-2023-15

=== Now, execution of the tool begins

BK_START 1716490482223

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-06
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-23 18:54:43] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-23 18:54:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 18:54:43] [INFO ] Load time of PNML (sax parser for PT used): 72 ms
[2024-05-23 18:54:43] [INFO ] Transformed 154 places.
[2024-05-23 18:54:43] [INFO ] Transformed 319 transitions.
[2024-05-23 18:54:43] [INFO ] Found NUPN structural information;
[2024-05-23 18:54:43] [INFO ] Parsed PT model containing 154 places and 319 transitions and 835 arcs in 169 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 15 ms.
Ensure Unique test removed 25 transitions
Reduce redundant transitions removed 25 transitions.
FORMULA HealthRecord-PT-06-CTLCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 90 out of 154 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 154/154 places, 294/294 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 126 transition count 241
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 126 transition count 241
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 57 place count 125 transition count 239
Iterating global reduction 0 with 1 rules applied. Total rules applied 58 place count 125 transition count 239
Applied a total of 58 rules in 25 ms. Remains 125 /154 variables (removed 29) and now considering 239/294 (removed 55) transitions.
[2024-05-23 18:54:43] [INFO ] Flow matrix only has 230 transitions (discarded 9 similar events)
// Phase 1: matrix 230 rows 125 cols
[2024-05-23 18:54:43] [INFO ] Computed 15 invariants in 12 ms
[2024-05-23 18:54:43] [INFO ] Implicit Places using invariants in 214 ms returned []
[2024-05-23 18:54:43] [INFO ] Flow matrix only has 230 transitions (discarded 9 similar events)
[2024-05-23 18:54:43] [INFO ] Invariant cache hit.
[2024-05-23 18:54:44] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-23 18:54:44] [INFO ] Implicit Places using invariants and state equation in 153 ms returned []
Implicit Place search using SMT with State Equation took 399 ms to find 0 implicit places.
Running 238 sub problems to find dead transitions.
[2024-05-23 18:54:44] [INFO ] Flow matrix only has 230 transitions (discarded 9 similar events)
[2024-05-23 18:54:44] [INFO ] Invariant cache hit.
[2024-05-23 18:54:44] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 1 (OVERLAPS) 1/125 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-05-23 18:54:45] [INFO ] Deduced a trap composed of 10 places in 75 ms of which 12 ms to minimize.
[2024-05-23 18:54:45] [INFO ] Deduced a trap composed of 35 places in 50 ms of which 1 ms to minimize.
[2024-05-23 18:54:45] [INFO ] Deduced a trap composed of 36 places in 46 ms of which 1 ms to minimize.
[2024-05-23 18:54:45] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 1 ms to minimize.
[2024-05-23 18:54:45] [INFO ] Deduced a trap composed of 35 places in 44 ms of which 1 ms to minimize.
[2024-05-23 18:54:45] [INFO ] Deduced a trap composed of 36 places in 45 ms of which 1 ms to minimize.
[2024-05-23 18:54:45] [INFO ] Deduced a trap composed of 35 places in 43 ms of which 1 ms to minimize.
[2024-05-23 18:54:45] [INFO ] Deduced a trap composed of 39 places in 44 ms of which 2 ms to minimize.
[2024-05-23 18:54:45] [INFO ] Deduced a trap composed of 33 places in 40 ms of which 1 ms to minimize.
[2024-05-23 18:54:45] [INFO ] Deduced a trap composed of 33 places in 37 ms of which 1 ms to minimize.
[2024-05-23 18:54:46] [INFO ] Deduced a trap composed of 36 places in 39 ms of which 1 ms to minimize.
[2024-05-23 18:54:46] [INFO ] Deduced a trap composed of 34 places in 38 ms of which 1 ms to minimize.
[2024-05-23 18:54:46] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 0 ms to minimize.
[2024-05-23 18:54:46] [INFO ] Deduced a trap composed of 32 places in 34 ms of which 1 ms to minimize.
[2024-05-23 18:54:46] [INFO ] Deduced a trap composed of 35 places in 38 ms of which 1 ms to minimize.
[2024-05-23 18:54:46] [INFO ] Deduced a trap composed of 37 places in 41 ms of which 1 ms to minimize.
[2024-05-23 18:54:46] [INFO ] Deduced a trap composed of 34 places in 44 ms of which 2 ms to minimize.
[2024-05-23 18:54:46] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 1 ms to minimize.
[2024-05-23 18:54:46] [INFO ] Deduced a trap composed of 34 places in 33 ms of which 1 ms to minimize.
[2024-05-23 18:54:46] [INFO ] Deduced a trap composed of 34 places in 34 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 20/35 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-05-23 18:54:47] [INFO ] Deduced a trap composed of 37 places in 58 ms of which 1 ms to minimize.
[2024-05-23 18:54:47] [INFO ] Deduced a trap composed of 30 places in 50 ms of which 1 ms to minimize.
[2024-05-23 18:54:47] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 1 ms to minimize.
[2024-05-23 18:54:47] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 1 ms to minimize.
[2024-05-23 18:54:47] [INFO ] Deduced a trap composed of 32 places in 42 ms of which 1 ms to minimize.
[2024-05-23 18:54:47] [INFO ] Deduced a trap composed of 31 places in 44 ms of which 1 ms to minimize.
[2024-05-23 18:54:47] [INFO ] Deduced a trap composed of 34 places in 45 ms of which 1 ms to minimize.
[2024-05-23 18:54:47] [INFO ] Deduced a trap composed of 36 places in 35 ms of which 1 ms to minimize.
[2024-05-23 18:54:47] [INFO ] Deduced a trap composed of 36 places in 40 ms of which 1 ms to minimize.
[2024-05-23 18:54:47] [INFO ] Deduced a trap composed of 39 places in 45 ms of which 1 ms to minimize.
[2024-05-23 18:54:47] [INFO ] Deduced a trap composed of 29 places in 31 ms of which 1 ms to minimize.
[2024-05-23 18:54:47] [INFO ] Deduced a trap composed of 30 places in 30 ms of which 1 ms to minimize.
[2024-05-23 18:54:47] [INFO ] Deduced a trap composed of 35 places in 45 ms of which 0 ms to minimize.
[2024-05-23 18:54:47] [INFO ] Deduced a trap composed of 37 places in 41 ms of which 1 ms to minimize.
[2024-05-23 18:54:47] [INFO ] Deduced a trap composed of 35 places in 50 ms of which 4 ms to minimize.
[2024-05-23 18:54:47] [INFO ] Deduced a trap composed of 35 places in 37 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 16/51 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-05-23 18:54:48] [INFO ] Deduced a trap composed of 35 places in 48 ms of which 2 ms to minimize.
[2024-05-23 18:54:48] [INFO ] Deduced a trap composed of 35 places in 35 ms of which 1 ms to minimize.
[2024-05-23 18:54:48] [INFO ] Deduced a trap composed of 35 places in 38 ms of which 1 ms to minimize.
[2024-05-23 18:54:48] [INFO ] Deduced a trap composed of 33 places in 52 ms of which 1 ms to minimize.
[2024-05-23 18:54:48] [INFO ] Deduced a trap composed of 37 places in 40 ms of which 1 ms to minimize.
[2024-05-23 18:54:48] [INFO ] Deduced a trap composed of 31 places in 41 ms of which 1 ms to minimize.
[2024-05-23 18:54:48] [INFO ] Deduced a trap composed of 33 places in 44 ms of which 1 ms to minimize.
[2024-05-23 18:54:49] [INFO ] Deduced a trap composed of 38 places in 39 ms of which 1 ms to minimize.
[2024-05-23 18:54:49] [INFO ] Deduced a trap composed of 34 places in 43 ms of which 0 ms to minimize.
[2024-05-23 18:54:49] [INFO ] Deduced a trap composed of 36 places in 50 ms of which 1 ms to minimize.
[2024-05-23 18:54:49] [INFO ] Deduced a trap composed of 33 places in 47 ms of which 1 ms to minimize.
[2024-05-23 18:54:49] [INFO ] Deduced a trap composed of 33 places in 44 ms of which 1 ms to minimize.
[2024-05-23 18:54:49] [INFO ] Deduced a trap composed of 33 places in 36 ms of which 1 ms to minimize.
[2024-05-23 18:54:49] [INFO ] Deduced a trap composed of 32 places in 38 ms of which 1 ms to minimize.
[2024-05-23 18:54:49] [INFO ] Deduced a trap composed of 33 places in 45 ms of which 2 ms to minimize.
[2024-05-23 18:54:49] [INFO ] Deduced a trap composed of 35 places in 47 ms of which 1 ms to minimize.
[2024-05-23 18:54:50] [INFO ] Deduced a trap composed of 30 places in 43 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 17/68 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-05-23 18:54:50] [INFO ] Deduced a trap composed of 32 places in 44 ms of which 2 ms to minimize.
[2024-05-23 18:54:50] [INFO ] Deduced a trap composed of 29 places in 39 ms of which 1 ms to minimize.
[2024-05-23 18:54:50] [INFO ] Deduced a trap composed of 29 places in 35 ms of which 2 ms to minimize.
[2024-05-23 18:54:50] [INFO ] Deduced a trap composed of 33 places in 46 ms of which 1 ms to minimize.
[2024-05-23 18:54:50] [INFO ] Deduced a trap composed of 33 places in 43 ms of which 1 ms to minimize.
[2024-05-23 18:54:50] [INFO ] Deduced a trap composed of 28 places in 40 ms of which 1 ms to minimize.
[2024-05-23 18:54:50] [INFO ] Deduced a trap composed of 36 places in 45 ms of which 0 ms to minimize.
[2024-05-23 18:54:50] [INFO ] Deduced a trap composed of 36 places in 41 ms of which 1 ms to minimize.
[2024-05-23 18:54:50] [INFO ] Deduced a trap composed of 34 places in 39 ms of which 0 ms to minimize.
[2024-05-23 18:54:50] [INFO ] Deduced a trap composed of 33 places in 49 ms of which 1 ms to minimize.
[2024-05-23 18:54:50] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/125 variables, 11/79 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-05-23 18:54:52] [INFO ] Deduced a trap composed of 35 places in 49 ms of which 1 ms to minimize.
[2024-05-23 18:54:52] [INFO ] Deduced a trap composed of 33 places in 46 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/125 variables, 2/81 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-05-23 18:54:53] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
[2024-05-23 18:54:53] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 0 ms to minimize.
[2024-05-23 18:54:53] [INFO ] Deduced a trap composed of 24 places in 30 ms of which 1 ms to minimize.
[2024-05-23 18:54:53] [INFO ] Deduced a trap composed of 35 places in 57 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/125 variables, 4/85 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-05-23 18:54:53] [INFO ] Deduced a trap composed of 31 places in 43 ms of which 1 ms to minimize.
[2024-05-23 18:54:54] [INFO ] Deduced a trap composed of 34 places in 50 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/125 variables, 2/87 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-05-23 18:54:55] [INFO ] Deduced a trap composed of 30 places in 45 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/125 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-05-23 18:54:56] [INFO ] Deduced a trap composed of 29 places in 42 ms of which 0 ms to minimize.
[2024-05-23 18:54:56] [INFO ] Deduced a trap composed of 30 places in 40 ms of which 1 ms to minimize.
[2024-05-23 18:54:56] [INFO ] Deduced a trap composed of 37 places in 43 ms of which 1 ms to minimize.
[2024-05-23 18:54:56] [INFO ] Deduced a trap composed of 34 places in 39 ms of which 0 ms to minimize.
[2024-05-23 18:54:56] [INFO ] Deduced a trap composed of 32 places in 44 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/125 variables, 5/93 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/125 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 13 (OVERLAPS) 229/354 variables, 125/218 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-05-23 18:54:58] [INFO ] Deduced a trap composed of 31 places in 48 ms of which 1 ms to minimize.
[2024-05-23 18:54:58] [INFO ] Deduced a trap composed of 30 places in 39 ms of which 1 ms to minimize.
[2024-05-23 18:54:59] [INFO ] Deduced a trap composed of 30 places in 36 ms of which 1 ms to minimize.
[2024-05-23 18:54:59] [INFO ] Deduced a trap composed of 28 places in 48 ms of which 0 ms to minimize.
[2024-05-23 18:54:59] [INFO ] Deduced a trap composed of 29 places in 42 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/354 variables, 5/223 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/354 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 16 (OVERLAPS) 1/355 variables, 1/224 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/355 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 18 (OVERLAPS) 0/355 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 238 unsolved
No progress, stopping.
After SMT solving in domain Real declared 355/355 variables, and 224 constraints, problems are : Problem set: 0 solved, 238 unsolved in 22380 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 125/125 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 238/238 constraints, Known Traps: 83/83 constraints]
Escalating to Integer solving :Problem set: 0 solved, 238 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 1 (OVERLAPS) 1/125 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 83/98 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-05-23 18:55:07] [INFO ] Deduced a trap composed of 39 places in 43 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 1/99 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 6 (OVERLAPS) 229/354 variables, 125/224 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/354 variables, 238/462 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-05-23 18:55:09] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 1 ms to minimize.
[2024-05-23 18:55:10] [INFO ] Deduced a trap composed of 41 places in 50 ms of which 1 ms to minimize.
[2024-05-23 18:55:10] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/354 variables, 3/465 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-05-23 18:55:15] [INFO ] Deduced a trap composed of 40 places in 48 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/354 variables, 1/466 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-05-23 18:55:23] [INFO ] Deduced a trap composed of 43 places in 45 ms of which 1 ms to minimize.
[2024-05-23 18:55:23] [INFO ] Deduced a trap composed of 39 places in 49 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/354 variables, 2/468 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-05-23 18:55:26] [INFO ] Deduced a trap composed of 34 places in 58 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/354 variables, 1/469 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/354 variables, 0/469 constraints. Problems are: Problem set: 0 solved, 238 unsolved
SMT process timed out in 52535ms, After SMT, problems are : Problem set: 0 solved, 238 unsolved
Search for dead transitions found 0 dead transitions in 52552ms
Starting structural reductions in LTL mode, iteration 1 : 125/154 places, 239/294 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 52999 ms. Remains : 125/154 places, 239/294 transitions.
Support contains 90 out of 125 places after structural reductions.
[2024-05-23 18:55:36] [INFO ] Flatten gal took : 57 ms
[2024-05-23 18:55:36] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA HealthRecord-PT-06-CTLCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-23 18:55:36] [INFO ] Flatten gal took : 34 ms
[2024-05-23 18:55:36] [INFO ] Input system was already deterministic with 239 transitions.
Support contains 84 out of 125 places (down from 90) after GAL structural reductions.
RANDOM walk for 40000 steps (2018 resets) in 2020 ms. (19 steps per ms) remains 16/58 properties
BEST_FIRST walk for 4004 steps (20 resets) in 21 ms. (182 steps per ms) remains 15/16 properties
BEST_FIRST walk for 4003 steps (27 resets) in 10 ms. (363 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (27 resets) in 16 ms. (235 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (24 resets) in 24 ms. (160 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (26 resets) in 47 ms. (83 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (23 resets) in 32 ms. (121 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 35 ms. (111 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (25 resets) in 15 ms. (250 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (26 resets) in 17 ms. (222 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (23 resets) in 17 ms. (222 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (25 resets) in 30 ms. (129 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (22 resets) in 12 ms. (308 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (30 resets) in 10 ms. (363 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (24 resets) in 12 ms. (308 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (25 resets) in 12 ms. (307 steps per ms) remains 15/15 properties
[2024-05-23 18:55:37] [INFO ] Flow matrix only has 230 transitions (discarded 9 similar events)
[2024-05-23 18:55:37] [INFO ] Invariant cache hit.
[2024-05-23 18:55:37] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 56/84 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (OVERLAPS) 41/125 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (OVERLAPS) 229/354 variables, 125/140 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/354 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (OVERLAPS) 1/355 variables, 1/141 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/355 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 9 (OVERLAPS) 0/355 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Real declared 355/355 variables, and 141 constraints, problems are : Problem set: 0 solved, 15 unsolved in 473 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 125/125 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 15 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 56/84 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 15 unsolved
[2024-05-23 18:55:38] [INFO ] Deduced a trap composed of 34 places in 40 ms of which 0 ms to minimize.
[2024-05-23 18:55:38] [INFO ] Deduced a trap composed of 35 places in 168 ms of which 0 ms to minimize.
[2024-05-23 18:55:38] [INFO ] Deduced a trap composed of 33 places in 35 ms of which 0 ms to minimize.
[2024-05-23 18:55:38] [INFO ] Deduced a trap composed of 36 places in 27 ms of which 0 ms to minimize.
[2024-05-23 18:55:38] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 1 ms to minimize.
[2024-05-23 18:55:38] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
Problem AtomicPropp44 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 6/13 constraints. Problems are: Problem set: 1 solved, 14 unsolved
[2024-05-23 18:55:38] [INFO ] Deduced a trap composed of 42 places in 36 ms of which 1 ms to minimize.
[2024-05-23 18:55:38] [INFO ] Deduced a trap composed of 32 places in 39 ms of which 1 ms to minimize.
[2024-05-23 18:55:38] [INFO ] Deduced a trap composed of 31 places in 41 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/84 variables, 3/16 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/84 variables, 0/16 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 5 (OVERLAPS) 41/125 variables, 8/24 constraints. Problems are: Problem set: 1 solved, 14 unsolved
[2024-05-23 18:55:39] [INFO ] Deduced a trap composed of 18 places in 53 ms of which 0 ms to minimize.
[2024-05-23 18:55:39] [INFO ] Deduced a trap composed of 40 places in 46 ms of which 1 ms to minimize.
[2024-05-23 18:55:39] [INFO ] Deduced a trap composed of 36 places in 43 ms of which 1 ms to minimize.
[2024-05-23 18:55:39] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 0 ms to minimize.
[2024-05-23 18:55:39] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 1 ms to minimize.
[2024-05-23 18:55:39] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 1 ms to minimize.
[2024-05-23 18:55:39] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 1 ms to minimize.
[2024-05-23 18:55:39] [INFO ] Deduced a trap composed of 33 places in 45 ms of which 1 ms to minimize.
[2024-05-23 18:55:39] [INFO ] Deduced a trap composed of 41 places in 44 ms of which 1 ms to minimize.
[2024-05-23 18:55:39] [INFO ] Deduced a trap composed of 42 places in 45 ms of which 0 ms to minimize.
[2024-05-23 18:55:39] [INFO ] Deduced a trap composed of 34 places in 43 ms of which 1 ms to minimize.
[2024-05-23 18:55:39] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 1 ms to minimize.
[2024-05-23 18:55:39] [INFO ] Deduced a trap composed of 39 places in 43 ms of which 1 ms to minimize.
[2024-05-23 18:55:39] [INFO ] Deduced a trap composed of 36 places in 45 ms of which 1 ms to minimize.
[2024-05-23 18:55:39] [INFO ] Deduced a trap composed of 34 places in 51 ms of which 1 ms to minimize.
[2024-05-23 18:55:39] [INFO ] Deduced a trap composed of 40 places in 53 ms of which 1 ms to minimize.
[2024-05-23 18:55:39] [INFO ] Deduced a trap composed of 34 places in 54 ms of which 1 ms to minimize.
[2024-05-23 18:55:39] [INFO ] Deduced a trap composed of 34 places in 46 ms of which 1 ms to minimize.
[2024-05-23 18:55:39] [INFO ] Deduced a trap composed of 41 places in 52 ms of which 1 ms to minimize.
[2024-05-23 18:55:40] [INFO ] Deduced a trap composed of 41 places in 50 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/125 variables, 20/44 constraints. Problems are: Problem set: 1 solved, 14 unsolved
[2024-05-23 18:55:40] [INFO ] Deduced a trap composed of 33 places in 51 ms of which 1 ms to minimize.
[2024-05-23 18:55:40] [INFO ] Deduced a trap composed of 44 places in 53 ms of which 1 ms to minimize.
[2024-05-23 18:55:40] [INFO ] Deduced a trap composed of 39 places in 48 ms of which 1 ms to minimize.
[2024-05-23 18:55:40] [INFO ] Deduced a trap composed of 34 places in 46 ms of which 1 ms to minimize.
[2024-05-23 18:55:40] [INFO ] Deduced a trap composed of 36 places in 50 ms of which 1 ms to minimize.
[2024-05-23 18:55:40] [INFO ] Deduced a trap composed of 32 places in 50 ms of which 1 ms to minimize.
[2024-05-23 18:55:40] [INFO ] Deduced a trap composed of 34 places in 46 ms of which 1 ms to minimize.
[2024-05-23 18:55:40] [INFO ] Deduced a trap composed of 32 places in 40 ms of which 1 ms to minimize.
[2024-05-23 18:55:40] [INFO ] Deduced a trap composed of 32 places in 47 ms of which 1 ms to minimize.
[2024-05-23 18:55:40] [INFO ] Deduced a trap composed of 37 places in 45 ms of which 1 ms to minimize.
[2024-05-23 18:55:40] [INFO ] Deduced a trap composed of 35 places in 44 ms of which 1 ms to minimize.
[2024-05-23 18:55:40] [INFO ] Deduced a trap composed of 35 places in 34 ms of which 1 ms to minimize.
[2024-05-23 18:55:40] [INFO ] Deduced a trap composed of 37 places in 44 ms of which 1 ms to minimize.
[2024-05-23 18:55:40] [INFO ] Deduced a trap composed of 38 places in 44 ms of which 1 ms to minimize.
[2024-05-23 18:55:40] [INFO ] Deduced a trap composed of 36 places in 42 ms of which 0 ms to minimize.
[2024-05-23 18:55:40] [INFO ] Deduced a trap composed of 38 places in 45 ms of which 1 ms to minimize.
[2024-05-23 18:55:40] [INFO ] Deduced a trap composed of 38 places in 45 ms of which 1 ms to minimize.
[2024-05-23 18:55:40] [INFO ] Deduced a trap composed of 37 places in 46 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/125 variables, 18/62 constraints. Problems are: Problem set: 1 solved, 14 unsolved
[2024-05-23 18:55:41] [INFO ] Deduced a trap composed of 40 places in 56 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/125 variables, 1/63 constraints. Problems are: Problem set: 1 solved, 14 unsolved
[2024-05-23 18:55:41] [INFO ] Deduced a trap composed of 34 places in 43 ms of which 1 ms to minimize.
[2024-05-23 18:55:41] [INFO ] Deduced a trap composed of 34 places in 42 ms of which 1 ms to minimize.
[2024-05-23 18:55:41] [INFO ] Deduced a trap composed of 36 places in 55 ms of which 1 ms to minimize.
[2024-05-23 18:55:41] [INFO ] Deduced a trap composed of 34 places in 50 ms of which 1 ms to minimize.
[2024-05-23 18:55:41] [INFO ] Deduced a trap composed of 37 places in 48 ms of which 1 ms to minimize.
[2024-05-23 18:55:41] [INFO ] Deduced a trap composed of 36 places in 40 ms of which 1 ms to minimize.
[2024-05-23 18:55:41] [INFO ] Deduced a trap composed of 35 places in 40 ms of which 0 ms to minimize.
[2024-05-23 18:55:41] [INFO ] Deduced a trap composed of 29 places in 41 ms of which 1 ms to minimize.
[2024-05-23 18:55:41] [INFO ] Deduced a trap composed of 29 places in 41 ms of which 1 ms to minimize.
[2024-05-23 18:55:41] [INFO ] Deduced a trap composed of 36 places in 51 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/125 variables, 10/73 constraints. Problems are: Problem set: 1 solved, 14 unsolved
[2024-05-23 18:55:41] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/125 variables, 1/74 constraints. Problems are: Problem set: 1 solved, 14 unsolved
[2024-05-23 18:55:41] [INFO ] Deduced a trap composed of 35 places in 51 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/125 variables, 1/75 constraints. Problems are: Problem set: 1 solved, 14 unsolved
[2024-05-23 18:55:41] [INFO ] Deduced a trap composed of 35 places in 52 ms of which 0 ms to minimize.
[2024-05-23 18:55:41] [INFO ] Deduced a trap composed of 36 places in 45 ms of which 1 ms to minimize.
[2024-05-23 18:55:42] [INFO ] Deduced a trap composed of 34 places in 38 ms of which 1 ms to minimize.
[2024-05-23 18:55:42] [INFO ] Deduced a trap composed of 37 places in 38 ms of which 0 ms to minimize.
[2024-05-23 18:55:42] [INFO ] Deduced a trap composed of 36 places in 41 ms of which 1 ms to minimize.
[2024-05-23 18:55:42] [INFO ] Deduced a trap composed of 36 places in 46 ms of which 1 ms to minimize.
[2024-05-23 18:55:42] [INFO ] Deduced a trap composed of 35 places in 33 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/125 variables, 7/82 constraints. Problems are: Problem set: 1 solved, 14 unsolved
[2024-05-23 18:55:42] [INFO ] Deduced a trap composed of 37 places in 51 ms of which 1 ms to minimize.
[2024-05-23 18:55:42] [INFO ] Deduced a trap composed of 33 places in 54 ms of which 1 ms to minimize.
[2024-05-23 18:55:42] [INFO ] Deduced a trap composed of 36 places in 49 ms of which 1 ms to minimize.
[2024-05-23 18:55:42] [INFO ] Deduced a trap composed of 35 places in 61 ms of which 1 ms to minimize.
[2024-05-23 18:55:42] [INFO ] Deduced a trap composed of 40 places in 51 ms of which 1 ms to minimize.
[2024-05-23 18:55:42] [INFO ] Deduced a trap composed of 34 places in 48 ms of which 1 ms to minimize.
[2024-05-23 18:55:42] [INFO ] Deduced a trap composed of 36 places in 50 ms of which 1 ms to minimize.
[2024-05-23 18:55:42] [INFO ] Deduced a trap composed of 35 places in 50 ms of which 1 ms to minimize.
[2024-05-23 18:55:42] [INFO ] Deduced a trap composed of 33 places in 58 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/125 variables, 9/91 constraints. Problems are: Problem set: 1 solved, 14 unsolved
[2024-05-23 18:55:42] [INFO ] Deduced a trap composed of 40 places in 55 ms of which 1 ms to minimize.
[2024-05-23 18:55:42] [INFO ] Deduced a trap composed of 40 places in 47 ms of which 1 ms to minimize.
[2024-05-23 18:55:43] [INFO ] Deduced a trap composed of 37 places in 44 ms of which 1 ms to minimize.
[2024-05-23 18:55:43] [INFO ] Deduced a trap composed of 37 places in 47 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/125 variables, 4/95 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/125 variables, 0/95 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 16 (OVERLAPS) 229/354 variables, 125/220 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/354 variables, 14/234 constraints. Problems are: Problem set: 1 solved, 14 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 354/355 variables, and 234 constraints, problems are : Problem set: 1 solved, 14 unsolved in 5008 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 125/125 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 14/15 constraints, Known Traps: 80/80 constraints]
After SMT, in 5495ms problems are : Problem set: 1 solved, 14 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 26 out of 125 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 125/125 places, 239/239 transitions.
Graph (trivial) has 105 edges and 125 vertex of which 8 / 125 are part of one of the 4 SCC in 5 ms
Free SCC test removed 4 places
Drop transitions (Empty/Sink Transition effects.) removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Graph (complete) has 511 edges and 121 vertex of which 115 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 5 place count 115 transition count 218
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 8 rules applied. Total rules applied 13 place count 112 transition count 213
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 16 place count 110 transition count 212
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 16 place count 110 transition count 211
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 18 place count 109 transition count 211
Discarding 35 places :
Symmetric choice reduction at 3 with 35 rule applications. Total rules 53 place count 74 transition count 141
Iterating global reduction 3 with 35 rules applied. Total rules applied 88 place count 74 transition count 141
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 95 place count 67 transition count 127
Iterating global reduction 3 with 7 rules applied. Total rules applied 102 place count 67 transition count 127
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 107 place count 67 transition count 122
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -31
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 115 place count 63 transition count 153
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 4 with 5 rules applied. Total rules applied 120 place count 63 transition count 148
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 121 place count 63 transition count 147
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 122 place count 62 transition count 147
Applied a total of 122 rules in 98 ms. Remains 62 /125 variables (removed 63) and now considering 147/239 (removed 92) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 98 ms. Remains : 62/125 places, 147/239 transitions.
RANDOM walk for 40000 steps (8 resets) in 514 ms. (77 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (8 resets) in 229 ms. (173 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40000 steps (8 resets) in 212 ms. (187 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40000 steps (8 resets) in 215 ms. (185 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40000 steps (8 resets) in 244 ms. (163 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40000 steps (8 resets) in 191 ms. (208 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40000 steps (8 resets) in 218 ms. (182 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (8 resets) in 75 ms. (526 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40000 steps (8 resets) in 171 ms. (232 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40001 steps (8 resets) in 156 ms. (254 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40000 steps (8 resets) in 133 ms. (298 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40000 steps (8 resets) in 125 ms. (317 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40000 steps (8 resets) in 146 ms. (272 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40000 steps (8 resets) in 152 ms. (261 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40000 steps (8 resets) in 129 ms. (307 steps per ms) remains 14/14 properties
Finished probabilistic random walk after 1439935 steps, run visited all 14 properties in 2142 ms. (steps per millisecond=672 )
Probabilistic random walk after 1439935 steps, saw 167494 distinct states, run finished after 2147 ms. (steps per millisecond=670 ) properties seen :14
Successfully simplified 1 atomic propositions for a total of 14 simplifications.
[2024-05-23 18:55:46] [INFO ] Flatten gal took : 12 ms
[2024-05-23 18:55:46] [INFO ] Flatten gal took : 11 ms
[2024-05-23 18:55:46] [INFO ] Input system was already deterministic with 239 transitions.
Computed a total of 12 stabilizing places and 21 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 125/125 places, 239/239 transitions.
Discarding 54 places :
Symmetric choice reduction at 0 with 54 rule applications. Total rules 54 place count 71 transition count 135
Iterating global reduction 0 with 54 rules applied. Total rules applied 108 place count 71 transition count 135
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 114 place count 65 transition count 123
Iterating global reduction 0 with 6 rules applied. Total rules applied 120 place count 65 transition count 123
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 65 transition count 121
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 123 place count 64 transition count 118
Iterating global reduction 1 with 1 rules applied. Total rules applied 124 place count 64 transition count 118
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 125 place count 63 transition count 116
Iterating global reduction 1 with 1 rules applied. Total rules applied 126 place count 63 transition count 116
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 129 place count 63 transition count 113
Applied a total of 129 rules in 7 ms. Remains 63 /125 variables (removed 62) and now considering 113/239 (removed 126) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 63/125 places, 113/239 transitions.
[2024-05-23 18:55:46] [INFO ] Flatten gal took : 6 ms
[2024-05-23 18:55:46] [INFO ] Flatten gal took : 6 ms
[2024-05-23 18:55:46] [INFO ] Input system was already deterministic with 113 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 125/125 places, 239/239 transitions.
Graph (trivial) has 126 edges and 125 vertex of which 12 / 125 are part of one of the 6 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Discarding 49 places :
Symmetric choice reduction at 0 with 49 rule applications. Total rules 50 place count 70 transition count 141
Iterating global reduction 0 with 49 rules applied. Total rules applied 99 place count 70 transition count 141
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 108 place count 61 transition count 123
Iterating global reduction 0 with 9 rules applied. Total rules applied 117 place count 61 transition count 123
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 123 place count 61 transition count 117
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 126 place count 58 transition count 108
Iterating global reduction 1 with 3 rules applied. Total rules applied 129 place count 58 transition count 108
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 131 place count 56 transition count 104
Iterating global reduction 1 with 2 rules applied. Total rules applied 133 place count 56 transition count 104
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 138 place count 56 transition count 99
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 2 with 5 rules applied. Total rules applied 143 place count 56 transition count 94
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 153 place count 51 transition count 89
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 154 place count 51 transition count 89
Applied a total of 154 rules in 24 ms. Remains 51 /125 variables (removed 74) and now considering 89/239 (removed 150) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 24 ms. Remains : 51/125 places, 89/239 transitions.
[2024-05-23 18:55:46] [INFO ] Flatten gal took : 4 ms
[2024-05-23 18:55:46] [INFO ] Flatten gal took : 4 ms
[2024-05-23 18:55:46] [INFO ] Input system was already deterministic with 89 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 125/125 places, 239/239 transitions.
Graph (trivial) has 181 edges and 125 vertex of which 14 / 125 are part of one of the 7 SCC in 0 ms
Free SCC test removed 7 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 55 places :
Symmetric choice reduction at 0 with 55 rule applications. Total rules 56 place count 62 transition count 127
Iterating global reduction 0 with 55 rules applied. Total rules applied 111 place count 62 transition count 127
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 120 place count 53 transition count 109
Iterating global reduction 0 with 9 rules applied. Total rules applied 129 place count 53 transition count 109
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 136 place count 53 transition count 102
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 139 place count 50 transition count 93
Iterating global reduction 1 with 3 rules applied. Total rules applied 142 place count 50 transition count 93
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 145 place count 47 transition count 87
Iterating global reduction 1 with 3 rules applied. Total rules applied 148 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 157 place count 47 transition count 78
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 2 with 6 rules applied. Total rules applied 163 place count 47 transition count 72
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 167 place count 45 transition count 70
Reduce places removed 4 places and 4 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 171 place count 41 transition count 66
Applied a total of 171 rules in 18 ms. Remains 41 /125 variables (removed 84) and now considering 66/239 (removed 173) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 18 ms. Remains : 41/125 places, 66/239 transitions.
[2024-05-23 18:55:46] [INFO ] Flatten gal took : 3 ms
[2024-05-23 18:55:46] [INFO ] Flatten gal took : 3 ms
[2024-05-23 18:55:46] [INFO ] Input system was already deterministic with 66 transitions.
Starting structural reductions in LTL mode, iteration 0 : 125/125 places, 239/239 transitions.
Discarding 59 places :
Symmetric choice reduction at 0 with 59 rule applications. Total rules 59 place count 66 transition count 127
Iterating global reduction 0 with 59 rules applied. Total rules applied 118 place count 66 transition count 127
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 126 place count 58 transition count 111
Iterating global reduction 0 with 8 rules applied. Total rules applied 134 place count 58 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 143 place count 58 transition count 102
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 144 place count 57 transition count 99
Iterating global reduction 1 with 1 rules applied. Total rules applied 145 place count 57 transition count 99
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 146 place count 56 transition count 97
Iterating global reduction 1 with 1 rules applied. Total rules applied 147 place count 56 transition count 97
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 150 place count 56 transition count 94
Applied a total of 150 rules in 5 ms. Remains 56 /125 variables (removed 69) and now considering 94/239 (removed 145) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 56/125 places, 94/239 transitions.
[2024-05-23 18:55:46] [INFO ] Flatten gal took : 5 ms
[2024-05-23 18:55:46] [INFO ] Flatten gal took : 5 ms
[2024-05-23 18:55:46] [INFO ] Input system was already deterministic with 94 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 125/125 places, 239/239 transitions.
Graph (trivial) has 177 edges and 125 vertex of which 14 / 125 are part of one of the 7 SCC in 0 ms
Free SCC test removed 7 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 53 places :
Symmetric choice reduction at 0 with 53 rule applications. Total rules 54 place count 64 transition count 131
Iterating global reduction 0 with 53 rules applied. Total rules applied 107 place count 64 transition count 131
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 116 place count 55 transition count 113
Iterating global reduction 0 with 9 rules applied. Total rules applied 125 place count 55 transition count 113
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 132 place count 55 transition count 106
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 134 place count 53 transition count 100
Iterating global reduction 1 with 2 rules applied. Total rules applied 136 place count 53 transition count 100
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 138 place count 51 transition count 96
Iterating global reduction 1 with 2 rules applied. Total rules applied 140 place count 51 transition count 96
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 146 place count 51 transition count 90
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 2 with 6 rules applied. Total rules applied 152 place count 51 transition count 84
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 156 place count 49 transition count 82
Reduce places removed 4 places and 4 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 160 place count 45 transition count 78
Applied a total of 160 rules in 17 ms. Remains 45 /125 variables (removed 80) and now considering 78/239 (removed 161) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 17 ms. Remains : 45/125 places, 78/239 transitions.
[2024-05-23 18:55:46] [INFO ] Flatten gal took : 3 ms
[2024-05-23 18:55:46] [INFO ] Flatten gal took : 4 ms
[2024-05-23 18:55:46] [INFO ] Input system was already deterministic with 78 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 125/125 places, 239/239 transitions.
Graph (trivial) has 181 edges and 125 vertex of which 14 / 125 are part of one of the 7 SCC in 0 ms
Free SCC test removed 7 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 55 places :
Symmetric choice reduction at 0 with 55 rule applications. Total rules 56 place count 62 transition count 127
Iterating global reduction 0 with 55 rules applied. Total rules applied 111 place count 62 transition count 127
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 121 place count 52 transition count 107
Iterating global reduction 0 with 10 rules applied. Total rules applied 131 place count 52 transition count 107
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 140 place count 52 transition count 98
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 143 place count 49 transition count 89
Iterating global reduction 1 with 3 rules applied. Total rules applied 146 place count 49 transition count 89
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 149 place count 46 transition count 83
Iterating global reduction 1 with 3 rules applied. Total rules applied 152 place count 46 transition count 83
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 161 place count 46 transition count 74
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 2 with 6 rules applied. Total rules applied 167 place count 46 transition count 68
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 171 place count 44 transition count 66
Reduce places removed 4 places and 4 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 175 place count 40 transition count 62
Applied a total of 175 rules in 12 ms. Remains 40 /125 variables (removed 85) and now considering 62/239 (removed 177) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 12 ms. Remains : 40/125 places, 62/239 transitions.
[2024-05-23 18:55:47] [INFO ] Flatten gal took : 3 ms
[2024-05-23 18:55:47] [INFO ] Flatten gal took : 3 ms
[2024-05-23 18:55:47] [INFO ] Input system was already deterministic with 62 transitions.
Starting structural reductions in LTL mode, iteration 0 : 125/125 places, 239/239 transitions.
Discarding 46 places :
Symmetric choice reduction at 0 with 46 rule applications. Total rules 46 place count 79 transition count 152
Iterating global reduction 0 with 46 rules applied. Total rules applied 92 place count 79 transition count 152
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 94 place count 77 transition count 148
Iterating global reduction 0 with 2 rules applied. Total rules applied 96 place count 77 transition count 148
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 97 place count 76 transition count 145
Iterating global reduction 0 with 1 rules applied. Total rules applied 98 place count 76 transition count 145
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 99 place count 75 transition count 143
Iterating global reduction 0 with 1 rules applied. Total rules applied 100 place count 75 transition count 143
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 103 place count 75 transition count 140
Applied a total of 103 rules in 3 ms. Remains 75 /125 variables (removed 50) and now considering 140/239 (removed 99) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 75/125 places, 140/239 transitions.
[2024-05-23 18:55:47] [INFO ] Flatten gal took : 5 ms
[2024-05-23 18:55:47] [INFO ] Flatten gal took : 5 ms
[2024-05-23 18:55:47] [INFO ] Input system was already deterministic with 140 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 125/125 places, 239/239 transitions.
Graph (trivial) has 169 edges and 125 vertex of which 12 / 125 are part of one of the 6 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Discarding 49 places :
Symmetric choice reduction at 0 with 49 rule applications. Total rules 50 place count 70 transition count 140
Iterating global reduction 0 with 49 rules applied. Total rules applied 99 place count 70 transition count 140
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 108 place count 61 transition count 122
Iterating global reduction 0 with 9 rules applied. Total rules applied 117 place count 61 transition count 122
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 125 place count 61 transition count 114
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 128 place count 58 transition count 105
Iterating global reduction 1 with 3 rules applied. Total rules applied 131 place count 58 transition count 105
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 134 place count 55 transition count 99
Iterating global reduction 1 with 3 rules applied. Total rules applied 137 place count 55 transition count 99
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 144 place count 55 transition count 92
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 2 with 6 rules applied. Total rules applied 150 place count 55 transition count 86
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 162 place count 49 transition count 80
Applied a total of 162 rules in 12 ms. Remains 49 /125 variables (removed 76) and now considering 80/239 (removed 159) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 12 ms. Remains : 49/125 places, 80/239 transitions.
[2024-05-23 18:55:47] [INFO ] Flatten gal took : 3 ms
[2024-05-23 18:55:47] [INFO ] Flatten gal took : 3 ms
[2024-05-23 18:55:47] [INFO ] Input system was already deterministic with 80 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 125/125 places, 239/239 transitions.
Graph (trivial) has 174 edges and 125 vertex of which 12 / 125 are part of one of the 6 SCC in 0 ms
Free SCC test removed 6 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Discarding 53 places :
Symmetric choice reduction at 0 with 53 rule applications. Total rules 54 place count 66 transition count 133
Iterating global reduction 0 with 53 rules applied. Total rules applied 107 place count 66 transition count 133
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 117 place count 56 transition count 113
Iterating global reduction 0 with 10 rules applied. Total rules applied 127 place count 56 transition count 113
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 135 place count 56 transition count 105
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 138 place count 53 transition count 96
Iterating global reduction 1 with 3 rules applied. Total rules applied 141 place count 53 transition count 96
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 144 place count 50 transition count 90
Iterating global reduction 1 with 3 rules applied. Total rules applied 147 place count 50 transition count 90
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 156 place count 50 transition count 81
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 2 with 5 rules applied. Total rules applied 161 place count 50 transition count 76
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 171 place count 45 transition count 71
Applied a total of 171 rules in 9 ms. Remains 45 /125 variables (removed 80) and now considering 71/239 (removed 168) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 9 ms. Remains : 45/125 places, 71/239 transitions.
[2024-05-23 18:55:47] [INFO ] Flatten gal took : 2 ms
[2024-05-23 18:55:47] [INFO ] Flatten gal took : 3 ms
[2024-05-23 18:55:47] [INFO ] Input system was already deterministic with 71 transitions.
Starting structural reductions in LTL mode, iteration 0 : 125/125 places, 239/239 transitions.
Discarding 48 places :
Symmetric choice reduction at 0 with 48 rule applications. Total rules 48 place count 77 transition count 147
Iterating global reduction 0 with 48 rules applied. Total rules applied 96 place count 77 transition count 147
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 103 place count 70 transition count 133
Iterating global reduction 0 with 7 rules applied. Total rules applied 110 place count 70 transition count 133
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 116 place count 70 transition count 127
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 117 place count 69 transition count 124
Iterating global reduction 1 with 1 rules applied. Total rules applied 118 place count 69 transition count 124
Applied a total of 118 rules in 2 ms. Remains 69 /125 variables (removed 56) and now considering 124/239 (removed 115) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 69/125 places, 124/239 transitions.
[2024-05-23 18:55:47] [INFO ] Flatten gal took : 5 ms
[2024-05-23 18:55:47] [INFO ] Flatten gal took : 5 ms
[2024-05-23 18:55:47] [INFO ] Input system was already deterministic with 124 transitions.
Starting structural reductions in LTL mode, iteration 0 : 125/125 places, 239/239 transitions.
Discarding 60 places :
Symmetric choice reduction at 0 with 60 rule applications. Total rules 60 place count 65 transition count 125
Iterating global reduction 0 with 60 rules applied. Total rules applied 120 place count 65 transition count 125
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 129 place count 56 transition count 107
Iterating global reduction 0 with 9 rules applied. Total rules applied 138 place count 56 transition count 107
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 147 place count 56 transition count 98
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 150 place count 53 transition count 89
Iterating global reduction 1 with 3 rules applied. Total rules applied 153 place count 53 transition count 89
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 156 place count 50 transition count 83
Iterating global reduction 1 with 3 rules applied. Total rules applied 159 place count 50 transition count 83
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 167 place count 50 transition count 75
Applied a total of 167 rules in 2 ms. Remains 50 /125 variables (removed 75) and now considering 75/239 (removed 164) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 50/125 places, 75/239 transitions.
[2024-05-23 18:55:47] [INFO ] Flatten gal took : 3 ms
[2024-05-23 18:55:47] [INFO ] Flatten gal took : 3 ms
[2024-05-23 18:55:47] [INFO ] Input system was already deterministic with 75 transitions.
Starting structural reductions in LTL mode, iteration 0 : 125/125 places, 239/239 transitions.
Discarding 61 places :
Symmetric choice reduction at 0 with 61 rule applications. Total rules 61 place count 64 transition count 123
Iterating global reduction 0 with 61 rules applied. Total rules applied 122 place count 64 transition count 123
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 130 place count 56 transition count 107
Iterating global reduction 0 with 8 rules applied. Total rules applied 138 place count 56 transition count 107
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 144 place count 56 transition count 101
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 147 place count 53 transition count 92
Iterating global reduction 1 with 3 rules applied. Total rules applied 150 place count 53 transition count 92
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 153 place count 50 transition count 86
Iterating global reduction 1 with 3 rules applied. Total rules applied 156 place count 50 transition count 86
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 165 place count 50 transition count 77
Applied a total of 165 rules in 3 ms. Remains 50 /125 variables (removed 75) and now considering 77/239 (removed 162) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 50/125 places, 77/239 transitions.
[2024-05-23 18:55:47] [INFO ] Flatten gal took : 5 ms
[2024-05-23 18:55:47] [INFO ] Flatten gal took : 3 ms
[2024-05-23 18:55:47] [INFO ] Input system was already deterministic with 77 transitions.
Starting structural reductions in LTL mode, iteration 0 : 125/125 places, 239/239 transitions.
Discarding 47 places :
Symmetric choice reduction at 0 with 47 rule applications. Total rules 47 place count 78 transition count 149
Iterating global reduction 0 with 47 rules applied. Total rules applied 94 place count 78 transition count 149
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 99 place count 73 transition count 139
Iterating global reduction 0 with 5 rules applied. Total rules applied 104 place count 73 transition count 139
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 110 place count 73 transition count 133
Applied a total of 110 rules in 2 ms. Remains 73 /125 variables (removed 52) and now considering 133/239 (removed 106) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 73/125 places, 133/239 transitions.
[2024-05-23 18:55:47] [INFO ] Flatten gal took : 5 ms
[2024-05-23 18:55:47] [INFO ] Flatten gal took : 5 ms
[2024-05-23 18:55:47] [INFO ] Input system was already deterministic with 133 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 125/125 places, 239/239 transitions.
Graph (trivial) has 181 edges and 125 vertex of which 14 / 125 are part of one of the 7 SCC in 1 ms
Free SCC test removed 7 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 55 places :
Symmetric choice reduction at 0 with 55 rule applications. Total rules 56 place count 62 transition count 127
Iterating global reduction 0 with 55 rules applied. Total rules applied 111 place count 62 transition count 127
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 121 place count 52 transition count 107
Iterating global reduction 0 with 10 rules applied. Total rules applied 131 place count 52 transition count 107
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 140 place count 52 transition count 98
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 143 place count 49 transition count 89
Iterating global reduction 1 with 3 rules applied. Total rules applied 146 place count 49 transition count 89
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 149 place count 46 transition count 83
Iterating global reduction 1 with 3 rules applied. Total rules applied 152 place count 46 transition count 83
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 161 place count 46 transition count 74
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 2 with 6 rules applied. Total rules applied 167 place count 46 transition count 68
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 171 place count 44 transition count 66
Reduce places removed 4 places and 4 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 175 place count 40 transition count 62
Applied a total of 175 rules in 10 ms. Remains 40 /125 variables (removed 85) and now considering 62/239 (removed 177) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 10 ms. Remains : 40/125 places, 62/239 transitions.
[2024-05-23 18:55:47] [INFO ] Flatten gal took : 3 ms
[2024-05-23 18:55:47] [INFO ] Flatten gal took : 2 ms
[2024-05-23 18:55:47] [INFO ] Input system was already deterministic with 62 transitions.
[2024-05-23 18:55:47] [INFO ] Flatten gal took : 7 ms
[2024-05-23 18:55:47] [INFO ] Flatten gal took : 7 ms
[2024-05-23 18:55:47] [INFO ] Export to MCC of 14 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 4 ms.
[2024-05-23 18:55:47] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 125 places, 239 transitions and 664 arcs took 3 ms.
Total runtime 63896 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running HealthRecord-PT-06

IS_COLORED=
IS_NUPN=

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


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


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

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

Process ID: 1070
MODEL NAME: /home/mcc/execution/412/model
125 places, 239 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-06-CTLCardinality-2024-05 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA HealthRecord-PT-06-CTLCardinality-2024-04 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA HealthRecord-PT-06-CTLCardinality-2024-03 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA HealthRecord-PT-06-CTLCardinality-2024-07 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA HealthRecord-PT-06-CTLCardinality-2024-06 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA HealthRecord-PT-06-CTLCardinality-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA HealthRecord-PT-06-CTLCardinality-2024-09 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA HealthRecord-PT-06-CTLCardinality-2023-12 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA HealthRecord-PT-06-CTLCardinality-2024-11 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA HealthRecord-PT-06-CTLCardinality-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA HealthRecord-PT-06-CTLCardinality-2023-13 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA HealthRecord-PT-06-CTLCardinality-2023-15 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA HealthRecord-PT-06-CTLCardinality-2023-14 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA HealthRecord-PT-06-CTLCardinality-2024-08 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716490568853

--------------------
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-06"
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-06, 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-171640602200737"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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