Execution Chart

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

Trace from the execution

Formatting '/data/fko/mcc2020-input.r021-oct2-158897699200574.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2020-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 BusinessProcesses-PT-16, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r021-oct2-158897699200574
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 344K
-rw-r--r-- 1 mcc users 4.0K Mar 26 02:52 CTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Mar 26 02:52 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 25 22:45 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 25 22:45 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Apr 8 14:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 8 14:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Mar 25 17:48 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Mar 25 17:48 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Mar 25 14:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 25 14:38 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 25 17:55 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 25 17:55 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 159K 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 BusinessProcesses-PT-16-ReachabilityCardinality-00
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityCardinality-01
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityCardinality-02
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityCardinality-03
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityCardinality-04
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityCardinality-05
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityCardinality-06
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityCardinality-07
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityCardinality-08
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityCardinality-09
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityCardinality-10
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityCardinality-11
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityCardinality-12
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityCardinality-13
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityCardinality-14
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1589256248324

[2020-05-12 04:04:10] [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-12 04:04:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-12 04:04:10] [INFO ] Load time of PNML (sax parser for PT used): 69 ms
[2020-05-12 04:04:10] [INFO ] Transformed 638 places.
[2020-05-12 04:04:10] [INFO ] Transformed 578 transitions.
[2020-05-12 04:04:10] [INFO ] Found NUPN structural information;
[2020-05-12 04:04:10] [INFO ] Parsed PT model containing 638 places and 578 transitions in 121 ms.
Deduced a syphon composed of 8 places in 6 ms
Reduce places removed 8 places and 8 transitions.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 36 ms.
Working with output stream class java.io.PrintStream
FORMULA BusinessProcesses-PT-16-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-16-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-16-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-16-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-16-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-16-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 67 resets, run finished after 45 ms. (steps per millisecond=222 ) properties seen :[1, 0, 0, 1, 1, 1, 0, 1, 1, 1]
FORMULA BusinessProcesses-PT-16-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-16-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-16-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-16-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-16-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-16-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-16-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 12 ms. (steps per millisecond=833 ) properties seen :[0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 15 ms. (steps per millisecond=666 ) properties seen :[0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 18 ms. (steps per millisecond=555 ) properties seen :[0, 0, 0]
// Phase 1: matrix 570 rows 630 cols
[2020-05-12 04:04:10] [INFO ] Computed 100 place invariants in 21 ms
[2020-05-12 04:04:11] [INFO ] [Real]Absence check using 62 positive place invariants in 52 ms returned sat
[2020-05-12 04:04:11] [INFO ] [Real]Absence check using 62 positive and 38 generalized place invariants in 21 ms returned sat
[2020-05-12 04:04:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 04:04:12] [INFO ] [Real]Absence check using state equation in 838 ms returned sat
[2020-05-12 04:04:17] [INFO ] Deduced a trap composed of 13 places in 4869 ms
[2020-05-12 04:04:17] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s0 s1 s2 s3 s4 s5 s6 s7 s8 s223 s342 s343 s344) 0)") while checking expression at index 0
[2020-05-12 04:04:17] [INFO ] [Real]Absence check using 62 positive place invariants in 38 ms returned sat
[2020-05-12 04:04:17] [INFO ] [Real]Absence check using 62 positive and 38 generalized place invariants in 22 ms returned sat
[2020-05-12 04:04:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 04:04:18] [INFO ] [Real]Absence check using state equation in 773 ms returned sat
[2020-05-12 04:04:18] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 04:04:18] [INFO ] [Nat]Absence check using 62 positive place invariants in 179 ms returned sat
[2020-05-12 04:04:18] [INFO ] [Nat]Absence check using 62 positive and 38 generalized place invariants in 50 ms returned sat
[2020-05-12 04:04:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 04:04:19] [INFO ] [Nat]Absence check using state equation in 1533 ms returned sat
[2020-05-12 04:04:20] [INFO ] Deduced a trap composed of 27 places in 199 ms
[2020-05-12 04:04:20] [INFO ] Deduced a trap composed of 14 places in 213 ms
[2020-05-12 04:04:20] [INFO ] Deduced a trap composed of 8 places in 223 ms
[2020-05-12 04:04:21] [INFO ] Deduced a trap composed of 17 places in 329 ms
[2020-05-12 04:04:21] [INFO ] Deduced a trap composed of 11 places in 292 ms
[2020-05-12 04:04:21] [INFO ] Deduced a trap composed of 116 places in 351 ms
[2020-05-12 04:04:22] [INFO ] Deduced a trap composed of 44 places in 349 ms
[2020-05-12 04:04:22] [INFO ] Deduced a trap composed of 39 places in 205 ms
[2020-05-12 04:04:22] [INFO ] Deduced a trap composed of 64 places in 202 ms
[2020-05-12 04:04:23] [INFO ] Deduced a trap composed of 18 places in 219 ms
[2020-05-12 04:04:23] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-12 04:04:23] [INFO ] Deduced a trap composed of 6 places in 299 ms
[2020-05-12 04:04:23] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s0 s1 s2 s3 s4 s242) 0)") while checking expression at index 1
[2020-05-12 04:04:23] [INFO ] [Real]Absence check using 62 positive place invariants in 54 ms returned sat
[2020-05-12 04:04:23] [INFO ] [Real]Absence check using 62 positive and 38 generalized place invariants in 22 ms returned sat
[2020-05-12 04:04:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 04:04:24] [INFO ] [Real]Absence check using state equation in 774 ms returned sat
[2020-05-12 04:04:24] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 04:04:24] [INFO ] [Nat]Absence check using 62 positive place invariants in 62 ms returned sat
[2020-05-12 04:04:24] [INFO ] [Nat]Absence check using 62 positive and 38 generalized place invariants in 22 ms returned sat
[2020-05-12 04:04:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 04:04:25] [INFO ] [Nat]Absence check using state equation in 757 ms returned sat
[2020-05-12 04:04:25] [INFO ] Deduced a trap composed of 13 places in 202 ms
[2020-05-12 04:04:25] [INFO ] Deduced a trap composed of 14 places in 393 ms
[2020-05-12 04:04:26] [INFO ] Deduced a trap composed of 26 places in 387 ms
[2020-05-12 04:04:26] [INFO ] Deduced a trap composed of 110 places in 378 ms
[2020-05-12 04:04:27] [INFO ] Deduced a trap composed of 25 places in 391 ms
[2020-05-12 04:04:27] [INFO ] Deduced a trap composed of 19 places in 335 ms
[2020-05-12 04:04:27] [INFO ] Deduced a trap composed of 129 places in 162 ms
[2020-05-12 04:04:27] [INFO ] Deduced a trap composed of 112 places in 165 ms
[2020-05-12 04:04:28] [INFO ] Deduced a trap composed of 123 places in 154 ms
[2020-05-12 04:04:28] [INFO ] Deduced a trap composed of 127 places in 161 ms
[2020-05-12 04:04:28] [INFO ] Deduced a trap composed of 103 places in 155 ms
[2020-05-12 04:04:28] [INFO ] Deduced a trap composed of 116 places in 165 ms
[2020-05-12 04:04:28] [INFO ] Deduced a trap composed of 132 places in 161 ms
[2020-05-12 04:04:29] [INFO ] Deduced a trap composed of 135 places in 161 ms
[2020-05-12 04:04:29] [INFO ] Deduced a trap composed of 124 places in 160 ms
[2020-05-12 04:04:29] [INFO ] Deduced a trap composed of 128 places in 165 ms
[2020-05-12 04:04:29] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s0 s29 s30 s35 s63 s64 s67 s142 s143 s144 s160 s161 s162 s171 s175 s187 s188 s196 s208 s248 s249 s289 s291 s317 s319 s322 s324 s327 s328 s329 s337 s338 s339 s342 s343 s344 s347 s348 s349 s352 s353 s354 s362 s363 s364 s368 s373 s382 s383 s384 s388 s393 s403 s418 s428 s442 s444 s446 s447 s448 s449 s450 s451 s452 s453 s456 s457 s458 s459 s464 s465 s466 s467 s468 s469 s470 s479 s480 s483 s484 s485 s488 s489 s507 s508 s511 s512 s515 s516 s517 s518 s519 s520 s521 s522 s525 s526 s529 s530 s532 s533 s536 s537 s544 s545 s550 s551 s558 s560 s561 s565 s566 s567 s568 s569 s570 s571 s574 s587 s588 s595 s596 s607 s608 s615 s616 s617 s627) 0)") while checking expression at index 2
Support contains 10 out of 630 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 630/630 places, 570/570 transitions.
Graph (trivial) has 359 edges and 630 vertex of which 4 / 630 are part of one of the 1 SCC in 46 ms
Free SCC test removed 3 places
Discarding 6 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Graph (complete) has 1287 edges and 627 vertex of which 621 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.7 ms
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Performed 147 Post agglomeration using F-continuation condition.Transition count delta: 147
Iterating post reduction 0 with 151 rules applied. Total rules applied 153 place count 621 transition count 418
Reduce places removed 147 places and 0 transitions.
Iterating post reduction 1 with 147 rules applied. Total rules applied 300 place count 474 transition count 418
Performed 86 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 86 Pre rules applied. Total rules applied 300 place count 474 transition count 332
Deduced a syphon composed of 86 places in 2 ms
Ensure Unique test removed 15 places
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 2 with 187 rules applied. Total rules applied 487 place count 373 transition count 332
Symmetric choice reduction at 2 with 86 rule applications. Total rules 573 place count 373 transition count 332
Deduced a syphon composed of 86 places in 1 ms
Reduce places removed 86 places and 86 transitions.
Iterating global reduction 2 with 172 rules applied. Total rules applied 745 place count 287 transition count 246
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 745 place count 287 transition count 237
Deduced a syphon composed of 9 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 765 place count 276 transition count 237
Performed 93 Post agglomeration using F-continuation condition.Transition count delta: 93
Deduced a syphon composed of 93 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 95 places and 0 transitions.
Iterating global reduction 2 with 188 rules applied. Total rules applied 953 place count 181 transition count 144
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 955 place count 180 transition count 148
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 957 place count 180 transition count 146
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 959 place count 178 transition count 146
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 3 with 5 rules applied. Total rules applied 964 place count 178 transition count 146
Applied a total of 964 rules in 250 ms. Remains 178 /630 variables (removed 452) and now considering 146/570 (removed 424) transitions.
Finished structural reductions, in 1 iterations. Remains : 178/630 places, 146/570 transitions.
Incomplete random walk after 1000000 steps, including 87693 resets, run finished after 2258 ms. (steps per millisecond=442 ) properties seen :[1, 0, 0]
FORMULA BusinessProcesses-PT-16-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 8983 resets, run finished after 1126 ms. (steps per millisecond=888 ) properties seen :[1, 0]
FORMULA BusinessProcesses-PT-16-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 1000001 steps, including 27709 resets, run finished after 900 ms. (steps per millisecond=1111 ) properties seen :[0]
// Phase 1: matrix 146 rows 178 cols
[2020-05-12 04:04:33] [INFO ] Computed 76 place invariants in 5 ms
[2020-05-12 04:04:34] [INFO ] [Real]Absence check using 57 positive place invariants in 46 ms returned sat
[2020-05-12 04:04:34] [INFO ] [Real]Absence check using 57 positive and 19 generalized place invariants in 6 ms returned sat
[2020-05-12 04:04:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 04:04:34] [INFO ] [Real]Absence check using state equation in 164 ms returned sat
[2020-05-12 04:04:34] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 04:04:34] [INFO ] [Nat]Absence check using 57 positive place invariants in 61 ms returned sat
[2020-05-12 04:04:34] [INFO ] [Nat]Absence check using 57 positive and 19 generalized place invariants in 4 ms returned sat
[2020-05-12 04:04:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 04:04:34] [INFO ] [Nat]Absence check using state equation in 90 ms returned sat
[2020-05-12 04:04:34] [INFO ] State equation strengthened by 12 read => feed constraints.
[2020-05-12 04:04:34] [INFO ] [Nat]Added 12 Read/Feed constraints in 41 ms returned sat
[2020-05-12 04:04:34] [INFO ] Deduced a trap composed of 39 places in 116 ms
[2020-05-12 04:04:34] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 125 ms
FORMULA BusinessProcesses-PT-16-ReachabilityCardinality-09 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
All properties solved without resorting to model-checking.

BK_STOP 1589256274890

--------------------
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="BusinessProcesses-PT-16"
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 BusinessProcesses-PT-16, 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 r021-oct2-158897699200574"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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