fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r298-tall-167873951600359
Last Updated
May 14, 2023

About the Execution of Marcie+red for PolyORBLF-COL-S02J04T08

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
6921.607 3600000.00 3635407.00 10317.60 FFTTTFTTTFFFTTFF normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r298-tall-167873951600359.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool marciexred
Input is PolyORBLF-COL-S02J04T08, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r298-tall-167873951600359
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 688K
-rw-r--r-- 1 mcc users 7.2K Feb 26 13:46 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K Feb 26 13:46 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Feb 26 13:44 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Feb 26 13:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.4K Feb 25 16:34 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 16:34 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Feb 25 16:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:34 LTLFireability.xml
-rw-r--r-- 1 mcc users 19K Feb 26 13:51 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 172K Feb 26 13:51 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 26 13:49 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 93K Feb 26 13:49 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Feb 25 16:34 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Feb 25 16:34 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_pt
-rw-r--r-- 1 mcc users 10 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 154K Mar 5 18:23 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 PolyORBLF-COL-S02J04T08-ReachabilityFireability-00
FORMULA_NAME PolyORBLF-COL-S02J04T08-ReachabilityFireability-01
FORMULA_NAME PolyORBLF-COL-S02J04T08-ReachabilityFireability-02
FORMULA_NAME PolyORBLF-COL-S02J04T08-ReachabilityFireability-03
FORMULA_NAME PolyORBLF-COL-S02J04T08-ReachabilityFireability-04
FORMULA_NAME PolyORBLF-COL-S02J04T08-ReachabilityFireability-05
FORMULA_NAME PolyORBLF-COL-S02J04T08-ReachabilityFireability-06
FORMULA_NAME PolyORBLF-COL-S02J04T08-ReachabilityFireability-07
FORMULA_NAME PolyORBLF-COL-S02J04T08-ReachabilityFireability-08
FORMULA_NAME PolyORBLF-COL-S02J04T08-ReachabilityFireability-09
FORMULA_NAME PolyORBLF-COL-S02J04T08-ReachabilityFireability-10
FORMULA_NAME PolyORBLF-COL-S02J04T08-ReachabilityFireability-11
FORMULA_NAME PolyORBLF-COL-S02J04T08-ReachabilityFireability-12
FORMULA_NAME PolyORBLF-COL-S02J04T08-ReachabilityFireability-13
FORMULA_NAME PolyORBLF-COL-S02J04T08-ReachabilityFireability-14
FORMULA_NAME PolyORBLF-COL-S02J04T08-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1679520105972

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=marciexred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-COL-S02J04T08
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-22 21:21:47] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-22 21:21:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 21:21:47] [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.
[2023-03-22 21:21:47] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-22 21:21:48] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 766 ms
[2023-03-22 21:21:48] [INFO ] Imported 81 HL places and 65 HL transitions for a total of 614 PT places and 1300.0 transition bindings in 21 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 20 ms.
Working with output stream class java.io.PrintStream
[2023-03-22 21:21:48] [INFO ] Built PT skeleton of HLPN with 81 places and 65 transitions 254 arcs in 4 ms.
[2023-03-22 21:21:48] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
All 16 properties of the HLPN use transition enablings in a way that makes the skeleton too coarse.
Transition T_2315 forces synchronizations/join behavior on parameter t of sort Threads
Transition GoPerformWork forces synchronizations/join behavior on parameter j of sort Jobs
Transition T_0376 forces synchronizations/join behavior on parameter s of sort Sources
[2023-03-22 21:21:48] [INFO ] Unfolded HLPN to a Petri net with 614 places and 1242 transitions 5732 arcs in 34 ms.
[2023-03-22 21:21:48] [INFO ] Unfolded 16 HLPN properties in 7 ms.
[2023-03-22 21:21:48] [INFO ] Reduced 32 identical enabling conditions.
[2023-03-22 21:21:48] [INFO ] Reduced 8 identical enabling conditions.
[2023-03-22 21:21:48] [INFO ] Reduced 88 identical enabling conditions.
[2023-03-22 21:21:48] [INFO ] Reduced 88 identical enabling conditions.
[2023-03-22 21:21:48] [INFO ] Reduced 88 identical enabling conditions.
[2023-03-22 21:21:48] [INFO ] Reduced 88 identical enabling conditions.
[2023-03-22 21:21:48] [INFO ] Reduced 88 identical enabling conditions.
[2023-03-22 21:21:48] [INFO ] Reduced 8 identical enabling conditions.
Ensure Unique test removed 128 transitions
Reduce redundant transitions removed 128 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 566 ms. (steps per millisecond=17 ) properties (out of 16) seen :10
FORMULA PolyORBLF-COL-S02J04T08-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-COL-S02J04T08-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-COL-S02J04T08-ReachabilityFireability-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-COL-S02J04T08-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-COL-S02J04T08-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-COL-S02J04T08-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-COL-S02J04T08-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-COL-S02J04T08-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-COL-S02J04T08-ReachabilityFireability-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-COL-S02J04T08-ReachabilityFireability-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 264 ms. (steps per millisecond=37 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 481 ms. (steps per millisecond=20 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 171 ms. (steps per millisecond=58 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 212 ms. (steps per millisecond=47 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 247 ms. (steps per millisecond=40 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 125 ms. (steps per millisecond=80 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2023-03-22 21:21:50] [INFO ] Flow matrix only has 1098 transitions (discarded 16 similar events)
// Phase 1: matrix 1098 rows 614 cols
[2023-03-22 21:21:50] [INFO ] Computed 50 place invariants in 64 ms
[2023-03-22 21:21:52] [INFO ] [Real]Absence check using 14 positive place invariants in 16 ms returned sat
[2023-03-22 21:21:52] [INFO ] [Real]Absence check using 14 positive and 36 generalized place invariants in 32 ms returned sat
[2023-03-22 21:21:52] [INFO ] After 571ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:5
[2023-03-22 21:21:53] [INFO ] [Nat]Absence check using 14 positive place invariants in 15 ms returned sat
[2023-03-22 21:21:53] [INFO ] [Nat]Absence check using 14 positive and 36 generalized place invariants in 28 ms returned sat
[2023-03-22 21:22:07] [INFO ] After 14301ms SMT Verify possible using state equation in natural domain returned unsat :4 sat :1
[2023-03-22 21:22:07] [INFO ] State equation strengthened by 96 read => feed constraints.
[2023-03-22 21:22:07] [INFO ] After 523ms SMT Verify possible using 96 Read/Feed constraints in natural domain returned unsat :4 sat :1
[2023-03-22 21:22:09] [INFO ] Deduced a trap composed of 66 places in 76 ms of which 5 ms to minimize.
[2023-03-22 21:22:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1069 ms
[2023-03-22 21:22:10] [INFO ] After 3154ms SMT Verify possible using trap constraints in natural domain returned unsat :4 sat :1
Attempting to minimize the solution found.
Minimization took 692 ms.
[2023-03-22 21:22:11] [INFO ] After 18452ms SMT Verify possible using all constraints in natural domain returned unsat :4 sat :1
FORMULA PolyORBLF-COL-S02J04T08-ReachabilityFireability-10 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA PolyORBLF-COL-S02J04T08-ReachabilityFireability-09 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA PolyORBLF-COL-S02J04T08-ReachabilityFireability-05 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA PolyORBLF-COL-S02J04T08-ReachabilityFireability-02 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 6 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 21 ms.
Support contains 210 out of 614 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 614/614 places, 1114/1114 transitions.
Ensure Unique test removed 2 places
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 612 transition count 1106
Reduce places removed 8 places and 0 transitions.
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Iterating post reduction 1 with 24 rules applied. Total rules applied 34 place count 604 transition count 1090
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 2 with 16 rules applied. Total rules applied 50 place count 588 transition count 1090
Performed 64 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 64 Pre rules applied. Total rules applied 50 place count 588 transition count 1026
Deduced a syphon composed of 64 places in 2 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 3 with 128 rules applied. Total rules applied 178 place count 524 transition count 1026
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 186 place count 516 transition count 1018
Iterating global reduction 3 with 8 rules applied. Total rules applied 194 place count 516 transition count 1018
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 210 place count 508 transition count 1010
Applied a total of 210 rules in 146 ms. Remains 508 /614 variables (removed 106) and now considering 1010/1114 (removed 104) transitions.
[2023-03-22 21:22:11] [INFO ] Flow matrix only has 994 transitions (discarded 16 similar events)
// Phase 1: matrix 994 rows 508 cols
[2023-03-22 21:22:11] [INFO ] Computed 48 place invariants in 31 ms
[2023-03-22 21:22:11] [INFO ] Dead Transitions using invariants and state equation in 526 ms found 88 transitions.
Found 88 dead transitions using SMT.
Drop transitions removed 88 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 88 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 508/614 places, 922/1114 transitions.
Reduce places removed 1 places and 16 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 507 transition count 906
Reduce places removed 16 places and 16 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 17 place count 491 transition count 890
Deduced a syphon composed of 1 places in 1 ms
Applied a total of 17 rules in 30 ms. Remains 491 /508 variables (removed 17) and now considering 890/922 (removed 32) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 705 ms. Remains : 491/614 places, 890/1114 transitions.
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
FORMULA PolyORBLF-COL-S02J04T08-ReachabilityFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S02J04T08-ReachabilityFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
All properties solved without resorting to model-checking.
Total runtime 24658 ms.
timeout --kill-after=10s --signal=SIGINT 1m for testing only

Marcie built on Linux at 2019-11-18.
A model checker for Generalized Stochastic Petri nets

authors: Alex Tovchigrechko (IDD package and CTL model checking)

Martin Schwarick (Symbolic numerical analysis and CSL model checking)

Christian Rohr (Simulative and approximative numerical model checking)

marcie@informatik.tu-cottbus.de

called as: /home/mcc/BenchKit/bin//../reducer/bin//../../marcie/bin/marcie --net-file=model.pnml --mcc-file=ReachabilityFireability.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Unfolding complete |P|=614|T|=1242|A|=6468
Time for unfolding: 0m 4.798sec

Net: PolyORBLF_COL_S02J04T08
(NrP: 614 NrTr: 1242 NrArc: 5732)

parse formulas
formulas created successfully
place and transition orderings generation:0m 0.087sec

net check time: 0m 0.003sec

init dd package: 0m 2.695sec

TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 9225628 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16099064 kB

BK_TIME_CONFINEMENT_REACHED

--------------------
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.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -timeout 360 -rebuildPNML
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok


initing FirstDep: 0m 0.008sec

28622 150097 197330 220910 233186 593546 677803 702774 722807 1236209 1449976 1544453 1557673 1696991

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="PolyORBLF-COL-S02J04T08"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="marciexred"
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-5348"
echo " Executing tool marciexred"
echo " Input is PolyORBLF-COL-S02J04T08, 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 r298-tall-167873951600359"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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