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-171683759400745.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 ShieldRVs-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-171683759400745
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 480K
-rw-r--r-- 1 mcc users 6.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K 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.4K Apr 23 07:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 23 07:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 23 07:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 23 07:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 12 17:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 127K Apr 12 17:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Apr 12 17:31 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 61K Apr 12 17:31 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:54 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 36K 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 ShieldRVs-PT-003B-CTLCardinality-2024-00
FORMULA_NAME ShieldRVs-PT-003B-CTLCardinality-2024-01
FORMULA_NAME ShieldRVs-PT-003B-CTLCardinality-2024-02
FORMULA_NAME ShieldRVs-PT-003B-CTLCardinality-2024-03
FORMULA_NAME ShieldRVs-PT-003B-CTLCardinality-2024-04
FORMULA_NAME ShieldRVs-PT-003B-CTLCardinality-2024-05
FORMULA_NAME ShieldRVs-PT-003B-CTLCardinality-2024-06
FORMULA_NAME ShieldRVs-PT-003B-CTLCardinality-2024-07
FORMULA_NAME ShieldRVs-PT-003B-CTLCardinality-2024-08
FORMULA_NAME ShieldRVs-PT-003B-CTLCardinality-2024-09
FORMULA_NAME ShieldRVs-PT-003B-CTLCardinality-2024-10
FORMULA_NAME ShieldRVs-PT-003B-CTLCardinality-2024-11
FORMULA_NAME ShieldRVs-PT-003B-CTLCardinality-2023-12
FORMULA_NAME ShieldRVs-PT-003B-CTLCardinality-2023-13
FORMULA_NAME ShieldRVs-PT-003B-CTLCardinality-2023-14
FORMULA_NAME ShieldRVs-PT-003B-CTLCardinality-2023-15

=== Now, execution of the tool begins

BK_START 1717037908134

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldRVs-PT-003B
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-30 02:58:29] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-30 02:58:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-30 02:58:29] [INFO ] Load time of PNML (sax parser for PT used): 60 ms
[2024-05-30 02:58:29] [INFO ] Transformed 123 places.
[2024-05-30 02:58:29] [INFO ] Transformed 138 transitions.
[2024-05-30 02:58:29] [INFO ] Found NUPN structural information;
[2024-05-30 02:58:29] [INFO ] Parsed PT model containing 123 places and 138 transitions and 432 arcs in 158 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 15 ms.
Support contains 70 out of 123 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 123/123 places, 138/138 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 118 transition count 133
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 118 transition count 133
Applied a total of 10 rules in 24 ms. Remains 118 /123 variables (removed 5) and now considering 133/138 (removed 5) transitions.
// Phase 1: matrix 133 rows 118 cols
[2024-05-30 02:58:29] [INFO ] Computed 13 invariants in 9 ms
[2024-05-30 02:58:29] [INFO ] Implicit Places using invariants in 202 ms returned []
[2024-05-30 02:58:29] [INFO ] Invariant cache hit.
[2024-05-30 02:58:29] [INFO ] Implicit Places using invariants and state equation in 119 ms returned []
Implicit Place search using SMT with State Equation took 348 ms to find 0 implicit places.
Running 132 sub problems to find dead transitions.
[2024-05-30 02:58:29] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 1 (OVERLAPS) 1/118 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 132 unsolved
[2024-05-30 02:58:30] [INFO ] Deduced a trap composed of 18 places in 155 ms of which 13 ms to minimize.
[2024-05-30 02:58:31] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 1 ms to minimize.
[2024-05-30 02:58:31] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 1 ms to minimize.
[2024-05-30 02:58:31] [INFO ] Deduced a trap composed of 20 places in 88 ms of which 2 ms to minimize.
[2024-05-30 02:58:31] [INFO ] Deduced a trap composed of 19 places in 64 ms of which 0 ms to minimize.
[2024-05-30 02:58:31] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 1 ms to minimize.
[2024-05-30 02:58:31] [INFO ] Deduced a trap composed of 29 places in 65 ms of which 1 ms to minimize.
[2024-05-30 02:58:31] [INFO ] Deduced a trap composed of 39 places in 31 ms of which 1 ms to minimize.
[2024-05-30 02:58:31] [INFO ] Deduced a trap composed of 27 places in 65 ms of which 1 ms to minimize.
[2024-05-30 02:58:31] [INFO ] Deduced a trap composed of 19 places in 186 ms of which 1 ms to minimize.
[2024-05-30 02:58:31] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 1 ms to minimize.
[2024-05-30 02:58:31] [INFO ] Deduced a trap composed of 25 places in 31 ms of which 0 ms to minimize.
[2024-05-30 02:58:32] [INFO ] Deduced a trap composed of 19 places in 97 ms of which 1 ms to minimize.
[2024-05-30 02:58:32] [INFO ] Deduced a trap composed of 25 places in 33 ms of which 1 ms to minimize.
[2024-05-30 02:58:32] [INFO ] Deduced a trap composed of 21 places in 24 ms of which 1 ms to minimize.
[2024-05-30 02:58:32] [INFO ] Deduced a trap composed of 20 places in 49 ms of which 1 ms to minimize.
[2024-05-30 02:58:32] [INFO ] Deduced a trap composed of 25 places in 103 ms of which 8 ms to minimize.
[2024-05-30 02:58:32] [INFO ] Deduced a trap composed of 24 places in 28 ms of which 1 ms to minimize.
[2024-05-30 02:58:32] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 1 ms to minimize.
[2024-05-30 02:58:32] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/118 variables, 20/33 constraints. Problems are: Problem set: 0 solved, 132 unsolved
[2024-05-30 02:58:32] [INFO ] Deduced a trap composed of 30 places in 113 ms of which 1 ms to minimize.
[2024-05-30 02:58:32] [INFO ] Deduced a trap composed of 37 places in 49 ms of which 1 ms to minimize.
[2024-05-30 02:58:32] [INFO ] Deduced a trap composed of 24 places in 46 ms of which 1 ms to minimize.
[2024-05-30 02:58:32] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 1 ms to minimize.
[2024-05-30 02:58:32] [INFO ] Deduced a trap composed of 16 places in 57 ms of which 0 ms to minimize.
[2024-05-30 02:58:32] [INFO ] Deduced a trap composed of 26 places in 59 ms of which 1 ms to minimize.
[2024-05-30 02:58:33] [INFO ] Deduced a trap composed of 21 places in 54 ms of which 1 ms to minimize.
[2024-05-30 02:58:33] [INFO ] Deduced a trap composed of 19 places in 55 ms of which 1 ms to minimize.
[2024-05-30 02:58:33] [INFO ] Deduced a trap composed of 17 places in 133 ms of which 0 ms to minimize.
[2024-05-30 02:58:33] [INFO ] Deduced a trap composed of 22 places in 24 ms of which 0 ms to minimize.
[2024-05-30 02:58:33] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 1 ms to minimize.
[2024-05-30 02:58:33] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 1 ms to minimize.
[2024-05-30 02:58:33] [INFO ] Deduced a trap composed of 21 places in 22 ms of which 1 ms to minimize.
[2024-05-30 02:58:33] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 1 ms to minimize.
[2024-05-30 02:58:33] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 3 ms to minimize.
[2024-05-30 02:58:33] [INFO ] Deduced a trap composed of 21 places in 51 ms of which 1 ms to minimize.
[2024-05-30 02:58:33] [INFO ] Deduced a trap composed of 23 places in 50 ms of which 1 ms to minimize.
[2024-05-30 02:58:33] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 0 ms to minimize.
[2024-05-30 02:58:33] [INFO ] Deduced a trap composed of 23 places in 56 ms of which 1 ms to minimize.
[2024-05-30 02:58:33] [INFO ] Deduced a trap composed of 22 places in 24 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/118 variables, 20/53 constraints. Problems are: Problem set: 0 solved, 132 unsolved
[2024-05-30 02:58:34] [INFO ] Deduced a trap composed of 32 places in 38 ms of which 1 ms to minimize.
[2024-05-30 02:58:34] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 1 ms to minimize.
[2024-05-30 02:58:34] [INFO ] Deduced a trap composed of 32 places in 43 ms of which 1 ms to minimize.
[2024-05-30 02:58:34] [INFO ] Deduced a trap composed of 39 places in 34 ms of which 1 ms to minimize.
[2024-05-30 02:58:34] [INFO ] Deduced a trap composed of 33 places in 32 ms of which 0 ms to minimize.
[2024-05-30 02:58:34] [INFO ] Deduced a trap composed of 40 places in 35 ms of which 1 ms to minimize.
[2024-05-30 02:58:34] [INFO ] Deduced a trap composed of 34 places in 36 ms of which 1 ms to minimize.
[2024-05-30 02:58:34] [INFO ] Deduced a trap composed of 26 places in 31 ms of which 1 ms to minimize.
[2024-05-30 02:58:34] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 1 ms to minimize.
[2024-05-30 02:58:34] [INFO ] Deduced a trap composed of 18 places in 23 ms of which 0 ms to minimize.
[2024-05-30 02:58:34] [INFO ] Deduced a trap composed of 28 places in 34 ms of which 1 ms to minimize.
[2024-05-30 02:58:34] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 1 ms to minimize.
[2024-05-30 02:58:34] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 4 ms to minimize.
[2024-05-30 02:58:34] [INFO ] Deduced a trap composed of 26 places in 31 ms of which 1 ms to minimize.
[2024-05-30 02:58:34] [INFO ] Deduced a trap composed of 11 places in 35 ms of which 0 ms to minimize.
[2024-05-30 02:58:34] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 1 ms to minimize.
[2024-05-30 02:58:34] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 3 ms to minimize.
[2024-05-30 02:58:34] [INFO ] Deduced a trap composed of 20 places in 23 ms of which 1 ms to minimize.
[2024-05-30 02:58:34] [INFO ] Deduced a trap composed of 24 places in 23 ms of which 1 ms to minimize.
[2024-05-30 02:58:34] [INFO ] Deduced a trap composed of 27 places in 32 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/118 variables, 20/73 constraints. Problems are: Problem set: 0 solved, 132 unsolved
[2024-05-30 02:58:35] [INFO ] Deduced a trap composed of 31 places in 36 ms of which 0 ms to minimize.
[2024-05-30 02:58:35] [INFO ] Deduced a trap composed of 28 places in 35 ms of which 1 ms to minimize.
[2024-05-30 02:58:35] [INFO ] Deduced a trap composed of 25 places in 45 ms of which 1 ms to minimize.
[2024-05-30 02:58:35] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 1 ms to minimize.
[2024-05-30 02:58:35] [INFO ] Deduced a trap composed of 29 places in 45 ms of which 1 ms to minimize.
[2024-05-30 02:58:35] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 0 ms to minimize.
[2024-05-30 02:58:35] [INFO ] Deduced a trap composed of 26 places in 23 ms of which 1 ms to minimize.
[2024-05-30 02:58:35] [INFO ] Deduced a trap composed of 25 places in 25 ms of which 1 ms to minimize.
[2024-05-30 02:58:35] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 0 ms to minimize.
[2024-05-30 02:58:35] [INFO ] Deduced a trap composed of 23 places in 26 ms of which 1 ms to minimize.
[2024-05-30 02:58:35] [INFO ] Deduced a trap composed of 29 places in 27 ms of which 0 ms to minimize.
[2024-05-30 02:58:35] [INFO ] Deduced a trap composed of 27 places in 23 ms of which 1 ms to minimize.
[2024-05-30 02:58:35] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 1 ms to minimize.
[2024-05-30 02:58:35] [INFO ] Deduced a trap composed of 21 places in 21 ms of which 1 ms to minimize.
[2024-05-30 02:58:35] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 1 ms to minimize.
[2024-05-30 02:58:35] [INFO ] Deduced a trap composed of 21 places in 24 ms of which 0 ms to minimize.
[2024-05-30 02:58:35] [INFO ] Deduced a trap composed of 23 places in 23 ms of which 1 ms to minimize.
[2024-05-30 02:58:35] [INFO ] Deduced a trap composed of 21 places in 20 ms of which 1 ms to minimize.
[2024-05-30 02:58:35] [INFO ] Deduced a trap composed of 20 places in 24 ms of which 0 ms to minimize.
[2024-05-30 02:58:35] [INFO ] Deduced a trap composed of 21 places in 18 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/118 variables, 20/93 constraints. Problems are: Problem set: 0 solved, 132 unsolved
[2024-05-30 02:58:36] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
[2024-05-30 02:58:36] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 0 ms to minimize.
[2024-05-30 02:58:36] [INFO ] Deduced a trap composed of 28 places in 27 ms of which 1 ms to minimize.
[2024-05-30 02:58:36] [INFO ] Deduced a trap composed of 35 places in 37 ms of which 1 ms to minimize.
[2024-05-30 02:58:36] [INFO ] Deduced a trap composed of 23 places in 29 ms of which 1 ms to minimize.
[2024-05-30 02:58:36] [INFO ] Deduced a trap composed of 28 places in 34 ms of which 0 ms to minimize.
[2024-05-30 02:58:36] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 0 ms to minimize.
[2024-05-30 02:58:36] [INFO ] Deduced a trap composed of 27 places in 38 ms of which 0 ms to minimize.
[2024-05-30 02:58:36] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 0 ms to minimize.
[2024-05-30 02:58:36] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 1 ms to minimize.
[2024-05-30 02:58:36] [INFO ] Deduced a trap composed of 20 places in 25 ms of which 1 ms to minimize.
[2024-05-30 02:58:36] [INFO ] Deduced a trap composed of 29 places in 37 ms of which 1 ms to minimize.
[2024-05-30 02:58:36] [INFO ] Deduced a trap composed of 26 places in 29 ms of which 1 ms to minimize.
[2024-05-30 02:58:36] [INFO ] Deduced a trap composed of 13 places in 21 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/118 variables, 14/107 constraints. Problems are: Problem set: 0 solved, 132 unsolved
[2024-05-30 02:58:37] [INFO ] Deduced a trap composed of 32 places in 34 ms of which 0 ms to minimize.
[2024-05-30 02:58:37] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 0 ms to minimize.
[2024-05-30 02:58:37] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 0 ms to minimize.
[2024-05-30 02:58:37] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
[2024-05-30 02:58:37] [INFO ] Deduced a trap composed of 26 places in 29 ms of which 1 ms to minimize.
[2024-05-30 02:58:37] [INFO ] Deduced a trap composed of 28 places in 24 ms of which 0 ms to minimize.
[2024-05-30 02:58:37] [INFO ] Deduced a trap composed of 24 places in 20 ms of which 0 ms to minimize.
[2024-05-30 02:58:37] [INFO ] Deduced a trap composed of 31 places in 29 ms of which 1 ms to minimize.
[2024-05-30 02:58:37] [INFO ] Deduced a trap composed of 20 places in 21 ms of which 1 ms to minimize.
[2024-05-30 02:58:37] [INFO ] Deduced a trap composed of 27 places in 27 ms of which 1 ms to minimize.
[2024-05-30 02:58:37] [INFO ] Deduced a trap composed of 29 places in 32 ms of which 1 ms to minimize.
[2024-05-30 02:58:37] [INFO ] Deduced a trap composed of 17 places in 19 ms of which 1 ms to minimize.
[2024-05-30 02:58:37] [INFO ] Deduced a trap composed of 26 places in 31 ms of which 0 ms to minimize.
[2024-05-30 02:58:37] [INFO ] Deduced a trap composed of 22 places in 26 ms of which 1 ms to minimize.
[2024-05-30 02:58:37] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 1 ms to minimize.
[2024-05-30 02:58:37] [INFO ] Deduced a trap composed of 20 places in 20 ms of which 0 ms to minimize.
[2024-05-30 02:58:37] [INFO ] Deduced a trap composed of 27 places in 29 ms of which 0 ms to minimize.
[2024-05-30 02:58:37] [INFO ] Deduced a trap composed of 28 places in 25 ms of which 1 ms to minimize.
[2024-05-30 02:58:37] [INFO ] Deduced a trap composed of 23 places in 26 ms of which 1 ms to minimize.
[2024-05-30 02:58:37] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/118 variables, 20/127 constraints. Problems are: Problem set: 0 solved, 132 unsolved
[2024-05-30 02:58:38] [INFO ] Deduced a trap composed of 28 places in 34 ms of which 1 ms to minimize.
[2024-05-30 02:58:38] [INFO ] Deduced a trap composed of 28 places in 35 ms of which 1 ms to minimize.
[2024-05-30 02:58:38] [INFO ] Deduced a trap composed of 25 places in 34 ms of which 1 ms to minimize.
[2024-05-30 02:58:38] [INFO ] Deduced a trap composed of 24 places in 28 ms of which 1 ms to minimize.
[2024-05-30 02:58:38] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 0 ms to minimize.
[2024-05-30 02:58:38] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 0 ms to minimize.
[2024-05-30 02:58:38] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 0 ms to minimize.
[2024-05-30 02:58:38] [INFO ] Deduced a trap composed of 26 places in 37 ms of which 1 ms to minimize.
[2024-05-30 02:58:38] [INFO ] Deduced a trap composed of 22 places in 28 ms of which 1 ms to minimize.
[2024-05-30 02:58:38] [INFO ] Deduced a trap composed of 21 places in 22 ms of which 0 ms to minimize.
[2024-05-30 02:58:38] [INFO ] Deduced a trap composed of 34 places in 33 ms of which 1 ms to minimize.
[2024-05-30 02:58:38] [INFO ] Deduced a trap composed of 33 places in 41 ms of which 1 ms to minimize.
[2024-05-30 02:58:38] [INFO ] Deduced a trap composed of 35 places in 30 ms of which 1 ms to minimize.
[2024-05-30 02:58:38] [INFO ] Deduced a trap composed of 36 places in 29 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/118 variables, 14/141 constraints. Problems are: Problem set: 0 solved, 132 unsolved
[2024-05-30 02:58:38] [INFO ] Deduced a trap composed of 26 places in 43 ms of which 1 ms to minimize.
[2024-05-30 02:58:38] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 1 ms to minimize.
[2024-05-30 02:58:39] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 1 ms to minimize.
[2024-05-30 02:58:39] [INFO ] Deduced a trap composed of 23 places in 20 ms of which 0 ms to minimize.
[2024-05-30 02:58:39] [INFO ] Deduced a trap composed of 27 places in 39 ms of which 2 ms to minimize.
[2024-05-30 02:58:39] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 1 ms to minimize.
[2024-05-30 02:58:39] [INFO ] Deduced a trap composed of 26 places in 34 ms of which 1 ms to minimize.
[2024-05-30 02:58:39] [INFO ] Deduced a trap composed of 26 places in 27 ms of which 0 ms to minimize.
[2024-05-30 02:58:39] [INFO ] Deduced a trap composed of 29 places in 32 ms of which 0 ms to minimize.
[2024-05-30 02:58:39] [INFO ] Deduced a trap composed of 27 places in 25 ms of which 1 ms to minimize.
[2024-05-30 02:58:39] [INFO ] Deduced a trap composed of 27 places in 37 ms of which 0 ms to minimize.
[2024-05-30 02:58:39] [INFO ] Deduced a trap composed of 33 places in 41 ms of which 1 ms to minimize.
[2024-05-30 02:58:39] [INFO ] Deduced a trap composed of 28 places in 31 ms of which 1 ms to minimize.
[2024-05-30 02:58:39] [INFO ] Deduced a trap composed of 23 places in 32 ms of which 1 ms to minimize.
[2024-05-30 02:58:39] [INFO ] Deduced a trap composed of 29 places in 32 ms of which 2 ms to minimize.
[2024-05-30 02:58:39] [INFO ] Deduced a trap composed of 32 places in 33 ms of which 1 ms to minimize.
[2024-05-30 02:58:39] [INFO ] Deduced a trap composed of 29 places in 42 ms of which 1 ms to minimize.
[2024-05-30 02:58:39] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/118 variables, 18/159 constraints. Problems are: Problem set: 0 solved, 132 unsolved
[2024-05-30 02:58:40] [INFO ] Deduced a trap composed of 31 places in 42 ms of which 1 ms to minimize.
[2024-05-30 02:58:40] [INFO ] Deduced a trap composed of 30 places in 35 ms of which 0 ms to minimize.
[2024-05-30 02:58:40] [INFO ] Deduced a trap composed of 25 places in 30 ms of which 0 ms to minimize.
[2024-05-30 02:58:40] [INFO ] Deduced a trap composed of 27 places in 21 ms of which 0 ms to minimize.
[2024-05-30 02:58:40] [INFO ] Deduced a trap composed of 24 places in 29 ms of which 1 ms to minimize.
[2024-05-30 02:58:40] [INFO ] Deduced a trap composed of 32 places in 45 ms of which 1 ms to minimize.
[2024-05-30 02:58:40] [INFO ] Deduced a trap composed of 33 places in 29 ms of which 1 ms to minimize.
[2024-05-30 02:58:40] [INFO ] Deduced a trap composed of 28 places in 31 ms of which 1 ms to minimize.
[2024-05-30 02:58:40] [INFO ] Deduced a trap composed of 28 places in 29 ms of which 1 ms to minimize.
[2024-05-30 02:58:40] [INFO ] Deduced a trap composed of 29 places in 30 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/118 variables, 10/169 constraints. Problems are: Problem set: 0 solved, 132 unsolved
[2024-05-30 02:58:41] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 1 ms to minimize.
[2024-05-30 02:58:41] [INFO ] Deduced a trap composed of 27 places in 45 ms of which 0 ms to minimize.
[2024-05-30 02:58:41] [INFO ] Deduced a trap composed of 25 places in 27 ms of which 1 ms to minimize.
[2024-05-30 02:58:41] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 1 ms to minimize.
[2024-05-30 02:58:41] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 0 ms to minimize.
[2024-05-30 02:58:41] [INFO ] Deduced a trap composed of 23 places in 27 ms of which 0 ms to minimize.
[2024-05-30 02:58:41] [INFO ] Deduced a trap composed of 19 places in 24 ms of which 0 ms to minimize.
[2024-05-30 02:58:41] [INFO ] Deduced a trap composed of 24 places in 28 ms of which 1 ms to minimize.
[2024-05-30 02:58:41] [INFO ] Deduced a trap composed of 23 places in 27 ms of which 1 ms to minimize.
[2024-05-30 02:58:41] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 2 ms to minimize.
[2024-05-30 02:58:41] [INFO ] Deduced a trap composed of 28 places in 28 ms of which 1 ms to minimize.
[2024-05-30 02:58:41] [INFO ] Deduced a trap composed of 27 places in 32 ms of which 1 ms to minimize.
[2024-05-30 02:58:41] [INFO ] Deduced a trap composed of 25 places in 27 ms of which 0 ms to minimize.
[2024-05-30 02:58:41] [INFO ] Deduced a trap composed of 28 places in 28 ms of which 1 ms to minimize.
[2024-05-30 02:58:41] [INFO ] Deduced a trap composed of 26 places in 30 ms of which 1 ms to minimize.
[2024-05-30 02:58:41] [INFO ] Deduced a trap composed of 22 places in 23 ms of which 0 ms to minimize.
[2024-05-30 02:58:41] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 1 ms to minimize.
[2024-05-30 02:58:41] [INFO ] Deduced a trap composed of 26 places in 32 ms of which 1 ms to minimize.
[2024-05-30 02:58:41] [INFO ] Deduced a trap composed of 26 places in 28 ms of which 0 ms to minimize.
[2024-05-30 02:58:41] [INFO ] Deduced a trap composed of 29 places in 28 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/118 variables, 20/189 constraints. Problems are: Problem set: 0 solved, 132 unsolved
[2024-05-30 02:58:42] [INFO ] Deduced a trap composed of 23 places in 24 ms of which 0 ms to minimize.
[2024-05-30 02:58:42] [INFO ] Deduced a trap composed of 28 places in 23 ms of which 1 ms to minimize.
[2024-05-30 02:58:42] [INFO ] Deduced a trap composed of 25 places in 24 ms of which 0 ms to minimize.
[2024-05-30 02:58:42] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 0 ms to minimize.
[2024-05-30 02:58:42] [INFO ] Deduced a trap composed of 18 places in 19 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/118 variables, 5/194 constraints. Problems are: Problem set: 0 solved, 132 unsolved
[2024-05-30 02:58:42] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 0 ms to minimize.
[2024-05-30 02:58:42] [INFO ] Deduced a trap composed of 21 places in 23 ms of which 0 ms to minimize.
[2024-05-30 02:58:42] [INFO ] Deduced a trap composed of 16 places in 20 ms of which 1 ms to minimize.
[2024-05-30 02:58:43] [INFO ] Deduced a trap composed of 22 places in 27 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/118 variables, 4/198 constraints. Problems are: Problem set: 0 solved, 132 unsolved
[2024-05-30 02:58:43] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 1 ms to minimize.
[2024-05-30 02:58:43] [INFO ] Deduced a trap composed of 13 places in 18 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/118 variables, 2/200 constraints. Problems are: Problem set: 0 solved, 132 unsolved
[2024-05-30 02:58:43] [INFO ] Deduced a trap composed of 38 places in 41 ms of which 1 ms to minimize.
[2024-05-30 02:58:43] [INFO ] Deduced a trap composed of 29 places in 37 ms of which 1 ms to minimize.
[2024-05-30 02:58:44] [INFO ] Deduced a trap composed of 25 places in 29 ms of which 0 ms to minimize.
[2024-05-30 02:58:44] [INFO ] Deduced a trap composed of 16 places in 18 ms of which 1 ms to minimize.
[2024-05-30 02:58:44] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 0 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/118 variables, 5/205 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/118 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 17 (OVERLAPS) 133/251 variables, 118/323 constraints. Problems are: Problem set: 0 solved, 132 unsolved
[2024-05-30 02:58:45] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 1 ms to minimize.
[2024-05-30 02:58:45] [INFO ] Deduced a trap composed of 27 places in 27 ms of which 1 ms to minimize.
[2024-05-30 02:58:45] [INFO ] Deduced a trap composed of 26 places in 24 ms of which 1 ms to minimize.
[2024-05-30 02:58:45] [INFO ] Deduced a trap composed of 28 places in 31 ms of which 1 ms to minimize.
[2024-05-30 02:58:45] [INFO ] Deduced a trap composed of 27 places in 32 ms of which 0 ms to minimize.
[2024-05-30 02:58:45] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 1 ms to minimize.
[2024-05-30 02:58:45] [INFO ] Deduced a trap composed of 29 places in 27 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/251 variables, 7/330 constraints. Problems are: Problem set: 0 solved, 132 unsolved
[2024-05-30 02:58:46] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 1 ms to minimize.
[2024-05-30 02:58:47] [INFO ] Deduced a trap composed of 21 places in 23 ms of which 1 ms to minimize.
[2024-05-30 02:58:47] [INFO ] Deduced a trap composed of 21 places in 26 ms of which 1 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/251 variables, 3/333 constraints. Problems are: Problem set: 0 solved, 132 unsolved
[2024-05-30 02:58:47] [INFO ] Deduced a trap composed of 23 places in 29 ms of which 0 ms to minimize.
[2024-05-30 02:58:48] [INFO ] Deduced a trap composed of 29 places in 33 ms of which 1 ms to minimize.
[2024-05-30 02:58:48] [INFO ] Deduced a trap composed of 26 places in 29 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/251 variables, 3/336 constraints. Problems are: Problem set: 0 solved, 132 unsolved
[2024-05-30 02:58:48] [INFO ] Deduced a trap composed of 27 places in 40 ms of which 0 ms to minimize.
[2024-05-30 02:58:48] [INFO ] Deduced a trap composed of 28 places in 27 ms of which 0 ms to minimize.
[2024-05-30 02:58:48] [INFO ] Deduced a trap composed of 37 places in 33 ms of which 1 ms to minimize.
[2024-05-30 02:58:48] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 1 ms to minimize.
[2024-05-30 02:58:48] [INFO ] Deduced a trap composed of 27 places in 28 ms of which 1 ms to minimize.
[2024-05-30 02:58:48] [INFO ] Deduced a trap composed of 23 places in 28 ms of which 0 ms to minimize.
[2024-05-30 02:58:49] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 1 ms to minimize.
[2024-05-30 02:58:49] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 1 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/251 variables, 8/344 constraints. Problems are: Problem set: 0 solved, 132 unsolved
[2024-05-30 02:58:50] [INFO ] Deduced a trap composed of 29 places in 32 ms of which 0 ms to minimize.
[2024-05-30 02:58:50] [INFO ] Deduced a trap composed of 27 places in 31 ms of which 0 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/251 variables, 2/346 constraints. Problems are: Problem set: 0 solved, 132 unsolved
[2024-05-30 02:58:50] [INFO ] Deduced a trap composed of 25 places in 39 ms of which 1 ms to minimize.
[2024-05-30 02:58:50] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 1 ms to minimize.
[2024-05-30 02:58:51] [INFO ] Deduced a trap composed of 25 places in 26 ms of which 0 ms to minimize.
[2024-05-30 02:58:51] [INFO ] Deduced a trap composed of 37 places in 38 ms of which 1 ms to minimize.
[2024-05-30 02:58:51] [INFO ] Deduced a trap composed of 27 places in 37 ms of which 1 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/251 variables, 5/351 constraints. Problems are: Problem set: 0 solved, 132 unsolved
[2024-05-30 02:58:51] [INFO ] Deduced a trap composed of 38 places in 40 ms of which 1 ms to minimize.
[2024-05-30 02:58:51] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 1 ms to minimize.
[2024-05-30 02:58:52] [INFO ] Deduced a trap composed of 28 places in 28 ms of which 1 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/251 variables, 3/354 constraints. Problems are: Problem set: 0 solved, 132 unsolved
[2024-05-30 02:58:53] [INFO ] Deduced a trap composed of 32 places in 38 ms of which 0 ms to minimize.
[2024-05-30 02:58:53] [INFO ] Deduced a trap composed of 29 places in 28 ms of which 1 ms to minimize.
[2024-05-30 02:58:53] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 0 ms to minimize.
[2024-05-30 02:58:53] [INFO ] Deduced a trap composed of 36 places in 38 ms of which 1 ms to minimize.
[2024-05-30 02:58:53] [INFO ] Deduced a trap composed of 35 places in 36 ms of which 1 ms to minimize.
[2024-05-30 02:58:53] [INFO ] Deduced a trap composed of 34 places in 35 ms of which 1 ms to minimize.
[2024-05-30 02:58:53] [INFO ] Deduced a trap composed of 35 places in 35 ms of which 1 ms to minimize.
[2024-05-30 02:58:53] [INFO ] Deduced a trap composed of 34 places in 30 ms of which 1 ms to minimize.
[2024-05-30 02:58:53] [INFO ] Deduced a trap composed of 35 places in 28 ms of which 1 ms to minimize.
[2024-05-30 02:58:53] [INFO ] Deduced a trap composed of 33 places in 27 ms of which 0 ms to minimize.
At refinement iteration 25 (INCLUDED_ONLY) 0/251 variables, 10/364 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/251 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 132 unsolved
[2024-05-30 02:58:55] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 1 ms to minimize.
At refinement iteration 27 (OVERLAPS) 0/251 variables, 1/365 constraints. Problems are: Problem set: 0 solved, 132 unsolved
[2024-05-30 02:58:56] [INFO ] Deduced a trap composed of 27 places in 28 ms of which 1 ms to minimize.
[2024-05-30 02:58:56] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 1 ms to minimize.
At refinement iteration 28 (INCLUDED_ONLY) 0/251 variables, 2/367 constraints. Problems are: Problem set: 0 solved, 132 unsolved
[2024-05-30 02:58:57] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 0 ms to minimize.
At refinement iteration 29 (INCLUDED_ONLY) 0/251 variables, 1/368 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/251 variables, 0/368 constraints. Problems are: Problem set: 0 solved, 132 unsolved
[2024-05-30 02:58:59] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 0 ms to minimize.
[2024-05-30 02:58:59] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 0 ms to minimize.
At refinement iteration 31 (OVERLAPS) 0/251 variables, 2/370 constraints. Problems are: Problem set: 0 solved, 132 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 251/251 variables, and 370 constraints, problems are : Problem set: 0 solved, 132 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 118/118 constraints, PredecessorRefiner: 132/132 constraints, Known Traps: 239/239 constraints]
Escalating to Integer solving :Problem set: 0 solved, 132 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 1 (OVERLAPS) 1/118 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/118 variables, 239/252 constraints. Problems are: Problem set: 0 solved, 132 unsolved
[2024-05-30 02:59:00] [INFO ] Deduced a trap composed of 20 places in 20 ms of which 1 ms to minimize.
[2024-05-30 02:59:01] [INFO ] Deduced a trap composed of 26 places in 28 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/118 variables, 2/254 constraints. Problems are: Problem set: 0 solved, 132 unsolved
[2024-05-30 02:59:01] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 1 ms to minimize.
[2024-05-30 02:59:01] [INFO ] Deduced a trap composed of 28 places in 31 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/118 variables, 2/256 constraints. Problems are: Problem set: 0 solved, 132 unsolved
[2024-05-30 02:59:01] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 1 ms to minimize.
[2024-05-30 02:59:02] [INFO ] Deduced a trap composed of 22 places in 28 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/118 variables, 2/258 constraints. Problems are: Problem set: 0 solved, 132 unsolved
[2024-05-30 02:59:02] [INFO ] Deduced a trap composed of 24 places in 21 ms of which 0 ms to minimize.
[2024-05-30 02:59:02] [INFO ] Deduced a trap composed of 22 places in 28 ms of which 1 ms to minimize.
[2024-05-30 02:59:02] [INFO ] Deduced a trap composed of 24 places in 29 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/118 variables, 3/261 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/118 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 8 (OVERLAPS) 133/251 variables, 118/379 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/251 variables, 132/511 constraints. Problems are: Problem set: 0 solved, 132 unsolved
[2024-05-30 02:59:04] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 1 ms to minimize.
[2024-05-30 02:59:04] [INFO ] Deduced a trap composed of 29 places in 37 ms of which 1 ms to minimize.
[2024-05-30 02:59:05] [INFO ] Deduced a trap composed of 31 places in 37 ms of which 1 ms to minimize.
[2024-05-30 02:59:05] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 0 ms to minimize.
[2024-05-30 02:59:05] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
[2024-05-30 02:59:05] [INFO ] Deduced a trap composed of 32 places in 34 ms of which 0 ms to minimize.
[2024-05-30 02:59:05] [INFO ] Deduced a trap composed of 25 places in 26 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/251 variables, 7/518 constraints. Problems are: Problem set: 0 solved, 132 unsolved
[2024-05-30 02:59:09] [INFO ] Deduced a trap composed of 34 places in 38 ms of which 3 ms to minimize.
[2024-05-30 02:59:10] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/251 variables, 2/520 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/251 variables, 0/520 constraints. Problems are: Problem set: 0 solved, 132 unsolved
[2024-05-30 02:59:19] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 0 ms to minimize.
[2024-05-30 02:59:19] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 0 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/251 variables, 2/522 constraints. Problems are: Problem set: 0 solved, 132 unsolved
[2024-05-30 02:59:25] [INFO ] Deduced a trap composed of 27 places in 39 ms of which 1 ms to minimize.
[2024-05-30 02:59:25] [INFO ] Deduced a trap composed of 27 places in 32 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/251 variables, 2/524 constraints. Problems are: Problem set: 0 solved, 132 unsolved
[2024-05-30 02:59:29] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 1 ms to minimize.
[2024-05-30 02:59:29] [INFO ] Deduced a trap composed of 26 places in 40 ms of which 0 ms to minimize.
[2024-05-30 02:59:29] [INFO ] Deduced a trap composed of 26 places in 25 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 251/251 variables, and 527 constraints, problems are : Problem set: 0 solved, 132 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 118/118 constraints, PredecessorRefiner: 132/132 constraints, Known Traps: 264/264 constraints]
After SMT, in 60089ms problems are : Problem set: 0 solved, 132 unsolved
Search for dead transitions found 0 dead transitions in 60101ms
Starting structural reductions in LTL mode, iteration 1 : 118/123 places, 133/138 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60496 ms. Remains : 118/123 places, 133/138 transitions.
Support contains 70 out of 118 places after structural reductions.
[2024-05-30 02:59:30] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2024-05-30 02:59:30] [INFO ] Flatten gal took : 45 ms
[2024-05-30 02:59:30] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA ShieldRVs-PT-003B-CTLCardinality-2023-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-003B-CTLCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-003B-CTLCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-30 02:59:30] [INFO ] Flatten gal took : 15 ms
[2024-05-30 02:59:30] [INFO ] Input system was already deterministic with 133 transitions.
Support contains 63 out of 118 places (down from 70) after GAL structural reductions.
RANDOM walk for 40000 steps (270 resets) in 808 ms. (49 steps per ms) remains 1/48 properties
BEST_FIRST walk for 40004 steps (52 resets) in 85 ms. (465 steps per ms) remains 1/1 properties
[2024-05-30 02:59:30] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 22/26 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 92/118 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/118 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 133/251 variables, 118/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/251 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/251 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 251/251 variables, and 131 constraints, problems are : Problem set: 0 solved, 1 unsolved in 220 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 118/118 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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 22/26 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 92/118 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 02:59:31] [INFO ] Deduced a trap composed of 30 places in 100 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/118 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/118 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 133/251 variables, 118/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/251 variables, 1/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 02:59:31] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 1 ms to minimize.
[2024-05-30 02:59:31] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
[2024-05-30 02:59:31] [INFO ] Deduced a trap composed of 17 places in 70 ms of which 1 ms to minimize.
[2024-05-30 02:59:31] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 1 ms to minimize.
[2024-05-30 02:59:31] [INFO ] Deduced a trap composed of 26 places in 33 ms of which 1 ms to minimize.
[2024-05-30 02:59:31] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 0 ms to minimize.
[2024-05-30 02:59:31] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
[2024-05-30 02:59:31] [INFO ] Deduced a trap composed of 24 places in 29 ms of which 1 ms to minimize.
[2024-05-30 02:59:31] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 0 ms to minimize.
[2024-05-30 02:59:31] [INFO ] Deduced a trap composed of 29 places in 36 ms of which 0 ms to minimize.
[2024-05-30 02:59:31] [INFO ] Deduced a trap composed of 29 places in 33 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/251 variables, 11/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/251 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/251 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 251/251 variables, and 144 constraints, problems are : Problem set: 0 solved, 1 unsolved in 848 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 118/118 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 12/12 constraints]
After SMT, in 1095ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 22 ms.
Support contains 4 out of 118 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 118/118 places, 133/133 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 118 transition count 121
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 24 place count 106 transition count 121
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 24 place count 106 transition count 107
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 52 place count 92 transition count 107
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 66 place count 78 transition count 93
Iterating global reduction 2 with 14 rules applied. Total rules applied 80 place count 78 transition count 93
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 80 place count 78 transition count 87
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 92 place count 72 transition count 87
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 1 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 140 place count 48 transition count 63
Partial Free-agglomeration rule applied 8 times.
Drop transitions (Partial Free agglomeration) removed 8 transitions
Iterating global reduction 2 with 8 rules applied. Total rules applied 148 place count 48 transition count 63
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 149 place count 47 transition count 62
Applied a total of 149 rules in 38 ms. Remains 47 /118 variables (removed 71) and now considering 62/133 (removed 71) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38 ms. Remains : 47/118 places, 62/133 transitions.
RANDOM walk for 2935 steps (49 resets) in 13 ms. (209 steps per ms) remains 0/1 properties
[2024-05-30 02:59:31] [INFO ] Flatten gal took : 18 ms
[2024-05-30 02:59:31] [INFO ] Flatten gal took : 11 ms
[2024-05-30 02:59:31] [INFO ] Input system was already deterministic with 133 transitions.
Computed a total of 34 stabilizing places and 34 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 118/118 places, 133/133 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 103 transition count 118
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 103 transition count 118
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 102 transition count 117
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 102 transition count 117
Applied a total of 32 rules in 10 ms. Remains 102 /118 variables (removed 16) and now considering 117/133 (removed 16) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10 ms. Remains : 102/118 places, 117/133 transitions.
[2024-05-30 02:59:31] [INFO ] Flatten gal took : 7 ms
[2024-05-30 02:59:31] [INFO ] Flatten gal took : 7 ms
[2024-05-30 02:59:31] [INFO ] Input system was already deterministic with 117 transitions.
Starting structural reductions in LTL mode, iteration 0 : 118/118 places, 133/133 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 103 transition count 118
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 103 transition count 118
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 102 transition count 117
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 102 transition count 117
Applied a total of 32 rules in 8 ms. Remains 102 /118 variables (removed 16) and now considering 117/133 (removed 16) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9 ms. Remains : 102/118 places, 117/133 transitions.
[2024-05-30 02:59:31] [INFO ] Flatten gal took : 15 ms
[2024-05-30 02:59:31] [INFO ] Flatten gal took : 7 ms
[2024-05-30 02:59:32] [INFO ] Input system was already deterministic with 117 transitions.
Starting structural reductions in LTL mode, iteration 0 : 118/118 places, 133/133 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 105 transition count 120
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 105 transition count 120
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 104 transition count 119
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 104 transition count 119
Applied a total of 28 rules in 8 ms. Remains 104 /118 variables (removed 14) and now considering 119/133 (removed 14) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 104/118 places, 119/133 transitions.
[2024-05-30 02:59:32] [INFO ] Flatten gal took : 12 ms
[2024-05-30 02:59:32] [INFO ] Flatten gal took : 7 ms
[2024-05-30 02:59:32] [INFO ] Input system was already deterministic with 119 transitions.
Starting structural reductions in LTL mode, iteration 0 : 118/118 places, 133/133 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 102 transition count 117
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 102 transition count 117
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 101 transition count 116
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 101 transition count 116
Applied a total of 34 rules in 9 ms. Remains 101 /118 variables (removed 17) and now considering 116/133 (removed 17) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9 ms. Remains : 101/118 places, 116/133 transitions.
[2024-05-30 02:59:32] [INFO ] Flatten gal took : 26 ms
[2024-05-30 02:59:32] [INFO ] Flatten gal took : 7 ms
[2024-05-30 02:59:32] [INFO ] Input system was already deterministic with 116 transitions.
Starting structural reductions in LTL mode, iteration 0 : 118/118 places, 133/133 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 104 transition count 119
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 104 transition count 119
Applied a total of 28 rules in 7 ms. Remains 104 /118 variables (removed 14) and now considering 119/133 (removed 14) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 104/118 places, 119/133 transitions.
[2024-05-30 02:59:32] [INFO ] Flatten gal took : 6 ms
[2024-05-30 02:59:32] [INFO ] Flatten gal took : 6 ms
[2024-05-30 02:59:32] [INFO ] Input system was already deterministic with 119 transitions.
Starting structural reductions in LTL mode, iteration 0 : 118/118 places, 133/133 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 109 transition count 124
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 109 transition count 124
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 108 transition count 123
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 108 transition count 123
Applied a total of 20 rules in 5 ms. Remains 108 /118 variables (removed 10) and now considering 123/133 (removed 10) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 108/118 places, 123/133 transitions.
[2024-05-30 02:59:32] [INFO ] Flatten gal took : 6 ms
[2024-05-30 02:59:32] [INFO ] Flatten gal took : 6 ms
[2024-05-30 02:59:32] [INFO ] Input system was already deterministic with 123 transitions.
Starting structural reductions in LTL mode, iteration 0 : 118/118 places, 133/133 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 104 transition count 119
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 104 transition count 119
Applied a total of 28 rules in 4 ms. Remains 104 /118 variables (removed 14) and now considering 119/133 (removed 14) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 104/118 places, 119/133 transitions.
[2024-05-30 02:59:32] [INFO ] Flatten gal took : 13 ms
[2024-05-30 02:59:32] [INFO ] Flatten gal took : 5 ms
[2024-05-30 02:59:32] [INFO ] Input system was already deterministic with 119 transitions.
Starting structural reductions in LTL mode, iteration 0 : 118/118 places, 133/133 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 105 transition count 120
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 105 transition count 120
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 104 transition count 119
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 104 transition count 119
Applied a total of 28 rules in 5 ms. Remains 104 /118 variables (removed 14) and now considering 119/133 (removed 14) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 104/118 places, 119/133 transitions.
[2024-05-30 02:59:32] [INFO ] Flatten gal took : 5 ms
[2024-05-30 02:59:32] [INFO ] Flatten gal took : 6 ms
[2024-05-30 02:59:32] [INFO ] Input system was already deterministic with 119 transitions.
Starting structural reductions in LTL mode, iteration 0 : 118/118 places, 133/133 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 104 transition count 119
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 104 transition count 119
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 103 transition count 118
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 103 transition count 118
Applied a total of 30 rules in 4 ms. Remains 103 /118 variables (removed 15) and now considering 118/133 (removed 15) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 103/118 places, 118/133 transitions.
[2024-05-30 02:59:32] [INFO ] Flatten gal took : 5 ms
[2024-05-30 02:59:32] [INFO ] Flatten gal took : 5 ms
[2024-05-30 02:59:32] [INFO ] Input system was already deterministic with 118 transitions.
Starting structural reductions in LTL mode, iteration 0 : 118/118 places, 133/133 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 106 transition count 121
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 106 transition count 121
Applied a total of 24 rules in 8 ms. Remains 106 /118 variables (removed 12) and now considering 121/133 (removed 12) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 106/118 places, 121/133 transitions.
[2024-05-30 02:59:32] [INFO ] Flatten gal took : 5 ms
[2024-05-30 02:59:32] [INFO ] Flatten gal took : 11 ms
[2024-05-30 02:59:32] [INFO ] Input system was already deterministic with 121 transitions.
Starting structural reductions in LTL mode, iteration 0 : 118/118 places, 133/133 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 103 transition count 118
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 103 transition count 118
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 102 transition count 117
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 102 transition count 117
Applied a total of 32 rules in 5 ms. Remains 102 /118 variables (removed 16) and now considering 117/133 (removed 16) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 102/118 places, 117/133 transitions.
[2024-05-30 02:59:32] [INFO ] Flatten gal took : 4 ms
[2024-05-30 02:59:32] [INFO ] Flatten gal took : 5 ms
[2024-05-30 02:59:32] [INFO ] Input system was already deterministic with 117 transitions.
Starting structural reductions in LTL mode, iteration 0 : 118/118 places, 133/133 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 105 transition count 120
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 105 transition count 120
Applied a total of 26 rules in 2 ms. Remains 105 /118 variables (removed 13) and now considering 120/133 (removed 13) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 105/118 places, 120/133 transitions.
[2024-05-30 02:59:32] [INFO ] Flatten gal took : 4 ms
[2024-05-30 02:59:32] [INFO ] Flatten gal took : 4 ms
[2024-05-30 02:59:32] [INFO ] Input system was already deterministic with 120 transitions.
Starting structural reductions in LTL mode, iteration 0 : 118/118 places, 133/133 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 107 transition count 122
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 107 transition count 122
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 106 transition count 121
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 106 transition count 121
Applied a total of 24 rules in 3 ms. Remains 106 /118 variables (removed 12) and now considering 121/133 (removed 12) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 106/118 places, 121/133 transitions.
[2024-05-30 02:59:32] [INFO ] Flatten gal took : 4 ms
[2024-05-30 02:59:32] [INFO ] Flatten gal took : 4 ms
[2024-05-30 02:59:32] [INFO ] Input system was already deterministic with 121 transitions.
[2024-05-30 02:59:32] [INFO ] Flatten gal took : 6 ms
[2024-05-30 02:59:32] [INFO ] Flatten gal took : 9 ms
[2024-05-30 02:59:32] [INFO ] Export to MCC of 13 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 5 ms.
[2024-05-30 02:59:32] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 118 places, 133 transitions and 422 arcs took 2 ms.
Total runtime 63183 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running ShieldRVs-PT-003B

IS_COLORED=
IS_NUPN=

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


SAVING FILE /home/mcc/execution/411/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: 1382
MODEL NAME: /home/mcc/execution/411/model
118 places, 133 transitions.

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

BK_STOP 1717038709630

--------------------
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="ShieldRVs-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 ShieldRVs-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-171683759400745"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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