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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 9.6M
-rw-r--r-- 1 mcc users 113K Feb 26 12:12 CTLCardinality.txt
-rw-r--r-- 1 mcc users 682K Feb 26 12:12 CTLCardinality.xml
-rw-r--r-- 1 mcc users 198K Feb 26 12:04 CTLFireability.txt
-rw-r--r-- 1 mcc users 726K Feb 26 12:04 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 7.0K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 32K Feb 25 16:05 LTLCardinality.txt
-rw-r--r-- 1 mcc users 146K Feb 25 16:05 LTLCardinality.xml
-rw-r--r-- 1 mcc users 81K Feb 25 16:05 LTLFireability.txt
-rw-r--r-- 1 mcc users 238K Feb 25 16:05 LTLFireability.xml
-rw-r--r-- 1 mcc users 197K Feb 26 12:36 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 1.2M Feb 26 12:36 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 297K Feb 26 12:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 994K Feb 26 12:26 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 25 16:05 UpperBounds.txt
-rw-r--r-- 1 mcc users 35K Feb 25 16:05 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 24 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 4.7M 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 FamilyReunion-PT-L00050M0005C002P002G001-ReachabilityCardinality-00
FORMULA_NAME FamilyReunion-PT-L00050M0005C002P002G001-ReachabilityCardinality-01
FORMULA_NAME FamilyReunion-PT-L00050M0005C002P002G001-ReachabilityCardinality-02
FORMULA_NAME FamilyReunion-PT-L00050M0005C002P002G001-ReachabilityCardinality-03
FORMULA_NAME FamilyReunion-PT-L00050M0005C002P002G001-ReachabilityCardinality-04
FORMULA_NAME FamilyReunion-PT-L00050M0005C002P002G001-ReachabilityCardinality-05
FORMULA_NAME FamilyReunion-PT-L00050M0005C002P002G001-ReachabilityCardinality-06
FORMULA_NAME FamilyReunion-PT-L00050M0005C002P002G001-ReachabilityCardinality-07
FORMULA_NAME FamilyReunion-PT-L00050M0005C002P002G001-ReachabilityCardinality-08
FORMULA_NAME FamilyReunion-PT-L00050M0005C002P002G001-ReachabilityCardinality-09
FORMULA_NAME FamilyReunion-PT-L00050M0005C002P002G001-ReachabilityCardinality-10
FORMULA_NAME FamilyReunion-PT-L00050M0005C002P002G001-ReachabilityCardinality-11
FORMULA_NAME FamilyReunion-PT-L00050M0005C002P002G001-ReachabilityCardinality-12
FORMULA_NAME FamilyReunion-PT-L00050M0005C002P002G001-ReachabilityCardinality-13
FORMULA_NAME FamilyReunion-PT-L00050M0005C002P002G001-ReachabilityCardinality-14
FORMULA_NAME FamilyReunion-PT-L00050M0005C002P002G001-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678538923836

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=FamilyReunion-PT-L00050M0005C002P002G001
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-11 12:48:45] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-11 12:48:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 12:48:45] [INFO ] Load time of PNML (sax parser for PT used): 296 ms
[2023-03-11 12:48:45] [INFO ] Transformed 12194 places.
[2023-03-11 12:48:45] [INFO ] Transformed 10560 transitions.
[2023-03-11 12:48:45] [INFO ] Parsed PT model containing 12194 places and 10560 transitions and 32238 arcs in 400 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 631 ms.
Working with output stream class java.io.PrintStream
Reduce places removed 17 places and 0 transitions.
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 3 resets, run finished after 790 ms. (steps per millisecond=12 ) properties (out of 15) seen :6
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 234 ms. (steps per millisecond=42 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 368 ms. (steps per millisecond=27 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 399 ms. (steps per millisecond=25 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 658 ms. (steps per millisecond=15 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 10560 rows 12177 cols
[2023-03-11 12:48:50] [INFO ] Computed 2768 place invariants in 616 ms
[2023-03-11 12:48:54] [INFO ] [Real]Absence check using 149 positive place invariants in 290 ms returned sat
[2023-03-11 12:48:55] [INFO ] [Real]Absence check using 149 positive and 2619 generalized place invariants in 1291 ms returned sat
[2023-03-11 12:48:55] [INFO ] After 4445ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-11 12:48:58] [INFO ] [Nat]Absence check using 149 positive place invariants in 276 ms returned sat
[2023-03-11 12:48:59] [INFO ] [Nat]Absence check using 149 positive and 2619 generalized place invariants in 1311 ms returned sat
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.checkResults(DeadlockTester.java:797)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:631)
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-11 12:49:21] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-11 12:49:21] [INFO ] After 25122ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:9
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-ReachabilityCardinality-04 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-ReachabilityCardinality-02 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 9 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 5072 out of 12177 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 12177/12177 places, 10560/10560 transitions.
Graph (complete) has 18927 edges and 12177 vertex of which 12115 are kept as prefixes of interest. Removing 62 places using SCC suffix rule.26 ms
Discarding 62 places :
Also discarding 0 output transitions
Discarding 1517 places :
Implicit places reduction removed 1517 places
Drop transitions removed 885 transitions
Trivial Post-agglo rules discarded 885 transitions
Performed 885 trivial Post agglomeration. Transition count delta: 885
Iterating post reduction 0 with 2402 rules applied. Total rules applied 2403 place count 10598 transition count 9675
Reduce places removed 885 places and 0 transitions.
Performed 909 Post agglomeration using F-continuation condition.Transition count delta: 909
Iterating post reduction 1 with 1794 rules applied. Total rules applied 4197 place count 9713 transition count 8766
Reduce places removed 909 places and 0 transitions.
Iterating post reduction 2 with 909 rules applied. Total rules applied 5106 place count 8804 transition count 8766
Performed 405 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 405 Pre rules applied. Total rules applied 5106 place count 8804 transition count 8361
Deduced a syphon composed of 405 places in 26 ms
Ensure Unique test removed 150 places
Reduce places removed 555 places and 0 transitions.
Iterating global reduction 3 with 960 rules applied. Total rules applied 6066 place count 8249 transition count 8361
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 3 with 4 rules applied. Total rules applied 6070 place count 8245 transition count 8361
Discarding 710 places :
Symmetric choice reduction at 4 with 710 rule applications. Total rules 6780 place count 7535 transition count 7601
Iterating global reduction 4 with 710 rules applied. Total rules applied 7490 place count 7535 transition count 7601
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 7 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 7492 place count 7534 transition count 7600
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 47 places in 15 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 4 with 94 rules applied. Total rules applied 7586 place count 7487 transition count 7600
Free-agglomeration rule applied 3 times.
Iterating global reduction 4 with 3 rules applied. Total rules applied 7589 place count 7487 transition count 7597
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 7592 place count 7484 transition count 7597
Applied a total of 7592 rules in 2506 ms. Remains 7484 /12177 variables (removed 4693) and now considering 7597/10560 (removed 2963) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2508 ms. Remains : 7484/12177 places, 7597/10560 transitions.
Incomplete random walk after 10000 steps, including 4 resets, run finished after 361 ms. (steps per millisecond=27 ) properties (out of 7) seen :3
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 383 ms. (steps per millisecond=26 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 7597 rows 7484 cols
[2023-03-11 12:49:24] [INFO ] Computed 1042 place invariants in 161 ms
[2023-03-11 12:49:25] [INFO ] After 1014ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-11 12:49:27] [INFO ] [Nat]Absence check using 102 positive place invariants in 146 ms returned sat
[2023-03-11 12:49:27] [INFO ] [Nat]Absence check using 102 positive and 940 generalized place invariants in 409 ms returned sat
[2023-03-11 12:49:49] [INFO ] After 21429ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-11 12:49:50] [INFO ] After 22817ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-03-11 12:49:50] [INFO ] After 25076ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Finished Parikh walk after 399 steps, including 0 resets, run visited all 1 properties in 7 ms. (steps per millisecond=57 )
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 4 properties in 235 ms.
All properties solved without resorting to model-checking.
Total runtime 65990 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: FamilyReunion_PT_L00050M0005C002P002G001
(NrP: 12194 NrTr: 10560 NrArc: 32238)

parse formulas
formulas created successfully
place and transition orderings generation:0m13.240sec

net check time: 0m 0.005sec

init dd package: 0m 2.602sec


before gc: list nodes free: 1913377

after gc: idd nodes used:11314, unused:63988686; list nodes free:257870494
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 6640184 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16095068 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
m0_0
m0_1
m0_2
m0_3
m0_4
m0_5
c2_0
c2_1
c2_2
r0_Y
r0_N
c0_0
c0_1
c0_2
p0_0
p0_1
p0_2
found 17 constant places
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.415sec

185244

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="FamilyReunion-PT-L00050M0005C002P002G001"
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 FamilyReunion-PT-L00050M0005C002P002G001, 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-167838857200414"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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