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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 592K
-rw-r--r-- 1 mcc users 6.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 65K 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.6K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Apr 23 07:52 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 23 07:52 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 19:06 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.2K Apr 12 20:37 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 95K Apr 12 20:37 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Apr 12 20:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 61K Apr 12 20:37 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:52 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:52 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 167K 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 ShieldIIPt-PT-010B-CTLCardinality-2024-00
FORMULA_NAME ShieldIIPt-PT-010B-CTLCardinality-2024-01
FORMULA_NAME ShieldIIPt-PT-010B-CTLCardinality-2024-02
FORMULA_NAME ShieldIIPt-PT-010B-CTLCardinality-2024-03
FORMULA_NAME ShieldIIPt-PT-010B-CTLCardinality-2024-04
FORMULA_NAME ShieldIIPt-PT-010B-CTLCardinality-2024-05
FORMULA_NAME ShieldIIPt-PT-010B-CTLCardinality-2024-06
FORMULA_NAME ShieldIIPt-PT-010B-CTLCardinality-2024-07
FORMULA_NAME ShieldIIPt-PT-010B-CTLCardinality-2024-08
FORMULA_NAME ShieldIIPt-PT-010B-CTLCardinality-2024-09
FORMULA_NAME ShieldIIPt-PT-010B-CTLCardinality-2024-10
FORMULA_NAME ShieldIIPt-PT-010B-CTLCardinality-2024-11
FORMULA_NAME ShieldIIPt-PT-010B-CTLCardinality-2023-12
FORMULA_NAME ShieldIIPt-PT-010B-CTLCardinality-2023-13
FORMULA_NAME ShieldIIPt-PT-010B-CTLCardinality-2023-14
FORMULA_NAME ShieldIIPt-PT-010B-CTLCardinality-2023-15

=== Now, execution of the tool begins

BK_START 1716929449073

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPt-PT-010B
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-28 20:50:50] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-28 20:50:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 20:50:50] [INFO ] Load time of PNML (sax parser for PT used): 105 ms
[2024-05-28 20:50:50] [INFO ] Transformed 703 places.
[2024-05-28 20:50:50] [INFO ] Transformed 653 transitions.
[2024-05-28 20:50:50] [INFO ] Found NUPN structural information;
[2024-05-28 20:50:50] [INFO ] Parsed PT model containing 703 places and 653 transitions and 1626 arcs in 222 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 15 ms.
FORMULA ShieldIIPt-PT-010B-CTLCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 99 out of 703 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 703/703 places, 653/653 transitions.
Discarding 87 places :
Symmetric choice reduction at 0 with 87 rule applications. Total rules 87 place count 616 transition count 566
Iterating global reduction 0 with 87 rules applied. Total rules applied 174 place count 616 transition count 566
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 175 place count 615 transition count 565
Iterating global reduction 0 with 1 rules applied. Total rules applied 176 place count 615 transition count 565
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 177 place count 614 transition count 564
Iterating global reduction 0 with 1 rules applied. Total rules applied 178 place count 614 transition count 564
Applied a total of 178 rules in 151 ms. Remains 614 /703 variables (removed 89) and now considering 564/653 (removed 89) transitions.
// Phase 1: matrix 564 rows 614 cols
[2024-05-28 20:50:50] [INFO ] Computed 91 invariants in 27 ms
[2024-05-28 20:50:51] [INFO ] Implicit Places using invariants in 391 ms returned []
[2024-05-28 20:50:51] [INFO ] Invariant cache hit.
[2024-05-28 20:50:51] [INFO ] Implicit Places using invariants and state equation in 391 ms returned []
Implicit Place search using SMT with State Equation took 812 ms to find 0 implicit places.
Running 563 sub problems to find dead transitions.
[2024-05-28 20:50:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/613 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 563 unsolved
At refinement iteration 1 (OVERLAPS) 1/614 variables, 91/91 constraints. Problems are: Problem set: 0 solved, 563 unsolved
[2024-05-28 20:51:01] [INFO ] Deduced a trap composed of 24 places in 64 ms of which 12 ms to minimize.
[2024-05-28 20:51:01] [INFO ] Deduced a trap composed of 12 places in 51 ms of which 2 ms to minimize.
[2024-05-28 20:51:01] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 1 ms to minimize.
[2024-05-28 20:51:01] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 1 ms to minimize.
[2024-05-28 20:51:01] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 0 ms to minimize.
[2024-05-28 20:51:02] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 1 ms to minimize.
[2024-05-28 20:51:02] [INFO ] Deduced a trap composed of 16 places in 167 ms of which 4 ms to minimize.
[2024-05-28 20:51:02] [INFO ] Deduced a trap composed of 18 places in 48 ms of which 1 ms to minimize.
[2024-05-28 20:51:02] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 1 ms to minimize.
[2024-05-28 20:51:02] [INFO ] Deduced a trap composed of 13 places in 23 ms of which 1 ms to minimize.
[2024-05-28 20:51:02] [INFO ] Deduced a trap composed of 13 places in 22 ms of which 1 ms to minimize.
[2024-05-28 20:51:02] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
[2024-05-28 20:51:02] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 1 ms to minimize.
[2024-05-28 20:51:02] [INFO ] Deduced a trap composed of 22 places in 27 ms of which 1 ms to minimize.
[2024-05-28 20:51:02] [INFO ] Deduced a trap composed of 26 places in 27 ms of which 1 ms to minimize.
[2024-05-28 20:51:02] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 0 ms to minimize.
[2024-05-28 20:51:02] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
[2024-05-28 20:51:03] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 1 ms to minimize.
[2024-05-28 20:51:03] [INFO ] Deduced a trap composed of 17 places in 147 ms of which 4 ms to minimize.
[2024-05-28 20:51:03] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/614 variables, 20/111 constraints. Problems are: Problem set: 0 solved, 563 unsolved
[2024-05-28 20:51:03] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 1 ms to minimize.
[2024-05-28 20:51:04] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 1 ms to minimize.
[2024-05-28 20:51:04] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
[2024-05-28 20:51:04] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 0 ms to minimize.
[2024-05-28 20:51:04] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
[2024-05-28 20:51:04] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 0 ms to minimize.
[2024-05-28 20:51:04] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 0 ms to minimize.
[2024-05-28 20:51:04] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 0 ms to minimize.
[2024-05-28 20:51:05] [INFO ] Deduced a trap composed of 21 places in 23 ms of which 1 ms to minimize.
[2024-05-28 20:51:05] [INFO ] Deduced a trap composed of 22 places in 24 ms of which 0 ms to minimize.
[2024-05-28 20:51:05] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 1 ms to minimize.
[2024-05-28 20:51:05] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 0 ms to minimize.
[2024-05-28 20:51:05] [INFO ] Deduced a trap composed of 21 places in 126 ms of which 3 ms to minimize.
[2024-05-28 20:51:05] [INFO ] Deduced a trap composed of 32 places in 44 ms of which 4 ms to minimize.
[2024-05-28 20:51:05] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
[2024-05-28 20:51:05] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 0 ms to minimize.
[2024-05-28 20:51:05] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 1 ms to minimize.
[2024-05-28 20:51:06] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 1 ms to minimize.
[2024-05-28 20:51:06] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 1 ms to minimize.
[2024-05-28 20:51:06] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/614 variables, 20/131 constraints. Problems are: Problem set: 0 solved, 563 unsolved
[2024-05-28 20:51:11] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 1 ms to minimize.
[2024-05-28 20:51:12] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 0 ms to minimize.
[2024-05-28 20:51:12] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 1 ms to minimize.
[2024-05-28 20:51:13] [INFO ] Deduced a trap composed of 23 places in 111 ms of which 2 ms to minimize.
[2024-05-28 20:51:13] [INFO ] Deduced a trap composed of 26 places in 36 ms of which 1 ms to minimize.
[2024-05-28 20:51:13] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 1 ms to minimize.
[2024-05-28 20:51:13] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
[2024-05-28 20:51:13] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 0 ms to minimize.
[2024-05-28 20:51:13] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 0 ms to minimize.
[2024-05-28 20:51:13] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 0 ms to minimize.
[2024-05-28 20:51:13] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 1 ms to minimize.
[2024-05-28 20:51:13] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 1 ms to minimize.
[2024-05-28 20:51:13] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 0 ms to minimize.
[2024-05-28 20:51:13] [INFO ] Deduced a trap composed of 28 places in 95 ms of which 2 ms to minimize.
[2024-05-28 20:51:14] [INFO ] Deduced a trap composed of 29 places in 39 ms of which 1 ms to minimize.
[2024-05-28 20:51:14] [INFO ] Deduced a trap composed of 36 places in 34 ms of which 1 ms to minimize.
[2024-05-28 20:51:14] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 1 ms to minimize.
[2024-05-28 20:51:14] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 1 ms to minimize.
[2024-05-28 20:51:14] [INFO ] Deduced a trap composed of 33 places in 32 ms of which 1 ms to minimize.
[2024-05-28 20:51:14] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/614 variables, 20/151 constraints. Problems are: Problem set: 0 solved, 563 unsolved
[2024-05-28 20:51:16] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 0 ms to minimize.
[2024-05-28 20:51:16] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
[2024-05-28 20:51:17] [INFO ] Deduced a trap composed of 22 places in 28 ms of which 1 ms to minimize.
[2024-05-28 20:51:17] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 2 ms to minimize.
[2024-05-28 20:51:17] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 1 ms to minimize.
[2024-05-28 20:51:17] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 0 ms to minimize.
[2024-05-28 20:51:17] [INFO ] Deduced a trap composed of 25 places in 80 ms of which 2 ms to minimize.
[2024-05-28 20:51:17] [INFO ] Deduced a trap composed of 25 places in 33 ms of which 1 ms to minimize.
[2024-05-28 20:51:17] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 1 ms to minimize.
[2024-05-28 20:51:17] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 0 ms to minimize.
[2024-05-28 20:51:17] [INFO ] Deduced a trap composed of 18 places in 23 ms of which 1 ms to minimize.
[2024-05-28 20:51:18] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 0 ms to minimize.
[2024-05-28 20:51:18] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 0 ms to minimize.
[2024-05-28 20:51:18] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 1 ms to minimize.
[2024-05-28 20:51:18] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 0 ms to minimize.
[2024-05-28 20:51:18] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 0 ms to minimize.
[2024-05-28 20:51:18] [INFO ] Deduced a trap composed of 22 places in 66 ms of which 2 ms to minimize.
[2024-05-28 20:51:18] [INFO ] Deduced a trap composed of 26 places in 40 ms of which 0 ms to minimize.
[2024-05-28 20:51:18] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 1 ms to minimize.
[2024-05-28 20:51:18] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/614 variables, 20/171 constraints. Problems are: Problem set: 0 solved, 563 unsolved
[2024-05-28 20:51:20] [INFO ] Deduced a trap composed of 23 places in 24 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 614/1178 variables, and 172 constraints, problems are : Problem set: 0 solved, 563 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 91/91 constraints, State Equation: 0/614 constraints, PredecessorRefiner: 563/563 constraints, Known Traps: 81/81 constraints]
Escalating to Integer solving :Problem set: 0 solved, 563 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/613 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 563 unsolved
At refinement iteration 1 (OVERLAPS) 1/614 variables, 91/91 constraints. Problems are: Problem set: 0 solved, 563 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/614 variables, 81/172 constraints. Problems are: Problem set: 0 solved, 563 unsolved
[2024-05-28 20:51:26] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 1 ms to minimize.
[2024-05-28 20:51:26] [INFO ] Deduced a trap composed of 17 places in 24 ms of which 0 ms to minimize.
[2024-05-28 20:51:27] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 0 ms to minimize.
[2024-05-28 20:51:28] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 1 ms to minimize.
[2024-05-28 20:51:28] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
[2024-05-28 20:51:29] [INFO ] Deduced a trap composed of 25 places in 40 ms of which 1 ms to minimize.
[2024-05-28 20:51:29] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 0 ms to minimize.
[2024-05-28 20:51:30] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 1 ms to minimize.
[2024-05-28 20:51:30] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 0 ms to minimize.
[2024-05-28 20:51:30] [INFO ] Deduced a trap composed of 25 places in 34 ms of which 1 ms to minimize.
[2024-05-28 20:51:30] [INFO ] Deduced a trap composed of 24 places in 55 ms of which 2 ms to minimize.
[2024-05-28 20:51:30] [INFO ] Deduced a trap composed of 25 places in 45 ms of which 0 ms to minimize.
[2024-05-28 20:51:30] [INFO ] Deduced a trap composed of 27 places in 38 ms of which 1 ms to minimize.
[2024-05-28 20:51:31] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 1 ms to minimize.
[2024-05-28 20:51:31] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 1 ms to minimize.
[2024-05-28 20:51:31] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 1 ms to minimize.
[2024-05-28 20:51:31] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 1 ms to minimize.
[2024-05-28 20:51:31] [INFO ] Deduced a trap composed of 30 places in 33 ms of which 1 ms to minimize.
[2024-05-28 20:51:31] [INFO ] Deduced a trap composed of 30 places in 42 ms of which 1 ms to minimize.
[2024-05-28 20:51:31] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/614 variables, 20/192 constraints. Problems are: Problem set: 0 solved, 563 unsolved
[2024-05-28 20:51:32] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 1 ms to minimize.
[2024-05-28 20:51:32] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 0 ms to minimize.
[2024-05-28 20:51:32] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 0 ms to minimize.
[2024-05-28 20:51:32] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 1 ms to minimize.
[2024-05-28 20:51:32] [INFO ] Deduced a trap composed of 27 places in 28 ms of which 0 ms to minimize.
[2024-05-28 20:51:32] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 1 ms to minimize.
[2024-05-28 20:51:34] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 0 ms to minimize.
[2024-05-28 20:51:34] [INFO ] Deduced a trap composed of 25 places in 26 ms of which 0 ms to minimize.
[2024-05-28 20:51:35] [INFO ] Deduced a trap composed of 26 places in 36 ms of which 1 ms to minimize.
[2024-05-28 20:51:36] [INFO ] Deduced a trap composed of 26 places in 34 ms of which 0 ms to minimize.
[2024-05-28 20:51:36] [INFO ] Deduced a trap composed of 28 places in 36 ms of which 1 ms to minimize.
[2024-05-28 20:51:36] [INFO ] Deduced a trap composed of 24 places in 44 ms of which 1 ms to minimize.
[2024-05-28 20:51:36] [INFO ] Deduced a trap composed of 21 places in 47 ms of which 1 ms to minimize.
[2024-05-28 20:51:36] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 1 ms to minimize.
[2024-05-28 20:51:36] [INFO ] Deduced a trap composed of 26 places in 36 ms of which 1 ms to minimize.
[2024-05-28 20:51:36] [INFO ] Deduced a trap composed of 27 places in 37 ms of which 1 ms to minimize.
[2024-05-28 20:51:36] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 1 ms to minimize.
[2024-05-28 20:51:36] [INFO ] Deduced a trap composed of 27 places in 42 ms of which 1 ms to minimize.
[2024-05-28 20:51:37] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
[2024-05-28 20:51:37] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/614 variables, 20/212 constraints. Problems are: Problem set: 0 solved, 563 unsolved
[2024-05-28 20:51:41] [INFO ] Deduced a trap composed of 28 places in 35 ms of which 0 ms to minimize.
[2024-05-28 20:51:41] [INFO ] Deduced a trap composed of 25 places in 43 ms of which 1 ms to minimize.
[2024-05-28 20:51:41] [INFO ] Deduced a trap composed of 24 places in 30 ms of which 0 ms to minimize.
[2024-05-28 20:51:42] [INFO ] Deduced a trap composed of 25 places in 32 ms of which 1 ms to minimize.
[2024-05-28 20:51:42] [INFO ] Deduced a trap composed of 28 places in 30 ms of which 0 ms to minimize.
[2024-05-28 20:51:42] [INFO ] Deduced a trap composed of 25 places in 33 ms of which 1 ms to minimize.
[2024-05-28 20:51:42] [INFO ] Deduced a trap composed of 28 places in 26 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/614 variables, 7/219 constraints. Problems are: Problem set: 0 solved, 563 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/614 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 563 unsolved
At refinement iteration 7 (OVERLAPS) 564/1178 variables, 614/833 constraints. Problems are: Problem set: 0 solved, 563 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1178 variables, 563/1396 constraints. Problems are: Problem set: 0 solved, 563 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1178/1178 variables, and 1396 constraints, problems are : Problem set: 0 solved, 563 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 91/91 constraints, State Equation: 614/614 constraints, PredecessorRefiner: 563/563 constraints, Known Traps: 128/128 constraints]
After SMT, in 60163ms problems are : Problem set: 0 solved, 563 unsolved
Search for dead transitions found 0 dead transitions in 60185ms
Starting structural reductions in LTL mode, iteration 1 : 614/703 places, 564/653 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61170 ms. Remains : 614/703 places, 564/653 transitions.
Support contains 99 out of 614 places after structural reductions.
[2024-05-28 20:51:51] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-05-28 20:51:51] [INFO ] Flatten gal took : 66 ms
FORMULA ShieldIIPt-PT-010B-CTLCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-28 20:51:51] [INFO ] Flatten gal took : 30 ms
[2024-05-28 20:51:52] [INFO ] Input system was already deterministic with 564 transitions.
Support contains 83 out of 614 places (down from 99) after GAL structural reductions.
RANDOM walk for 40000 steps (8 resets) in 1797 ms. (22 steps per ms) remains 4/49 properties
BEST_FIRST walk for 40004 steps (8 resets) in 129 ms. (307 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 90 ms. (439 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 93 ms. (425 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 112 ms. (354 steps per ms) remains 4/4 properties
[2024-05-28 20:51:52] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 164/174 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/174 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 440/614 variables, 73/91 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/614 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 564/1178 variables, 614/705 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1178 variables, 0/705 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 0/1178 variables, 0/705 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1178/1178 variables, and 705 constraints, problems are : Problem set: 0 solved, 4 unsolved in 396 ms.
Refiners :[Positive P Invariants (semi-flows): 91/91 constraints, State Equation: 614/614 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 164/174 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/174 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 440/614 variables, 73/91 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-28 20:51:53] [INFO ] Deduced a trap composed of 20 places in 77 ms of which 2 ms to minimize.
[2024-05-28 20:51:53] [INFO ] Deduced a trap composed of 29 places in 63 ms of which 2 ms to minimize.
[2024-05-28 20:51:53] [INFO ] Deduced a trap composed of 19 places in 52 ms of which 2 ms to minimize.
[2024-05-28 20:51:53] [INFO ] Deduced a trap composed of 22 places in 56 ms of which 1 ms to minimize.
[2024-05-28 20:51:53] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 1 ms to minimize.
[2024-05-28 20:51:53] [INFO ] Deduced a trap composed of 18 places in 48 ms of which 1 ms to minimize.
[2024-05-28 20:51:53] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 1 ms to minimize.
[2024-05-28 20:51:53] [INFO ] Deduced a trap composed of 19 places in 70 ms of which 1 ms to minimize.
[2024-05-28 20:51:53] [INFO ] Deduced a trap composed of 26 places in 38 ms of which 1 ms to minimize.
[2024-05-28 20:51:53] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/614 variables, 10/101 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/614 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 564/1178 variables, 614/715 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1178 variables, 4/719 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-28 20:51:54] [INFO ] Deduced a trap composed of 21 places in 86 ms of which 6 ms to minimize.
[2024-05-28 20:51:54] [INFO ] Deduced a trap composed of 21 places in 50 ms of which 2 ms to minimize.
[2024-05-28 20:51:54] [INFO ] Deduced a trap composed of 20 places in 72 ms of which 2 ms to minimize.
[2024-05-28 20:51:54] [INFO ] Deduced a trap composed of 25 places in 62 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1178 variables, 4/723 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-28 20:51:54] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 1 ms to minimize.
[2024-05-28 20:51:54] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/1178 variables, 2/725 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1178 variables, 0/725 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 0/1178 variables, 0/725 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1178/1178 variables, and 725 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1904 ms.
Refiners :[Positive P Invariants (semi-flows): 91/91 constraints, State Equation: 614/614 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 16/16 constraints]
After SMT, in 2309ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 1458 ms.
Support contains 10 out of 614 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 614/614 places, 564/564 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 112 transitions
Trivial Post-agglo rules discarded 112 transitions
Performed 112 trivial Post agglomeration. Transition count delta: 112
Iterating post reduction 0 with 112 rules applied. Total rules applied 112 place count 614 transition count 452
Reduce places removed 112 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 115 rules applied. Total rules applied 227 place count 502 transition count 449
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 230 place count 499 transition count 449
Performed 70 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 70 Pre rules applied. Total rules applied 230 place count 499 transition count 379
Deduced a syphon composed of 70 places in 0 ms
Reduce places removed 70 places and 0 transitions.
Iterating global reduction 3 with 140 rules applied. Total rules applied 370 place count 429 transition count 379
Discarding 17 places :
Symmetric choice reduction at 3 with 17 rule applications. Total rules 387 place count 412 transition count 362
Iterating global reduction 3 with 17 rules applied. Total rules applied 404 place count 412 transition count 362
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 13 Pre rules applied. Total rules applied 404 place count 412 transition count 349
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 430 place count 399 transition count 349
Performed 168 Post agglomeration using F-continuation condition.Transition count delta: 168
Deduced a syphon composed of 168 places in 0 ms
Reduce places removed 168 places and 0 transitions.
Iterating global reduction 3 with 336 rules applied. Total rules applied 766 place count 231 transition count 181
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 767 place count 231 transition count 180
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 769 place count 230 transition count 179
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 4 with 48 rules applied. Total rules applied 817 place count 206 transition count 189
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 818 place count 206 transition count 188
Free-agglomeration rule applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 819 place count 206 transition count 187
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 820 place count 205 transition count 187
Partial Free-agglomeration rule applied 8 times.
Drop transitions (Partial Free agglomeration) removed 8 transitions
Iterating global reduction 6 with 8 rules applied. Total rules applied 828 place count 205 transition count 187
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 829 place count 204 transition count 186
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 831 place count 202 transition count 186
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 831 place count 202 transition count 185
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 833 place count 201 transition count 185
Applied a total of 833 rules in 183 ms. Remains 201 /614 variables (removed 413) and now considering 185/564 (removed 379) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 183 ms. Remains : 201/614 places, 185/564 transitions.
RANDOM walk for 40000 steps (8 resets) in 462 ms. (86 steps per ms) remains 1/4 properties
BEST_FIRST walk for 37732 steps (8 resets) in 99 ms. (377 steps per ms) remains 0/1 properties
[2024-05-28 20:51:56] [INFO ] Flatten gal took : 24 ms
[2024-05-28 20:51:56] [INFO ] Flatten gal took : 26 ms
[2024-05-28 20:51:57] [INFO ] Input system was already deterministic with 564 transitions.
Computed a total of 163 stabilizing places and 163 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 614/614 places, 564/564 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 594 transition count 544
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 594 transition count 544
Applied a total of 40 rules in 22 ms. Remains 594 /614 variables (removed 20) and now considering 544/564 (removed 20) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 22 ms. Remains : 594/614 places, 544/564 transitions.
[2024-05-28 20:51:57] [INFO ] Flatten gal took : 20 ms
[2024-05-28 20:51:57] [INFO ] Flatten gal took : 20 ms
[2024-05-28 20:51:57] [INFO ] Input system was already deterministic with 544 transitions.
Starting structural reductions in LTL mode, iteration 0 : 614/614 places, 564/564 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 591 transition count 541
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 591 transition count 541
Applied a total of 46 rules in 24 ms. Remains 591 /614 variables (removed 23) and now considering 541/564 (removed 23) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 25 ms. Remains : 591/614 places, 541/564 transitions.
[2024-05-28 20:51:57] [INFO ] Flatten gal took : 20 ms
[2024-05-28 20:51:57] [INFO ] Flatten gal took : 19 ms
[2024-05-28 20:51:57] [INFO ] Input system was already deterministic with 541 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 614/614 places, 564/564 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 115 transitions
Trivial Post-agglo rules discarded 115 transitions
Performed 115 trivial Post agglomeration. Transition count delta: 115
Iterating post reduction 0 with 115 rules applied. Total rules applied 115 place count 613 transition count 448
Reduce places removed 115 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 116 rules applied. Total rules applied 231 place count 498 transition count 447
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 232 place count 497 transition count 447
Performed 67 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 67 Pre rules applied. Total rules applied 232 place count 497 transition count 380
Deduced a syphon composed of 67 places in 0 ms
Reduce places removed 67 places and 0 transitions.
Iterating global reduction 3 with 134 rules applied. Total rules applied 366 place count 430 transition count 380
Discarding 18 places :
Symmetric choice reduction at 3 with 18 rule applications. Total rules 384 place count 412 transition count 362
Iterating global reduction 3 with 18 rules applied. Total rules applied 402 place count 412 transition count 362
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 13 Pre rules applied. Total rules applied 402 place count 412 transition count 349
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 428 place count 399 transition count 349
Performed 157 Post agglomeration using F-continuation condition.Transition count delta: 157
Deduced a syphon composed of 157 places in 1 ms
Reduce places removed 157 places and 0 transitions.
Iterating global reduction 3 with 314 rules applied. Total rules applied 742 place count 242 transition count 192
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 743 place count 242 transition count 191
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 745 place count 241 transition count 190
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 747 place count 239 transition count 188
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 749 place count 237 transition count 188
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 749 place count 237 transition count 187
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 751 place count 236 transition count 187
Applied a total of 751 rules in 92 ms. Remains 236 /614 variables (removed 378) and now considering 187/564 (removed 377) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 92 ms. Remains : 236/614 places, 187/564 transitions.
[2024-05-28 20:51:57] [INFO ] Flatten gal took : 8 ms
[2024-05-28 20:51:57] [INFO ] Flatten gal took : 8 ms
[2024-05-28 20:51:57] [INFO ] Input system was already deterministic with 187 transitions.
Starting structural reductions in LTL mode, iteration 0 : 614/614 places, 564/564 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 591 transition count 541
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 591 transition count 541
Applied a total of 46 rules in 22 ms. Remains 591 /614 variables (removed 23) and now considering 541/564 (removed 23) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23 ms. Remains : 591/614 places, 541/564 transitions.
[2024-05-28 20:51:57] [INFO ] Flatten gal took : 20 ms
[2024-05-28 20:51:57] [INFO ] Flatten gal took : 17 ms
[2024-05-28 20:51:57] [INFO ] Input system was already deterministic with 541 transitions.
Starting structural reductions in LTL mode, iteration 0 : 614/614 places, 564/564 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 592 transition count 542
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 592 transition count 542
Applied a total of 44 rules in 23 ms. Remains 592 /614 variables (removed 22) and now considering 542/564 (removed 22) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23 ms. Remains : 592/614 places, 542/564 transitions.
[2024-05-28 20:51:57] [INFO ] Flatten gal took : 16 ms
[2024-05-28 20:51:57] [INFO ] Flatten gal took : 16 ms
[2024-05-28 20:51:57] [INFO ] Input system was already deterministic with 542 transitions.
Starting structural reductions in LTL mode, iteration 0 : 614/614 places, 564/564 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 595 transition count 545
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 595 transition count 545
Applied a total of 38 rules in 21 ms. Remains 595 /614 variables (removed 19) and now considering 545/564 (removed 19) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 22 ms. Remains : 595/614 places, 545/564 transitions.
[2024-05-28 20:51:57] [INFO ] Flatten gal took : 16 ms
[2024-05-28 20:51:57] [INFO ] Flatten gal took : 17 ms
[2024-05-28 20:51:57] [INFO ] Input system was already deterministic with 545 transitions.
Starting structural reductions in LTL mode, iteration 0 : 614/614 places, 564/564 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 591 transition count 541
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 591 transition count 541
Applied a total of 46 rules in 22 ms. Remains 591 /614 variables (removed 23) and now considering 541/564 (removed 23) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 22 ms. Remains : 591/614 places, 541/564 transitions.
[2024-05-28 20:51:57] [INFO ] Flatten gal took : 15 ms
[2024-05-28 20:51:57] [INFO ] Flatten gal took : 15 ms
[2024-05-28 20:51:57] [INFO ] Input system was already deterministic with 541 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 614/614 places, 564/564 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 112 transitions
Trivial Post-agglo rules discarded 112 transitions
Performed 112 trivial Post agglomeration. Transition count delta: 112
Iterating post reduction 0 with 112 rules applied. Total rules applied 112 place count 613 transition count 451
Reduce places removed 112 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 117 rules applied. Total rules applied 229 place count 501 transition count 446
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 234 place count 496 transition count 446
Performed 67 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 67 Pre rules applied. Total rules applied 234 place count 496 transition count 379
Deduced a syphon composed of 67 places in 1 ms
Reduce places removed 67 places and 0 transitions.
Iterating global reduction 3 with 134 rules applied. Total rules applied 368 place count 429 transition count 379
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 382 place count 415 transition count 365
Iterating global reduction 3 with 14 rules applied. Total rules applied 396 place count 415 transition count 365
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 396 place count 415 transition count 355
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 416 place count 405 transition count 355
Performed 152 Post agglomeration using F-continuation condition.Transition count delta: 152
Deduced a syphon composed of 152 places in 1 ms
Reduce places removed 152 places and 0 transitions.
Iterating global reduction 3 with 304 rules applied. Total rules applied 720 place count 253 transition count 203
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 721 place count 253 transition count 202
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 723 place count 252 transition count 201
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 725 place count 250 transition count 199
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 727 place count 248 transition count 199
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 727 place count 248 transition count 198
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 729 place count 247 transition count 198
Applied a total of 729 rules in 63 ms. Remains 247 /614 variables (removed 367) and now considering 198/564 (removed 366) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 64 ms. Remains : 247/614 places, 198/564 transitions.
[2024-05-28 20:51:57] [INFO ] Flatten gal took : 8 ms
[2024-05-28 20:51:57] [INFO ] Flatten gal took : 8 ms
[2024-05-28 20:51:57] [INFO ] Input system was already deterministic with 198 transitions.
Starting structural reductions in LTL mode, iteration 0 : 614/614 places, 564/564 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 592 transition count 542
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 592 transition count 542
Applied a total of 44 rules in 18 ms. Remains 592 /614 variables (removed 22) and now considering 542/564 (removed 22) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18 ms. Remains : 592/614 places, 542/564 transitions.
[2024-05-28 20:51:57] [INFO ] Flatten gal took : 14 ms
[2024-05-28 20:51:57] [INFO ] Flatten gal took : 14 ms
[2024-05-28 20:51:57] [INFO ] Input system was already deterministic with 542 transitions.
Starting structural reductions in LTL mode, iteration 0 : 614/614 places, 564/564 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 592 transition count 542
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 592 transition count 542
Applied a total of 44 rules in 18 ms. Remains 592 /614 variables (removed 22) and now considering 542/564 (removed 22) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18 ms. Remains : 592/614 places, 542/564 transitions.
[2024-05-28 20:51:57] [INFO ] Flatten gal took : 13 ms
[2024-05-28 20:51:57] [INFO ] Flatten gal took : 14 ms
[2024-05-28 20:51:57] [INFO ] Input system was already deterministic with 542 transitions.
Starting structural reductions in LTL mode, iteration 0 : 614/614 places, 564/564 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 592 transition count 542
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 592 transition count 542
Applied a total of 44 rules in 17 ms. Remains 592 /614 variables (removed 22) and now considering 542/564 (removed 22) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18 ms. Remains : 592/614 places, 542/564 transitions.
[2024-05-28 20:51:58] [INFO ] Flatten gal took : 13 ms
[2024-05-28 20:51:58] [INFO ] Flatten gal took : 13 ms
[2024-05-28 20:51:58] [INFO ] Input system was already deterministic with 542 transitions.
Starting structural reductions in LTL mode, iteration 0 : 614/614 places, 564/564 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 594 transition count 544
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 594 transition count 544
Applied a total of 40 rules in 17 ms. Remains 594 /614 variables (removed 20) and now considering 544/564 (removed 20) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17 ms. Remains : 594/614 places, 544/564 transitions.
[2024-05-28 20:51:58] [INFO ] Flatten gal took : 13 ms
[2024-05-28 20:51:58] [INFO ] Flatten gal took : 13 ms
[2024-05-28 20:51:58] [INFO ] Input system was already deterministic with 544 transitions.
Starting structural reductions in LTL mode, iteration 0 : 614/614 places, 564/564 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 591 transition count 541
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 591 transition count 541
Applied a total of 46 rules in 22 ms. Remains 591 /614 variables (removed 23) and now considering 541/564 (removed 23) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 22 ms. Remains : 591/614 places, 541/564 transitions.
[2024-05-28 20:51:58] [INFO ] Flatten gal took : 12 ms
[2024-05-28 20:51:58] [INFO ] Flatten gal took : 13 ms
[2024-05-28 20:51:58] [INFO ] Input system was already deterministic with 541 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 614/614 places, 564/564 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 120 transitions
Trivial Post-agglo rules discarded 120 transitions
Performed 120 trivial Post agglomeration. Transition count delta: 120
Iterating post reduction 0 with 120 rules applied. Total rules applied 120 place count 613 transition count 443
Reduce places removed 120 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 121 rules applied. Total rules applied 241 place count 493 transition count 442
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 242 place count 492 transition count 442
Performed 69 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 69 Pre rules applied. Total rules applied 242 place count 492 transition count 373
Deduced a syphon composed of 69 places in 0 ms
Reduce places removed 69 places and 0 transitions.
Iterating global reduction 3 with 138 rules applied. Total rules applied 380 place count 423 transition count 373
Discarding 18 places :
Symmetric choice reduction at 3 with 18 rule applications. Total rules 398 place count 405 transition count 355
Iterating global reduction 3 with 18 rules applied. Total rules applied 416 place count 405 transition count 355
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 14 Pre rules applied. Total rules applied 416 place count 405 transition count 341
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 444 place count 391 transition count 341
Performed 157 Post agglomeration using F-continuation condition.Transition count delta: 157
Deduced a syphon composed of 157 places in 0 ms
Reduce places removed 157 places and 0 transitions.
Iterating global reduction 3 with 314 rules applied. Total rules applied 758 place count 234 transition count 184
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 759 place count 234 transition count 183
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 761 place count 233 transition count 182
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 763 place count 231 transition count 180
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 765 place count 229 transition count 180
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 765 place count 229 transition count 179
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 767 place count 228 transition count 179
Applied a total of 767 rules in 47 ms. Remains 228 /614 variables (removed 386) and now considering 179/564 (removed 385) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 47 ms. Remains : 228/614 places, 179/564 transitions.
[2024-05-28 20:51:58] [INFO ] Flatten gal took : 5 ms
[2024-05-28 20:51:58] [INFO ] Flatten gal took : 5 ms
[2024-05-28 20:51:58] [INFO ] Input system was already deterministic with 179 transitions.
RANDOM walk for 7 steps (0 resets) in 6 ms. (1 steps per ms) remains 0/1 properties
FORMULA ShieldIIPt-PT-010B-CTLCardinality-2023-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2024-05-28 20:51:58] [INFO ] Flatten gal took : 14 ms
[2024-05-28 20:51:58] [INFO ] Flatten gal took : 15 ms
[2024-05-28 20:51:58] [INFO ] Export to MCC of 13 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 2 ms.
[2024-05-28 20:51:58] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 614 places, 564 transitions and 1448 arcs took 3 ms.
Total runtime 68136 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running ShieldIIPt-PT-010B

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/410/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 614
TRANSITIONS: 564
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.010s, Sys 0.001s]


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


----------------------------------------------------------------------
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: 989
MODEL NAME: /home/mcc/execution/410/model
614 places, 564 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...

BK_TIME_CONFINEMENT_REACHED

--------------------
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
MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

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="ShieldIIPt-PT-010B"
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 ShieldIIPt-PT-010B, 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-171683758400265"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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