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.r265-tall-174931349600011.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 Champagne-PT-H07T1U, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r265-tall-174931349600011
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 604K
-rw-r--r-- 1 mcc users 9.4K Jun 6 08:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 106K Jun 6 08:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Jun 6 08:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Jun 6 08:56 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Jun 6 11:39 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Jun 6 11:39 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Jun 6 11:40 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Jun 6 11:40 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 5 20:08 NewModel
-rw-r--r-- 1 mcc users 12K Jun 6 08:58 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 125K Jun 6 08:58 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Jun 6 08:58 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K Jun 6 08:58 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Jun 6 11:40 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Jun 6 11:40 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 5 20:08 equiv_col
-rw-r--r-- 1 mcc users 7 Jun 5 20:08 instance
-rw-r--r-- 1 mcc users 6 Jun 5 20:08 iscolored
-rw-r--r-- 1 mcc users 144K Jun 5 20:08 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 Champagne-PT-H07T1U-UpperBounds-00
FORMULA_NAME Champagne-PT-H07T1U-UpperBounds-01
FORMULA_NAME Champagne-PT-H07T1U-UpperBounds-02
FORMULA_NAME Champagne-PT-H07T1U-UpperBounds-03
FORMULA_NAME Champagne-PT-H07T1U-UpperBounds-04
FORMULA_NAME Champagne-PT-H07T1U-UpperBounds-05
FORMULA_NAME Champagne-PT-H07T1U-UpperBounds-06
FORMULA_NAME Champagne-PT-H07T1U-UpperBounds-07
FORMULA_NAME Champagne-PT-H07T1U-UpperBounds-08
FORMULA_NAME Champagne-PT-H07T1U-UpperBounds-09
FORMULA_NAME Champagne-PT-H07T1U-UpperBounds-10
FORMULA_NAME Champagne-PT-H07T1U-UpperBounds-11
FORMULA_NAME Champagne-PT-H07T1U-UpperBounds-12
FORMULA_NAME Champagne-PT-H07T1U-UpperBounds-13
FORMULA_NAME Champagne-PT-H07T1U-UpperBounds-14
FORMULA_NAME Champagne-PT-H07T1U-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1749318776255

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Champagne-PT-H07T1U
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2025-06-07 17:52: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]
[2025-06-07 17:52:57] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-07 17:52:57] [INFO ] Load time of PNML (sax parser for PT used): 102 ms
[2025-06-07 17:52:57] [INFO ] Transformed 701 places.
[2025-06-07 17:52:57] [INFO ] Transformed 931 transitions.
[2025-06-07 17:52:57] [INFO ] Found NUPN structural information;
[2025-06-07 17:52:57] [INFO ] Parsed PT model containing 701 places and 931 transitions and 2312 arcs in 215 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 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]
// Phase 1: matrix 931 rows 701 cols
[2025-06-07 17:52:57] [INFO ] Computed 27 invariants in 27 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 (23 resets) in 56 ms. (175 steps per ms)
FORMULA Champagne-PT-H07T1U-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Champagne-PT-H07T1U-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Champagne-PT-H07T1U-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Champagne-PT-H07T1U-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Champagne-PT-H07T1U-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Champagne-PT-H07T1U-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Champagne-PT-H07T1U-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Champagne-PT-H07T1U-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Champagne-PT-H07T1U-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Champagne-PT-H07T1U-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Champagne-PT-H07T1U-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Champagne-PT-H07T1U-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Champagne-PT-H07T1U-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Champagne-PT-H07T1U-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Champagne-PT-H07T1U-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 10001 steps (2 resets) in 9 ms. (1000 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2025-06-07 17:52:57] [INFO ] Invariant cache hit.
[2025-06-07 17:52:58] [INFO ] [Real]Absence check using 27 positive place invariants in 18 ms returned sat
[2025-06-07 17:52:58] [INFO ] [Real]Absence check using state equation in 239 ms returned sat
[2025-06-07 17:52:58] [INFO ] Deduced a trap composed of 67 places in 239 ms of which 25 ms to minimize.
[2025-06-07 17:52:58] [INFO ] Solution in real domain found non-integer solution.
[2025-06-07 17:52:59] [INFO ] [Nat]Absence check using 27 positive place invariants in 16 ms returned sat
[2025-06-07 17:52:59] [INFO ] [Nat]Absence check using state equation in 227 ms returned sat
[2025-06-07 17:52:59] [INFO ] Deduced a trap composed of 67 places in 112 ms of which 2 ms to minimize.
[2025-06-07 17:52:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 202 ms
[2025-06-07 17:52:59] [INFO ] Computed and/alt/rep : 915/2600/915 causal constraints (skipped 15 transitions) in 58 ms.
Maximisation of solution failed !
Minimization took 1 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 701 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p514) removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 701/701 places, 930/930 transitions.
Graph (trivial) has 716 edges and 701 vertex of which 245 / 701 are part of one of the 27 SCC in 5 ms
Free SCC test removed 218 places
Drop transitions (Empty/Sink Transition effects.) removed 263 transitions
Reduce isomorphic transitions removed 263 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 218 transitions
Trivial Post-agglo rules discarded 218 transitions
Performed 218 trivial Post agglomeration. Transition count delta: 218
Iterating post reduction 0 with 218 rules applied. Total rules applied 219 place count 483 transition count 449
Reduce places removed 218 places and 0 transitions.
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 1 with 266 rules applied. Total rules applied 485 place count 265 transition count 401
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 2 with 24 rules applied. Total rules applied 509 place count 241 transition count 401
Discarding 91 places :
Symmetric choice reduction at 3 with 91 rule applications. Total rules 600 place count 150 transition count 310
Iterating global reduction 3 with 91 rules applied. Total rules applied 691 place count 150 transition count 310
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 26 Pre rules applied. Total rules applied 691 place count 150 transition count 284
Deduced a syphon composed of 26 places in 1 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 3 with 52 rules applied. Total rules applied 743 place count 124 transition count 284
Discarding 20 places :
Symmetric choice reduction at 3 with 20 rule applications. Total rules 763 place count 104 transition count 191
Iterating global reduction 3 with 20 rules applied. Total rules applied 783 place count 104 transition count 191
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 3 with 20 rules applied. Total rules applied 803 place count 104 transition count 171
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 4 with 52 rules applied. Total rules applied 855 place count 78 transition count 145
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 861 place count 75 transition count 152
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 865 place count 75 transition count 148
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 5 with 4 rules applied. Total rules applied 869 place count 75 transition count 144
Free-agglomeration rule applied 43 times.
Iterating global reduction 5 with 43 rules applied. Total rules applied 912 place count 75 transition count 101
Reduce places removed 43 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 90 transitions
Reduce isomorphic transitions removed 90 transitions.
Graph (complete) has 94 edges and 32 vertex of which 7 are kept as prefixes of interest. Removing 25 places using SCC suffix rule.1 ms
Discarding 25 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Iterating post reduction 5 with 134 rules applied. Total rules applied 1046 place count 7 transition count 7
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 1048 place count 7 transition count 5
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1050 place count 5 transition count 3
Iterating global reduction 7 with 2 rules applied. Total rules applied 1052 place count 5 transition count 3
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 1053 place count 4 transition count 2
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1054 place count 3 transition count 2
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 1054 place count 3 transition count 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 1056 place count 2 transition count 1
Applied a total of 1056 rules in 105 ms. Remains 2 /701 variables (removed 699) and now considering 1/930 (removed 929) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 115 ms. Remains : 2/701 places, 1/930 transitions.
// Phase 1: matrix 1 rows 2 cols
[2025-06-07 17:53:04] [INFO ] Computed 1 invariants in 0 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (500000 resets) in 278 ms. (3584 steps per ms)
FORMULA Champagne-PT-H07T1U-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000000 steps (500000 resets) in 154 ms. (6451 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
[2025-06-07 17:53:04] [INFO ] Flatten gal took : 136 ms
[2025-06-07 17:53:04] [INFO ] Flatten gal took : 1 ms
[2025-06-07 17:53:04] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9644499285788827706.gal : 3 ms
[2025-06-07 17:53:04] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5799164874573170029.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality9644499285788827706.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5799164874573170029.prop' '--nowitness' '--gen-order' 'FOLLOW'
ITS runner timed out or was interrupted.

ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 7223 ms.

BK_STOP 1749318784780

--------------------
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
+ 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:
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /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="Champagne-PT-H07T1U"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2024"
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-5832"
echo " Executing tool gold2024"
echo " Input is Champagne-PT-H07T1U, 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 r265-tall-174931349600011"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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