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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 504K
-rw-r--r-- 1 mcc users 5.8K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 124K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.5K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 74K 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 75K 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-05-UpperBounds-00
FORMULA_NAME MedleyA-PT-05-UpperBounds-01
FORMULA_NAME MedleyA-PT-05-UpperBounds-02
FORMULA_NAME MedleyA-PT-05-UpperBounds-03
FORMULA_NAME MedleyA-PT-05-UpperBounds-04
FORMULA_NAME MedleyA-PT-05-UpperBounds-05
FORMULA_NAME MedleyA-PT-05-UpperBounds-06
FORMULA_NAME MedleyA-PT-05-UpperBounds-07
FORMULA_NAME MedleyA-PT-05-UpperBounds-08
FORMULA_NAME MedleyA-PT-05-UpperBounds-09
FORMULA_NAME MedleyA-PT-05-UpperBounds-10
FORMULA_NAME MedleyA-PT-05-UpperBounds-11
FORMULA_NAME MedleyA-PT-05-UpperBounds-12
FORMULA_NAME MedleyA-PT-05-UpperBounds-13
FORMULA_NAME MedleyA-PT-05-UpperBounds-14
FORMULA_NAME MedleyA-PT-05-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1748895655401

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-05
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2025-06-02 20:20: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-02 20:20:57] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 20:20:58] [INFO ] Load time of PNML (sax parser for PT used): 161 ms
[2025-06-02 20:20:58] [INFO ] Transformed 115 places.
[2025-06-02 20:20:58] [INFO ] Transformed 257 transitions.
[2025-06-02 20:20:58] [INFO ] Found NUPN structural information;
[2025-06-02 20:20:58] [INFO ] Parsed PT model containing 115 places and 257 transitions and 1160 arcs in 383 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 17 ms.
Ensure Unique test removed 3 transitions
Reduce redundant transitions removed 3 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]
[2025-06-02 20:20:58] [INFO ] Flow matrix only has 253 transitions (discarded 1 similar events)
// Phase 1: matrix 253 rows 115 cols
[2025-06-02 20:20:58] [INFO ] Computed 20 invariants in 22 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 (739 resets) in 117 ms. (84 steps per ms)
FORMULA MedleyA-PT-05-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-05-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-05-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-05-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-05-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-05-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-05-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-05-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-05-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-05-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-05-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-05-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (496 resets) in 107 ms. (370 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
[2025-06-02 20:20:58] [INFO ] Flow matrix only has 253 transitions (discarded 1 similar events)
[2025-06-02 20:20:58] [INFO ] Invariant cache hit.
[2025-06-02 20:20:59] [INFO ] [Real]Absence check using 15 positive place invariants in 16 ms returned sat
[2025-06-02 20:20:59] [INFO ] [Real]Absence check using 15 positive and 5 generalized place invariants in 4 ms returned sat
[2025-06-02 20:20:59] [INFO ] [Real]Absence check using state equation in 201 ms returned sat
[2025-06-02 20:20:59] [INFO ] State equation strengthened by 94 read => feed constraints.
[2025-06-02 20:20:59] [INFO ] [Real]Added 94 Read/Feed constraints in 31 ms returned sat
[2025-06-02 20:20:59] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:20:59] [INFO ] [Nat]Absence check using 15 positive place invariants in 11 ms returned sat
[2025-06-02 20:20:59] [INFO ] [Nat]Absence check using 15 positive and 5 generalized place invariants in 4 ms returned sat
[2025-06-02 20:20:59] [INFO ] [Nat]Absence check using state equation in 174 ms returned sat
[2025-06-02 20:21:00] [INFO ] [Nat]Added 94 Read/Feed constraints in 180 ms returned sat
[2025-06-02 20:21:00] [INFO ] Computed and/alt/rep : 228/1111/227 causal constraints (skipped 25 transitions) in 69 ms.
[2025-06-02 20:21:00] [INFO ] Added : 13 causal constraints over 3 iterations in 229 ms. Result :sat
Minimization took 87 ms.
[2025-06-02 20:21:00] [INFO ] [Real]Absence check using 15 positive place invariants in 10 ms returned sat
[2025-06-02 20:21:00] [INFO ] [Real]Absence check using 15 positive and 5 generalized place invariants in 3 ms returned sat
[2025-06-02 20:21:00] [INFO ] [Real]Absence check using state equation in 124 ms returned sat
[2025-06-02 20:21:00] [INFO ] [Real]Added 94 Read/Feed constraints in 19 ms returned sat
[2025-06-02 20:21:00] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:21:00] [INFO ] [Nat]Absence check using 15 positive place invariants in 11 ms returned sat
[2025-06-02 20:21:00] [INFO ] [Nat]Absence check using 15 positive and 5 generalized place invariants in 3 ms returned sat
[2025-06-02 20:21:00] [INFO ] [Nat]Absence check using state equation in 118 ms returned sat
[2025-06-02 20:21:00] [INFO ] [Nat]Added 94 Read/Feed constraints in 31 ms returned sat
[2025-06-02 20:21:01] [INFO ] Deduced a trap composed of 17 places in 77 ms of which 14 ms to minimize.
[2025-06-02 20:21:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 116 ms
[2025-06-02 20:21:01] [INFO ] Computed and/alt/rep : 228/1111/227 causal constraints (skipped 25 transitions) in 39 ms.
[2025-06-02 20:21:01] [INFO ] Added : 43 causal constraints over 9 iterations in 396 ms. Result :sat
Minimization took 153 ms.
[2025-06-02 20:21:01] [INFO ] [Real]Absence check using 15 positive place invariants in 8 ms returned sat
[2025-06-02 20:21:01] [INFO ] [Real]Absence check using 15 positive and 5 generalized place invariants in 2 ms returned sat
[2025-06-02 20:21:01] [INFO ] [Real]Absence check using state equation in 123 ms returned sat
[2025-06-02 20:21:01] [INFO ] [Real]Added 94 Read/Feed constraints in 16 ms returned sat
[2025-06-02 20:21:01] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:21:01] [INFO ] [Nat]Absence check using 15 positive place invariants in 11 ms returned sat
[2025-06-02 20:21:01] [INFO ] [Nat]Absence check using 15 positive and 5 generalized place invariants in 2 ms returned sat
[2025-06-02 20:21:02] [INFO ] [Nat]Absence check using state equation in 127 ms returned sat
[2025-06-02 20:21:02] [INFO ] [Nat]Added 94 Read/Feed constraints in 27 ms returned sat
[2025-06-02 20:21:02] [INFO ] Computed and/alt/rep : 228/1111/227 causal constraints (skipped 25 transitions) in 51 ms.
[2025-06-02 20:21:02] [INFO ] Added : 42 causal constraints over 9 iterations in 467 ms. Result :sat
Minimization took 140 ms.
[2025-06-02 20:21:02] [INFO ] [Real]Absence check using 15 positive place invariants in 8 ms returned sat
[2025-06-02 20:21:02] [INFO ] [Real]Absence check using 15 positive and 5 generalized place invariants in 2 ms returned sat
[2025-06-02 20:21:02] [INFO ] [Real]Absence check using state equation in 120 ms returned sat
[2025-06-02 20:21:03] [INFO ] [Real]Added 94 Read/Feed constraints in 15 ms returned sat
[2025-06-02 20:21:03] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:21:03] [INFO ] [Nat]Absence check using 15 positive place invariants in 8 ms returned sat
[2025-06-02 20:21:03] [INFO ] [Nat]Absence check using 15 positive and 5 generalized place invariants in 2 ms returned sat
[2025-06-02 20:21:03] [INFO ] [Nat]Absence check using state equation in 106 ms returned sat
[2025-06-02 20:21:03] [INFO ] [Nat]Added 94 Read/Feed constraints in 22 ms returned sat
[2025-06-02 20:21:03] [INFO ] Deduced a trap composed of 18 places in 58 ms of which 5 ms to minimize.
[2025-06-02 20:21:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 85 ms
[2025-06-02 20:21:03] [INFO ] Computed and/alt/rep : 228/1111/227 causal constraints (skipped 25 transitions) in 33 ms.
[2025-06-02 20:21:03] [INFO ] Added : 23 causal constraints over 5 iterations in 222 ms. Result :sat
Minimization took 125 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
FORMULA MedleyA-PT-05-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA MedleyA-PT-05-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA MedleyA-PT-05-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA MedleyA-PT-05-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided 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:21:04] [INFO ] Flatten gal took : 128 ms
[2025-06-02 20:21:04] [INFO ] Flatten gal took : 49 ms
[2025-06-02 20:21:04] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2796467535237453723.gal : 36 ms
[2025-06-02 20:21:04] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7196959968853308791.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/ReachabilityCardinality2796467535237453723.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7196959968853308791.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
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 6663 ms.

BK_STOP 1748895664669

--------------------
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-05"
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-05, 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-174876533100017"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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