Execution Chart

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

Trace from the execution

Formatting '/data/fko/mcc2022-input.r215-oct2-165281605900181.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/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 ServersAndClients-PT-100160, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r215-oct2-165281605900181
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 10M
-rw-r--r-- 1 mcc users 8.0K Apr 29 17:09 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K Apr 29 17:09 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Apr 29 17:06 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K Apr 29 17:06 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K May 9 08:45 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 9 08:45 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 9 08:45 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 9 08:45 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 9 08:45 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 9 08:45 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 7 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 9.8M May 10 09:34 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 ServersAndClients-PT-100160-UpperBounds-00
FORMULA_NAME ServersAndClients-PT-100160-UpperBounds-01
FORMULA_NAME ServersAndClients-PT-100160-UpperBounds-02
FORMULA_NAME ServersAndClients-PT-100160-UpperBounds-03
FORMULA_NAME ServersAndClients-PT-100160-UpperBounds-04
FORMULA_NAME ServersAndClients-PT-100160-UpperBounds-05
FORMULA_NAME ServersAndClients-PT-100160-UpperBounds-06
FORMULA_NAME ServersAndClients-PT-100160-UpperBounds-07
FORMULA_NAME ServersAndClients-PT-100160-UpperBounds-08
FORMULA_NAME ServersAndClients-PT-100160-UpperBounds-09
FORMULA_NAME ServersAndClients-PT-100160-UpperBounds-10
FORMULA_NAME ServersAndClients-PT-100160-UpperBounds-11
FORMULA_NAME ServersAndClients-PT-100160-UpperBounds-12
FORMULA_NAME ServersAndClients-PT-100160-UpperBounds-13
FORMULA_NAME ServersAndClients-PT-100160-UpperBounds-14
FORMULA_NAME ServersAndClients-PT-100160-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1653212839405

Running Version 0
[2022-05-22 09:47:21] [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-22 09:47:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-22 09:47:22] [INFO ] Load time of PNML (sax parser for PT used): 722 ms
[2022-05-22 09:47:22] [INFO ] Transformed 16561 places.
[2022-05-22 09:47:22] [INFO ] Transformed 32200 transitions.
[2022-05-22 09:47:22] [INFO ] Parsed PT model containing 16561 places and 32200 transitions in 910 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 9 ms.
// Phase 1: matrix 32200 rows 16561 cols
[2022-05-22 09:47:23] [INFO ] Computed 361 place invariants in 499 ms
FORMULA ServersAndClients-PT-100160-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 553 ms. (steps per millisecond=18 ) properties (out of 15) seen :1
FORMULA ServersAndClients-PT-100160-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 14) seen :1
FORMULA ServersAndClients-PT-100160-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 13) seen :1
FORMULA ServersAndClients-PT-100160-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 12) seen :1
FORMULA ServersAndClients-PT-100160-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 11) seen :0
// Phase 1: matrix 32200 rows 16561 cols
[2022-05-22 09:47:24] [INFO ] Computed 361 place invariants in 200 ms
[2022-05-22 09:47:26] [INFO ] [Real]Absence check using 261 positive place invariants in 824 ms returned sat
[2022-05-22 09:47:27] [INFO ] [Real]Absence check using 261 positive and 100 generalized place invariants in 204 ms returned sat
[2022-05-22 09:47:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-22 09:47:29] [INFO ] [Real]Absence check using state equation in 2434 ms returned unknown
[2022-05-22 09:47:31] [INFO ] [Real]Absence check using 261 positive place invariants in 822 ms returned sat
[2022-05-22 09:47:32] [INFO ] [Real]Absence check using 261 positive and 100 generalized place invariants in 207 ms returned sat
[2022-05-22 09:47:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-22 09:47:34] [INFO ] [Real]Absence check using state equation in 2547 ms returned unknown
[2022-05-22 09:47:36] [INFO ] [Real]Absence check using 261 positive place invariants in 847 ms returned sat
[2022-05-22 09:47:37] [INFO ] [Real]Absence check using 261 positive and 100 generalized place invariants in 222 ms returned sat
[2022-05-22 09:47:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-22 09:47:39] [INFO ] [Real]Absence check using state equation in 2559 ms returned unknown
[2022-05-22 09:47:41] [INFO ] [Real]Absence check using 261 positive place invariants in 738 ms returned sat
[2022-05-22 09:47:41] [INFO ] [Real]Absence check using 261 positive and 100 generalized place invariants in 186 ms returned sat
[2022-05-22 09:47:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-22 09:47:44] [INFO ] [Real]Absence check using state equation in 2886 ms returned unknown
[2022-05-22 09:47:46] [INFO ] [Real]Absence check using 261 positive place invariants in 757 ms returned sat
[2022-05-22 09:47:46] [INFO ] [Real]Absence check using 261 positive and 100 generalized place invariants in 205 ms returned sat
[2022-05-22 09:47:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-22 09:47:49] [INFO ] [Real]Absence check using state equation in 2840 ms returned unknown
[2022-05-22 09:47:51] [INFO ] [Real]Absence check using 261 positive place invariants in 736 ms returned sat
[2022-05-22 09:47:52] [INFO ] [Real]Absence check using 261 positive and 100 generalized place invariants in 195 ms returned sat
[2022-05-22 09:47:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-22 09:47:54] [INFO ] [Real]Absence check using state equation in 2689 ms returned unknown
[2022-05-22 09:47:56] [INFO ] [Real]Absence check using 261 positive place invariants in 797 ms returned sat
[2022-05-22 09:47:56] [INFO ] [Real]Absence check using 261 positive and 100 generalized place invariants in 200 ms returned sat
[2022-05-22 09:47:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-22 09:47:59] [INFO ] [Real]Absence check using state equation in 2833 ms returned unknown
[2022-05-22 09:48:01] [INFO ] [Real]Absence check using 261 positive place invariants in 741 ms returned sat
[2022-05-22 09:48:01] [INFO ] [Real]Absence check using 261 positive and 100 generalized place invariants in 193 ms returned sat
[2022-05-22 09:48:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-22 09:48:04] [INFO ] [Real]Absence check using state equation in 2854 ms returned unknown
[2022-05-22 09:48:06] [INFO ] [Real]Absence check using 261 positive place invariants in 756 ms returned sat
[2022-05-22 09:48:07] [INFO ] [Real]Absence check using 261 positive and 100 generalized place invariants in 204 ms returned sat
[2022-05-22 09:48:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-22 09:48:09] [INFO ] [Real]Absence check using state equation in 2789 ms returned unknown
[2022-05-22 09:48:11] [INFO ] [Real]Absence check using 261 positive place invariants in 685 ms returned sat
[2022-05-22 09:48:11] [INFO ] [Real]Absence check using 261 positive and 100 generalized place invariants in 175 ms returned sat
[2022-05-22 09:48:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-22 09:48:14] [INFO ] [Real]Absence check using state equation in 2961 ms returned unknown
[2022-05-22 09:48:16] [INFO ] [Real]Absence check using 261 positive place invariants in 717 ms returned sat
[2022-05-22 09:48:16] [INFO ] [Real]Absence check using 261 positive and 100 generalized place invariants in 183 ms returned sat
[2022-05-22 09:48:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-22 09:48:19] [INFO ] [Real]Absence check using state equation in 2918 ms returned unknown
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Support contains 11 out of 16561 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 16561/16561 places, 32200/32200 transitions.
Drop transitions removed 15989 transitions
Trivial Post-agglo rules discarded 15989 transitions
Performed 15989 trivial Post agglomeration. Transition count delta: 15989
Iterating post reduction 0 with 15989 rules applied. Total rules applied 15989 place count 16561 transition count 16211
Reduce places removed 16139 places and 0 transitions.
Ensure Unique test removed 14900 transitions
Reduce isomorphic transitions removed 14900 transitions.
Iterating post reduction 1 with 31039 rules applied. Total rules applied 47028 place count 422 transition count 1311
Drop transitions removed 989 transitions
Redundant transition composition rules discarded 989 transitions
Iterating global reduction 2 with 989 rules applied. Total rules applied 48017 place count 422 transition count 322
Discarding 89 places :
Implicit places reduction removed 89 places
Drop transitions removed 178 transitions
Trivial Post-agglo rules discarded 178 transitions
Performed 178 trivial Post agglomeration. Transition count delta: 178
Iterating post reduction 2 with 267 rules applied. Total rules applied 48284 place count 333 transition count 144
Reduce places removed 267 places and 0 transitions.
Drop transitions removed 89 transitions
Reduce isomorphic transitions removed 89 transitions.
Iterating post reduction 3 with 356 rules applied. Total rules applied 48640 place count 66 transition count 55
Partial Free-agglomeration rule applied 11 times.
Drop transitions removed 11 transitions
Iterating global reduction 4 with 11 rules applied. Total rules applied 48651 place count 66 transition count 55
Applied a total of 48651 rules in 352 ms. Remains 66 /16561 variables (removed 16495) and now considering 55/32200 (removed 32145) transitions.
Finished structural reductions, in 1 iterations. Remains : 66/16561 places, 55/32200 transitions.
// Phase 1: matrix 55 rows 66 cols
[2022-05-22 09:48:20] [INFO ] Computed 33 place invariants in 0 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1165 ms. (steps per millisecond=858 ) properties (out of 11) seen :11
FORMULA ServersAndClients-PT-100160-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ServersAndClients-PT-100160-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ServersAndClients-PT-100160-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ServersAndClients-PT-100160-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ServersAndClients-PT-100160-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ServersAndClients-PT-100160-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ServersAndClients-PT-100160-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ServersAndClients-PT-100160-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ServersAndClients-PT-100160-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ServersAndClients-PT-100160-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ServersAndClients-PT-100160-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.

BK_STOP 1653212901541

--------------------
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="ServersAndClients-PT-100160"
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 ServersAndClients-PT-100160, 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 r215-oct2-165281605900181"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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