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.r161-smll-165277002800118.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 Parking-PT-416, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r161-smll-165277002800118
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 316K
-rw-r--r-- 1 mcc users 5.8K Apr 30 06:02 CTLCardinality.txt
-rw-r--r-- 1 mcc users 58K Apr 30 06:02 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Apr 30 05:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Apr 30 05:56 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.6K May 9 08:23 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 9 08:23 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 9 08:23 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 08:23 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 08:23 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 9 08:23 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 4 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 107K 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 Parking-PT-416-UpperBounds-00
FORMULA_NAME Parking-PT-416-UpperBounds-01
FORMULA_NAME Parking-PT-416-UpperBounds-02
FORMULA_NAME Parking-PT-416-UpperBounds-03
FORMULA_NAME Parking-PT-416-UpperBounds-04
FORMULA_NAME Parking-PT-416-UpperBounds-05
FORMULA_NAME Parking-PT-416-UpperBounds-06
FORMULA_NAME Parking-PT-416-UpperBounds-07
FORMULA_NAME Parking-PT-416-UpperBounds-08
FORMULA_NAME Parking-PT-416-UpperBounds-09
FORMULA_NAME Parking-PT-416-UpperBounds-10
FORMULA_NAME Parking-PT-416-UpperBounds-11
FORMULA_NAME Parking-PT-416-UpperBounds-12
FORMULA_NAME Parking-PT-416-UpperBounds-13
FORMULA_NAME Parking-PT-416-UpperBounds-14
FORMULA_NAME Parking-PT-416-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1652990324307

Running Version 0
[2022-05-19 19:58:47] [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-19 19:58:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-19 19:58:47] [INFO ] Load time of PNML (sax parser for PT used): 137 ms
[2022-05-19 19:58:47] [INFO ] Transformed 305 places.
[2022-05-19 19:58:47] [INFO ] Transformed 433 transitions.
[2022-05-19 19:58:47] [INFO ] Found NUPN structural information;
[2022-05-19 19:58:47] [INFO ] Parsed PT model containing 305 places and 433 transitions in 207 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 11 ms.
Ensure Unique test removed 176 transitions
Reduce redundant transitions removed 176 transitions.
// Phase 1: matrix 257 rows 305 cols
[2022-05-19 19:58:47] [INFO ] Computed 76 place invariants in 35 ms
Incomplete random walk after 10000 steps, including 126 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 16) seen :13
FORMULA Parking-PT-416-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Parking-PT-416-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Parking-PT-416-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Parking-PT-416-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Parking-PT-416-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Parking-PT-416-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Parking-PT-416-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Parking-PT-416-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Parking-PT-416-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Parking-PT-416-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Parking-PT-416-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Parking-PT-416-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Parking-PT-416-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 3) seen :0
// Phase 1: matrix 257 rows 305 cols
[2022-05-19 19:58:48] [INFO ] Computed 76 place invariants in 10 ms
[2022-05-19 19:58:48] [INFO ] [Real]Absence check using 72 positive place invariants in 43 ms returned sat
[2022-05-19 19:58:48] [INFO ] [Real]Absence check using 72 positive and 4 generalized place invariants in 3 ms returned sat
[2022-05-19 19:58:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 19:58:48] [INFO ] [Real]Absence check using state equation in 213 ms returned sat
[2022-05-19 19:58:48] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 19:58:49] [INFO ] [Nat]Absence check using 72 positive place invariants in 40 ms returned sat
[2022-05-19 19:58:49] [INFO ] [Nat]Absence check using 72 positive and 4 generalized place invariants in 3 ms returned sat
[2022-05-19 19:58:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 19:58:49] [INFO ] [Nat]Absence check using state equation in 199 ms returned sat
[2022-05-19 19:58:49] [INFO ] State equation strengthened by 60 read => feed constraints.
[2022-05-19 19:58:49] [INFO ] [Nat]Added 60 Read/Feed constraints in 17 ms returned sat
[2022-05-19 19:58:49] [INFO ] Computed and/alt/rep : 256/848/256 causal constraints (skipped 0 transitions) in 53 ms.
[2022-05-19 19:58:50] [INFO ] Added : 168 causal constraints over 34 iterations in 1432 ms. Result :sat
Minimization took 106 ms.
[2022-05-19 19:58:51] [INFO ] [Real]Absence check using 72 positive place invariants in 51 ms returned sat
[2022-05-19 19:58:51] [INFO ] [Real]Absence check using 72 positive and 4 generalized place invariants in 3 ms returned sat
[2022-05-19 19:58:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 19:58:51] [INFO ] [Real]Absence check using state equation in 183 ms returned sat
[2022-05-19 19:58:51] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 19:58:51] [INFO ] [Nat]Absence check using 72 positive place invariants in 39 ms returned sat
[2022-05-19 19:58:51] [INFO ] [Nat]Absence check using 72 positive and 4 generalized place invariants in 2 ms returned sat
[2022-05-19 19:58:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 19:58:51] [INFO ] [Nat]Absence check using state equation in 153 ms returned sat
[2022-05-19 19:58:51] [INFO ] [Nat]Added 60 Read/Feed constraints in 22 ms returned sat
[2022-05-19 19:58:51] [INFO ] Computed and/alt/rep : 256/848/256 causal constraints (skipped 0 transitions) in 32 ms.
[2022-05-19 19:58:53] [INFO ] Added : 186 causal constraints over 38 iterations in 1449 ms. Result :sat
Minimization took 191 ms.
[2022-05-19 19:58:53] [INFO ] [Real]Absence check using 72 positive place invariants in 37 ms returned sat
[2022-05-19 19:58:53] [INFO ] [Real]Absence check using 72 positive and 4 generalized place invariants in 6 ms returned sat
[2022-05-19 19:58:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 19:58:53] [INFO ] [Real]Absence check using state equation in 194 ms returned sat
[2022-05-19 19:58:53] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 19:58:53] [INFO ] [Nat]Absence check using 72 positive place invariants in 38 ms returned sat
[2022-05-19 19:58:53] [INFO ] [Nat]Absence check using 72 positive and 4 generalized place invariants in 3 ms returned sat
[2022-05-19 19:58:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 19:58:54] [INFO ] [Nat]Absence check using state equation in 187 ms returned sat
[2022-05-19 19:58:54] [INFO ] [Nat]Added 60 Read/Feed constraints in 14 ms returned sat
[2022-05-19 19:58:54] [INFO ] Computed and/alt/rep : 256/848/256 causal constraints (skipped 0 transitions) in 34 ms.
[2022-05-19 19:58:55] [INFO ] Deduced a trap composed of 39 places in 73 ms of which 7 ms to minimize.
[2022-05-19 19:58:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 157 ms
[2022-05-19 19:58:55] [INFO ] Added : 172 causal constraints over 35 iterations in 1683 ms. Result :sat
Minimization took 168 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1] Max seen :[0, 0, 0]
Incomplete Parikh walk after 5900 steps, including 147 resets, run finished after 52 ms. (steps per millisecond=113 ) properties (out of 3) seen :0 could not realise parikh vector
Incomplete Parikh walk after 4900 steps, including 124 resets, run finished after 42 ms. (steps per millisecond=116 ) properties (out of 3) seen :0 could not realise parikh vector
Incomplete Parikh walk after 5300 steps, including 119 resets, run finished after 46 ms. (steps per millisecond=115 ) properties (out of 3) seen :0 could not realise parikh vector
Support contains 3 out of 305 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 305/305 places, 257/257 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 305 transition count 249
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 297 transition count 249
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 16 place count 297 transition count 241
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 32 place count 289 transition count 241
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 36 place count 285 transition count 237
Iterating global reduction 2 with 4 rules applied. Total rules applied 40 place count 285 transition count 237
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 2 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 64 place count 273 transition count 225
Free-agglomeration rule applied 48 times.
Iterating global reduction 2 with 48 rules applied. Total rules applied 112 place count 273 transition count 177
Reduce places removed 48 places and 0 transitions.
Graph (complete) has 472 edges and 225 vertex of which 117 are kept as prefixes of interest. Removing 108 places using SCC suffix rule.4 ms
Discarding 108 places :
Also discarding 80 output transitions
Drop transitions removed 80 transitions
Iterating post reduction 2 with 49 rules applied. Total rules applied 161 place count 117 transition count 97
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 169 place count 117 transition count 89
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 170 place count 116 transition count 88
Reduce places removed 28 places and 0 transitions.
Drop transitions removed 38 transitions
Trivial Post-agglo rules discarded 38 transitions
Performed 38 trivial Post agglomeration. Transition count delta: 38
Iterating post reduction 4 with 66 rules applied. Total rules applied 236 place count 88 transition count 50
Reduce places removed 38 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 5 with 50 rules applied. Total rules applied 286 place count 50 transition count 38
Reduce places removed 8 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 6 with 10 rules applied. Total rules applied 296 place count 42 transition count 36
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 298 place count 40 transition count 36
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 10 Pre rules applied. Total rules applied 298 place count 40 transition count 26
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 8 with 20 rules applied. Total rules applied 318 place count 30 transition count 26
Applied a total of 318 rules in 221 ms. Remains 30 /305 variables (removed 275) and now considering 26/257 (removed 231) transitions.
Finished structural reductions, in 1 iterations. Remains : 30/305 places, 26/257 transitions.
// Phase 1: matrix 26 rows 30 cols
[2022-05-19 19:58:56] [INFO ] Computed 14 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 2468 ms. (steps per millisecond=405 ) properties (out of 3) seen :3
FORMULA Parking-PT-416-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Parking-PT-416-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Parking-PT-416-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.

BK_STOP 1652990339858

--------------------
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="Parking-PT-416"
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 Parking-PT-416, 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 r161-smll-165277002800118"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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