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-171654445000022.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 ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r289-tajo-171654445000022
=====================================================================

--------------------
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-ReachabilityCardinality-2024-00
FORMULA_NAME PhilosophersDyn-COL-20-ReachabilityCardinality-2024-01
FORMULA_NAME PhilosophersDyn-COL-20-ReachabilityCardinality-2024-02
FORMULA_NAME PhilosophersDyn-COL-20-ReachabilityCardinality-2024-03
FORMULA_NAME PhilosophersDyn-COL-20-ReachabilityCardinality-2024-04
FORMULA_NAME PhilosophersDyn-COL-20-ReachabilityCardinality-2024-05
FORMULA_NAME PhilosophersDyn-COL-20-ReachabilityCardinality-2024-06
FORMULA_NAME PhilosophersDyn-COL-20-ReachabilityCardinality-2024-07
FORMULA_NAME PhilosophersDyn-COL-20-ReachabilityCardinality-2024-08
FORMULA_NAME PhilosophersDyn-COL-20-ReachabilityCardinality-2024-09
FORMULA_NAME PhilosophersDyn-COL-20-ReachabilityCardinality-2024-10
FORMULA_NAME PhilosophersDyn-COL-20-ReachabilityCardinality-2024-11
FORMULA_NAME PhilosophersDyn-COL-20-ReachabilityCardinality-2024-12
FORMULA_NAME PhilosophersDyn-COL-20-ReachabilityCardinality-2024-13
FORMULA_NAME PhilosophersDyn-COL-20-ReachabilityCardinality-2024-14
FORMULA_NAME PhilosophersDyn-COL-20-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1716840661990

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityCardinality
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, ReachabilityCardinality, -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:04] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 624 ms
[2024-05-27 20:11:04] [INFO ] Imported 8 HL places and 7 HL transitions for a total of 540 PT places and 17240.0 transition bindings in 17 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 28 ms.
Working with output stream class java.io.PrintStream
FORMULA PhilosophersDyn-COL-20-ReachabilityCardinality-2024-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-27 20:11:04] [INFO ] Built PT skeleton of HLPN with 8 places and 7 transitions 33 arcs in 5 ms.
[2024-05-27 20:11:04] [INFO ] Skeletonized 15 HLPN properties in 1 ms.
Remains 15 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
RANDOM walk for 40043 steps (1708 resets) in 921 ms. (43 steps per ms) remains 10/15 properties
BEST_FIRST walk for 40003 steps (2501 resets) in 673 ms. (59 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (1981 resets) in 333 ms. (119 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40001 steps (204 resets) in 566 ms. (70 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (2104 resets) in 674 ms. (59 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (1761 resets) in 161 ms. (246 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (1982 resets) in 115 ms. (344 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (279 resets) in 128 ms. (310 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (2695 resets) in 108 ms. (367 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (2664 resets) in 181 ms. (219 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (2026 resets) in 149 ms. (266 steps per ms) remains 10/10 properties
// Phase 1: matrix 7 rows 8 cols
[2024-05-27 20:11:05] [INFO ] Computed 3 invariants in 3 ms
[2024-05-27 20:11:05] [INFO ] State equation strengthened by 4 read => feed constraints.
Problem PhilosophersDyn-COL-20-ReachabilityCardinality-2024-05 is UNSAT
Problem PhilosophersDyn-COL-20-ReachabilityCardinality-2024-02 is UNSAT
Problem PhilosophersDyn-COL-20-ReachabilityCardinality-2024-06 is UNSAT
Problem PhilosophersDyn-COL-20-ReachabilityCardinality-2024-08 is UNSAT
Problem PhilosophersDyn-COL-20-ReachabilityCardinality-2024-09 is UNSAT
Problem PhilosophersDyn-COL-20-ReachabilityCardinality-2024-11 is UNSAT
Problem PhilosophersDyn-COL-20-ReachabilityCardinality-2024-13 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 3/3 constraints. Problems are: Problem set: 7 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/8 variables, 0/3 constraints. Problems are: Problem set: 7 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 7/15 variables, 8/11 constraints. Problems are: Problem set: 7 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 4/15 constraints. Problems are: Problem set: 7 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 0/15 constraints. Problems are: Problem set: 7 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 0/15 variables, 0/15 constraints. Problems are: Problem set: 7 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 15/15 variables, and 15 constraints, problems are : Problem set: 7 solved, 3 unsolved in 174 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 8/8 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 7 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 3/3 constraints. Problems are: Problem set: 7 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/8 variables, 0/3 constraints. Problems are: Problem set: 7 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 7/15 variables, 8/11 constraints. Problems are: Problem set: 7 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 4/15 constraints. Problems are: Problem set: 7 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 3/18 constraints. Problems are: Problem set: 7 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/15 variables, 0/18 constraints. Problems are: Problem set: 7 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 0/15 variables, 0/18 constraints. Problems are: Problem set: 7 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 15/15 variables, and 18 constraints, problems are : Problem set: 7 solved, 3 unsolved in 91 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 8/8 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 3/10 constraints, Known Traps: 0/0 constraints]
After SMT, in 310ms problems are : Problem set: 7 solved, 3 unsolved
Parikh walk visited 0 properties in 127 ms.
Support contains 8 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 30 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:05] [INFO ] Invariant cache hit.
[2024-05-27 20:11:05] [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 69 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 93 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 181ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 186ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 233 ms. Remains : 8/8 places, 7/7 transitions.
RANDOM walk for 40022 steps (1683 resets) in 111 ms. (357 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (2013 resets) in 79 ms. (500 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (201 resets) in 124 ms. (320 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (2664 resets) in 143 ms. (277 steps per ms) remains 3/3 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 57 ms. (steps per millisecond=116 ) 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 68 ms. (steps per millisecond=97 ) properties seen :0
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
[2024-05-27 20:11:06] [INFO ] Flatten gal took : 18 ms
[2024-05-27 20:11:06] [INFO ] Flatten gal took : 3 ms
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
FORMULA PhilosophersDyn-COL-20-ReachabilityCardinality-2024-02 TRUE TECHNIQUES CPN_APPROX
FORMULA PhilosophersDyn-COL-20-ReachabilityCardinality-2024-03 TRUE TECHNIQUES CPN_APPROX
FORMULA PhilosophersDyn-COL-20-ReachabilityCardinality-2024-04 FALSE TECHNIQUES CPN_APPROX
FORMULA PhilosophersDyn-COL-20-ReachabilityCardinality-2024-05 TRUE TECHNIQUES CPN_APPROX
FORMULA PhilosophersDyn-COL-20-ReachabilityCardinality-2024-06 TRUE TECHNIQUES CPN_APPROX
FORMULA PhilosophersDyn-COL-20-ReachabilityCardinality-2024-08 FALSE TECHNIQUES CPN_APPROX
FORMULA PhilosophersDyn-COL-20-ReachabilityCardinality-2024-09 TRUE TECHNIQUES CPN_APPROX
FORMULA PhilosophersDyn-COL-20-ReachabilityCardinality-2024-11 TRUE TECHNIQUES CPN_APPROX
FORMULA PhilosophersDyn-COL-20-ReachabilityCardinality-2024-12 FALSE TECHNIQUES CPN_APPROX
FORMULA PhilosophersDyn-COL-20-ReachabilityCardinality-2024-13 TRUE TECHNIQUES CPN_APPROX
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 198 ms.
[2024-05-27 20:11:06] [INFO ] Unfolded 15 HLPN properties in 9 ms.
Ensure Unique test removed 190 transitions
Reduce redundant transitions removed 190 transitions.
RANDOM walk for 40000 steps (4565 resets) in 3298 ms. (12 steps per ms) remains 2/5 properties
FORMULA PhilosophersDyn-COL-20-ReachabilityCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PhilosophersDyn-COL-20-ReachabilityCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PhilosophersDyn-COL-20-ReachabilityCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (146 resets) in 989 ms. (40 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (140 resets) in 171 ms. (232 steps per ms) remains 2/2 properties
[2024-05-27 20:11:08] [INFO ] Flow matrix only has 15510 transitions (discarded 1520 similar events)
// Phase 1: matrix 15510 rows 540 cols
[2024-05-27 20:11:09] [INFO ] Computed 79 invariants in 1118 ms
[2024-05-27 20:11:09] [INFO ] State equation strengthened by 8060 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/540 variables, 60/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/540 variables, 19/79 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/540 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 16050/16050 variables, and 619 constraints, problems are : Problem set: 0 solved, 2 unsolved in 5016 ms.
Refiners :[Positive P Invariants (semi-flows): 60/60 constraints, Generalized P Invariants (flows): 19/19 constraints, State Equation: 540/540 constraints, ReadFeed: 0/8060 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/540 variables, 60/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/540 variables, 19/79 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/540 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 16050/16050 variables, and 619 constraints, problems are : Problem set: 0 solved, 2 unsolved in 5023 ms.
Refiners :[Positive P Invariants (semi-flows): 60/60 constraints, Generalized P Invariants (flows): 19/19 constraints, State Equation: 540/540 constraints, ReadFeed: 0/8060 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 12251ms problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 540 out of 540 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 540/540 places, 17030/17030 transitions.
Applied a total of 0 rules in 3051 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:23] [INFO ] Flow matrix only has 15510 transitions (discarded 1520 similar events)
[2024-05-27 20:11:23] [INFO ] Invariant cache hit.
[2024-05-27 20:11:24] [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.143

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

SAVING AS /home/mcc/execution/model.(net/def) ...
exportGspn useExt=true
SAVING TIME: 0.337
SAVING NAME MAP FILE /home/mcc/execution/model.id2name ...
SAVING UNFOLDING MAP FILE /home/mcc/execution/model.unfmap ...
TOTAL TIME: 1.926
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: 598
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//
++ 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 ReachabilityCardinality -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="ReachabilityCardinality"
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 ReachabilityCardinality"
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-171654445000022"
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 [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "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 [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
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 ;