Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r168-tall-174881266800296.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-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-5832
Executing tool gold2024
Input is PolyORBLF-PT-S04J04T10, examination is ReachabilityDeadlock
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r168-tall-174881266800296
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 5.8M
-rw-r--r-- 1 mcc users 32K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 159K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 94K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 415K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 66K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 12K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 53K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 37K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 187K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 101K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 467K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 7.7K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 10 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 4.2M May 29 14:32 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 1748900007086

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=ReachabilityDeadlock
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=PolyORBLF-PT-S04J04T10
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2025-06-02 21:33:28] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityDeadlock, -timeout, 180, -rebuildPNML]
[2025-06-02 21:33:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 21:33:28] [INFO ] Load time of PNML (sax parser for PT used): 316 ms
[2025-06-02 21:33:28] [INFO ] Transformed 870 places.
[2025-06-02 21:33:28] [INFO ] Transformed 5034 transitions.
[2025-06-02 21:33:28] [INFO ] Parsed PT model containing 870 places and 5034 transitions and 34774 arcs in 458 ms.
Parsed 1 properties from file /home/mcc/execution/ReachabilityDeadlock.xml in 5 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 2710 transitions
Reduce redundant transitions removed 2710 transitions.
Built sparse matrix representations for Structural reductions in 7 ms.28806KB memory used
Starting structural reductions in DEADLOCK mode, iteration 0 : 870/870 places, 2324/2324 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Ensure Unique test removed 4 places
Computed a total of 0 stabilizing places and 0 stable transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 90 transitions
Trivial Post-agglo rules discarded 90 transitions
Performed 90 trivial Post agglomeration. Transition count delta: 90
Iterating post reduction 0 with 94 rules applied. Total rules applied 94 place count 866 transition count 2234
Reduce places removed 90 places and 0 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Iterating post reduction 1 with 90 rules applied. Total rules applied 184 place count 776 transition count 2234
Computed a total of 0 stabilizing places and 0 stable transitions
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 100 Pre rules applied. Total rules applied 184 place count 776 transition count 2134
Deduced a syphon composed of 100 places in 4 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 2 with 200 rules applied. Total rules applied 384 place count 676 transition count 2134
Computed a total of 0 stabilizing places and 0 stable transitions
Performed 100 Post agglomeration using F-continuation condition.Transition count delta: 100
Deduced a syphon composed of 100 places in 2 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 2 with 200 rules applied. Total rules applied 584 place count 576 transition count 2034
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 584 rules in 393 ms. Remains 576 /870 variables (removed 294) and now considering 2034/2324 (removed 290) transitions.
Running 2030 sub problems to find dead transitions.
[2025-06-02 21:33:29] [INFO ] Flow matrix only has 1994 transitions (discarded 40 similar events)
// Phase 1: matrix 1994 rows 576 cols
[2025-06-02 21:33:29] [INFO ] Computed 54 invariants in 108 ms
[2025-06-02 21:33:29] [INFO ] State equation strengthened by 200 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/572 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 2030 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/572 variables, 35/49 constraints. Problems are: Problem set: 0 solved, 2030 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 572/2570 variables, and 49 constraints, problems are : Problem set: 0 solved, 2030 unsolved in 20092 ms.
Refiners :[Positive P Invariants (semi-flows): 14/16 constraints, Generalized P Invariants (flows): 35/38 constraints, State Equation: 0/576 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 2030/2030 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2030 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/572 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 2030 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/572 variables, 35/49 constraints. Problems are: Problem set: 0 solved, 2030 unsolved
[2025-06-02 21:34:05] [INFO ] Deduced a trap composed of 47 places in 437 ms of which 27 ms to minimize.
[2025-06-02 21:34:06] [INFO ] Deduced a trap composed of 46 places in 487 ms of which 7 ms to minimize.
[2025-06-02 21:34:06] [INFO ] Deduced a trap composed of 46 places in 357 ms of which 4 ms to minimize.
[2025-06-02 21:34:07] [INFO ] Deduced a trap composed of 23 places in 444 ms of which 3 ms to minimize.
[2025-06-02 21:34:07] [INFO ] Deduced a trap composed of 47 places in 49 ms of which 0 ms to minimize.
[2025-06-02 21:34:07] [INFO ] Deduced a trap composed of 47 places in 46 ms of which 1 ms to minimize.
[2025-06-02 21:34:07] [INFO ] Deduced a trap composed of 47 places in 67 ms of which 1 ms to minimize.
[2025-06-02 21:34:07] [INFO ] Deduced a trap composed of 47 places in 42 ms of which 1 ms to minimize.
[2025-06-02 21:34:08] [INFO ] Deduced a trap composed of 206 places in 384 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 572/2570 variables, and 58 constraints, problems are : Problem set: 0 solved, 2030 unsolved in 20035 ms.
Refiners :[Positive P Invariants (semi-flows): 14/16 constraints, Generalized P Invariants (flows): 35/38 constraints, State Equation: 0/576 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 0/2030 constraints, Known Traps: 9/9 constraints]
After SMT, in 51474ms problems are : Problem set: 0 solved, 2030 unsolved
Search for dead transitions found 0 dead transitions in 51535ms
Finished structural reductions in DEADLOCK mode , in 1 iterations and 51987 ms. Remains : 576/870 places, 2034/2324 transitions.
Finished random walk after 18102 steps, including 0 resets, run found a deadlock after 206 ms. (steps per millisecond=87 )
FORMULA ReachabilityDeadlock TRUE TECHNIQUES TOPOLOGICAL STRUCTURAL_REDUCTION RANDOM_WALK
Total runtime 52788 ms.
ITS solved all properties within timeout

BK_STOP 1748900061203

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityDeadlock -timeout 180 -rebuildPNML

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="PolyORBLF-PT-S04J04T10"
export BK_EXAMINATION="ReachabilityDeadlock"
export BK_TOOL="gold2024"
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-5832"
echo " Executing tool gold2024"
echo " Input is PolyORBLF-PT-S04J04T10, 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 r168-tall-174881266800296"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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