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.r409-oct2-167903727700288.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.......................
=====================================================================
Generated by BenchKit 2-5348
Executing tool smartxred
Input is ShieldPPPs-PT-020B, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r409-oct2-167903727700288
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 824K
-rw-r--r-- 1 mcc users 7.1K Feb 26 02:06 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K Feb 26 02:06 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Feb 26 02:05 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Feb 26 02:05 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:58 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 16:58 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:58 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 16:58 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 26 02:07 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 114K Feb 26 02:07 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 26 02:06 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 105K Feb 26 02:06 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:58 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:58 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 349K 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

FORMULA_NAME StableMarking

=== Now, execution of the tool begins

BK_START 1679772434568

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=smartxred
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=ShieldPPPs-PT-020B
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-25 19:27:16] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2023-03-25 19:27:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-25 19:27:16] [INFO ] Load time of PNML (sax parser for PT used): 103 ms
[2023-03-25 19:27:16] [INFO ] Transformed 1363 places.
[2023-03-25 19:27:16] [INFO ] Transformed 1263 transitions.
[2023-03-25 19:27:16] [INFO ] Found NUPN structural information;
[2023-03-25 19:27:16] [INFO ] Parsed PT model containing 1363 places and 1263 transitions and 3486 arcs in 222 ms.
Structural test allowed to assert that 544 places are NOT stable. Took 11 ms.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 690 ms. (steps per millisecond=14 ) properties (out of 819) seen :794
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 25) seen :0
Running SMT prover for 25 properties.
// Phase 1: matrix 1263 rows 1363 cols
[2023-03-25 19:27:17] [INFO ] Computed 221 place invariants in 19 ms
[2023-03-25 19:27:19] [INFO ] After 1264ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:25
[2023-03-25 19:27:20] [INFO ] [Nat]Absence check using 221 positive place invariants in 108 ms returned sat
[2023-03-25 19:27:25] [INFO ] After 3676ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :25
[2023-03-25 19:27:26] [INFO ] Deduced a trap composed of 31 places in 715 ms of which 12 ms to minimize.
[2023-03-25 19:27:26] [INFO ] Deduced a trap composed of 21 places in 401 ms of which 1 ms to minimize.
[2023-03-25 19:27:27] [INFO ] Deduced a trap composed of 28 places in 862 ms of which 1 ms to minimize.
[2023-03-25 19:27:28] [INFO ] Deduced a trap composed of 17 places in 593 ms of which 1 ms to minimize.
[2023-03-25 19:27:28] [INFO ] Deduced a trap composed of 19 places in 396 ms of which 11 ms to minimize.
[2023-03-25 19:27:29] [INFO ] Deduced a trap composed of 19 places in 572 ms of which 1 ms to minimize.
[2023-03-25 19:27:29] [INFO ] Deduced a trap composed of 35 places in 312 ms of which 1 ms to minimize.
[2023-03-25 19:27:30] [INFO ] Deduced a trap composed of 45 places in 324 ms of which 1 ms to minimize.
[2023-03-25 19:27:30] [INFO ] Deduced a trap composed of 14 places in 282 ms of which 1 ms to minimize.
[2023-03-25 19:27:30] [INFO ] Deduced a trap composed of 21 places in 227 ms of which 1 ms to minimize.
[2023-03-25 19:27:31] [INFO ] Deduced a trap composed of 19 places in 318 ms of which 1 ms to minimize.
[2023-03-25 19:27:32] [INFO ] Deduced a trap composed of 44 places in 1057 ms of which 1 ms to minimize.
[2023-03-25 19:27:32] [INFO ] Deduced a trap composed of 33 places in 315 ms of which 0 ms to minimize.
[2023-03-25 19:27:33] [INFO ] Deduced a trap composed of 22 places in 263 ms of which 0 ms to minimize.
[2023-03-25 19:27:33] [INFO ] Deduced a trap composed of 32 places in 265 ms of which 1 ms to minimize.
[2023-03-25 19:27:33] [INFO ] Deduced a trap composed of 27 places in 228 ms of which 1 ms to minimize.
[2023-03-25 19:27:34] [INFO ] Deduced a trap composed of 35 places in 492 ms of which 1 ms to minimize.
[2023-03-25 19:27:34] [INFO ] Deduced a trap composed of 32 places in 264 ms of which 1 ms to minimize.
[2023-03-25 19:27:34] [INFO ] Deduced a trap composed of 26 places in 244 ms of which 1 ms to minimize.
[2023-03-25 19:27:35] [INFO ] Deduced a trap composed of 27 places in 213 ms of which 1 ms to minimize.
[2023-03-25 19:27:35] [INFO ] Deduced a trap composed of 30 places in 229 ms of which 1 ms to minimize.
[2023-03-25 19:27:35] [INFO ] Deduced a trap composed of 31 places in 252 ms of which 5 ms to minimize.
[2023-03-25 19:27:36] [INFO ] Deduced a trap composed of 20 places in 290 ms of which 0 ms to minimize.
[2023-03-25 19:27:36] [INFO ] Deduced a trap composed of 29 places in 207 ms of which 0 ms to minimize.
[2023-03-25 19:27:36] [INFO ] Deduced a trap composed of 25 places in 341 ms of which 1 ms to minimize.
[2023-03-25 19:27:36] [INFO ] Deduced a trap composed of 45 places in 210 ms of which 4 ms to minimize.
[2023-03-25 19:27:37] [INFO ] Deduced a trap composed of 32 places in 212 ms of which 1 ms to minimize.
[2023-03-25 19:27:37] [INFO ] Deduced a trap composed of 28 places in 468 ms of which 0 ms to minimize.
[2023-03-25 19:27:38] [INFO ] Deduced a trap composed of 33 places in 296 ms of which 1 ms to minimize.
[2023-03-25 19:27:38] [INFO ] Deduced a trap composed of 35 places in 196 ms of which 0 ms to minimize.
[2023-03-25 19:27:38] [INFO ] Deduced a trap composed of 28 places in 230 ms of which 0 ms to minimize.
[2023-03-25 19:27:38] [INFO ] Deduced a trap composed of 29 places in 178 ms of which 1 ms to minimize.
[2023-03-25 19:27:39] [INFO ] Deduced a trap composed of 27 places in 263 ms of which 0 ms to minimize.
[2023-03-25 19:27:39] [INFO ] Deduced a trap composed of 21 places in 265 ms of which 14 ms to minimize.
[2023-03-25 19:27:39] [INFO ] Deduced a trap composed of 36 places in 258 ms of which 1 ms to minimize.
[2023-03-25 19:27:39] [INFO ] Deduced a trap composed of 29 places in 171 ms of which 1 ms to minimize.
[2023-03-25 19:27:39] [INFO ] Trap strengthening (SAT) tested/added 37/36 trap constraints in 14412 ms
[2023-03-25 19:27:40] [INFO ] Deduced a trap composed of 37 places in 270 ms of which 0 ms to minimize.
[2023-03-25 19:27:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 379 ms
[2023-03-25 19:27:40] [INFO ] Deduced a trap composed of 36 places in 382 ms of which 1 ms to minimize.
[2023-03-25 19:27:41] [INFO ] Deduced a trap composed of 32 places in 463 ms of which 1 ms to minimize.
[2023-03-25 19:27:42] [INFO ] Deduced a trap composed of 27 places in 403 ms of which 5 ms to minimize.
[2023-03-25 19:27:42] [INFO ] Deduced a trap composed of 19 places in 416 ms of which 1 ms to minimize.
[2023-03-25 19:27:42] [INFO ] Deduced a trap composed of 18 places in 342 ms of which 1 ms to minimize.
[2023-03-25 19:27:43] [INFO ] Deduced a trap composed of 22 places in 352 ms of which 1 ms to minimize.
[2023-03-25 19:27:43] [INFO ] Deduced a trap composed of 19 places in 410 ms of which 6 ms to minimize.
[2023-03-25 19:27:44] [INFO ] Deduced a trap composed of 27 places in 343 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.solver.global.GlobalPropertySolver.applyReachabilitySolver(GlobalPropertySolver.java:724)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:558)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preSolveLiveness(GlobalPropertySolver.java:412)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preStableMarking(GlobalPropertySolver.java:321)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:294)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:386)
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-25 19:27:44] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-25 19:27:44] [INFO ] After 25111ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:25
Fused 25 Parikh solutions to 22 different solutions.
Parikh walk visited 0 properties in 7179 ms.
Support contains 25 out of 1363 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1363/1363 places, 1263/1263 transitions.
Drop transitions removed 142 transitions
Trivial Post-agglo rules discarded 142 transitions
Performed 142 trivial Post agglomeration. Transition count delta: 142
Iterating post reduction 0 with 142 rules applied. Total rules applied 142 place count 1363 transition count 1121
Reduce places removed 142 places and 0 transitions.
Iterating post reduction 1 with 142 rules applied. Total rules applied 284 place count 1221 transition count 1121
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 100 Pre rules applied. Total rules applied 284 place count 1221 transition count 1021
Deduced a syphon composed of 100 places in 2 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 2 with 200 rules applied. Total rules applied 484 place count 1121 transition count 1021
Discarding 116 places :
Symmetric choice reduction at 2 with 116 rule applications. Total rules 600 place count 1005 transition count 905
Iterating global reduction 2 with 116 rules applied. Total rules applied 716 place count 1005 transition count 905
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 60 Pre rules applied. Total rules applied 716 place count 1005 transition count 845
Deduced a syphon composed of 60 places in 8 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 2 with 120 rules applied. Total rules applied 836 place count 945 transition count 845
Performed 299 Post agglomeration using F-continuation condition.Transition count delta: 299
Deduced a syphon composed of 299 places in 3 ms
Reduce places removed 299 places and 0 transitions.
Iterating global reduction 2 with 598 rules applied. Total rules applied 1434 place count 646 transition count 546
Partial Free-agglomeration rule applied 177 times.
Drop transitions removed 177 transitions
Iterating global reduction 2 with 177 rules applied. Total rules applied 1611 place count 646 transition count 546
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 1612 place count 645 transition count 545
Applied a total of 1612 rules in 453 ms. Remains 645 /1363 variables (removed 718) and now considering 545/1263 (removed 718) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 454 ms. Remains : 645/1363 places, 545/1263 transitions.
Finished random walk after 333538 steps, including 1 resets, run visited all 25 properties in 2320 ms. (steps per millisecond=143 )
Able to resolve query StableMarking after proving 820 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK MARKED_SUFFIX_TEST TOPOLOGICAL
Total runtime 37536 ms.
ITS solved all properties within timeout

BK_STOP 1679772474512

--------------------
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 StableMarking -timeout 180 -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="ShieldPPPs-PT-020B"
export BK_EXAMINATION="StableMarking"
export BK_TOOL="smartxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
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 smartxred"
echo " Input is ShieldPPPs-PT-020B, examination is StableMarking"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r409-oct2-167903727700288"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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