Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r289-tajo-171654445000017.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.....................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is PhilosophersDyn-COL-20, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r289-tajo-171654445000017
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 548K
-rw-r--r-- 1 mcc users 7.2K Apr 11 16:20 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K Apr 11 16:20 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Apr 11 16:10 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K Apr 11 16:10 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 23 07:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 23 07:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 23 07:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 11 18:40 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 145K Apr 11 18:40 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Apr 11 18:30 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 104K Apr 11 18:30 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 3 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 32K 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 PhilosophersDyn-COL-20-CTLCardinality-2024-00
FORMULA_NAME PhilosophersDyn-COL-20-CTLCardinality-2024-01
FORMULA_NAME PhilosophersDyn-COL-20-CTLCardinality-2024-02
FORMULA_NAME PhilosophersDyn-COL-20-CTLCardinality-2024-03
FORMULA_NAME PhilosophersDyn-COL-20-CTLCardinality-2024-04
FORMULA_NAME PhilosophersDyn-COL-20-CTLCardinality-2024-05
FORMULA_NAME PhilosophersDyn-COL-20-CTLCardinality-2024-06
FORMULA_NAME PhilosophersDyn-COL-20-CTLCardinality-2024-07
FORMULA_NAME PhilosophersDyn-COL-20-CTLCardinality-2024-08
FORMULA_NAME PhilosophersDyn-COL-20-CTLCardinality-2024-09
FORMULA_NAME PhilosophersDyn-COL-20-CTLCardinality-2024-10
FORMULA_NAME PhilosophersDyn-COL-20-CTLCardinality-2024-11
FORMULA_NAME PhilosophersDyn-COL-20-CTLCardinality-2024-12
FORMULA_NAME PhilosophersDyn-COL-20-CTLCardinality-2024-13
FORMULA_NAME PhilosophersDyn-COL-20-CTLCardinality-2024-14
FORMULA_NAME PhilosophersDyn-COL-20-CTLCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1716840661612

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PhilosophersDyn-COL-20
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-27 20:11:03] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-27 20:11:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-27 20:11:03] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-05-27 20:11:03] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-27 20:11:03] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 742 ms
[2024-05-27 20:11:03] [INFO ] Imported 8 HL places and 7 HL transitions for a total of 540 PT places and 17240.0 transition bindings in 20 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 23 ms.
[2024-05-27 20:11:03] [INFO ] Built PT skeleton of HLPN with 8 places and 7 transitions 33 arcs in 4 ms.
[2024-05-27 20:11:03] [INFO ] Skeletonized 16 HLPN properties in 3 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 16 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
RANDOM walk for 40028 steps (1765 resets) in 1421 ms. (28 steps per ms) remains 47/66 properties
BEST_FIRST walk for 4013 steps (32 resets) in 151 ms. (26 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (140 resets) in 93 ms. (42 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (191 resets) in 40 ms. (97 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (210 resets) in 26 ms. (148 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (132 resets) in 23 ms. (166 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (153 resets) in 40 ms. (97 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (26 resets) in 20 ms. (190 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (16 resets) in 30 ms. (129 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (14 resets) in 32 ms. (121 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4002 steps (138 resets) in 45 ms. (87 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (133 resets) in 23 ms. (166 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (141 resets) in 27 ms. (142 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (31 resets) in 40 ms. (97 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (199 resets) in 40 ms. (97 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4002 steps (138 resets) in 54 ms. (72 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4016 steps (23 resets) in 18 ms. (211 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (33 resets) in 13 ms. (286 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4002 steps (197 resets) in 29 ms. (133 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (216 resets) in 23 ms. (166 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4002 steps (133 resets) in 16 ms. (235 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4000 steps (400 resets) in 28 ms. (137 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4000 steps (400 resets) in 25 ms. (153 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (276 resets) in 26 ms. (148 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (266 resets) in 25 ms. (153 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4027 steps (32 resets) in 13 ms. (287 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (130 resets) in 22 ms. (174 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4000 steps (400 resets) in 35 ms. (111 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (35 resets) in 30 ms. (129 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4000 steps (400 resets) in 21 ms. (181 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (130 resets) in 14 ms. (266 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (132 resets) in 17 ms. (222 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (137 resets) in 18 ms. (210 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (191 resets) in 19 ms. (200 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (30 resets) in 16 ms. (235 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4002 steps (131 resets) in 25 ms. (153 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4002 steps (211 resets) in 21 ms. (181 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (133 resets) in 46 ms. (85 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (15 resets) in 15 ms. (250 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4002 steps (133 resets) in 18 ms. (210 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (130 resets) in 16 ms. (235 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (16 resets) in 13 ms. (286 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (32 resets) in 17 ms. (222 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4000 steps (400 resets) in 17 ms. (222 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (195 resets) in 14 ms. (266 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4000 steps (400 resets) in 18 ms. (210 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (293 resets) in 18 ms. (210 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4000 steps (400 resets) in 18 ms. (210 steps per ms) remains 47/47 properties
// Phase 1: matrix 7 rows 8 cols
[2024-05-27 20:11:05] [INFO ] Computed 3 invariants in 6 ms
[2024-05-27 20:11:05] [INFO ] State equation strengthened by 4 read => feed constraints.
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp21 is UNSAT
Problem AtomicPropp23 is UNSAT
Problem AtomicPropp25 is UNSAT
Problem AtomicPropp26 is UNSAT
Problem AtomicPropp27 is UNSAT
Problem AtomicPropp28 is UNSAT
Problem AtomicPropp29 is UNSAT
Problem AtomicPropp31 is UNSAT
Problem AtomicPropp32 is UNSAT
Problem AtomicPropp35 is UNSAT
Problem AtomicPropp36 is UNSAT
Problem AtomicPropp37 is UNSAT
Problem AtomicPropp39 is UNSAT
Problem AtomicPropp41 is UNSAT
Problem AtomicPropp42 is UNSAT
Problem AtomicPropp43 is UNSAT
Problem AtomicPropp46 is UNSAT
Problem AtomicPropp47 is UNSAT
Problem AtomicPropp49 is UNSAT
Problem AtomicPropp51 is UNSAT
Problem AtomicPropp52 is UNSAT
Problem AtomicPropp54 is UNSAT
Problem AtomicPropp58 is UNSAT
Problem AtomicPropp63 is UNSAT
Problem AtomicPropp64 is UNSAT
Problem AtomicPropp65 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 3/3 constraints. Problems are: Problem set: 39 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/8 variables, 0/3 constraints. Problems are: Problem set: 39 solved, 8 unsolved
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp44 is UNSAT
At refinement iteration 2 (OVERLAPS) 7/15 variables, 8/11 constraints. Problems are: Problem set: 41 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 4/15 constraints. Problems are: Problem set: 41 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 0/15 constraints. Problems are: Problem set: 41 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 0/15 variables, 0/15 constraints. Problems are: Problem set: 41 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 15/15 variables, and 15 constraints, problems are : Problem set: 41 solved, 6 unsolved in 351 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 8/8 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 47/47 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 41 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 41 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 2/8 variables, 3/3 constraints. Problems are: Problem set: 41 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/3 constraints. Problems are: Problem set: 41 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 7/15 variables, 8/11 constraints. Problems are: Problem set: 41 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 4/15 constraints. Problems are: Problem set: 41 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/15 variables, 6/21 constraints. Problems are: Problem set: 41 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/15 variables, 0/21 constraints. Problems are: Problem set: 41 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/15 variables, 0/21 constraints. Problems are: Problem set: 41 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 15/15 variables, and 21 constraints, problems are : Problem set: 41 solved, 6 unsolved in 124 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 8/8 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 6/47 constraints, Known Traps: 0/0 constraints]
After SMT, in 554ms problems are : Problem set: 41 solved, 6 unsolved
Parikh walk visited 0 properties in 418 ms.
Support contains 6 out of 8 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8/8 places, 7/7 transitions.
Applied a total of 0 rules in 9 ms. Remains 8 /8 variables (removed 0) and now considering 7/7 (removed 0) transitions.
Running 6 sub problems to find dead transitions.
[2024-05-27 20:11:06] [INFO ] Invariant cache hit.
[2024-05-27 20:11:06] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/8 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 7/15 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 4/15 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 0/15 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 15/15 variables, and 15 constraints, problems are : Problem set: 0 solved, 6 unsolved in 85 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 8/8 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/8 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 7/15 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 4/15 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 6/21 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/15 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/15 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 15/15 variables, and 21 constraints, problems are : Problem set: 0 solved, 6 unsolved in 59 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 8/8 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 150ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 151ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 180 ms. Remains : 8/8 places, 7/7 transitions.
RANDOM walk for 40049 steps (1723 resets) in 73 ms. (541 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (167 resets) in 101 ms. (392 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (1961 resets) in 147 ms. (270 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (2033 resets) in 108 ms. (367 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (171 resets) in 49 ms. (800 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (169 resets) in 36 ms. (1081 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (2020 resets) in 111 ms. (357 steps per ms) remains 6/6 properties
Probably explored full state space saw : 2014 states, properties seen :0
Probabilistic random walk after 6629 steps, saw 2014 distinct states, run finished after 47 ms. (steps per millisecond=141 ) properties seen :0
Explored full state space saw : 2014 states, properties seen :0
Exhaustive walk after 6629 steps, saw 2014 distinct states, run finished after 39 ms. (steps per millisecond=169 ) properties seen :0
Successfully simplified 47 atomic propositions for a total of 16 simplifications.
FORMULA PhilosophersDyn-COL-20-CTLCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PhilosophersDyn-COL-20-CTLCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PhilosophersDyn-COL-20-CTLCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-27 20:11:06] [INFO ] Initial state reduction rules for CTL removed 4 formulas.
[2024-05-27 20:11:06] [INFO ] Flatten gal took : 14 ms
[2024-05-27 20:11:06] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA PhilosophersDyn-COL-20-CTLCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PhilosophersDyn-COL-20-CTLCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PhilosophersDyn-COL-20-CTLCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PhilosophersDyn-COL-20-CTLCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PhilosophersDyn-COL-20-CTLCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-27 20:11:06] [INFO ] Flatten gal took : 2 ms
Domain [Philosopher(20), Philosopher(20)] of place Neighbourhood breaks symmetries in sort Philosopher
[2024-05-27 20:11:06] [INFO ] Unfolded HLPN to a Petri net with 540 places and 17220 transitions 140780 arcs in 192 ms.
[2024-05-27 20:11:06] [INFO ] Unfolded 8 HLPN properties in 1 ms.
Ensure Unique test removed 190 transitions
Reduce redundant transitions removed 190 transitions.
Support contains 540 out of 540 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 540/540 places, 17030/17030 transitions.
Applied a total of 0 rules in 207 ms. Remains 540 /540 variables (removed 0) and now considering 17030/17030 (removed 0) transitions.
Running 16840 sub problems to find dead transitions.
[2024-05-27 20:11:07] [INFO ] Flow matrix only has 15510 transitions (discarded 1520 similar events)
// Phase 1: matrix 15510 rows 540 cols
[2024-05-27 20:11:08] [INFO ] Computed 79 invariants in 983 ms
[2024-05-27 20:11:09] [INFO ] State equation strengthened by 8060 read => feed constraints.
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running PhilosophersDyn-COL-20

IS_COLORED=1
IS_NUPN=

LOADING model.pnml ...
MODEL CLASS: SYMMETRIC NET
PLACES: 8
TRANSITIONS: 7
CONSTANTS: 0
TEMPLATE VARS: 0
COLOR CLASSES: 2
COLOR VARS: 4
ARCS: 33
LOADING TIME: 0.144

UNFOLDING COLORS...
MODEL CLASS: P/T NET
PLACES: 540
TRANSITIONS: 17220
CONSTANTS: 0
TEMPLATE VARS: 0
ARCS: 140780
UNFOLDING TIME: 1.297

SAVING AS /home/mcc/execution/model.(net/def) ...
exportGspn useExt=true
SAVING TIME: 0.351
SAVING NAME MAP FILE /home/mcc/execution/model.id2name ...
SAVING UNFOLDING MAP FILE /home/mcc/execution/model.unfmap ...
TOTAL TIME: 1.941
OK.
----------------------------------------------------------------------
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: 591
MODEL NAME: /home/mcc/execution/model
540 places, 17220 transitions.

No place bound informations found.
No place bound informations found.
No place bound informations found.
No place bound informations found.
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.

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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ 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

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="PhilosophersDyn-COL-20"
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 PhilosophersDyn-COL-20, 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 r289-tajo-171654445000017"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PhilosophersDyn-COL-20.tgz
mv PhilosophersDyn-COL-20 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 ;