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.r028-tall-165251936100139.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 BusinessProcesses-PT-07, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r028-tall-165251936100139
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 320K
-rw-r--r-- 1 mcc users 6.0K Apr 30 00:02 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K Apr 30 00:02 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Apr 30 00:01 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Apr 30 00:01 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.7K May 9 07:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 9 07:09 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 07:09 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 07:09 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 07:09 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 07:09 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 3 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 100K 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 BusinessProcesses-PT-07-UpperBounds-00
FORMULA_NAME BusinessProcesses-PT-07-UpperBounds-01
FORMULA_NAME BusinessProcesses-PT-07-UpperBounds-02
FORMULA_NAME BusinessProcesses-PT-07-UpperBounds-03
FORMULA_NAME BusinessProcesses-PT-07-UpperBounds-04
FORMULA_NAME BusinessProcesses-PT-07-UpperBounds-05
FORMULA_NAME BusinessProcesses-PT-07-UpperBounds-06
FORMULA_NAME BusinessProcesses-PT-07-UpperBounds-07
FORMULA_NAME BusinessProcesses-PT-07-UpperBounds-08
FORMULA_NAME BusinessProcesses-PT-07-UpperBounds-09
FORMULA_NAME BusinessProcesses-PT-07-UpperBounds-10
FORMULA_NAME BusinessProcesses-PT-07-UpperBounds-11
FORMULA_NAME BusinessProcesses-PT-07-UpperBounds-12
FORMULA_NAME BusinessProcesses-PT-07-UpperBounds-13
FORMULA_NAME BusinessProcesses-PT-07-UpperBounds-14
FORMULA_NAME BusinessProcesses-PT-07-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1652541221012

Running Version 0
[2022-05-14 15:13:42] [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 15:13:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-14 15:13:42] [INFO ] Load time of PNML (sax parser for PT used): 66 ms
[2022-05-14 15:13:42] [INFO ] Transformed 386 places.
[2022-05-14 15:13:42] [INFO ] Transformed 360 transitions.
[2022-05-14 15:13:42] [INFO ] Found NUPN structural information;
[2022-05-14 15:13:42] [INFO ] Parsed PT model containing 386 places and 360 transitions in 117 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
// Phase 1: matrix 360 rows 386 cols
[2022-05-14 15:13:42] [INFO ] Computed 62 place invariants in 32 ms
Incomplete random walk after 10000 steps, including 108 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 16) seen :12
FORMULA BusinessProcesses-PT-07-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-07-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-07-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-07-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-07-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-07-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-07-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-07-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-07-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-07-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-07-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-07-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 4) seen :2
FORMULA BusinessProcesses-PT-07-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-07-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
// Phase 1: matrix 360 rows 386 cols
[2022-05-14 15:13:42] [INFO ] Computed 62 place invariants in 18 ms
[2022-05-14 15:13:43] [INFO ] [Real]Absence check using 33 positive place invariants in 22 ms returned sat
[2022-05-14 15:13:43] [INFO ] [Real]Absence check using 33 positive and 29 generalized place invariants in 9 ms returned sat
[2022-05-14 15:13:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 15:13:43] [INFO ] [Real]Absence check using state equation in 119 ms returned sat
[2022-05-14 15:13:43] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 15:13:43] [INFO ] [Nat]Absence check using 33 positive place invariants in 12 ms returned sat
[2022-05-14 15:13:43] [INFO ] [Nat]Absence check using 33 positive and 29 generalized place invariants in 7 ms returned sat
[2022-05-14 15:13:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 15:13:43] [INFO ] [Nat]Absence check using state equation in 115 ms returned sat
[2022-05-14 15:13:43] [INFO ] Deduced a trap composed of 93 places in 139 ms of which 3 ms to minimize.
[2022-05-14 15:13:43] [INFO ] Deduced a trap composed of 86 places in 94 ms of which 1 ms to minimize.
[2022-05-14 15:13:43] [INFO ] Deduced a trap composed of 93 places in 78 ms of which 1 ms to minimize.
[2022-05-14 15:13:44] [INFO ] Deduced a trap composed of 89 places in 82 ms of which 1 ms to minimize.
[2022-05-14 15:13:44] [INFO ] Deduced a trap composed of 89 places in 89 ms of which 0 ms to minimize.
[2022-05-14 15:13:44] [INFO ] Deduced a trap composed of 91 places in 83 ms of which 1 ms to minimize.
[2022-05-14 15:13:44] [INFO ] Deduced a trap composed of 12 places in 95 ms of which 0 ms to minimize.
[2022-05-14 15:13:44] [INFO ] Deduced a trap composed of 18 places in 106 ms of which 1 ms to minimize.
[2022-05-14 15:13:44] [INFO ] Deduced a trap composed of 18 places in 91 ms of which 1 ms to minimize.
[2022-05-14 15:13:44] [INFO ] Deduced a trap composed of 8 places in 91 ms of which 1 ms to minimize.
[2022-05-14 15:13:44] [INFO ] Deduced a trap composed of 98 places in 101 ms of which 1 ms to minimize.
[2022-05-14 15:13:44] [INFO ] Deduced a trap composed of 15 places in 106 ms of which 0 ms to minimize.
[2022-05-14 15:13:45] [INFO ] Deduced a trap composed of 22 places in 92 ms of which 1 ms to minimize.
[2022-05-14 15:13:45] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 0 ms to minimize.
[2022-05-14 15:13:45] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 1580 ms
[2022-05-14 15:13:45] [INFO ] Computed and/alt/rep : 339/625/339 causal constraints (skipped 20 transitions) in 23 ms.
[2022-05-14 15:13:45] [INFO ] Added : 137 causal constraints over 28 iterations in 776 ms. Result :sat
Minimization took 68 ms.
[2022-05-14 15:13:46] [INFO ] [Real]Absence check using 33 positive place invariants in 20 ms returned sat
[2022-05-14 15:13:46] [INFO ] [Real]Absence check using 33 positive and 29 generalized place invariants in 8 ms returned sat
[2022-05-14 15:13:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 15:13:46] [INFO ] [Real]Absence check using state equation in 96 ms returned sat
[2022-05-14 15:13:46] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 15:13:46] [INFO ] [Nat]Absence check using 33 positive place invariants in 12 ms returned sat
[2022-05-14 15:13:46] [INFO ] [Nat]Absence check using 33 positive and 29 generalized place invariants in 9 ms returned sat
[2022-05-14 15:13:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 15:13:46] [INFO ] [Nat]Absence check using state equation in 94 ms returned sat
[2022-05-14 15:13:46] [INFO ] Deduced a trap composed of 14 places in 87 ms of which 1 ms to minimize.
[2022-05-14 15:13:46] [INFO ] Deduced a trap composed of 96 places in 84 ms of which 1 ms to minimize.
[2022-05-14 15:13:46] [INFO ] Deduced a trap composed of 96 places in 81 ms of which 0 ms to minimize.
[2022-05-14 15:13:46] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 327 ms
[2022-05-14 15:13:46] [INFO ] Computed and/alt/rep : 339/625/339 causal constraints (skipped 20 transitions) in 19 ms.
[2022-05-14 15:13:47] [INFO ] Added : 182 causal constraints over 37 iterations in 1021 ms. Result :sat
Minimization took 63 ms.
Current structural bounds on expressions (after SMT) : [1, 1] Max seen :[0, 0]
Incomplete Parikh walk after 12400 steps, including 141 resets, run finished after 28 ms. (steps per millisecond=442 ) properties (out of 2) seen :0 could not realise parikh vector
Incomplete Parikh walk after 8800 steps, including 101 resets, run finished after 21 ms. (steps per millisecond=419 ) properties (out of 2) seen :1 could not realise parikh vector
FORMULA BusinessProcesses-PT-07-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 1 out of 386 places. Attempting structural reductions.
Drop transitions removed 1 transitions
Starting structural reductions, iteration 0 : 386/386 places, 359/359 transitions.
Graph (trivial) has 215 edges and 386 vertex of which 7 / 386 are part of one of the 1 SCC in 6 ms
Free SCC test removed 6 places
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 804 edges and 380 vertex of which 378 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 81 transitions
Trivial Post-agglo rules discarded 81 transitions
Performed 81 trivial Post agglomeration. Transition count delta: 81
Iterating post reduction 0 with 81 rules applied. Total rules applied 83 place count 378 transition count 269
Reduce places removed 81 places and 0 transitions.
Iterating post reduction 1 with 81 rules applied. Total rules applied 164 place count 297 transition count 269
Performed 59 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 59 Pre rules applied. Total rules applied 164 place count 297 transition count 210
Deduced a syphon composed of 59 places in 1 ms
Ensure Unique test removed 9 places
Reduce places removed 68 places and 0 transitions.
Iterating global reduction 2 with 127 rules applied. Total rules applied 291 place count 229 transition count 210
Discarding 45 places :
Symmetric choice reduction at 2 with 45 rule applications. Total rules 336 place count 184 transition count 165
Iterating global reduction 2 with 45 rules applied. Total rules applied 381 place count 184 transition count 165
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 381 place count 184 transition count 159
Deduced a syphon composed of 6 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 13 rules applied. Total rules applied 394 place count 177 transition count 159
Performed 57 Post agglomeration using F-continuation condition.Transition count delta: 57
Deduced a syphon composed of 57 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 2 with 116 rules applied. Total rules applied 510 place count 118 transition count 102
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 512 place count 117 transition count 105
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 514 place count 117 transition count 103
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 516 place count 115 transition count 103
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 517 place count 115 transition count 103
Applied a total of 517 rules in 91 ms. Remains 115 /386 variables (removed 271) and now considering 103/359 (removed 256) transitions.
Finished structural reductions, in 1 iterations. Remains : 115/386 places, 103/359 transitions.
// Phase 1: matrix 103 rows 115 cols
[2022-05-14 15:13:47] [INFO ] Computed 49 place invariants in 4 ms
Incomplete random walk after 1000000 steps, including 72905 resets, run finished after 1853 ms. (steps per millisecond=539 ) properties (out of 1) seen :1
FORMULA BusinessProcesses-PT-07-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.

BK_STOP 1652541230769

--------------------
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="BusinessProcesses-PT-07"
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 BusinessProcesses-PT-07, 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 r028-tall-165251936100139"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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