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.r106-tall-167814482900534.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 DLCflexbar-PT-3b, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r106-tall-167814482900534
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.9M
-rw-r--r-- 1 mcc users 6.0K Feb 25 15:03 CTLCardinality.txt
-rw-r--r-- 1 mcc users 60K Feb 25 15:03 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Feb 25 15:02 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Feb 25 15:02 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 15:51 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 15:51 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 15:51 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 15:51 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.6K Feb 25 15:03 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 96K Feb 25 15:03 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Feb 25 15:03 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 39K Feb 25 15:03 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 15:51 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:51 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 2.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

here is the order used to build the result vector(from text file)
FORMULA_NAME DLCflexbar-PT-3b-ReachabilityCardinality-00
FORMULA_NAME DLCflexbar-PT-3b-ReachabilityCardinality-01
FORMULA_NAME DLCflexbar-PT-3b-ReachabilityCardinality-02
FORMULA_NAME DLCflexbar-PT-3b-ReachabilityCardinality-03
FORMULA_NAME DLCflexbar-PT-3b-ReachabilityCardinality-04
FORMULA_NAME DLCflexbar-PT-3b-ReachabilityCardinality-05
FORMULA_NAME DLCflexbar-PT-3b-ReachabilityCardinality-06
FORMULA_NAME DLCflexbar-PT-3b-ReachabilityCardinality-07
FORMULA_NAME DLCflexbar-PT-3b-ReachabilityCardinality-08
FORMULA_NAME DLCflexbar-PT-3b-ReachabilityCardinality-09
FORMULA_NAME DLCflexbar-PT-3b-ReachabilityCardinality-10
FORMULA_NAME DLCflexbar-PT-3b-ReachabilityCardinality-11
FORMULA_NAME DLCflexbar-PT-3b-ReachabilityCardinality-12
FORMULA_NAME DLCflexbar-PT-3b-ReachabilityCardinality-13
FORMULA_NAME DLCflexbar-PT-3b-ReachabilityCardinality-14
FORMULA_NAME DLCflexbar-PT-3b-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678422042956

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=DLCflexbar-PT-3b
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-10 04:20:44] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-10 04:20:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-10 04:20:44] [INFO ] Load time of PNML (sax parser for PT used): 282 ms
[2023-03-10 04:20:44] [INFO ] Transformed 7245 places.
[2023-03-10 04:20:44] [INFO ] Transformed 10555 transitions.
[2023-03-10 04:20:44] [INFO ] Found NUPN structural information;
[2023-03-10 04:20:44] [INFO ] Parsed PT model containing 7245 places and 10555 transitions and 28284 arcs in 504 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 16 ms.
Working with output stream class java.io.PrintStream
FORMULA DLCflexbar-PT-3b-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCflexbar-PT-3b-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCflexbar-PT-3b-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCflexbar-PT-3b-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 442 ms. (steps per millisecond=22 ) properties (out of 12) seen :6
FORMULA DLCflexbar-PT-3b-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCflexbar-PT-3b-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCflexbar-PT-3b-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCflexbar-PT-3b-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCflexbar-PT-3b-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCflexbar-PT-3b-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 6) 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 6) 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 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 10555 rows 7245 cols
[2023-03-10 04:20:45] [INFO ] Computed 355 place invariants in 88 ms
[2023-03-10 04:20:47] [INFO ] After 1695ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-10 04:20:49] [INFO ] [Nat]Absence check using 355 positive place invariants in 426 ms returned sat
[2023-03-10 04:20:58] [INFO ] After 7873ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-10 04:21:02] [INFO ] Deduced a trap composed of 241 places in 4337 ms of which 9 ms to minimize.
[2023-03-10 04:21:07] [INFO ] Deduced a trap composed of 92 places in 4264 ms of which 5 ms to minimize.
[2023-03-10 04:21:11] [INFO ] Deduced a trap composed of 125 places in 4086 ms of which 5 ms to minimize.
[2023-03-10 04:21:12] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 14135 ms
[2023-03-10 04:21:13] [INFO ] After 22867ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 3 ms.
[2023-03-10 04:21:13] [INFO ] After 25328ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
FORMULA DLCflexbar-PT-3b-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA DLCflexbar-PT-3b-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA DLCflexbar-PT-3b-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 3 properties in 288 ms.
Support contains 17 out of 7245 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 7245/7245 places, 10555/10555 transitions.
Graph (trivial) has 6757 edges and 7245 vertex of which 720 / 7245 are part of one of the 48 SCC in 23 ms
Free SCC test removed 672 places
Drop transitions removed 756 transitions
Reduce isomorphic transitions removed 756 transitions.
Drop transitions removed 3338 transitions
Trivial Post-agglo rules discarded 3338 transitions
Performed 3338 trivial Post agglomeration. Transition count delta: 3338
Iterating post reduction 0 with 3338 rules applied. Total rules applied 3339 place count 6573 transition count 6461
Reduce places removed 3338 places and 0 transitions.
Ensure Unique test removed 102 transitions
Reduce isomorphic transitions removed 102 transitions.
Drop transitions removed 97 transitions
Trivial Post-agglo rules discarded 97 transitions
Performed 97 trivial Post agglomeration. Transition count delta: 97
Iterating post reduction 1 with 3537 rules applied. Total rules applied 6876 place count 3235 transition count 6262
Reduce places removed 97 places and 0 transitions.
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Drop transitions removed 27 transitions
Trivial Post-agglo rules discarded 27 transitions
Performed 27 trivial Post agglomeration. Transition count delta: 27
Iterating post reduction 2 with 152 rules applied. Total rules applied 7028 place count 3138 transition count 6207
Reduce places removed 27 places and 0 transitions.
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Iterating post reduction 3 with 40 rules applied. Total rules applied 7068 place count 3111 transition count 6194
Reduce places removed 13 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 15 rules applied. Total rules applied 7083 place count 3098 transition count 6192
Performed 34 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 34 Pre rules applied. Total rules applied 7083 place count 3098 transition count 6158
Deduced a syphon composed of 34 places in 56 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 5 with 68 rules applied. Total rules applied 7151 place count 3064 transition count 6158
Discarding 861 places :
Symmetric choice reduction at 5 with 861 rule applications. Total rules 8012 place count 2203 transition count 5297
Iterating global reduction 5 with 861 rules applied. Total rules applied 8873 place count 2203 transition count 5297
Performed 354 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 354 Pre rules applied. Total rules applied 8873 place count 2203 transition count 4943
Deduced a syphon composed of 354 places in 42 ms
Reduce places removed 354 places and 0 transitions.
Iterating global reduction 5 with 708 rules applied. Total rules applied 9581 place count 1849 transition count 4943
Discarding 91 places :
Symmetric choice reduction at 5 with 91 rule applications. Total rules 9672 place count 1758 transition count 3473
Iterating global reduction 5 with 91 rules applied. Total rules applied 9763 place count 1758 transition count 3473
Ensure Unique test removed 66 transitions
Reduce isomorphic transitions removed 66 transitions.
Iterating post reduction 5 with 66 rules applied. Total rules applied 9829 place count 1758 transition count 3407
Performed 445 Post agglomeration using F-continuation condition with reduction of 5 identical transitions.
Deduced a syphon composed of 445 places in 1 ms
Reduce places removed 445 places and 0 transitions.
Iterating global reduction 6 with 890 rules applied. Total rules applied 10719 place count 1313 transition count 2957
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 10724 place count 1313 transition count 2952
Renaming transitions due to excessive name length > 1024 char.
Performed 101 Post agglomeration using F-continuation condition with reduction of 130 identical transitions.
Deduced a syphon composed of 101 places in 2 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 7 with 202 rules applied. Total rules applied 10926 place count 1212 transition count 3469
Drop transitions removed 21 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 7 with 23 rules applied. Total rules applied 10949 place count 1212 transition count 3446
Discarding 29 places :
Symmetric choice reduction at 8 with 29 rule applications. Total rules 10978 place count 1183 transition count 3150
Iterating global reduction 8 with 29 rules applied. Total rules applied 11007 place count 1183 transition count 3150
Ensure Unique test removed 133 transitions
Reduce isomorphic transitions removed 133 transitions.
Iterating post reduction 8 with 133 rules applied. Total rules applied 11140 place count 1183 transition count 3017
Drop transitions removed 45 transitions
Redundant transition composition rules discarded 45 transitions
Iterating global reduction 9 with 45 rules applied. Total rules applied 11185 place count 1183 transition count 2972
Discarding 10 places :
Symmetric choice reduction at 9 with 10 rule applications. Total rules 11195 place count 1173 transition count 2962
Iterating global reduction 9 with 10 rules applied. Total rules applied 11205 place count 1173 transition count 2962
Discarding 10 places :
Symmetric choice reduction at 9 with 10 rule applications. Total rules 11215 place count 1163 transition count 2616
Iterating global reduction 9 with 10 rules applied. Total rules applied 11225 place count 1163 transition count 2616
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 9 with 10 rules applied. Total rules applied 11235 place count 1163 transition count 2606
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 10 with 10 rules applied. Total rules applied 11245 place count 1158 transition count 2601
Discarding 5 places :
Symmetric choice reduction at 10 with 5 rule applications. Total rules 11250 place count 1153 transition count 2428
Iterating global reduction 10 with 5 rules applied. Total rules applied 11255 place count 1153 transition count 2428
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 10 with 5 rules applied. Total rules applied 11260 place count 1153 transition count 2423
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 11 with 4 rules applied. Total rules applied 11264 place count 1151 transition count 2441
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 11 with 2 rules applied. Total rules applied 11266 place count 1151 transition count 2439
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 12 with 9 rules applied. Total rules applied 11275 place count 1151 transition count 2430
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 12 with 2 rules applied. Total rules applied 11277 place count 1150 transition count 2441
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 11278 place count 1150 transition count 2440
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 13 with 2 rules applied. Total rules applied 11280 place count 1150 transition count 2438
Free-agglomeration rule applied 719 times with reduction of 444 identical transitions.
Iterating global reduction 13 with 719 rules applied. Total rules applied 11999 place count 1150 transition count 1275
Reduce places removed 719 places and 0 transitions.
Drop transitions removed 790 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 791 transitions.
Graph (complete) has 897 edges and 431 vertex of which 187 are kept as prefixes of interest. Removing 244 places using SCC suffix rule.1 ms
Discarding 244 places :
Also discarding 197 output transitions
Drop transitions removed 197 transitions
Iterating post reduction 13 with 1511 rules applied. Total rules applied 13510 place count 187 transition count 287
Drop transitions removed 8 transitions
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 35 transitions.
Iterating post reduction 14 with 35 rules applied. Total rules applied 13545 place count 187 transition count 252
Discarding 91 places :
Symmetric choice reduction at 15 with 91 rule applications. Total rules 13636 place count 96 transition count 111
Iterating global reduction 15 with 91 rules applied. Total rules applied 13727 place count 96 transition count 111
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 15 with 1 rules applied. Total rules applied 13728 place count 96 transition count 110
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 16 with 7 rules applied. Total rules applied 13735 place count 96 transition count 103
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 16 with 2 rules applied. Total rules applied 13737 place count 94 transition count 103
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 17 with 1 rules applied. Total rules applied 13738 place count 94 transition count 103
Applied a total of 13738 rules in 2122 ms. Remains 94 /7245 variables (removed 7151) and now considering 103/10555 (removed 10452) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2123 ms. Remains : 94/7245 places, 103/10555 transitions.
Finished random walk after 2186 steps, including 0 resets, run visited all 3 properties in 15 ms. (steps per millisecond=145 )
FORMULA DLCflexbar-PT-3b-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCflexbar-PT-3b-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCflexbar-PT-3b-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 31179 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: DLCflexbar_PT_3b
(NrP: 7245 NrTr: 10555 NrArc: 28284)

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

net check time: 0m 0.013sec

init dd package: 0m 2.705sec

TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 6587660 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16098508 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//
++ 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 ReachabilityCardinality -timeout 360 -rebuildPNML
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok


initing FirstDep: 0m 0.791sec

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="DLCflexbar-PT-3b"
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 DLCflexbar-PT-3b, 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 r106-tall-167814482900534"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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