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.r305-smll-165463878400052.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 StigmergyCommit-PT-05a, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r305-smll-165463878400052
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 4.9K May 30 15:04 CTLCardinality.txt
-rw-r--r-- 1 mcc users 45K May 30 15:04 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K May 30 15:01 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K May 30 15:01 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 25 13:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 25 13:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 25 13:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 25 13:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 29 12:20 NewModel
-rw-r--r-- 1 mcc users 14K May 30 15:06 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 151K May 30 15:06 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.6K May 30 15:05 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 63K May 30 15:05 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 25 13:01 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 25 13:01 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 12:20 equiv_col
-rw-r--r-- 1 mcc users 4 May 29 12:20 instance
-rw-r--r-- 1 mcc users 6 May 29 12:20 iscolored
-rw-r--r-- 1 mcc users 613K May 29 12:20 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 StigmergyCommit-PT-05a-UpperBounds-00
FORMULA_NAME StigmergyCommit-PT-05a-UpperBounds-01
FORMULA_NAME StigmergyCommit-PT-05a-UpperBounds-02
FORMULA_NAME StigmergyCommit-PT-05a-UpperBounds-03
FORMULA_NAME StigmergyCommit-PT-05a-UpperBounds-04
FORMULA_NAME StigmergyCommit-PT-05a-UpperBounds-05
FORMULA_NAME StigmergyCommit-PT-05a-UpperBounds-06
FORMULA_NAME StigmergyCommit-PT-05a-UpperBounds-07
FORMULA_NAME StigmergyCommit-PT-05a-UpperBounds-08
FORMULA_NAME StigmergyCommit-PT-05a-UpperBounds-09
FORMULA_NAME StigmergyCommit-PT-05a-UpperBounds-10
FORMULA_NAME StigmergyCommit-PT-05a-UpperBounds-11
FORMULA_NAME StigmergyCommit-PT-05a-UpperBounds-12
FORMULA_NAME StigmergyCommit-PT-05a-UpperBounds-13
FORMULA_NAME StigmergyCommit-PT-05a-UpperBounds-14
FORMULA_NAME StigmergyCommit-PT-05a-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1654719487992

Running Version 0
[2022-06-08 20:18:11] [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-06-08 20:18:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-08 20:18:11] [INFO ] Load time of PNML (sax parser for PT used): 371 ms
[2022-06-08 20:18:11] [INFO ] Transformed 220 places.
[2022-06-08 20:18:11] [INFO ] Transformed 1212 transitions.
[2022-06-08 20:18:11] [INFO ] Found NUPN structural information;
[2022-06-08 20:18:11] [INFO ] Parsed PT model containing 220 places and 1212 transitions in 490 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 14 ms.
Ensure Unique test removed 800 transitions
Reduce redundant transitions removed 800 transitions.
Normalized transition count is 394 out of 412 initially.
// Phase 1: matrix 394 rows 220 cols
[2022-06-08 20:18:11] [INFO ] Computed 7 place invariants in 39 ms
Incomplete random walk after 10000 steps, including 7 resets, run finished after 163 ms. (steps per millisecond=61 ) properties (out of 16) seen :12
FORMULA StigmergyCommit-PT-05a-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-05a-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-05a-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-05a-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-05a-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-05a-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-05a-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-05a-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-05a-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-05a-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-05a-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-05a-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 4) seen :1
FORMULA StigmergyCommit-PT-05a-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2022-06-08 20:18:12] [INFO ] Flow matrix only has 394 transitions (discarded 18 similar events)
// Phase 1: matrix 394 rows 220 cols
[2022-06-08 20:18:12] [INFO ] Computed 7 place invariants in 15 ms
[2022-06-08 20:18:12] [INFO ] [Real]Absence check using 7 positive place invariants in 18 ms returned sat
[2022-06-08 20:18:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 20:18:12] [INFO ] [Real]Absence check using state equation in 233 ms returned sat
[2022-06-08 20:18:12] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 20:18:12] [INFO ] [Nat]Absence check using 7 positive place invariants in 10 ms returned sat
[2022-06-08 20:18:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 20:18:13] [INFO ] [Nat]Absence check using state equation in 145 ms returned sat
[2022-06-08 20:18:13] [INFO ] State equation strengthened by 209 read => feed constraints.
[2022-06-08 20:18:13] [INFO ] [Nat]Added 209 Read/Feed constraints in 59 ms returned sat
[2022-06-08 20:18:13] [INFO ] Deduced a trap composed of 18 places in 223 ms of which 6 ms to minimize.
[2022-06-08 20:18:13] [INFO ] Deduced a trap composed of 16 places in 215 ms of which 2 ms to minimize.
[2022-06-08 20:18:13] [INFO ] Deduced a trap composed of 16 places in 140 ms of which 2 ms to minimize.
[2022-06-08 20:18:13] [INFO ] Deduced a trap composed of 16 places in 106 ms of which 3 ms to minimize.
[2022-06-08 20:18:14] [INFO ] Deduced a trap composed of 16 places in 77 ms of which 0 ms to minimize.
[2022-06-08 20:18:14] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 1 ms to minimize.
[2022-06-08 20:18:14] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 1 ms to minimize.
[2022-06-08 20:18:14] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1098 ms
[2022-06-08 20:18:14] [INFO ] Computed and/alt/rep : 248/314/248 causal constraints (skipped 145 transitions) in 65 ms.
[2022-06-08 20:18:15] [INFO ] Added : 242 causal constraints over 49 iterations in 1667 ms. Result :sat
Minimization took 93 ms.
[2022-06-08 20:18:16] [INFO ] [Real]Absence check using 7 positive place invariants in 8 ms returned sat
[2022-06-08 20:18:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 20:18:16] [INFO ] [Real]Absence check using state equation in 153 ms returned sat
[2022-06-08 20:18:16] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 20:18:16] [INFO ] [Nat]Absence check using 7 positive place invariants in 11 ms returned sat
[2022-06-08 20:18:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 20:18:16] [INFO ] [Nat]Absence check using state equation in 162 ms returned sat
[2022-06-08 20:18:16] [INFO ] [Nat]Added 209 Read/Feed constraints in 63 ms returned sat
[2022-06-08 20:18:16] [INFO ] Deduced a trap composed of 17 places in 144 ms of which 2 ms to minimize.
[2022-06-08 20:18:16] [INFO ] Deduced a trap composed of 16 places in 122 ms of which 1 ms to minimize.
[2022-06-08 20:18:17] [INFO ] Deduced a trap composed of 18 places in 101 ms of which 1 ms to minimize.
[2022-06-08 20:18:17] [INFO ] Deduced a trap composed of 16 places in 77 ms of which 1 ms to minimize.
[2022-06-08 20:18:17] [INFO ] Deduced a trap composed of 16 places in 84 ms of which 1 ms to minimize.
[2022-06-08 20:18:17] [INFO ] Deduced a trap composed of 17 places in 78 ms of which 1 ms to minimize.
[2022-06-08 20:18:17] [INFO ] Deduced a trap composed of 16 places in 65 ms of which 1 ms to minimize.
[2022-06-08 20:18:17] [INFO ] Deduced a trap composed of 16 places in 57 ms of which 0 ms to minimize.
[2022-06-08 20:18:17] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1002 ms
[2022-06-08 20:18:17] [INFO ] Computed and/alt/rep : 248/314/248 causal constraints (skipped 145 transitions) in 60 ms.
[2022-06-08 20:18:19] [INFO ] Added : 242 causal constraints over 49 iterations in 2032 ms. Result :sat
Minimization took 168 ms.
[2022-06-08 20:18:19] [INFO ] [Real]Absence check using 7 positive place invariants in 11 ms returned sat
[2022-06-08 20:18:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 20:18:20] [INFO ] [Real]Absence check using state equation in 166 ms returned sat
[2022-06-08 20:18:20] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 20:18:20] [INFO ] [Nat]Absence check using 7 positive place invariants in 8 ms returned sat
[2022-06-08 20:18:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 20:18:20] [INFO ] [Nat]Absence check using state equation in 128 ms returned sat
[2022-06-08 20:18:20] [INFO ] [Nat]Added 209 Read/Feed constraints in 40 ms returned sat
[2022-06-08 20:18:20] [INFO ] Deduced a trap composed of 17 places in 141 ms of which 1 ms to minimize.
[2022-06-08 20:18:20] [INFO ] Deduced a trap composed of 16 places in 112 ms of which 1 ms to minimize.
[2022-06-08 20:18:20] [INFO ] Deduced a trap composed of 16 places in 89 ms of which 1 ms to minimize.
[2022-06-08 20:18:20] [INFO ] Deduced a trap composed of 16 places in 104 ms of which 0 ms to minimize.
[2022-06-08 20:18:20] [INFO ] Deduced a trap composed of 16 places in 75 ms of which 0 ms to minimize.
[2022-06-08 20:18:21] [INFO ] Deduced a trap composed of 17 places in 72 ms of which 1 ms to minimize.
[2022-06-08 20:18:21] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 2 ms to minimize.
[2022-06-08 20:18:21] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 1 ms to minimize.
[2022-06-08 20:18:21] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 865 ms
[2022-06-08 20:18:21] [INFO ] Computed and/alt/rep : 248/314/248 causal constraints (skipped 145 transitions) in 29 ms.
[2022-06-08 20:18:22] [INFO ] Added : 242 causal constraints over 49 iterations in 1353 ms. Result :sat
Minimization took 115 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1] Max seen :[0, 0, 0]
Incomplete Parikh walk after 137100 steps, including 1000 resets, run finished after 991 ms. (steps per millisecond=138 ) properties (out of 3) seen :3 could not realise parikh vector
FORMULA StigmergyCommit-PT-05a-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA StigmergyCommit-PT-05a-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA StigmergyCommit-PT-05a-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
All properties solved without resorting to model-checking.

BK_STOP 1654719504756

--------------------
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="StigmergyCommit-PT-05a"
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 StigmergyCommit-PT-05a, 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 r305-smll-165463878400052"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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