Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r042-tajo-167813695800470.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool marciexred
Input is BusinessProcesses-PT-03, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r042-tajo-167813695800470
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 500K
-rw-r--r-- 1 mcc users 7.4K Feb 25 16:51 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K Feb 25 16:51 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Feb 25 16:50 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 25 16:50 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:38 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 15:38 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 15:38 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 15:38 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 25 16:52 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 123K Feb 25 16:52 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Feb 25 16:51 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K Feb 25 16:51 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:38 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:38 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 63K 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 BusinessProcesses-PT-03-ReachabilityCardinality-00
FORMULA_NAME BusinessProcesses-PT-03-ReachabilityCardinality-01
FORMULA_NAME BusinessProcesses-PT-03-ReachabilityCardinality-02
FORMULA_NAME BusinessProcesses-PT-03-ReachabilityCardinality-03
FORMULA_NAME BusinessProcesses-PT-03-ReachabilityCardinality-04
FORMULA_NAME BusinessProcesses-PT-03-ReachabilityCardinality-05
FORMULA_NAME BusinessProcesses-PT-03-ReachabilityCardinality-06
FORMULA_NAME BusinessProcesses-PT-03-ReachabilityCardinality-07
FORMULA_NAME BusinessProcesses-PT-03-ReachabilityCardinality-08
FORMULA_NAME BusinessProcesses-PT-03-ReachabilityCardinality-09
FORMULA_NAME BusinessProcesses-PT-03-ReachabilityCardinality-10
FORMULA_NAME BusinessProcesses-PT-03-ReachabilityCardinality-11
FORMULA_NAME BusinessProcesses-PT-03-ReachabilityCardinality-12
FORMULA_NAME BusinessProcesses-PT-03-ReachabilityCardinality-13
FORMULA_NAME BusinessProcesses-PT-03-ReachabilityCardinality-14
FORMULA_NAME BusinessProcesses-PT-03-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678727523639

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=BusinessProcesses-PT-03
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-13 17:12:05] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-13 17:12:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 17:12:05] [INFO ] Load time of PNML (sax parser for PT used): 59 ms
[2023-03-13 17:12:05] [INFO ] Transformed 274 places.
[2023-03-13 17:12:05] [INFO ] Transformed 237 transitions.
[2023-03-13 17:12:05] [INFO ] Found NUPN structural information;
[2023-03-13 17:12:05] [INFO ] Parsed PT model containing 274 places and 237 transitions and 632 arcs in 138 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 16 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 1 transitions.
FORMULA BusinessProcesses-PT-03-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-03-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 121 resets, run finished after 385 ms. (steps per millisecond=25 ) properties (out of 14) seen :4
FORMULA BusinessProcesses-PT-03-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-03-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-03-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-03-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 10) seen :1
FORMULA BusinessProcesses-PT-03-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Running SMT prover for 9 properties.
// Phase 1: matrix 236 rows 273 cols
[2023-03-13 17:12:06] [INFO ] Computed 43 place invariants in 13 ms
[2023-03-13 17:12:06] [INFO ] After 281ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-13 17:12:07] [INFO ] [Nat]Absence check using 31 positive place invariants in 9 ms returned sat
[2023-03-13 17:12:07] [INFO ] [Nat]Absence check using 31 positive and 12 generalized place invariants in 3 ms returned sat
[2023-03-13 17:12:07] [INFO ] After 151ms SMT Verify possible using state equation in natural domain returned unsat :5 sat :4
[2023-03-13 17:12:07] [INFO ] Deduced a trap composed of 8 places in 81 ms of which 6 ms to minimize.
[2023-03-13 17:12:07] [INFO ] Deduced a trap composed of 10 places in 67 ms of which 1 ms to minimize.
[2023-03-13 17:12:07] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 179 ms
[2023-03-13 17:12:07] [INFO ] Deduced a trap composed of 11 places in 62 ms of which 1 ms to minimize.
[2023-03-13 17:12:07] [INFO ] Deduced a trap composed of 72 places in 55 ms of which 1 ms to minimize.
[2023-03-13 17:12:07] [INFO ] Deduced a trap composed of 12 places in 53 ms of which 1 ms to minimize.
[2023-03-13 17:12:07] [INFO ] Deduced a trap composed of 72 places in 48 ms of which 1 ms to minimize.
[2023-03-13 17:12:07] [INFO ] Deduced a trap composed of 21 places in 52 ms of which 0 ms to minimize.
[2023-03-13 17:12:07] [INFO ] Deduced a trap composed of 68 places in 43 ms of which 1 ms to minimize.
[2023-03-13 17:12:07] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 1 ms to minimize.
[2023-03-13 17:12:07] [INFO ] Deduced a trap composed of 25 places in 41 ms of which 1 ms to minimize.
[2023-03-13 17:12:07] [INFO ] Deduced a trap composed of 26 places in 29 ms of which 1 ms to minimize.
[2023-03-13 17:12:08] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 0 ms to minimize.
[2023-03-13 17:12:08] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 552 ms
[2023-03-13 17:12:08] [INFO ] Deduced a trap composed of 65 places in 44 ms of which 0 ms to minimize.
[2023-03-13 17:12:08] [INFO ] Deduced a trap composed of 33 places in 32 ms of which 0 ms to minimize.
[2023-03-13 17:12:08] [INFO ] Deduced a trap composed of 31 places in 31 ms of which 0 ms to minimize.
[2023-03-13 17:12:08] [INFO ] Deduced a trap composed of 33 places in 32 ms of which 0 ms to minimize.
[2023-03-13 17:12:08] [INFO ] Deduced a trap composed of 33 places in 72 ms of which 0 ms to minimize.
[2023-03-13 17:12:08] [INFO ] Deduced a trap composed of 34 places in 49 ms of which 1 ms to minimize.
[2023-03-13 17:12:08] [INFO ] Deduced a trap composed of 45 places in 78 ms of which 1 ms to minimize.
[2023-03-13 17:12:08] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 434 ms
[2023-03-13 17:12:08] [INFO ] After 1382ms SMT Verify possible using trap constraints in natural domain returned unsat :6 sat :3
Attempting to minimize the solution found.
Minimization took 135 ms.
[2023-03-13 17:12:08] [INFO ] After 1669ms SMT Verify possible using all constraints in natural domain returned unsat :6 sat :3
FORMULA BusinessProcesses-PT-03-ReachabilityCardinality-09 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-03-ReachabilityCardinality-07 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-03-ReachabilityCardinality-06 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-03-ReachabilityCardinality-03 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-03-ReachabilityCardinality-02 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-03-ReachabilityCardinality-01 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 9 Parikh solutions to 3 different solutions.
FORMULA BusinessProcesses-PT-03-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 16 ms.
Support contains 24 out of 273 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 273/273 places, 236/236 transitions.
Graph (trivial) has 143 edges and 273 vertex of which 8 / 273 are part of one of the 1 SCC in 5 ms
Free SCC test removed 7 places
Drop transitions removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Graph (complete) has 512 edges and 266 vertex of which 263 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 0 with 49 rules applied. Total rules applied 51 place count 263 transition count 176
Reduce places removed 48 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 52 rules applied. Total rules applied 103 place count 215 transition count 172
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 107 place count 211 transition count 172
Performed 33 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 33 Pre rules applied. Total rules applied 107 place count 211 transition count 139
Deduced a syphon composed of 33 places in 1 ms
Ensure Unique test removed 7 places
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 3 with 73 rules applied. Total rules applied 180 place count 171 transition count 139
Discarding 32 places :
Symmetric choice reduction at 3 with 32 rule applications. Total rules 212 place count 139 transition count 107
Iterating global reduction 3 with 32 rules applied. Total rules applied 244 place count 139 transition count 107
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 244 place count 139 transition count 106
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 246 place count 138 transition count 106
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 38
Deduced a syphon composed of 38 places in 0 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 3 with 76 rules applied. Total rules applied 322 place count 100 transition count 68
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 323 place count 99 transition count 67
Applied a total of 323 rules in 81 ms. Remains 99 /273 variables (removed 174) and now considering 67/236 (removed 169) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 82 ms. Remains : 99/273 places, 67/236 transitions.
Incomplete random walk after 10000 steps, including 223 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 2) seen :1
FORMULA BusinessProcesses-PT-03-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Finished Best-First random walk after 2552 steps, including 22 resets, run visited all 1 properties in 6 ms. (steps per millisecond=425 )
FORMULA BusinessProcesses-PT-03-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
All properties solved without resorting to model-checking.
Total runtime 3366 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: BusinessProcesses_PT_03
(NrP: 274 NrTr: 237 NrArc: 632)

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

net check time: 0m 0.000sec

init dd package: 0m 3.233sec

TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393340 kB
MemFree: 6561996 kB
After kill :
MemTotal: 16393340 kB
MemFree: 16103196 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
found
The net has a maximal unmarked siphon:
p203

The net has transition(s) that can never fire:
t59

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

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="BusinessProcesses-PT-03"
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 BusinessProcesses-PT-03, 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 r042-tajo-167813695800470"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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