Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r576-smll-171734920100120.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is MedleyA-PT-15, examination is StateSpace
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r576-smll-171734920100120
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 564K
-rw-r--r-- 1 mcc users 6.0K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 64K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 9.4K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 97K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 100K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 110K Jun 2 16:33 model.pnml

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

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

no data necessary for post analysis


=== Now, execution of the tool begins

BK_START 1717370329169

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=StateSpace
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyA-PT-15
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
StateSpace PT
Running Version 202405141337
[2024-06-02 23:18:51] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StateSpace, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-06-02 23:18:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 23:18:52] [INFO ] Load time of PNML (sax parser for PT used): 205 ms
[2024-06-02 23:18:52] [INFO ] Transformed 192 places.
[2024-06-02 23:18:52] [INFO ] Transformed 475 transitions.
[2024-06-02 23:18:52] [INFO ] Found NUPN structural information;
[2024-06-02 23:18:52] [INFO ] Parsed PT model containing 192 places and 475 transitions and 1522 arcs in 454 ms.
Ensure Unique test removed 2 transitions
Reduce redundant transitions removed 2 transitions.
Starting structural reductions in STATESPACE mode, iteration 0 : 192/192 places, 473/473 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
[2024-06-02 23:18:52] [INFO ] Redundant transitions in 47 ms returned []
Running 468 sub problems to find dead transitions.
// Phase 1: matrix 469 rows 192 cols
[2024-06-02 23:18:52] [INFO ] Computed 7 invariants in 39 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/191 variables, 191/191 constraints. Problems are: Problem set: 0 solved, 468 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/191 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 468 unsolved
At refinement iteration 2 (OVERLAPS) 1/192 variables, 7/198 constraints. Problems are: Problem set: 0 solved, 468 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/192 variables, 1/199 constraints. Problems are: Problem set: 0 solved, 468 unsolved
[2024-06-02 23:19:03] [INFO ] Deduced a trap composed of 17 places in 125 ms of which 18 ms to minimize.
[2024-06-02 23:19:03] [INFO ] Deduced a trap composed of 18 places in 134 ms of which 3 ms to minimize.
[2024-06-02 23:19:03] [INFO ] Deduced a trap composed of 18 places in 171 ms of which 3 ms to minimize.
[2024-06-02 23:19:03] [INFO ] Deduced a trap composed of 17 places in 227 ms of which 4 ms to minimize.
[2024-06-02 23:19:04] [INFO ] Deduced a trap composed of 24 places in 99 ms of which 3 ms to minimize.
[2024-06-02 23:19:04] [INFO ] Deduced a trap composed of 35 places in 78 ms of which 1 ms to minimize.
[2024-06-02 23:19:04] [INFO ] Deduced a trap composed of 22 places in 65 ms of which 2 ms to minimize.
[2024-06-02 23:19:04] [INFO ] Deduced a trap composed of 19 places in 144 ms of which 4 ms to minimize.
[2024-06-02 23:19:04] [INFO ] Deduced a trap composed of 99 places in 129 ms of which 2 ms to minimize.
[2024-06-02 23:19:04] [INFO ] Deduced a trap composed of 42 places in 134 ms of which 2 ms to minimize.
[2024-06-02 23:19:04] [INFO ] Deduced a trap composed of 105 places in 116 ms of which 2 ms to minimize.
[2024-06-02 23:19:04] [INFO ] Deduced a trap composed of 46 places in 121 ms of which 2 ms to minimize.
[2024-06-02 23:19:05] [INFO ] Deduced a trap composed of 99 places in 129 ms of which 2 ms to minimize.
[2024-06-02 23:19:05] [INFO ] Deduced a trap composed of 99 places in 147 ms of which 2 ms to minimize.
[2024-06-02 23:19:05] [INFO ] Deduced a trap composed of 52 places in 261 ms of which 16 ms to minimize.
[2024-06-02 23:19:06] [INFO ] Deduced a trap composed of 97 places in 155 ms of which 2 ms to minimize.
[2024-06-02 23:19:06] [INFO ] Deduced a trap composed of 65 places in 75 ms of which 2 ms to minimize.
[2024-06-02 23:19:06] [INFO ] Deduced a trap composed of 30 places in 151 ms of which 2 ms to minimize.
[2024-06-02 23:19:06] [INFO ] Deduced a trap composed of 19 places in 73 ms of which 2 ms to minimize.
[2024-06-02 23:19:07] [INFO ] Deduced a trap composed of 52 places in 143 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/192 variables, 20/219 constraints. Problems are: Problem set: 0 solved, 468 unsolved
[2024-06-02 23:19:07] [INFO ] Deduced a trap composed of 99 places in 120 ms of which 2 ms to minimize.
[2024-06-02 23:19:07] [INFO ] Deduced a trap composed of 99 places in 106 ms of which 2 ms to minimize.
[2024-06-02 23:19:08] [INFO ] Deduced a trap composed of 44 places in 165 ms of which 2 ms to minimize.
[2024-06-02 23:19:08] [INFO ] Deduced a trap composed of 46 places in 186 ms of which 3 ms to minimize.
[2024-06-02 23:19:09] [INFO ] Deduced a trap composed of 76 places in 198 ms of which 3 ms to minimize.
[2024-06-02 23:19:09] [INFO ] Deduced a trap composed of 82 places in 234 ms of which 3 ms to minimize.
[2024-06-02 23:19:09] [INFO ] Deduced a trap composed of 37 places in 83 ms of which 1 ms to minimize.
[2024-06-02 23:19:09] [INFO ] Deduced a trap composed of 30 places in 143 ms of which 3 ms to minimize.
[2024-06-02 23:19:09] [INFO ] Deduced a trap composed of 38 places in 217 ms of which 4 ms to minimize.
[2024-06-02 23:19:10] [INFO ] Deduced a trap composed of 77 places in 213 ms of which 3 ms to minimize.
[2024-06-02 23:19:10] [INFO ] Deduced a trap composed of 34 places in 204 ms of which 4 ms to minimize.
[2024-06-02 23:19:10] [INFO ] Deduced a trap composed of 29 places in 211 ms of which 3 ms to minimize.
[2024-06-02 23:19:10] [INFO ] Deduced a trap composed of 108 places in 247 ms of which 4 ms to minimize.
[2024-06-02 23:19:11] [INFO ] Deduced a trap composed of 33 places in 210 ms of which 2 ms to minimize.
[2024-06-02 23:19:11] [INFO ] Deduced a trap composed of 32 places in 181 ms of which 7 ms to minimize.
[2024-06-02 23:19:11] [INFO ] Deduced a trap composed of 76 places in 121 ms of which 2 ms to minimize.
[2024-06-02 23:19:11] [INFO ] Deduced a trap composed of 44 places in 112 ms of which 2 ms to minimize.
[2024-06-02 23:19:11] [INFO ] Deduced a trap composed of 51 places in 128 ms of which 2 ms to minimize.
[2024-06-02 23:19:12] [INFO ] Deduced a trap composed of 37 places in 133 ms of which 2 ms to minimize.
[2024-06-02 23:19:12] [INFO ] Deduced a trap composed of 34 places in 126 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/192 variables, 20/239 constraints. Problems are: Problem set: 0 solved, 468 unsolved
[2024-06-02 23:19:13] [INFO ] Deduced a trap composed of 121 places in 107 ms of which 2 ms to minimize.
[2024-06-02 23:19:13] [INFO ] Deduced a trap composed of 46 places in 121 ms of which 2 ms to minimize.
[2024-06-02 23:19:14] [INFO ] Deduced a trap composed of 52 places in 122 ms of which 2 ms to minimize.
[2024-06-02 23:19:14] [INFO ] Deduced a trap composed of 31 places in 170 ms of which 3 ms to minimize.
[2024-06-02 23:19:14] [INFO ] Deduced a trap composed of 38 places in 222 ms of which 3 ms to minimize.
[2024-06-02 23:19:15] [INFO ] Deduced a trap composed of 42 places in 244 ms of which 4 ms to minimize.
[2024-06-02 23:19:15] [INFO ] Deduced a trap composed of 29 places in 240 ms of which 3 ms to minimize.
[2024-06-02 23:19:15] [INFO ] Deduced a trap composed of 36 places in 233 ms of which 3 ms to minimize.
[2024-06-02 23:19:16] [INFO ] Deduced a trap composed of 30 places in 234 ms of which 3 ms to minimize.
[2024-06-02 23:19:16] [INFO ] Deduced a trap composed of 105 places in 177 ms of which 3 ms to minimize.
[2024-06-02 23:19:16] [INFO ] Deduced a trap composed of 26 places in 202 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/192 variables, 11/250 constraints. Problems are: Problem set: 0 solved, 468 unsolved
[2024-06-02 23:19:22] [INFO ] Deduced a trap composed of 121 places in 194 ms of which 2 ms to minimize.
[2024-06-02 23:19:23] [INFO ] Deduced a trap composed of 97 places in 232 ms of which 4 ms to minimize.
SMT process timed out in 30858ms, After SMT, problems are : Problem set: 0 solved, 468 unsolved
Search for dead transitions found 0 dead transitions in 30935ms
Starting structural reductions in STATESPACE mode, iteration 1 : 192/192 places, 469/473 transitions.
Finished structural reductions in STATESPACE mode , in 1 iterations and 31231 ms. Remains : 192/192 places, 469/473 transitions.
Final net has 192 places and 469 transitions.
[2024-06-02 23:19:23] [INFO ] Flatten gal took : 151 ms
[2024-06-02 23:19:23] [INFO ] Applying decomposition
[2024-06-02 23:19:24] [INFO ] Flatten gal took : 62 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph2479188448371637631.txt' '-o' '/tmp/graph2479188448371637631.bin' '-w' '/tmp/graph2479188448371637631.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2479188448371637631.bin' '-l' '-1' '-v' '-w' '/tmp/graph2479188448371637631.weights' '-q' '0' '-e' '0.001'
[2024-06-02 23:19:24] [INFO ] Decomposing Gal with order
[2024-06-02 23:19:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 23:19:24] [INFO ] Removed a total of 614 redundant transitions.
[2024-06-02 23:19:24] [INFO ] Flatten gal took : 158 ms
[2024-06-02 23:19:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 64 labels/synchronizations in 26 ms.
[2024-06-02 23:19:24] [INFO ] Time to serialize gal into /tmp/StateSpace13927701009366918237.gal : 19 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/StateSpace13927701009366918237.gal' '-t' 'CGAL' '--stats'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...220
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,2.01815e+07,1.32106,26360,1490,71,39759,1598,847,84626,71,7541,0
Total reachable state count : 20181500

Max variable value : 1
STATE_SPACE MAX_TOKEN_IN_PLACE 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Maximum sum along a path : 7
STATE_SPACE MAX_TOKEN_PER_MARKING 7 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Exact state count : 20181500
STATE_SPACE STATES 20181500 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Total runtime 34508 ms.

BK_STOP 1717370366164

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ StateSpace = StateSpace ]]
+ [[ -f modelMain.xml ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution StateSpace -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination StateSpace -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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="MedleyA-PT-15"
export BK_EXAMINATION="StateSpace"
export BK_TOOL="itstools"
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-5568"
echo " Executing tool itstools"
echo " Input is MedleyA-PT-15, examination is StateSpace"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r576-smll-171734920100120"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/MedleyA-PT-15.tgz
mv MedleyA-PT-15 execution
cd execution
if [ "StateSpace" = "ReachabilityDeadlock" ] || [ "StateSpace" = "UpperBounds" ] || [ "StateSpace" = "QuasiLiveness" ] || [ "StateSpace" = "StableMarking" ] || [ "StateSpace" = "Liveness" ] || [ "StateSpace" = "OneSafe" ] || [ "StateSpace" = "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 [ "StateSpace" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "StateSpace" != "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 "StateSpace.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property StateSpace.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "StateSpace.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 '' StateSpace.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "StateSpace" = "ReachabilityDeadlock" ] || [ "StateSpace" = "QuasiLiveness" ] || [ "StateSpace" = "StableMarking" ] || [ "StateSpace" = "Liveness" ] || [ "StateSpace" = "OneSafe" ] ; then
echo "FORMULA_NAME StateSpace"
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 ;