Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r520-tall-171662337700055.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is QuasiCertifProtocol-COL-32, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r520-tall-171662337700055
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 620K
-rw-r--r-- 1 mcc users 6.5K Apr 13 04:08 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K Apr 13 04:08 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Apr 13 03:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Apr 13 03:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 13 04:33 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 165K Apr 13 04:33 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.4K Apr 13 04:13 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 66K Apr 13 04:13 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 3 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 131K May 18 16:43 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 QuasiCertifProtocol-COL-32-ReachabilityFireability-2024-00
FORMULA_NAME QuasiCertifProtocol-COL-32-ReachabilityFireability-2024-01
FORMULA_NAME QuasiCertifProtocol-COL-32-ReachabilityFireability-2024-02
FORMULA_NAME QuasiCertifProtocol-COL-32-ReachabilityFireability-2024-03
FORMULA_NAME QuasiCertifProtocol-COL-32-ReachabilityFireability-2024-04
FORMULA_NAME QuasiCertifProtocol-COL-32-ReachabilityFireability-2024-05
FORMULA_NAME QuasiCertifProtocol-COL-32-ReachabilityFireability-2024-06
FORMULA_NAME QuasiCertifProtocol-COL-32-ReachabilityFireability-2024-07
FORMULA_NAME QuasiCertifProtocol-COL-32-ReachabilityFireability-2024-08
FORMULA_NAME QuasiCertifProtocol-COL-32-ReachabilityFireability-2024-09
FORMULA_NAME QuasiCertifProtocol-COL-32-ReachabilityFireability-2024-10
FORMULA_NAME QuasiCertifProtocol-COL-32-ReachabilityFireability-2024-11
FORMULA_NAME QuasiCertifProtocol-COL-32-ReachabilityFireability-2024-12
FORMULA_NAME QuasiCertifProtocol-COL-32-ReachabilityFireability-2024-13
FORMULA_NAME QuasiCertifProtocol-COL-32-ReachabilityFireability-2024-14
FORMULA_NAME QuasiCertifProtocol-COL-32-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717219635139

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=QuasiCertifProtocol-COL-32
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 05:27:16] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 05:27:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 05:27:16] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-06-01 05:27:16] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-06-01 05:27:17] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 629 ms
[2024-06-01 05:27:17] [INFO ] Imported 30 HL places and 26 HL transitions for a total of 3806 PT places and 506.0 transition bindings in 20 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 27 ms.
Working with output stream class java.io.PrintStream
[2024-06-01 05:27:17] [INFO ] Built PT skeleton of HLPN with 30 places and 26 transitions 77 arcs in 4 ms.
[2024-06-01 05:27:17] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
Remains 1 properties that can be checked using skeleton over-approximation.
Computed a total of 30 stabilizing places and 26 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 30 transition count 26
RANDOM walk for 40029 steps (899 resets) in 269 ms. (148 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (299 resets) in 159 ms. (250 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 3929464 steps, run timeout after 3001 ms. (steps per millisecond=1309 ) properties seen :0 out of 1
Probabilistic random walk after 3929464 steps, saw 644208 distinct states, run finished after 3005 ms. (steps per millisecond=1307 ) properties seen :0
// Phase 1: matrix 26 rows 30 cols
[2024-06-01 05:27:20] [INFO ] Computed 5 invariants in 8 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 16/20 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 4/24 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/24 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem QuasiCertifProtocol-COL-32-ReachabilityFireability-2024-08 is UNSAT
After SMT solving in domain Real declared 50/56 variables, and 29 constraints, problems are : Problem set: 1 solved, 0 unsolved in 155 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 24/30 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 193ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
[2024-06-01 05:27:20] [INFO ] Flatten gal took : 17 ms
[2024-06-01 05:27:20] [INFO ] Flatten gal took : 6 ms
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
FORMULA QuasiCertifProtocol-COL-32-ReachabilityFireability-2024-08 TRUE TECHNIQUES CPN_APPROX
Domain [tsid(33), tsid(33)] of place n9 breaks symmetries in sort tsid
[2024-06-01 05:27:20] [INFO ] Unfolded HLPN to a Petri net with 3806 places and 506 transitions 8173 arcs in 35 ms.
[2024-06-01 05:27:20] [INFO ] Unfolded 16 HLPN properties in 1 ms.
RANDOM walk for 40000 steps (1066 resets) in 2917 ms. (13 steps per ms) remains 14/15 properties
FORMULA QuasiCertifProtocol-COL-32-ReachabilityFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (24 resets) in 3796 ms. (10 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (35 resets) in 1416 ms. (28 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (44 resets) in 143 ms. (277 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (34 resets) in 191 ms. (208 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (37 resets) in 4902 ms. (8 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (46 resets) in 5482 ms. (7 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (49 resets) in 6278 ms. (6 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (48 resets) in 223 ms. (178 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (32 resets) in 1255 ms. (31 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (37 resets) in 178 ms. (223 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (44 resets) in 1347 ms. (29 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (43 resets) in 118 ms. (336 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (44 resets) in 3939 ms. (10 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (42 resets) in 611 ms. (65 steps per ms) remains 14/14 properties
Interrupted probabilistic random walk after 3487347 steps, run timeout after 24001 ms. (steps per millisecond=145 ) properties seen :9 out of 14
Probabilistic random walk after 3487347 steps, saw 473587 distinct states, run finished after 24001 ms. (steps per millisecond=145 ) properties seen :9
FORMULA QuasiCertifProtocol-COL-32-ReachabilityFireability-2024-15 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA QuasiCertifProtocol-COL-32-ReachabilityFireability-2024-14 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA QuasiCertifProtocol-COL-32-ReachabilityFireability-2024-13 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA QuasiCertifProtocol-COL-32-ReachabilityFireability-2024-12 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA QuasiCertifProtocol-COL-32-ReachabilityFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA QuasiCertifProtocol-COL-32-ReachabilityFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA QuasiCertifProtocol-COL-32-ReachabilityFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA QuasiCertifProtocol-COL-32-ReachabilityFireability-2024-04 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA QuasiCertifProtocol-COL-32-ReachabilityFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
// Phase 1: matrix 506 rows 3806 cols
[2024-06-01 05:27:53] [INFO ] Computed 3301 invariants in 164 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3736 variables, 2208/2208 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/3736 variables, 0/2208 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Problem QuasiCertifProtocol-COL-32-ReachabilityFireability-2024-02 is UNSAT
FORMULA QuasiCertifProtocol-COL-32-ReachabilityFireability-2024-02 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 70/3806 variables, 37/2245 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/3806 variables, 1056/3301 constraints. Problems are: Problem set: 1 solved, 4 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3806/4312 variables, and 3301 constraints, problems are : Problem set: 1 solved, 4 unsolved in 5016 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 3264/3264 constraints, State Equation: 0/3806 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3736 variables, 2208/2208 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/3736 variables, 0/2208 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 70/3806 variables, 37/2245 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/3806 variables, 1056/3301 constraints. Problems are: Problem set: 1 solved, 4 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3806/4312 variables, and 3301 constraints, problems are : Problem set: 1 solved, 4 unsolved in 5011 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 3264/3264 constraints, State Equation: 0/3806 constraints, PredecessorRefiner: 0/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 14083ms problems are : Problem set: 1 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 3736 out of 3806 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3806/3806 places, 506/506 transitions.
Graph (complete) has 43474 edges and 3806 vertex of which 3736 are kept as prefixes of interest. Removing 70 places using SCC suffix rule.23 ms
Discarding 70 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 79 ms. Remains 3736 /3806 variables (removed 70) and now considering 506/506 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 90 ms. Remains : 3736/3806 places, 506/506 transitions.
RANDOM walk for 40000 steps (1067 resets) in 598 ms. (66 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (22 resets) in 3178 ms. (12 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (32 resets) in 1107 ms. (36 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (43 resets) in 5416 ms. (7 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (34 resets) in 1222 ms. (32 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 929180 steps, run timeout after 9001 ms. (steps per millisecond=103 ) properties seen :0 out of 4
Probabilistic random walk after 929180 steps, saw 139217 distinct states, run finished after 9001 ms. (steps per millisecond=103 ) properties seen :0
// Phase 1: matrix 506 rows 3736 cols
[2024-06-01 05:28:19] [INFO ] Computed 3232 invariants in 149 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3736 variables, 3232/3232 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/3736 variables, 0/3232 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem QuasiCertifProtocol-COL-32-ReachabilityFireability-2024-00 is UNSAT
FORMULA QuasiCertifProtocol-COL-32-ReachabilityFireability-2024-00 FALSE TECHNIQUES SMT_REFINEMENT
Problem QuasiCertifProtocol-COL-32-ReachabilityFireability-2024-01 is UNSAT
FORMULA QuasiCertifProtocol-COL-32-ReachabilityFireability-2024-01 FALSE TECHNIQUES SMT_REFINEMENT
Problem QuasiCertifProtocol-COL-32-ReachabilityFireability-2024-05 is UNSAT
FORMULA QuasiCertifProtocol-COL-32-ReachabilityFireability-2024-05 TRUE TECHNIQUES SMT_REFINEMENT
Problem QuasiCertifProtocol-COL-32-ReachabilityFireability-2024-09 is UNSAT
FORMULA QuasiCertifProtocol-COL-32-ReachabilityFireability-2024-09 FALSE TECHNIQUES SMT_REFINEMENT
After SMT solving in domain Real declared 4242/4242 variables, and 6968 constraints, problems are : Problem set: 4 solved, 0 unsolved in 6588 ms.
Refiners :[Generalized P Invariants (flows): 3232/3232 constraints, State Equation: 3736/3736 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 10429ms problems are : Problem set: 4 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
All properties solved without resorting to model-checking.
Total runtime 73781 ms.
ITS solved all properties within timeout

BK_STOP 1717219710150

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -timeout 360 -rebuildPNML

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="QuasiCertifProtocol-COL-32"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="ltsminxred"
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-5568"
echo " Executing tool ltsminxred"
echo " Input is QuasiCertifProtocol-COL-32, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r520-tall-171662337700055"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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