Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r472-tajo-171620398600030.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.........................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is BridgeAndVehicles-COL-V20P10N20, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r472-tajo-171620398600030
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 504K
-rw-r--r-- 1 mcc users 8.3K Apr 13 02:12 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K Apr 13 02:12 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Apr 13 02:09 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Apr 13 02:09 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.2K Apr 22 14:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 22 14:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Apr 22 14:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 13 02:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 118K Apr 13 02:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 13 02:28 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 72K Apr 13 02:28 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 22 14:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Apr 22 14:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:42 equiv_pt
-rw-r--r-- 1 mcc users 10 May 18 16:42 instance
-rw-r--r-- 1 mcc users 5 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 40K May 18 16: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 BridgeAndVehicles-COL-V20P10N20-ReachabilityCardinality-2024-00
FORMULA_NAME BridgeAndVehicles-COL-V20P10N20-ReachabilityCardinality-2024-01
FORMULA_NAME BridgeAndVehicles-COL-V20P10N20-ReachabilityCardinality-2024-02
FORMULA_NAME BridgeAndVehicles-COL-V20P10N20-ReachabilityCardinality-2024-03
FORMULA_NAME BridgeAndVehicles-COL-V20P10N20-ReachabilityCardinality-2024-04
FORMULA_NAME BridgeAndVehicles-COL-V20P10N20-ReachabilityCardinality-2024-05
FORMULA_NAME BridgeAndVehicles-COL-V20P10N20-ReachabilityCardinality-2024-06
FORMULA_NAME BridgeAndVehicles-COL-V20P10N20-ReachabilityCardinality-2024-07
FORMULA_NAME BridgeAndVehicles-COL-V20P10N20-ReachabilityCardinality-2024-08
FORMULA_NAME BridgeAndVehicles-COL-V20P10N20-ReachabilityCardinality-2024-09
FORMULA_NAME BridgeAndVehicles-COL-V20P10N20-ReachabilityCardinality-2024-10
FORMULA_NAME BridgeAndVehicles-COL-V20P10N20-ReachabilityCardinality-2024-11
FORMULA_NAME BridgeAndVehicles-COL-V20P10N20-ReachabilityCardinality-2024-12
FORMULA_NAME BridgeAndVehicles-COL-V20P10N20-ReachabilityCardinality-2024-13
FORMULA_NAME BridgeAndVehicles-COL-V20P10N20-ReachabilityCardinality-2024-14
FORMULA_NAME BridgeAndVehicles-COL-V20P10N20-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717217844635

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BridgeAndVehicles-COL-V20P10N20
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 04:57:26] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 04:57:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 04:57:26] [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 04:57:26] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-06-01 04:57:26] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 607 ms
[2024-06-01 04:57:26] [INFO ] Imported 15 HL places and 11 HL transitions for a total of 78 PT places and 37258.0 transition bindings in 19 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 26 ms.
Working with output stream class java.io.PrintStream
[2024-06-01 04:57:26] [INFO ] Built PT skeleton of HLPN with 15 places and 11 transitions 56 arcs in 4 ms.
[2024-06-01 04:57:26] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Remains 16 properties that can be checked using skeleton over-approximation.
Reduce places removed 3 places and 0 transitions.
Computed a total of 9 stabilizing places and 6 stable transitions
Graph (complete) has 22 edges and 12 vertex of which 10 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
RANDOM walk for 40000 steps (8 resets) in 2515 ms. (15 steps per ms) remains 11/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 390 ms. (102 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 355 ms. (112 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40000 steps (8 resets) in 154 ms. (258 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (8 resets) in 256 ms. (155 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 195 ms. (204 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (8 resets) in 113 ms. (350 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40001 steps (8 resets) in 242 ms. (164 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40001 steps (8 resets) in 138 ms. (287 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (8 resets) in 149 ms. (266 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (8 resets) in 293 ms. (136 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40001 steps (8 resets) in 93 ms. (425 steps per ms) remains 11/11 properties
// Phase 1: matrix 10 rows 12 cols
[2024-06-01 04:57:28] [INFO ] Computed 4 invariants in 3 ms
Problem BridgeAndVehicles-COL-V20P10N20-ReachabilityCardinality-2024-00 is UNSAT
Problem BridgeAndVehicles-COL-V20P10N20-ReachabilityCardinality-2024-04 is UNSAT
Problem BridgeAndVehicles-COL-V20P10N20-ReachabilityCardinality-2024-05 is UNSAT
Problem BridgeAndVehicles-COL-V20P10N20-ReachabilityCardinality-2024-06 is UNSAT
Problem BridgeAndVehicles-COL-V20P10N20-ReachabilityCardinality-2024-08 is UNSAT
Problem BridgeAndVehicles-COL-V20P10N20-ReachabilityCardinality-2024-09 is UNSAT
Problem BridgeAndVehicles-COL-V20P10N20-ReachabilityCardinality-2024-10 is UNSAT
Problem BridgeAndVehicles-COL-V20P10N20-ReachabilityCardinality-2024-11 is UNSAT
Problem BridgeAndVehicles-COL-V20P10N20-ReachabilityCardinality-2024-12 is UNSAT
Problem BridgeAndVehicles-COL-V20P10N20-ReachabilityCardinality-2024-15 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 4/4 constraints. Problems are: Problem set: 10 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/12 variables, 0/4 constraints. Problems are: Problem set: 10 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 10/22 variables, 12/16 constraints. Problems are: Problem set: 10 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/22 variables, 0/16 constraints. Problems are: Problem set: 10 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 0/22 variables, 0/16 constraints. Problems are: Problem set: 10 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 22/22 variables, and 16 constraints, problems are : Problem set: 10 solved, 1 unsolved in 212 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 12/12 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 10 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 3/3 constraints. Problems are: Problem set: 10 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/11 variables, 0/3 constraints. Problems are: Problem set: 10 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 1/12 variables, 1/4 constraints. Problems are: Problem set: 10 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/12 variables, 0/4 constraints. Problems are: Problem set: 10 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 10/22 variables, 12/16 constraints. Problems are: Problem set: 10 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/22 variables, 1/17 constraints. Problems are: Problem set: 10 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/22 variables, 0/17 constraints. Problems are: Problem set: 10 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/22 variables, 0/17 constraints. Problems are: Problem set: 10 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 22/22 variables, and 17 constraints, problems are : Problem set: 10 solved, 1 unsolved in 84 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 12/12 constraints, PredecessorRefiner: 1/11 constraints, Known Traps: 0/0 constraints]
After SMT, in 362ms problems are : Problem set: 10 solved, 1 unsolved
Parikh walk visited 0 properties in 15 ms.
Support contains 11 out of 12 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 12/12 places, 10/10 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 12 transition count 9
Applied a total of 1 rules in 13 ms. Remains 12 /12 variables (removed 0) and now considering 9/10 (removed 1) transitions.
Running 6 sub problems to find dead transitions.
// Phase 1: matrix 9 rows 12 cols
[2024-06-01 04:57:29] [INFO ] Computed 4 invariants in 1 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 5/12 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/12 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 9/21 variables, 12/16 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/21 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/21 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 21/21 variables, and 16 constraints, problems are : Problem set: 0 solved, 6 unsolved in 250 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 12/12 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 5/12 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/12 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 9/21 variables, 12/16 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/21 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/21 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/21 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 21/21 variables, and 22 constraints, problems are : Problem set: 0 solved, 6 unsolved in 74 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 12/12 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 328ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 329ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 356 ms. Remains : 12/12 places, 9/10 transitions.
RANDOM walk for 40000 steps (8 resets) in 112 ms. (353 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 66 ms. (597 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 1307 steps, run visited all 1 properties in 17 ms. (steps per millisecond=76 )
Probabilistic random walk after 1307 steps, saw 677 distinct states, run finished after 22 ms. (steps per millisecond=59 ) properties seen :1
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
[2024-06-01 04:57:29] [INFO ] Flatten gal took : 12 ms
[2024-06-01 04:57:29] [INFO ] Flatten gal took : 2 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 BridgeAndVehicles-COL-V20P10N20-ReachabilityCardinality-2024-00 FALSE TECHNIQUES CPN_APPROX
FORMULA BridgeAndVehicles-COL-V20P10N20-ReachabilityCardinality-2024-04 FALSE TECHNIQUES CPN_APPROX
FORMULA BridgeAndVehicles-COL-V20P10N20-ReachabilityCardinality-2024-05 TRUE TECHNIQUES CPN_APPROX
FORMULA BridgeAndVehicles-COL-V20P10N20-ReachabilityCardinality-2024-06 TRUE TECHNIQUES CPN_APPROX
FORMULA BridgeAndVehicles-COL-V20P10N20-ReachabilityCardinality-2024-07 FALSE TECHNIQUES CPN_APPROX
FORMULA BridgeAndVehicles-COL-V20P10N20-ReachabilityCardinality-2024-08 TRUE TECHNIQUES CPN_APPROX
FORMULA BridgeAndVehicles-COL-V20P10N20-ReachabilityCardinality-2024-09 FALSE TECHNIQUES CPN_APPROX
FORMULA BridgeAndVehicles-COL-V20P10N20-ReachabilityCardinality-2024-10 FALSE TECHNIQUES CPN_APPROX
FORMULA BridgeAndVehicles-COL-V20P10N20-ReachabilityCardinality-2024-11 FALSE TECHNIQUES CPN_APPROX
FORMULA BridgeAndVehicles-COL-V20P10N20-ReachabilityCardinality-2024-12 TRUE TECHNIQUES CPN_APPROX
FORMULA BridgeAndVehicles-COL-V20P10N20-ReachabilityCardinality-2024-13 FALSE TECHNIQUES CPN_APPROX
FORMULA BridgeAndVehicles-COL-V20P10N20-ReachabilityCardinality-2024-14 FALSE TECHNIQUES CPN_APPROX
FORMULA BridgeAndVehicles-COL-V20P10N20-ReachabilityCardinality-2024-15 FALSE TECHNIQUES CPN_APPROX
Arc [13:1*[(MOD (ADD $cpt 1) 21)]] contains successor/predecessor on variables of sort compteur
Arc [1:1*[(MOD (ADD $cA 1) 21)]] contains successor/predecessor on variables of sort voitureA
Arc [6:1*[(MOD (ADD (MOD (MINUS $cB 1) 21) 21) 21)]] contains successor/predecessor on variables of sort voitureB
Arc [14:1*[(MOD (ADD $s 1) 2)]] contains successor/predecessor on variables of sort sens
[2024-06-01 04:57:29] [INFO ] Unfolded HLPN to a Petri net with 78 places and 968 transitions 7350 arcs in 53 ms.
[2024-06-01 04:57:29] [INFO ] Unfolded 16 HLPN properties in 2 ms.
RANDOM walk for 40000 steps (228 resets) in 962 ms. (41 steps per ms) remains 1/3 properties
FORMULA BridgeAndVehicles-COL-V20P10N20-ReachabilityCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-COL-V20P10N20-ReachabilityCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 1676 steps (0 resets) in 15 ms. (104 steps per ms) remains 0/1 properties
FORMULA BridgeAndVehicles-COL-V20P10N20-ReachabilityCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
All properties solved without resorting to model-checking.
Total runtime 4031 ms.
ITS solved all properties within timeout

BK_STOP 1717217850176

--------------------
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 ReachabilityCardinality -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="BridgeAndVehicles-COL-V20P10N20"
export BK_EXAMINATION="ReachabilityCardinality"
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 BridgeAndVehicles-COL-V20P10N20, 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 r472-tajo-171620398600030"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BridgeAndVehicles-COL-V20P10N20.tgz
mv BridgeAndVehicles-COL-V20P10N20 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 ;