Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2021-input.r026-tajo-162038143800358.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is BusinessProcesses-PT-05, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r026-tajo-162038143800358
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 408K
-rw-r--r-- 1 mcc users 12K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 105K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.2K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 64K May 5 16:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.1K Mar 28 15:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Mar 28 15:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 15:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 28 15:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Mar 23 03:00 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Mar 23 03:00 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Mar 22 12:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K Mar 22 12:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 09:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 22 09:10 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 3 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 85K May 5 16:51 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 BusinessProcesses-PT-05-ReachabilityCardinality-00
FORMULA_NAME BusinessProcesses-PT-05-ReachabilityCardinality-01
FORMULA_NAME BusinessProcesses-PT-05-ReachabilityCardinality-02
FORMULA_NAME BusinessProcesses-PT-05-ReachabilityCardinality-03
FORMULA_NAME BusinessProcesses-PT-05-ReachabilityCardinality-04
FORMULA_NAME BusinessProcesses-PT-05-ReachabilityCardinality-05
FORMULA_NAME BusinessProcesses-PT-05-ReachabilityCardinality-06
FORMULA_NAME BusinessProcesses-PT-05-ReachabilityCardinality-07
FORMULA_NAME BusinessProcesses-PT-05-ReachabilityCardinality-08
FORMULA_NAME BusinessProcesses-PT-05-ReachabilityCardinality-09
FORMULA_NAME BusinessProcesses-PT-05-ReachabilityCardinality-10
FORMULA_NAME BusinessProcesses-PT-05-ReachabilityCardinality-11
FORMULA_NAME BusinessProcesses-PT-05-ReachabilityCardinality-12
FORMULA_NAME BusinessProcesses-PT-05-ReachabilityCardinality-13
FORMULA_NAME BusinessProcesses-PT-05-ReachabilityCardinality-14
FORMULA_NAME BusinessProcesses-PT-05-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1620543140696

Running Version 0
[2021-05-09 06:52:22] [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]
[2021-05-09 06:52:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-09 06:52:23] [INFO ] Load time of PNML (sax parser for PT used): 57 ms
[2021-05-09 06:52:23] [INFO ] Transformed 368 places.
[2021-05-09 06:52:23] [INFO ] Transformed 319 transitions.
[2021-05-09 06:52:23] [INFO ] Found NUPN structural information;
[2021-05-09 06:52:23] [INFO ] Parsed PT model containing 368 places and 319 transitions in 97 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 9 ms.
Working with output stream class java.io.PrintStream
[2021-05-09 06:52:23] [INFO ] Initial state test concluded for 1 properties.
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 1 transitions.
FORMULA BusinessProcesses-PT-05-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-05-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-05-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-05-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-05-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-05-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-05-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-05-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 96 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 8) seen :1
FORMULA BusinessProcesses-PT-05-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 14 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 7) seen :2
FORMULA BusinessProcesses-PT-05-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-05-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 318 rows 367 cols
[2021-05-09 06:52:23] [INFO ] Computed 57 place invariants in 28 ms
[2021-05-09 06:52:23] [INFO ] [Real]Absence check using 41 positive place invariants in 36 ms returned sat
[2021-05-09 06:52:23] [INFO ] [Real]Absence check using 41 positive and 16 generalized place invariants in 5 ms returned sat
[2021-05-09 06:52:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 06:52:23] [INFO ] [Real]Absence check using state equation in 140 ms returned sat
[2021-05-09 06:52:23] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 06:52:23] [INFO ] [Nat]Absence check using 41 positive place invariants in 19 ms returned sat
[2021-05-09 06:52:23] [INFO ] [Nat]Absence check using 41 positive and 16 generalized place invariants in 4 ms returned sat
[2021-05-09 06:52:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 06:52:23] [INFO ] [Nat]Absence check using state equation in 110 ms returned unsat
[2021-05-09 06:52:23] [INFO ] [Real]Absence check using 41 positive place invariants in 11 ms returned sat
[2021-05-09 06:52:23] [INFO ] [Real]Absence check using 41 positive and 16 generalized place invariants in 3 ms returned sat
[2021-05-09 06:52:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 06:52:24] [INFO ] [Real]Absence check using state equation in 134 ms returned sat
[2021-05-09 06:52:24] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 06:52:24] [INFO ] [Real]Absence check using 41 positive place invariants in 11 ms returned sat
[2021-05-09 06:52:24] [INFO ] [Real]Absence check using 41 positive and 16 generalized place invariants in 3 ms returned sat
[2021-05-09 06:52:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 06:52:24] [INFO ] [Real]Absence check using state equation in 95 ms returned sat
[2021-05-09 06:52:24] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 06:52:24] [INFO ] [Nat]Absence check using 41 positive place invariants in 12 ms returned sat
[2021-05-09 06:52:24] [INFO ] [Nat]Absence check using 41 positive and 16 generalized place invariants in 2 ms returned sat
[2021-05-09 06:52:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 06:52:24] [INFO ] [Nat]Absence check using state equation in 97 ms returned sat
[2021-05-09 06:52:24] [INFO ] Deduced a trap composed of 8 places in 101 ms of which 3 ms to minimize.
[2021-05-09 06:52:24] [INFO ] Deduced a trap composed of 12 places in 75 ms of which 1 ms to minimize.
[2021-05-09 06:52:24] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 1 ms to minimize.
[2021-05-09 06:52:24] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 2 ms to minimize.
[2021-05-09 06:52:24] [INFO ] Deduced a trap composed of 22 places in 52 ms of which 1 ms to minimize.
[2021-05-09 06:52:25] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 0 ms to minimize.
[2021-05-09 06:52:25] [INFO ] Deduced a trap composed of 20 places in 45 ms of which 1 ms to minimize.
[2021-05-09 06:52:25] [INFO ] Deduced a trap composed of 23 places in 67 ms of which 1 ms to minimize.
[2021-05-09 06:52:25] [INFO ] Deduced a trap composed of 36 places in 44 ms of which 1 ms to minimize.
[2021-05-09 06:52:25] [INFO ] Deduced a trap composed of 25 places in 25 ms of which 1 ms to minimize.
[2021-05-09 06:52:25] [INFO ] Deduced a trap composed of 27 places in 30 ms of which 0 ms to minimize.
[2021-05-09 06:52:25] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 779 ms
[2021-05-09 06:52:25] [INFO ] Computed and/alt/rep : 291/355/291 causal constraints (skipped 26 transitions) in 25 ms.
[2021-05-09 06:52:26] [INFO ] Added : 183 causal constraints over 37 iterations in 751 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 2 ms.
[2021-05-09 06:52:26] [INFO ] [Real]Absence check using 41 positive place invariants in 21 ms returned sat
[2021-05-09 06:52:26] [INFO ] [Real]Absence check using 41 positive and 16 generalized place invariants in 5 ms returned sat
[2021-05-09 06:52:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 06:52:26] [INFO ] [Real]Absence check using state equation in 246 ms returned sat
[2021-05-09 06:52:26] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 06:52:26] [INFO ] [Real]Absence check using 41 positive place invariants in 23 ms returned sat
[2021-05-09 06:52:26] [INFO ] [Real]Absence check using 41 positive and 16 generalized place invariants in 4 ms returned sat
[2021-05-09 06:52:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 06:52:26] [INFO ] [Real]Absence check using state equation in 126 ms returned sat
[2021-05-09 06:52:26] [INFO ] Deduced a trap composed of 8 places in 124 ms of which 1 ms to minimize.
[2021-05-09 06:52:26] [INFO ] Deduced a trap composed of 17 places in 88 ms of which 1 ms to minimize.
[2021-05-09 06:52:27] [INFO ] Deduced a trap composed of 8 places in 87 ms of which 1 ms to minimize.
[2021-05-09 06:52:27] [INFO ] Deduced a trap composed of 11 places in 110 ms of which 1 ms to minimize.
[2021-05-09 06:52:27] [INFO ] Deduced a trap composed of 19 places in 103 ms of which 0 ms to minimize.
[2021-05-09 06:52:27] [INFO ] Deduced a trap composed of 19 places in 90 ms of which 1 ms to minimize.
[2021-05-09 06:52:27] [INFO ] Deduced a trap composed of 35 places in 87 ms of which 0 ms to minimize.
[2021-05-09 06:52:27] [INFO ] Deduced a trap composed of 96 places in 86 ms of which 0 ms to minimize.
[2021-05-09 06:52:27] [INFO ] Deduced a trap composed of 28 places in 25 ms of which 0 ms to minimize.
[2021-05-09 06:52:27] [INFO ] Deduced a trap composed of 37 places in 25 ms of which 1 ms to minimize.
[2021-05-09 06:52:27] [INFO ] Deduced a trap composed of 31 places in 19 ms of which 1 ms to minimize.
[2021-05-09 06:52:27] [INFO ] Deduced a trap composed of 94 places in 84 ms of which 1 ms to minimize.
[2021-05-09 06:52:28] [INFO ] Deduced a trap composed of 95 places in 116 ms of which 1 ms to minimize.
[2021-05-09 06:52:28] [INFO ] Deduced a trap composed of 96 places in 84 ms of which 0 ms to minimize.
[2021-05-09 06:52:28] [INFO ] Deduced a trap composed of 91 places in 89 ms of which 1 ms to minimize.
[2021-05-09 06:52:28] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 1596 ms
[2021-05-09 06:52:28] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 06:52:28] [INFO ] [Nat]Absence check using 41 positive place invariants in 13 ms returned sat
[2021-05-09 06:52:28] [INFO ] [Nat]Absence check using 41 positive and 16 generalized place invariants in 3 ms returned sat
[2021-05-09 06:52:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 06:52:28] [INFO ] [Nat]Absence check using state equation in 107 ms returned sat
[2021-05-09 06:52:28] [INFO ] Deduced a trap composed of 8 places in 87 ms of which 1 ms to minimize.
[2021-05-09 06:52:28] [INFO ] Deduced a trap composed of 17 places in 84 ms of which 1 ms to minimize.
[2021-05-09 06:52:28] [INFO ] Deduced a trap composed of 8 places in 93 ms of which 0 ms to minimize.
[2021-05-09 06:52:28] [INFO ] Deduced a trap composed of 11 places in 95 ms of which 1 ms to minimize.
[2021-05-09 06:52:29] [INFO ] Deduced a trap composed of 19 places in 86 ms of which 0 ms to minimize.
[2021-05-09 06:52:29] [INFO ] Deduced a trap composed of 19 places in 84 ms of which 0 ms to minimize.
[2021-05-09 06:52:29] [INFO ] Deduced a trap composed of 35 places in 83 ms of which 2 ms to minimize.
[2021-05-09 06:52:29] [INFO ] Deduced a trap composed of 94 places in 92 ms of which 7 ms to minimize.
[2021-05-09 06:52:29] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 0 ms to minimize.
[2021-05-09 06:52:29] [INFO ] Deduced a trap composed of 31 places in 23 ms of which 1 ms to minimize.
[2021-05-09 06:52:29] [INFO ] Deduced a trap composed of 23 places in 20 ms of which 1 ms to minimize.
[2021-05-09 06:52:29] [INFO ] Deduced a trap composed of 25 places in 22 ms of which 0 ms to minimize.
[2021-05-09 06:52:29] [INFO ] Deduced a trap composed of 27 places in 29 ms of which 1 ms to minimize.
[2021-05-09 06:52:29] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 1077 ms
[2021-05-09 06:52:29] [INFO ] Computed and/alt/rep : 291/355/291 causal constraints (skipped 26 transitions) in 18 ms.
[2021-05-09 06:52:30] [INFO ] Added : 195 causal constraints over 40 iterations in 828 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 5 ms.
FORMULA BusinessProcesses-PT-05-ReachabilityCardinality-12 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-05-ReachabilityCardinality-09 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-05-ReachabilityCardinality-00 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 5 Parikh solutions to 2 different solutions.
Incomplete Parikh walk after 19800 steps, including 110 resets, run finished after 64 ms. (steps per millisecond=309 ) properties (out of 2) seen :1 could not realise parikh vector
FORMULA BusinessProcesses-PT-05-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Finished Parikh walk after 111 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=55 )
FORMULA BusinessProcesses-PT-05-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
All properties solved without resorting to model-checking.

BK_STOP 1620543150778

--------------------
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="BusinessProcesses-PT-05"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="itstools"
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 itstools"
echo " Input is BusinessProcesses-PT-05, 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 r026-tajo-162038143800358"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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