fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r298-tall-167873952400910
Last Updated
May 14, 2023

About the Execution of Marcie+red for QuasiCertifProtocol-PT-32

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
10318.136 575558.00 624925.00 1807.20 ?FT?F????TFTTTTT normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r298-tall-167873952400910.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool marciexred
Input is QuasiCertifProtocol-PT-32, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r298-tall-167873952400910
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.7M
-rw-r--r-- 1 mcc users 74K Feb 26 01:38 CTLCardinality.txt
-rw-r--r-- 1 mcc users 454K Feb 26 01:38 CTLCardinality.xml
-rw-r--r-- 1 mcc users 16K Feb 26 01:28 CTLFireability.txt
-rw-r--r-- 1 mcc users 113K Feb 26 01:28 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 21K Feb 25 16:37 LTLCardinality.txt
-rw-r--r-- 1 mcc users 93K Feb 25 16:37 LTLCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 25 16:37 LTLFireability.txt
-rw-r--r-- 1 mcc users 54K Feb 25 16:37 LTLFireability.xml
-rw-r--r-- 1 mcc users 223K Feb 26 01:49 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 1.3M Feb 26 01:49 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 53K Feb 26 01:41 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 343K Feb 26 01:41 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 16:37 UpperBounds.txt
-rw-r--r-- 1 mcc users 6.5K Feb 25 16:37 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 942K Mar 5 18:23 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 QuasiCertifProtocol-PT-32-ReachabilityCardinality-00
FORMULA_NAME QuasiCertifProtocol-PT-32-ReachabilityCardinality-01
FORMULA_NAME QuasiCertifProtocol-PT-32-ReachabilityCardinality-02
FORMULA_NAME QuasiCertifProtocol-PT-32-ReachabilityCardinality-03
FORMULA_NAME QuasiCertifProtocol-PT-32-ReachabilityCardinality-04
FORMULA_NAME QuasiCertifProtocol-PT-32-ReachabilityCardinality-05
FORMULA_NAME QuasiCertifProtocol-PT-32-ReachabilityCardinality-06
FORMULA_NAME QuasiCertifProtocol-PT-32-ReachabilityCardinality-07
FORMULA_NAME QuasiCertifProtocol-PT-32-ReachabilityCardinality-08
FORMULA_NAME QuasiCertifProtocol-PT-32-ReachabilityCardinality-09
FORMULA_NAME QuasiCertifProtocol-PT-32-ReachabilityCardinality-10
FORMULA_NAME QuasiCertifProtocol-PT-32-ReachabilityCardinality-11
FORMULA_NAME QuasiCertifProtocol-PT-32-ReachabilityCardinality-12
FORMULA_NAME QuasiCertifProtocol-PT-32-ReachabilityCardinality-13
FORMULA_NAME QuasiCertifProtocol-PT-32-ReachabilityCardinality-14
FORMULA_NAME QuasiCertifProtocol-PT-32-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1679691698120

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=marciexred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=QuasiCertifProtocol-PT-32
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-24 21:01:39] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-24 21:01:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-24 21:01:39] [INFO ] Load time of PNML (sax parser for PT used): 117 ms
[2023-03-24 21:01:39] [INFO ] Transformed 3806 places.
[2023-03-24 21:01:39] [INFO ] Transformed 506 transitions.
[2023-03-24 21:01:39] [INFO ] Parsed PT model containing 3806 places and 506 transitions and 8173 arcs in 316 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 224 ms.
Working with output stream class java.io.PrintStream
FORMULA QuasiCertifProtocol-PT-32-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 268 resets, run finished after 917 ms. (steps per millisecond=10 ) properties (out of 15) seen :1
FORMULA QuasiCertifProtocol-PT-32-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 262 ms. (steps per millisecond=38 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 11 resets, run finished after 290 ms. (steps per millisecond=34 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 1071 ms. (steps per millisecond=9 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 993 ms. (steps per millisecond=10 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 14) seen :0
Interrupted probabilistic random walk after 1128371 steps, run timeout after 12001 ms. (steps per millisecond=94 ) properties seen :{}
Probabilistic random walk after 1128371 steps, saw 136544 distinct states, run finished after 12003 ms. (steps per millisecond=94 ) properties seen :0
Running SMT prover for 14 properties.
// Phase 1: matrix 506 rows 3806 cols
[2023-03-24 21:01:56] [INFO ] Computed 3301 place invariants in 150 ms
[2023-03-24 21:01:59] [INFO ] [Real]Absence check using 3 positive place invariants in 16 ms returned sat
[2023-03-24 21:02:00] [INFO ] [Real]Absence check using 3 positive and 3298 generalized place invariants in 817 ms returned sat
[2023-03-24 21:02:00] [INFO ] After 2630ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:13
[2023-03-24 21:02:01] [INFO ] [Nat]Absence check using 3 positive place invariants in 38 ms returned sat
[2023-03-24 21:02:02] [INFO ] [Nat]Absence check using 3 positive and 3298 generalized place invariants in 805 ms returned sat
[2023-03-24 21:02:25] [INFO ] After 5778ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :11
[2023-03-24 21:02:25] [INFO ] After 5785ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :11
Attempting to minimize the solution found.
Minimization took 0 ms.
[2023-03-24 21:02:25] [INFO ] After 25041ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :11
FORMULA QuasiCertifProtocol-PT-32-ReachabilityCardinality-01 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 14 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 3806 out of 3806 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3806/3806 places, 506/506 transitions.
Applied a total of 0 rules in 76 ms. Remains 3806 /3806 variables (removed 0) and now considering 506/506 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 77 ms. Remains : 3806/3806 places, 506/506 transitions.
Incomplete random walk after 10000 steps, including 268 resets, run finished after 901 ms. (steps per millisecond=11 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 268 ms. (steps per millisecond=37 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 1058 ms. (steps per millisecond=9 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 945 ms. (steps per millisecond=10 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 13) seen :0
Interrupted probabilistic random walk after 716468 steps, run timeout after 9001 ms. (steps per millisecond=79 ) properties seen :{}
Probabilistic random walk after 716468 steps, saw 87879 distinct states, run finished after 9002 ms. (steps per millisecond=79 ) properties seen :0
Running SMT prover for 13 properties.
[2023-03-24 21:02:38] [INFO ] Invariant cache hit.
[2023-03-24 21:02:40] [INFO ] [Real]Absence check using 3 positive place invariants in 6 ms returned sat
[2023-03-24 21:02:41] [INFO ] [Real]Absence check using 3 positive and 3298 generalized place invariants in 764 ms returned sat
[2023-03-24 21:02:41] [INFO ] After 2168ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:13
[2023-03-24 21:02:42] [INFO ] [Nat]Absence check using 3 positive place invariants in 6 ms returned sat
[2023-03-24 21:02:43] [INFO ] [Nat]Absence check using 3 positive and 3298 generalized place invariants in 798 ms returned sat
[2023-03-24 21:03:06] [INFO ] After 6173ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
[2023-03-24 21:03:06] [INFO ] After 6184ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :11
Attempting to minimize the solution found.
Minimization took 1 ms.
[2023-03-24 21:03:06] [INFO ] After 25039ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :11
Fused 13 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 3806 out of 3806 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3806/3806 places, 506/506 transitions.
Applied a total of 0 rules in 44 ms. Remains 3806 /3806 variables (removed 0) and now considering 506/506 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44 ms. Remains : 3806/3806 places, 506/506 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3806/3806 places, 506/506 transitions.
Applied a total of 0 rules in 32 ms. Remains 3806 /3806 variables (removed 0) and now considering 506/506 (removed 0) transitions.
[2023-03-24 21:03:06] [INFO ] Invariant cache hit.
[2023-03-24 21:03:06] [INFO ] Implicit Places using invariants in 375 ms returned []
[2023-03-24 21:03:06] [INFO ] Invariant cache hit.
[2023-03-24 21:03:07] [INFO ] Implicit Places using invariants and state equation in 390 ms returned []
Implicit Place search using SMT with State Equation took 769 ms to find 0 implicit places.
[2023-03-24 21:03:07] [INFO ] Redundant transitions in 32 ms returned []
[2023-03-24 21:03:07] [INFO ] Invariant cache hit.
[2023-03-24 21:03:08] [INFO ] Dead Transitions using invariants and state equation in 735 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1583 ms. Remains : 3806/3806 places, 506/506 transitions.
Applied a total of 0 rules in 27 ms. Remains 3806 /3806 variables (removed 0) and now considering 506/506 (removed 0) transitions.
Running SMT prover for 13 properties.
[2023-03-24 21:03:08] [INFO ] Invariant cache hit.
[2023-03-24 21:03:09] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2023-03-24 21:03:10] [INFO ] [Real]Absence check using 3 positive and 3298 generalized place invariants in 801 ms returned sat
[2023-03-24 21:03:11] [INFO ] After 2117ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:13
[2023-03-24 21:03:12] [INFO ] [Nat]Absence check using 3 positive place invariants in 7 ms returned sat
[2023-03-24 21:03:12] [INFO ] [Nat]Absence check using 3 positive and 3298 generalized place invariants in 798 ms returned sat
[2023-03-24 21:04:03] [INFO ] After 27005ms SMT Verify possible using state equation in natural domain returned unsat :7 sat :4
[2023-03-24 21:04:24] [INFO ] After 48439ms SMT Verify possible using trap constraints in natural domain returned unsat :7 sat :2
Attempting to minimize the solution found.
Minimization took 2587 ms.
[2023-03-24 21:04:27] [INFO ] After 76141ms SMT Verify possible using all constraints in natural domain returned unsat :7 sat :2
FORMULA QuasiCertifProtocol-PT-32-ReachabilityCardinality-15 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT OVER_APPROXIMATION
FORMULA QuasiCertifProtocol-PT-32-ReachabilityCardinality-14 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT OVER_APPROXIMATION
FORMULA QuasiCertifProtocol-PT-32-ReachabilityCardinality-13 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT OVER_APPROXIMATION
FORMULA QuasiCertifProtocol-PT-32-ReachabilityCardinality-12 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT OVER_APPROXIMATION
FORMULA QuasiCertifProtocol-PT-32-ReachabilityCardinality-11 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT OVER_APPROXIMATION
FORMULA QuasiCertifProtocol-PT-32-ReachabilityCardinality-10 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT OVER_APPROXIMATION
FORMULA QuasiCertifProtocol-PT-32-ReachabilityCardinality-09 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT OVER_APPROXIMATION
[2023-03-24 21:04:27] [INFO ] Export to MCC of 6 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 10 ms.
[2023-03-24 21:04:27] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 3806 places, 506 transitions and 8173 arcs took 11 ms.
[2023-03-24 21:04:27] [INFO ] Flatten gal took : 254 ms
Total runtime 168011 ms.
There are residual formulas that ITS could not solve within timeout
timeout --kill-after=10s --signal=SIGINT 1m for testing only

Marcie built on Linux at 2019-11-18.
A model checker for Generalized Stochastic Petri nets

authors: Alex Tovchigrechko (IDD package and CTL model checking)

Martin Schwarick (Symbolic numerical analysis and CSL model checking)

Christian Rohr (Simulative and approximative numerical model checking)

marcie@informatik.tu-cottbus.de

called as: /home/mcc/BenchKit/bin//../reducer/bin//../../marcie/bin/marcie --net-file=model.pnml --mcc-file=ReachabilityCardinality.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: QuasiCertifProtocol_PT_32
(NrP: 3806 NrTr: 506 NrArc: 8173)

parse formulas
formulas created successfully
place and transition orderings generation:0m 0.838sec

net check time: 0m 0.001sec

init dd package: 0m 2.833sec


before gc: list nodes free: 837365

after gc: idd nodes used:40514878, unused:23485122; list nodes free:105046533

RS generation: 6m12.184sec


-> last computed set: #nodes 40511106 (4.1e+07) #states 4,194,305 (6)


CANNOT_COMPUTE


BK_STOP 1679692273678

--------------------
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.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -timeout 360 -rebuildPNML
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok


initing FirstDep: 0m 0.002sec

idd.cc:820: DD Exception: No free nodes

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="QuasiCertifProtocol-PT-32"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="marciexred"
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-5348"
echo " Executing tool marciexred"
echo " Input is QuasiCertifProtocol-PT-32, 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 r298-tall-167873952400910"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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