Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2020-input.r170-smll-158987815600284.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/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 FlexibleBarrier-PT-06b, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r170-smll-158987815600284
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 328K
-rw-r--r-- 1 mcc users 3.7K Apr 4 18:11 CTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Apr 4 18:11 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 4 06:23 CTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 4 06:23 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Apr 8 14:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Apr 8 14:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Apr 3 20:59 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 21K Apr 3 20:59 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Apr 3 13:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 3 13:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 4 01:37 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 4 01:37 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 141K 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 FlexibleBarrier-PT-06b-CTLFireability-00
FORMULA_NAME FlexibleBarrier-PT-06b-CTLFireability-01
FORMULA_NAME FlexibleBarrier-PT-06b-CTLFireability-02
FORMULA_NAME FlexibleBarrier-PT-06b-CTLFireability-03
FORMULA_NAME FlexibleBarrier-PT-06b-CTLFireability-04
FORMULA_NAME FlexibleBarrier-PT-06b-CTLFireability-05
FORMULA_NAME FlexibleBarrier-PT-06b-CTLFireability-06
FORMULA_NAME FlexibleBarrier-PT-06b-CTLFireability-07
FORMULA_NAME FlexibleBarrier-PT-06b-CTLFireability-08
FORMULA_NAME FlexibleBarrier-PT-06b-CTLFireability-09
FORMULA_NAME FlexibleBarrier-PT-06b-CTLFireability-10
FORMULA_NAME FlexibleBarrier-PT-06b-CTLFireability-11
FORMULA_NAME FlexibleBarrier-PT-06b-CTLFireability-12
FORMULA_NAME FlexibleBarrier-PT-06b-CTLFireability-13
FORMULA_NAME FlexibleBarrier-PT-06b-CTLFireability-14
FORMULA_NAME FlexibleBarrier-PT-06b-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1591334604512

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-05 05:23:26] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-05 05:23:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-05 05:23:27] [INFO ] Load time of PNML (sax parser for PT used): 122 ms
[2020-06-05 05:23:27] [INFO ] Transformed 542 places.
[2020-06-05 05:23:27] [INFO ] Transformed 621 transitions.
[2020-06-05 05:23:27] [INFO ] Found NUPN structural information;
[2020-06-05 05:23:27] [INFO ] Parsed PT model containing 542 places and 621 transitions in 185 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 37 ms.
Incomplete random walk after 100000 steps, including 1937 resets, run finished after 535 ms. (steps per millisecond=186 ) properties seen :[1, 0, 0, 1, 1, 1, 1, 1, 1, 0, 1, 0, 0, 1, 0, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1]
// Phase 1: matrix 621 rows 542 cols
[2020-06-05 05:23:27] [INFO ] Computed 8 place invariants in 24 ms
[2020-06-05 05:23:28] [INFO ] [Real]Absence check using 8 positive place invariants in 39 ms returned unsat
[2020-06-05 05:23:28] [INFO ] [Real]Absence check using 8 positive place invariants in 27 ms returned sat
[2020-06-05 05:23:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 05:23:29] [INFO ] [Real]Absence check using state equation in 867 ms returned sat
[2020-06-05 05:23:29] [INFO ] Deduced a trap composed of 222 places in 424 ms
[2020-06-05 05:23:29] [INFO ] Deduced a trap composed of 190 places in 159 ms
[2020-06-05 05:23:30] [INFO ] Deduced a trap composed of 134 places in 98 ms
[2020-06-05 05:23:30] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 834 ms
[2020-06-05 05:23:30] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 05:23:36] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-05 05:23:39] [INFO ] [Nat]Absence check using 8 positive place invariants in 9198 ms returned unknown
[2020-06-05 05:23:39] [INFO ] [Real]Absence check using 8 positive place invariants in 26 ms returned unsat
[2020-06-05 05:23:39] [INFO ] [Real]Absence check using 8 positive place invariants in 28 ms returned sat
[2020-06-05 05:23:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 05:23:40] [INFO ] [Real]Absence check using state equation in 817 ms returned sat
[2020-06-05 05:23:40] [INFO ] Computed and/alt/rep : 620/2195/620 causal constraints in 51 ms.
[2020-06-05 05:23:40] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 05:23:47] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-05 05:23:50] [INFO ] [Nat]Absence check using 8 positive place invariants in 9301 ms returned unknown
[2020-06-05 05:23:50] [INFO ] [Real]Absence check using 8 positive place invariants in 43 ms returned sat
[2020-06-05 05:23:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 05:23:51] [INFO ] [Real]Absence check using state equation in 1256 ms returned sat
[2020-06-05 05:23:52] [INFO ] Deduced a trap composed of 166 places in 491 ms
[2020-06-05 05:23:52] [INFO ] Deduced a trap composed of 134 places in 437 ms
[2020-06-05 05:23:53] [INFO ] Deduced a trap composed of 189 places in 314 ms
[2020-06-05 05:23:53] [INFO ] Deduced a trap composed of 187 places in 460 ms
[2020-06-05 05:23:53] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1906 ms
[2020-06-05 05:23:53] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 05:23:59] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-05 05:24:03] [INFO ] [Nat]Absence check using 8 positive place invariants in 9310 ms returned unknown
[2020-06-05 05:24:03] [INFO ] [Real]Absence check using 8 positive place invariants in 34 ms returned sat
[2020-06-05 05:24:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 05:24:04] [INFO ] [Real]Absence check using state equation in 849 ms returned sat
[2020-06-05 05:24:04] [INFO ] Deduced a trap composed of 205 places in 310 ms
[2020-06-05 05:24:04] [INFO ] Deduced a trap composed of 74 places in 241 ms
[2020-06-05 05:24:04] [INFO ] Deduced a trap composed of 48 places in 227 ms
[2020-06-05 05:24:05] [INFO ] Deduced a trap composed of 163 places in 244 ms
[2020-06-05 05:24:05] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1168 ms
[2020-06-05 05:24:05] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 05:24:11] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-05 05:24:14] [INFO ] [Nat]Absence check using 8 positive place invariants in 9191 ms returned unknown
[2020-06-05 05:24:14] [INFO ] [Real]Absence check using 8 positive place invariants in 26 ms returned sat
[2020-06-05 05:24:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 05:24:15] [INFO ] [Real]Absence check using state equation in 823 ms returned sat
[2020-06-05 05:24:16] [INFO ] Deduced a trap composed of 207 places in 449 ms
[2020-06-05 05:24:16] [INFO ] Deduced a trap composed of 157 places in 298 ms
[2020-06-05 05:24:16] [INFO ] Deduced a trap composed of 157 places in 280 ms
[2020-06-05 05:24:17] [INFO ] Deduced a trap composed of 185 places in 292 ms
[2020-06-05 05:24:17] [INFO ] Deduced a trap composed of 214 places in 270 ms
[2020-06-05 05:24:17] [INFO ] Deduced a trap composed of 185 places in 263 ms
[2020-06-05 05:24:17] [INFO ] Deduced a trap composed of 184 places in 188 ms
[2020-06-05 05:24:18] [INFO ] Deduced a trap composed of 192 places in 221 ms
[2020-06-05 05:24:18] [INFO ] Deduced a trap composed of 212 places in 235 ms
[2020-06-05 05:24:18] [INFO ] Deduced a trap composed of 185 places in 202 ms
[2020-06-05 05:24:19] [INFO ] Deduced a trap composed of 212 places in 305 ms
[2020-06-05 05:24:19] [INFO ] Deduced a trap composed of 211 places in 315 ms
[2020-06-05 05:24:19] [INFO ] Deduced a trap composed of 188 places in 275 ms
[2020-06-05 05:24:19] [INFO ] Deduced a trap composed of 189 places in 271 ms
[2020-06-05 05:24:20] [INFO ] Deduced a trap composed of 187 places in 272 ms
[2020-06-05 05:24:20] [INFO ] Deduced a trap composed of 213 places in 280 ms
[2020-06-05 05:24:20] [INFO ] Deduced a trap composed of 184 places in 190 ms
[2020-06-05 05:24:21] [INFO ] Deduced a trap composed of 187 places in 190 ms
[2020-06-05 05:24:21] [INFO ] Deduced a trap composed of 178 places in 186 ms
[2020-06-05 05:24:21] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 5817 ms
[2020-06-05 05:24:21] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 05:24:24] [INFO ] [Nat]Absence check using 8 positive place invariants in 2895 ms returned sat
[2020-06-05 05:24:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 05:24:25] [INFO ] [Nat]Absence check using state equation in 783 ms returned sat
[2020-06-05 05:24:25] [INFO ] Deduced a trap composed of 133 places in 284 ms
[2020-06-05 05:24:25] [INFO ] Deduced a trap composed of 192 places in 289 ms
[2020-06-05 05:24:26] [INFO ] Deduced a trap composed of 166 places in 239 ms
[2020-06-05 05:24:26] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 944 ms
[2020-06-05 05:24:26] [INFO ] Computed and/alt/rep : 620/2195/620 causal constraints in 51 ms.
[2020-06-05 05:24:36] [INFO ] Added : 599 causal constraints over 120 iterations in 10595 ms. Result :sat
[2020-06-05 05:24:36] [INFO ] [Real]Absence check using 8 positive place invariants in 27 ms returned sat
[2020-06-05 05:24:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 05:24:37] [INFO ] [Real]Absence check using state equation in 797 ms returned sat
[2020-06-05 05:24:38] [INFO ] Deduced a trap composed of 210 places in 379 ms
[2020-06-05 05:24:38] [INFO ] Deduced a trap composed of 210 places in 442 ms
[2020-06-05 05:24:39] [INFO ] Deduced a trap composed of 49 places in 435 ms
[2020-06-05 05:24:39] [INFO ] Deduced a trap composed of 147 places in 281 ms
[2020-06-05 05:24:39] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1701 ms
[2020-06-05 05:24:39] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 05:24:45] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-05 05:24:48] [INFO ] [Nat]Absence check using 8 positive place invariants in 9314 ms returned unknown
[2020-06-05 05:24:48] [INFO ] [Real]Absence check using 8 positive place invariants in 26 ms returned sat
[2020-06-05 05:24:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 05:24:49] [INFO ] [Real]Absence check using state equation in 788 ms returned sat
[2020-06-05 05:24:50] [INFO ] Deduced a trap composed of 74 places in 318 ms
[2020-06-05 05:24:50] [INFO ] Deduced a trap composed of 187 places in 296 ms
[2020-06-05 05:24:50] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 708 ms
[2020-06-05 05:24:50] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 05:24:56] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-05 05:24:59] [INFO ] [Nat]Absence check using 8 positive place invariants in 9371 ms returned unknown
[2020-06-05 05:25:00] [INFO ] [Real]Absence check using 8 positive place invariants in 26 ms returned unsat
Successfully simplified 3 atomic propositions for a total of 3 simplifications.
[2020-06-05 05:25:00] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2020-06-05 05:25:00] [INFO ] Flatten gal took : 112 ms
[2020-06-05 05:25:00] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2020-06-05 05:25:00] [INFO ] Flatten gal took : 47 ms
FORMULA FlexibleBarrier-PT-06b-CTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-05 05:25:00] [INFO ] Export to MCC properties in file /home/mcc/execution/CTLFireability.sr.xml took 4 ms.
[2020-06-05 05:25:00] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 8 ms.
info: Time: 3600 - MCC
vrfy: Checking CTLFireability @ FlexibleBarrier-PT-06b @ 3570 seconds

FORMULA FlexibleBarrier-PT-06b-CTLFireability-00 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FlexibleBarrier-PT-06b-CTLFireability-04 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FlexibleBarrier-PT-06b-CTLFireability-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FlexibleBarrier-PT-06b-CTLFireability-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FlexibleBarrier-PT-06b-CTLFireability-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FlexibleBarrier-PT-06b-CTLFireability-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FlexibleBarrier-PT-06b-CTLFireability-09 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FlexibleBarrier-PT-06b-CTLFireability-01 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FlexibleBarrier-PT-06b-CTLFireability-02 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FlexibleBarrier-PT-06b-CTLFireability-08 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FlexibleBarrier-PT-06b-CTLFireability-03 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FlexibleBarrier-PT-06b-CTLFireability-05 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FlexibleBarrier-PT-06b-CTLFireability-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FlexibleBarrier-PT-06b-CTLFireability-07 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16427332 kB
MemFree: 8136504 kB
After kill :
MemTotal: 16427332 kB
MemFree: 8139084 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="FlexibleBarrier-PT-06b"
export BK_EXAMINATION="CTLFireability"
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 FlexibleBarrier-PT-06b, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r170-smll-158987815600284"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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