fond
Model Checking Contest 2020
10th edition, Paris, France, June 23, 2020
Execution of r111-csrt-158961257700454
Last Updated
Jun 28, 2020

About the Execution of ITS-Tools for NoC3x3-PT-8B

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15745.140 49789.00 71631.00 137.50 TTFTFTFTTFFTFTFF normal

Execution Chart

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

Trace from the execution

Formatting '/local/x2003239/mcc2020-input.r111-csrt-158961257700454.qcow2', fmt=qcow2 size=4294967296 backing_file=/local/x2003239/mcc2020-input.qcow2 encryption=off 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 NoC3x3-PT-8B, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r111-csrt-158961257700454
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.2M
-rw-r--r-- 1 mcc users 4.1K Apr 8 15:11 CTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 8 15:11 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Apr 7 18:42 CTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 7 18:42 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.7K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.1K Apr 14 12:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Apr 14 12:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Apr 6 20:23 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K Apr 6 20:23 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Apr 6 04:04 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 6 04:04 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 6 20:25 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 6 20:25 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 3.0M Mar 24 05:37 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 NoC3x3-PT-8B-ReachabilityCardinality-00
FORMULA_NAME NoC3x3-PT-8B-ReachabilityCardinality-01
FORMULA_NAME NoC3x3-PT-8B-ReachabilityCardinality-02
FORMULA_NAME NoC3x3-PT-8B-ReachabilityCardinality-03
FORMULA_NAME NoC3x3-PT-8B-ReachabilityCardinality-04
FORMULA_NAME NoC3x3-PT-8B-ReachabilityCardinality-05
FORMULA_NAME NoC3x3-PT-8B-ReachabilityCardinality-06
FORMULA_NAME NoC3x3-PT-8B-ReachabilityCardinality-07
FORMULA_NAME NoC3x3-PT-8B-ReachabilityCardinality-08
FORMULA_NAME NoC3x3-PT-8B-ReachabilityCardinality-09
FORMULA_NAME NoC3x3-PT-8B-ReachabilityCardinality-10
FORMULA_NAME NoC3x3-PT-8B-ReachabilityCardinality-11
FORMULA_NAME NoC3x3-PT-8B-ReachabilityCardinality-12
FORMULA_NAME NoC3x3-PT-8B-ReachabilityCardinality-13
FORMULA_NAME NoC3x3-PT-8B-ReachabilityCardinality-14
FORMULA_NAME NoC3x3-PT-8B-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1589974262834

[2020-05-20 11:31:04] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -its, -ltsminpath, /home/mcc/BenchKit//lts_install_dir/, -greatspnpath, /home/mcc/BenchKit//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2020-05-20 11:31:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-20 11:31:05] [INFO ] Load time of PNML (sax parser for PT used): 525 ms
[2020-05-20 11:31:05] [INFO ] Transformed 9140 places.
[2020-05-20 11:31:05] [INFO ] Transformed 14577 transitions.
[2020-05-20 11:31:05] [INFO ] Found NUPN structural information;
[2020-05-20 11:31:05] [INFO ] Parsed PT model containing 9140 places and 14577 transitions in 678 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 258 ms.
Working with output stream class java.io.PrintStream
FORMULA NoC3x3-PT-8B-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-8B-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-8B-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-8B-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-8B-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-8B-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 4 resets, run finished after 162 ms. (steps per millisecond=61 ) properties seen :[0, 0, 0, 0, 1, 0, 0, 1, 0, 0]
FORMULA NoC3x3-PT-8B-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-8B-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 28 ms. (steps per millisecond=357 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 0 resets, run finished after 26 ms. (steps per millisecond=384 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 28 ms. (steps per millisecond=357 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 26 ms. (steps per millisecond=384 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 26 ms. (steps per millisecond=384 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 33 ms. (steps per millisecond=303 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 32 ms. (steps per millisecond=312 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 27 ms. (steps per millisecond=370 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 14577 rows 9140 cols
[2020-05-20 11:31:06] [INFO ] Computed 99 place invariants in 496 ms
[2020-05-20 11:31:09] [INFO ] [Real]Absence check using 99 positive place invariants in 1382 ms returned sat
[2020-05-20 11:31:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-20 11:31:11] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-20 11:31:11] [INFO ] [Real]Absence check using state equation in 2400 ms returned (error "Failed to check-sat")
[2020-05-20 11:31:14] [INFO ] [Real]Absence check using 99 positive place invariants in 1273 ms returned sat
[2020-05-20 11:31:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-20 11:31:16] [INFO ] [Real]Absence check using state equation in 2437 ms returned (error "Solver has unexpectedly terminated")
[2020-05-20 11:31:19] [INFO ] [Real]Absence check using 99 positive place invariants in 1218 ms returned sat
[2020-05-20 11:31:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-20 11:31:21] [INFO ] [Real]Absence check using state equation in 2707 ms returned (error "Solver has unexpectedly terminated")
[2020-05-20 11:31:24] [INFO ] [Real]Absence check using 99 positive place invariants in 1266 ms returned sat
[2020-05-20 11:31:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-20 11:31:26] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-20 11:31:26] [INFO ] [Real]Absence check using state equation in 2784 ms returned (error "Failed to check-sat")
[2020-05-20 11:31:30] [INFO ] [Real]Absence check using 99 positive place invariants in 1427 ms returned sat
[2020-05-20 11:31:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-20 11:31:31] [INFO ] [Real]Absence check using state equation in 1819 ms returned (error "Solver has unexpectedly terminated")
[2020-05-20 11:31:34] [INFO ] [Real]Absence check using 99 positive place invariants in 1245 ms returned sat
[2020-05-20 11:31:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-20 11:31:37] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-20 11:31:37] [INFO ] [Real]Absence check using state equation in 2541 ms returned (error "Failed to check-sat")
[2020-05-20 11:31:39] [INFO ] [Real]Absence check using 99 positive place invariants in 1224 ms returned sat
[2020-05-20 11:31:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-20 11:31:42] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-20 11:31:42] [INFO ] [Real]Absence check using state equation in 2746 ms returned (error "Failed to check-sat")
[2020-05-20 11:31:44] [INFO ] [Real]Absence check using 99 positive place invariants in 1212 ms returned sat
[2020-05-20 11:31:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-20 11:31:47] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-20 11:31:47] [INFO ] [Real]Absence check using state equation in 2843 ms returned (error "Failed to check-sat")
Support contains 27 out of 9140 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 9140/9140 places, 14577/14577 transitions.
Graph (trivial) has 13673 edges and 9140 vertex of which 2377 / 9140 are part of one of the 33 SCC in 100 ms
Free SCC test removed 2344 places
Discarding 113 places :
Also discarding 80 output transitions
Drop transitions removed 80 transitions
Graph (complete) has 12331 edges and 6796 vertex of which 6683 are kept as prefixes of interest. Removing 113 places using SCC suffix rule.47 ms
Drop transitions removed 3723 transitions
Ensure Unique test removed 104 transitions
Reduce isomorphic transitions removed 3827 transitions.
Performed 4200 Post agglomeration using F-continuation condition.Transition count delta: 4200
Iterating post reduction 0 with 8027 rules applied. Total rules applied 8029 place count 6683 transition count 6470
Reduce places removed 4200 places and 0 transitions.
Ensure Unique test removed 2373 transitions
Reduce isomorphic transitions removed 2373 transitions.
Performed 1189 Post agglomeration using F-continuation condition.Transition count delta: 1189
Iterating post reduction 1 with 7762 rules applied. Total rules applied 15791 place count 2483 transition count 2908
Reduce places removed 1189 places and 0 transitions.
Ensure Unique test removed 1189 transitions
Reduce isomorphic transitions removed 1189 transitions.
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Iterating post reduction 2 with 2406 rules applied. Total rules applied 18197 place count 1294 transition count 1691
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 3 with 28 rules applied. Total rules applied 18225 place count 1266 transition count 1691
Performed 43 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 43 Pre rules applied. Total rules applied 18225 place count 1266 transition count 1648
Deduced a syphon composed of 43 places in 7 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 4 with 86 rules applied. Total rules applied 18311 place count 1223 transition count 1648
Symmetric choice reduction at 4 with 356 rule applications. Total rules 18667 place count 1223 transition count 1648
Deduced a syphon composed of 356 places in 14 ms
Reduce places removed 356 places and 356 transitions.
Iterating global reduction 4 with 712 rules applied. Total rules applied 19379 place count 867 transition count 1292
Ensure Unique test removed 55 transitions
Reduce isomorphic transitions removed 55 transitions.
Iterating post reduction 4 with 55 rules applied. Total rules applied 19434 place count 867 transition count 1237
Performed 59 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 59 Pre rules applied. Total rules applied 19434 place count 867 transition count 1178
Deduced a syphon composed of 59 places in 10 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 5 with 118 rules applied. Total rules applied 19552 place count 808 transition count 1178
Symmetric choice reduction at 5 with 52 rule applications. Total rules 19604 place count 808 transition count 1178
Deduced a syphon composed of 52 places in 9 ms
Reduce places removed 52 places and 74 transitions.
Iterating global reduction 5 with 104 rules applied. Total rules applied 19708 place count 756 transition count 1104
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 5 with 22 rules applied. Total rules applied 19730 place count 756 transition count 1082
Performed 242 Post agglomeration using F-continuation condition.Transition count delta: 242
Deduced a syphon composed of 242 places in 0 ms
Reduce places removed 242 places and 0 transitions.
Iterating global reduction 6 with 484 rules applied. Total rules applied 20214 place count 514 transition count 840
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 6 with 21 rules applied. Total rules applied 20235 place count 514 transition count 819
Symmetric choice reduction at 7 with 3 rule applications. Total rules 20238 place count 514 transition count 819
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 5 transitions.
Iterating global reduction 7 with 6 rules applied. Total rules applied 20244 place count 511 transition count 814
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 20248 place count 509 transition count 826
Free-agglomeration rule applied 201 times.
Iterating global reduction 7 with 201 rules applied. Total rules applied 20449 place count 509 transition count 625
Reduce places removed 201 places and 0 transitions.
Drop transitions removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Discarding 7 places :
Also discarding 0 output transitions
Graph (complete) has 944 edges and 308 vertex of which 301 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.2 ms
Iterating post reduction 7 with 250 rules applied. Total rules applied 20699 place count 301 transition count 577
Drop transitions removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 8 with 7 rules applied. Total rules applied 20706 place count 301 transition count 570
Partial Free-agglomeration rule applied 19 times.
Drop transitions removed 19 transitions
Iterating global reduction 9 with 19 rules applied. Total rules applied 20725 place count 301 transition count 570
Partial Post-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 9 with 4 rules applied. Total rules applied 20729 place count 301 transition count 570
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 9 with 4 rules applied. Total rules applied 20733 place count 301 transition count 566
Drop transitions removed 121 transitions
Redundant transition composition rules discarded 121 transitions
Iterating global reduction 10 with 121 rules applied. Total rules applied 20854 place count 301 transition count 445
Reduce places removed 2 places and 0 transitions.
Discarding 13 places :
Also discarding 0 output transitions
Graph (complete) has 823 edges and 299 vertex of which 286 are kept as prefixes of interest. Removing 13 places using SCC suffix rule.1 ms
Iterating post reduction 10 with 3 rules applied. Total rules applied 20857 place count 286 transition count 445
Drop transitions removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 11 with 13 rules applied. Total rules applied 20870 place count 286 transition count 432
Symmetric choice reduction at 12 with 7 rule applications. Total rules 20877 place count 286 transition count 432
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 9 transitions.
Iterating global reduction 12 with 14 rules applied. Total rules applied 20891 place count 279 transition count 423
Free-agglomeration rule applied 2 times.
Iterating global reduction 12 with 2 rules applied. Total rules applied 20893 place count 279 transition count 421
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 12 with 2 rules applied. Total rules applied 20895 place count 277 transition count 421
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 13 with 2 rules applied. Total rules applied 20897 place count 277 transition count 421
Applied a total of 20897 rules in 2757 ms. Remains 277 /9140 variables (removed 8863) and now considering 421/14577 (removed 14156) transitions.
Finished structural reductions, in 1 iterations. Remains : 277/9140 places, 421/14577 transitions.
Incomplete random walk after 1000000 steps, including 0 resets, run finished after 2514 ms. (steps per millisecond=397 ) properties seen :[1, 1, 1, 1, 1, 1, 1, 0]
FORMULA NoC3x3-PT-8B-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-8B-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-8B-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-8B-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-8B-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-8B-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-8B-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Finished Best-First random walk after 7314 steps, including 0 resets, run visited all 1 properties in 18 ms. (steps per millisecond=406 )
FORMULA NoC3x3-PT-8B-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
All properties solved without resorting to model-checking.

BK_STOP 1589974312623

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

+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution ReachabilityCardinality -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ /home/mcc/BenchKit//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination ReachabilityCardinality -z3path /home/mcc/BenchKit//z3/bin/z3 -yices2path /home/mcc/BenchKit//yices/bin/yices -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m -Dfile.encoding=UTF-8 -Dosgi.requiredJavaVersion=1.6

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="NoC3x3-PT-8B"
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"

# 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 NoC3x3-PT-8B, 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 r111-csrt-158961257700454"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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