fond
Model Checking Contest 2026
16th edition, Hamburg, Germany, June 23, 2026
Execution of r072-tall-177946970400338
Last Updated
Jun 17, 2026

About the Execution of ITS-Tools for CopsAndRobbers-PT-KFL084N009K003X002

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
3872.783 57835.00 137514.00 233.60 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/mcc2026-input.r072-tall-177946970400338.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2026-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-5973
Executing tool itstools
Input is CopsAndRobbers-PT-KFL084N009K003X002, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r072-tall-177946970400338
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.4M
-rw-r--r-- 1 mcc users 7.7K Mar 6 13:32 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K Mar 6 13:32 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Mar 6 13:32 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K Mar 6 13:32 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.0K Mar 15 08:37 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Mar 15 08:37 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.7K Mar 15 08:37 LTLFireability.txt
-rw-r--r-- 1 mcc users 21K Mar 15 08:37 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.7K Mar 6 13:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 62K Mar 6 13:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 16K Mar 6 13:32 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 93K Mar 6 13:32 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.1K Mar 15 08:37 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K Mar 15 08:37 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 19 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 3.0M Mar 3 18:30 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 StableMarking

=== Now, execution of the tool begins

BK_START 1779524078984

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=CopsAndRobbers-PT-KFL084N009K003X002
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
StableMarking PT
Running Version 202604301425
[2026-05-23 08:14:40] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 1800]
[2026-05-23 08:14:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-23 08:14:40] [INFO ] Load time of PNML (sax parser for PT used): 241 ms
[2026-05-23 08:14:40] [INFO ] Transformed 426 places.
[2026-05-23 08:14:40] [INFO ] Transformed 3615 transitions.
[2026-05-23 08:14:40] [INFO ] Parsed PT model containing 426 places and 3615 transitions and 21342 arcs in 372 ms.
[2026-05-23 08:14:41] [INFO ] Flatten gal took : 812 ms
[2026-05-23 08:14:42] [INFO ] Flatten gal took : 116 ms
RANDOM walk for 40000 steps (200 resets) in 4371 ms. (9 steps per ms) remains 9/426 properties
[2026-05-23 08:14:42] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15088251417287680861.gal : 126 ms
[2026-05-23 08:14:42] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6406849736028148409.prop : 1 ms
BEST_FIRST walk for 40004 steps (24 resets) in 468 ms. (85 steps per ms) remains 5/9 properties
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality15088251417287680861.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6406849736028148409.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
BEST_FIRST walk for 40004 steps (23 resets) in 459 ms. (86 steps per ms) remains 4/5 properties
BEST_FIRST walk for 40004 steps (27 resets) in 516 ms. (77 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40004 steps (18 resets) in 335 ms. (119 steps per ms) remains 2/2 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-347008467769060081.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10100505347591938455.kers'
[2026-05-23 08:14:42] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-347008467769060081.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10100505347591938455.kers]
Culling duplicate invariants (modulo rational): removing 84 columns.
Culled 84 columns in 2 ms.
// Phase 1: matrix 3615 rows 342 cols 14118 entries
Finished phase 1 with 338 SingleSign rule and 1 generalized
[2026-05-23 08:14:42] [INFO ] Computed 87 invariants in 11 ms
Computed 87 P flows in 15 ms.
Exported basis to /tmp/petrispot-output-10100505347591938455.kers
Total runtime 18 ms.
[2026-05-23 08:14:42] [INFO ] State equation strengthened by 187 read => feed constraints.
Loading property file /tmp/ReachabilityCardinality6406849736028148409.prop.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 250/252 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/252 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1932/2184 variables, 252/253 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2184 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 7/2191 variables, 4/257 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2191 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 2/2193 variables, 1/258 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2193 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,9 properties remain. new max is 4
SDD size :1 after 9
SDD proceeding with computation,9 properties remain. new max is 8
SDD size :9 after 11
SDD proceeding with computation,9 properties remain. new max is 16
SDD size :11 after 13
SDD proceeding with computation,9 properties remain. new max is 32
SDD size :13 after 16
SDD proceeding with computation,9 properties remain. new max is 64
SDD size :16 after 21
At refinement iteration 9 (OVERLAPS) 1680/3873 variables, 2/260 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3873 variables, 187/447 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3873 variables, 0/447 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 168/4041 variables, 168/615 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/4041 variables, 85/700 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/4041 variables, 0/700 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/4041 variables, 0/700 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4041/4041 variables, and 700 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1606 ms.
Refiners :[Positive P Invariants (semi-flows): 87/87 constraints, State Equation: 426/426 constraints, ReadFeed: 187/187 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,9 properties remain. new max is 128
SDD size :21 after 1040
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 250/252 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/252 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1932/2184 variables, 252/253 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2184 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 7/2191 variables, 4/257 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2191 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 2/2193 variables, 1/258 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2193 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 1680/3873 variables, 2/260 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3873 variables, 187/447 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3873 variables, 0/447 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,9 properties remain. new max is 256
SDD size :1040 after 1377
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 4041/4041 variables, and 615 constraints, problems are : Problem set: 0 solved, 2 unsolved in 3224 ms.
Refiners :[Positive P Invariants (semi-flows): 2/87 constraints, State Equation: 426/426 constraints, ReadFeed: 187/187 constraints, PredecessorRefiner: 0/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4951ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 109 ms.
Support contains 2 out of 426 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 426/426 places, 3615/3615 transitions.
Graph (complete) has 8154 edges and 426 vertex of which 344 are kept as prefixes of interest. Removing 82 places using SCC suffix rule.15 ms
Discarding 82 places :
Also discarding 0 output transitions
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 1 place count 344 transition count 3614
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 343 transition count 3614
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 5 place count 342 transition count 3613
Applied a total of 5 rules in 652 ms. Remains 342 /426 variables (removed 84) and now considering 3613/3615 (removed 2) transitions.
Running 3573 sub problems to find dead transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15481871734597802421.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4182120790261699575.kers'
[2026-05-23 08:14:48] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15481871734597802421.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4182120790261699575.kers]
Culling duplicate invariants (modulo rational): removing 84 columns.
Culled 84 columns in 1 ms.
// Phase 1: matrix 3613 rows 258 cols 13950 entries
Finished phase 1 with 256 SingleSign rule and 0 generalized
[2026-05-23 08:14:48] [INFO ] Computed 86 invariants in 17 ms
Computed 86 P flows in 18 ms.
Exported basis to /tmp/petrispot-output-4182120790261699575.kers
Total runtime 21 ms.
[2026-05-23 08:14:48] [INFO ] State equation strengthened by 187 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
SDD proceeding with computation,9 properties remain. new max is 512
SDD size :1377 after 17680
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/340 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 3573 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 340/3955 variables, and 86 constraints, problems are : Problem set: 0 solved, 3573 unsolved in 20074 ms.
Refiners :[Positive P Invariants (semi-flows): 86/86 constraints, State Equation: 0/342 constraints, ReadFeed: 0/187 constraints, PredecessorRefiner: 3573/252 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3573 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/340 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 3573 unsolved
SDD proceeding with computation,9 properties remain. new max is 1024
SDD size :17680 after 147298
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 340/3955 variables, and 86 constraints, problems are : Problem set: 0 solved, 3573 unsolved in 20064 ms.
Refiners :[Positive P Invariants (semi-flows): 86/86 constraints, State Equation: 0/342 constraints, ReadFeed: 0/187 constraints, PredecessorRefiner: 3321/252 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 45769ms problems are : Problem set: 0 solved, 3573 unsolved
Search for dead transitions found 0 dead transitions in 45802ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46506 ms. Remains : 342/426 places, 3613/3615 transitions.
RANDOM walk for 108053 steps (658 resets) in 7671 ms. (14 steps per ms) remains 0/2 properties
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Able to resolve query StableMarking after proving 426 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK BESTFIRST_WALK TOPOLOGICAL
Total runtime 56690 ms.

BK_STOP 1779524136819

--------------------
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
+ [[ StableMarking = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution StableMarking -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
++ 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.202604301425.jar
+ VERSION=202604301425
+ echo 'Running Version 202604301425'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination StableMarking -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="CopsAndRobbers-PT-KFL084N009K003X002"
export BK_EXAMINATION="StableMarking"
export BK_TOOL="itstools"
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-5973"
echo " Executing tool itstools"
echo " Input is CopsAndRobbers-PT-KFL084N009K003X002, examination is StableMarking"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r072-tall-177946970400338"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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