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.r286-smll-171654422600016.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 gold2023
Input is ParamProductionCell-PT-2, examination is ReachabilityDeadlock
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r286-smll-171654422600016
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 768K
-rw-r--r-- 1 mcc users 11K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 99K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K 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 4.0K Apr 23 07:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Apr 23 07:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Apr 23 07:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Apr 23 07:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K Apr 12 20:28 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 152K Apr 12 20:28 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 19K Apr 12 20:27 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 133K Apr 12 20:27 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:41 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Apr 23 07:41 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 2 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 174K May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

FORMULA_NAME ReachabilityDeadlock

=== Now, execution of the tool begins

BK_START 1716797475787

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=gold2023
BK_EXAMINATION=ReachabilityDeadlock
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=ParamProductionCell-PT-2
Not applying reductions.
Model is PT
ReachabilityDeadlock PT
Running Version 202304061127
[2024-05-27 08:11:19] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityDeadlock, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 1800]
[2024-05-27 08:11:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-27 08:11:19] [INFO ] Load time of PNML (sax parser for PT used): 171 ms
[2024-05-27 08:11:19] [INFO ] Transformed 231 places.
[2024-05-27 08:11:19] [INFO ] Transformed 202 transitions.
[2024-05-27 08:11:19] [INFO ] Found NUPN structural information;
[2024-05-27 08:11:19] [INFO ] Parsed PT model containing 231 places and 202 transitions and 846 arcs in 344 ms.
Parsed 1 properties from file /home/mcc/execution/ReachabilityDeadlock.xml in 5 ms.
Working with output stream class java.io.PrintStream
Built sparse matrix representations for Structural reductions in 7 ms.18941KB memory used
Starting structural reductions in DEADLOCK mode, iteration 0 : 231/231 places, 202/202 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 14 Pre rules applied. Total rules applied 0 place count 231 transition count 188
Deduced a syphon composed of 14 places in 4 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 0 with 28 rules applied. Total rules applied 28 place count 217 transition count 188
Computed a total of 0 stabilizing places and 0 stable transitions
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 34 place count 211 transition count 182
Iterating global reduction 0 with 6 rules applied. Total rules applied 40 place count 211 transition count 182
Computed a total of 0 stabilizing places and 0 stable transitions
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 0 with 36 rules applied. Total rules applied 76 place count 193 transition count 164
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Applied a total of 76 rules in 169 ms. Remains 193 /231 variables (removed 38) and now considering 164/202 (removed 38) transitions.
Finished structural reductions in DEADLOCK mode , in 1 iterations and 173 ms. Remains : 193/231 places, 164/202 transitions.
Random walk for 1250000 steps, including 0 resets, run took 2171 ms (no deadlock found). (steps per millisecond=575 )
Random directed walk for 1250000 steps, including 0 resets, run took 1435 ms (no deadlock found). (steps per millisecond=871 )
// Phase 1: matrix 164 rows 193 cols
[2024-05-27 08:11:23] [INFO ] Computed 59 invariants in 22 ms
[2024-05-27 08:11:24] [INFO ] [Real]Absence check using 35 positive place invariants in 53 ms returned sat
[2024-05-27 08:11:24] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 61 ms returned sat
[2024-05-27 08:11:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 08:11:24] [INFO ] [Real]Absence check using state equation in 604 ms returned sat
[2024-05-27 08:11:24] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 08:11:25] [INFO ] [Nat]Absence check using 35 positive place invariants in 44 ms returned sat
[2024-05-27 08:11:25] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 36 ms returned sat
[2024-05-27 08:11:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-27 08:11:25] [INFO ] [Nat]Absence check using state equation in 553 ms returned sat
[2024-05-27 08:11:25] [INFO ] State equation strengthened by 68 read => feed constraints.
[2024-05-27 08:11:25] [INFO ] [Nat]Added 68 Read/Feed constraints in 79 ms returned sat
[2024-05-27 08:11:25] [INFO ] Deduced a trap composed of 14 places in 195 ms of which 6 ms to minimize.
[2024-05-27 08:11:26] [INFO ] Deduced a trap composed of 7 places in 172 ms of which 2 ms to minimize.
[2024-05-27 08:11:26] [INFO ] Deduced a trap composed of 10 places in 122 ms of which 3 ms to minimize.
[2024-05-27 08:11:26] [INFO ] Deduced a trap composed of 7 places in 111 ms of which 1 ms to minimize.
[2024-05-27 08:11:26] [INFO ] Deduced a trap composed of 5 places in 119 ms of which 1 ms to minimize.
[2024-05-27 08:11:26] [INFO ] Deduced a trap composed of 11 places in 127 ms of which 1 ms to minimize.
[2024-05-27 08:11:26] [INFO ] Deduced a trap composed of 7 places in 153 ms of which 1 ms to minimize.
[2024-05-27 08:11:27] [INFO ] Deduced a trap composed of 5 places in 120 ms of which 1 ms to minimize.
[2024-05-27 08:11:27] [INFO ] Deduced a trap composed of 5 places in 99 ms of which 1 ms to minimize.
[2024-05-27 08:11:27] [INFO ] Deduced a trap composed of 13 places in 92 ms of which 1 ms to minimize.
[2024-05-27 08:11:27] [INFO ] Deduced a trap composed of 7 places in 88 ms of which 1 ms to minimize.
[2024-05-27 08:11:27] [INFO ] Deduced a trap composed of 10 places in 100 ms of which 0 ms to minimize.
[2024-05-27 08:11:27] [INFO ] Deduced a trap composed of 8 places in 91 ms of which 1 ms to minimize.
[2024-05-27 08:11:27] [INFO ] Deduced a trap composed of 16 places in 62 ms of which 1 ms to minimize.
[2024-05-27 08:11:27] [INFO ] Deduced a trap composed of 15 places in 70 ms of which 0 ms to minimize.
[2024-05-27 08:11:28] [INFO ] Deduced a trap composed of 7 places in 106 ms of which 1 ms to minimize.
[2024-05-27 08:11:28] [INFO ] Deduced a trap composed of 19 places in 107 ms of which 1 ms to minimize.
[2024-05-27 08:11:28] [INFO ] Deduced a trap composed of 34 places in 111 ms of which 0 ms to minimize.
[2024-05-27 08:11:28] [INFO ] Deduced a trap composed of 7 places in 90 ms of which 0 ms to minimize.
[2024-05-27 08:11:28] [INFO ] Deduced a trap composed of 24 places in 65 ms of which 1 ms to minimize.
[2024-05-27 08:11:28] [INFO ] Deduced a trap composed of 6 places in 91 ms of which 1 ms to minimize.
[2024-05-27 08:11:28] [INFO ] Deduced a trap composed of 16 places in 101 ms of which 2 ms to minimize.
[2024-05-27 08:11:28] [INFO ] Deduced a trap composed of 36 places in 91 ms of which 1 ms to minimize.
[2024-05-27 08:11:29] [INFO ] Deduced a trap composed of 44 places in 79 ms of which 1 ms to minimize.
[2024-05-27 08:11:29] [INFO ] Deduced a trap composed of 17 places in 122 ms of which 0 ms to minimize.
[2024-05-27 08:11:29] [INFO ] Deduced a trap composed of 29 places in 119 ms of which 1 ms to minimize.
[2024-05-27 08:11:29] [INFO ] Deduced a trap composed of 5 places in 112 ms of which 1 ms to minimize.
[2024-05-27 08:11:29] [INFO ] Deduced a trap composed of 41 places in 103 ms of which 1 ms to minimize.
[2024-05-27 08:11:29] [INFO ] Deduced a trap composed of 30 places in 128 ms of which 1 ms to minimize.
[2024-05-27 08:11:29] [INFO ] Deduced a trap composed of 17 places in 77 ms of which 0 ms to minimize.
[2024-05-27 08:11:29] [INFO ] Deduced a trap composed of 7 places in 51 ms of which 0 ms to minimize.
[2024-05-27 08:11:30] [INFO ] Deduced a trap composed of 8 places in 120 ms of which 1 ms to minimize.
[2024-05-27 08:11:30] [INFO ] Deduced a trap composed of 37 places in 111 ms of which 1 ms to minimize.
[2024-05-27 08:11:30] [INFO ] Deduced a trap composed of 27 places in 94 ms of which 1 ms to minimize.
[2024-05-27 08:11:30] [INFO ] Deduced a trap composed of 27 places in 108 ms of which 8 ms to minimize.
[2024-05-27 08:11:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 35 trap constraints in 4902 ms
FORMULA ReachabilityDeadlock FALSE TECHNIQUES TOPOLOGICAL SAT_SMT STRUCTURAL_REDUCTION
Total runtime 11501 ms.

BK_STOP 1716797491507

--------------------
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
+ [[ ReachabilityDeadlock = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityDeadlock -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800
+ 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.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityDeadlock -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800

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="ParamProductionCell-PT-2"
export BK_EXAMINATION="ReachabilityDeadlock"
export BK_TOOL="gold2023"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
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 gold2023"
echo " Input is ParamProductionCell-PT-2, examination is ReachabilityDeadlock"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r286-smll-171654422600016"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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