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.r378-smll-171683811400384.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 SmartHome-PT-06, examination is StateSpace
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r378-smll-171683811400384
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 468K
-rw-r--r-- 1 mcc users 7.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:57 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Apr 23 07:57 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 23 07:57 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 07:57 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.6K Apr 12 03:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 101K Apr 12 03:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Apr 12 03:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K Apr 12 03:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:57 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:57 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 56K May 18 16:43 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 1717030885784

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=StateSpace
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SmartHome-PT-06
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
StateSpace PT
Running Version 202405141337
[2024-05-30 01:01:27] [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-05-30 01:01:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-30 01:01:28] [INFO ] Load time of PNML (sax parser for PT used): 163 ms
[2024-05-30 01:01:28] [INFO ] Transformed 219 places.
[2024-05-30 01:01:28] [INFO ] Transformed 254 transitions.
[2024-05-30 01:01:28] [INFO ] Found NUPN structural information;
[2024-05-30 01:01:28] [INFO ] Parsed PT model containing 219 places and 254 transitions and 581 arcs in 475 ms.
Deduced a syphon composed of 17 places in 5 ms
Reduce places removed 17 places and 18 transitions.
Starting structural reductions in STATESPACE mode, iteration 0 : 202/202 places, 236/236 transitions.
[2024-05-30 01:01:28] [INFO ] Redundant transitions in 23 ms returned []
Running 235 sub problems to find dead transitions.
// Phase 1: matrix 236 rows 202 cols
[2024-05-30 01:01:28] [INFO ] Computed 9 invariants in 18 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/201 variables, 201/201 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/201 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 2 (OVERLAPS) 1/202 variables, 9/210 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/202 variables, 1/211 constraints. Problems are: Problem set: 0 solved, 235 unsolved
[2024-05-30 01:01:34] [INFO ] Deduced a trap composed of 28 places in 274 ms of which 47 ms to minimize.
[2024-05-30 01:01:34] [INFO ] Deduced a trap composed of 26 places in 205 ms of which 4 ms to minimize.
[2024-05-30 01:01:35] [INFO ] Deduced a trap composed of 32 places in 207 ms of which 5 ms to minimize.
[2024-05-30 01:01:35] [INFO ] Deduced a trap composed of 48 places in 164 ms of which 4 ms to minimize.
[2024-05-30 01:01:35] [INFO ] Deduced a trap composed of 32 places in 165 ms of which 4 ms to minimize.
[2024-05-30 01:01:35] [INFO ] Deduced a trap composed of 31 places in 158 ms of which 4 ms to minimize.
[2024-05-30 01:01:35] [INFO ] Deduced a trap composed of 27 places in 153 ms of which 4 ms to minimize.
[2024-05-30 01:01:35] [INFO ] Deduced a trap composed of 31 places in 130 ms of which 3 ms to minimize.
[2024-05-30 01:01:36] [INFO ] Deduced a trap composed of 31 places in 103 ms of which 2 ms to minimize.
[2024-05-30 01:01:36] [INFO ] Deduced a trap composed of 27 places in 56 ms of which 2 ms to minimize.
[2024-05-30 01:01:36] [INFO ] Deduced a trap composed of 50 places in 55 ms of which 1 ms to minimize.
[2024-05-30 01:01:36] [INFO ] Deduced a trap composed of 54 places in 56 ms of which 2 ms to minimize.
[2024-05-30 01:01:36] [INFO ] Deduced a trap composed of 47 places in 188 ms of which 3 ms to minimize.
[2024-05-30 01:01:37] [INFO ] Deduced a trap composed of 47 places in 70 ms of which 2 ms to minimize.
[2024-05-30 01:01:37] [INFO ] Deduced a trap composed of 75 places in 68 ms of which 2 ms to minimize.
[2024-05-30 01:01:37] [INFO ] Deduced a trap composed of 43 places in 93 ms of which 2 ms to minimize.
[2024-05-30 01:01:37] [INFO ] Deduced a trap composed of 53 places in 54 ms of which 1 ms to minimize.
[2024-05-30 01:01:37] [INFO ] Deduced a trap composed of 56 places in 50 ms of which 1 ms to minimize.
[2024-05-30 01:01:37] [INFO ] Deduced a trap composed of 62 places in 54 ms of which 2 ms to minimize.
[2024-05-30 01:01:37] [INFO ] Deduced a trap composed of 48 places in 54 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/202 variables, 20/231 constraints. Problems are: Problem set: 0 solved, 235 unsolved
[2024-05-30 01:01:38] [INFO ] Deduced a trap composed of 47 places in 68 ms of which 2 ms to minimize.
[2024-05-30 01:01:38] [INFO ] Deduced a trap composed of 52 places in 91 ms of which 3 ms to minimize.
[2024-05-30 01:01:38] [INFO ] Deduced a trap composed of 68 places in 91 ms of which 3 ms to minimize.
[2024-05-30 01:01:39] [INFO ] Deduced a trap composed of 49 places in 71 ms of which 3 ms to minimize.
[2024-05-30 01:01:39] [INFO ] Deduced a trap composed of 24 places in 87 ms of which 3 ms to minimize.
[2024-05-30 01:01:39] [INFO ] Deduced a trap composed of 46 places in 80 ms of which 2 ms to minimize.
[2024-05-30 01:01:39] [INFO ] Deduced a trap composed of 27 places in 56 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/202 variables, 7/238 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/202 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 7 (OVERLAPS) 236/438 variables, 202/440 constraints. Problems are: Problem set: 0 solved, 235 unsolved
[2024-05-30 01:01:45] [INFO ] Deduced a trap composed of 50 places in 79 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/438 variables, 1/441 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/438 variables, 0/441 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 10 (OVERLAPS) 0/438 variables, 0/441 constraints. Problems are: Problem set: 0 solved, 235 unsolved
No progress, stopping.
After SMT solving in domain Real declared 438/438 variables, and 441 constraints, problems are : Problem set: 0 solved, 235 unsolved in 25263 ms.
Refiners :[Domain max(s): 202/202 constraints, Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 202/202 constraints, PredecessorRefiner: 235/235 constraints, Known Traps: 28/28 constraints]
Escalating to Integer solving :Problem set: 0 solved, 235 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/201 variables, 201/201 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/201 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 2 (OVERLAPS) 1/202 variables, 9/210 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/202 variables, 1/211 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/202 variables, 28/239 constraints. Problems are: Problem set: 0 solved, 235 unsolved
[2024-05-30 01:01:57] [INFO ] Deduced a trap composed of 43 places in 73 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/202 variables, 1/240 constraints. Problems are: Problem set: 0 solved, 235 unsolved
[2024-05-30 01:01:59] [INFO ] Deduced a trap composed of 55 places in 71 ms of which 2 ms to minimize.
[2024-05-30 01:01:59] [INFO ] Deduced a trap composed of 44 places in 69 ms of which 2 ms to minimize.
[2024-05-30 01:02:00] [INFO ] Deduced a trap composed of 36 places in 55 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/202 variables, 3/243 constraints. Problems are: Problem set: 0 solved, 235 unsolved
[2024-05-30 01:02:00] [INFO ] Deduced a trap composed of 53 places in 95 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/202 variables, 1/244 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/202 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 9 (OVERLAPS) 236/438 variables, 202/446 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/438 variables, 235/681 constraints. Problems are: Problem set: 0 solved, 235 unsolved
[2024-05-30 01:02:05] [INFO ] Deduced a trap composed of 75 places in 66 ms of which 1 ms to minimize.
[2024-05-30 01:02:05] [INFO ] Deduced a trap composed of 57 places in 139 ms of which 7 ms to minimize.
[2024-05-30 01:02:06] [INFO ] Deduced a trap composed of 50 places in 181 ms of which 4 ms to minimize.
[2024-05-30 01:02:06] [INFO ] Deduced a trap composed of 48 places in 137 ms of which 3 ms to minimize.
[2024-05-30 01:02:07] [INFO ] Deduced a trap composed of 52 places in 119 ms of which 3 ms to minimize.
[2024-05-30 01:02:08] [INFO ] Deduced a trap composed of 51 places in 87 ms of which 2 ms to minimize.
[2024-05-30 01:02:09] [INFO ] Deduced a trap composed of 51 places in 96 ms of which 3 ms to minimize.
[2024-05-30 01:02:09] [INFO ] Deduced a trap composed of 49 places in 57 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/438 variables, 8/689 constraints. Problems are: Problem set: 0 solved, 235 unsolved
[2024-05-30 01:02:15] [INFO ] Deduced a trap composed of 43 places in 70 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/438 variables, 1/690 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/438 variables, 0/690 constraints. Problems are: Problem set: 0 solved, 235 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 438/438 variables, and 690 constraints, problems are : Problem set: 0 solved, 235 unsolved in 30037 ms.
Refiners :[Domain max(s): 202/202 constraints, Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 202/202 constraints, PredecessorRefiner: 235/235 constraints, Known Traps: 42/42 constraints]
After SMT, in 55617ms problems are : Problem set: 0 solved, 235 unsolved
Search for dead transitions found 0 dead transitions in 55656ms
Finished structural reductions in STATESPACE mode , in 1 iterations and 55914 ms. Remains : 202/202 places, 236/236 transitions.
Final net has 202 places and 236 transitions.
[2024-05-30 01:02:24] [INFO ] Flatten gal took : 104 ms
[2024-05-30 01:02:24] [INFO ] Applying decomposition
[2024-05-30 01:02:24] [INFO ] Flatten gal took : 34 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/graph14431783758489154549.txt' '-o' '/tmp/graph14431783758489154549.bin' '-w' '/tmp/graph14431783758489154549.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14431783758489154549.bin' '-l' '-1' '-v' '-w' '/tmp/graph14431783758489154549.weights' '-q' '0' '-e' '0.001'
[2024-05-30 01:02:25] [INFO ] Decomposing Gal with order
[2024-05-30 01:02:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 01:02:25] [INFO ] Removed a total of 43 redundant transitions.
[2024-05-30 01:02:25] [INFO ] Flatten gal took : 117 ms
[2024-05-30 01:02:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 12 labels/synchronizations in 17 ms.
[2024-05-30 01:02:25] [INFO ] Time to serialize gal into /tmp/StateSpace1606261455190773293.gal : 16 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/StateSpace1606261455190773293.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 ...219
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,1.50828e+10,0.886668,26796,2421,173,41009,1267,495,92006,95,5186,0
Total reachable state count : 15082804223

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

BK_STOP 1717030946461

--------------------
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="SmartHome-PT-06"
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 SmartHome-PT-06, 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 r378-smll-171683811400384"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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