fond
Model Checking Contest 2022
12th edition, Bergen, Norway, June 21, 2022
Execution of r222-tall-165286024800126
Last Updated
Jun 22, 2022

About the Execution of ITS-Tools for ShieldIIPs-PT-030B

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
331.044 29423.00 41102.00 76.40 TFFTFFTTFFFFFTTF normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r222-tall-165286024800126.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/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 itstools
Input is ShieldIIPs-PT-030B, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r222-tall-165286024800126
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 8.5K Apr 29 15:02 CTLCardinality.txt
-rw-r--r-- 1 mcc users 99K Apr 29 15:02 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Apr 29 15:01 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Apr 29 15:01 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 3.6K May 9 08:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 9 08:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 9 08:49 LTLFireability.txt
-rw-r--r-- 1 mcc users 14K May 9 08:49 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 29 15:03 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 151K Apr 29 15:03 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 29 15:03 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 92K Apr 29 15:03 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 08:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 08:49 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 5 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 503K 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 ShieldIIPs-PT-030B-ReachabilityCardinality-00
FORMULA_NAME ShieldIIPs-PT-030B-ReachabilityCardinality-01
FORMULA_NAME ShieldIIPs-PT-030B-ReachabilityCardinality-02
FORMULA_NAME ShieldIIPs-PT-030B-ReachabilityCardinality-03
FORMULA_NAME ShieldIIPs-PT-030B-ReachabilityCardinality-04
FORMULA_NAME ShieldIIPs-PT-030B-ReachabilityCardinality-05
FORMULA_NAME ShieldIIPs-PT-030B-ReachabilityCardinality-06
FORMULA_NAME ShieldIIPs-PT-030B-ReachabilityCardinality-07
FORMULA_NAME ShieldIIPs-PT-030B-ReachabilityCardinality-08
FORMULA_NAME ShieldIIPs-PT-030B-ReachabilityCardinality-09
FORMULA_NAME ShieldIIPs-PT-030B-ReachabilityCardinality-10
FORMULA_NAME ShieldIIPs-PT-030B-ReachabilityCardinality-11
FORMULA_NAME ShieldIIPs-PT-030B-ReachabilityCardinality-12
FORMULA_NAME ShieldIIPs-PT-030B-ReachabilityCardinality-13
FORMULA_NAME ShieldIIPs-PT-030B-ReachabilityCardinality-14
FORMULA_NAME ShieldIIPs-PT-030B-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1654265029742

Running Version 202205111006
[2022-06-03 14:03:50] [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-03 14:03:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-03 14:03:51] [INFO ] Load time of PNML (sax parser for PT used): 164 ms
[2022-06-03 14:03:51] [INFO ] Transformed 1803 places.
[2022-06-03 14:03:51] [INFO ] Transformed 1773 transitions.
[2022-06-03 14:03:51] [INFO ] Found NUPN structural information;
[2022-06-03 14:03:51] [INFO ] Parsed PT model containing 1803 places and 1773 transitions in 333 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 19 ms.
Working with output stream class java.io.PrintStream
FORMULA ShieldIIPs-PT-030B-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-030B-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-030B-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-030B-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 500 ms. (steps per millisecond=20 ) properties (out of 12) seen :8
FORMULA ShieldIIPs-PT-030B-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-030B-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-030B-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-030B-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-030B-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-030B-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-030B-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-030B-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 4) 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 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 1773 rows 1803 cols
[2022-06-03 14:03:52] [INFO ] Computed 271 place invariants in 36 ms
[2022-06-03 14:03:52] [INFO ] After 564ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2022-06-03 14:03:53] [INFO ] [Nat]Absence check using 271 positive place invariants in 90 ms returned sat
[2022-06-03 14:03:54] [INFO ] After 979ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :1
[2022-06-03 14:03:54] [INFO ] Deduced a trap composed of 26 places in 460 ms of which 7 ms to minimize.
[2022-06-03 14:03:55] [INFO ] Deduced a trap composed of 13 places in 474 ms of which 2 ms to minimize.
[2022-06-03 14:03:55] [INFO ] Deduced a trap composed of 23 places in 417 ms of which 1 ms to minimize.
[2022-06-03 14:03:56] [INFO ] Deduced a trap composed of 10 places in 404 ms of which 2 ms to minimize.
[2022-06-03 14:03:56] [INFO ] Deduced a trap composed of 25 places in 402 ms of which 1 ms to minimize.
[2022-06-03 14:03:57] [INFO ] Deduced a trap composed of 29 places in 405 ms of which 1 ms to minimize.
[2022-06-03 14:03:57] [INFO ] Deduced a trap composed of 43 places in 408 ms of which 2 ms to minimize.
[2022-06-03 14:03:58] [INFO ] Deduced a trap composed of 18 places in 409 ms of which 2 ms to minimize.
[2022-06-03 14:03:58] [INFO ] Deduced a trap composed of 22 places in 422 ms of which 1 ms to minimize.
[2022-06-03 14:03:59] [INFO ] Deduced a trap composed of 25 places in 398 ms of which 1 ms to minimize.
[2022-06-03 14:03:59] [INFO ] Deduced a trap composed of 28 places in 391 ms of which 1 ms to minimize.
[2022-06-03 14:04:00] [INFO ] Deduced a trap composed of 16 places in 400 ms of which 2 ms to minimize.
[2022-06-03 14:04:00] [INFO ] Deduced a trap composed of 26 places in 401 ms of which 1 ms to minimize.
[2022-06-03 14:04:00] [INFO ] Deduced a trap composed of 28 places in 368 ms of which 1 ms to minimize.
[2022-06-03 14:04:01] [INFO ] Deduced a trap composed of 37 places in 392 ms of which 1 ms to minimize.
[2022-06-03 14:04:01] [INFO ] Deduced a trap composed of 37 places in 377 ms of which 1 ms to minimize.
[2022-06-03 14:04:02] [INFO ] Deduced a trap composed of 30 places in 360 ms of which 1 ms to minimize.
[2022-06-03 14:04:02] [INFO ] Deduced a trap composed of 32 places in 382 ms of which 1 ms to minimize.
[2022-06-03 14:04:03] [INFO ] Deduced a trap composed of 35 places in 381 ms of which 1 ms to minimize.
[2022-06-03 14:04:03] [INFO ] Deduced a trap composed of 20 places in 382 ms of which 1 ms to minimize.
[2022-06-03 14:04:04] [INFO ] Deduced a trap composed of 36 places in 377 ms of which 1 ms to minimize.
[2022-06-03 14:04:04] [INFO ] Deduced a trap composed of 26 places in 387 ms of which 1 ms to minimize.
[2022-06-03 14:04:05] [INFO ] Deduced a trap composed of 27 places in 388 ms of which 1 ms to minimize.
[2022-06-03 14:04:05] [INFO ] Deduced a trap composed of 27 places in 385 ms of which 1 ms to minimize.
[2022-06-03 14:04:05] [INFO ] Deduced a trap composed of 30 places in 387 ms of which 1 ms to minimize.
[2022-06-03 14:04:06] [INFO ] Deduced a trap composed of 34 places in 369 ms of which 1 ms to minimize.
[2022-06-03 14:04:06] [INFO ] Deduced a trap composed of 45 places in 365 ms of which 1 ms to minimize.
[2022-06-03 14:04:07] [INFO ] Deduced a trap composed of 41 places in 358 ms of which 1 ms to minimize.
[2022-06-03 14:04:07] [INFO ] Deduced a trap composed of 32 places in 362 ms of which 1 ms to minimize.
[2022-06-03 14:04:08] [INFO ] Deduced a trap composed of 49 places in 357 ms of which 1 ms to minimize.
[2022-06-03 14:04:08] [INFO ] Deduced a trap composed of 47 places in 359 ms of which 1 ms to minimize.
[2022-06-03 14:04:08] [INFO ] Deduced a trap composed of 38 places in 338 ms of which 1 ms to minimize.
[2022-06-03 14:04:09] [INFO ] Deduced a trap composed of 19 places in 353 ms of which 1 ms to minimize.
[2022-06-03 14:04:09] [INFO ] Deduced a trap composed of 32 places in 329 ms of which 3 ms to minimize.
[2022-06-03 14:04:10] [INFO ] Deduced a trap composed of 28 places in 335 ms of which 1 ms to minimize.
[2022-06-03 14:04:10] [INFO ] Deduced a trap composed of 41 places in 349 ms of which 1 ms to minimize.
[2022-06-03 14:04:11] [INFO ] Deduced a trap composed of 35 places in 316 ms of which 1 ms to minimize.
[2022-06-03 14:04:11] [INFO ] Deduced a trap composed of 48 places in 340 ms of which 1 ms to minimize.
[2022-06-03 14:04:11] [INFO ] Deduced a trap composed of 48 places in 328 ms of which 1 ms to minimize.
[2022-06-03 14:04:12] [INFO ] Deduced a trap composed of 47 places in 325 ms of which 2 ms to minimize.
[2022-06-03 14:04:13] [INFO ] Deduced a trap composed of 30 places in 442 ms of which 1 ms to minimize.
[2022-06-03 14:04:13] [INFO ] Deduced a trap composed of 21 places in 420 ms of which 1 ms to minimize.
[2022-06-03 14:04:14] [INFO ] Deduced a trap composed of 17 places in 402 ms of which 1 ms to minimize.
[2022-06-03 14:04:14] [INFO ] Deduced a trap composed of 28 places in 412 ms of which 1 ms to minimize.
[2022-06-03 14:04:15] [INFO ] Deduced a trap composed of 13 places in 411 ms of which 1 ms to minimize.
[2022-06-03 14:04:15] [INFO ] Deduced a trap composed of 20 places in 433 ms of which 1 ms to minimize.
[2022-06-03 14:04:16] [INFO ] Deduced a trap composed of 17 places in 432 ms of which 1 ms to minimize.
[2022-06-03 14:04:16] [INFO ] Deduced a trap composed of 35 places in 430 ms of which 1 ms to minimize.
[2022-06-03 14:04:17] [INFO ] Deduced a trap composed of 25 places in 426 ms of which 1 ms to minimize.
[2022-06-03 14:04:17] [INFO ] Deduced a trap composed of 22 places in 467 ms of which 1 ms to minimize.
[2022-06-03 14:04:17] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-06-03 14:04:17] [INFO ] After 25219ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:4
FORMULA ShieldIIPs-PT-030B-ReachabilityCardinality-06 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ShieldIIPs-PT-030B-ReachabilityCardinality-03 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ShieldIIPs-PT-030B-ReachabilityCardinality-00 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 521 ms.
Support contains 17 out of 1803 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1803/1803 places, 1773/1773 transitions.
Drop transitions removed 148 transitions
Trivial Post-agglo rules discarded 148 transitions
Performed 148 trivial Post agglomeration. Transition count delta: 148
Iterating post reduction 0 with 148 rules applied. Total rules applied 148 place count 1803 transition count 1625
Reduce places removed 148 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 149 rules applied. Total rules applied 297 place count 1655 transition count 1624
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 298 place count 1654 transition count 1624
Performed 150 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 150 Pre rules applied. Total rules applied 298 place count 1654 transition count 1474
Deduced a syphon composed of 150 places in 3 ms
Reduce places removed 150 places and 0 transitions.
Iterating global reduction 3 with 300 rules applied. Total rules applied 598 place count 1504 transition count 1474
Discarding 208 places :
Symmetric choice reduction at 3 with 208 rule applications. Total rules 806 place count 1296 transition count 1266
Iterating global reduction 3 with 208 rules applied. Total rules applied 1014 place count 1296 transition count 1266
Performed 87 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 87 Pre rules applied. Total rules applied 1014 place count 1296 transition count 1179
Deduced a syphon composed of 87 places in 6 ms
Reduce places removed 87 places and 0 transitions.
Iterating global reduction 3 with 174 rules applied. Total rules applied 1188 place count 1209 transition count 1179
Performed 442 Post agglomeration using F-continuation condition.Transition count delta: 442
Deduced a syphon composed of 442 places in 3 ms
Reduce places removed 442 places and 0 transitions.
Iterating global reduction 3 with 884 rules applied. Total rules applied 2072 place count 767 transition count 737
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 202 times.
Drop transitions removed 202 transitions
Iterating global reduction 3 with 202 rules applied. Total rules applied 2274 place count 767 transition count 737
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 2275 place count 766 transition count 736
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2276 place count 765 transition count 736
Applied a total of 2276 rules in 542 ms. Remains 765 /1803 variables (removed 1038) and now considering 736/1773 (removed 1037) transitions.
Finished structural reductions, in 1 iterations. Remains : 765/1803 places, 736/1773 transitions.
Finished random walk after 10621 steps, including 3 resets, run visited all 1 properties in 95 ms. (steps per millisecond=111 )
FORMULA ShieldIIPs-PT-030B-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 28197 ms.

BK_STOP 1654265059165

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

+ export LANG=C
+ LANG=C
+ 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
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -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=@none -Xss128m -Xms40m -Xmx8192m

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="ShieldIIPs-PT-030B"
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 ShieldIIPs-PT-030B, 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 r222-tall-165286024800126"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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