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

About the Execution of LoLa+red for MultiCrashLeafsetExtension-PT-S16C03

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
967.796 347100.00 414958.00 3194.10 T 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.r245-tall-167856432800473.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 lolaxred
Input is MultiCrashLeafsetExtension-PT-S16C03, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r245-tall-167856432800473
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.0M
-rw-r--r-- 1 mcc users 12K Feb 26 02:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K Feb 26 02:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.6K Feb 26 02:50 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 26 02:50 CTLFireability.xml
-rw-r--r-- 1 mcc users 6.6K Feb 25 16:23 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 16:23 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.4K Feb 25 16:23 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:23 LTLFireability.xml
-rw-r--r-- 1 mcc users 20K Feb 26 03:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 118K Feb 26 03:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 16K Feb 26 02:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 72K Feb 26 02:57 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 16:23 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.5K Feb 25 16:23 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 3.5M 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

FORMULA_NAME StableMarking

=== Now, execution of the tool begins

BK_START 1678714358651

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=lolaxred
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=MultiCrashLeafsetExtension-PT-S16C03
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-13 13:32:43] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2023-03-13 13:32:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 13:32:43] [INFO ] Load time of PNML (sax parser for PT used): 506 ms
[2023-03-13 13:32:43] [INFO ] Transformed 3606 places.
[2023-03-13 13:32:43] [INFO ] Transformed 5141 transitions.
[2023-03-13 13:32:43] [INFO ] Parsed PT model containing 3606 places and 5141 transitions and 20838 arcs in 680 ms.
Incomplete random walk after 10000 steps, including 315 resets, run finished after 2665 ms. (steps per millisecond=3 ) properties (out of 3606) seen :2249
Running SMT prover for 1357 properties.
[2023-03-13 13:32:46] [INFO ] Flow matrix only has 4869 transitions (discarded 272 similar events)
// Phase 1: matrix 4869 rows 3606 cols
[2023-03-13 13:32:47] [INFO ] Computed 459 place invariants in 366 ms
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.assertInvariants(DeadlockTester.java:2340)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:618)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:339)
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-13 13:33:13] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-13 13:33:13] [INFO ] After 25130ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 1357 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 1357 out of 3606 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3606/3606 places, 5141/5141 transitions.
Graph (complete) has 12103 edges and 3606 vertex of which 3580 are kept as prefixes of interest. Removing 26 places using SCC suffix rule.50 ms
Discarding 26 places :
Also discarding 0 output transitions
Drop transitions removed 492 transitions
Trivial Post-agglo rules discarded 492 transitions
Performed 492 trivial Post agglomeration. Transition count delta: 492
Iterating post reduction 0 with 492 rules applied. Total rules applied 493 place count 3580 transition count 4649
Reduce places removed 492 places and 0 transitions.
Iterating post reduction 1 with 492 rules applied. Total rules applied 985 place count 3088 transition count 4649
Performed 97 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 97 Pre rules applied. Total rules applied 985 place count 3088 transition count 4552
Deduced a syphon composed of 97 places in 13 ms
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 2 with 194 rules applied. Total rules applied 1179 place count 2991 transition count 4552
Discarding 395 places :
Symmetric choice reduction at 2 with 395 rule applications. Total rules 1574 place count 2596 transition count 4157
Iterating global reduction 2 with 395 rules applied. Total rules applied 1969 place count 2596 transition count 4157
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 1981 place count 2584 transition count 4121
Iterating global reduction 2 with 12 rules applied. Total rules applied 1993 place count 2584 transition count 4121
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 1997 place count 2582 transition count 4119
Free-agglomeration rule (complex) applied 275 times.
Iterating global reduction 2 with 275 rules applied. Total rules applied 2272 place count 2582 transition count 3868
Reduce places removed 275 places and 0 transitions.
Iterating post reduction 2 with 275 rules applied. Total rules applied 2547 place count 2307 transition count 3868
Partial Free-agglomeration rule applied 97 times.
Drop transitions removed 97 transitions
Iterating global reduction 3 with 97 rules applied. Total rules applied 2644 place count 2307 transition count 3868
Applied a total of 2644 rules in 1986 ms. Remains 2307 /3606 variables (removed 1299) and now considering 3868/5141 (removed 1273) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1988 ms. Remains : 2307/3606 places, 3868/5141 transitions.
Interrupted random walk after 195992 steps, including 9504 resets, run timeout after 30001 ms. (steps per millisecond=6 ) properties seen 722
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 635) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 635) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 635) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 39 ms. (steps per millisecond=25 ) properties (out of 635) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 35 ms. (steps per millisecond=28 ) properties (out of 635) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 36 ms. (steps per millisecond=27 ) properties (out of 635) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 34 ms. (steps per millisecond=29 ) properties (out of 635) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 37 ms. (steps per millisecond=27 ) properties (out of 635) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 38 ms. (steps per millisecond=26 ) properties (out of 635) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 41 ms. (steps per millisecond=24 ) properties (out of 635) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 38 ms. (steps per millisecond=26 ) properties (out of 635) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 43 ms. (steps per millisecond=23 ) properties (out of 635) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 38 ms. (steps per millisecond=26 ) properties (out of 635) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 34 ms. (steps per millisecond=29 ) properties (out of 635) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 38 ms. (steps per millisecond=26 ) properties (out of 635) seen :0
Incomplete Best-First random walk after 1000 steps, including 8 resets, run finished after 35 ms. (steps per millisecond=28 ) properties (out of 635) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 37 ms. (steps per millisecond=27 ) properties (out of 635) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 36 ms. (steps per millisecond=27 ) properties (out of 635) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 34 ms. (steps per millisecond=29 ) properties (out of 635) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 44 ms. (steps per millisecond=22 ) properties (out of 635) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 35 ms. (steps per millisecond=28 ) properties (out of 635) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 37 ms. (steps per millisecond=27 ) properties (out of 635) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 40 ms. (steps per millisecond=25 ) properties (out of 635) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 31 ms. (steps per millisecond=32 ) properties (out of 635) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 39 ms. (steps per millisecond=25 ) properties (out of 635) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 35 ms. (steps per millisecond=28 ) properties (out of 635) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 39 ms. (steps per millisecond=25 ) properties (out of 635) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 41 ms. (steps per millisecond=24 ) properties (out of 635) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 37 ms. (steps per millisecond=27 ) properties (out of 635) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 635) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 33 ms. (steps per millisecond=30 ) properties (out of 635) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 36 ms. (steps per millisecond=27 ) properties (out of 635) seen :0
Incomplete Best-First random walk after 1000 steps, including 8 resets, run finished after 41 ms. (steps per millisecond=24 ) properties (out of 635) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 42 ms. (steps per millisecond=23 ) properties (out of 635) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 35 ms. (steps per millisecond=28 ) properties (out of 635) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 31 ms. (steps per millisecond=32 ) properties (out of 635) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 36 ms. (steps per millisecond=27 ) properties (out of 635) seen :0
Incomplete Best-First random walk after 1000 steps, including 8 resets, run finished after 36 ms. (steps per millisecond=27 ) properties (out of 635) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 32 ms. (steps per millisecond=31 ) properties (out of 635) seen :0
Incomplete Best-First random walk after 1000 steps, including 8 resets, run finished after 35 ms. (steps per millisecond=28 ) properties (out of 635) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 42 ms. (steps per millisecond=23 ) properties (out of 635) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 29 ms. (steps per millisecond=34 ) properties (out of 635) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 33 ms. (steps per millisecond=30 ) properties (out of 635) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 33 ms. (steps per millisecond=30 ) properties (out of 635) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 635) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 635) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 33 ms. (steps per millisecond=30 ) properties (out of 635) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 41 ms. (steps per millisecond=24 ) properties (out of 635) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 46 ms. (steps per millisecond=21 ) properties (out of 635) seen :0
Incomplete Best-First random walk after 1000 steps, including 8 resets, run finished after 46 ms. (steps per millisecond=21 ) properties (out of 635) seen :0
Running SMT prover for 635 properties.
[2023-03-13 13:33:47] [INFO ] Flow matrix only has 3575 transitions (discarded 293 similar events)
// Phase 1: matrix 3575 rows 2307 cols
[2023-03-13 13:33:47] [INFO ] Computed 433 place invariants in 190 ms
[2023-03-13 13:34:39] [INFO ] After 51045ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:635
[2023-03-13 13:35:16] [INFO ] [Nat]Absence check using 33 positive place invariants in 106 ms returned sat
[2023-03-13 13:35:17] [INFO ] [Nat]Absence check using 33 positive and 400 generalized place invariants in 209 ms returned sat
[2023-03-13 13:38:13] [INFO ] After 133464ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :635
[2023-03-13 13:38:13] [INFO ] State equation strengthened by 1362 read => feed constraints.
[2023-03-13 13:38:24] [INFO ] After 11099ms SMT Verify possible using 1362 Read/Feed constraints in natural domain returned unsat :45 sat :589
[2023-03-13 13:38:24] [INFO ] After 11103ms SMT Verify possible using trap constraints in natural domain returned unsat :45 sat :589
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-03-13 13:38:24] [INFO ] After 225041ms SMT Verify possible using all constraints in natural domain returned unsat :45 sat :589
FORMULA StableMarking TRUE TECHNIQUES RANDOM_WALK STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Total runtime 341261 ms.
ITS solved all properties within timeout

BK_STOP 1678714705751

--------------------
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="MultiCrashLeafsetExtension-PT-S16C03"
export BK_EXAMINATION="StableMarking"
export BK_TOOL="lolaxred"
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 lolaxred"
echo " Input is MultiCrashLeafsetExtension-PT-S16C03, 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 r245-tall-167856432800473"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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