Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2020-input.r211-tajo-159033477800710.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2020-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 itslola
Input is ShieldPPPt-PT-040B, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r211-tajo-159033477800710
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 944K
-rw-r--r-- 1 mcc users 3.9K May 14 01:59 CTLCardinality.txt
-rw-r--r-- 1 mcc users 22K May 14 01:59 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 13 19:25 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 13 19:25 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K May 14 10:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K May 14 10:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 14 10:04 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 14 10:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 12 20:42 NewModel
-rw-r--r-- 1 mcc users 4.1K May 13 14:11 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 22K May 13 14:11 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 13 08:55 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K May 13 08:55 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 13 16:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 13 16:53 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 12 20:42 equiv_col
-rw-r--r-- 1 mcc users 5 May 12 20:42 instance
-rw-r--r-- 1 mcc users 6 May 12 20:42 iscolored
-rw-r--r-- 1 mcc users 762K May 12 20:42 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 ShieldPPPt-PT-040B-ReachabilityCardinality-00
FORMULA_NAME ShieldPPPt-PT-040B-ReachabilityCardinality-01
FORMULA_NAME ShieldPPPt-PT-040B-ReachabilityCardinality-02
FORMULA_NAME ShieldPPPt-PT-040B-ReachabilityCardinality-03
FORMULA_NAME ShieldPPPt-PT-040B-ReachabilityCardinality-04
FORMULA_NAME ShieldPPPt-PT-040B-ReachabilityCardinality-05
FORMULA_NAME ShieldPPPt-PT-040B-ReachabilityCardinality-06
FORMULA_NAME ShieldPPPt-PT-040B-ReachabilityCardinality-07
FORMULA_NAME ShieldPPPt-PT-040B-ReachabilityCardinality-08
FORMULA_NAME ShieldPPPt-PT-040B-ReachabilityCardinality-09
FORMULA_NAME ShieldPPPt-PT-040B-ReachabilityCardinality-10
FORMULA_NAME ShieldPPPt-PT-040B-ReachabilityCardinality-11
FORMULA_NAME ShieldPPPt-PT-040B-ReachabilityCardinality-12
FORMULA_NAME ShieldPPPt-PT-040B-ReachabilityCardinality-13
FORMULA_NAME ShieldPPPt-PT-040B-ReachabilityCardinality-14
FORMULA_NAME ShieldPPPt-PT-040B-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1591323064832

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-05 02:11:06] [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]
[2020-06-05 02:11:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-05 02:11:06] [INFO ] Load time of PNML (sax parser for PT used): 239 ms
[2020-06-05 02:11:06] [INFO ] Transformed 3123 places.
[2020-06-05 02:11:06] [INFO ] Transformed 2843 transitions.
[2020-06-05 02:11:06] [INFO ] Found NUPN structural information;
[2020-06-05 02:11:06] [INFO ] Parsed PT model containing 3123 places and 2843 transitions in 419 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 121 ms.
Working with output stream class java.io.PrintStream
FORMULA ShieldPPPt-PT-040B-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-040B-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-040B-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-040B-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-040B-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-040B-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-040B-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 0 resets, run finished after 121 ms. (steps per millisecond=82 ) properties seen :[0, 0, 0, 1, 0, 0, 1, 0, 0]
FORMULA ShieldPPPt-PT-040B-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-040B-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 29 ms. (steps per millisecond=344 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 23 ms. (steps per millisecond=434 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 19 ms. (steps per millisecond=526 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 23 ms. (steps per millisecond=434 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 20 ms. (steps per millisecond=500 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 22 ms. (steps per millisecond=454 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 20 ms. (steps per millisecond=500 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 2843 rows 3123 cols
[2020-06-05 02:11:07] [INFO ] Computed 441 place invariants in 72 ms
[2020-06-05 02:11:08] [INFO ] [Real]Absence check using 441 positive place invariants in 630 ms returned sat
[2020-06-05 02:11:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 02:11:12] [INFO ] [Real]Absence check using state equation in 3869 ms returned (error "Solver has unexpectedly terminated")
[2020-06-05 02:11:13] [INFO ] [Real]Absence check using 441 positive place invariants in 727 ms returned sat
[2020-06-05 02:11:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 02:11:17] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-05 02:11:17] [INFO ] [Real]Absence check using state equation in 3846 ms returned (error "Failed to check-sat")
[2020-06-05 02:11:18] [INFO ] [Real]Absence check using 441 positive place invariants in 740 ms returned sat
[2020-06-05 02:11:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 02:11:22] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-05 02:11:22] [INFO ] [Real]Absence check using state equation in 3846 ms returned (error "Failed to check-sat")
[2020-06-05 02:11:23] [INFO ] [Real]Absence check using 441 positive place invariants in 644 ms returned sat
[2020-06-05 02:11:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 02:11:27] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-05 02:11:27] [INFO ] [Real]Absence check using state equation in 3919 ms returned (error "Failed to check-sat")
[2020-06-05 02:11:28] [INFO ] [Real]Absence check using 441 positive place invariants in 816 ms returned sat
[2020-06-05 02:11:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 02:11:32] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-05 02:11:32] [INFO ] [Real]Absence check using state equation in 3697 ms returned (error "Failed to check-sat")
[2020-06-05 02:11:33] [INFO ] [Real]Absence check using 441 positive place invariants in 679 ms returned sat
[2020-06-05 02:11:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 02:11:37] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-05 02:11:37] [INFO ] [Real]Absence check using state equation in 3868 ms returned (error "Failed to check-sat")
[2020-06-05 02:11:38] [INFO ] [Real]Absence check using 441 positive place invariants in 605 ms returned sat
[2020-06-05 02:11:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 02:11:42] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-05 02:11:42] [INFO ] [Real]Absence check using state equation in 3946 ms returned (error "Failed to check-sat")
Support contains 25 out of 3123 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 3123/3123 places, 2843/2843 transitions.
Performed 752 Post agglomeration using F-continuation condition.Transition count delta: 752
Iterating post reduction 0 with 752 rules applied. Total rules applied 752 place count 3123 transition count 2091
Reduce places removed 752 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 754 rules applied. Total rules applied 1506 place count 2371 transition count 2089
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1507 place count 2370 transition count 2089
Performed 159 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 159 Pre rules applied. Total rules applied 1507 place count 2370 transition count 1930
Deduced a syphon composed of 159 places in 5 ms
Reduce places removed 159 places and 0 transitions.
Iterating global reduction 3 with 318 rules applied. Total rules applied 1825 place count 2211 transition count 1930
Symmetric choice reduction at 3 with 276 rule applications. Total rules 2101 place count 2211 transition count 1930
Deduced a syphon composed of 276 places in 17 ms
Reduce places removed 276 places and 276 transitions.
Iterating global reduction 3 with 552 rules applied. Total rules applied 2653 place count 1935 transition count 1654
Performed 116 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 116 Pre rules applied. Total rules applied 2653 place count 1935 transition count 1538
Deduced a syphon composed of 116 places in 13 ms
Reduce places removed 116 places and 0 transitions.
Iterating global reduction 3 with 232 rules applied. Total rules applied 2885 place count 1819 transition count 1538
Performed 671 Post agglomeration using F-continuation condition.Transition count delta: 671
Deduced a syphon composed of 671 places in 13 ms
Reduce places removed 671 places and 0 transitions.
Iterating global reduction 3 with 1342 rules applied. Total rules applied 4227 place count 1148 transition count 867
Renaming transitions due to excessive name length > 1024 char.
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 4 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 4429 place count 1047 transition count 867
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 12 places in 4 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 4453 place count 1035 transition count 867
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 4455 place count 1035 transition count 865
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 4457 place count 1033 transition count 865
Partial Free-agglomeration rule applied 115 times.
Drop transitions removed 115 transitions
Iterating global reduction 4 with 115 rules applied. Total rules applied 4572 place count 1033 transition count 865
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 4573 place count 1032 transition count 864
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 4574 place count 1031 transition count 864
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 4574 place count 1031 transition count 862
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 4578 place count 1029 transition count 862
Applied a total of 4578 rules in 1558 ms. Remains 1029 /3123 variables (removed 2094) and now considering 862/2843 (removed 1981) transitions.
Finished structural reductions, in 1 iterations. Remains : 1029/3123 places, 862/2843 transitions.
Incomplete random walk after 1000000 steps, including 0 resets, run finished after 6083 ms. (steps per millisecond=164 ) properties seen :[0, 1, 0, 0, 0, 1, 1]
FORMULA ShieldPPPt-PT-040B-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-040B-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-040B-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 4094 ms. (steps per millisecond=244 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 0 resets, run finished after 3712 ms. (steps per millisecond=269 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 3825 ms. (steps per millisecond=261 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 3964 ms. (steps per millisecond=252 ) properties seen :[0, 0, 0, 0]
// Phase 1: matrix 862 rows 1029 cols
[2020-06-05 02:12:05] [INFO ] Computed 440 place invariants in 3 ms
[2020-06-05 02:12:06] [INFO ] [Real]Absence check using 440 positive place invariants in 243 ms returned sat
[2020-06-05 02:12:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 02:12:07] [INFO ] [Real]Absence check using state equation in 1741 ms returned sat
[2020-06-05 02:12:07] [INFO ] State equation strengthened by 11 read => feed constraints.
[2020-06-05 02:12:07] [INFO ] [Real]Added 11 Read/Feed constraints in 14 ms returned sat
[2020-06-05 02:12:08] [INFO ] Deduced a trap composed of 5 places in 263 ms
[2020-06-05 02:12:08] [INFO ] Deduced a trap composed of 5 places in 228 ms
[2020-06-05 02:12:08] [INFO ] Deduced a trap composed of 7 places in 220 ms
[2020-06-05 02:12:08] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 862 ms
[2020-06-05 02:12:08] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 02:12:09] [INFO ] [Nat]Absence check using 440 positive place invariants in 299 ms returned sat
[2020-06-05 02:12:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 02:12:11] [INFO ] [Nat]Absence check using state equation in 2109 ms returned sat
[2020-06-05 02:12:11] [INFO ] [Nat]Added 11 Read/Feed constraints in 46 ms returned sat
[2020-06-05 02:12:11] [INFO ] Computed and/alt/rep : 851/2022/851 causal constraints in 55 ms.
[2020-06-05 02:12:27] [INFO ] Added : 815 causal constraints over 163 iterations in 16417 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 70 ms.
[2020-06-05 02:12:28] [INFO ] [Real]Absence check using 440 positive place invariants in 271 ms returned sat
[2020-06-05 02:12:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 02:12:30] [INFO ] [Real]Absence check using state equation in 2301 ms returned sat
[2020-06-05 02:12:30] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 02:12:31] [INFO ] [Nat]Absence check using 440 positive place invariants in 279 ms returned sat
[2020-06-05 02:12:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 02:12:33] [INFO ] [Nat]Absence check using state equation in 1903 ms returned sat
[2020-06-05 02:12:33] [INFO ] [Nat]Added 11 Read/Feed constraints in 33 ms returned sat
[2020-06-05 02:12:33] [INFO ] Deduced a trap composed of 5 places in 176 ms
[2020-06-05 02:12:33] [INFO ] Deduced a trap composed of 5 places in 137 ms
[2020-06-05 02:12:33] [INFO ] Deduced a trap composed of 5 places in 138 ms
[2020-06-05 02:12:34] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 607 ms
[2020-06-05 02:12:34] [INFO ] Computed and/alt/rep : 851/2022/851 causal constraints in 50 ms.
[2020-06-05 02:12:49] [INFO ] Added : 811 causal constraints over 163 iterations in 15612 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 80 ms.
[2020-06-05 02:12:50] [INFO ] [Real]Absence check using 440 positive place invariants in 276 ms returned sat
[2020-06-05 02:12:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 02:12:52] [INFO ] [Real]Absence check using state equation in 1897 ms returned sat
[2020-06-05 02:12:52] [INFO ] [Real]Added 11 Read/Feed constraints in 9 ms returned sat
[2020-06-05 02:12:52] [INFO ] Deduced a trap composed of 4 places in 178 ms
[2020-06-05 02:12:52] [INFO ] Deduced a trap composed of 6 places in 164 ms
[2020-06-05 02:12:52] [INFO ] Deduced a trap composed of 7 places in 140 ms
[2020-06-05 02:12:52] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 633 ms
[2020-06-05 02:12:52] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 02:12:53] [INFO ] [Nat]Absence check using 440 positive place invariants in 260 ms returned sat
[2020-06-05 02:12:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 02:12:54] [INFO ] [Nat]Absence check using state equation in 1697 ms returned sat
[2020-06-05 02:12:55] [INFO ] [Nat]Added 11 Read/Feed constraints in 19 ms returned sat
[2020-06-05 02:12:55] [INFO ] Computed and/alt/rep : 851/2022/851 causal constraints in 76 ms.
[2020-06-05 02:13:09] [INFO ] Added : 801 causal constraints over 161 iterations in 14334 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 83 ms.
[2020-06-05 02:13:10] [INFO ] [Real]Absence check using 440 positive place invariants in 277 ms returned sat
[2020-06-05 02:13:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 02:13:11] [INFO ] [Real]Absence check using state equation in 1850 ms returned sat
[2020-06-05 02:13:11] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 02:13:12] [INFO ] [Nat]Absence check using 440 positive place invariants in 336 ms returned sat
[2020-06-05 02:13:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 02:13:14] [INFO ] [Nat]Absence check using state equation in 1917 ms returned sat
[2020-06-05 02:13:14] [INFO ] [Nat]Added 11 Read/Feed constraints in 10 ms returned sat
[2020-06-05 02:13:14] [INFO ] Deduced a trap composed of 6 places in 178 ms
[2020-06-05 02:13:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 244 ms
[2020-06-05 02:13:14] [INFO ] Computed and/alt/rep : 851/2022/851 causal constraints in 57 ms.
[2020-06-05 02:13:26] [INFO ] Added : 827 causal constraints over 166 iterations in 11799 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 65 ms.
Finished Parikh walk after 19474 steps, including 32 resets, run visited all 4 properties in 212 ms. (steps per millisecond=91 )
FORMULA ShieldPPPt-PT-040B-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ShieldPPPt-PT-040B-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ShieldPPPt-PT-040B-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ShieldPPPt-PT-040B-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
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="ShieldPPPt-PT-040B"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="itslola"
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 itslola"
echo " Input is ShieldPPPt-PT-040B, 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 r211-tajo-159033477800710"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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