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.r018-smll-177946787900045.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 AutonomousCar-PT-03b, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r018-smll-177946787900045
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 512K
-rw-r--r-- 1 mcc users 5.9K Mar 5 16:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K Mar 5 16:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Mar 5 16:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Mar 5 16:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 15 07:18 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K Mar 15 07:18 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 15 07:18 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 15 07:18 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Mar 5 16:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 113K Mar 5 16:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.7K Mar 5 16:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 76K Mar 5 16:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 15 07:18 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 15 07:18 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 75K 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 AutonomousCar-PT-03b-UpperBounds-00
FORMULA_NAME AutonomousCar-PT-03b-UpperBounds-01
FORMULA_NAME AutonomousCar-PT-03b-UpperBounds-02
FORMULA_NAME AutonomousCar-PT-03b-UpperBounds-03
FORMULA_NAME AutonomousCar-PT-03b-UpperBounds-04
FORMULA_NAME AutonomousCar-PT-03b-UpperBounds-05
FORMULA_NAME AutonomousCar-PT-03b-UpperBounds-06
FORMULA_NAME AutonomousCar-PT-03b-UpperBounds-07
FORMULA_NAME AutonomousCar-PT-03b-UpperBounds-08
FORMULA_NAME AutonomousCar-PT-03b-UpperBounds-09
FORMULA_NAME AutonomousCar-PT-03b-UpperBounds-10
FORMULA_NAME AutonomousCar-PT-03b-UpperBounds-11
FORMULA_NAME AutonomousCar-PT-03b-UpperBounds-12
FORMULA_NAME AutonomousCar-PT-03b-UpperBounds-13
FORMULA_NAME AutonomousCar-PT-03b-UpperBounds-14
FORMULA_NAME AutonomousCar-PT-03b-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1779476155279

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutonomousCar-PT-03b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202604301425
[2026-05-22 18:55:57] [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-22 18:55:57] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-22 18:55:58] [INFO ] Load time of PNML (sax parser for PT used): 185 ms
[2026-05-22 18:55:58] [INFO ] Transformed 190 places.
[2026-05-22 18:55:58] [INFO ] Transformed 273 transitions.
[2026-05-22 18:55:58] [INFO ] Found NUPN structural information;
[2026-05-22 18:55:58] [INFO ] Parsed PT model containing 190 places and 273 transitions and 1051 arcs in 456 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 18 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-4138080670978419802.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11686267386959021320.kers'
[2026-05-22 18:55:58] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4138080670978419802.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11686267386959021320.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 273 rows 190 cols 1051 entries
Finished phase 1 with 182 SingleSign rule and 0 generalized
[2026-05-22 18:55:58] [INFO ] Computed 8 invariants in 2 ms
Computed 8 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-11686267386959021320.kers
Total runtime 4 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 (5 resets) in 65 ms. (151 steps per ms)
FORMULA AutonomousCar-PT-03b-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA AutonomousCar-PT-03b-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA AutonomousCar-PT-03b-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA AutonomousCar-PT-03b-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA AutonomousCar-PT-03b-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA AutonomousCar-PT-03b-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA AutonomousCar-PT-03b-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA AutonomousCar-PT-03b-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA AutonomousCar-PT-03b-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA AutonomousCar-PT-03b-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA AutonomousCar-PT-03b-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA AutonomousCar-PT-03b-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA AutonomousCar-PT-03b-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 30000 steps (30 resets) in 104 ms. (285 steps per ms)
FORMULA AutonomousCar-PT-03b-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-03b-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2026-05-22 18:55:58] [INFO ] Invariant cache hit.
[2026-05-22 18:55:59] [INFO ] [Real]Absence check using 8 positive place invariants in 20 ms returned sat
[2026-05-22 18:55:59] [INFO ] [Real]Absence check using state equation in 286 ms returned sat
[2026-05-22 18:55:59] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 18:56:00] [INFO ] [Nat]Absence check using 8 positive place invariants in 9 ms returned sat
[2026-05-22 18:56:00] [INFO ] [Nat]Absence check using state equation in 181 ms returned sat
[2026-05-22 18:56:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 177 ms
[2026-05-22 18:56:00] [INFO ] Computed and/alt/rep : 186/310/186 causal constraints (skipped 86 transitions) in 74 ms.
[2026-05-22 18:56:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 303 ms
[2026-05-22 18:56:01] [INFO ] Added : 95 causal constraints over 20 iterations in 1130 ms. Result :sat
Minimization took 121 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 190 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p129) removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 190/190 places, 272/272 transitions.
Graph (trivial) has 179 edges and 190 vertex of which 4 / 190 are part of one of the 2 SCC in 13 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 435 edges and 188 vertex of which 181 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.3 ms
Discarding 7 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 85 transitions
Trivial Post-agglo rules discarded 85 transitions
Performed 85 trivial Post agglomeration. Transition count delta: 85
Iterating post reduction 0 with 88 rules applied. Total rules applied 90 place count 180 transition count 175
Reduce places removed 85 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 1 with 106 rules applied. Total rules applied 196 place count 95 transition count 154
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 207 place count 84 transition count 154
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 207 place count 84 transition count 149
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 217 place count 79 transition count 149
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 233 place count 63 transition count 133
Iterating global reduction 3 with 16 rules applied. Total rules applied 249 place count 63 transition count 133
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 3 with 36 rules applied. Total rules applied 285 place count 63 transition count 97
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 285 place count 63 transition count 95
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 289 place count 61 transition count 95
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 293 place count 57 transition count 85
Iterating global reduction 4 with 4 rules applied. Total rules applied 297 place count 57 transition count 85
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 4 with 6 rules applied. Total rules applied 303 place count 57 transition count 79
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 306 place count 54 transition count 79
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 6 with 40 rules applied. Total rules applied 346 place count 34 transition count 59
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 349 place count 31 transition count 47
Iterating global reduction 6 with 3 rules applied. Total rules applied 352 place count 31 transition count 47
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 356 place count 29 transition count 65
Free-agglomeration rule applied 1 times.
Iterating global reduction 6 with 1 rules applied. Total rules applied 357 place count 29 transition count 64
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 358 place count 28 transition count 64
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 359 place count 27 transition count 63
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 360 place count 26 transition count 63
Applied a total of 360 rules in 164 ms. Remains 26 /190 variables (removed 164) and now considering 63/272 (removed 209) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 180 ms. Remains : 26/190 places, 63/272 transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7715649886494580441.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7062909437567211007.kers'
[2026-05-22 18:56:02] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7715649886494580441.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7062909437567211007.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 63 rows 25 cols 368 entries
Finished phase 1 with 19 SingleSign rule and 0 generalized
[2026-05-22 18:56:02] [INFO ] Computed 7 invariants in 0 ms
Computed 7 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-7062909437567211007.kers
Total runtime 1 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (76621 resets) in 1848 ms. (540 steps per ms)
FORMULA AutonomousCar-PT-03b-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000001 steps (17180 resets) in 827 ms. (1207 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 7235 ms.

BK_STOP 1779476165134

--------------------
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="AutonomousCar-PT-03b"
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 AutonomousCar-PT-03b, 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 r018-smll-177946787900045"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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