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.r139-smll-174876533100014.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 MedleyA-PT-02, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r139-smll-174876533100014
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 468K
-rw-r--r-- 1 mcc users 7.0K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.6K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 101K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.0K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 69K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 48K May 29 14:32 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-02-UpperBounds-00
FORMULA_NAME MedleyA-PT-02-UpperBounds-01
FORMULA_NAME MedleyA-PT-02-UpperBounds-02
FORMULA_NAME MedleyA-PT-02-UpperBounds-03
FORMULA_NAME MedleyA-PT-02-UpperBounds-04
FORMULA_NAME MedleyA-PT-02-UpperBounds-05
FORMULA_NAME MedleyA-PT-02-UpperBounds-06
FORMULA_NAME MedleyA-PT-02-UpperBounds-07
FORMULA_NAME MedleyA-PT-02-UpperBounds-08
FORMULA_NAME MedleyA-PT-02-UpperBounds-09
FORMULA_NAME MedleyA-PT-02-UpperBounds-10
FORMULA_NAME MedleyA-PT-02-UpperBounds-11
FORMULA_NAME MedleyA-PT-02-UpperBounds-12
FORMULA_NAME MedleyA-PT-02-UpperBounds-13
FORMULA_NAME MedleyA-PT-02-UpperBounds-14
FORMULA_NAME MedleyA-PT-02-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1748895586199

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyA-PT-02
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2025-06-02 20:19:48] [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-02 20:19:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 20:19:49] [INFO ] Load time of PNML (sax parser for PT used): 135 ms
[2025-06-02 20:19:49] [INFO ] Transformed 69 places.
[2025-06-02 20:19:49] [INFO ] Transformed 168 transitions.
[2025-06-02 20:19:49] [INFO ] Found NUPN structural information;
[2025-06-02 20:19:49] [INFO ] Parsed PT model containing 69 places and 168 transitions and 765 arcs in 358 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 23 ms.
Ensure Unique test removed 6 transitions
Reduce redundant transitions removed 6 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, 1, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
FORMULA MedleyA-PT-02-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
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] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 162 rows 69 cols
[2025-06-02 20:19:49] [INFO ] Computed 9 invariants in 17 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] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 10000 steps (996 resets) in 85 ms. (116 steps per ms)
FORMULA MedleyA-PT-02-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-02-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-02-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-02-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-02-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-02-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-02-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-02-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-02-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-02-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-02-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (905 resets) in 120 ms. (330 steps per ms)
FORMULA MedleyA-PT-02-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
[2025-06-02 20:19:49] [INFO ] Invariant cache hit.
[2025-06-02 20:19:49] [INFO ] [Real]Absence check using 8 positive place invariants in 11 ms returned sat
[2025-06-02 20:19:49] [INFO ] [Real]Absence check using 8 positive and 1 generalized place invariants in 11 ms returned sat
[2025-06-02 20:19:49] [INFO ] [Real]Absence check using state equation in 127 ms returned sat
[2025-06-02 20:19:49] [INFO ] State equation strengthened by 60 read => feed constraints.
[2025-06-02 20:19:49] [INFO ] [Real]Added 60 Read/Feed constraints in 19 ms returned sat
[2025-06-02 20:19:49] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:19:50] [INFO ] [Nat]Absence check using 8 positive place invariants in 7 ms returned sat
[2025-06-02 20:19:50] [INFO ] [Nat]Absence check using 8 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-02 20:19:50] [INFO ] [Nat]Absence check using state equation in 116 ms returned sat
[2025-06-02 20:19:50] [INFO ] [Nat]Added 60 Read/Feed constraints in 33 ms returned sat
[2025-06-02 20:19:50] [INFO ] Deduced a trap composed of 12 places in 74 ms of which 12 ms to minimize.
[2025-06-02 20:19:50] [INFO ] Deduced a trap composed of 11 places in 75 ms of which 3 ms to minimize.
[2025-06-02 20:19:50] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 215 ms
[2025-06-02 20:19:50] [INFO ] Computed and/alt/rep : 113/600/113 causal constraints (skipped 48 transitions) in 46 ms.
[2025-06-02 20:19:50] [INFO ] Added : 16 causal constraints over 4 iterations in 286 ms. Result :sat
Minimization took 89 ms.
[2025-06-02 20:19:50] [INFO ] [Real]Absence check using 8 positive place invariants in 7 ms returned sat
[2025-06-02 20:19:50] [INFO ] [Real]Absence check using 8 positive and 1 generalized place invariants in 2 ms returned sat
[2025-06-02 20:19:51] [INFO ] [Real]Absence check using state equation in 84 ms returned sat
[2025-06-02 20:19:51] [INFO ] [Real]Added 60 Read/Feed constraints in 10 ms returned sat
[2025-06-02 20:19:51] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:19:51] [INFO ] [Nat]Absence check using 8 positive place invariants in 8 ms returned sat
[2025-06-02 20:19:51] [INFO ] [Nat]Absence check using 8 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-02 20:19:51] [INFO ] [Nat]Absence check using state equation in 76 ms returned sat
[2025-06-02 20:19:51] [INFO ] [Nat]Added 60 Read/Feed constraints in 18 ms returned sat
[2025-06-02 20:19:51] [INFO ] Deduced a trap composed of 12 places in 60 ms of which 2 ms to minimize.
[2025-06-02 20:19:51] [INFO ] Deduced a trap composed of 10 places in 42 ms of which 1 ms to minimize.
[2025-06-02 20:19:51] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 129 ms
[2025-06-02 20:19:51] [INFO ] Computed and/alt/rep : 113/600/113 causal constraints (skipped 48 transitions) in 22 ms.
[2025-06-02 20:19:51] [INFO ] Added : 21 causal constraints over 5 iterations in 125 ms. Result :sat
Minimization took 56 ms.
[2025-06-02 20:19:51] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2025-06-02 20:19:51] [INFO ] [Real]Absence check using 8 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-02 20:19:51] [INFO ] [Real]Absence check using state equation in 94 ms returned sat
[2025-06-02 20:19:51] [INFO ] [Real]Added 60 Read/Feed constraints in 13 ms returned sat
[2025-06-02 20:19:51] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:19:51] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned sat
[2025-06-02 20:19:51] [INFO ] [Nat]Absence check using 8 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-02 20:19:51] [INFO ] [Nat]Absence check using state equation in 82 ms returned sat
[2025-06-02 20:19:51] [INFO ] [Nat]Added 60 Read/Feed constraints in 16 ms returned sat
[2025-06-02 20:19:51] [INFO ] Deduced a trap composed of 11 places in 60 ms of which 1 ms to minimize.
[2025-06-02 20:19:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 83 ms
[2025-06-02 20:19:51] [INFO ] Computed and/alt/rep : 113/600/113 causal constraints (skipped 48 transitions) in 30 ms.
[2025-06-02 20:19:52] [INFO ] Added : 16 causal constraints over 4 iterations in 162 ms. Result :sat
Minimization took 80 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
FORMULA MedleyA-PT-02-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA MedleyA-PT-02-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 69 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p25) removed 5 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 69/69 places, 157/157 transitions.
Graph (complete) has 280 edges and 69 vertex of which 67 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 2 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 66 transition count 153
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 17 place count 51 transition count 131
Iterating global reduction 1 with 15 rules applied. Total rules applied 32 place count 51 transition count 131
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 35 place count 48 transition count 114
Iterating global reduction 1 with 3 rules applied. Total rules applied 38 place count 48 transition count 114
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 39 place count 47 transition count 110
Iterating global reduction 1 with 1 rules applied. Total rules applied 40 place count 47 transition count 110
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 46 place count 44 transition count 107
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -35
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 58 place count 38 transition count 142
Drop transitions (Redundant composition of simpler transitions.) removed 30 transitions
Redundant transition composition rules discarded 30 transitions
Iterating global reduction 1 with 30 rules applied. Total rules applied 88 place count 38 transition count 112
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 90 place count 38 transition count 110
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 92 place count 36 transition count 110
Applied a total of 92 rules in 115 ms. Remains 36 /69 variables (removed 33) and now considering 110/157 (removed 47) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 136 ms. Remains : 36/69 places, 110/157 transitions.
// Phase 1: matrix 110 rows 36 cols
[2025-06-02 20:19:52] [INFO ] Computed 9 invariants in 13 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (214957 resets) in 2593 ms. (385 steps per ms)
FORMULA MedleyA-PT-02-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000001 steps (54963 resets) in 755 ms. (1322 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-02 20:19:56] [INFO ] Flatten gal took : 61 ms
[2025-06-02 20:19:56] [INFO ] Flatten gal took : 20 ms
[2025-06-02 20:19:56] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9082159349482793198.gal : 14 ms
[2025-06-02 20:19:56] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality81673734397138462.prop : 1 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/ReachabilityCardinality9082159349482793198.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality81673734397138462.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 7793 ms.

BK_STOP 1748895596482

--------------------
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:
++ 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.202405141337.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="MedleyA-PT-02"
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 MedleyA-PT-02, 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 r139-smll-174876533100014"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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