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-171654445000025.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-50, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r289-tajo-171654445000025
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 440K
-rw-r--r-- 1 mcc users 6.7K Apr 11 14:21 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K Apr 11 14:21 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Apr 11 14:21 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Apr 11 14:21 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.5K Apr 23 07:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 23 07:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.7K Apr 11 14:21 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 91K Apr 11 14:21 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.3K Apr 11 14:21 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 65K Apr 11 14:21 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 34K 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-50-CTLCardinality-2024-00
FORMULA_NAME PhilosophersDyn-COL-50-CTLCardinality-2024-01
FORMULA_NAME PhilosophersDyn-COL-50-CTLCardinality-2024-02
FORMULA_NAME PhilosophersDyn-COL-50-CTLCardinality-2024-03
FORMULA_NAME PhilosophersDyn-COL-50-CTLCardinality-2024-04
FORMULA_NAME PhilosophersDyn-COL-50-CTLCardinality-2024-05
FORMULA_NAME PhilosophersDyn-COL-50-CTLCardinality-2024-06
FORMULA_NAME PhilosophersDyn-COL-50-CTLCardinality-2024-07
FORMULA_NAME PhilosophersDyn-COL-50-CTLCardinality-2024-08
FORMULA_NAME PhilosophersDyn-COL-50-CTLCardinality-2024-09
FORMULA_NAME PhilosophersDyn-COL-50-CTLCardinality-2024-10
FORMULA_NAME PhilosophersDyn-COL-50-CTLCardinality-2024-11
FORMULA_NAME PhilosophersDyn-COL-50-CTLCardinality-2024-12
FORMULA_NAME PhilosophersDyn-COL-50-CTLCardinality-2024-13
FORMULA_NAME PhilosophersDyn-COL-50-CTLCardinality-2024-14
FORMULA_NAME PhilosophersDyn-COL-50-CTLCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1716840684006

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-50
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-27 20:11:25] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-27 20:11:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-27 20:11:25] [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:25] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-27 20:11:25] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 534 ms
[2024-05-27 20:11:25] [INFO ] Imported 8 HL places and 7 HL transitions for a total of 2850 PT places and 257600.0 transition bindings in 16 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 16 ms.
[2024-05-27 20:11:25] [INFO ] Built PT skeleton of HLPN with 8 places and 7 transitions 33 arcs in 4 ms.
[2024-05-27 20:11:25] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Initial state reduction rules removed 2 formulas.
FORMULA PhilosophersDyn-COL-50-CTLCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PhilosophersDyn-COL-50-CTLCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 14 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
RANDOM walk for 40059 steps (860 resets) in 905 ms. (44 steps per ms) remains 24/44 properties
BEST_FIRST walk for 4001 steps (212 resets) in 222 ms. (17 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4000 steps (400 resets) in 227 ms. (17 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (259 resets) in 90 ms. (44 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (197 resets) in 36 ms. (108 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4000 steps (400 resets) in 73 ms. (54 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (12 resets) in 16 ms. (235 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4001 steps (209 resets) in 55 ms. (71 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (271 resets) in 34 ms. (114 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4000 steps (400 resets) in 28 ms. (137 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4000 steps (400 resets) in 30 ms. (129 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (186 resets) in 29 ms. (133 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (204 resets) in 23 ms. (166 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4092 steps (12 resets) in 15 ms. (255 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (12 resets) in 20 ms. (190 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (12 resets) in 18 ms. (210 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (134 resets) in 20 ms. (190 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (211 resets) in 23 ms. (166 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4001 steps (183 resets) in 22 ms. (173 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (202 resets) in 20 ms. (190 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (276 resets) in 20 ms. (190 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (198 resets) in 14 ms. (266 steps per ms) remains 24/24 properties
// Phase 1: matrix 7 rows 8 cols
[2024-05-27 20:11:26] [INFO ] Computed 3 invariants in 6 ms
[2024-05-27 20:11:26] [INFO ] State equation strengthened by 4 read => feed constraints.
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp22 is UNSAT
Problem AtomicPropp23 is UNSAT
Problem AtomicPropp27 is UNSAT
Problem AtomicPropp28 is UNSAT
Problem AtomicPropp30 is UNSAT
Problem AtomicPropp32 is UNSAT
Problem AtomicPropp39 is UNSAT
Problem AtomicPropp41 is UNSAT
Problem AtomicPropp42 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 3/3 constraints. Problems are: Problem set: 14 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/8 variables, 0/3 constraints. Problems are: Problem set: 14 solved, 10 unsolved
Problem AtomicPropp29 is UNSAT
Problem AtomicPropp38 is UNSAT
At refinement iteration 2 (OVERLAPS) 7/15 variables, 8/11 constraints. Problems are: Problem set: 16 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 4/15 constraints. Problems are: Problem set: 16 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 0/15 constraints. Problems are: Problem set: 16 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 0/15 variables, 0/15 constraints. Problems are: Problem set: 16 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 15/15 variables, and 15 constraints, problems are : Problem set: 16 solved, 8 unsolved in 290 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 8/8 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 24/24 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 16 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 16 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 4/7 variables, 2/2 constraints. Problems are: Problem set: 16 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 16 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 1/8 variables, 1/3 constraints. Problems are: Problem set: 16 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/8 variables, 0/3 constraints. Problems are: Problem set: 16 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 7/15 variables, 8/11 constraints. Problems are: Problem set: 16 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/15 variables, 4/15 constraints. Problems are: Problem set: 16 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/15 variables, 8/23 constraints. Problems are: Problem set: 16 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/15 variables, 0/23 constraints. Problems are: Problem set: 16 solved, 8 unsolved
At refinement iteration 9 (OVERLAPS) 0/15 variables, 0/23 constraints. Problems are: Problem set: 16 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 15/15 variables, and 23 constraints, problems are : Problem set: 16 solved, 8 unsolved in 137 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 8/8 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 8/24 constraints, Known Traps: 0/0 constraints]
After SMT, in 484ms problems are : Problem set: 16 solved, 8 unsolved
Parikh walk visited 0 properties in 1477 ms.
Support contains 3 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 13 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:28] [INFO ] Invariant cache hit.
[2024-05-27 20:11:28] [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 58 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 64 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 130ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 130ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 160 ms. Remains : 8/8 places, 7/7 transitions.
RANDOM walk for 40064 steps (790 resets) in 159 ms. (250 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (1972 resets) in 91 ms. (434 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (1955 resets) in 169 ms. (235 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (1989 resets) in 100 ms. (396 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (68 resets) in 123 ms. (322 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (2027 resets) in 123 ms. (322 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40000 steps (1996 resets) in 128 ms. (310 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (1978 resets) in 108 ms. (367 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (1970 resets) in 125 ms. (317 steps per ms) remains 8/8 properties
Probably explored full state space saw : 12544 states, properties seen :0
Probabilistic random walk after 42089 steps, saw 12544 distinct states, run finished after 310 ms. (steps per millisecond=135 ) properties seen :0
Explored full state space saw : 12544 states, properties seen :0
Exhaustive walk after 42089 steps, saw 12544 distinct states, run finished after 248 ms. (steps per millisecond=169 ) properties seen :0
Successfully simplified 24 atomic propositions for a total of 14 simplifications.
FORMULA PhilosophersDyn-COL-50-CTLCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PhilosophersDyn-COL-50-CTLCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-27 20:11:29] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-05-27 20:11:29] [INFO ] Flatten gal took : 22 ms
[2024-05-27 20:11:29] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA PhilosophersDyn-COL-50-CTLCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PhilosophersDyn-COL-50-CTLCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-27 20:11:29] [INFO ] Flatten gal took : 2 ms
Domain [Philosopher(50), Philosopher(50)] of place Neighbourhood breaks symmetries in sort Philosopher
[2024-05-27 20:11:31] [INFO ] Unfolded HLPN to a Petri net with 2850 places and 257550 transitions 2154950 arcs in 1679 ms.
[2024-05-27 20:11:31] [INFO ] Unfolded 10 HLPN properties in 3 ms.
Ensure Unique test removed 1225 transitions
Reduce redundant transitions removed 1225 transitions.
Support contains 2850 out of 2850 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2850/2850 places, 256325/256325 transitions.
Applied a total of 0 rules in 3420 ms. Remains 2850 /2850 variables (removed 0) and now considering 256325/256325 (removed 0) transitions.
Running 255100 sub problems to find dead transitions.
[2024-05-27 20:11:41] [INFO ] Flow matrix only has 246525 transitions (discarded 9800 similar events)
// Phase 1: matrix 246525 rows 2850 cols
[2024-05-27 20:13:41] [WARNING] Invariant computation timed out after 120 seconds.
[2024-05-27 20:13:56] [INFO ] State equation strengthened by 125150 read => feed constraints.
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running PhilosophersDyn-COL-50

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.147

UNFOLDING COLORS...
MODEL CLASS: P/T NET
PLACES: 2850
TRANSITIONS: 257550
CONSTANTS: 0
TEMPLATE VARS: 0
ARCS: 2154950
UNFOLDING TIME: 11.707

SAVING AS /home/mcc/execution/model.(net/def) ...
exportGspn useExt=true
SAVING TIME: 3.426
SAVING NAME MAP FILE /home/mcc/execution/model.id2name ...
SAVING UNFOLDING MAP FILE /home/mcc/execution/model.unfmap ...
TOTAL TIME: 15.587
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: 607
MODEL NAME: /home/mcc/execution/model
2850 places, 257550 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
CANNOT_COMPUTE
EXITCODE: 87
----------------------------------------------------------------------

BK_STOP 1716841575941

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLCardinality -timeout 360 -rebuildPNML
MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="PhilosophersDyn-COL-50"
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-50, 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-171654445000025"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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