Execution Chart

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

Trace from the execution

Formatting '/data/sdalzilio/mcc2026-input.r178-oct2-177969020000197.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/sdalzilio/mcc2026-input.qcow2 backing_fmt=qcow2 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 MedleyA-PT-13, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r178-oct2-177969020000197
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 428K
-rw-r--r-- 1 mcc users 6.6K Mar 7 18:20 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K Mar 7 18:20 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K Mar 7 18:19 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K Mar 7 18:19 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Mar 15 11:28 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 15 11:28 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 15 11:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Mar 15 11:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.6K Mar 7 18:20 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 60K Mar 7 18:20 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Mar 7 18:20 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 97K Mar 7 18:20 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 15 11:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 15 11:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 39K 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 MedleyA-PT-13-UpperBounds-00
FORMULA_NAME MedleyA-PT-13-UpperBounds-01
FORMULA_NAME MedleyA-PT-13-UpperBounds-02
FORMULA_NAME MedleyA-PT-13-UpperBounds-03
FORMULA_NAME MedleyA-PT-13-UpperBounds-04
FORMULA_NAME MedleyA-PT-13-UpperBounds-05
FORMULA_NAME MedleyA-PT-13-UpperBounds-06
FORMULA_NAME MedleyA-PT-13-UpperBounds-07
FORMULA_NAME MedleyA-PT-13-UpperBounds-08
FORMULA_NAME MedleyA-PT-13-UpperBounds-09
FORMULA_NAME MedleyA-PT-13-UpperBounds-10
FORMULA_NAME MedleyA-PT-13-UpperBounds-11
FORMULA_NAME MedleyA-PT-13-UpperBounds-12
FORMULA_NAME MedleyA-PT-13-UpperBounds-13
FORMULA_NAME MedleyA-PT-13-UpperBounds-14
FORMULA_NAME MedleyA-PT-13-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1779700252289

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyA-PT-13
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202604301425
[2026-05-25 09:10:53] [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-25 09:10:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 09:10:54] [INFO ] Load time of PNML (sax parser for PT used): 71 ms
[2026-05-25 09:10:54] [INFO ] Transformed 173 places.
[2026-05-25 09:10:54] [INFO ] Transformed 159 transitions.
[2026-05-25 09:10:54] [INFO ] Found NUPN structural information;
[2026-05-25 09:10:54] [INFO ] Parsed PT model containing 173 places and 159 transitions and 401 arcs in 175 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 11 ms.
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-588905829820180383.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17771451839894297138.kers'
[2026-05-25 09:10:54] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-588905829820180383.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17771451839894297138.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 159 rows 173 cols 401 entries
Finished phase 1 with 132 SingleSign rule and 20 generalized
[2026-05-25 09:10:54] [INFO ] Computed 21 invariants in 1 ms
Computed 21 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-17771451839894297138.kers
Total runtime 2 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 (288 resets) in 41 ms. (238 steps per ms)
FORMULA MedleyA-PT-13-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-13-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-13-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-13-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-13-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-13-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-13-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-13-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-13-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-13-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-13-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-13-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-13-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-13-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-13-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 10000 steps (72 resets) in 9 ms. (1000 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2026-05-25 09:10:54] [INFO ] Invariant cache hit.
[2026-05-25 09:10:54] [INFO ] [Real]Absence check using 10 positive place invariants in 8 ms returned sat
[2026-05-25 09:10:54] [INFO ] [Real]Absence check using 10 positive and 11 generalized place invariants in 18 ms returned sat
[2026-05-25 09:10:54] [INFO ] [Real]Absence check using state equation in 106 ms returned sat
[2026-05-25 09:10:54] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 09:10:54] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2026-05-25 09:10:54] [INFO ] [Nat]Absence check using 10 positive and 11 generalized place invariants in 3 ms returned sat
[2026-05-25 09:10:54] [INFO ] [Nat]Absence check using state equation in 46 ms returned sat
[2026-05-25 09:10:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 101 ms
[2026-05-25 09:10:54] [INFO ] Computed and/alt/rep : 158/250/158 causal constraints (skipped 0 transitions) in 15 ms.
[2026-05-25 09:10:55] [INFO ] Added : 144 causal constraints over 29 iterations in 583 ms. Result :sat
Minimization took 66 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 173 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p26) removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 173/173 places, 158/158 transitions.
Graph (complete) has 268 edges and 173 vertex of which 172 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Reduce places removed 2 places and 2 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 37 rules applied. Total rules applied 38 place count 166 transition count 125
Reduce places removed 31 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 33 rules applied. Total rules applied 71 place count 135 transition count 123
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 72 place count 134 transition count 123
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 30 Pre rules applied. Total rules applied 72 place count 134 transition count 93
Deduced a syphon composed of 30 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 3 with 61 rules applied. Total rules applied 133 place count 103 transition count 93
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 135 place count 102 transition count 92
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 136 place count 101 transition count 92
Discarding 12 places :
Symmetric choice reduction at 5 with 12 rule applications. Total rules 148 place count 89 transition count 80
Iterating global reduction 5 with 12 rules applied. Total rules applied 160 place count 89 transition count 80
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 3 Pre rules applied. Total rules applied 160 place count 89 transition count 77
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 166 place count 86 transition count 77
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 167 place count 85 transition count 76
Iterating global reduction 5 with 1 rules applied. Total rules applied 168 place count 85 transition count 76
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 169 place count 84 transition count 75
Iterating global reduction 5 with 1 rules applied. Total rules applied 170 place count 84 transition count 75
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 171 place count 83 transition count 74
Iterating global reduction 5 with 1 rules applied. Total rules applied 172 place count 83 transition count 74
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 5 with 50 rules applied. Total rules applied 222 place count 58 transition count 49
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 5 with 14 rules applied. Total rules applied 236 place count 51 transition count 62
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 237 place count 51 transition count 61
Free-agglomeration rule applied 5 times.
Iterating global reduction 5 with 5 rules applied. Total rules applied 242 place count 51 transition count 56
Reduce places removed 5 places and 0 transitions.
Graph (complete) has 136 edges and 46 vertex of which 45 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 5 with 6 rules applied. Total rules applied 248 place count 45 transition count 56
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 249 place count 45 transition count 55
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 7 with 2 rules applied. Total rules applied 251 place count 45 transition count 53
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 253 place count 43 transition count 53
Applied a total of 253 rules in 83 ms. Remains 43 /173 variables (removed 130) and now considering 53/158 (removed 105) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 91 ms. Remains : 43/173 places, 53/158 transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-219157133654892355.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11080570677839871509.kers'
[2026-05-25 09:10:55] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-219157133654892355.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11080570677839871509.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 53 rows 42 cols 261 entries
Finished phase 1 with 19 SingleSign rule and 10 generalized
[2026-05-25 09:10:55] [INFO ] Computed 14 invariants in 0 ms
Computed 14 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-11080570677839871509.kers
Total runtime 1 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (212583 resets) in 989 ms. (1010 steps per ms)
FORMULA MedleyA-PT-13-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000000 steps (56518 resets) in 420 ms. (2375 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 3436 ms.

BK_STOP 1779700257340

--------------------
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="MedleyA-PT-13"
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 MedleyA-PT-13, 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 r178-oct2-177969020000197"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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