Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 520K
-rw-r--r-- 1 mcc users 7.8K Feb 26 15:37 CTLCardinality.txt
-rw-r--r-- 1 mcc users 87K Feb 26 15:37 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Feb 26 15:36 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K Feb 26 15:36 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 15:50 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 15:50 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 15:50 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 15:50 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 26 15:37 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 123K Feb 26 15:37 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.0K Feb 26 15:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 71K Feb 26 15:37 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Feb 25 15:50 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Feb 25 15:50 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 69K Mar 5 18:22 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-02b-UpperBounds-00
FORMULA_NAME DES-PT-02b-UpperBounds-01
FORMULA_NAME DES-PT-02b-UpperBounds-02
FORMULA_NAME DES-PT-02b-UpperBounds-03
FORMULA_NAME DES-PT-02b-UpperBounds-04
FORMULA_NAME DES-PT-02b-UpperBounds-05
FORMULA_NAME DES-PT-02b-UpperBounds-06
FORMULA_NAME DES-PT-02b-UpperBounds-07
FORMULA_NAME DES-PT-02b-UpperBounds-08
FORMULA_NAME DES-PT-02b-UpperBounds-09
FORMULA_NAME DES-PT-02b-UpperBounds-10
FORMULA_NAME DES-PT-02b-UpperBounds-11
FORMULA_NAME DES-PT-02b-UpperBounds-12
FORMULA_NAME DES-PT-02b-UpperBounds-13
FORMULA_NAME DES-PT-02b-UpperBounds-14
FORMULA_NAME DES-PT-02b-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678174663443

Running Version 202205111006
[2023-03-07 07:37:44] [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]
[2023-03-07 07:37:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-07 07:37:44] [INFO ] Load time of PNML (sax parser for PT used): 97 ms
[2023-03-07 07:37:44] [INFO ] Transformed 288 places.
[2023-03-07 07:37:44] [INFO ] Transformed 239 transitions.
[2023-03-07 07:37:44] [INFO ] Found NUPN structural information;
[2023-03-07 07:37:44] [INFO ] Parsed PT model containing 288 places and 239 transitions in 204 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
// Phase 1: matrix 239 rows 288 cols
[2023-03-07 07:37:44] [INFO ] Computed 65 place invariants in 26 ms
Incomplete random walk after 10000 steps, including 88 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 16) seen :15
FORMULA DES-PT-02b-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-02b-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-02b-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-02b-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-02b-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-02b-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-02b-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-02b-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-02b-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-02b-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-02b-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-02b-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-02b-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-02b-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-02b-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
// Phase 1: matrix 239 rows 288 cols
[2023-03-07 07:37:44] [INFO ] Computed 65 place invariants in 12 ms
[2023-03-07 07:37:45] [INFO ] [Real]Absence check using 39 positive place invariants in 17 ms returned sat
[2023-03-07 07:37:45] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 12 ms returned sat
[2023-03-07 07:37:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 07:37:45] [INFO ] [Real]Absence check using state equation in 101 ms returned sat
[2023-03-07 07:37:45] [INFO ] Deduced a trap composed of 21 places in 86 ms of which 8 ms to minimize.
[2023-03-07 07:37:45] [INFO ] Deduced a trap composed of 21 places in 72 ms of which 1 ms to minimize.
[2023-03-07 07:37:45] [INFO ] Deduced a trap composed of 43 places in 51 ms of which 1 ms to minimize.
[2023-03-07 07:37:45] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 1 ms to minimize.
[2023-03-07 07:37:45] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 325 ms
[2023-03-07 07:37:45] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 07:37:45] [INFO ] [Nat]Absence check using 39 positive place invariants in 17 ms returned sat
[2023-03-07 07:37:45] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 7 ms returned sat
[2023-03-07 07:37:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 07:37:45] [INFO ] [Nat]Absence check using state equation in 66 ms returned sat
[2023-03-07 07:37:45] [INFO ] Deduced a trap composed of 10 places in 61 ms of which 1 ms to minimize.
[2023-03-07 07:37:45] [INFO ] Deduced a trap composed of 22 places in 70 ms of which 0 ms to minimize.
[2023-03-07 07:37:46] [INFO ] Deduced a trap composed of 18 places in 67 ms of which 0 ms to minimize.
[2023-03-07 07:37:46] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 0 ms to minimize.
[2023-03-07 07:37:46] [INFO ] Deduced a trap composed of 21 places in 50 ms of which 1 ms to minimize.
[2023-03-07 07:37:46] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 1 ms to minimize.
[2023-03-07 07:37:46] [INFO ] Deduced a trap composed of 32 places in 45 ms of which 0 ms to minimize.
[2023-03-07 07:37:46] [INFO ] Deduced a trap composed of 30 places in 49 ms of which 0 ms to minimize.
[2023-03-07 07:37:46] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 0 ms to minimize.
[2023-03-07 07:37:46] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 0 ms to minimize.
[2023-03-07 07:37:46] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 1 ms to minimize.
[2023-03-07 07:37:46] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
[2023-03-07 07:37:46] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 728 ms
[2023-03-07 07:37:46] [INFO ] Computed and/alt/rep : 237/406/237 causal constraints (skipped 1 transitions) in 14 ms.
[2023-03-07 07:37:47] [INFO ] Deduced a trap composed of 33 places in 77 ms of which 0 ms to minimize.
[2023-03-07 07:37:47] [INFO ] Deduced a trap composed of 35 places in 78 ms of which 0 ms to minimize.
[2023-03-07 07:37:47] [INFO ] Deduced a trap composed of 13 places in 58 ms of which 1 ms to minimize.
[2023-03-07 07:37:47] [INFO ] Deduced a trap composed of 31 places in 49 ms of which 0 ms to minimize.
[2023-03-07 07:37:48] [INFO ] Deduced a trap composed of 31 places in 46 ms of which 0 ms to minimize.
[2023-03-07 07:37:48] [INFO ] Deduced a trap composed of 35 places in 42 ms of which 2 ms to minimize.
[2023-03-07 07:37:48] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 505 ms
[2023-03-07 07:37:48] [INFO ] Added : 217 causal constraints over 44 iterations in 1610 ms. Result :sat
Minimization took 86 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 288 places. Attempting structural reductions.
Drop transitions removed 1 transitions
Starting structural reductions in SAFETY mode, iteration 0 : 288/288 places, 238/238 transitions.
Graph (complete) has 522 edges and 288 vertex of which 277 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.3 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 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 0 with 23 rules applied. Total rules applied 24 place count 277 transition count 210
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 1 with 21 rules applied. Total rules applied 45 place count 256 transition count 210
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 45 place count 256 transition count 201
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 63 place count 247 transition count 201
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 82 place count 228 transition count 182
Iterating global reduction 2 with 19 rules applied. Total rules applied 101 place count 228 transition count 182
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 101 place count 228 transition count 181
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 103 place count 227 transition count 181
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 118 place count 212 transition count 166
Iterating global reduction 2 with 15 rules applied. Total rules applied 133 place count 212 transition count 166
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 148 place count 212 transition count 151
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 151 place count 210 transition count 150
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 151 place count 210 transition count 147
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 157 place count 207 transition count 147
Performed 77 Post agglomeration using F-continuation condition.Transition count delta: 77
Deduced a syphon composed of 77 places in 0 ms
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 4 with 154 rules applied. Total rules applied 311 place count 130 transition count 70
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 315 place count 128 transition count 72
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 316 place count 128 transition count 71
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 317 place count 127 transition count 71
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 127 transition count 71
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 319 place count 126 transition count 70
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 320 place count 125 transition count 70
Applied a total of 320 rules in 173 ms. Remains 125 /288 variables (removed 163) and now considering 70/238 (removed 168) transitions.
Finished structural reductions, in 1 iterations. Remains : 125/288 places, 70/238 transitions.
// Phase 1: matrix 70 rows 125 cols
[2023-03-07 07:37:48] [INFO ] Computed 61 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 51059 resets, run finished after 1773 ms. (steps per millisecond=564 ) properties (out of 1) seen :1
FORMULA DES-PT-02b-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 5739 ms.

BK_STOP 1678174670394

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

+ export LANG=C
+ LANG=C
+ 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
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -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=@none -Xss128m -Xms40m -Xmx8192m

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-02b"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2022"
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-5348"
echo " Executing tool gold2022"
echo " Input is DES-PT-02b, 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 r127-tall-167814504300049"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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