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.r170-tall-167838856700070.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 Echo-PT-d02r15, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r170-tall-167838856700070
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.4M
-rw-r--r-- 1 mcc users 9.5K Feb 25 14:09 CTLCardinality.txt
-rw-r--r-- 1 mcc users 112K Feb 25 14:09 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K Feb 25 14:08 CTLFireability.txt
-rw-r--r-- 1 mcc users 39K Feb 25 14:08 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.9K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:03 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:03 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:03 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:03 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.6K Feb 25 14:12 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 101K Feb 25 14:12 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Feb 25 14:11 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 40K Feb 25 14:11 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:03 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:03 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 917K Mar 5 18:22 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 Echo-PT-d02r15-ReachabilityCardinality-00
FORMULA_NAME Echo-PT-d02r15-ReachabilityCardinality-01
FORMULA_NAME Echo-PT-d02r15-ReachabilityCardinality-02
FORMULA_NAME Echo-PT-d02r15-ReachabilityCardinality-03
FORMULA_NAME Echo-PT-d02r15-ReachabilityCardinality-04
FORMULA_NAME Echo-PT-d02r15-ReachabilityCardinality-05
FORMULA_NAME Echo-PT-d02r15-ReachabilityCardinality-06
FORMULA_NAME Echo-PT-d02r15-ReachabilityCardinality-07
FORMULA_NAME Echo-PT-d02r15-ReachabilityCardinality-08
FORMULA_NAME Echo-PT-d02r15-ReachabilityCardinality-09
FORMULA_NAME Echo-PT-d02r15-ReachabilityCardinality-10
FORMULA_NAME Echo-PT-d02r15-ReachabilityCardinality-11
FORMULA_NAME Echo-PT-d02r15-ReachabilityCardinality-12
FORMULA_NAME Echo-PT-d02r15-ReachabilityCardinality-13
FORMULA_NAME Echo-PT-d02r15-ReachabilityCardinality-14
FORMULA_NAME Echo-PT-d02r15-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678470651995

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=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Echo-PT-d02r15
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-10 17:50:53] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-10 17:50:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-10 17:50:53] [INFO ] Load time of PNML (sax parser for PT used): 144 ms
[2023-03-10 17:50:53] [INFO ] Transformed 2127 places.
[2023-03-10 17:50:53] [INFO ] Transformed 1674 transitions.
[2023-03-10 17:50:53] [INFO ] Found NUPN structural information;
[2023-03-10 17:50:53] [INFO ] Parsed PT model containing 2127 places and 1674 transitions and 9700 arcs in 234 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 14 ms.
Working with output stream class java.io.PrintStream
FORMULA Echo-PT-d02r15-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Echo-PT-d02r15-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Echo-PT-d02r15-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Echo-PT-d02r15-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Echo-PT-d02r15-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Echo-PT-d02r15-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 22 resets, run finished after 383 ms. (steps per millisecond=26 ) properties (out of 10) seen :9
FORMULA Echo-PT-d02r15-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Echo-PT-d02r15-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Echo-PT-d02r15-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Echo-PT-d02r15-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Echo-PT-d02r15-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Echo-PT-d02r15-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Echo-PT-d02r15-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Echo-PT-d02r15-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Echo-PT-d02r15-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1674 rows 2127 cols
[2023-03-10 17:50:54] [INFO ] Computed 1065 place invariants in 138 ms
[2023-03-10 17:50:55] [INFO ] After 534ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-10 17:50:55] [INFO ] [Nat]Absence check using 82 positive place invariants in 26 ms returned sat
[2023-03-10 17:50:56] [INFO ] [Nat]Absence check using 82 positive and 983 generalized place invariants in 334 ms returned sat
[2023-03-10 17:50:57] [INFO ] After 1160ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-10 17:50:57] [INFO ] Deduced a trap composed of 13 places in 592 ms of which 9 ms to minimize.
[2023-03-10 17:50:58] [INFO ] Deduced a trap composed of 16 places in 549 ms of which 2 ms to minimize.
[2023-03-10 17:50:59] [INFO ] Deduced a trap composed of 10 places in 548 ms of which 2 ms to minimize.
[2023-03-10 17:50:59] [INFO ] Deduced a trap composed of 16 places in 562 ms of which 3 ms to minimize.
[2023-03-10 17:51:00] [INFO ] Deduced a trap composed of 14 places in 498 ms of which 2 ms to minimize.
[2023-03-10 17:51:01] [INFO ] Deduced a trap composed of 14 places in 500 ms of which 2 ms to minimize.
[2023-03-10 17:51:01] [INFO ] Deduced a trap composed of 13 places in 522 ms of which 1 ms to minimize.
[2023-03-10 17:51:02] [INFO ] Deduced a trap composed of 15 places in 532 ms of which 1 ms to minimize.
[2023-03-10 17:51:02] [INFO ] Deduced a trap composed of 15 places in 489 ms of which 1 ms to minimize.
[2023-03-10 17:51:03] [INFO ] Deduced a trap composed of 12 places in 535 ms of which 2 ms to minimize.
[2023-03-10 17:51:04] [INFO ] Deduced a trap composed of 11 places in 540 ms of which 1 ms to minimize.
[2023-03-10 17:51:04] [INFO ] Deduced a trap composed of 12 places in 533 ms of which 1 ms to minimize.
[2023-03-10 17:51:05] [INFO ] Deduced a trap composed of 19 places in 521 ms of which 1 ms to minimize.
[2023-03-10 17:51:06] [INFO ] Deduced a trap composed of 14 places in 530 ms of which 1 ms to minimize.
[2023-03-10 17:51:06] [INFO ] Deduced a trap composed of 13 places in 417 ms of which 1 ms to minimize.
[2023-03-10 17:51:07] [INFO ] Deduced a trap composed of 17 places in 426 ms of which 1 ms to minimize.
[2023-03-10 17:51:07] [INFO ] Deduced a trap composed of 14 places in 437 ms of which 1 ms to minimize.
[2023-03-10 17:51:08] [INFO ] Deduced a trap composed of 12 places in 421 ms of which 1 ms to minimize.
[2023-03-10 17:51:08] [INFO ] Deduced a trap composed of 15 places in 419 ms of which 1 ms to minimize.
[2023-03-10 17:51:09] [INFO ] Deduced a trap composed of 21 places in 402 ms of which 1 ms to minimize.
[2023-03-10 17:51:09] [INFO ] Deduced a trap composed of 24 places in 384 ms of which 1 ms to minimize.
[2023-03-10 17:51:09] [INFO ] Deduced a trap composed of 13 places in 379 ms of which 1 ms to minimize.
[2023-03-10 17:51:10] [INFO ] Deduced a trap composed of 16 places in 414 ms of which 1 ms to minimize.
[2023-03-10 17:51:10] [INFO ] Deduced a trap composed of 16 places in 411 ms of which 1 ms to minimize.
[2023-03-10 17:51:11] [INFO ] Deduced a trap composed of 14 places in 403 ms of which 1 ms to minimize.
[2023-03-10 17:51:11] [INFO ] Deduced a trap composed of 10 places in 381 ms of which 2 ms to minimize.
[2023-03-10 17:51:12] [INFO ] Deduced a trap composed of 26 places in 392 ms of which 1 ms to minimize.
[2023-03-10 17:51:12] [INFO ] Deduced a trap composed of 10 places in 372 ms of which 1 ms to minimize.
[2023-03-10 17:51:13] [INFO ] Deduced a trap composed of 11 places in 356 ms of which 1 ms to minimize.
[2023-03-10 17:51:13] [INFO ] Deduced a trap composed of 17 places in 369 ms of which 1 ms to minimize.
[2023-03-10 17:51:14] [INFO ] Deduced a trap composed of 11 places in 369 ms of which 1 ms to minimize.
[2023-03-10 17:51:14] [INFO ] Deduced a trap composed of 13 places in 367 ms of which 1 ms to minimize.
[2023-03-10 17:51:15] [INFO ] Deduced a trap composed of 17 places in 350 ms of which 1 ms to minimize.
[2023-03-10 17:51:15] [INFO ] Deduced a trap composed of 16 places in 379 ms of which 3 ms to minimize.
[2023-03-10 17:51:15] [INFO ] Deduced a trap composed of 12 places in 348 ms of which 1 ms to minimize.
[2023-03-10 17:51:16] [INFO ] Deduced a trap composed of 18 places in 414 ms of which 1 ms to minimize.
[2023-03-10 17:51:16] [INFO ] Deduced a trap composed of 29 places in 399 ms of which 1 ms to minimize.
[2023-03-10 17:51:17] [INFO ] Deduced a trap composed of 12 places in 401 ms of which 1 ms to minimize.
[2023-03-10 17:51:17] [INFO ] Deduced a trap composed of 14 places in 410 ms of which 1 ms to minimize.
[2023-03-10 17:51:18] [INFO ] Deduced a trap composed of 14 places in 398 ms of which 2 ms to minimize.
[2023-03-10 17:51:18] [INFO ] Deduced a trap composed of 14 places in 403 ms of which 1 ms to minimize.
[2023-03-10 17:51:19] [INFO ] Deduced a trap composed of 13 places in 392 ms of which 1 ms to minimize.
[2023-03-10 17:51:19] [INFO ] Deduced a trap composed of 10 places in 407 ms of which 1 ms to minimize.
[2023-03-10 17:51:20] [INFO ] Deduced a trap composed of 19 places in 408 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:902)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-10 17:51:20] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-10 17:51:20] [INFO ] After 25375ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 12 ms.
Support contains 11 out of 2127 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2127/2127 places, 1674/1674 transitions.
Graph (complete) has 7362 edges and 2127 vertex of which 1894 are kept as prefixes of interest. Removing 233 places using SCC suffix rule.10 ms
Discarding 233 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 1894 transition count 1669
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 6 place count 1893 transition count 1668
Applied a total of 6 rules in 339 ms. Remains 1893 /2127 variables (removed 234) and now considering 1668/1674 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 340 ms. Remains : 1893/2127 places, 1668/1674 transitions.
Finished random walk after 3735 steps, including 8 resets, run visited all 1 properties in 58 ms. (steps per millisecond=64 )
FORMULA Echo-PT-d02r15-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 27404 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=ReachabilityCardinality.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: Echo_PT_d02r15
(NrP: 2127 NrTr: 1674 NrArc: 9700)

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

net check time: 0m 0.002sec

init dd package: 0m 2.750sec

TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393232 kB
MemFree: 6485060 kB
After kill :
MemTotal: 16393232 kB
MemFree: 16101724 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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -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.026sec

915867 1616917 2561244

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="Echo-PT-d02r15"
export BK_EXAMINATION="ReachabilityCardinality"
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 Echo-PT-d02r15, 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 r170-tall-167838856700070"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Echo-PT-d02r15.tgz
mv Echo-PT-d02r15 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 ;