Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r267-smll-171654406400438.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is Philosophers-COL-001000, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r267-smll-171654406400438
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 496K
-rw-r--r-- 1 mcc users 6.4K Apr 13 10:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K Apr 13 10:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Apr 13 09:43 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K Apr 13 09:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K 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 25K Apr 23 07:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 23 07:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 07:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 13 14:40 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 124K Apr 13 14:40 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.5K Apr 13 12:56 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 73K Apr 13 12:56 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K 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 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 52K 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 Philosophers-COL-001000-ReachabilityCardinality-2024-00
FORMULA_NAME Philosophers-COL-001000-ReachabilityCardinality-2024-01
FORMULA_NAME Philosophers-COL-001000-ReachabilityCardinality-2024-02
FORMULA_NAME Philosophers-COL-001000-ReachabilityCardinality-2024-03
FORMULA_NAME Philosophers-COL-001000-ReachabilityCardinality-2024-04
FORMULA_NAME Philosophers-COL-001000-ReachabilityCardinality-2024-05
FORMULA_NAME Philosophers-COL-001000-ReachabilityCardinality-2024-06
FORMULA_NAME Philosophers-COL-001000-ReachabilityCardinality-2024-07
FORMULA_NAME Philosophers-COL-001000-ReachabilityCardinality-2024-08
FORMULA_NAME Philosophers-COL-001000-ReachabilityCardinality-2024-09
FORMULA_NAME Philosophers-COL-001000-ReachabilityCardinality-2024-10
FORMULA_NAME Philosophers-COL-001000-ReachabilityCardinality-2024-11
FORMULA_NAME Philosophers-COL-001000-ReachabilityCardinality-2024-12
FORMULA_NAME Philosophers-COL-001000-ReachabilityCardinality-2024-13
FORMULA_NAME Philosophers-COL-001000-ReachabilityCardinality-2024-14
FORMULA_NAME Philosophers-COL-001000-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1716878769264

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Philosophers-COL-001000
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-28 06:46:11] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-05-28 06:46:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 06:46:12] [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-28 06:46:12] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-28 06:46:13] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 1100 ms
[2024-05-28 06:46:13] [INFO ] Imported 5 HL places and 5 HL transitions for a total of 5000 PT places and 5000.0 transition bindings in 26 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 41 ms.
Working with output stream class java.io.PrintStream
[2024-05-28 06:46:13] [INFO ] Built PT skeleton of HLPN with 5 places and 5 transitions 15 arcs in 5 ms.
[2024-05-28 06:46:13] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
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 40079 steps (36 resets) in 86 ms. (460 steps per ms) remains 5/16 properties
BEST_FIRST walk for 40003 steps (8 resets) in 795 ms. (50 steps per ms) remains 4/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 158 ms. (251 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 233 ms. (170 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 222 ms. (179 steps per ms) remains 2/3 properties
// Phase 1: matrix 5 rows 5 cols
[2024-05-28 06:46:13] [INFO ] Computed 2 invariants in 4 ms
Problem Philosophers-COL-001000-ReachabilityCardinality-2024-13 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 5/10 variables, 5/7 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/10 variables, 0/7 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 0/10 variables, 0/7 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 10/10 variables, and 7 constraints, problems are : Problem set: 1 solved, 1 unsolved in 230 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 5/5 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 5/10 variables, 5/7 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/10 variables, 1/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/10 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 0/10 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 10/10 variables, and 8 constraints, problems are : Problem set: 1 solved, 1 unsolved in 84 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 5/5 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 368ms problems are : Problem set: 1 solved, 1 unsolved
Finished Parikh walk after 975 steps, including 0 resets, run visited all 1 properties in 10 ms. (steps per millisecond=97 )
Parikh walk visited 1 properties in 22 ms.
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
[2024-05-28 06:46:14] [INFO ] Flatten gal took : 22 ms
[2024-05-28 06:46:14] [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 Philosophers-COL-001000-ReachabilityCardinality-2024-13 FALSE TECHNIQUES CPN_APPROX
Arc [1:1*[(MOD (ADD (MOD (MINUS $x 1) 1000) 1000) 1000)]] contains successor/predecessor on variables of sort Philo
[2024-05-28 06:46:14] [INFO ] Unfolded HLPN to a Petri net with 5000 places and 5000 transitions 16000 arcs in 229 ms.
[2024-05-28 06:46:14] [INFO ] Unfolded 16 HLPN properties in 19 ms.
RANDOM walk for 40000 steps (8 resets) in 20789 ms. (1 steps per ms) remains 5/15 properties
FORMULA Philosophers-COL-001000-ReachabilityCardinality-2024-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Philosophers-COL-001000-ReachabilityCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Philosophers-COL-001000-ReachabilityCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Philosophers-COL-001000-ReachabilityCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Philosophers-COL-001000-ReachabilityCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Philosophers-COL-001000-ReachabilityCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Philosophers-COL-001000-ReachabilityCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Philosophers-COL-001000-ReachabilityCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Philosophers-COL-001000-ReachabilityCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Philosophers-COL-001000-ReachabilityCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 17002 steps (1 resets) in 21583 ms. (0 steps per ms) remains 5/5 properties
BEST_FIRST walk for 16000 steps (0 resets) in 25763 ms. (0 steps per ms) remains 5/5 properties
BEST_FIRST walk for 12008 steps (0 resets) in 22076 ms. (0 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 6401 ms. (6 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 4232 ms. (9 steps per ms) remains 5/5 properties
// Phase 1: matrix 5000 rows 5000 cols
[2024-05-28 06:46:41] [INFO ] Computed 2000 invariants in 92 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 5000/10000 variables, and 2000 constraints, problems are : Problem set: 0 solved, 5 unsolved in 5022 ms.
Refiners :[Positive P Invariants (semi-flows): 2000/2000 constraints, State Equation: 0/5000 constraints, PredecessorRefiner: 0/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 5000/10000 variables, and 2000 constraints, problems are : Problem set: 0 solved, 5 unsolved in 5021 ms.
Refiners :[Positive P Invariants (semi-flows): 2000/2000 constraints, State Equation: 0/5000 constraints, PredecessorRefiner: 0/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 25659ms problems are : Problem set: 0 solved, 5 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 5000 out of 5000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5000/5000 places, 5000/5000 transitions.
Applied a total of 0 rules in 132 ms. Remains 5000 /5000 variables (removed 0) and now considering 5000/5000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 159 ms. Remains : 5000/5000 places, 5000/5000 transitions.
RANDOM walk for 40000 steps (8 resets) in 18433 ms. (2 steps per ms) remains 5/5 properties
BEST_FIRST walk for 20008 steps (4 resets) in 24159 ms. (0 steps per ms) remains 5/5 properties
BEST_FIRST walk for 16000 steps (0 resets) in 23923 ms. (0 steps per ms) remains 5/5 properties
BEST_FIRST walk for 12008 steps (0 resets) in 22232 ms. (0 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 5286 ms. (7 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 4509 ms. (8 steps per ms) remains 5/5 properties
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running Philosophers-COL-001000

IS_COLORED=1
IS_NUPN=

LOADING model.pnml ...
MODEL CLASS: SYMMETRIC NET
PLACES: 5
TRANSITIONS: 5
CONSTANTS: 0
TEMPLATE VARS: 0
COLOR CLASSES: 1
COLOR VARS: 1
ARCS: 15
LOADING TIME: 0.444

UNFOLDING COLORS...
MODEL CLASS: P/T NET
PLACES: 5000
TRANSITIONS: 5000
CONSTANTS: 0
TEMPLATE VARS: 0
ARCS: 16000
UNFOLDING TIME: 1.084

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

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA Philosophers-COL-001000-ReachabilityCardinality-2024-00 CANNOT_COMPUTE
FORMULA Philosophers-COL-001000-ReachabilityCardinality-2024-01 CANNOT_COMPUTE
FORMULA Philosophers-COL-001000-ReachabilityCardinality-2024-02 CANNOT_COMPUTE
FORMULA Philosophers-COL-001000-ReachabilityCardinality-2024-03 CANNOT_COMPUTE
FORMULA Philosophers-COL-001000-ReachabilityCardinality-2024-04 CANNOT_COMPUTE
FORMULA Philosophers-COL-001000-ReachabilityCardinality-2024-05 CANNOT_COMPUTE
FORMULA Philosophers-COL-001000-ReachabilityCardinality-2024-06 CANNOT_COMPUTE
FORMULA Philosophers-COL-001000-ReachabilityCardinality-2024-07 CANNOT_COMPUTE
FORMULA Philosophers-COL-001000-ReachabilityCardinality-2024-08 CANNOT_COMPUTE
FORMULA Philosophers-COL-001000-ReachabilityCardinality-2024-09 CANNOT_COMPUTE
FORMULA Philosophers-COL-001000-ReachabilityCardinality-2024-10 CANNOT_COMPUTE
FORMULA Philosophers-COL-001000-ReachabilityCardinality-2024-11 CANNOT_COMPUTE
FORMULA Philosophers-COL-001000-ReachabilityCardinality-2024-12 CANNOT_COMPUTE
FORMULA Philosophers-COL-001000-ReachabilityCardinality-2024-13 CANNOT_COMPUTE
FORMULA Philosophers-COL-001000-ReachabilityCardinality-2024-14 CANNOT_COMPUTE
FORMULA Philosophers-COL-001000-ReachabilityCardinality-2024-15 CANNOT_COMPUTE
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716879832938

--------------------
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
Error in allocating array of size 524288 at unique_table.cc, line 313
MEDDLY ERROR: Insufficient memory

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Error in allocating array of size 524288 at unique_table.cc, line 313
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="Philosophers-COL-001000"
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 Philosophers-COL-001000, 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 r267-smll-171654406400438"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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