Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r597-smll-171734926400066.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-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-5568
Executing tool gold2023
Input is MedleyA-PT-14, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r597-smll-171734926400066
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 580K
-rw-r--r-- 1 mcc users 6.0K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.1K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 17K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 190K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 94K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 46K Jun 2 16:33 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

here is the order used to build the result vector(from text file)
FORMULA_NAME MedleyA-PT-14-UpperBounds-00
FORMULA_NAME MedleyA-PT-14-UpperBounds-01
FORMULA_NAME MedleyA-PT-14-UpperBounds-02
FORMULA_NAME MedleyA-PT-14-UpperBounds-03
FORMULA_NAME MedleyA-PT-14-UpperBounds-04
FORMULA_NAME MedleyA-PT-14-UpperBounds-05
FORMULA_NAME MedleyA-PT-14-UpperBounds-06
FORMULA_NAME MedleyA-PT-14-UpperBounds-07
FORMULA_NAME MedleyA-PT-14-UpperBounds-08
FORMULA_NAME MedleyA-PT-14-UpperBounds-09
FORMULA_NAME MedleyA-PT-14-UpperBounds-10
FORMULA_NAME MedleyA-PT-14-UpperBounds-11
FORMULA_NAME MedleyA-PT-14-UpperBounds-12
FORMULA_NAME MedleyA-PT-14-UpperBounds-13
FORMULA_NAME MedleyA-PT-14-UpperBounds-14
FORMULA_NAME MedleyA-PT-14-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1717362645659

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyA-PT-14
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202304061127
[2024-06-02 21:10: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]
[2024-06-02 21:10:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 21:10:48] [INFO ] Load time of PNML (sax parser for PT used): 81 ms
[2024-06-02 21:10:48] [INFO ] Transformed 184 places.
[2024-06-02 21:10:48] [INFO ] Transformed 178 transitions.
[2024-06-02 21:10:48] [INFO ] Found NUPN structural information;
[2024-06-02 21:10:48] [INFO ] Parsed PT model containing 184 places and 178 transitions and 492 arcs in 183 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
// Phase 1: matrix 178 rows 184 cols
[2024-06-02 21:10:48] [INFO ] Computed 24 invariants in 27 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 16) seen :8
FORMULA MedleyA-PT-14-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-14-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-14-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-14-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-14-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-14-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-14-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-14-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 8) seen :2
FORMULA MedleyA-PT-14-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-14-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 6) seen :1
FORMULA MedleyA-PT-14-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 5) seen :0
[2024-06-02 21:10:48] [INFO ] Invariant cache hit.
[2024-06-02 21:10:49] [INFO ] [Real]Absence check using 15 positive place invariants in 20 ms returned sat
[2024-06-02 21:10:49] [INFO ] [Real]Absence check using 15 positive and 9 generalized place invariants in 6 ms returned sat
[2024-06-02 21:10:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 21:10:49] [INFO ] [Real]Absence check using state equation in 117 ms returned sat
[2024-06-02 21:10:49] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 21:10:49] [INFO ] [Nat]Absence check using 15 positive place invariants in 9 ms returned sat
[2024-06-02 21:10:49] [INFO ] [Nat]Absence check using 15 positive and 9 generalized place invariants in 6 ms returned sat
[2024-06-02 21:10:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 21:10:49] [INFO ] [Nat]Absence check using state equation in 96 ms returned sat
[2024-06-02 21:10:49] [INFO ] Computed and/alt/rep : 177/350/177 causal constraints (skipped 0 transitions) in 25 ms.
[2024-06-02 21:10:50] [INFO ] Deduced a trap composed of 57 places in 98 ms of which 6 ms to minimize.
[2024-06-02 21:10:50] [INFO ] Deduced a trap composed of 33 places in 94 ms of which 1 ms to minimize.
[2024-06-02 21:10:50] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 264 ms
[2024-06-02 21:10:50] [INFO ] Added : 156 causal constraints over 32 iterations in 971 ms. Result :sat
Minimization took 83 ms.
[2024-06-02 21:10:50] [INFO ] [Real]Absence check using 15 positive place invariants in 11 ms returned sat
[2024-06-02 21:10:50] [INFO ] [Real]Absence check using 15 positive and 9 generalized place invariants in 5 ms returned sat
[2024-06-02 21:10:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 21:10:50] [INFO ] [Real]Absence check using state equation in 98 ms returned sat
[2024-06-02 21:10:50] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 21:10:50] [INFO ] [Nat]Absence check using 15 positive place invariants in 11 ms returned sat
[2024-06-02 21:10:50] [INFO ] [Nat]Absence check using 15 positive and 9 generalized place invariants in 5 ms returned sat
[2024-06-02 21:10:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 21:10:51] [INFO ] [Nat]Absence check using state equation in 97 ms returned sat
[2024-06-02 21:10:51] [INFO ] Deduced a trap composed of 17 places in 63 ms of which 0 ms to minimize.
[2024-06-02 21:10:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 83 ms
[2024-06-02 21:10:51] [INFO ] Computed and/alt/rep : 177/350/177 causal constraints (skipped 0 transitions) in 18 ms.
[2024-06-02 21:10:51] [INFO ] Added : 150 causal constraints over 30 iterations in 541 ms. Result :sat
Minimization took 68 ms.
[2024-06-02 21:10:51] [INFO ] [Real]Absence check using 15 positive place invariants in 10 ms returned sat
[2024-06-02 21:10:51] [INFO ] [Real]Absence check using 15 positive and 9 generalized place invariants in 7 ms returned sat
[2024-06-02 21:10:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 21:10:51] [INFO ] [Real]Absence check using state equation in 89 ms returned sat
[2024-06-02 21:10:51] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 21:10:52] [INFO ] [Nat]Absence check using 15 positive place invariants in 12 ms returned sat
[2024-06-02 21:10:52] [INFO ] [Nat]Absence check using 15 positive and 9 generalized place invariants in 7 ms returned sat
[2024-06-02 21:10:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 21:10:52] [INFO ] [Nat]Absence check using state equation in 87 ms returned sat
[2024-06-02 21:10:52] [INFO ] Deduced a trap composed of 17 places in 58 ms of which 2 ms to minimize.
[2024-06-02 21:10:52] [INFO ] Deduced a trap composed of 26 places in 78 ms of which 1 ms to minimize.
[2024-06-02 21:10:52] [INFO ] Deduced a trap composed of 50 places in 79 ms of which 1 ms to minimize.
[2024-06-02 21:10:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 3 trap constraints in 247 ms
[2024-06-02 21:10:52] [INFO ] [Real]Absence check using 15 positive place invariants in 15 ms returned sat
[2024-06-02 21:10:52] [INFO ] [Real]Absence check using 15 positive and 9 generalized place invariants in 5 ms returned sat
[2024-06-02 21:10:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 21:10:52] [INFO ] [Real]Absence check using state equation in 86 ms returned sat
[2024-06-02 21:10:52] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 21:10:52] [INFO ] [Nat]Absence check using 15 positive place invariants in 10 ms returned sat
[2024-06-02 21:10:52] [INFO ] [Nat]Absence check using 15 positive and 9 generalized place invariants in 5 ms returned sat
[2024-06-02 21:10:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 21:10:52] [INFO ] [Nat]Absence check using state equation in 88 ms returned sat
[2024-06-02 21:10:52] [INFO ] Deduced a trap composed of 17 places in 75 ms of which 1 ms to minimize.
[2024-06-02 21:10:52] [INFO ] Deduced a trap composed of 27 places in 55 ms of which 1 ms to minimize.
[2024-06-02 21:10:52] [INFO ] Deduced a trap composed of 22 places in 54 ms of which 1 ms to minimize.
[2024-06-02 21:10:52] [INFO ] Deduced a trap composed of 20 places in 52 ms of which 1 ms to minimize.
[2024-06-02 21:10:53] [INFO ] Deduced a trap composed of 16 places in 74 ms of which 0 ms to minimize.
[2024-06-02 21:10:53] [INFO ] Deduced a trap composed of 31 places in 77 ms of which 0 ms to minimize.
[2024-06-02 21:10:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 6 trap constraints in 458 ms
[2024-06-02 21:10:53] [INFO ] [Real]Absence check using 15 positive place invariants in 9 ms returned sat
[2024-06-02 21:10:53] [INFO ] [Real]Absence check using 15 positive and 9 generalized place invariants in 5 ms returned sat
[2024-06-02 21:10:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 21:10:53] [INFO ] [Real]Absence check using state equation in 85 ms returned sat
[2024-06-02 21:10:53] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 21:10:53] [INFO ] [Nat]Absence check using 15 positive place invariants in 11 ms returned sat
[2024-06-02 21:10:53] [INFO ] [Nat]Absence check using 15 positive and 9 generalized place invariants in 5 ms returned sat
[2024-06-02 21:10:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 21:10:53] [INFO ] [Nat]Absence check using state equation in 92 ms returned sat
[2024-06-02 21:10:53] [INFO ] Computed and/alt/rep : 177/350/177 causal constraints (skipped 0 transitions) in 18 ms.
[2024-06-02 21:10:54] [INFO ] Deduced a trap composed of 42 places in 84 ms of which 1 ms to minimize.
[2024-06-02 21:10:54] [INFO ] Deduced a trap composed of 8 places in 74 ms of which 1 ms to minimize.
[2024-06-02 21:10:54] [INFO ] Deduced a trap composed of 21 places in 77 ms of which 0 ms to minimize.
[2024-06-02 21:10:54] [INFO ] Deduced a trap composed of 21 places in 52 ms of which 1 ms to minimize.
[2024-06-02 21:10:54] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 387 ms
[2024-06-02 21:10:54] [INFO ] Added : 150 causal constraints over 30 iterations in 1018 ms. Result :sat
Minimization took 89 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 0, 0, 1] Max seen :[0, 0, 0, 0, 0]
FORMULA MedleyA-PT-14-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MedleyA-PT-14-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MedleyA-PT-14-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA MedleyA-PT-14-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA MedleyA-PT-14-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
All properties solved without resorting to model-checking.
Total runtime 6435 ms.

BK_STOP 1717362656555

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /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-14"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2023"
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-5568"
echo " Executing tool gold2023"
echo " Input is MedleyA-PT-14, 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 r597-smll-171734926400066"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/MedleyA-PT-14.tgz
mv MedleyA-PT-14 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.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -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 ;