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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 6.0K Feb 26 11:07 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K Feb 26 11:07 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Feb 26 11:01 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Feb 26 11:01 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:11 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 17:11 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 17:11 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 17:11 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 26 11:11 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 132K Feb 26 11:11 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Feb 26 11:09 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 43K Feb 26 11:09 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 17:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:11 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 613K Mar 5 18:23 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 1679415933669

Running Version 202205111006
[2023-03-21 16:25:35] [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-21 16:25:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-21 16:25:36] [INFO ] Load time of PNML (sax parser for PT used): 320 ms
[2023-03-21 16:25:36] [INFO ] Transformed 220 places.
[2023-03-21 16:25:36] [INFO ] Transformed 1212 transitions.
[2023-03-21 16:25:36] [INFO ] Found NUPN structural information;
[2023-03-21 16:25:36] [INFO ] Parsed PT model containing 220 places and 1212 transitions in 570 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 9 ms.
Ensure Unique test removed 800 transitions
Reduce redundant transitions removed 800 transitions.
FORMULA StigmergyCommit-PT-05a-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Normalized transition count is 394 out of 412 initially.
// Phase 1: matrix 394 rows 220 cols
[2023-03-21 16:25:36] [INFO ] Computed 7 place invariants in 28 ms
Incomplete random walk after 10000 steps, including 7 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 15) seen :11
FORMULA StigmergyCommit-PT-05a-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-05a-UpperBounds-11 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-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-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-05a-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
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 16 ms. (steps per millisecond=625 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 4) seen :1
FORMULA StigmergyCommit-PT-05a-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2023-03-21 16:25:36] [INFO ] Flow matrix only has 394 transitions (discarded 18 similar events)
// Phase 1: matrix 394 rows 220 cols
[2023-03-21 16:25:36] [INFO ] Computed 7 place invariants in 7 ms
[2023-03-21 16:25:37] [INFO ] [Real]Absence check using 7 positive place invariants in 11 ms returned sat
[2023-03-21 16:25:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 16:25:37] [INFO ] [Real]Absence check using state equation in 172 ms returned sat
[2023-03-21 16:25:37] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 16:25:37] [INFO ] [Nat]Absence check using 7 positive place invariants in 12 ms returned sat
[2023-03-21 16:25:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 16:25:37] [INFO ] [Nat]Absence check using state equation in 208 ms returned sat
[2023-03-21 16:25:37] [INFO ] State equation strengthened by 209 read => feed constraints.
[2023-03-21 16:25:38] [INFO ] [Nat]Added 209 Read/Feed constraints in 94 ms returned sat
[2023-03-21 16:25:38] [INFO ] Deduced a trap composed of 19 places in 235 ms of which 9 ms to minimize.
[2023-03-21 16:25:38] [INFO ] Deduced a trap composed of 16 places in 246 ms of which 2 ms to minimize.
[2023-03-21 16:25:38] [INFO ] Deduced a trap composed of 18 places in 126 ms of which 2 ms to minimize.
[2023-03-21 16:25:38] [INFO ] Deduced a trap composed of 18 places in 99 ms of which 0 ms to minimize.
[2023-03-21 16:25:38] [INFO ] Deduced a trap composed of 17 places in 109 ms of which 1 ms to minimize.
[2023-03-21 16:25:39] [INFO ] Deduced a trap composed of 18 places in 77 ms of which 0 ms to minimize.
[2023-03-21 16:25:39] [INFO ] Deduced a trap composed of 16 places in 79 ms of which 1 ms to minimize.
[2023-03-21 16:25:39] [INFO ] Deduced a trap composed of 18 places in 63 ms of which 0 ms to minimize.
[2023-03-21 16:25:39] [INFO ] Deduced a trap composed of 16 places in 79 ms of which 1 ms to minimize.
[2023-03-21 16:25:39] [INFO ] Deduced a trap composed of 18 places in 56 ms of which 1 ms to minimize.
[2023-03-21 16:25:39] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1450 ms
[2023-03-21 16:25:39] [INFO ] Computed and/alt/rep : 248/314/248 causal constraints (skipped 145 transitions) in 72 ms.
[2023-03-21 16:25:39] [INFO ] Added : 45 causal constraints over 9 iterations in 410 ms. Result :sat
Minimization took 67 ms.
[2023-03-21 16:25:40] [INFO ] [Real]Absence check using 7 positive place invariants in 7 ms returned sat
[2023-03-21 16:25:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 16:25:40] [INFO ] [Real]Absence check using state equation in 122 ms returned sat
[2023-03-21 16:25:40] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 16:25:40] [INFO ] [Nat]Absence check using 7 positive place invariants in 8 ms returned sat
[2023-03-21 16:25:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 16:25:40] [INFO ] [Nat]Absence check using state equation in 122 ms returned sat
[2023-03-21 16:25:40] [INFO ] [Nat]Added 209 Read/Feed constraints in 48 ms returned sat
[2023-03-21 16:25:40] [INFO ] Deduced a trap composed of 16 places in 146 ms of which 1 ms to minimize.
[2023-03-21 16:25:40] [INFO ] Deduced a trap composed of 16 places in 113 ms of which 1 ms to minimize.
[2023-03-21 16:25:40] [INFO ] Deduced a trap composed of 17 places in 136 ms of which 1 ms to minimize.
[2023-03-21 16:25:40] [INFO ] Deduced a trap composed of 16 places in 92 ms of which 1 ms to minimize.
[2023-03-21 16:25:41] [INFO ] Deduced a trap composed of 16 places in 100 ms of which 1 ms to minimize.
[2023-03-21 16:25:41] [INFO ] Deduced a trap composed of 16 places in 75 ms of which 1 ms to minimize.
[2023-03-21 16:25:41] [INFO ] Deduced a trap composed of 16 places in 74 ms of which 1 ms to minimize.
[2023-03-21 16:25:41] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 918 ms
[2023-03-21 16:25:41] [INFO ] Computed and/alt/rep : 248/314/248 causal constraints (skipped 145 transitions) in 72 ms.
[2023-03-21 16:25:41] [INFO ] Added : 49 causal constraints over 10 iterations in 401 ms. Result :sat
Minimization took 70 ms.
[2023-03-21 16:25:41] [INFO ] [Real]Absence check using 7 positive place invariants in 7 ms returned sat
[2023-03-21 16:25:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 16:25:42] [INFO ] [Real]Absence check using state equation in 128 ms returned sat
[2023-03-21 16:25:42] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 16:25:42] [INFO ] [Nat]Absence check using 7 positive place invariants in 7 ms returned sat
[2023-03-21 16:25:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 16:25:42] [INFO ] [Nat]Absence check using state equation in 126 ms returned sat
[2023-03-21 16:25:42] [INFO ] [Nat]Added 209 Read/Feed constraints in 47 ms returned sat
[2023-03-21 16:25:42] [INFO ] Deduced a trap composed of 16 places in 159 ms of which 1 ms to minimize.
[2023-03-21 16:25:42] [INFO ] Deduced a trap composed of 16 places in 153 ms of which 1 ms to minimize.
[2023-03-21 16:25:42] [INFO ] Deduced a trap composed of 16 places in 106 ms of which 1 ms to minimize.
[2023-03-21 16:25:42] [INFO ] Deduced a trap composed of 16 places in 82 ms of which 1 ms to minimize.
[2023-03-21 16:25:42] [INFO ] Deduced a trap composed of 16 places in 58 ms of which 1 ms to minimize.
[2023-03-21 16:25:42] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 670 ms
[2023-03-21 16:25:43] [INFO ] Computed and/alt/rep : 248/314/248 causal constraints (skipped 145 transitions) in 35 ms.
[2023-03-21 16:25:43] [INFO ] Added : 46 causal constraints over 10 iterations in 311 ms. Result :sat
Minimization took 60 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1] Max seen :[0, 0, 0]
FORMULA StigmergyCommit-PT-05a-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA StigmergyCommit-PT-05a-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA StigmergyCommit-PT-05a-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
All properties solved without resorting to model-checking.
Total runtime 7542 ms.

BK_STOP 1679415943655

--------------------
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="StigmergyCommit-PT-05a"
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 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 r479-smll-167912664100056"
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 ;