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

About the Execution of 2024-gold for ShieldPPPs-PT-020B

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15684.950 63963.00 87411.00 254.20 T 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.r210-tall-174894547600442.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 ShieldPPPs-PT-020B, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r210-tall-174894547600442
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 808K
-rw-r--r-- 1 mcc users 7.2K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.9K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 116K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 82K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:33 equiv_col
-rw-r--r-- 1 mcc users 5 May 29 14:33 instance
-rw-r--r-- 1 mcc users 6 May 29 14:33 iscolored
-rw-r--r-- 1 mcc users 349K May 29 14:33 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 QuasiLiveness

=== Now, execution of the tool begins

BK_START 1749028706051

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=QuasiLiveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=ShieldPPPs-PT-020B
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2025-06-04 09:18:27] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2025-06-04 09:18:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-04 09:18:27] [INFO ] Load time of PNML (sax parser for PT used): 179 ms
[2025-06-04 09:18:27] [INFO ] Transformed 1363 places.
[2025-06-04 09:18:27] [INFO ] Transformed 1263 transitions.
[2025-06-04 09:18:27] [INFO ] Found NUPN structural information;
[2025-06-04 09:18:27] [INFO ] Parsed PT model containing 1363 places and 1263 transitions and 3486 arcs in 349 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 1363/1363 places, 1263/1263 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 142 transitions
Trivial Post-agglo rules discarded 142 transitions
Performed 142 trivial Post agglomeration. Transition count delta: 142
Iterating post reduction 0 with 142 rules applied. Total rules applied 142 place count 1363 transition count 1121
Reduce places removed 142 places and 0 transitions.
Iterating post reduction 1 with 142 rules applied. Total rules applied 284 place count 1221 transition count 1121
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 100 Pre rules applied. Total rules applied 284 place count 1221 transition count 1021
Deduced a syphon composed of 100 places in 13 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 2 with 200 rules applied. Total rules applied 484 place count 1121 transition count 1021
Performed 480 Post agglomeration using F-continuation condition.Transition count delta: 480
Deduced a syphon composed of 480 places in 1 ms
Reduce places removed 480 places and 0 transitions.
Iterating global reduction 2 with 960 rules applied. Total rules applied 1444 place count 641 transition count 541
Renaming transitions due to excessive name length > 1024 char.
Applied a total of 1444 rules in 210 ms. Remains 641 /1363 variables (removed 722) and now considering 541/1263 (removed 722) transitions.
// Phase 1: matrix 541 rows 641 cols
[2025-06-04 09:18:27] [INFO ] Computed 221 invariants in 26 ms
[2025-06-04 09:18:28] [INFO ] Implicit Places using invariants in 551 ms returned []
[2025-06-04 09:18:28] [INFO ] Invariant cache hit.
[2025-06-04 09:18:29] [INFO ] Implicit Places using invariants and state equation in 591 ms returned []
Implicit Place search using SMT with State Equation took 1168 ms to find 0 implicit places.
Running 540 sub problems to find dead transitions.
[2025-06-04 09:18:29] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/640 variables, 640/640 constraints. Problems are: Problem set: 0 solved, 540 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/640 variables, 0/640 constraints. Problems are: Problem set: 0 solved, 540 unsolved
At refinement iteration 2 (OVERLAPS) 1/641 variables, 221/861 constraints. Problems are: Problem set: 0 solved, 540 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/641 variables, 1/862 constraints. Problems are: Problem set: 0 solved, 540 unsolved
[2025-06-04 09:18:47] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 11 ms to minimize.
[2025-06-04 09:18:47] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 1 ms to minimize.
[2025-06-04 09:18:47] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 2 ms to minimize.
[2025-06-04 09:18:47] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2025-06-04 09:18:47] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
[2025-06-04 09:18:47] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2025-06-04 09:18:47] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 1 ms to minimize.
[2025-06-04 09:18:48] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2025-06-04 09:18:48] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2025-06-04 09:18:48] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2025-06-04 09:18:48] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2025-06-04 09:18:48] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2025-06-04 09:18:48] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2025-06-04 09:18:49] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2025-06-04 09:18:49] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2025-06-04 09:18:49] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2025-06-04 09:18:49] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2025-06-04 09:18:49] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2025-06-04 09:18:49] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2025-06-04 09:18:49] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/641 variables, 20/882 constraints. Problems are: Problem set: 0 solved, 540 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/641 variables, 0/882 constraints. Problems are: Problem set: 0 solved, 540 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 6 (OVERLAPS) 541/1182 variables, 641/1523 constraints. Problems are: Problem set: 0 solved, 540 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1182/1182 variables, and 1523 constraints, problems are : Problem set: 0 solved, 540 unsolved in 30027 ms.
Refiners :[Domain max(s): 641/641 constraints, Positive P Invariants (semi-flows): 221/221 constraints, State Equation: 641/641 constraints, PredecessorRefiner: 540/540 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 540 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/640 variables, 640/640 constraints. Problems are: Problem set: 0 solved, 540 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/640 variables, 0/640 constraints. Problems are: Problem set: 0 solved, 540 unsolved
At refinement iteration 2 (OVERLAPS) 1/641 variables, 221/861 constraints. Problems are: Problem set: 0 solved, 540 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/641 variables, 1/862 constraints. Problems are: Problem set: 0 solved, 540 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/641 variables, 20/882 constraints. Problems are: Problem set: 0 solved, 540 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/641 variables, 0/882 constraints. Problems are: Problem set: 0 solved, 540 unsolved
At refinement iteration 6 (OVERLAPS) 541/1182 variables, 641/1523 constraints. Problems are: Problem set: 0 solved, 540 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1182 variables, 540/2063 constraints. Problems are: Problem set: 0 solved, 540 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1182/1182 variables, and 2063 constraints, problems are : Problem set: 0 solved, 540 unsolved in 30031 ms.
Refiners :[Domain max(s): 641/641 constraints, Positive P Invariants (semi-flows): 221/221 constraints, State Equation: 641/641 constraints, PredecessorRefiner: 540/540 constraints, Known Traps: 20/20 constraints]
After SMT, in 60228ms problems are : Problem set: 0 solved, 540 unsolved
Search for dead transitions found 0 dead transitions in 60249ms
Starting structural reductions in LIVENESS mode, iteration 1 : 641/1363 places, 541/1263 transitions.
Finished structural reductions in LIVENESS mode , in 1 iterations and 61689 ms. Remains : 641/1363 places, 541/1263 transitions.
Discarding 120 transitions out of 541. Remains 421
Initial state reduction rules removed 1 formulas.
RANDOM walk for 24989 steps (16 resets) in 1590 ms. (15 steps per ms) remains 0/420 properties
Able to resolve query QuasiLiveness after proving 421 properties.
FORMULA QuasiLiveness TRUE TECHNIQUES RANDOM_WALK TOPOLOGICAL INITIAL_STATE
Total runtime 62613 ms.
ITS solved all properties within timeout

BK_STOP 1749028770014

--------------------
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 QuasiLiveness -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="ShieldPPPs-PT-020B"
export BK_EXAMINATION="QuasiLiveness"
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 ShieldPPPs-PT-020B, examination is QuasiLiveness"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r210-tall-174894547600442"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldPPPs-PT-020B.tgz
mv ShieldPPPs-PT-020B execution
cd execution
if [ "QuasiLiveness" = "ReachabilityDeadlock" ] || [ "QuasiLiveness" = "UpperBounds" ] || [ "QuasiLiveness" = "QuasiLiveness" ] || [ "QuasiLiveness" = "StableMarking" ] || [ "QuasiLiveness" = "Liveness" ] || [ "QuasiLiveness" = "OneSafe" ] || [ "QuasiLiveness" = "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 [ "QuasiLiveness" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "QuasiLiveness" != "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 "QuasiLiveness.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 '' QuasiLiveness.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "QuasiLiveness" = "ReachabilityDeadlock" ] || [ "QuasiLiveness" = "QuasiLiveness" ] || [ "QuasiLiveness" = "StableMarking" ] || [ "QuasiLiveness" = "Liveness" ] || [ "QuasiLiveness" = "OneSafe" ] ; then
echo "FORMULA_NAME QuasiLiveness"
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 ;