Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 568K
-rw-r--r-- 1 mcc users 14K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 132K May 10 09:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.5K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 85K May 10 09:42 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Mar 28 15:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Mar 28 15:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 15:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 28 15:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Mar 23 03:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K Mar 23 03:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Mar 22 12:15 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 22 12:15 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 09:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 22 09:10 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 3 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 192K May 5 16:51 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityCardinality-00
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityCardinality-01
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityCardinality-02
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityCardinality-03
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityCardinality-04
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityCardinality-05
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityCardinality-06
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityCardinality-07
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityCardinality-08
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityCardinality-09
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityCardinality-10
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityCardinality-11
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityCardinality-12
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityCardinality-13
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityCardinality-14
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1620940406047

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-13 21:13:28] [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, -timeout, 3600, -rebuildPNML]
[2021-05-13 21:13:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-13 21:13:28] [INFO ] Load time of PNML (sax parser for PT used): 86 ms
[2021-05-13 21:13:28] [INFO ] Transformed 782 places.
[2021-05-13 21:13:28] [INFO ] Transformed 697 transitions.
[2021-05-13 21:13:28] [INFO ] Found NUPN structural information;
[2021-05-13 21:13:28] [INFO ] Parsed PT model containing 782 places and 697 transitions in 131 ms.
Deduced a syphon composed of 63 places in 17 ms
Reduce places removed 63 places and 59 transitions.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 39 ms.
Working with output stream class java.io.PrintStream
FORMULA BusinessProcesses-PT-20-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-20-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-20-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-20-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-20-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-20-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-20-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-20-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-20-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-20-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 51 resets, run finished after 55 ms. (steps per millisecond=181 ) properties seen :[0, 1, 0, 1, 1, 1]
FORMULA BusinessProcesses-PT-20-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-20-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-20-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-20-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 10 resets, run finished after 19 ms. (steps per millisecond=526 ) properties seen :[0, 0]
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 19 ms. (steps per millisecond=526 ) properties seen :[0, 0]
// Phase 1: matrix 638 rows 719 cols
[2021-05-13 21:13:28] [INFO ] Computed 121 place invariants in 30 ms
[2021-05-13 21:13:28] [INFO ] [Real]Absence check using 78 positive place invariants in 61 ms returned sat
[2021-05-13 21:13:28] [INFO ] [Real]Absence check using 78 positive and 43 generalized place invariants in 24 ms returned sat
[2021-05-13 21:13:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 21:13:29] [INFO ] [Real]Absence check using state equation in 986 ms returned sat
[2021-05-13 21:13:29] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 21:13:29] [INFO ] [Nat]Absence check using 78 positive place invariants in 151 ms returned sat
[2021-05-13 21:13:29] [INFO ] [Nat]Absence check using 78 positive and 43 generalized place invariants in 22 ms returned sat
[2021-05-13 21:13:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 21:13:30] [INFO ] [Nat]Absence check using state equation in 907 ms returned sat
[2021-05-13 21:13:31] [INFO ] Deduced a trap composed of 127 places in 342 ms
[2021-05-13 21:13:31] [INFO ] Deduced a trap composed of 15 places in 262 ms
[2021-05-13 21:13:31] [INFO ] Deduced a trap composed of 125 places in 314 ms
[2021-05-13 21:13:32] [INFO ] Deduced a trap composed of 26 places in 283 ms
[2021-05-13 21:13:32] [INFO ] Deduced a trap composed of 18 places in 355 ms
[2021-05-13 21:13:32] [INFO ] Deduced a trap composed of 27 places in 322 ms
[2021-05-13 21:13:33] [INFO ] Deduced a trap composed of 29 places in 271 ms
[2021-05-13 21:13:33] [INFO ] Deduced a trap composed of 130 places in 280 ms
[2021-05-13 21:13:33] [INFO ] Deduced a trap composed of 31 places in 221 ms
[2021-05-13 21:13:34] [INFO ] Deduced a trap composed of 142 places in 236 ms
[2021-05-13 21:13:34] [INFO ] Deduced a trap composed of 17 places in 220 ms
[2021-05-13 21:13:34] [INFO ] Deduced a trap composed of 36 places in 226 ms
[2021-05-13 21:13:34] [INFO ] Deduced a trap composed of 29 places in 246 ms
[2021-05-13 21:13:34] [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 s259 s260 s263 s264 s282 s283 s290 s293 s395 s396 s397 s493 s498 s503 s508 s513 s518 s523 s655 s656 s659 s660 s670 s671 s674 s675) 0)") while checking expression at index 0
[2021-05-13 21:13:35] [INFO ] [Real]Absence check using 78 positive place invariants in 75 ms returned sat
[2021-05-13 21:13:35] [INFO ] [Real]Absence check using 78 positive and 43 generalized place invariants in 36 ms returned sat
[2021-05-13 21:13:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 21:13:36] [INFO ] [Real]Absence check using state equation in 1091 ms returned sat
[2021-05-13 21:13:36] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 21:13:36] [INFO ] [Nat]Absence check using 78 positive place invariants in 139 ms returned sat
[2021-05-13 21:13:36] [INFO ] [Nat]Absence check using 78 positive and 43 generalized place invariants in 26 ms returned sat
[2021-05-13 21:13:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 21:13:37] [INFO ] [Nat]Absence check using state equation in 889 ms returned sat
[2021-05-13 21:13:37] [INFO ] Deduced a trap composed of 8 places in 311 ms
[2021-05-13 21:13:37] [INFO ] Deduced a trap composed of 11 places in 294 ms
[2021-05-13 21:13:38] [INFO ] Deduced a trap composed of 18 places in 333 ms
[2021-05-13 21:13:38] [INFO ] Deduced a trap composed of 20 places in 333 ms
[2021-05-13 21:13:38] [INFO ] Deduced a trap composed of 163 places in 311 ms
[2021-05-13 21:13:39] [INFO ] Deduced a trap composed of 49 places in 217 ms
[2021-05-13 21:13:39] [INFO ] Deduced a trap composed of 17 places in 237 ms
[2021-05-13 21:13:39] [INFO ] Deduced a trap composed of 25 places in 231 ms
[2021-05-13 21:13:40] [INFO ] Deduced a trap composed of 19 places in 246 ms
[2021-05-13 21:13:40] [INFO ] Deduced a trap composed of 11 places in 216 ms
[2021-05-13 21:13:40] [INFO ] Deduced a trap composed of 132 places in 303 ms
[2021-05-13 21:13:40] [INFO ] Deduced a trap composed of 22 places in 204 ms
[2021-05-13 21:13:41] [INFO ] Deduced a trap composed of 38 places in 282 ms
[2021-05-13 21:13:41] [INFO ] Deduced a trap composed of 144 places in 203 ms
[2021-05-13 21:13:41] [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 s54 s55 s56 s57 s64 s65 s66 s67 s122 s123 s133 s134 s135 s165 s166 s167 s171 s172 s173 s176 s177 s181 s187 s188 s189 s220 s221 s243 s244 s245 s263 s264 s290 s293 s335 s336 s337 s351 s355 s357 s366 s370 s371 s372 s376 s385 s386 s387 s395 s397 s427 s429 s433 s448 s453 s472 s474 s483 s498 s513 s523 s527 s528 s529 s530 s531 s532 s533 s538 s539 s540 s541 s542 s543 s546 s547 s550 s551 s571 s572 s573 s574 s577 s578 s579 s580 s581 s582 s593 s594 s595 s596 s601 s602 s612 s613 s614 s615 s616 s617 s618 s623 s624 s625 s626 s627 s628 s629 s630 s631 s632 s637 s638 s639 s640 s643 s644 s653 s654 s655 s656 s659 s660 s661 s662 s663 s664 s665 s670 s671 s672 s673 s674 s675 s676 s677 s680 s681 s682 s683 s684) 0)") while checking expression at index 1
Support contains 12 out of 719 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 719/719 places, 638/638 transitions.
Graph (trivial) has 401 edges and 719 vertex of which 7 / 719 are part of one of the 1 SCC in 4 ms
Free SCC test removed 6 places
Discarding 25 places :
Also discarding 11 output transitions
Drop transitions removed 11 transitions
Graph (complete) has 1410 edges and 713 vertex of which 688 are kept as prefixes of interest. Removing 25 places using SCC suffix rule.7 ms
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Performed 164 Post agglomeration using F-continuation condition.Transition count delta: 164
Iterating post reduction 0 with 172 rules applied. Total rules applied 174 place count 688 transition count 455
Reduce places removed 164 places and 0 transitions.
Iterating post reduction 1 with 164 rules applied. Total rules applied 338 place count 524 transition count 455
Performed 99 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 99 Pre rules applied. Total rules applied 338 place count 524 transition count 356
Deduced a syphon composed of 99 places in 1 ms
Ensure Unique test removed 21 places
Reduce places removed 120 places and 0 transitions.
Iterating global reduction 2 with 219 rules applied. Total rules applied 557 place count 404 transition count 356
Symmetric choice reduction at 2 with 84 rule applications. Total rules 641 place count 404 transition count 356
Deduced a syphon composed of 84 places in 1 ms
Reduce places removed 84 places and 84 transitions.
Iterating global reduction 2 with 168 rules applied. Total rules applied 809 place count 320 transition count 272
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 809 place count 320 transition count 264
Deduced a syphon composed of 8 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 827 place count 310 transition count 264
Performed 106 Post agglomeration using F-continuation condition.Transition count delta: 106
Deduced a syphon composed of 106 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 108 places and 0 transitions.
Iterating global reduction 2 with 214 rules applied. Total rules applied 1041 place count 202 transition count 158
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 1045 place count 200 transition count 165
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1047 place count 200 transition count 163
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 1049 place count 198 transition count 163
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 1050 place count 198 transition count 163
Applied a total of 1050 rules in 129 ms. Remains 198 /719 variables (removed 521) and now considering 163/638 (removed 475) transitions.
Finished structural reductions, in 1 iterations. Remains : 198/719 places, 163/638 transitions.
Incomplete random walk after 1000000 steps, including 30539 resets, run finished after 2391 ms. (steps per millisecond=418 ) properties seen :[0, 1]
FORMULA BusinessProcesses-PT-20-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 7636 resets, run finished after 1450 ms. (steps per millisecond=689 ) properties seen :[0]
[2021-05-13 21:13:45] [INFO ] Flow matrix only has 162 transitions (discarded 1 similar events)
// Phase 1: matrix 162 rows 198 cols
[2021-05-13 21:13:45] [INFO ] Computed 82 place invariants in 3 ms
[2021-05-13 21:13:45] [INFO ] [Real]Absence check using 64 positive place invariants in 33 ms returned sat
[2021-05-13 21:13:45] [INFO ] [Real]Absence check using 64 positive and 18 generalized place invariants in 9 ms returned sat
[2021-05-13 21:13:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 21:13:45] [INFO ] [Real]Absence check using state equation in 154 ms returned sat
[2021-05-13 21:13:45] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 21:13:45] [INFO ] [Nat]Absence check using 64 positive place invariants in 16 ms returned sat
[2021-05-13 21:13:45] [INFO ] [Nat]Absence check using 64 positive and 18 generalized place invariants in 6 ms returned sat
[2021-05-13 21:13:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 21:13:45] [INFO ] [Nat]Absence check using state equation in 103 ms returned sat
[2021-05-13 21:13:45] [INFO ] State equation strengthened by 15 read => feed constraints.
[2021-05-13 21:13:45] [INFO ] [Nat]Added 15 Read/Feed constraints in 31 ms returned sat
[2021-05-13 21:13:45] [INFO ] Deduced a trap composed of 6 places in 92 ms
[2021-05-13 21:13:45] [INFO ] Deduced a trap composed of 6 places in 54 ms
[2021-05-13 21:13:46] [INFO ] Deduced a trap composed of 15 places in 63 ms
[2021-05-13 21:13:46] [INFO ] Deduced a trap composed of 30 places in 47 ms
[2021-05-13 21:13:46] [INFO ] Deduced a trap composed of 31 places in 77 ms
[2021-05-13 21:13:46] [INFO ] Deduced a trap composed of 14 places in 49 ms
[2021-05-13 21:13:46] [INFO ] Deduced a trap composed of 33 places in 90 ms
[2021-05-13 21:13:46] [INFO ] Deduced a trap composed of 33 places in 68 ms
[2021-05-13 21:13:46] [INFO ] Deduced a trap composed of 32 places in 78 ms
[2021-05-13 21:13:46] [INFO ] Deduced a trap composed of 33 places in 93 ms
[2021-05-13 21:13:46] [INFO ] Deduced a trap composed of 33 places in 68 ms
[2021-05-13 21:13:46] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 11 trap constraints in 884 ms
FORMULA BusinessProcesses-PT-20-ReachabilityCardinality-00 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
All properties solved without resorting to model-checking.

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

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-20"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="gold2020"
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 gold2020"
echo " Input is BusinessProcesses-PT-20, 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 r037-tajo-162038177100239"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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