Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r425-tajo-167905977800142.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
..............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is ShieldRVs-PT-040B, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r425-tajo-167905977800142
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1012K
-rw-r--r-- 1 mcc users 8.5K Feb 26 18:23 CTLCardinality.txt
-rw-r--r-- 1 mcc users 97K Feb 26 18:23 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Feb 26 18:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K Feb 26 18:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 17:02 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 17:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 17:02 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 17:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 26 18:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 144K Feb 26 18:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.4K Feb 26 18:23 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 72K Feb 26 18:23 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:02 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:02 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 498K 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 ShieldRVs-PT-040B-ReachabilityCardinality-00
FORMULA_NAME ShieldRVs-PT-040B-ReachabilityCardinality-01
FORMULA_NAME ShieldRVs-PT-040B-ReachabilityCardinality-02
FORMULA_NAME ShieldRVs-PT-040B-ReachabilityCardinality-03
FORMULA_NAME ShieldRVs-PT-040B-ReachabilityCardinality-04
FORMULA_NAME ShieldRVs-PT-040B-ReachabilityCardinality-05
FORMULA_NAME ShieldRVs-PT-040B-ReachabilityCardinality-06
FORMULA_NAME ShieldRVs-PT-040B-ReachabilityCardinality-07
FORMULA_NAME ShieldRVs-PT-040B-ReachabilityCardinality-08
FORMULA_NAME ShieldRVs-PT-040B-ReachabilityCardinality-09
FORMULA_NAME ShieldRVs-PT-040B-ReachabilityCardinality-10
FORMULA_NAME ShieldRVs-PT-040B-ReachabilityCardinality-11
FORMULA_NAME ShieldRVs-PT-040B-ReachabilityCardinality-12
FORMULA_NAME ShieldRVs-PT-040B-ReachabilityCardinality-13
FORMULA_NAME ShieldRVs-PT-040B-ReachabilityCardinality-14
FORMULA_NAME ShieldRVs-PT-040B-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1679300419840

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=ltsminxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldRVs-PT-040B
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-20 08:20:22] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-20 08:20:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 08:20:22] [INFO ] Load time of PNML (sax parser for PT used): 121 ms
[2023-03-20 08:20:22] [INFO ] Transformed 1603 places.
[2023-03-20 08:20:22] [INFO ] Transformed 1803 transitions.
[2023-03-20 08:20:22] [INFO ] Found NUPN structural information;
[2023-03-20 08:20:22] [INFO ] Parsed PT model containing 1603 places and 1803 transitions and 5760 arcs in 238 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 14 ms.
Working with output stream class java.io.PrintStream
FORMULA ShieldRVs-PT-040B-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-040B-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-040B-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-040B-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 5 resets, run finished after 427 ms. (steps per millisecond=23 ) properties (out of 12) seen :11
FORMULA ShieldRVs-PT-040B-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-040B-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-040B-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-040B-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-040B-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-040B-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-040B-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-040B-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-040B-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-040B-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-040B-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1803 rows 1603 cols
[2023-03-20 08:20:22] [INFO ] Computed 161 place invariants in 34 ms
[2023-03-20 08:20:23] [INFO ] After 604ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 08:20:24] [INFO ] [Nat]Absence check using 161 positive place invariants in 54 ms returned sat
[2023-03-20 08:20:26] [INFO ] After 2207ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 08:20:27] [INFO ] Deduced a trap composed of 23 places in 761 ms of which 6 ms to minimize.
[2023-03-20 08:20:28] [INFO ] Deduced a trap composed of 41 places in 731 ms of which 1 ms to minimize.
[2023-03-20 08:20:29] [INFO ] Deduced a trap composed of 29 places in 645 ms of which 2 ms to minimize.
[2023-03-20 08:20:29] [INFO ] Deduced a trap composed of 44 places in 445 ms of which 2 ms to minimize.
[2023-03-20 08:20:30] [INFO ] Deduced a trap composed of 40 places in 460 ms of which 1 ms to minimize.
[2023-03-20 08:20:31] [INFO ] Deduced a trap composed of 27 places in 781 ms of which 2 ms to minimize.
[2023-03-20 08:20:32] [INFO ] Deduced a trap composed of 19 places in 727 ms of which 3 ms to minimize.
[2023-03-20 08:20:33] [INFO ] Deduced a trap composed of 24 places in 592 ms of which 2 ms to minimize.
[2023-03-20 08:20:33] [INFO ] Deduced a trap composed of 32 places in 691 ms of which 2 ms to minimize.
[2023-03-20 08:20:34] [INFO ] Deduced a trap composed of 22 places in 413 ms of which 1 ms to minimize.
[2023-03-20 08:20:34] [INFO ] Deduced a trap composed of 48 places in 387 ms of which 1 ms to minimize.
[2023-03-20 08:20:35] [INFO ] Deduced a trap composed of 74 places in 365 ms of which 1 ms to minimize.
[2023-03-20 08:20:35] [INFO ] Deduced a trap composed of 45 places in 387 ms of which 1 ms to minimize.
[2023-03-20 08:20:36] [INFO ] Deduced a trap composed of 28 places in 430 ms of which 1 ms to minimize.
[2023-03-20 08:20:37] [INFO ] Deduced a trap composed of 19 places in 508 ms of which 2 ms to minimize.
[2023-03-20 08:20:37] [INFO ] Deduced a trap composed of 52 places in 411 ms of which 4 ms to minimize.
[2023-03-20 08:20:38] [INFO ] Deduced a trap composed of 63 places in 524 ms of which 1 ms to minimize.
[2023-03-20 08:20:38] [INFO ] Deduced a trap composed of 41 places in 398 ms of which 1 ms to minimize.
[2023-03-20 08:20:39] [INFO ] Deduced a trap composed of 22 places in 526 ms of which 1 ms to minimize.
[2023-03-20 08:20:40] [INFO ] Deduced a trap composed of 36 places in 359 ms of which 1 ms to minimize.
[2023-03-20 08:20:40] [INFO ] Deduced a trap composed of 26 places in 351 ms of which 1 ms to minimize.
[2023-03-20 08:20:40] [INFO ] Deduced a trap composed of 22 places in 350 ms of which 1 ms to minimize.
[2023-03-20 08:20:41] [INFO ] Deduced a trap composed of 24 places in 344 ms of which 1 ms to minimize.
[2023-03-20 08:20:41] [INFO ] Deduced a trap composed of 46 places in 445 ms of which 1 ms to minimize.
[2023-03-20 08:20:42] [INFO ] Deduced a trap composed of 29 places in 519 ms of which 1 ms to minimize.
[2023-03-20 08:20:43] [INFO ] Deduced a trap composed of 25 places in 554 ms of which 1 ms to minimize.
[2023-03-20 08:20:43] [INFO ] Deduced a trap composed of 23 places in 476 ms of which 1 ms to minimize.
[2023-03-20 08:20:44] [INFO ] Deduced a trap composed of 29 places in 369 ms of which 1 ms to minimize.
[2023-03-20 08:20:44] [INFO ] Deduced a trap composed of 29 places in 498 ms of which 2 ms to minimize.
[2023-03-20 08:20:45] [INFO ] Deduced a trap composed of 42 places in 509 ms of which 1 ms to minimize.
[2023-03-20 08:20:45] [INFO ] Deduced a trap composed of 37 places in 511 ms of which 1 ms to minimize.
[2023-03-20 08:20:46] [INFO ] Deduced a trap composed of 46 places in 470 ms of which 1 ms to minimize.
[2023-03-20 08:20:47] [INFO ] Deduced a trap composed of 37 places in 453 ms of which 1 ms to minimize.
[2023-03-20 08:20:47] [INFO ] Deduced a trap composed of 27 places in 473 ms of which 6 ms to minimize.
[2023-03-20 08:20:48] [INFO ] Deduced a trap composed of 47 places in 515 ms of which 2 ms to minimize.
[2023-03-20 08:20:48] [INFO ] Deduced a trap composed of 50 places in 373 ms of which 1 ms to minimize.
[2023-03-20 08:20:49] [INFO ] Deduced a trap composed of 16 places in 786 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-20 08:20:49] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-20 08:20:49] [INFO ] After 25817ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 20 ms.
Support contains 60 out of 1603 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1603/1603 places, 1803/1803 transitions.
Drop transitions removed 147 transitions
Trivial Post-agglo rules discarded 147 transitions
Performed 147 trivial Post agglomeration. Transition count delta: 147
Iterating post reduction 0 with 147 rules applied. Total rules applied 147 place count 1603 transition count 1656
Reduce places removed 147 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 152 rules applied. Total rules applied 299 place count 1456 transition count 1651
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 304 place count 1451 transition count 1651
Performed 193 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 193 Pre rules applied. Total rules applied 304 place count 1451 transition count 1458
Deduced a syphon composed of 193 places in 4 ms
Reduce places removed 193 places and 0 transitions.
Iterating global reduction 3 with 386 rules applied. Total rules applied 690 place count 1258 transition count 1458
Discarding 264 places :
Symmetric choice reduction at 3 with 264 rule applications. Total rules 954 place count 994 transition count 1194
Iterating global reduction 3 with 264 rules applied. Total rules applied 1218 place count 994 transition count 1194
Performed 103 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 103 Pre rules applied. Total rules applied 1218 place count 994 transition count 1091
Deduced a syphon composed of 103 places in 4 ms
Reduce places removed 103 places and 0 transitions.
Iterating global reduction 3 with 206 rules applied. Total rules applied 1424 place count 891 transition count 1091
Performed 260 Post agglomeration using F-continuation condition.Transition count delta: 260
Deduced a syphon composed of 260 places in 2 ms
Reduce places removed 260 places and 0 transitions.
Iterating global reduction 3 with 520 rules applied. Total rules applied 1944 place count 631 transition count 831
Partial Free-agglomeration rule applied 72 times.
Drop transitions removed 72 transitions
Iterating global reduction 3 with 72 rules applied. Total rules applied 2016 place count 631 transition count 831
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 2017 place count 630 transition count 830
Applied a total of 2017 rules in 608 ms. Remains 630 /1603 variables (removed 973) and now considering 830/1803 (removed 973) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 609 ms. Remains : 630/1603 places, 830/1803 transitions.
Incomplete random walk after 10000 steps, including 16 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 1) seen :0
Finished Best-First random walk after 345 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=115 )
FORMULA ShieldRVs-PT-040B-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
All properties solved without resorting to model-checking.
Total runtime 28177 ms.
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --invariant=/tmp/584/inv_0_ --invariant=/tmp/584/inv_1_ --invariant=/tmp/584/inv_2_ --invariant=/tmp/584/inv_3_ --invariant=/tmp/584/inv_4_ --invariant=/tmp/584/inv_5_ --invariant=/tmp/584/inv_6_ --invariant=/tmp/584/inv_7_ --invariant=/tmp/584/inv_8_ --invariant=/tmp/584/inv_9_ --invariant=/tmp/584/inv_10_ --invariant=/tmp/584/inv_11_ --invariant=/tmp/584/inv_12_ --invariant=/tmp/584/inv_13_ --invariant=/tmp/584/inv_14_ --invariant=/tmp/584/inv_15_ --inv-par
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393356 kB
MemFree: 14144828 kB
After kill :
MemTotal: 16393356 kB
MemFree: 16097756 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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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 ReachabilityCardinality -timeout 360 -rebuildPNML
mcc2023

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="ShieldRVs-PT-040B"
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-5348"
echo " Executing tool ltsminxred"
echo " Input is ShieldRVs-PT-040B, 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 r425-tajo-167905977800142"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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