Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r046-smll-165252115900154.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
........................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool gold2021
Input is DES-PT-01b, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r046-smll-165252115900154
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 300K
-rw-r--r-- 1 mcc users 6.7K Apr 29 15:52 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K Apr 29 15:52 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Apr 29 15:52 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Apr 29 15:52 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.4K May 9 07:22 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 9 07:22 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 9 07:22 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 07:22 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.5K May 9 07:22 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K May 9 07:22 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 4 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 68K May 10 09: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 DES-PT-01b-UpperBounds-00
FORMULA_NAME DES-PT-01b-UpperBounds-01
FORMULA_NAME DES-PT-01b-UpperBounds-02
FORMULA_NAME DES-PT-01b-UpperBounds-03
FORMULA_NAME DES-PT-01b-UpperBounds-04
FORMULA_NAME DES-PT-01b-UpperBounds-05
FORMULA_NAME DES-PT-01b-UpperBounds-06
FORMULA_NAME DES-PT-01b-UpperBounds-07
FORMULA_NAME DES-PT-01b-UpperBounds-08
FORMULA_NAME DES-PT-01b-UpperBounds-09
FORMULA_NAME DES-PT-01b-UpperBounds-10
FORMULA_NAME DES-PT-01b-UpperBounds-11
FORMULA_NAME DES-PT-01b-UpperBounds-12
FORMULA_NAME DES-PT-01b-UpperBounds-13
FORMULA_NAME DES-PT-01b-UpperBounds-14
FORMULA_NAME DES-PT-01b-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1652526091366

Running Version 0
[2022-05-14 11:01:34] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-14 11:01:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-14 11:01:34] [INFO ] Load time of PNML (sax parser for PT used): 139 ms
[2022-05-14 11:01:34] [INFO ] Transformed 284 places.
[2022-05-14 11:01:34] [INFO ] Transformed 235 transitions.
[2022-05-14 11:01:34] [INFO ] Found NUPN structural information;
[2022-05-14 11:01:34] [INFO ] Parsed PT model containing 284 places and 235 transitions in 233 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 14 ms.
// Phase 1: matrix 235 rows 284 cols
[2022-05-14 11:01:34] [INFO ] Computed 65 place invariants in 39 ms
Incomplete random walk after 10000 steps, including 96 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 16) seen :15
FORMULA DES-PT-01b-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-01b-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-01b-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-01b-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-01b-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-01b-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-01b-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-01b-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-01b-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-01b-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-01b-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-01b-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-01b-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-01b-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-01b-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 1) seen :0
// Phase 1: matrix 235 rows 284 cols
[2022-05-14 11:01:35] [INFO ] Computed 65 place invariants in 10 ms
[2022-05-14 11:01:35] [INFO ] [Real]Absence check using 40 positive place invariants in 47 ms returned sat
[2022-05-14 11:01:35] [INFO ] [Real]Absence check using 40 positive and 25 generalized place invariants in 23 ms returned sat
[2022-05-14 11:01:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 11:01:35] [INFO ] [Real]Absence check using state equation in 194 ms returned sat
[2022-05-14 11:01:36] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 11:01:36] [INFO ] [Nat]Absence check using 40 positive place invariants in 93 ms returned sat
[2022-05-14 11:01:36] [INFO ] [Nat]Absence check using 40 positive and 25 generalized place invariants in 21 ms returned sat
[2022-05-14 11:01:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 11:01:36] [INFO ] [Nat]Absence check using state equation in 259 ms returned sat
[2022-05-14 11:01:36] [INFO ] Deduced a trap composed of 19 places in 226 ms of which 4 ms to minimize.
[2022-05-14 11:01:37] [INFO ] Deduced a trap composed of 31 places in 183 ms of which 3 ms to minimize.
[2022-05-14 11:01:37] [INFO ] Deduced a trap composed of 13 places in 176 ms of which 1 ms to minimize.
[2022-05-14 11:01:37] [INFO ] Deduced a trap composed of 14 places in 160 ms of which 5 ms to minimize.
[2022-05-14 11:01:37] [INFO ] Deduced a trap composed of 17 places in 118 ms of which 1 ms to minimize.
[2022-05-14 11:01:37] [INFO ] Deduced a trap composed of 17 places in 93 ms of which 1 ms to minimize.
[2022-05-14 11:01:37] [INFO ] Deduced a trap composed of 13 places in 82 ms of which 1 ms to minimize.
[2022-05-14 11:01:37] [INFO ] Deduced a trap composed of 31 places in 85 ms of which 1 ms to minimize.
[2022-05-14 11:01:38] [INFO ] Deduced a trap composed of 22 places in 111 ms of which 1 ms to minimize.
[2022-05-14 11:01:38] [INFO ] Deduced a trap composed of 23 places in 100 ms of which 1 ms to minimize.
[2022-05-14 11:01:38] [INFO ] Deduced a trap composed of 21 places in 99 ms of which 4 ms to minimize.
[2022-05-14 11:01:38] [INFO ] Deduced a trap composed of 24 places in 94 ms of which 1 ms to minimize.
[2022-05-14 11:01:38] [INFO ] Deduced a trap composed of 31 places in 71 ms of which 1 ms to minimize.
[2022-05-14 11:01:38] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 2001 ms
[2022-05-14 11:01:38] [INFO ] Computed and/alt/rep : 233/391/233 causal constraints (skipped 1 transitions) in 32 ms.
[2022-05-14 11:01:40] [INFO ] Added : 223 causal constraints over 46 iterations in 2042 ms. Result :sat
Minimization took 202 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Incomplete Parikh walk after 18300 steps, including 244 resets, run finished after 103 ms. (steps per millisecond=177 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 284 places. Attempting structural reductions.
Drop transitions removed 1 transitions
Starting structural reductions, iteration 0 : 284/284 places, 234/234 transitions.
Graph (complete) has 512 edges and 284 vertex of which 273 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.9 ms
Discarding 11 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 0 with 25 rules applied. Total rules applied 26 place count 273 transition count 204
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 1 with 23 rules applied. Total rules applied 49 place count 250 transition count 204
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 49 place count 250 transition count 194
Deduced a syphon composed of 10 places in 3 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 69 place count 240 transition count 194
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 87 place count 222 transition count 176
Iterating global reduction 2 with 18 rules applied. Total rules applied 105 place count 222 transition count 176
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 105 place count 222 transition count 175
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 107 place count 221 transition count 175
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 122 place count 206 transition count 160
Iterating global reduction 2 with 15 rules applied. Total rules applied 137 place count 206 transition count 160
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 15 rules applied. Total rules applied 152 place count 206 transition count 145
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 155 place count 204 transition count 144
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 155 place count 204 transition count 141
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 161 place count 201 transition count 141
Performed 74 Post agglomeration using F-continuation condition.Transition count delta: 74
Deduced a syphon composed of 74 places in 0 ms
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 4 with 148 rules applied. Total rules applied 309 place count 127 transition count 67
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -8
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 315 place count 124 transition count 75
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 316 place count 124 transition count 74
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 317 place count 123 transition count 74
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 318 place count 123 transition count 74
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 319 place count 122 transition count 73
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 321 place count 120 transition count 73
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 322 place count 120 transition count 73
Applied a total of 322 rules in 262 ms. Remains 120 /284 variables (removed 164) and now considering 73/234 (removed 161) transitions.
Finished structural reductions, in 1 iterations. Remains : 120/284 places, 73/234 transitions.
// Phase 1: matrix 73 rows 120 cols
[2022-05-14 11:01:41] [INFO ] Computed 60 place invariants in 8 ms
Incomplete random walk after 1000000 steps, including 80967 resets, run finished after 3018 ms. (steps per millisecond=331 ) properties (out of 1) seen :1
FORMULA DES-PT-01b-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.

BK_STOP 1652526105504

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination UpperBounds -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

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="DES-PT-01b"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2021"
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-4028"
echo " Executing tool gold2021"
echo " Input is DES-PT-01b, 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 r046-smll-165252115900154"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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