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.r490-tall-167912708600438.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 Szymanski-PT-a10, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r490-tall-167912708600438
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 532K
-rw-r--r-- 1 mcc users 5.7K Feb 26 17:00 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K Feb 26 17:00 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Feb 26 16:59 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K Feb 26 16:59 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 17:18 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 17:18 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 17:18 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Feb 25 17:18 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.3K Feb 26 17:02 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 97K Feb 26 17:02 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 26 17:01 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 98K Feb 26 17:01 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:18 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 17:18 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 101K Mar 5 18:23 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1679255295124

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=Szymanski-PT-a10
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-19 19:48:16] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-19 19:48:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-19 19:48:16] [INFO ] Load time of PNML (sax parser for PT used): 49 ms
[2023-03-19 19:48:16] [INFO ] Transformed 61 places.
[2023-03-19 19:48:16] [INFO ] Transformed 224 transitions.
[2023-03-19 19:48:16] [INFO ] Parsed PT model containing 61 places and 224 transitions and 900 arcs in 110 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 13 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 8 transitions.
FORMULA Szymanski-PT-a10-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-a10-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-a10-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-a10-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-a10-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10002 steps, including 16 resets, run finished after 187 ms. (steps per millisecond=53 ) properties (out of 11) seen :7
FORMULA Szymanski-PT-a10-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Szymanski-PT-a10-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Szymanski-PT-a10-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Szymanski-PT-a10-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Szymanski-PT-a10-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Szymanski-PT-a10-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Szymanski-PT-a10-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 4) seen :1
FORMULA Szymanski-PT-a10-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-19 19:48:16] [INFO ] Flow matrix only has 79 transitions (discarded 137 similar events)
// Phase 1: matrix 79 rows 49 cols
[2023-03-19 19:48:16] [INFO ] Computed 3 place invariants in 10 ms
[2023-03-19 19:48:17] [INFO ] After 179ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-19 19:48:17] [INFO ] [Nat]Absence check using 2 positive place invariants in 7 ms returned sat
[2023-03-19 19:48:17] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-19 19:48:17] [INFO ] After 44ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :1
[2023-03-19 19:48:17] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-19 19:48:17] [INFO ] After 17ms SMT Verify possible using 9 Read/Feed constraints in natural domain returned unsat :2 sat :1
[2023-03-19 19:48:17] [INFO ] Deduced a trap composed of 8 places in 42 ms of which 3 ms to minimize.
[2023-03-19 19:48:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 54 ms
[2023-03-19 19:48:17] [INFO ] After 89ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :1
Attempting to minimize the solution found.
Minimization took 15 ms.
[2023-03-19 19:48:17] [INFO ] After 230ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :1
FORMULA Szymanski-PT-a10-ReachabilityCardinality-08 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Szymanski-PT-a10-ReachabilityCardinality-00 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 7 ms.
Support contains 17 out of 49 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 49/49 places, 216/216 transitions.
Graph (complete) has 251 edges and 49 vertex of which 48 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 3 place count 46 transition count 208
Iterating global reduction 0 with 2 rules applied. Total rules applied 5 place count 46 transition count 208
Drop transitions removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 0 with 16 rules applied. Total rules applied 21 place count 46 transition count 192
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 22 place count 45 transition count 188
Iterating global reduction 0 with 1 rules applied. Total rules applied 23 place count 45 transition count 188
Applied a total of 23 rules in 41 ms. Remains 45 /49 variables (removed 4) and now considering 188/216 (removed 28) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41 ms. Remains : 45/49 places, 188/216 transitions.
Incomplete random walk after 10006 steps, including 4 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2013345 steps, run timeout after 3001 ms. (steps per millisecond=670 ) properties seen :{}
Probabilistic random walk after 2013345 steps, saw 982902 distinct states, run finished after 3002 ms. (steps per millisecond=670 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-19 19:48:20] [INFO ] Flow matrix only has 72 transitions (discarded 116 similar events)
// Phase 1: matrix 72 rows 45 cols
[2023-03-19 19:48:20] [INFO ] Computed 2 place invariants in 5 ms
[2023-03-19 19:48:20] [INFO ] After 22ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 19:48:20] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-19 19:48:20] [INFO ] After 27ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 19:48:20] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-19 19:48:20] [INFO ] After 11ms SMT Verify possible using 9 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-19 19:48:20] [INFO ] Deduced a trap composed of 8 places in 36 ms of which 2 ms to minimize.
[2023-03-19 19:48:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 48 ms
[2023-03-19 19:48:20] [INFO ] After 71ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 15 ms.
[2023-03-19 19:48:20] [INFO ] After 139ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 17 out of 45 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 45/45 places, 188/188 transitions.
Applied a total of 0 rules in 11 ms. Remains 45 /45 variables (removed 0) and now considering 188/188 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 45/45 places, 188/188 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 45/45 places, 188/188 transitions.
Applied a total of 0 rules in 12 ms. Remains 45 /45 variables (removed 0) and now considering 188/188 (removed 0) transitions.
[2023-03-19 19:48:20] [INFO ] Flow matrix only has 72 transitions (discarded 116 similar events)
[2023-03-19 19:48:20] [INFO ] Invariant cache hit.
[2023-03-19 19:48:20] [INFO ] Implicit Places using invariants in 55 ms returned []
[2023-03-19 19:48:20] [INFO ] Flow matrix only has 72 transitions (discarded 116 similar events)
[2023-03-19 19:48:20] [INFO ] Invariant cache hit.
[2023-03-19 19:48:20] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-19 19:48:20] [INFO ] Implicit Places using invariants and state equation in 60 ms returned []
Implicit Place search using SMT with State Equation took 117 ms to find 0 implicit places.
[2023-03-19 19:48:20] [INFO ] Redundant transitions in 5 ms returned []
[2023-03-19 19:48:20] [INFO ] Flow matrix only has 72 transitions (discarded 116 similar events)
[2023-03-19 19:48:20] [INFO ] Invariant cache hit.
[2023-03-19 19:48:20] [INFO ] Dead Transitions using invariants and state equation in 94 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 234 ms. Remains : 45/45 places, 188/188 transitions.
Graph (trivial) has 54 edges and 45 vertex of which 5 / 45 are part of one of the 2 SCC in 1 ms
Free SCC test removed 3 places
Drop transitions removed 20 transitions
Ensure Unique test removed 101 transitions
Reduce isomorphic transitions removed 121 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 42 transition count 65
Reduce places removed 2 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 4 rules applied. Total rules applied 7 place count 40 transition count 63
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 9 place count 38 transition count 63
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 11 place count 37 transition count 62
Free-agglomeration rule applied 3 times.
Iterating global reduction 3 with 3 rules applied. Total rules applied 14 place count 37 transition count 59
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 17 place count 34 transition count 59
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 18 place count 34 transition count 59
Applied a total of 18 rules in 13 ms. Remains 34 /45 variables (removed 11) and now considering 59/188 (removed 129) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 59 rows 34 cols
[2023-03-19 19:48:20] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-19 19:48:20] [INFO ] After 18ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 19:48:20] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-19 19:48:21] [INFO ] After 17ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 19:48:21] [INFO ] After 28ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 13 ms.
[2023-03-19 19:48:21] [INFO ] After 72ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-19 19:48:21] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 2 ms.
[2023-03-19 19:48:21] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 45 places, 188 transitions and 752 arcs took 1 ms.
[2023-03-19 19:48:21] [INFO ] Flatten gal took : 37 ms
Total runtime 4716 ms.
There are residual formulas that ITS could not solve within timeout
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: Szymanski_PT_a10
(NrP: 45 NrTr: 188 NrArc: 752)

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

net check time: 0m 0.000sec

init dd package: 0m 2.820sec


RS generation: 0m44.152sec


-> reachability set: #nodes 10376 (1.0e+04) #states 74,154,544,738,560 (13)



starting MCC model checker
--------------------------

checking: AG [[[[[[[~ [p42<=6] | ~ [p41<=6]] | [~ [2<=p38] | ~ [p44<=p28]]] & p43<=p14] & ~ [10<=p18]] | [[[~ [p44<=7] & ~ [p18<=0]] & p9<=p21] & [p44<=p7 & p31<=2]]] | [p4<=p21 | [[[~ [4<=p0] | ~ [5<=p35]] & p17<=p7] & [~ [p41<=p30] & p44<=10]]]]]
normalized: ~ [E [true U ~ [[[p4<=p21 | [[~ [p41<=p30] & p44<=10] & [p17<=p7 & [~ [5<=p35] | ~ [4<=p0]]]]] | [[[p9<=p21 & [~ [p18<=0] & ~ [p44<=7]]] & [p44<=p7 & p31<=2]] | [~ [10<=p18] & [p43<=p14 & [[~ [p44<=p28] | ~ [2<=p38]] | [~ [p41<=6] | ~ [p42<=6]]]]]]]]]]

abstracting: (p42<=6)
states: 74,140,807,263,028 (13)
abstracting: (p41<=6)
states: 74,140,807,263,028 (13)
abstracting: (2<=p38)
states: 10,534,476,606,279 (13)
abstracting: (p44<=p28)
states: 64,221,235,515,268 (13)
abstracting: (p43<=p14)
states: 52,795,734,670,185 (13)
abstracting: (10<=p18)
states: 4,739,702 (6)
abstracting: (p31<=2)
states: 70,614,358,464,828 (13)
abstracting: (p44<=p7)
states: 58,721,968,126,835 (13)
abstracting: (p44<=7)
states: 74,154,544,738,560 (13)
abstracting: (p18<=0)
states: 47,521,378,684,117 (13)
abstracting: (p9<=p21)
states: 63,462,357,763,345 (13)
abstracting: (4<=p0)
states: 0
abstracting: (5<=p35)
states: 294,792,221,368 (11)
abstracting: (p17<=p7)
states: 47,685,716,370,137 (13)
abstracting: (p44<=10)
states: 74,154,544,738,560 (13)
abstracting: (p41<=p30)
states: 53,064,865,700,365 (13)
abstracting: (p4<=p21)
states: 73,662,454,931,910 (13)
-> the formula is FALSE

FORMULA Szymanski-PT-a10-ReachabilityCardinality-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m17.169sec

totally nodes used: 7348130 (7.3e+06)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 665743544 142276971 808020515
used/not used/entry size/cache size: 59109176 7999688 16 1024MB
basic ops cache: hits/miss/sum: 14644068 3893908 18537976
used/not used/entry size/cache size: 6181274 10595942 12 192MB
unary ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 8 128MB
abstract ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 12 192MB
state nr cache: hits/miss/sum: 342230 82711 424941
used/not used/entry size/cache size: 82435 8306173 32 256MB
max state cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 8388608 32 256MB
uniqueHash elements/entry size/size: 67108864 4 256MB
0 60366840
1 6306651
2 381758
3 31747
4 9303
5 5314
6 3340
7 1000
8 416
9 127
>= 10 2368

Total processing time: 1m 6.430sec


BK_STOP 1679255385602

--------------------
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.000sec

9491 19222 16857 23891 21059
iterations count:551133 (2931), effective:15514 (82)

initing FirstDep: 0m 0.000sec


iterations count:45532 (242), effective:861 (4)

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="Szymanski-PT-a10"
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 Szymanski-PT-a10, 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 r490-tall-167912708600438"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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