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.r047-tajo-171620397500110.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 BridgeAndVehicles-COL-V50P50N50, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r047-tajo-171620397500110
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 464K
-rw-r--r-- 1 mcc users 7.6K Apr 13 03:31 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K Apr 13 03:31 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Apr 13 03:24 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Apr 13 03:24 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K Apr 22 14:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 22 14:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Apr 22 14:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 13 05:51 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 91K Apr 13 05:51 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 10K Apr 13 05:45 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 69K Apr 13 05:45 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 22 14:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Apr 22 14:30 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:42 equiv_pt
-rw-r--r-- 1 mcc users 10 May 18 16:42 instance
-rw-r--r-- 1 mcc users 5 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 44K May 18 16:42 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 BridgeAndVehicles-COL-V50P50N50-ReachabilityCardinality-2024-00
FORMULA_NAME BridgeAndVehicles-COL-V50P50N50-ReachabilityCardinality-2024-01
FORMULA_NAME BridgeAndVehicles-COL-V50P50N50-ReachabilityCardinality-2024-02
FORMULA_NAME BridgeAndVehicles-COL-V50P50N50-ReachabilityCardinality-2024-03
FORMULA_NAME BridgeAndVehicles-COL-V50P50N50-ReachabilityCardinality-2024-04
FORMULA_NAME BridgeAndVehicles-COL-V50P50N50-ReachabilityCardinality-2024-05
FORMULA_NAME BridgeAndVehicles-COL-V50P50N50-ReachabilityCardinality-2024-06
FORMULA_NAME BridgeAndVehicles-COL-V50P50N50-ReachabilityCardinality-2024-07
FORMULA_NAME BridgeAndVehicles-COL-V50P50N50-ReachabilityCardinality-2024-08
FORMULA_NAME BridgeAndVehicles-COL-V50P50N50-ReachabilityCardinality-2024-09
FORMULA_NAME BridgeAndVehicles-COL-V50P50N50-ReachabilityCardinality-2024-10
FORMULA_NAME BridgeAndVehicles-COL-V50P50N50-ReachabilityCardinality-2024-11
FORMULA_NAME BridgeAndVehicles-COL-V50P50N50-ReachabilityCardinality-2024-12
FORMULA_NAME BridgeAndVehicles-COL-V50P50N50-ReachabilityCardinality-2024-13
FORMULA_NAME BridgeAndVehicles-COL-V50P50N50-ReachabilityCardinality-2024-14
FORMULA_NAME BridgeAndVehicles-COL-V50P50N50-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1716279813704

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BridgeAndVehicles-COL-V50P50N50
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-21 08:23:35] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-05-21 08:23:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 08:23:35] [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-21 08:23:35] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-21 08:23:36] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 594 ms
[2024-05-21 08:23:36] [INFO ] Imported 15 HL places and 11 HL transitions for a total of 168 PT places and 531118.0 transition bindings in 17 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 22 ms.
Working with output stream class java.io.PrintStream
[2024-05-21 08:23:36] [INFO ] Built PT skeleton of HLPN with 15 places and 11 transitions 56 arcs in 3 ms.
[2024-05-21 08:23:36] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
Remains 16 properties that can be checked using skeleton over-approximation.
Reduce places removed 3 places and 0 transitions.
Computed a total of 9 stabilizing places and 6 stable transitions
Graph (complete) has 22 edges and 12 vertex of which 10 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
RANDOM walk for 40000 steps (8 resets) in 1383 ms. (28 steps per ms) remains 7/13 properties
BEST_FIRST walk for 40001 steps (8 resets) in 232 ms. (171 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 138 ms. (287 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 260 ms. (153 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (8 resets) in 166 ms. (239 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 620 ms. (64 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (8 resets) in 225 ms. (177 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (8 resets) in 110 ms. (360 steps per ms) remains 6/7 properties
// Phase 1: matrix 10 rows 12 cols
[2024-05-21 08:23:37] [INFO ] Computed 4 invariants in 3 ms
Problem BridgeAndVehicles-COL-V50P50N50-ReachabilityCardinality-2024-00 is UNSAT
Problem BridgeAndVehicles-COL-V50P50N50-ReachabilityCardinality-2024-03 is UNSAT
Problem BridgeAndVehicles-COL-V50P50N50-ReachabilityCardinality-2024-04 is UNSAT
Problem BridgeAndVehicles-COL-V50P50N50-ReachabilityCardinality-2024-05 is UNSAT
Problem BridgeAndVehicles-COL-V50P50N50-ReachabilityCardinality-2024-07 is UNSAT
Problem BridgeAndVehicles-COL-V50P50N50-ReachabilityCardinality-2024-11 is UNSAT
After SMT solving in domain Real declared 12/22 variables, and 4 constraints, problems are : Problem set: 6 solved, 0 unsolved in 112 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/12 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 162ms problems are : Problem set: 6 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
[2024-05-21 08:23:37] [INFO ] Flatten gal took : 23 ms
[2024-05-21 08:23:37] [INFO ] Flatten gal took : 1 ms
RANDOM walk for 0 steps (0 resets) in 6 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 BridgeAndVehicles-COL-V50P50N50-ReachabilityCardinality-2024-00 TRUE TECHNIQUES CPN_APPROX
FORMULA BridgeAndVehicles-COL-V50P50N50-ReachabilityCardinality-2024-03 FALSE TECHNIQUES CPN_APPROX
FORMULA BridgeAndVehicles-COL-V50P50N50-ReachabilityCardinality-2024-04 FALSE TECHNIQUES CPN_APPROX
FORMULA BridgeAndVehicles-COL-V50P50N50-ReachabilityCardinality-2024-05 FALSE TECHNIQUES CPN_APPROX
FORMULA BridgeAndVehicles-COL-V50P50N50-ReachabilityCardinality-2024-07 TRUE TECHNIQUES CPN_APPROX
FORMULA BridgeAndVehicles-COL-V50P50N50-ReachabilityCardinality-2024-08 TRUE TECHNIQUES CPN_APPROX
FORMULA BridgeAndVehicles-COL-V50P50N50-ReachabilityCardinality-2024-09 TRUE TECHNIQUES CPN_APPROX
FORMULA BridgeAndVehicles-COL-V50P50N50-ReachabilityCardinality-2024-10 TRUE TECHNIQUES CPN_APPROX
FORMULA BridgeAndVehicles-COL-V50P50N50-ReachabilityCardinality-2024-11 TRUE TECHNIQUES CPN_APPROX
Arc [13:1*[(MOD (ADD $cpt 1) 51)]] contains successor/predecessor on variables of sort compteur
Arc [1:1*[(MOD (ADD $cA 1) 51)]] contains successor/predecessor on variables of sort voitureA
Arc [6:1*[(MOD (ADD (MOD (MINUS $cB 1) 51) 51) 51)]] contains successor/predecessor on variables of sort voitureB
Arc [14:1*[(MOD (ADD $s 1) 2)]] contains successor/predecessor on variables of sort sens
[2024-05-21 08:23:38] [INFO ] Unfolded HLPN to a Petri net with 168 places and 5408 transitions 42330 arcs in 296 ms.
[2024-05-21 08:23:38] [INFO ] Unfolded 16 HLPN properties in 0 ms.
RANDOM walk for 40000 steps (92 resets) in 2761 ms. (14 steps per ms) remains 1/7 properties
FORMULA BridgeAndVehicles-COL-V50P50N50-ReachabilityCardinality-2024-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-COL-V50P50N50-ReachabilityCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-COL-V50P50N50-ReachabilityCardinality-2024-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-COL-V50P50N50-ReachabilityCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-COL-V50P50N50-ReachabilityCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-COL-V50P50N50-ReachabilityCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (28 resets) in 503 ms. (79 steps per ms) remains 1/1 properties
[2024-05-21 08:23:39] [INFO ] Flow matrix only has 410 transitions (discarded 4998 similar events)
// Phase 1: matrix 410 rows 168 cols
[2024-05-21 08:23:39] [INFO ] Computed 7 invariants in 21 ms
[2024-05-21 08:23:39] [INFO ] State equation strengthened by 102 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 6/9 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 08:23:40] [INFO ] Deduced a trap composed of 5 places in 440 ms of which 10 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/9 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 6/15 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/15 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 410/425 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/425 variables, 102/122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/425 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 153/578 variables, 153/275 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/578 variables, 3/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/578 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/578 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 578/578 variables, and 278 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1080 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 168/168 constraints, ReadFeed: 102/102 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 6/9 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/9 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 6/15 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/15 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 410/425 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/425 variables, 102/122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/425 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 153/578 variables, 153/275 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/578 variables, 3/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/578 variables, 1/279 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/578 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/578 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 578/578 variables, and 279 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1119 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 168/168 constraints, ReadFeed: 102/102 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 2455ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 1923 ms.
Support contains 3 out of 168 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 168/168 places, 5408/5408 transitions.
Graph (complete) has 1542 edges and 168 vertex of which 166 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.37 ms
Discarding 2 places :
Also discarding 0 output transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 165 transition count 5407
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 165 transition count 5407
Applied a total of 3 rules in 1566 ms. Remains 165 /168 variables (removed 3) and now considering 5407/5408 (removed 1) transitions.
Running 5404 sub problems to find dead transitions.
[2024-05-21 08:23:45] [INFO ] Flow matrix only has 409 transitions (discarded 4998 similar events)
// Phase 1: matrix 409 rows 165 cols
[2024-05-21 08:23:45] [INFO ] Computed 5 invariants in 5 ms
[2024-05-21 08:23:45] [INFO ] State equation strengthened by 102 read => feed constraints.
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running BridgeAndVehicles-COL-V50P50N50

IS_COLORED=1
IS_NUPN=

LOADING model.pnml ...
MODEL CLASS: SYMMETRIC NET
PLACES: 15
TRANSITIONS: 11
CONSTANTS: 0
TEMPLATE VARS: 0
COLOR CLASSES: 4
COLOR VARS: 4
ARCS: 56
LOADING TIME: 0.2

UNFOLDING COLORS...
MODEL CLASS: P/T NET
PLACES: 168
TRANSITIONS: 5408
CONSTANTS: 0
TEMPLATE VARS: 0
ARCS: 42330
UNFOLDING TIME: 8.556

SAVING AS /home/mcc/execution/model.(net/def) ...
exportGspn useExt=true
SAVING TIME: 0.235
SAVING NAME MAP FILE /home/mcc/execution/model.id2name ...
SAVING UNFOLDING MAP FILE /home/mcc/execution/model.unfmap ...
TOTAL TIME: 9.23
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
168 places, 5408 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.
CANNOT_COMPUTE
EXITCODE: 87
----------------------------------------------------------------------

BK_STOP 1716281043107

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

Error in allocating array of size 8388608 at unique_table.cc, line 313
MEDDLY ERROR: Insufficient memory

ERROR: std::bad_alloc

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="BridgeAndVehicles-COL-V50P50N50"
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 BridgeAndVehicles-COL-V50P50N50, 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 r047-tajo-171620397500110"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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