fond
Model Checking Contest 2025
15th edition, Paris, France, June 24, 2025
Execution of r084-tall-174860080700486
Last Updated
June 24, 2025

About the Execution of 2024-gold for EisenbergMcGuire-PT-06

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15684.340 11334.00 17795.00 135.10 F normal

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.r084-tall-174860080700486.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 EisenbergMcGuire-PT-06, examination is ReachabilityDeadlock
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r084-tall-174860080700486
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.3M
-rw-r--r-- 1 mcc users 7.5K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.2K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.3K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 22K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 133K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 89K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 753K 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 1748741270769

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=ReachabilityDeadlock
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=EisenbergMcGuire-PT-06
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2025-06-01 01:27:52] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityDeadlock, -timeout, 180, -rebuildPNML]
[2025-06-01 01:27:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-01 01:27:52] [INFO ] Load time of PNML (sax parser for PT used): 139 ms
[2025-06-01 01:27:52] [INFO ] Transformed 414 places.
[2025-06-01 01:27:52] [INFO ] Transformed 1296 transitions.
[2025-06-01 01:27:52] [INFO ] Found NUPN structural information;
[2025-06-01 01:27:52] [INFO ] Parsed PT model containing 414 places and 1296 transitions and 5976 arcs in 298 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 5 ms.19778KB memory used
Starting structural reductions in DEADLOCK mode, iteration 0 : 414/414 places, 1296/1296 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 414 transition count 1290
Reduce places removed 6 places and 0 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 408 transition count 1290
Computed a total of 0 stabilizing places and 0 stable transitions
Performed 114 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 114 Pre rules applied. Total rules applied 12 place count 408 transition count 1176
Deduced a syphon composed of 114 places in 3 ms
Reduce places removed 114 places and 0 transitions.
Iterating global reduction 2 with 228 rules applied. Total rules applied 240 place count 294 transition count 1176
Computed a total of 0 stabilizing places and 0 stable transitions
Discarding 30 places :
Symmetric choice reduction at 2 with 30 rule applications. Total rules 270 place count 264 transition count 996
Iterating global reduction 2 with 30 rules applied. Total rules applied 300 place count 264 transition count 996
Computed a total of 0 stabilizing places and 0 stable transitions
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 2 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 360 place count 234 transition count 966
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 360 rules in 224 ms. Remains 234 /414 variables (removed 180) and now considering 966/1296 (removed 330) transitions.
Finished structural reductions in DEADLOCK mode , in 1 iterations and 238 ms. Remains : 234/414 places, 966/1296 transitions.
Random walk for 1250000 steps, including 0 resets, run took 3125 ms (no deadlock found). (steps per millisecond=400 )
Random directed walk for 1250004 steps, including 0 resets, run took 2300 ms (no deadlock found). (steps per millisecond=543 )
[2025-06-01 01:27:58] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
// Phase 1: matrix 372 rows 234 cols
[2025-06-01 01:27:58] [INFO ] Computed 19 invariants in 15 ms
[2025-06-01 01:27:58] [INFO ] [Real]Absence check using 13 positive place invariants in 10 ms returned sat
[2025-06-01 01:27:58] [INFO ] [Real]Absence check using 13 positive and 6 generalized place invariants in 14 ms returned sat
[2025-06-01 01:27:58] [INFO ] [Real]Absence check using state equation in 180 ms returned sat
[2025-06-01 01:27:58] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 01:27:59] [INFO ] [Nat]Absence check using 13 positive place invariants in 6 ms returned sat
[2025-06-01 01:27:59] [INFO ] [Nat]Absence check using 13 positive and 6 generalized place invariants in 5 ms returned sat
[2025-06-01 01:27:59] [INFO ] [Nat]Absence check using state equation in 173 ms returned sat
[2025-06-01 01:27:59] [INFO ] State equation strengthened by 164 read => feed constraints.
[2025-06-01 01:27:59] [INFO ] [Nat]Added 164 Read/Feed constraints in 31 ms returned sat
[2025-06-01 01:27:59] [INFO ] Deduced a trap composed of 48 places in 129 ms of which 6 ms to minimize.
[2025-06-01 01:27:59] [INFO ] Deduced a trap composed of 13 places in 144 ms of which 2 ms to minimize.
[2025-06-01 01:27:59] [INFO ] Deduced a trap composed of 9 places in 123 ms of which 2 ms to minimize.
[2025-06-01 01:27:59] [INFO ] Deduced a trap composed of 30 places in 122 ms of which 2 ms to minimize.
[2025-06-01 01:28:00] [INFO ] Deduced a trap composed of 36 places in 128 ms of which 2 ms to minimize.
[2025-06-01 01:28:00] [INFO ] Deduced a trap composed of 38 places in 124 ms of which 2 ms to minimize.
[2025-06-01 01:28:00] [INFO ] Deduced a trap composed of 4 places in 126 ms of which 3 ms to minimize.
[2025-06-01 01:28:00] [INFO ] Deduced a trap composed of 3 places in 139 ms of which 2 ms to minimize.
[2025-06-01 01:28:00] [INFO ] Deduced a trap composed of 30 places in 121 ms of which 2 ms to minimize.
[2025-06-01 01:28:00] [INFO ] Deduced a trap composed of 41 places in 138 ms of which 3 ms to minimize.
[2025-06-01 01:28:00] [INFO ] Deduced a trap composed of 64 places in 133 ms of which 1 ms to minimize.
[2025-06-01 01:28:01] [INFO ] Deduced a trap composed of 62 places in 129 ms of which 2 ms to minimize.
[2025-06-01 01:28:01] [INFO ] Deduced a trap composed of 25 places in 131 ms of which 2 ms to minimize.
[2025-06-01 01:28:01] [INFO ] Deduced a trap composed of 29 places in 128 ms of which 2 ms to minimize.
[2025-06-01 01:28:01] [INFO ] Deduced a trap composed of 35 places in 132 ms of which 2 ms to minimize.
[2025-06-01 01:28:01] [INFO ] Deduced a trap composed of 31 places in 129 ms of which 2 ms to minimize.
[2025-06-01 01:28:01] [INFO ] Deduced a trap composed of 29 places in 129 ms of which 1 ms to minimize.
[2025-06-01 01:28:02] [INFO ] Deduced a trap composed of 3 places in 132 ms of which 1 ms to minimize.
[2025-06-01 01:28:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 18 trap constraints in 2720 ms
FORMULA ReachabilityDeadlock FALSE TECHNIQUES TOPOLOGICAL SAT_SMT STRUCTURAL_REDUCTION
Total runtime 9845 ms.
ITS solved all properties within timeout

BK_STOP 1748741282103

--------------------
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//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ 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="EisenbergMcGuire-PT-06"
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 EisenbergMcGuire-PT-06, 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 r084-tall-174860080700486"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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