Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r290-tajo-171654447300528.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
........................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is ProductionCell-PT-none, examination is StateSpace
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r290-tajo-171654447300528
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 492K
-rw-r--r-- 1 mcc users 7.4K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K 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.8K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 13 10:56 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 118K Apr 13 10:56 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.6K Apr 13 10:52 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 77K Apr 13 10:52 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 43K 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 1716934820961

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=StateSpace
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ProductionCell-PT-none
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
StateSpace PT
Running Version 202405141337
[2024-05-28 22:20:22] [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-28 22:20:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 22:20:22] [INFO ] Load time of PNML (sax parser for PT used): 56 ms
[2024-05-28 22:20:22] [INFO ] Transformed 176 places.
[2024-05-28 22:20:22] [INFO ] Transformed 134 transitions.
[2024-05-28 22:20:22] [INFO ] Found NUPN structural information;
[2024-05-28 22:20:22] [INFO ] Parsed PT model containing 176 places and 134 transitions and 513 arcs in 156 ms.
Starting structural reductions in STATESPACE mode, iteration 0 : 176/176 places, 134/134 transitions.
[2024-05-28 22:20:22] [INFO ] Redundant transitions in 3 ms returned []
Running 133 sub problems to find dead transitions.
// Phase 1: matrix 134 rows 176 cols
[2024-05-28 22:20:22] [INFO ] Computed 50 invariants in 13 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/175 variables, 175/175 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/175 variables, 14/189 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/175 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 133 unsolved
Problem TDEAD124 is UNSAT
At refinement iteration 3 (OVERLAPS) 1/176 variables, 32/221 constraints. Problems are: Problem set: 1 solved, 132 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/176 variables, 1/222 constraints. Problems are: Problem set: 1 solved, 132 unsolved
Problem TDEAD133 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/176 variables, 4/226 constraints. Problems are: Problem set: 2 solved, 131 unsolved
[2024-05-28 22:20:24] [INFO ] Deduced a trap composed of 14 places in 88 ms of which 16 ms to minimize.
[2024-05-28 22:20:24] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 1 ms to minimize.
[2024-05-28 22:20:24] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 1 ms to minimize.
[2024-05-28 22:20:24] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 1 ms to minimize.
[2024-05-28 22:20:24] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 1 ms to minimize.
[2024-05-28 22:20:24] [INFO ] Deduced a trap composed of 7 places in 43 ms of which 1 ms to minimize.
[2024-05-28 22:20:24] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 1 ms to minimize.
Problem TDEAD44 is UNSAT
[2024-05-28 22:20:24] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 1 ms to minimize.
[2024-05-28 22:20:25] [INFO ] Deduced a trap composed of 7 places in 40 ms of which 1 ms to minimize.
Problem TDEAD51 is UNSAT
Problem TDEAD53 is UNSAT
[2024-05-28 22:20:25] [INFO ] Deduced a trap composed of 8 places in 40 ms of which 2 ms to minimize.
Problem TDEAD47 is UNSAT
Problem TDEAD49 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/176 variables, 10/236 constraints. Problems are: Problem set: 7 solved, 126 unsolved
[2024-05-28 22:20:25] [INFO ] Deduced a trap composed of 8 places in 37 ms of which 1 ms to minimize.
[2024-05-28 22:20:25] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/176 variables, 2/238 constraints. Problems are: Problem set: 7 solved, 126 unsolved
[2024-05-28 22:20:26] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
[2024-05-28 22:20:26] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/176 variables, 2/240 constraints. Problems are: Problem set: 7 solved, 126 unsolved
[2024-05-28 22:20:26] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/176 variables, 1/241 constraints. Problems are: Problem set: 7 solved, 126 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/176 variables, 0/241 constraints. Problems are: Problem set: 7 solved, 126 unsolved
At refinement iteration 11 (OVERLAPS) 134/310 variables, 176/417 constraints. Problems are: Problem set: 7 solved, 126 unsolved
[2024-05-28 22:20:28] [INFO ] Deduced a trap composed of 10 places in 60 ms of which 1 ms to minimize.
[2024-05-28 22:20:28] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 1 ms to minimize.
[2024-05-28 22:20:28] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 1 ms to minimize.
[2024-05-28 22:20:28] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 0 ms to minimize.
[2024-05-28 22:20:28] [INFO ] Deduced a trap composed of 8 places in 52 ms of which 1 ms to minimize.
[2024-05-28 22:20:28] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 1 ms to minimize.
[2024-05-28 22:20:28] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/310 variables, 7/424 constraints. Problems are: Problem set: 7 solved, 126 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/310 variables, 0/424 constraints. Problems are: Problem set: 7 solved, 126 unsolved
[2024-05-28 22:20:30] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 1 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/310 variables, 1/425 constraints. Problems are: Problem set: 7 solved, 126 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/310 variables, 0/425 constraints. Problems are: Problem set: 7 solved, 126 unsolved
At refinement iteration 16 (OVERLAPS) 0/310 variables, 0/425 constraints. Problems are: Problem set: 7 solved, 126 unsolved
No progress, stopping.
After SMT solving in domain Real declared 310/310 variables, and 425 constraints, problems are : Problem set: 7 solved, 126 unsolved in 9664 ms.
Refiners :[Domain max(s): 176/176 constraints, Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 176/176 constraints, PredecessorRefiner: 133/133 constraints, Known Traps: 23/23 constraints]
Escalating to Integer solving :Problem set: 7 solved, 126 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/175 variables, 175/175 constraints. Problems are: Problem set: 7 solved, 126 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/175 variables, 14/189 constraints. Problems are: Problem set: 7 solved, 126 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/175 variables, 0/189 constraints. Problems are: Problem set: 7 solved, 126 unsolved
At refinement iteration 3 (OVERLAPS) 1/176 variables, 32/221 constraints. Problems are: Problem set: 7 solved, 126 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/176 variables, 1/222 constraints. Problems are: Problem set: 7 solved, 126 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/176 variables, 4/226 constraints. Problems are: Problem set: 7 solved, 126 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/176 variables, 23/249 constraints. Problems are: Problem set: 7 solved, 126 unsolved
[2024-05-28 22:20:33] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 1 ms to minimize.
[2024-05-28 22:20:33] [INFO ] Deduced a trap composed of 19 places in 56 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/176 variables, 2/251 constraints. Problems are: Problem set: 7 solved, 126 unsolved
[2024-05-28 22:20:34] [INFO ] Deduced a trap composed of 27 places in 58 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/176 variables, 1/252 constraints. Problems are: Problem set: 7 solved, 126 unsolved
[2024-05-28 22:20:35] [INFO ] Deduced a trap composed of 20 places in 58 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/176 variables, 1/253 constraints. Problems are: Problem set: 7 solved, 126 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/176 variables, 0/253 constraints. Problems are: Problem set: 7 solved, 126 unsolved
At refinement iteration 11 (OVERLAPS) 134/310 variables, 176/429 constraints. Problems are: Problem set: 7 solved, 126 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/310 variables, 126/555 constraints. Problems are: Problem set: 7 solved, 126 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/310 variables, 0/555 constraints. Problems are: Problem set: 7 solved, 126 unsolved
At refinement iteration 14 (OVERLAPS) 0/310 variables, 0/555 constraints. Problems are: Problem set: 7 solved, 126 unsolved
No progress, stopping.
After SMT solving in domain Int declared 310/310 variables, and 555 constraints, problems are : Problem set: 7 solved, 126 unsolved in 18645 ms.
Refiners :[Domain max(s): 176/176 constraints, Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 176/176 constraints, PredecessorRefiner: 126/133 constraints, Known Traps: 27/27 constraints]
After SMT, in 28420ms problems are : Problem set: 7 solved, 126 unsolved
Search for dead transitions found 7 dead transitions in 28438ms
Found 7 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 7 transitions
Dead transitions reduction (with SMT) removed 7 transitions
Starting structural reductions in STATESPACE mode, iteration 1 : 176/176 places, 127/134 transitions.
[2024-05-28 22:20:51] [INFO ] Redundant transitions in 2 ms returned []
Finished structural reductions in STATESPACE mode , in 2 iterations and 28551 ms. Remains : 176/176 places, 127/134 transitions.
Final net has 176 places and 127 transitions.
[2024-05-28 22:20:51] [INFO ] Flatten gal took : 45 ms
[2024-05-28 22:20:51] [INFO ] Applying decomposition
[2024-05-28 22:20:51] [INFO ] Flatten gal took : 13 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/graph6368055862370713261.txt' '-o' '/tmp/graph6368055862370713261.bin' '-w' '/tmp/graph6368055862370713261.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph6368055862370713261.bin' '-l' '-1' '-v' '-w' '/tmp/graph6368055862370713261.weights' '-q' '0' '-e' '0.001'
[2024-05-28 22:20:51] [INFO ] Decomposing Gal with order
[2024-05-28 22:20:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 22:20:51] [INFO ] Removed a total of 48 redundant transitions.
[2024-05-28 22:20:51] [INFO ] Flatten gal took : 46 ms
[2024-05-28 22:20:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 9 ms.
[2024-05-28 22:20:51] [INFO ] Time to serialize gal into /tmp/StateSpace16714373951160756478.gal : 6 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/StateSpace16714373951160756478.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,1.13293e+13,0.324287,19768,800,54,41762,286,520,44546,63,908,0
Total reachable state count : 11329291100161

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

BK_STOP 1716934851970

--------------------
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="ProductionCell-PT-none"
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 ProductionCell-PT-none, 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 r290-tajo-171654447300528"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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