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.r355-tall-171683758700393.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 ShieldPPPs-PT-003B, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r355-tall-171683758700393
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 524K
-rw-r--r-- 1 mcc users 7.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K May 19 07:16 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 16:33 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 19 07:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 19 19:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 13 11:28 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 168K Apr 13 11:28 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Apr 13 11:27 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 55K Apr 13 11:27 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:53 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 52K May 18 16:43 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 ShieldPPPs-PT-003B-CTLCardinality-2024-00
FORMULA_NAME ShieldPPPs-PT-003B-CTLCardinality-2024-01
FORMULA_NAME ShieldPPPs-PT-003B-CTLCardinality-2024-02
FORMULA_NAME ShieldPPPs-PT-003B-CTLCardinality-2024-03
FORMULA_NAME ShieldPPPs-PT-003B-CTLCardinality-2024-04
FORMULA_NAME ShieldPPPs-PT-003B-CTLCardinality-2024-05
FORMULA_NAME ShieldPPPs-PT-003B-CTLCardinality-2024-06
FORMULA_NAME ShieldPPPs-PT-003B-CTLCardinality-2024-07
FORMULA_NAME ShieldPPPs-PT-003B-CTLCardinality-2024-08
FORMULA_NAME ShieldPPPs-PT-003B-CTLCardinality-2024-09
FORMULA_NAME ShieldPPPs-PT-003B-CTLCardinality-2024-10
FORMULA_NAME ShieldPPPs-PT-003B-CTLCardinality-2024-11
FORMULA_NAME ShieldPPPs-PT-003B-CTLCardinality-2023-12
FORMULA_NAME ShieldPPPs-PT-003B-CTLCardinality-2023-13
FORMULA_NAME ShieldPPPs-PT-003B-CTLCardinality-2023-14
FORMULA_NAME ShieldPPPs-PT-003B-CTLCardinality-2023-15

=== Now, execution of the tool begins

BK_START 1716955531163

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPs-PT-003B
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-29 04:05:32] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-29 04:05:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 04:05:32] [INFO ] Load time of PNML (sax parser for PT used): 73 ms
[2024-05-29 04:05:32] [INFO ] Transformed 207 places.
[2024-05-29 04:05:32] [INFO ] Transformed 192 transitions.
[2024-05-29 04:05:32] [INFO ] Found NUPN structural information;
[2024-05-29 04:05:32] [INFO ] Parsed PT model containing 207 places and 192 transitions and 528 arcs in 177 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 15 ms.
Support contains 91 out of 207 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 207/207 places, 192/192 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 200 transition count 185
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 200 transition count 185
Applied a total of 14 rules in 29 ms. Remains 200 /207 variables (removed 7) and now considering 185/192 (removed 7) transitions.
// Phase 1: matrix 185 rows 200 cols
[2024-05-29 04:05:32] [INFO ] Computed 34 invariants in 18 ms
[2024-05-29 04:05:32] [INFO ] Implicit Places using invariants in 279 ms returned []
[2024-05-29 04:05:32] [INFO ] Invariant cache hit.
[2024-05-29 04:05:33] [INFO ] Implicit Places using invariants and state equation in 139 ms returned []
Implicit Place search using SMT with State Equation took 446 ms to find 0 implicit places.
Running 184 sub problems to find dead transitions.
[2024-05-29 04:05:33] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/199 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 1 (OVERLAPS) 1/200 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 184 unsolved
[2024-05-29 04:05:34] [INFO ] Deduced a trap composed of 28 places in 69 ms of which 14 ms to minimize.
[2024-05-29 04:05:34] [INFO ] Deduced a trap composed of 30 places in 54 ms of which 2 ms to minimize.
[2024-05-29 04:05:35] [INFO ] Deduced a trap composed of 30 places in 37 ms of which 1 ms to minimize.
[2024-05-29 04:05:35] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
[2024-05-29 04:05:35] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 0 ms to minimize.
[2024-05-29 04:05:35] [INFO ] Deduced a trap composed of 22 places in 28 ms of which 1 ms to minimize.
[2024-05-29 04:05:35] [INFO ] Deduced a trap composed of 19 places in 23 ms of which 1 ms to minimize.
[2024-05-29 04:05:35] [INFO ] Deduced a trap composed of 21 places in 22 ms of which 1 ms to minimize.
[2024-05-29 04:05:35] [INFO ] Deduced a trap composed of 16 places in 23 ms of which 0 ms to minimize.
[2024-05-29 04:05:35] [INFO ] Deduced a trap composed of 18 places in 20 ms of which 1 ms to minimize.
[2024-05-29 04:05:35] [INFO ] Deduced a trap composed of 20 places in 18 ms of which 1 ms to minimize.
[2024-05-29 04:05:35] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 0 ms to minimize.
[2024-05-29 04:05:35] [INFO ] Deduced a trap composed of 28 places in 29 ms of which 1 ms to minimize.
[2024-05-29 04:05:35] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 1 ms to minimize.
[2024-05-29 04:05:35] [INFO ] Deduced a trap composed of 36 places in 27 ms of which 1 ms to minimize.
[2024-05-29 04:05:35] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 1 ms to minimize.
[2024-05-29 04:05:35] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 1 ms to minimize.
[2024-05-29 04:05:35] [INFO ] Deduced a trap composed of 29 places in 53 ms of which 2 ms to minimize.
[2024-05-29 04:05:35] [INFO ] Deduced a trap composed of 19 places in 48 ms of which 1 ms to minimize.
[2024-05-29 04:05:35] [INFO ] Deduced a trap composed of 30 places in 56 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/200 variables, 20/54 constraints. Problems are: Problem set: 0 solved, 184 unsolved
[2024-05-29 04:05:36] [INFO ] Deduced a trap composed of 26 places in 58 ms of which 2 ms to minimize.
[2024-05-29 04:05:36] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 1 ms to minimize.
[2024-05-29 04:05:36] [INFO ] Deduced a trap composed of 26 places in 37 ms of which 2 ms to minimize.
[2024-05-29 04:05:36] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
[2024-05-29 04:05:36] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 0 ms to minimize.
[2024-05-29 04:05:36] [INFO ] Deduced a trap composed of 19 places in 22 ms of which 0 ms to minimize.
[2024-05-29 04:05:36] [INFO ] Deduced a trap composed of 17 places in 21 ms of which 1 ms to minimize.
[2024-05-29 04:05:36] [INFO ] Deduced a trap composed of 25 places in 37 ms of which 1 ms to minimize.
[2024-05-29 04:05:36] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 1 ms to minimize.
[2024-05-29 04:05:36] [INFO ] Deduced a trap composed of 29 places in 34 ms of which 1 ms to minimize.
[2024-05-29 04:05:36] [INFO ] Deduced a trap composed of 27 places in 34 ms of which 1 ms to minimize.
[2024-05-29 04:05:36] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 1 ms to minimize.
[2024-05-29 04:05:36] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 1 ms to minimize.
[2024-05-29 04:05:36] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 1 ms to minimize.
[2024-05-29 04:05:36] [INFO ] Deduced a trap composed of 28 places in 35 ms of which 4 ms to minimize.
[2024-05-29 04:05:36] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
[2024-05-29 04:05:36] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
[2024-05-29 04:05:36] [INFO ] Deduced a trap composed of 26 places in 48 ms of which 1 ms to minimize.
[2024-05-29 04:05:36] [INFO ] Deduced a trap composed of 39 places in 44 ms of which 1 ms to minimize.
[2024-05-29 04:05:36] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/200 variables, 20/74 constraints. Problems are: Problem set: 0 solved, 184 unsolved
[2024-05-29 04:05:37] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 1 ms to minimize.
[2024-05-29 04:05:37] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 0 ms to minimize.
[2024-05-29 04:05:37] [INFO ] Deduced a trap composed of 28 places in 27 ms of which 1 ms to minimize.
[2024-05-29 04:05:38] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 1 ms to minimize.
[2024-05-29 04:05:38] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 1 ms to minimize.
[2024-05-29 04:05:38] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 1 ms to minimize.
[2024-05-29 04:05:38] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
[2024-05-29 04:05:38] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 1 ms to minimize.
[2024-05-29 04:05:38] [INFO ] Deduced a trap composed of 43 places in 45 ms of which 1 ms to minimize.
[2024-05-29 04:05:38] [INFO ] Deduced a trap composed of 41 places in 37 ms of which 1 ms to minimize.
[2024-05-29 04:05:38] [INFO ] Deduced a trap composed of 41 places in 36 ms of which 2 ms to minimize.
[2024-05-29 04:05:38] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 1 ms to minimize.
[2024-05-29 04:05:38] [INFO ] Deduced a trap composed of 29 places in 49 ms of which 1 ms to minimize.
[2024-05-29 04:05:38] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 1 ms to minimize.
[2024-05-29 04:05:38] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 0 ms to minimize.
[2024-05-29 04:05:38] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 1 ms to minimize.
[2024-05-29 04:05:38] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 1 ms to minimize.
[2024-05-29 04:05:38] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 0 ms to minimize.
[2024-05-29 04:05:38] [INFO ] Deduced a trap composed of 25 places in 38 ms of which 1 ms to minimize.
[2024-05-29 04:05:38] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/200 variables, 20/94 constraints. Problems are: Problem set: 0 solved, 184 unsolved
[2024-05-29 04:05:39] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 1 ms to minimize.
[2024-05-29 04:05:39] [INFO ] Deduced a trap composed of 28 places in 35 ms of which 1 ms to minimize.
[2024-05-29 04:05:39] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 1 ms to minimize.
[2024-05-29 04:05:39] [INFO ] Deduced a trap composed of 25 places in 27 ms of which 1 ms to minimize.
[2024-05-29 04:05:39] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 1 ms to minimize.
[2024-05-29 04:05:39] [INFO ] Deduced a trap composed of 26 places in 31 ms of which 0 ms to minimize.
[2024-05-29 04:05:39] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 1 ms to minimize.
[2024-05-29 04:05:39] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 1 ms to minimize.
[2024-05-29 04:05:39] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 1 ms to minimize.
[2024-05-29 04:05:39] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 1 ms to minimize.
[2024-05-29 04:05:39] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 0 ms to minimize.
[2024-05-29 04:05:39] [INFO ] Deduced a trap composed of 23 places in 26 ms of which 0 ms to minimize.
[2024-05-29 04:05:39] [INFO ] Deduced a trap composed of 26 places in 27 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/200 variables, 13/107 constraints. Problems are: Problem set: 0 solved, 184 unsolved
[2024-05-29 04:05:40] [INFO ] Deduced a trap composed of 54 places in 46 ms of which 1 ms to minimize.
[2024-05-29 04:05:40] [INFO ] Deduced a trap composed of 26 places in 40 ms of which 1 ms to minimize.
[2024-05-29 04:05:40] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 1 ms to minimize.
[2024-05-29 04:05:40] [INFO ] Deduced a trap composed of 19 places in 51 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/200 variables, 4/111 constraints. Problems are: Problem set: 0 solved, 184 unsolved
[2024-05-29 04:05:42] [INFO ] Deduced a trap composed of 24 places in 61 ms of which 1 ms to minimize.
[2024-05-29 04:05:42] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 1 ms to minimize.
[2024-05-29 04:05:42] [INFO ] Deduced a trap composed of 53 places in 49 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/200 variables, 3/114 constraints. Problems are: Problem set: 0 solved, 184 unsolved
[2024-05-29 04:05:43] [INFO ] Deduced a trap composed of 26 places in 43 ms of which 1 ms to minimize.
[2024-05-29 04:05:43] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 1 ms to minimize.
[2024-05-29 04:05:43] [INFO ] Deduced a trap composed of 20 places in 50 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/200 variables, 3/117 constraints. Problems are: Problem set: 0 solved, 184 unsolved
[2024-05-29 04:05:44] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 2 ms to minimize.
[2024-05-29 04:05:44] [INFO ] Deduced a trap composed of 30 places in 31 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/200 variables, 2/119 constraints. Problems are: Problem set: 0 solved, 184 unsolved
[2024-05-29 04:05:45] [INFO ] Deduced a trap composed of 31 places in 48 ms of which 1 ms to minimize.
[2024-05-29 04:05:45] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 1 ms to minimize.
[2024-05-29 04:05:45] [INFO ] Deduced a trap composed of 27 places in 33 ms of which 1 ms to minimize.
[2024-05-29 04:05:45] [INFO ] Deduced a trap composed of 26 places in 31 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/200 variables, 4/123 constraints. Problems are: Problem set: 0 solved, 184 unsolved
[2024-05-29 04:05:46] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 1 ms to minimize.
[2024-05-29 04:05:46] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 0 ms to minimize.
[2024-05-29 04:05:46] [INFO ] Deduced a trap composed of 43 places in 45 ms of which 1 ms to minimize.
[2024-05-29 04:05:46] [INFO ] Deduced a trap composed of 39 places in 35 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/200 variables, 4/127 constraints. Problems are: Problem set: 0 solved, 184 unsolved
[2024-05-29 04:05:47] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/200 variables, 1/128 constraints. Problems are: Problem set: 0 solved, 184 unsolved
[2024-05-29 04:05:48] [INFO ] Deduced a trap composed of 24 places in 30 ms of which 0 ms to minimize.
[2024-05-29 04:05:48] [INFO ] Deduced a trap composed of 28 places in 24 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/200 variables, 2/130 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/200 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 15 (OVERLAPS) 185/385 variables, 200/330 constraints. Problems are: Problem set: 0 solved, 184 unsolved
[2024-05-29 04:05:51] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 0 ms to minimize.
[2024-05-29 04:05:51] [INFO ] Deduced a trap composed of 27 places in 48 ms of which 1 ms to minimize.
[2024-05-29 04:05:52] [INFO ] Deduced a trap composed of 25 places in 31 ms of which 1 ms to minimize.
[2024-05-29 04:05:52] [INFO ] Deduced a trap composed of 28 places in 41 ms of which 1 ms to minimize.
[2024-05-29 04:05:52] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 0 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/385 variables, 5/335 constraints. Problems are: Problem set: 0 solved, 184 unsolved
[2024-05-29 04:05:52] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 1 ms to minimize.
[2024-05-29 04:05:53] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 1 ms to minimize.
[2024-05-29 04:05:53] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 0 ms to minimize.
[2024-05-29 04:05:53] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/385 variables, 4/339 constraints. Problems are: Problem set: 0 solved, 184 unsolved
[2024-05-29 04:05:54] [INFO ] Deduced a trap composed of 36 places in 52 ms of which 1 ms to minimize.
[2024-05-29 04:05:54] [INFO ] Deduced a trap composed of 43 places in 38 ms of which 1 ms to minimize.
[2024-05-29 04:05:54] [INFO ] Deduced a trap composed of 33 places in 37 ms of which 1 ms to minimize.
[2024-05-29 04:05:54] [INFO ] Deduced a trap composed of 37 places in 48 ms of which 1 ms to minimize.
[2024-05-29 04:05:54] [INFO ] Deduced a trap composed of 28 places in 48 ms of which 1 ms to minimize.
[2024-05-29 04:05:54] [INFO ] Deduced a trap composed of 28 places in 43 ms of which 1 ms to minimize.
[2024-05-29 04:05:54] [INFO ] Deduced a trap composed of 25 places in 41 ms of which 1 ms to minimize.
[2024-05-29 04:05:54] [INFO ] Deduced a trap composed of 40 places in 41 ms of which 0 ms to minimize.
[2024-05-29 04:05:54] [INFO ] Deduced a trap composed of 41 places in 38 ms of which 1 ms to minimize.
[2024-05-29 04:05:55] [INFO ] Deduced a trap composed of 28 places in 40 ms of which 1 ms to minimize.
[2024-05-29 04:05:55] [INFO ] Deduced a trap composed of 25 places in 53 ms of which 1 ms to minimize.
[2024-05-29 04:05:55] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 1 ms to minimize.
[2024-05-29 04:05:55] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 0 ms to minimize.
[2024-05-29 04:05:55] [INFO ] Deduced a trap composed of 30 places in 30 ms of which 0 ms to minimize.
[2024-05-29 04:05:55] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 1 ms to minimize.
[2024-05-29 04:05:55] [INFO ] Deduced a trap composed of 28 places in 31 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/385 variables, 16/355 constraints. Problems are: Problem set: 0 solved, 184 unsolved
[2024-05-29 04:05:57] [INFO ] Deduced a trap composed of 29 places in 51 ms of which 1 ms to minimize.
[2024-05-29 04:05:57] [INFO ] Deduced a trap composed of 27 places in 27 ms of which 0 ms to minimize.
[2024-05-29 04:05:57] [INFO ] Deduced a trap composed of 26 places in 62 ms of which 1 ms to minimize.
[2024-05-29 04:05:57] [INFO ] Deduced a trap composed of 40 places in 39 ms of which 1 ms to minimize.
[2024-05-29 04:05:57] [INFO ] Deduced a trap composed of 40 places in 36 ms of which 0 ms to minimize.
[2024-05-29 04:05:57] [INFO ] Deduced a trap composed of 51 places in 49 ms of which 1 ms to minimize.
[2024-05-29 04:05:57] [INFO ] Deduced a trap composed of 43 places in 40 ms of which 1 ms to minimize.
[2024-05-29 04:05:57] [INFO ] Deduced a trap composed of 54 places in 42 ms of which 1 ms to minimize.
[2024-05-29 04:05:57] [INFO ] Deduced a trap composed of 39 places in 47 ms of which 1 ms to minimize.
[2024-05-29 04:05:57] [INFO ] Deduced a trap composed of 43 places in 38 ms of which 1 ms to minimize.
[2024-05-29 04:05:58] [INFO ] Deduced a trap composed of 27 places in 41 ms of which 1 ms to minimize.
[2024-05-29 04:05:58] [INFO ] Deduced a trap composed of 28 places in 39 ms of which 1 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/385 variables, 12/367 constraints. Problems are: Problem set: 0 solved, 184 unsolved
[2024-05-29 04:05:59] [INFO ] Deduced a trap composed of 38 places in 40 ms of which 0 ms to minimize.
[2024-05-29 04:05:59] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 1 ms to minimize.
[2024-05-29 04:05:59] [INFO ] Deduced a trap composed of 28 places in 31 ms of which 1 ms to minimize.
[2024-05-29 04:05:59] [INFO ] Deduced a trap composed of 28 places in 29 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/385 variables, 4/371 constraints. Problems are: Problem set: 0 solved, 184 unsolved
[2024-05-29 04:06:01] [INFO ] Deduced a trap composed of 45 places in 41 ms of which 1 ms to minimize.
[2024-05-29 04:06:01] [INFO ] Deduced a trap composed of 29 places in 31 ms of which 1 ms to minimize.
[2024-05-29 04:06:01] [INFO ] Deduced a trap composed of 29 places in 29 ms of which 0 ms to minimize.
[2024-05-29 04:06:01] [INFO ] Deduced a trap composed of 27 places in 27 ms of which 1 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/385 variables, 4/375 constraints. Problems are: Problem set: 0 solved, 184 unsolved
[2024-05-29 04:06:03] [INFO ] Deduced a trap composed of 43 places in 45 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 385/385 variables, and 376 constraints, problems are : Problem set: 0 solved, 184 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 200/200 constraints, PredecessorRefiner: 184/184 constraints, Known Traps: 142/142 constraints]
Escalating to Integer solving :Problem set: 0 solved, 184 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/199 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 1 (OVERLAPS) 1/200 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/200 variables, 142/176 constraints. Problems are: Problem set: 0 solved, 184 unsolved
[2024-05-29 04:06:04] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 1 ms to minimize.
[2024-05-29 04:06:04] [INFO ] Deduced a trap composed of 34 places in 29 ms of which 1 ms to minimize.
[2024-05-29 04:06:04] [INFO ] Deduced a trap composed of 31 places in 27 ms of which 1 ms to minimize.
[2024-05-29 04:06:04] [INFO ] Deduced a trap composed of 33 places in 29 ms of which 0 ms to minimize.
[2024-05-29 04:06:04] [INFO ] Deduced a trap composed of 34 places in 31 ms of which 0 ms to minimize.
[2024-05-29 04:06:04] [INFO ] Deduced a trap composed of 39 places in 39 ms of which 1 ms to minimize.
[2024-05-29 04:06:04] [INFO ] Deduced a trap composed of 38 places in 33 ms of which 0 ms to minimize.
[2024-05-29 04:06:04] [INFO ] Deduced a trap composed of 51 places in 32 ms of which 1 ms to minimize.
[2024-05-29 04:06:04] [INFO ] Deduced a trap composed of 39 places in 29 ms of which 1 ms to minimize.
[2024-05-29 04:06:04] [INFO ] Deduced a trap composed of 42 places in 29 ms of which 1 ms to minimize.
[2024-05-29 04:06:04] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 1 ms to minimize.
[2024-05-29 04:06:04] [INFO ] Deduced a trap composed of 27 places in 48 ms of which 1 ms to minimize.
[2024-05-29 04:06:04] [INFO ] Deduced a trap composed of 29 places in 40 ms of which 1 ms to minimize.
[2024-05-29 04:06:04] [INFO ] Deduced a trap composed of 34 places in 40 ms of which 1 ms to minimize.
[2024-05-29 04:06:05] [INFO ] Deduced a trap composed of 35 places in 44 ms of which 1 ms to minimize.
[2024-05-29 04:06:05] [INFO ] Deduced a trap composed of 32 places in 42 ms of which 1 ms to minimize.
[2024-05-29 04:06:05] [INFO ] Deduced a trap composed of 42 places in 39 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/200 variables, 17/193 constraints. Problems are: Problem set: 0 solved, 184 unsolved
[2024-05-29 04:06:05] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 1 ms to minimize.
[2024-05-29 04:06:05] [INFO ] Deduced a trap composed of 28 places in 30 ms of which 1 ms to minimize.
[2024-05-29 04:06:06] [INFO ] Deduced a trap composed of 40 places in 45 ms of which 1 ms to minimize.
[2024-05-29 04:06:06] [INFO ] Deduced a trap composed of 32 places in 38 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/200 variables, 4/197 constraints. Problems are: Problem set: 0 solved, 184 unsolved
[2024-05-29 04:06:07] [INFO ] Deduced a trap composed of 35 places in 47 ms of which 1 ms to minimize.
[2024-05-29 04:06:07] [INFO ] Deduced a trap composed of 43 places in 41 ms of which 1 ms to minimize.
[2024-05-29 04:06:07] [INFO ] Deduced a trap composed of 38 places in 42 ms of which 1 ms to minimize.
[2024-05-29 04:06:07] [INFO ] Deduced a trap composed of 40 places in 46 ms of which 1 ms to minimize.
[2024-05-29 04:06:07] [INFO ] Deduced a trap composed of 33 places in 41 ms of which 1 ms to minimize.
[2024-05-29 04:06:07] [INFO ] Deduced a trap composed of 37 places in 44 ms of which 1 ms to minimize.
[2024-05-29 04:06:07] [INFO ] Deduced a trap composed of 36 places in 40 ms of which 1 ms to minimize.
[2024-05-29 04:06:07] [INFO ] Deduced a trap composed of 15 places in 25 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/200 variables, 8/205 constraints. Problems are: Problem set: 0 solved, 184 unsolved
[2024-05-29 04:06:08] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 0 ms to minimize.
[2024-05-29 04:06:08] [INFO ] Deduced a trap composed of 41 places in 31 ms of which 1 ms to minimize.
[2024-05-29 04:06:08] [INFO ] Deduced a trap composed of 42 places in 38 ms of which 1 ms to minimize.
[2024-05-29 04:06:08] [INFO ] Deduced a trap composed of 48 places in 33 ms of which 1 ms to minimize.
[2024-05-29 04:06:08] [INFO ] Deduced a trap composed of 52 places in 33 ms of which 1 ms to minimize.
[2024-05-29 04:06:08] [INFO ] Deduced a trap composed of 48 places in 30 ms of which 0 ms to minimize.
[2024-05-29 04:06:08] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/200 variables, 7/212 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/200 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 8 (OVERLAPS) 185/385 variables, 200/412 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/385 variables, 184/596 constraints. Problems are: Problem set: 0 solved, 184 unsolved
[2024-05-29 04:06:11] [INFO ] Deduced a trap composed of 28 places in 44 ms of which 1 ms to minimize.
[2024-05-29 04:06:12] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 1 ms to minimize.
[2024-05-29 04:06:12] [INFO ] Deduced a trap composed of 18 places in 21 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/385 variables, 3/599 constraints. Problems are: Problem set: 0 solved, 184 unsolved
[2024-05-29 04:06:21] [INFO ] Deduced a trap composed of 27 places in 52 ms of which 1 ms to minimize.
[2024-05-29 04:06:21] [INFO ] Deduced a trap composed of 30 places in 58 ms of which 1 ms to minimize.
[2024-05-29 04:06:22] [INFO ] Deduced a trap composed of 36 places in 51 ms of which 1 ms to minimize.
[2024-05-29 04:06:22] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 1 ms to minimize.
[2024-05-29 04:06:22] [INFO ] Deduced a trap composed of 33 places in 45 ms of which 1 ms to minimize.
[2024-05-29 04:06:22] [INFO ] Deduced a trap composed of 17 places in 52 ms of which 2 ms to minimize.
[2024-05-29 04:06:22] [INFO ] Deduced a trap composed of 26 places in 45 ms of which 1 ms to minimize.
[2024-05-29 04:06:22] [INFO ] Deduced a trap composed of 27 places in 45 ms of which 1 ms to minimize.
[2024-05-29 04:06:23] [INFO ] Deduced a trap composed of 36 places in 51 ms of which 1 ms to minimize.
[2024-05-29 04:06:23] [INFO ] Deduced a trap composed of 20 places in 47 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/385 variables, 10/609 constraints. Problems are: Problem set: 0 solved, 184 unsolved
[2024-05-29 04:06:28] [INFO ] Deduced a trap composed of 25 places in 55 ms of which 1 ms to minimize.
[2024-05-29 04:06:29] [INFO ] Deduced a trap composed of 44 places in 48 ms of which 1 ms to minimize.
[2024-05-29 04:06:29] [INFO ] Deduced a trap composed of 35 places in 43 ms of which 1 ms to minimize.
[2024-05-29 04:06:29] [INFO ] Deduced a trap composed of 31 places in 39 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/385 variables, 4/613 constraints. Problems are: Problem set: 0 solved, 184 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 385/385 variables, and 613 constraints, problems are : Problem set: 0 solved, 184 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 200/200 constraints, PredecessorRefiner: 184/184 constraints, Known Traps: 195/195 constraints]
After SMT, in 60109ms problems are : Problem set: 0 solved, 184 unsolved
Search for dead transitions found 0 dead transitions in 60121ms
Starting structural reductions in LTL mode, iteration 1 : 200/207 places, 185/192 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60613 ms. Remains : 200/207 places, 185/192 transitions.
Support contains 91 out of 200 places after structural reductions.
[2024-05-29 04:06:33] [INFO ] Flatten gal took : 35 ms
[2024-05-29 04:06:33] [INFO ] Flatten gal took : 16 ms
[2024-05-29 04:06:33] [INFO ] Input system was already deterministic with 185 transitions.
Support contains 81 out of 200 places (down from 91) after GAL structural reductions.
FORMULA ShieldPPPs-PT-003B-CTLCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-003B-CTLCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (73 resets) in 1066 ms. (37 steps per ms) remains 1/57 properties
BEST_FIRST walk for 40004 steps (12 resets) in 168 ms. (236 steps per ms) remains 1/1 properties
[2024-05-29 04:06:33] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 96/101 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 99/200 variables, 20/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/200 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 185/385 variables, 200/234 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/385 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/385 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 385/385 variables, and 234 constraints, problems are : Problem set: 0 solved, 1 unsolved in 99 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 200/200 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 96/101 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-29 04:06:34] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 1 ms to minimize.
Problem AtomicPropp44 is UNSAT
After SMT solving in domain Int declared 101/385 variables, and 15 constraints, problems are : Problem set: 1 solved, 0 unsolved in 92 ms.
Refiners :[Positive P Invariants (semi-flows): 14/34 constraints, State Equation: 0/200 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 197ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 1 atomic propositions for a total of 14 simplifications.
FORMULA ShieldPPPs-PT-003B-CTLCardinality-2023-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-29 04:06:34] [INFO ] Flatten gal took : 21 ms
[2024-05-29 04:06:34] [INFO ] Flatten gal took : 26 ms
[2024-05-29 04:06:34] [INFO ] Input system was already deterministic with 185 transitions.
Computed a total of 42 stabilizing places and 42 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 200/200 places, 185/185 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 0 with 21 rules applied. Total rules applied 21 place count 199 transition count 163
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 1 with 21 rules applied. Total rules applied 42 place count 178 transition count 163
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 42 place count 178 transition count 147
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 74 place count 162 transition count 147
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 87 place count 149 transition count 134
Iterating global reduction 2 with 13 rules applied. Total rules applied 100 place count 149 transition count 134
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 100 place count 149 transition count 129
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 110 place count 144 transition count 129
Performed 45 Post agglomeration using F-continuation condition.Transition count delta: 45
Deduced a syphon composed of 45 places in 0 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 2 with 90 rules applied. Total rules applied 200 place count 99 transition count 84
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 202 place count 97 transition count 82
Applied a total of 202 rules in 50 ms. Remains 97 /200 variables (removed 103) and now considering 82/185 (removed 103) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 50 ms. Remains : 97/200 places, 82/185 transitions.
[2024-05-29 04:06:34] [INFO ] Flatten gal took : 5 ms
[2024-05-29 04:06:34] [INFO ] Flatten gal took : 5 ms
[2024-05-29 04:06:34] [INFO ] Input system was already deterministic with 82 transitions.
Starting structural reductions in LTL mode, iteration 0 : 200/200 places, 185/185 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 186 transition count 171
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 186 transition count 171
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 185 transition count 170
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 185 transition count 170
Applied a total of 30 rules in 9 ms. Remains 185 /200 variables (removed 15) and now considering 170/185 (removed 15) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9 ms. Remains : 185/200 places, 170/185 transitions.
[2024-05-29 04:06:34] [INFO ] Flatten gal took : 8 ms
[2024-05-29 04:06:34] [INFO ] Flatten gal took : 9 ms
[2024-05-29 04:06:34] [INFO ] Input system was already deterministic with 170 transitions.
Starting structural reductions in LTL mode, iteration 0 : 200/200 places, 185/185 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 186 transition count 171
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 186 transition count 171
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 185 transition count 170
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 185 transition count 170
Applied a total of 30 rules in 9 ms. Remains 185 /200 variables (removed 15) and now considering 170/185 (removed 15) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9 ms. Remains : 185/200 places, 170/185 transitions.
[2024-05-29 04:06:34] [INFO ] Flatten gal took : 9 ms
[2024-05-29 04:06:34] [INFO ] Flatten gal took : 9 ms
[2024-05-29 04:06:34] [INFO ] Input system was already deterministic with 170 transitions.
Starting structural reductions in LTL mode, iteration 0 : 200/200 places, 185/185 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 186 transition count 171
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 186 transition count 171
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 185 transition count 170
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 185 transition count 170
Applied a total of 30 rules in 8 ms. Remains 185 /200 variables (removed 15) and now considering 170/185 (removed 15) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 185/200 places, 170/185 transitions.
[2024-05-29 04:06:34] [INFO ] Flatten gal took : 8 ms
[2024-05-29 04:06:34] [INFO ] Flatten gal took : 7 ms
[2024-05-29 04:06:34] [INFO ] Input system was already deterministic with 170 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 200/200 places, 185/185 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 0 with 21 rules applied. Total rules applied 21 place count 199 transition count 163
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 1 with 21 rules applied. Total rules applied 42 place count 178 transition count 163
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 42 place count 178 transition count 147
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 74 place count 162 transition count 147
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 87 place count 149 transition count 134
Iterating global reduction 2 with 13 rules applied. Total rules applied 100 place count 149 transition count 134
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 100 place count 149 transition count 128
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 112 place count 143 transition count 128
Performed 44 Post agglomeration using F-continuation condition.Transition count delta: 44
Deduced a syphon composed of 44 places in 0 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 2 with 88 rules applied. Total rules applied 200 place count 99 transition count 84
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 202 place count 97 transition count 82
Applied a total of 202 rules in 20 ms. Remains 97 /200 variables (removed 103) and now considering 82/185 (removed 103) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 21 ms. Remains : 97/200 places, 82/185 transitions.
[2024-05-29 04:06:34] [INFO ] Flatten gal took : 4 ms
[2024-05-29 04:06:34] [INFO ] Flatten gal took : 4 ms
[2024-05-29 04:06:34] [INFO ] Input system was already deterministic with 82 transitions.
Starting structural reductions in LTL mode, iteration 0 : 200/200 places, 185/185 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 188 transition count 173
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 188 transition count 173
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 187 transition count 172
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 187 transition count 172
Applied a total of 26 rules in 7 ms. Remains 187 /200 variables (removed 13) and now considering 172/185 (removed 13) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 187/200 places, 172/185 transitions.
[2024-05-29 04:06:34] [INFO ] Flatten gal took : 8 ms
[2024-05-29 04:06:34] [INFO ] Flatten gal took : 7 ms
[2024-05-29 04:06:34] [INFO ] Input system was already deterministic with 172 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 200/200 places, 185/185 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 22 rules applied. Total rules applied 22 place count 199 transition count 162
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 1 with 22 rules applied. Total rules applied 44 place count 177 transition count 162
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 44 place count 177 transition count 148
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 72 place count 163 transition count 148
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 85 place count 150 transition count 135
Iterating global reduction 2 with 13 rules applied. Total rules applied 98 place count 150 transition count 135
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 98 place count 150 transition count 129
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 110 place count 144 transition count 129
Performed 45 Post agglomeration using F-continuation condition.Transition count delta: 45
Deduced a syphon composed of 45 places in 1 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 2 with 90 rules applied. Total rules applied 200 place count 99 transition count 84
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 202 place count 97 transition count 82
Applied a total of 202 rules in 19 ms. Remains 97 /200 variables (removed 103) and now considering 82/185 (removed 103) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 19 ms. Remains : 97/200 places, 82/185 transitions.
[2024-05-29 04:06:34] [INFO ] Flatten gal took : 4 ms
[2024-05-29 04:06:34] [INFO ] Flatten gal took : 4 ms
[2024-05-29 04:06:34] [INFO ] Input system was already deterministic with 82 transitions.
Starting structural reductions in LTL mode, iteration 0 : 200/200 places, 185/185 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 186 transition count 171
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 186 transition count 171
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 185 transition count 170
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 185 transition count 170
Applied a total of 30 rules in 7 ms. Remains 185 /200 variables (removed 15) and now considering 170/185 (removed 15) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 185/200 places, 170/185 transitions.
[2024-05-29 04:06:34] [INFO ] Flatten gal took : 7 ms
[2024-05-29 04:06:34] [INFO ] Flatten gal took : 7 ms
[2024-05-29 04:06:34] [INFO ] Input system was already deterministic with 170 transitions.
Starting structural reductions in LTL mode, iteration 0 : 200/200 places, 185/185 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 189 transition count 174
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 189 transition count 174
Applied a total of 22 rules in 5 ms. Remains 189 /200 variables (removed 11) and now considering 174/185 (removed 11) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 189/200 places, 174/185 transitions.
[2024-05-29 04:06:34] [INFO ] Flatten gal took : 7 ms
[2024-05-29 04:06:34] [INFO ] Flatten gal took : 9 ms
[2024-05-29 04:06:34] [INFO ] Input system was already deterministic with 174 transitions.
Starting structural reductions in LTL mode, iteration 0 : 200/200 places, 185/185 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 187 transition count 172
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 187 transition count 172
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 186 transition count 171
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 186 transition count 171
Applied a total of 28 rules in 7 ms. Remains 186 /200 variables (removed 14) and now considering 171/185 (removed 14) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 186/200 places, 171/185 transitions.
[2024-05-29 04:06:34] [INFO ] Flatten gal took : 7 ms
[2024-05-29 04:06:34] [INFO ] Flatten gal took : 7 ms
[2024-05-29 04:06:34] [INFO ] Input system was already deterministic with 171 transitions.
Starting structural reductions in LTL mode, iteration 0 : 200/200 places, 185/185 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 188 transition count 173
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 188 transition count 173
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 187 transition count 172
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 187 transition count 172
Applied a total of 26 rules in 8 ms. Remains 187 /200 variables (removed 13) and now considering 172/185 (removed 13) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 187/200 places, 172/185 transitions.
[2024-05-29 04:06:34] [INFO ] Flatten gal took : 6 ms
[2024-05-29 04:06:34] [INFO ] Flatten gal took : 6 ms
[2024-05-29 04:06:34] [INFO ] Input system was already deterministic with 172 transitions.
Starting structural reductions in LTL mode, iteration 0 : 200/200 places, 185/185 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 188 transition count 173
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 188 transition count 173
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 187 transition count 172
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 187 transition count 172
Applied a total of 26 rules in 6 ms. Remains 187 /200 variables (removed 13) and now considering 172/185 (removed 13) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 187/200 places, 172/185 transitions.
[2024-05-29 04:06:34] [INFO ] Flatten gal took : 6 ms
[2024-05-29 04:06:34] [INFO ] Flatten gal took : 6 ms
[2024-05-29 04:06:34] [INFO ] Input system was already deterministic with 172 transitions.
Starting structural reductions in LTL mode, iteration 0 : 200/200 places, 185/185 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 190 transition count 175
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 190 transition count 175
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 189 transition count 174
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 189 transition count 174
Applied a total of 22 rules in 7 ms. Remains 189 /200 variables (removed 11) and now considering 174/185 (removed 11) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 189/200 places, 174/185 transitions.
[2024-05-29 04:06:34] [INFO ] Flatten gal took : 6 ms
[2024-05-29 04:06:34] [INFO ] Flatten gal took : 6 ms
[2024-05-29 04:06:34] [INFO ] Input system was already deterministic with 174 transitions.
[2024-05-29 04:06:34] [INFO ] Flatten gal took : 8 ms
[2024-05-29 04:06:34] [INFO ] Flatten gal took : 7 ms
[2024-05-29 04:06:34] [INFO ] Export to MCC of 13 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 3 ms.
[2024-05-29 04:06:34] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 200 places, 185 transitions and 514 arcs took 2 ms.
Total runtime 62515 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running ShieldPPPs-PT-003B

IS_COLORED=
IS_NUPN=

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


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


----------------------------------------------------------------------
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: 1135
MODEL NAME: /home/mcc/execution/406/model
200 places, 185 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 ShieldPPPs-PT-003B-CTLCardinality-2024-01 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA ShieldPPPs-PT-003B-CTLCardinality-2024-09 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA ShieldPPPs-PT-003B-CTLCardinality-2024-02 CANNOT_COMPUTE
FORMULA ShieldPPPs-PT-003B-CTLCardinality-2024-03 CANNOT_COMPUTE
FORMULA ShieldPPPs-PT-003B-CTLCardinality-2024-04 CANNOT_COMPUTE
FORMULA ShieldPPPs-PT-003B-CTLCardinality-2024-05 CANNOT_COMPUTE
FORMULA ShieldPPPs-PT-003B-CTLCardinality-2024-06 CANNOT_COMPUTE
FORMULA ShieldPPPs-PT-003B-CTLCardinality-2024-08 CANNOT_COMPUTE
FORMULA ShieldPPPs-PT-003B-CTLCardinality-2024-10 CANNOT_COMPUTE
FORMULA ShieldPPPs-PT-003B-CTLCardinality-2024-11 CANNOT_COMPUTE
FORMULA ShieldPPPs-PT-003B-CTLCardinality-2023-12 CANNOT_COMPUTE
FORMULA ShieldPPPs-PT-003B-CTLCardinality-2023-14 CANNOT_COMPUTE
FORMULA ShieldPPPs-PT-003B-CTLCardinality-2023-15 CANNOT_COMPUTE
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716958311324

--------------------
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
Error in allocating array of size 2097152 at unique_table.cc, line 313
MEDDLY ERROR: Insufficient memory

Error in allocating array of size 8388608 at unique_table.cc, line 313
MEDDLY ERROR: Insufficient memory

Error in allocating array of size 4194304 at unique_table.cc, line 313
MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

Error in allocating array of size 8388608 at unique_table.cc, line 313
MEDDLY ERROR: Insufficient memory

Error in allocating array of size 4194304 at unique_table.cc, line 313
MEDDLY ERROR: Insufficient memory

Error in allocating array of size 8388608 at unique_table.cc, line 313
MEDDLY ERROR: Insufficient memory

Error in allocating array of size 2097152 at unique_table.cc, line 313
MEDDLY ERROR: Insufficient memory

Error in allocating array of size 4194304 at unique_table.cc, line 313
MEDDLY ERROR: Insufficient memory

Error in allocating array of size 8388608 at unique_table.cc, line 313
MEDDLY ERROR: Insufficient memory

Error in allocating array of size 8388608 at unique_table.cc, line 313
MEDDLY ERROR: Insufficient memory

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldPPPs-PT-003B"
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 ShieldPPPs-PT-003B, 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 r355-tall-171683758700393"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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