Execution Chart

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

Trace from the execution

Formatting '/data/fko/mcc2022-input.r215-oct2-165281606000254.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool gold2021
Input is SharedMemory-PT-000020, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r215-oct2-165281606000254
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 6.7M
-rw-r--r-- 1 mcc users 146K Apr 30 10:24 CTLCardinality.txt
-rw-r--r-- 1 mcc users 612K Apr 30 10:24 CTLCardinality.xml
-rw-r--r-- 1 mcc users 300K Apr 30 10:14 CTLFireability.txt
-rw-r--r-- 1 mcc users 1.2M Apr 30 10:14 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 63K May 9 08:46 LTLCardinality.txt
-rw-r--r-- 1 mcc users 189K May 9 08:46 LTLCardinality.xml
-rw-r--r-- 1 mcc users 117K May 9 08:46 LTLFireability.txt
-rw-r--r-- 1 mcc users 365K May 9 08:46 LTLFireability.xml
-rw-r--r-- 1 mcc users 128K Apr 30 10:46 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 543K Apr 30 10:46 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 522K Apr 30 10:42 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 2.1M Apr 30 10:42 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.9K May 9 08:46 UpperBounds.txt
-rw-r--r-- 1 mcc users 6.8K May 9 08:46 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 7 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 413K May 10 09:34 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 SharedMemory-PT-000020-ReachabilityCardinality-00
FORMULA_NAME SharedMemory-PT-000020-ReachabilityCardinality-01
FORMULA_NAME SharedMemory-PT-000020-ReachabilityCardinality-02
FORMULA_NAME SharedMemory-PT-000020-ReachabilityCardinality-03
FORMULA_NAME SharedMemory-PT-000020-ReachabilityCardinality-04
FORMULA_NAME SharedMemory-PT-000020-ReachabilityCardinality-05
FORMULA_NAME SharedMemory-PT-000020-ReachabilityCardinality-06
FORMULA_NAME SharedMemory-PT-000020-ReachabilityCardinality-07
FORMULA_NAME SharedMemory-PT-000020-ReachabilityCardinality-08
FORMULA_NAME SharedMemory-PT-000020-ReachabilityCardinality-09
FORMULA_NAME SharedMemory-PT-000020-ReachabilityCardinality-10
FORMULA_NAME SharedMemory-PT-000020-ReachabilityCardinality-11
FORMULA_NAME SharedMemory-PT-000020-ReachabilityCardinality-12
FORMULA_NAME SharedMemory-PT-000020-ReachabilityCardinality-13
FORMULA_NAME SharedMemory-PT-000020-ReachabilityCardinality-14
FORMULA_NAME SharedMemory-PT-000020-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1655069120356

Running Version 0
[2022-06-12 21:25:21] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-06-12 21:25:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-12 21:25:21] [INFO ] Load time of PNML (sax parser for PT used): 74 ms
[2022-06-12 21:25:21] [INFO ] Transformed 461 places.
[2022-06-12 21:25:21] [INFO ] Transformed 820 transitions.
[2022-06-12 21:25:21] [INFO ] Found NUPN structural information;
[2022-06-12 21:25:21] [INFO ] Completing missing partition info from NUPN : creating a component with [Ext_Mem_Acc_19_3, Ext_Mem_Acc_18_3, Ext_Mem_Acc_2_7, Ext_Mem_Acc_1_7, Ext_Mem_Acc_8_9, Ext_Mem_Acc_7_9, Ext_Mem_Acc_19_11, Ext_Mem_Acc_20_11, Ext_Mem_Acc_8_14, Ext_Mem_Acc_13_14, Ext_Mem_Acc_7_19, Ext_Mem_Acc_6_19]
[2022-06-12 21:25:21] [INFO ] Parsed PT model containing 461 places and 820 transitions in 114 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 36 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 2 resets, run finished after 356 ms. (steps per millisecond=28 ) properties (out of 16) seen :2
FORMULA SharedMemory-PT-000020-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SharedMemory-PT-000020-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 173 ms. (steps per millisecond=57 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 234 ms. (steps per millisecond=42 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 14) seen :0
Running SMT prover for 14 properties.
// Phase 1: matrix 820 rows 461 cols
[2022-06-12 21:25:23] [INFO ] Computed 41 place invariants in 27 ms
[2022-06-12 21:25:23] [INFO ] [Real]Absence check using 41 positive place invariants in 20 ms returned unsat
[2022-06-12 21:25:23] [INFO ] [Real]Absence check using 41 positive place invariants in 14 ms returned unsat
[2022-06-12 21:25:23] [INFO ] [Real]Absence check using 41 positive place invariants in 26 ms returned sat
[2022-06-12 21:25:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:25:24] [INFO ] [Real]Absence check using state equation in 170 ms returned sat
[2022-06-12 21:25:24] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:25:24] [INFO ] [Real]Absence check using 41 positive place invariants in 15 ms returned sat
[2022-06-12 21:25:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:25:24] [INFO ] [Real]Absence check using state equation in 136 ms returned sat
[2022-06-12 21:25:24] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:25:24] [INFO ] [Real]Absence check using 41 positive place invariants in 15 ms returned sat
[2022-06-12 21:25:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:25:24] [INFO ] [Real]Absence check using state equation in 140 ms returned sat
[2022-06-12 21:25:24] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:25:24] [INFO ] [Real]Absence check using 41 positive place invariants in 28 ms returned sat
[2022-06-12 21:25:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:25:24] [INFO ] [Real]Absence check using state equation in 168 ms returned sat
[2022-06-12 21:25:25] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:25:29] [INFO ] [Real]Absence check using 41 positive place invariants in 14 ms returned sat
[2022-06-12 21:25:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:25:29] [INFO ] [Real]Absence check using state equation in 132 ms returned sat
[2022-06-12 21:25:29] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:25:29] [INFO ] [Real]Absence check using 41 positive place invariants in 15 ms returned sat
[2022-06-12 21:25:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:25:29] [INFO ] [Real]Absence check using state equation in 113 ms returned sat
[2022-06-12 21:25:29] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:25:29] [INFO ] [Real]Absence check using 41 positive place invariants in 19 ms returned sat
[2022-06-12 21:25:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:25:29] [INFO ] [Real]Absence check using state equation in 197 ms returned sat
[2022-06-12 21:25:29] [INFO ] Solution in real domain found non-integer solution.
FORMULA SharedMemory-PT-000020-ReachabilityCardinality-15 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA SharedMemory-PT-000020-ReachabilityCardinality-14 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA SharedMemory-PT-000020-ReachabilityCardinality-13 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA SharedMemory-PT-000020-ReachabilityCardinality-11 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA SharedMemory-PT-000020-ReachabilityCardinality-10 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA SharedMemory-PT-000020-ReachabilityCardinality-08 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA SharedMemory-PT-000020-ReachabilityCardinality-07 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA SharedMemory-PT-000020-ReachabilityCardinality-06 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA SharedMemory-PT-000020-ReachabilityCardinality-05 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA SharedMemory-PT-000020-ReachabilityCardinality-03 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA SharedMemory-PT-000020-ReachabilityCardinality-02 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA SharedMemory-PT-000020-ReachabilityCardinality-01 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA SharedMemory-PT-000020-ReachabilityCardinality-00 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 14 Parikh solutions to 1 different solutions.
Support contains 15 out of 461 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 461/461 places, 820/820 transitions.
Drop transitions removed 330 transitions
Trivial Post-agglo rules discarded 330 transitions
Performed 330 trivial Post agglomeration. Transition count delta: 330
Iterating post reduction 0 with 330 rules applied. Total rules applied 330 place count 461 transition count 490
Discarding 4 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Remove reverse transitions (loop back) rule discarded transition End_Own_Acc_6_6 and 4 places that fell out of Prefix Of Interest.
Drop transitions removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Iterating post reduction 1 with 40 rules applied. Total rules applied 370 place count 126 transition count 448
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition End_Own_Acc_20_20 and 1 places that fell out of Prefix Of Interest.
Drop transitions removed 1 transitions
Ensure Unique test removed 161 transitions
Reduce isomorphic transitions removed 162 transitions.
Graph (trivial) has 43 edges and 98 vertex of which 16 / 98 are part of one of the 8 SCC in 1667 ms
Free SCC test removed 8 places
Iterating post reduction 2 with 164 rules applied. Total rules applied 534 place count 90 transition count 285
Drop transitions removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 3 with 16 rules applied. Total rules applied 550 place count 90 transition count 269
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 9 Pre rules applied. Total rules applied 550 place count 90 transition count 260
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 18 rules applied. Total rules applied 568 place count 81 transition count 260
Drop transitions removed 82 transitions
Reduce isomorphic transitions removed 82 transitions.
Iterating post reduction 4 with 82 rules applied. Total rules applied 650 place count 81 transition count 178
Drop transitions removed 76 transitions
Redundant transition composition rules discarded 76 transitions
Iterating global reduction 5 with 76 rules applied. Total rules applied 726 place count 81 transition count 102
Free-agglomeration rule applied 18 times.
Iterating global reduction 5 with 18 rules applied. Total rules applied 744 place count 81 transition count 84
Reduce places removed 18 places and 0 transitions.
Drop transitions removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 5 with 36 rules applied. Total rules applied 780 place count 63 transition count 66
Applied a total of 780 rules in 1759 ms. Remains 63 /461 variables (removed 398) and now considering 66/820 (removed 754) transitions.
Finished structural reductions, in 1 iterations. Remains : 63/461 places, 66/820 transitions.
[2022-06-12 21:25:31] [INFO ] Flatten gal took : 26 ms
[2022-06-12 21:25:31] [INFO ] Flatten gal took : 7 ms
[2022-06-12 21:25:31] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12442189601501592005.gal : 5 ms
[2022-06-12 21:25:31] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4305973947941725070.prop : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality12442189601501592005.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality4305973947941725070.prop, --nowitness, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityCardinality12442189601501592005.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality4305973947941725070.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality4305973947941725070.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 26
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :26 after 53
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,65,0.021011,4232,2,557,7,1490,7,0,344,490,0
Total reachable state count : 65

Verifying 1 reachability properties.
Invariant property SharedMemory-PT-000020-ReachabilityCardinality-12 is true.
FORMULA SharedMemory-PT-000020-ReachabilityCardinality-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
SharedMemory-PT-000020-ReachabilityCardinality-12,0,0.022222,4592,1,0,7,1490,7,0,352,490,0
All properties solved without resorting to model-checking.

BK_STOP 1655069133891

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution ReachabilityCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination ReachabilityCardinality -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

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="SharedMemory-PT-000020"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="gold2021"
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-4028"
echo " Executing tool gold2021"
echo " Input is SharedMemory-PT-000020, 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 r215-oct2-165281606000254"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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