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-159033477000130.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 ShieldIIPs-PT-010B, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r211-tajo-159033477000130
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 336K
-rw-r--r-- 1 mcc users 3.7K May 14 00:34 CTLCardinality.txt
-rw-r--r-- 1 mcc users 21K May 14 00:34 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 13 17:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 13 17:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K May 14 10:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 14 10:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 14 10:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 14 10:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 12 20:42 NewModel
-rw-r--r-- 1 mcc users 3.6K May 13 13:10 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K May 13 13:10 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.8K May 13 07:40 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K May 13 07:40 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K 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 164K 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 ShieldIIPs-PT-010B-00
FORMULA_NAME ShieldIIPs-PT-010B-01
FORMULA_NAME ShieldIIPs-PT-010B-02
FORMULA_NAME ShieldIIPs-PT-010B-03
FORMULA_NAME ShieldIIPs-PT-010B-04
FORMULA_NAME ShieldIIPs-PT-010B-05
FORMULA_NAME ShieldIIPs-PT-010B-06
FORMULA_NAME ShieldIIPs-PT-010B-07
FORMULA_NAME ShieldIIPs-PT-010B-08
FORMULA_NAME ShieldIIPs-PT-010B-09
FORMULA_NAME ShieldIIPs-PT-010B-10
FORMULA_NAME ShieldIIPs-PT-010B-11
FORMULA_NAME ShieldIIPs-PT-010B-12
FORMULA_NAME ShieldIIPs-PT-010B-13
FORMULA_NAME ShieldIIPs-PT-010B-14
FORMULA_NAME ShieldIIPs-PT-010B-15

=== Now, execution of the tool begins

BK_START 1591287877919

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-04 16:24:40] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-04 16:24:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-04 16:24:40] [INFO ] Load time of PNML (sax parser for PT used): 126 ms
[2020-06-04 16:24:40] [INFO ] Transformed 603 places.
[2020-06-04 16:24:40] [INFO ] Transformed 593 transitions.
[2020-06-04 16:24:40] [INFO ] Found NUPN structural information;
[2020-06-04 16:24:40] [INFO ] Parsed PT model containing 603 places and 593 transitions in 227 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 59 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 76 resets, run finished after 380 ms. (steps per millisecond=263 ) properties seen :[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 593 rows 603 cols
[2020-06-04 16:24:40] [INFO ] Computed 91 place invariants in 17 ms
[2020-06-04 16:24:41] [INFO ] [Real]Absence check using 91 positive place invariants in 81 ms returned sat
[2020-06-04 16:24:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 16:24:42] [INFO ] [Real]Absence check using state equation in 840 ms returned sat
[2020-06-04 16:24:42] [INFO ] Deduced a trap composed of 22 places in 298 ms
[2020-06-04 16:24:42] [INFO ] Deduced a trap composed of 22 places in 280 ms
[2020-06-04 16:24:43] [INFO ] Deduced a trap composed of 29 places in 245 ms
[2020-06-04 16:24:43] [INFO ] Deduced a trap composed of 19 places in 214 ms
[2020-06-04 16:24:43] [INFO ] Deduced a trap composed of 22 places in 303 ms
[2020-06-04 16:24:43] [INFO ] Deduced a trap composed of 19 places in 182 ms
[2020-06-04 16:24:44] [INFO ] Deduced a trap composed of 20 places in 154 ms
[2020-06-04 16:24:44] [INFO ] Deduced a trap composed of 24 places in 165 ms
[2020-06-04 16:24:44] [INFO ] Deduced a trap composed of 18 places in 259 ms
[2020-06-04 16:24:44] [INFO ] Deduced a trap composed of 21 places in 267 ms
[2020-06-04 16:24:45] [INFO ] Deduced a trap composed of 24 places in 205 ms
[2020-06-04 16:24:45] [INFO ] Deduced a trap composed of 29 places in 166 ms
[2020-06-04 16:24:45] [INFO ] Deduced a trap composed of 26 places in 181 ms
[2020-06-04 16:24:45] [INFO ] Deduced a trap composed of 25 places in 198 ms
[2020-06-04 16:24:46] [INFO ] Deduced a trap composed of 24 places in 292 ms
[2020-06-04 16:24:46] [INFO ] Deduced a trap composed of 28 places in 276 ms
[2020-06-04 16:24:46] [INFO ] Deduced a trap composed of 25 places in 140 ms
[2020-06-04 16:24:46] [INFO ] Deduced a trap composed of 24 places in 114 ms
[2020-06-04 16:24:47] [INFO ] Deduced a trap composed of 24 places in 621 ms
[2020-06-04 16:24:47] [INFO ] Deduced a trap composed of 32 places in 122 ms
[2020-06-04 16:24:47] [INFO ] Deduced a trap composed of 31 places in 168 ms
[2020-06-04 16:24:47] [INFO ] Deduced a trap composed of 38 places in 116 ms
[2020-06-04 16:24:48] [INFO ] Deduced a trap composed of 39 places in 116 ms
[2020-06-04 16:24:48] [INFO ] Deduced a trap composed of 33 places in 123 ms
[2020-06-04 16:24:48] [INFO ] Deduced a trap composed of 21 places in 100 ms
[2020-06-04 16:24:48] [INFO ] Deduced a trap composed of 25 places in 130 ms
[2020-06-04 16:24:48] [INFO ] Trap strengthening (SAT) tested/added 27/26 trap constraints in 6218 ms
[2020-06-04 16:24:48] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 16:24:48] [INFO ] [Nat]Absence check using 91 positive place invariants in 82 ms returned sat
[2020-06-04 16:24:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 16:24:49] [INFO ] [Nat]Absence check using state equation in 661 ms returned sat
[2020-06-04 16:24:49] [INFO ] Deduced a trap composed of 26 places in 249 ms
[2020-06-04 16:24:49] [INFO ] Deduced a trap composed of 19 places in 299 ms
[2020-06-04 16:24:50] [INFO ] Deduced a trap composed of 32 places in 204 ms
[2020-06-04 16:24:50] [INFO ] Deduced a trap composed of 12 places in 143 ms
[2020-06-04 16:24:50] [INFO ] Deduced a trap composed of 18 places in 249 ms
[2020-06-04 16:24:50] [INFO ] Deduced a trap composed of 26 places in 134 ms
[2020-06-04 16:24:51] [INFO ] Deduced a trap composed of 19 places in 200 ms
[2020-06-04 16:24:51] [INFO ] Deduced a trap composed of 25 places in 147 ms
[2020-06-04 16:24:51] [INFO ] Deduced a trap composed of 27 places in 147 ms
[2020-06-04 16:24:51] [INFO ] Deduced a trap composed of 20 places in 133 ms
[2020-06-04 16:24:51] [INFO ] Deduced a trap composed of 19 places in 155 ms
[2020-06-04 16:24:51] [INFO ] Deduced a trap composed of 24 places in 169 ms
[2020-06-04 16:24:52] [INFO ] Deduced a trap composed of 17 places in 146 ms
[2020-06-04 16:24:52] [INFO ] Deduced a trap composed of 23 places in 163 ms
[2020-06-04 16:24:52] [INFO ] Deduced a trap composed of 24 places in 147 ms
[2020-06-04 16:24:52] [INFO ] Deduced a trap composed of 28 places in 144 ms
[2020-06-04 16:24:52] [INFO ] Deduced a trap composed of 23 places in 155 ms
[2020-06-04 16:24:53] [INFO ] Deduced a trap composed of 16 places in 170 ms
[2020-06-04 16:24:53] [INFO ] Deduced a trap composed of 21 places in 176 ms
[2020-06-04 16:24:53] [INFO ] Deduced a trap composed of 26 places in 142 ms
[2020-06-04 16:24:53] [INFO ] Deduced a trap composed of 21 places in 148 ms
[2020-06-04 16:24:53] [INFO ] Deduced a trap composed of 22 places in 117 ms
[2020-06-04 16:24:53] [INFO ] Deduced a trap composed of 26 places in 119 ms
[2020-06-04 16:24:53] [INFO ] Deduced a trap composed of 39 places in 132 ms
[2020-06-04 16:24:54] [INFO ] Deduced a trap composed of 31 places in 176 ms
[2020-06-04 16:24:54] [INFO ] Deduced a trap composed of 21 places in 131 ms
[2020-06-04 16:24:54] [INFO ] Deduced a trap composed of 35 places in 147 ms
[2020-06-04 16:24:54] [INFO ] Deduced a trap composed of 27 places in 158 ms
[2020-06-04 16:24:54] [INFO ] Deduced a trap composed of 34 places in 118 ms
[2020-06-04 16:24:55] [INFO ] Deduced a trap composed of 32 places in 117 ms
[2020-06-04 16:24:55] [INFO ] Deduced a trap composed of 28 places in 122 ms
[2020-06-04 16:24:55] [INFO ] Deduced a trap composed of 27 places in 118 ms
[2020-06-04 16:24:55] [INFO ] Deduced a trap composed of 31 places in 111 ms
[2020-06-04 16:24:55] [INFO ] Deduced a trap composed of 36 places in 121 ms
[2020-06-04 16:24:55] [INFO ] Deduced a trap composed of 19 places in 133 ms
[2020-06-04 16:24:55] [INFO ] Deduced a trap composed of 22 places in 94 ms
[2020-06-04 16:24:56] [INFO ] Deduced a trap composed of 24 places in 117 ms
[2020-06-04 16:24:56] [INFO ] Deduced a trap composed of 24 places in 108 ms
[2020-06-04 16:24:56] [INFO ] Deduced a trap composed of 18 places in 100 ms
[2020-06-04 16:24:56] [INFO ] Deduced a trap composed of 30 places in 103 ms
[2020-06-04 16:24:56] [INFO ] Deduced a trap composed of 34 places in 90 ms
[2020-06-04 16:24:56] [INFO ] Deduced a trap composed of 38 places in 81 ms
[2020-06-04 16:24:56] [INFO ] Deduced a trap composed of 28 places in 155 ms
[2020-06-04 16:24:57] [INFO ] Deduced a trap composed of 30 places in 163 ms
[2020-06-04 16:24:57] [INFO ] Deduced a trap composed of 44 places in 113 ms
[2020-06-04 16:24:57] [INFO ] Deduced a trap composed of 43 places in 106 ms
[2020-06-04 16:24:57] [INFO ] Deduced a trap composed of 43 places in 117 ms
[2020-06-04 16:24:57] [INFO ] Deduced a trap composed of 47 places in 112 ms
[2020-06-04 16:24:57] [INFO ] Trap strengthening (SAT) tested/added 49/48 trap constraints in 8277 ms
[2020-06-04 16:24:57] [INFO ] Computed and/alt/rep : 592/1243/592 causal constraints in 37 ms.
[2020-06-04 16:25:08] [INFO ] Added : 563 causal constraints over 118 iterations in 10884 ms. Result :unknown
[2020-06-04 16:25:08] [INFO ] [Real]Absence check using 91 positive place invariants in 111 ms returned sat
[2020-06-04 16:25:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 16:25:09] [INFO ] [Real]Absence check using state equation in 729 ms returned sat
[2020-06-04 16:25:09] [INFO ] Deduced a trap composed of 28 places in 317 ms
[2020-06-04 16:25:10] [INFO ] Deduced a trap composed of 19 places in 186 ms
[2020-06-04 16:25:10] [INFO ] Deduced a trap composed of 17 places in 171 ms
[2020-06-04 16:25:10] [INFO ] Deduced a trap composed of 33 places in 192 ms
[2020-06-04 16:25:10] [INFO ] Deduced a trap composed of 26 places in 175 ms
[2020-06-04 16:25:10] [INFO ] Deduced a trap composed of 25 places in 199 ms
[2020-06-04 16:25:11] [INFO ] Deduced a trap composed of 15 places in 169 ms
[2020-06-04 16:25:11] [INFO ] Deduced a trap composed of 23 places in 152 ms
[2020-06-04 16:25:11] [INFO ] Deduced a trap composed of 18 places in 177 ms
[2020-06-04 16:25:11] [INFO ] Deduced a trap composed of 29 places in 161 ms
[2020-06-04 16:25:11] [INFO ] Deduced a trap composed of 28 places in 160 ms
[2020-06-04 16:25:12] [INFO ] Deduced a trap composed of 29 places in 145 ms
[2020-06-04 16:25:12] [INFO ] Deduced a trap composed of 21 places in 132 ms
[2020-06-04 16:25:12] [INFO ] Deduced a trap composed of 29 places in 139 ms
[2020-06-04 16:25:12] [INFO ] Deduced a trap composed of 24 places in 183 ms
[2020-06-04 16:25:12] [INFO ] Deduced a trap composed of 20 places in 131 ms
[2020-06-04 16:25:12] [INFO ] Deduced a trap composed of 28 places in 175 ms
[2020-06-04 16:25:13] [INFO ] Deduced a trap composed of 26 places in 126 ms
[2020-06-04 16:25:13] [INFO ] Deduced a trap composed of 36 places in 140 ms
[2020-06-04 16:25:13] [INFO ] Deduced a trap composed of 27 places in 143 ms
[2020-06-04 16:25:13] [INFO ] Deduced a trap composed of 27 places in 124 ms
[2020-06-04 16:25:13] [INFO ] Trap strengthening (SAT) tested/added 22/21 trap constraints in 3937 ms
[2020-06-04 16:25:13] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 16:25:13] [INFO ] [Nat]Absence check using 91 positive place invariants in 58 ms returned sat
[2020-06-04 16:25:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 16:25:14] [INFO ] [Nat]Absence check using state equation in 574 ms returned sat
[2020-06-04 16:25:14] [INFO ] Deduced a trap composed of 25 places in 201 ms
[2020-06-04 16:25:14] [INFO ] Deduced a trap composed of 17 places in 207 ms
[2020-06-04 16:25:14] [INFO ] Deduced a trap composed of 20 places in 185 ms
[2020-06-04 16:25:15] [INFO ] Deduced a trap composed of 27 places in 175 ms
[2020-06-04 16:25:15] [INFO ] Deduced a trap composed of 15 places in 195 ms
[2020-06-04 16:25:15] [INFO ] Deduced a trap composed of 27 places in 173 ms
[2020-06-04 16:25:15] [INFO ] Deduced a trap composed of 24 places in 162 ms
[2020-06-04 16:25:15] [INFO ] Deduced a trap composed of 30 places in 146 ms
[2020-06-04 16:25:16] [INFO ] Deduced a trap composed of 27 places in 166 ms
[2020-06-04 16:25:16] [INFO ] Deduced a trap composed of 17 places in 193 ms
[2020-06-04 16:25:16] [INFO ] Deduced a trap composed of 26 places in 156 ms
[2020-06-04 16:25:16] [INFO ] Deduced a trap composed of 21 places in 160 ms
[2020-06-04 16:25:16] [INFO ] Deduced a trap composed of 23 places in 170 ms
[2020-06-04 16:25:17] [INFO ] Deduced a trap composed of 27 places in 166 ms
[2020-06-04 16:25:17] [INFO ] Deduced a trap composed of 33 places in 134 ms
[2020-06-04 16:25:17] [INFO ] Deduced a trap composed of 34 places in 163 ms
[2020-06-04 16:25:17] [INFO ] Deduced a trap composed of 19 places in 140 ms
[2020-06-04 16:25:17] [INFO ] Deduced a trap composed of 23 places in 144 ms
[2020-06-04 16:25:17] [INFO ] Deduced a trap composed of 23 places in 122 ms
[2020-06-04 16:25:17] [INFO ] Deduced a trap composed of 27 places in 139 ms
[2020-06-04 16:25:18] [INFO ] Deduced a trap composed of 29 places in 128 ms
[2020-06-04 16:25:18] [INFO ] Deduced a trap composed of 24 places in 131 ms
[2020-06-04 16:25:18] [INFO ] Deduced a trap composed of 23 places in 134 ms
[2020-06-04 16:25:18] [INFO ] Deduced a trap composed of 25 places in 112 ms
[2020-06-04 16:25:18] [INFO ] Deduced a trap composed of 32 places in 125 ms
[2020-06-04 16:25:18] [INFO ] Deduced a trap composed of 31 places in 108 ms
[2020-06-04 16:25:18] [INFO ] Deduced a trap composed of 26 places in 121 ms
[2020-06-04 16:25:19] [INFO ] Deduced a trap composed of 29 places in 113 ms
[2020-06-04 16:25:19] [INFO ] Deduced a trap composed of 26 places in 192 ms
[2020-06-04 16:25:19] [INFO ] Deduced a trap composed of 33 places in 124 ms
[2020-06-04 16:25:19] [INFO ] Deduced a trap composed of 18 places in 188 ms
[2020-06-04 16:25:19] [INFO ] Deduced a trap composed of 10 places in 129 ms
[2020-06-04 16:25:19] [INFO ] Deduced a trap composed of 20 places in 107 ms
[2020-06-04 16:25:20] [INFO ] Deduced a trap composed of 13 places in 130 ms
[2020-06-04 16:25:20] [INFO ] Deduced a trap composed of 26 places in 123 ms
[2020-06-04 16:25:20] [INFO ] Trap strengthening (SAT) tested/added 36/35 trap constraints in 5950 ms
[2020-06-04 16:25:20] [INFO ] Computed and/alt/rep : 592/1243/592 causal constraints in 31 ms.
[2020-06-04 16:25:32] [INFO ] Added : 583 causal constraints over 120 iterations in 12178 ms. Result :unknown
[2020-06-04 16:25:32] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2020-06-04 16:25:32] [INFO ] Flatten gal took : 99 ms
FORMULA ShieldIIPs-PT-010B-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-010B-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-04 16:25:32] [INFO ] Applying decomposition
[2020-06-04 16:25:32] [INFO ] Flatten gal took : 41 ms
[2020-06-04 16:25:32] [INFO ] Decomposing Gal with order
[2020-06-04 16:25:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-06-04 16:25:33] [INFO ] Removed a total of 160 redundant transitions.
[2020-06-04 16:25:33] [INFO ] Flatten gal took : 149 ms
[2020-06-04 16:25:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 200 labels/synchronizations in 44 ms.
[2020-06-04 16:25:33] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLFireability.sr.xml took 3 ms.
[2020-06-04 16:25:33] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 28 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLFireability @ ShieldIIPs-PT-010B @ 3570 seconds

FORMULA ShieldIIPs-PT-010B-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldIIPs-PT-010B-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldIIPs-PT-010B-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16427488 kB
MemFree: 12831344 kB
After kill :
MemTotal: 16427488 kB
MemFree: 12831872 kB

--------------------
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="ShieldIIPs-PT-010B"
export BK_EXAMINATION="LTLFireability"
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 ShieldIIPs-PT-010B, examination is LTLFireability"
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-159033477000130"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldIIPs-PT-010B.tgz
mv ShieldIIPs-PT-010B execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;