fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r601-tall-171774424100286
Last Updated
July 7, 2024

About the Execution of GreatSPN+red for BlocksWorld-PT-16

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
16200.527 3600000.00 4366005.00 10214.60 FF??FTTTFT?TTTTF normal

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.r601-tall-171774424100286.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 BlocksWorld-PT-16, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r601-tall-171774424100286
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 86M
-rw-r--r-- 1 mcc users 2.2M Jun 7 06:38 CTLCardinality.txt
-rw-r--r-- 1 mcc users 11M Jun 7 06:38 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.4M Jun 7 06:38 CTLFireability.txt
-rw-r--r-- 1 mcc users 18M Jun 7 06:38 CTLFireability.xml
-rw-r--r-- 1 mcc users 62K Jun 7 06:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 194K Jun 7 06:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 997K Jun 7 06:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 3.8M Jun 7 06:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 7 06:26 NewModel
-rw-r--r-- 1 mcc users 1.9M Jun 7 06:39 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 8.0M Jun 7 06:39 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.1M Jun 7 06:39 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 26M Jun 7 06:39 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 8.7K Jun 7 06:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 19K Jun 7 06:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Jun 7 06:26 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 7 06:26 instance
-rw-r--r-- 1 mcc users 6 Jun 7 06:26 iscolored
-rw-r--r-- 1 mcc users 6.6M Jun 7 06:26 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 BlocksWorld-PT-16-ReachabilityCardinality-2024-00
FORMULA_NAME BlocksWorld-PT-16-ReachabilityCardinality-2024-01
FORMULA_NAME BlocksWorld-PT-16-ReachabilityCardinality-2024-02
FORMULA_NAME BlocksWorld-PT-16-ReachabilityCardinality-2024-03
FORMULA_NAME BlocksWorld-PT-16-ReachabilityCardinality-2024-04
FORMULA_NAME BlocksWorld-PT-16-ReachabilityCardinality-2024-05
FORMULA_NAME BlocksWorld-PT-16-ReachabilityCardinality-2024-06
FORMULA_NAME BlocksWorld-PT-16-ReachabilityCardinality-2024-07
FORMULA_NAME BlocksWorld-PT-16-ReachabilityCardinality-2024-08
FORMULA_NAME BlocksWorld-PT-16-ReachabilityCardinality-2024-09
FORMULA_NAME BlocksWorld-PT-16-ReachabilityCardinality-2024-10
FORMULA_NAME BlocksWorld-PT-16-ReachabilityCardinality-2024-11
FORMULA_NAME BlocksWorld-PT-16-ReachabilityCardinality-2024-12
FORMULA_NAME BlocksWorld-PT-16-ReachabilityCardinality-2024-13
FORMULA_NAME BlocksWorld-PT-16-ReachabilityCardinality-2024-14
FORMULA_NAME BlocksWorld-PT-16-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717790385500

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BlocksWorld-PT-16
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-06-07 19:59:46] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-06-07 19:59:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-07 19:59:47] [INFO ] Load time of PNML (sax parser for PT used): 554 ms
[2024-06-07 19:59:47] [INFO ] Transformed 6971 places.
[2024-06-07 19:59:47] [INFO ] Transformed 13613 transitions.
[2024-06-07 19:59:47] [INFO ] Found NUPN structural information;
[2024-06-07 19:59:47] [INFO ] Completing missing partition info from NUPN : creating a component with [pred_on_table_0, pred_arm_empty_0, pred_on_table_1, pred_on_table_2, pred_on_table_3, pred_on_table_4, pred_on_table_5, pred_on_table_6, pred_on_table_7, pred_on_table_8, pred_on_table_9, pred_on_table_10, pred_on_table_11, pred_on_table_12, pred_on_table_13, pred_on_table_14, pred_on_table_15, pred_on_table_16, pred_on_table_17, pred_on_table_18, pred_on_table_19, pred_on_table_20, pred_on_table_21, pred_on_table_22, pred_on_table_23, pred_on_table_24, pred_on_table_25, pred_on_table_26, pred_on_table_27, pred_on_table_28, pred_on_table_29, pred_on_table_30, pred_on_table_31, pred_on_table_32, pred_on_table_33, pred_on_table_34, pred_on_table_35, pred_on_table_36, pred_on_table_37, pred_on_table_38, pred_on_table_39, pred_on_table_40, pred_on_table_41, pred_on_table_42, pred_on_table_43, pred_on_table_44, pred_on_table_45, pred_on_table_46, pred_on_table_47, pred_on_table_48, pred_on_table_49, pred_on_table_50, pred_on_table_51, pred_on_table_52, pred_on_table_53, pred_on_table_54, pred_on_table_55, pred_on_table_56, pred_on_table_57, pred_on_table_58, pred_on_table_59, pred_on_table_60, pred_on_table_61, pred_on_table_62, pred_on_table_63, pred_on_table_64, pred_on_table_65, pred_on_table_66, pred_on_table_67, pred_on_table_68, pred_on_table_69, pred_on_table_70, pred_on_table_71, pred_on_table_72, pred_on_table_73, pred_on_table_74, pred_on_table_75, pred_on_table_76, pred_on_table_77, pred_on_table_78, pred_on_table_79, pred_on_table_80, pred_on_table_81]
[2024-06-07 19:59:47] [INFO ] Parsed PT model containing 6971 places and 13613 transitions and 68044 arcs in 740 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 251 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (8 resets) in 20630 ms. (1 steps per ms) remains 13/16 properties
FORMULA BlocksWorld-PT-16-ReachabilityCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BlocksWorld-PT-16-ReachabilityCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BlocksWorld-PT-16-ReachabilityCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 7929 ms. (5 steps per ms) remains 11/13 properties
FORMULA BlocksWorld-PT-16-ReachabilityCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BlocksWorld-PT-16-ReachabilityCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 2520 ms. (15 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 12008 ms. (3 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1690 ms. (23 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 8168 ms. (4 steps per ms) remains 11/11 properties
BEST_FIRST walk for 20286 steps (4 resets) in 20035 ms. (1 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1656 ms. (24 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (8 resets) in 1679 ms. (23 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 2259 ms. (17 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1662 ms. (24 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1694 ms. (23 steps per ms) remains 11/11 properties
// Phase 1: matrix 13613 rows 6971 cols
[2024-06-07 20:00:09] [INFO ] Computed 165 invariants in 204 ms
[2024-06-07 20:00:09] [INFO ] State equation strengthened by 147 read => feed constraints.
Problem BlocksWorld-PT-16-ReachabilityCardinality-2024-00 is UNSAT
FORMULA BlocksWorld-PT-16-ReachabilityCardinality-2024-00 FALSE TECHNIQUES SMT_REFINEMENT
Problem BlocksWorld-PT-16-ReachabilityCardinality-2024-05 is UNSAT
FORMULA BlocksWorld-PT-16-ReachabilityCardinality-2024-05 TRUE TECHNIQUES SMT_REFINEMENT
Problem BlocksWorld-PT-16-ReachabilityCardinality-2024-15 is UNSAT
FORMULA BlocksWorld-PT-16-ReachabilityCardinality-2024-15 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 0 (INCLUDED_ONLY) 0/6971 variables, 165/165 constraints. Problems are: Problem set: 3 solved, 8 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 6971/20584 variables, and 165 constraints, problems are : Problem set: 3 solved, 8 unsolved in 5098 ms.
Refiners :[Positive P Invariants (semi-flows): 165/165 constraints, State Equation: 0/6971 constraints, ReadFeed: 0/147 constraints, PredecessorRefiner: 9/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 8 unsolved
Problem BlocksWorld-PT-16-ReachabilityCardinality-2024-06 is UNSAT
FORMULA BlocksWorld-PT-16-ReachabilityCardinality-2024-06 TRUE TECHNIQUES SMT_REFINEMENT
Problem BlocksWorld-PT-16-ReachabilityCardinality-2024-07 is UNSAT
FORMULA BlocksWorld-PT-16-ReachabilityCardinality-2024-07 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 0 (INCLUDED_ONLY) 0/6971 variables, 165/165 constraints. Problems are: Problem set: 5 solved, 6 unsolved
[2024-06-07 20:00:44] [INFO ] Deduced a trap composed of 1700 places in 12513 ms of which 301 ms to minimize.
SMT process timed out in 35630ms, After SMT, problems are : Problem set: 5 solved, 6 unsolved
Fused 6 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 6971 out of 6971 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6971/6971 places, 13613/13613 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 6971 transition count 13612
Applied a total of 1 rules in 3925 ms. Remains 6971 /6971 variables (removed 0) and now considering 13612/13613 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3940 ms. Remains : 6971/6971 places, 13612/13613 transitions.
RANDOM walk for 40000 steps (8 resets) in 7234 ms. (5 steps per ms) remains 3/6 properties
FORMULA BlocksWorld-PT-16-ReachabilityCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BlocksWorld-PT-16-ReachabilityCardinality-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BlocksWorld-PT-16-ReachabilityCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (8 resets) in 940 ms. (42 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 10548 ms. (3 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 645 ms. (61 steps per ms) remains 3/3 properties
// Phase 1: matrix 13612 rows 6971 cols
[2024-06-07 20:00:54] [INFO ] Computed 165 invariants in 103 ms
[2024-06-07 20:00:54] [INFO ] State equation strengthened by 146 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6971 variables, 165/165 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6971 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 13612/20583 variables, 6971/7136 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/20583 variables, 146/7282 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/20583 variables, 0/7282 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 0/20583 variables, 0/7282 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 20583/20583 variables, and 7282 constraints, problems are : Problem set: 0 solved, 3 unsolved in 23985 ms.
Refiners :[Positive P Invariants (semi-flows): 165/165 constraints, State Equation: 6971/6971 constraints, ReadFeed: 146/146 constraints, PredecessorRefiner: 3/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6971 variables, 165/165 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-07 20:01:38] [INFO ] Deduced a trap composed of 83 places in 16404 ms of which 42 ms to minimize.
[2024-06-07 20:01:54] [INFO ] Deduced a trap composed of 83 places in 15698 ms of which 48 ms to minimize.
[2024-06-07 20:02:10] [INFO ] Deduced a trap composed of 83 places in 16315 ms of which 44 ms to minimize.
SMT process timed out in 76602ms, After SMT, problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 6971 out of 6971 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6971/6971 places, 13612/13612 transitions.
Applied a total of 0 rules in 3433 ms. Remains 6971 /6971 variables (removed 0) and now considering 13612/13612 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3434 ms. Remains : 6971/6971 places, 13612/13612 transitions.
RANDOM walk for 40000 steps (8 resets) in 7733 ms. (5 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 977 ms. (40 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 13688 ms. (2 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 756 ms. (52 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 636677 steps, run timeout after 18001 ms. (steps per millisecond=35 ) properties seen :0 out of 3
Probabilistic random walk after 636677 steps, saw 538938 distinct states, run finished after 18013 ms. (steps per millisecond=35 ) properties seen :0
[2024-06-07 20:02:38] [INFO ] Invariant cache hit.
[2024-06-07 20:02:38] [INFO ] State equation strengthened by 146 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6971 variables, 165/165 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6971 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 13612/20583 variables, 6971/7136 constraints. Problems are: Problem set: 0 solved, 3 unsolved
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running BlocksWorld-PT-16

IS_COLORED=
IS_NUPN=1

LOADING model.pnml ...
MODEL CLASS: P/T NET WITH NUPN EXTENSION
PLACES: 6971
TRANSITIONS: 13613
CONSTANTS: 0
TEMPLATE VARS: 0
ARCS: 68044
NUPN UNITS: 166
LOADING TIME: 74.419

SAVING AS /home/mcc/execution/model.(net/def) ...
exportGspn useExt=true
SAVING TIME: 0.392
SAVING NAME MAP FILE /home/mcc/execution/model.id2name ...
SAVING NUPN UNITS AS FILE /home/mcc/execution/model.nu ...
TOTAL TIME: 75.772
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: 601
MODEL NAME: /home/mcc/execution/model
6971 places, 13613 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
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
Error in allocating array of size 1178103172 at storage/ct_typebased.h, line 1565
MEDDLY ERROR: Insufficient memory

Error in allocating array of size 1178103172 at storage/ct_typebased.h, line 1565
MEDDLY ERROR: Insufficient memory

Error in allocating array of size 1178103172 at storage/ct_typebased.h, line 1565
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="BlocksWorld-PT-16"
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 BlocksWorld-PT-16, 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 r601-tall-171774424100286"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BlocksWorld-PT-16.tgz
mv BlocksWorld-PT-16 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 ;