fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r355-tall-171683758300217
Last Updated
July 7, 2024

About the Execution of GreatSPN+red for ShieldIIPt-PT-003B

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
13002.315 3600000.00 13897659.00 730.50 TTFTFTFTFF?T?T?? normal

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 500K
-rw-r--r-- 1 mcc users 8.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 91K 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 63K 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.5K May 19 07:15 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 19 16:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 23 07:52 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 23 07:52 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.7K Apr 12 20:33 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 75K Apr 12 20:33 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.6K Apr 12 20:33 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 88K Apr 12 20:33 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 50K 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-003B-CTLCardinality-2024-00
FORMULA_NAME ShieldIIPt-PT-003B-CTLCardinality-2024-01
FORMULA_NAME ShieldIIPt-PT-003B-CTLCardinality-2024-02
FORMULA_NAME ShieldIIPt-PT-003B-CTLCardinality-2024-03
FORMULA_NAME ShieldIIPt-PT-003B-CTLCardinality-2024-04
FORMULA_NAME ShieldIIPt-PT-003B-CTLCardinality-2024-05
FORMULA_NAME ShieldIIPt-PT-003B-CTLCardinality-2024-06
FORMULA_NAME ShieldIIPt-PT-003B-CTLCardinality-2024-07
FORMULA_NAME ShieldIIPt-PT-003B-CTLCardinality-2024-08
FORMULA_NAME ShieldIIPt-PT-003B-CTLCardinality-2024-09
FORMULA_NAME ShieldIIPt-PT-003B-CTLCardinality-2024-10
FORMULA_NAME ShieldIIPt-PT-003B-CTLCardinality-2024-11
FORMULA_NAME ShieldIIPt-PT-003B-CTLCardinality-2023-12
FORMULA_NAME ShieldIIPt-PT-003B-CTLCardinality-2023-13
FORMULA_NAME ShieldIIPt-PT-003B-CTLCardinality-2023-14
FORMULA_NAME ShieldIIPt-PT-003B-CTLCardinality-2023-15

=== Now, execution of the tool begins

BK_START 1716925788228

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-003B
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-28 19:49:49] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-28 19:49:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 19:49:49] [INFO ] Load time of PNML (sax parser for PT used): 71 ms
[2024-05-28 19:49:49] [INFO ] Transformed 213 places.
[2024-05-28 19:49:49] [INFO ] Transformed 198 transitions.
[2024-05-28 19:49:49] [INFO ] Found NUPN structural information;
[2024-05-28 19:49:49] [INFO ] Parsed PT model containing 213 places and 198 transitions and 492 arcs in 177 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 16 ms.
Support contains 105 out of 213 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 213/213 places, 198/198 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 203 transition count 188
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 203 transition count 188
Applied a total of 20 rules in 31 ms. Remains 203 /213 variables (removed 10) and now considering 188/198 (removed 10) transitions.
// Phase 1: matrix 188 rows 203 cols
[2024-05-28 19:49:49] [INFO ] Computed 28 invariants in 17 ms
[2024-05-28 19:49:49] [INFO ] Implicit Places using invariants in 223 ms returned []
[2024-05-28 19:49:49] [INFO ] Invariant cache hit.
[2024-05-28 19:49:50] [INFO ] Implicit Places using invariants and state equation in 144 ms returned []
Implicit Place search using SMT with State Equation took 394 ms to find 0 implicit places.
Running 187 sub problems to find dead transitions.
[2024-05-28 19:49:50] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/202 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 1 (OVERLAPS) 1/203 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 187 unsolved
[2024-05-28 19:49:51] [INFO ] Deduced a trap composed of 27 places in 50 ms of which 10 ms to minimize.
[2024-05-28 19:49:51] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 1 ms to minimize.
[2024-05-28 19:49:51] [INFO ] Deduced a trap composed of 12 places in 23 ms of which 0 ms to minimize.
[2024-05-28 19:49:51] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 1 ms to minimize.
[2024-05-28 19:49:51] [INFO ] Deduced a trap composed of 22 places in 29 ms of which 1 ms to minimize.
[2024-05-28 19:49:51] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 1 ms to minimize.
[2024-05-28 19:49:51] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 1 ms to minimize.
[2024-05-28 19:49:52] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
[2024-05-28 19:49:52] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 1 ms to minimize.
[2024-05-28 19:49:52] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 1 ms to minimize.
[2024-05-28 19:49:52] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 1 ms to minimize.
[2024-05-28 19:49:52] [INFO ] Deduced a trap composed of 21 places in 24 ms of which 1 ms to minimize.
[2024-05-28 19:49:52] [INFO ] Deduced a trap composed of 22 places in 54 ms of which 1 ms to minimize.
[2024-05-28 19:49:52] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 1 ms to minimize.
[2024-05-28 19:49:52] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 1 ms to minimize.
[2024-05-28 19:49:52] [INFO ] Deduced a trap composed of 13 places in 22 ms of which 1 ms to minimize.
[2024-05-28 19:49:52] [INFO ] Deduced a trap composed of 19 places in 22 ms of which 1 ms to minimize.
[2024-05-28 19:49:52] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 1 ms to minimize.
[2024-05-28 19:49:52] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 1 ms to minimize.
[2024-05-28 19:49:52] [INFO ] Deduced a trap composed of 22 places in 23 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/203 variables, 20/48 constraints. Problems are: Problem set: 0 solved, 187 unsolved
[2024-05-28 19:49:52] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
[2024-05-28 19:49:52] [INFO ] Deduced a trap composed of 29 places in 47 ms of which 1 ms to minimize.
[2024-05-28 19:49:52] [INFO ] Deduced a trap composed of 26 places in 30 ms of which 1 ms to minimize.
[2024-05-28 19:49:53] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
[2024-05-28 19:49:53] [INFO ] Deduced a trap composed of 18 places in 19 ms of which 1 ms to minimize.
[2024-05-28 19:49:53] [INFO ] Deduced a trap composed of 24 places in 29 ms of which 1 ms to minimize.
[2024-05-28 19:49:53] [INFO ] Deduced a trap composed of 19 places in 22 ms of which 1 ms to minimize.
[2024-05-28 19:49:53] [INFO ] Deduced a trap composed of 27 places in 36 ms of which 1 ms to minimize.
[2024-05-28 19:49:53] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 1 ms to minimize.
[2024-05-28 19:49:53] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 1 ms to minimize.
[2024-05-28 19:49:53] [INFO ] Deduced a trap composed of 24 places in 22 ms of which 1 ms to minimize.
[2024-05-28 19:49:53] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
[2024-05-28 19:49:53] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 1 ms to minimize.
[2024-05-28 19:49:53] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 1 ms to minimize.
[2024-05-28 19:49:53] [INFO ] Deduced a trap composed of 14 places in 21 ms of which 4 ms to minimize.
[2024-05-28 19:49:53] [INFO ] Deduced a trap composed of 17 places in 24 ms of which 0 ms to minimize.
[2024-05-28 19:49:53] [INFO ] Deduced a trap composed of 18 places in 51 ms of which 1 ms to minimize.
[2024-05-28 19:49:53] [INFO ] Deduced a trap composed of 26 places in 27 ms of which 1 ms to minimize.
[2024-05-28 19:49:53] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 0 ms to minimize.
[2024-05-28 19:49:53] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/203 variables, 20/68 constraints. Problems are: Problem set: 0 solved, 187 unsolved
[2024-05-28 19:49:54] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
[2024-05-28 19:49:54] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 1 ms to minimize.
[2024-05-28 19:49:54] [INFO ] Deduced a trap composed of 18 places in 23 ms of which 1 ms to minimize.
[2024-05-28 19:49:54] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 0 ms to minimize.
[2024-05-28 19:49:54] [INFO ] Deduced a trap composed of 22 places in 24 ms of which 1 ms to minimize.
[2024-05-28 19:49:55] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 0 ms to minimize.
[2024-05-28 19:49:55] [INFO ] Deduced a trap composed of 21 places in 25 ms of which 0 ms to minimize.
[2024-05-28 19:49:55] [INFO ] Deduced a trap composed of 20 places in 22 ms of which 1 ms to minimize.
[2024-05-28 19:49:55] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 0 ms to minimize.
[2024-05-28 19:49:55] [INFO ] Deduced a trap composed of 21 places in 20 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/203 variables, 10/78 constraints. Problems are: Problem set: 0 solved, 187 unsolved
[2024-05-28 19:49:55] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 2 ms to minimize.
[2024-05-28 19:49:56] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/203 variables, 2/80 constraints. Problems are: Problem set: 0 solved, 187 unsolved
[2024-05-28 19:49:56] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 1 ms to minimize.
[2024-05-28 19:49:56] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/203 variables, 2/82 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/203 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 8 (OVERLAPS) 188/391 variables, 203/285 constraints. Problems are: Problem set: 0 solved, 187 unsolved
[2024-05-28 19:49:58] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
[2024-05-28 19:49:59] [INFO ] Deduced a trap composed of 29 places in 35 ms of which 1 ms to minimize.
[2024-05-28 19:49:59] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 2 ms to minimize.
[2024-05-28 19:49:59] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 1 ms to minimize.
[2024-05-28 19:49:59] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 0 ms to minimize.
[2024-05-28 19:49:59] [INFO ] Deduced a trap composed of 22 places in 27 ms of which 0 ms to minimize.
[2024-05-28 19:49:59] [INFO ] Deduced a trap composed of 22 places in 20 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/391 variables, 7/292 constraints. Problems are: Problem set: 0 solved, 187 unsolved
[2024-05-28 19:50:00] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/391 variables, 1/293 constraints. Problems are: Problem set: 0 solved, 187 unsolved
[2024-05-28 19:50:02] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/391 variables, 1/294 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/391 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 187 unsolved
[2024-05-28 19:50:05] [INFO ] Deduced a trap composed of 30 places in 42 ms of which 1 ms to minimize.
[2024-05-28 19:50:05] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 1 ms to minimize.
[2024-05-28 19:50:05] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 0 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/391 variables, 3/297 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/391 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 187 unsolved
[2024-05-28 19:50:07] [INFO ] Deduced a trap composed of 21 places in 25 ms of which 0 ms to minimize.
At refinement iteration 15 (OVERLAPS) 0/391 variables, 1/298 constraints. Problems are: Problem set: 0 solved, 187 unsolved
[2024-05-28 19:50:09] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
[2024-05-28 19:50:09] [INFO ] Deduced a trap composed of 22 places in 23 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/391 variables, 2/300 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/391 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 187 unsolved
[2024-05-28 19:50:11] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
At refinement iteration 18 (OVERLAPS) 0/391 variables, 1/301 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/391 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 187 unsolved
[2024-05-28 19:50:14] [INFO ] Deduced a trap composed of 22 places in 27 ms of which 1 ms to minimize.
At refinement iteration 20 (OVERLAPS) 0/391 variables, 1/302 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/391 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 22 (OVERLAPS) 0/391 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 187 unsolved
No progress, stopping.
After SMT solving in domain Real declared 391/391 variables, and 302 constraints, problems are : Problem set: 0 solved, 187 unsolved in 28058 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, State Equation: 203/203 constraints, PredecessorRefiner: 187/187 constraints, Known Traps: 71/71 constraints]
Escalating to Integer solving :Problem set: 0 solved, 187 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/202 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 1 (OVERLAPS) 1/203 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/203 variables, 71/99 constraints. Problems are: Problem set: 0 solved, 187 unsolved
[2024-05-28 19:50:19] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 1 ms to minimize.
[2024-05-28 19:50:19] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 0 ms to minimize.
[2024-05-28 19:50:19] [INFO ] Deduced a trap composed of 27 places in 33 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/203 variables, 3/102 constraints. Problems are: Problem set: 0 solved, 187 unsolved
[2024-05-28 19:50:20] [INFO ] Deduced a trap composed of 26 places in 31 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/203 variables, 1/103 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/203 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 6 (OVERLAPS) 188/391 variables, 203/306 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/391 variables, 187/493 constraints. Problems are: Problem set: 0 solved, 187 unsolved
[2024-05-28 19:50:22] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
[2024-05-28 19:50:22] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 0 ms to minimize.
[2024-05-28 19:50:23] [INFO ] Deduced a trap composed of 20 places in 52 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/391 variables, 3/496 constraints. Problems are: Problem set: 0 solved, 187 unsolved
[2024-05-28 19:50:25] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 1 ms to minimize.
[2024-05-28 19:50:25] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
[2024-05-28 19:50:25] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 1 ms to minimize.
[2024-05-28 19:50:25] [INFO ] Deduced a trap composed of 33 places in 35 ms of which 0 ms to minimize.
[2024-05-28 19:50:26] [INFO ] Deduced a trap composed of 27 places in 26 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/391 variables, 5/501 constraints. Problems are: Problem set: 0 solved, 187 unsolved
[2024-05-28 19:50:28] [INFO ] Deduced a trap composed of 21 places in 63 ms of which 1 ms to minimize.
[2024-05-28 19:50:29] [INFO ] Deduced a trap composed of 33 places in 28 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/391 variables, 2/503 constraints. Problems are: Problem set: 0 solved, 187 unsolved
[2024-05-28 19:50:32] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/391 variables, 1/504 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/391 variables, 0/504 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 13 (OVERLAPS) 0/391 variables, 0/504 constraints. Problems are: Problem set: 0 solved, 187 unsolved
No progress, stopping.
After SMT solving in domain Int declared 391/391 variables, and 504 constraints, problems are : Problem set: 0 solved, 187 unsolved in 25566 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, State Equation: 203/203 constraints, PredecessorRefiner: 187/187 constraints, Known Traps: 86/86 constraints]
After SMT, in 53708ms problems are : Problem set: 0 solved, 187 unsolved
Search for dead transitions found 0 dead transitions in 53726ms
Starting structural reductions in LTL mode, iteration 1 : 203/213 places, 188/198 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 54172 ms. Remains : 203/213 places, 188/198 transitions.
Support contains 105 out of 203 places after structural reductions.
[2024-05-28 19:50:43] [INFO ] Flatten gal took : 39 ms
[2024-05-28 19:50:43] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA ShieldIIPt-PT-003B-CTLCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-28 19:50:44] [INFO ] Flatten gal took : 17 ms
[2024-05-28 19:50:44] [INFO ] Input system was already deterministic with 188 transitions.
Support contains 93 out of 203 places (down from 105) after GAL structural reductions.
RANDOM walk for 40000 steps (8 resets) in 1302 ms. (30 steps per ms) remains 2/56 properties
BEST_FIRST walk for 40003 steps (8 resets) in 226 ms. (176 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (8 resets) in 180 ms. (221 steps per ms) remains 2/2 properties
[2024-05-28 19:50:44] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 94/102 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 101/203 variables, 13/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/203 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 188/391 variables, 203/231 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/391 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 0/391 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 391/391 variables, and 231 constraints, problems are : Problem set: 0 solved, 2 unsolved in 127 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, State Equation: 203/203 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem AtomicPropp25 is UNSAT
At refinement iteration 1 (OVERLAPS) 94/102 variables, 15/15 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-28 19:50:44] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 1 ms to minimize.
[2024-05-28 19:50:44] [INFO ] Deduced a trap composed of 19 places in 21 ms of which 1 ms to minimize.
Problem AtomicPropp20 is UNSAT
After SMT solving in domain Int declared 102/391 variables, and 17 constraints, problems are : Problem set: 2 solved, 0 unsolved in 97 ms.
Refiners :[Positive P Invariants (semi-flows): 15/28 constraints, State Equation: 0/203 constraints, PredecessorRefiner: 0/2 constraints, Known Traps: 2/2 constraints]
After SMT, in 229ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 2 atomic propositions for a total of 15 simplifications.
[2024-05-28 19:50:44] [INFO ] Flatten gal took : 10 ms
[2024-05-28 19:50:44] [INFO ] Flatten gal took : 10 ms
[2024-05-28 19:50:44] [INFO ] Input system was already deterministic with 188 transitions.
Computed a total of 54 stabilizing places and 54 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 203/203 places, 188/188 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 0 with 42 rules applied. Total rules applied 42 place count 202 transition count 145
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 1 with 42 rules applied. Total rules applied 84 place count 160 transition count 145
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 84 place count 160 transition count 129
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 116 place count 144 transition count 129
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 131 place count 129 transition count 114
Iterating global reduction 2 with 15 rules applied. Total rules applied 146 place count 129 transition count 114
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 146 place count 129 transition count 104
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 166 place count 119 transition count 104
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: 47
Deduced a syphon composed of 47 places in 0 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 2 with 94 rules applied. Total rules applied 260 place count 72 transition count 57
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 261 place count 72 transition count 56
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 263 place count 71 transition count 55
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 265 place count 69 transition count 53
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 267 place count 67 transition count 53
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 267 place count 67 transition count 52
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 269 place count 66 transition count 52
Applied a total of 269 rules in 50 ms. Remains 66 /203 variables (removed 137) and now considering 52/188 (removed 136) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 50 ms. Remains : 66/203 places, 52/188 transitions.
[2024-05-28 19:50:45] [INFO ] Flatten gal took : 3 ms
[2024-05-28 19:50:45] [INFO ] Flatten gal took : 3 ms
[2024-05-28 19:50:45] [INFO ] Input system was already deterministic with 52 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 203/203 places, 188/188 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 39 transitions
Trivial Post-agglo rules discarded 39 transitions
Performed 39 trivial Post agglomeration. Transition count delta: 39
Iterating post reduction 0 with 39 rules applied. Total rules applied 39 place count 202 transition count 148
Reduce places removed 39 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 41 rules applied. Total rules applied 80 place count 163 transition count 146
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 82 place count 161 transition count 146
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 15 Pre rules applied. Total rules applied 82 place count 161 transition count 131
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 112 place count 146 transition count 131
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 127 place count 131 transition count 116
Iterating global reduction 3 with 15 rules applied. Total rules applied 142 place count 131 transition count 116
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 142 place count 131 transition count 107
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 160 place count 122 transition count 107
Performed 46 Post agglomeration using F-continuation condition.Transition count delta: 46
Deduced a syphon composed of 46 places in 0 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 3 with 92 rules applied. Total rules applied 252 place count 76 transition count 61
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 253 place count 76 transition count 60
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 255 place count 74 transition count 58
Applied a total of 255 rules in 25 ms. Remains 74 /203 variables (removed 129) and now considering 58/188 (removed 130) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 25 ms. Remains : 74/203 places, 58/188 transitions.
[2024-05-28 19:50:45] [INFO ] Flatten gal took : 3 ms
[2024-05-28 19:50:45] [INFO ] Flatten gal took : 3 ms
[2024-05-28 19:50:45] [INFO ] Input system was already deterministic with 58 transitions.
Starting structural reductions in LTL mode, iteration 0 : 203/203 places, 188/188 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 182 transition count 167
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 182 transition count 167
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 181 transition count 166
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 181 transition count 166
Applied a total of 44 rules in 9 ms. Remains 181 /203 variables (removed 22) and now considering 166/188 (removed 22) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9 ms. Remains : 181/203 places, 166/188 transitions.
[2024-05-28 19:50:45] [INFO ] Flatten gal took : 7 ms
[2024-05-28 19:50:45] [INFO ] Flatten gal took : 7 ms
[2024-05-28 19:50:45] [INFO ] Input system was already deterministic with 166 transitions.
Starting structural reductions in LTL mode, iteration 0 : 203/203 places, 188/188 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 181 transition count 166
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 181 transition count 166
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 180 transition count 165
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 180 transition count 165
Applied a total of 46 rules in 8 ms. Remains 180 /203 variables (removed 23) and now considering 165/188 (removed 23) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 180/203 places, 165/188 transitions.
[2024-05-28 19:50:45] [INFO ] Flatten gal took : 7 ms
[2024-05-28 19:50:45] [INFO ] Flatten gal took : 7 ms
[2024-05-28 19:50:45] [INFO ] Input system was already deterministic with 165 transitions.
Starting structural reductions in LTL mode, iteration 0 : 203/203 places, 188/188 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 180 transition count 165
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 180 transition count 165
Applied a total of 46 rules in 7 ms. Remains 180 /203 variables (removed 23) and now considering 165/188 (removed 23) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 180/203 places, 165/188 transitions.
[2024-05-28 19:50:45] [INFO ] Flatten gal took : 6 ms
[2024-05-28 19:50:45] [INFO ] Flatten gal took : 6 ms
[2024-05-28 19:50:45] [INFO ] Input system was already deterministic with 165 transitions.
Starting structural reductions in LTL mode, iteration 0 : 203/203 places, 188/188 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 179 transition count 164
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 179 transition count 164
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 178 transition count 163
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 178 transition count 163
Applied a total of 50 rules in 9 ms. Remains 178 /203 variables (removed 25) and now considering 163/188 (removed 25) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9 ms. Remains : 178/203 places, 163/188 transitions.
[2024-05-28 19:50:45] [INFO ] Flatten gal took : 9 ms
[2024-05-28 19:50:45] [INFO ] Flatten gal took : 6 ms
[2024-05-28 19:50:45] [INFO ] Input system was already deterministic with 163 transitions.
Starting structural reductions in LTL mode, iteration 0 : 203/203 places, 188/188 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 184 transition count 169
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 184 transition count 169
Applied a total of 38 rules in 6 ms. Remains 184 /203 variables (removed 19) and now considering 169/188 (removed 19) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 184/203 places, 169/188 transitions.
[2024-05-28 19:50:45] [INFO ] Flatten gal took : 6 ms
[2024-05-28 19:50:45] [INFO ] Flatten gal took : 6 ms
[2024-05-28 19:50:45] [INFO ] Input system was already deterministic with 169 transitions.
Starting structural reductions in LTL mode, iteration 0 : 203/203 places, 188/188 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 180 transition count 165
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 180 transition count 165
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 179 transition count 164
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 179 transition count 164
Applied a total of 48 rules in 9 ms. Remains 179 /203 variables (removed 24) and now considering 164/188 (removed 24) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10 ms. Remains : 179/203 places, 164/188 transitions.
[2024-05-28 19:50:45] [INFO ] Flatten gal took : 6 ms
[2024-05-28 19:50:45] [INFO ] Flatten gal took : 6 ms
[2024-05-28 19:50:45] [INFO ] Input system was already deterministic with 164 transitions.
Starting structural reductions in LTL mode, iteration 0 : 203/203 places, 188/188 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 181 transition count 166
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 181 transition count 166
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 180 transition count 165
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 180 transition count 165
Applied a total of 46 rules in 9 ms. Remains 180 /203 variables (removed 23) and now considering 165/188 (removed 23) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9 ms. Remains : 180/203 places, 165/188 transitions.
[2024-05-28 19:50:45] [INFO ] Flatten gal took : 6 ms
[2024-05-28 19:50:45] [INFO ] Flatten gal took : 6 ms
[2024-05-28 19:50:45] [INFO ] Input system was already deterministic with 165 transitions.
Starting structural reductions in LTL mode, iteration 0 : 203/203 places, 188/188 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 179 transition count 164
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 179 transition count 164
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 178 transition count 163
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 178 transition count 163
Applied a total of 50 rules in 9 ms. Remains 178 /203 variables (removed 25) and now considering 163/188 (removed 25) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9 ms. Remains : 178/203 places, 163/188 transitions.
[2024-05-28 19:50:45] [INFO ] Flatten gal took : 6 ms
[2024-05-28 19:50:45] [INFO ] Flatten gal took : 6 ms
[2024-05-28 19:50:45] [INFO ] Input system was already deterministic with 163 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 203/203 places, 188/188 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 0 with 40 rules applied. Total rules applied 40 place count 202 transition count 147
Reduce places removed 40 places and 0 transitions.
Iterating post reduction 1 with 40 rules applied. Total rules applied 80 place count 162 transition count 147
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 80 place count 162 transition count 130
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 114 place count 145 transition count 130
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 128 place count 131 transition count 116
Iterating global reduction 2 with 14 rules applied. Total rules applied 142 place count 131 transition count 116
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 142 place count 131 transition count 106
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 162 place count 121 transition count 106
Performed 46 Post agglomeration using F-continuation condition.Transition count delta: 46
Deduced a syphon composed of 46 places in 0 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 2 with 92 rules applied. Total rules applied 254 place count 75 transition count 60
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 255 place count 75 transition count 59
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 257 place count 74 transition count 58
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 259 place count 72 transition count 56
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 261 place count 70 transition count 56
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 261 place count 70 transition count 55
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 263 place count 69 transition count 55
Applied a total of 263 rules in 31 ms. Remains 69 /203 variables (removed 134) and now considering 55/188 (removed 133) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 32 ms. Remains : 69/203 places, 55/188 transitions.
[2024-05-28 19:50:45] [INFO ] Flatten gal took : 3 ms
[2024-05-28 19:50:45] [INFO ] Flatten gal took : 3 ms
[2024-05-28 19:50:45] [INFO ] Input system was already deterministic with 55 transitions.
Starting structural reductions in LTL mode, iteration 0 : 203/203 places, 188/188 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 179 transition count 164
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 179 transition count 164
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 178 transition count 163
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 178 transition count 163
Applied a total of 50 rules in 9 ms. Remains 178 /203 variables (removed 25) and now considering 163/188 (removed 25) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9 ms. Remains : 178/203 places, 163/188 transitions.
[2024-05-28 19:50:45] [INFO ] Flatten gal took : 6 ms
[2024-05-28 19:50:45] [INFO ] Flatten gal took : 5 ms
[2024-05-28 19:50:45] [INFO ] Input system was already deterministic with 163 transitions.
Starting structural reductions in LTL mode, iteration 0 : 203/203 places, 188/188 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 180 transition count 165
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 180 transition count 165
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 179 transition count 164
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 179 transition count 164
Applied a total of 48 rules in 12 ms. Remains 179 /203 variables (removed 24) and now considering 164/188 (removed 24) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12 ms. Remains : 179/203 places, 164/188 transitions.
[2024-05-28 19:50:45] [INFO ] Flatten gal took : 6 ms
[2024-05-28 19:50:45] [INFO ] Flatten gal took : 5 ms
[2024-05-28 19:50:45] [INFO ] Input system was already deterministic with 164 transitions.
Starting structural reductions in LTL mode, iteration 0 : 203/203 places, 188/188 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 185 transition count 170
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 185 transition count 170
Applied a total of 36 rules in 6 ms. Remains 185 /203 variables (removed 18) and now considering 170/188 (removed 18) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 185/203 places, 170/188 transitions.
[2024-05-28 19:50:45] [INFO ] Flatten gal took : 5 ms
[2024-05-28 19:50:45] [INFO ] Flatten gal took : 6 ms
[2024-05-28 19:50:45] [INFO ] Input system was already deterministic with 170 transitions.
Starting structural reductions in LTL mode, iteration 0 : 203/203 places, 188/188 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 182 transition count 167
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 182 transition count 167
Applied a total of 42 rules in 6 ms. Remains 182 /203 variables (removed 21) and now considering 167/188 (removed 21) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 182/203 places, 167/188 transitions.
[2024-05-28 19:50:45] [INFO ] Flatten gal took : 6 ms
[2024-05-28 19:50:45] [INFO ] Flatten gal took : 5 ms
[2024-05-28 19:50:45] [INFO ] Input system was already deterministic with 167 transitions.
[2024-05-28 19:50:45] [INFO ] Flatten gal took : 7 ms
[2024-05-28 19:50:45] [INFO ] Flatten gal took : 6 ms
[2024-05-28 19:50:45] [INFO ] Export to MCC of 15 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 3 ms.
[2024-05-28 19:50:45] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 203 places, 188 transitions and 472 arcs took 2 ms.
Total runtime 56217 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running ShieldIIPt-PT-003B

IS_COLORED=
IS_NUPN=

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


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


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

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

Process ID: 821
MODEL NAME: /home/mcc/execution/412/model
203 places, 188 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA ShieldIIPt-PT-003B-CTLCardinality-2024-00 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA ShieldIIPt-PT-003B-CTLCardinality-2024-11 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA ShieldIIPt-PT-003B-CTLCardinality-2024-04 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA ShieldIIPt-PT-003B-CTLCardinality-2024-02 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA ShieldIIPt-PT-003B-CTLCardinality-2024-03 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA ShieldIIPt-PT-003B-CTLCardinality-2024-01 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA ShieldIIPt-PT-003B-CTLCardinality-2024-08 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA ShieldIIPt-PT-003B-CTLCardinality-2024-09 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA ShieldIIPt-PT-003B-CTLCardinality-2024-06 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA ShieldIIPt-PT-003B-CTLCardinality-2024-07 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA ShieldIIPt-PT-003B-CTLCardinality-2023-13 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL

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

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

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