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.r194-tall-177969914100509.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 Parking-PT-104, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r194-tall-177969914100509
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 528K
-rw-r--r-- 1 mcc users 7.0K Mar 8 08:05 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K Mar 8 08:05 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Mar 8 08:05 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Mar 8 08:05 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.3K Mar 16 08:23 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Mar 16 08:23 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 16 08:23 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 16 08:23 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Mar 8 08:05 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 169K Mar 8 08:05 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.1K Mar 8 08:05 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 82K Mar 8 08:05 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 16 08:23 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 16 08:23 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 23K 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 positive values
NUM_VECTOR

echo here is the order used to build the result vector(from xml file)
FORMULA_NAME Parking-PT-104-UpperBounds-00
FORMULA_NAME Parking-PT-104-UpperBounds-01
FORMULA_NAME Parking-PT-104-UpperBounds-02
FORMULA_NAME Parking-PT-104-UpperBounds-03
FORMULA_NAME Parking-PT-104-UpperBounds-04
FORMULA_NAME Parking-PT-104-UpperBounds-05
FORMULA_NAME Parking-PT-104-UpperBounds-06
FORMULA_NAME Parking-PT-104-UpperBounds-07
FORMULA_NAME Parking-PT-104-UpperBounds-08
FORMULA_NAME Parking-PT-104-UpperBounds-09
FORMULA_NAME Parking-PT-104-UpperBounds-10
FORMULA_NAME Parking-PT-104-UpperBounds-11
FORMULA_NAME Parking-PT-104-UpperBounds-12
FORMULA_NAME Parking-PT-104-UpperBounds-13
FORMULA_NAME Parking-PT-104-UpperBounds-14
FORMULA_NAME Parking-PT-104-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1779784964069

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Parking-PT-104
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202604301425
[2026-05-26 08:42:45] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-26 08:42:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-26 08:42:45] [INFO ] Load time of PNML (sax parser for PT used): 48 ms
[2026-05-26 08:42:45] [INFO ] Transformed 65 places.
[2026-05-26 08:42:45] [INFO ] Transformed 97 transitions.
[2026-05-26 08:42:45] [INFO ] Found NUPN structural information;
[2026-05-26 08:42:45] [INFO ] Parsed PT model containing 65 places and 97 transitions and 284 arcs in 144 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
Ensure Unique test removed 41 transitions
Reduce redundant transitions removed 41 transitions.
Current structural bounds on expressions (Initiallly, because the net is safe) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7248819646986270839.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3559065511908012885.kers'
[2026-05-26 08:42:45] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7248819646986270839.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3559065511908012885.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 56 rows 65 cols 174 entries
Finished phase 1 with 44 SingleSign rule and 5 generalized
[2026-05-26 08:42:45] [INFO ] Computed 16 invariants in 0 ms
Computed 16 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-3559065511908012885.kers
Total runtime 1 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 10000 steps (592 resets) in 31 ms. (312 steps per ms)
FORMULA Parking-PT-104-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Parking-PT-104-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Parking-PT-104-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Parking-PT-104-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Parking-PT-104-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Parking-PT-104-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Parking-PT-104-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Parking-PT-104-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Parking-PT-104-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Parking-PT-104-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Parking-PT-104-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Parking-PT-104-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Parking-PT-104-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Parking-PT-104-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 20002 steps (206 resets) in 26 ms. (740 steps per ms)
FORMULA Parking-PT-104-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2026-05-26 08:42:45] [INFO ] Invariant cache hit.
[2026-05-26 08:42:45] [INFO ] [Real]Absence check using 15 positive place invariants in 13 ms returned sat
[2026-05-26 08:42:45] [INFO ] [Real]Absence check using 15 positive and 1 generalized place invariants in 1 ms returned sat
[2026-05-26 08:42:45] [INFO ] [Real]Absence check using state equation in 37 ms returned sat
[2026-05-26 08:42:45] [INFO ] State equation strengthened by 12 read => feed constraints.
[2026-05-26 08:42:45] [INFO ] [Real]Added 12 Read/Feed constraints in 8 ms returned sat
[2026-05-26 08:42:45] [INFO ] Computed and/alt/rep : 55/191/55 causal constraints (skipped 0 transitions) in 20 ms.
[2026-05-26 08:42:45] [INFO ] Solution in real domain found non-integer solution.
[2026-05-26 08:42:45] [INFO ] [Nat]Absence check using 15 positive place invariants in 5 ms returned sat
[2026-05-26 08:42:45] [INFO ] [Nat]Absence check using 15 positive and 1 generalized place invariants in 1 ms returned sat
[2026-05-26 08:42:45] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2026-05-26 08:42:45] [INFO ] [Nat]Added 12 Read/Feed constraints in 3 ms returned sat
[2026-05-26 08:42:45] [INFO ] Computed and/alt/rep : 55/191/55 causal constraints (skipped 0 transitions) in 4 ms.
[2026-05-26 08:42:45] [INFO ] Added : 44 causal constraints over 9 iterations in 79 ms. Result :sat
Minimization took 27 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 65 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p49) removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 65/65 places, 55/55 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 65 transition count 53
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 63 transition count 53
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 4 place count 63 transition count 51
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 8 place count 61 transition count 51
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 9 place count 60 transition count 50
Iterating global reduction 2 with 1 rules applied. Total rules applied 10 place count 60 transition count 50
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 16 place count 57 transition count 47
Free-agglomeration rule applied 9 times.
Iterating global reduction 2 with 9 rules applied. Total rules applied 25 place count 57 transition count 38
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 34 place count 48 transition count 38
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 35 place count 47 transition count 37
Reduce places removed 9 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 3 with 25 rules applied. Total rules applied 60 place count 38 transition count 21
Reduce places removed 16 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 4 with 22 rules applied. Total rules applied 82 place count 22 transition count 15
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 86 place count 18 transition count 15
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 5 Pre rules applied. Total rules applied 86 place count 18 transition count 10
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 6 with 10 rules applied. Total rules applied 96 place count 13 transition count 10
Applied a total of 96 rules in 41 ms. Remains 13 /65 variables (removed 52) and now considering 10/55 (removed 45) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47 ms. Remains : 13/65 places, 10/55 transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8949929052808951411.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8487273513780685662.kers'
[2026-05-26 08:42:46] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8949929052808951411.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8487273513780685662.kers]
Culling duplicate invariants (modulo rational): removing 5 columns.
Culled 5 columns in 0 ms.
// Phase 1: matrix 10 rows 8 cols 21 entries
Finished phase 1 with 6 SingleSign rule and 0 generalized
[2026-05-26 08:42:46] [INFO ] Computed 7 invariants in 0 ms
Computed 7 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-8487273513780685662.kers
Total runtime 0 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (90323 resets) in 723 ms. (1381 steps per ms)
FORMULA Parking-PT-104-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000001 steps (27690 resets) in 305 ms. (3267 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 1925 ms.

BK_STOP 1779784967140

--------------------
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
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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 UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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="Parking-PT-104"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
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 Parking-PT-104, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r194-tall-177969914100509"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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