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-165463878500163.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 AutonomousCar-PT-02b, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r305-smll-165463878500163
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 448K
-rw-r--r-- 1 mcc users 7.2K Jun 7 15:48 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K Jun 7 15:48 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Jun 7 15:48 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Jun 7 15:48 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Jun 3 16:18 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Jun 3 16:18 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Jun 3 16:18 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Jun 3 16:18 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 3 16:02 NewModel
-rw-r--r-- 1 mcc users 9.8K Jun 7 15:48 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 105K Jun 7 15:48 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Jun 7 15:48 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 38K Jun 7 15:48 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Jun 3 16:18 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Jun 3 16:18 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 3 16:02 equiv_col
-rw-r--r-- 1 mcc users 4 Jun 3 16:02 instance
-rw-r--r-- 1 mcc users 6 Jun 3 16:02 iscolored
-rw-r--r-- 1 mcc users 49K Jun 3 16:02 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 AutonomousCar-PT-02b-UpperBounds-00
FORMULA_NAME AutonomousCar-PT-02b-UpperBounds-01
FORMULA_NAME AutonomousCar-PT-02b-UpperBounds-02
FORMULA_NAME AutonomousCar-PT-02b-UpperBounds-03
FORMULA_NAME AutonomousCar-PT-02b-UpperBounds-04
FORMULA_NAME AutonomousCar-PT-02b-UpperBounds-05
FORMULA_NAME AutonomousCar-PT-02b-UpperBounds-06
FORMULA_NAME AutonomousCar-PT-02b-UpperBounds-07
FORMULA_NAME AutonomousCar-PT-02b-UpperBounds-08
FORMULA_NAME AutonomousCar-PT-02b-UpperBounds-09
FORMULA_NAME AutonomousCar-PT-02b-UpperBounds-10
FORMULA_NAME AutonomousCar-PT-02b-UpperBounds-11
FORMULA_NAME AutonomousCar-PT-02b-UpperBounds-12
FORMULA_NAME AutonomousCar-PT-02b-UpperBounds-13
FORMULA_NAME AutonomousCar-PT-02b-UpperBounds-14
FORMULA_NAME AutonomousCar-PT-02b-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1654735729911

Running Version 0
[2022-06-09 00:48:54] [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-09 00:48:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-09 00:48:54] [INFO ] Load time of PNML (sax parser for PT used): 115 ms
[2022-06-09 00:48:54] [INFO ] Transformed 155 places.
[2022-06-09 00:48:54] [INFO ] Transformed 194 transitions.
[2022-06-09 00:48:54] [INFO ] Found NUPN structural information;
[2022-06-09 00:48:54] [INFO ] Parsed PT model containing 155 places and 194 transitions in 209 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 14 ms.
// Phase 1: matrix 194 rows 155 cols
[2022-06-09 00:48:54] [INFO ] Computed 7 place invariants in 21 ms
Incomplete random walk after 10000 steps, including 9 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 16) seen :14
FORMULA AutonomousCar-PT-02b-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-02b-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-02b-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-02b-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-02b-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-02b-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-02b-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-02b-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-02b-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-02b-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-02b-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-02b-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-02b-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-02b-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 4 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 2) seen :0
// Phase 1: matrix 194 rows 155 cols
[2022-06-09 00:48:54] [INFO ] Computed 7 place invariants in 15 ms
[2022-06-09 00:48:55] [INFO ] [Real]Absence check using 7 positive place invariants in 16 ms returned sat
[2022-06-09 00:48:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 00:48:55] [INFO ] [Real]Absence check using state equation in 134 ms returned sat
[2022-06-09 00:48:55] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 00:48:55] [INFO ] [Nat]Absence check using 7 positive place invariants in 10 ms returned sat
[2022-06-09 00:48:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 00:48:55] [INFO ] [Nat]Absence check using state equation in 132 ms returned sat
[2022-06-09 00:48:56] [INFO ] Deduced a trap composed of 7 places in 568 ms of which 5 ms to minimize.
[2022-06-09 00:48:56] [INFO ] Deduced a trap composed of 12 places in 144 ms of which 2 ms to minimize.
[2022-06-09 00:48:56] [INFO ] Deduced a trap composed of 12 places in 113 ms of which 2 ms to minimize.
[2022-06-09 00:48:56] [INFO ] Deduced a trap composed of 35 places in 91 ms of which 3 ms to minimize.
[2022-06-09 00:48:56] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1045 ms
[2022-06-09 00:48:56] [INFO ] Computed and/alt/rep : 151/208/151 causal constraints (skipped 42 transitions) in 36 ms.
[2022-06-09 00:48:57] [INFO ] Deduced a trap composed of 50 places in 107 ms of which 2 ms to minimize.
[2022-06-09 00:48:57] [INFO ] Deduced a trap composed of 47 places in 99 ms of which 1 ms to minimize.
[2022-06-09 00:48:57] [INFO ] Deduced a trap composed of 42 places in 74 ms of which 1 ms to minimize.
[2022-06-09 00:48:57] [INFO ] Deduced a trap composed of 9 places in 139 ms of which 1 ms to minimize.
[2022-06-09 00:48:57] [INFO ] Deduced a trap composed of 38 places in 84 ms of which 1 ms to minimize.
[2022-06-09 00:48:57] [INFO ] Deduced a trap composed of 48 places in 66 ms of which 1 ms to minimize.
[2022-06-09 00:48:57] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 754 ms
[2022-06-09 00:48:57] [INFO ] Added : 104 causal constraints over 21 iterations in 1377 ms. Result :sat
Minimization took 71 ms.
[2022-06-09 00:48:58] [INFO ] [Real]Absence check using 7 positive place invariants in 10 ms returned sat
[2022-06-09 00:48:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 00:48:58] [INFO ] [Real]Absence check using state equation in 118 ms returned sat
[2022-06-09 00:48:58] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 00:48:58] [INFO ] [Nat]Absence check using 7 positive place invariants in 10 ms returned sat
[2022-06-09 00:48:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 00:48:58] [INFO ] [Nat]Absence check using state equation in 116 ms returned sat
[2022-06-09 00:48:58] [INFO ] Deduced a trap composed of 7 places in 93 ms of which 1 ms to minimize.
[2022-06-09 00:48:58] [INFO ] Deduced a trap composed of 30 places in 89 ms of which 1 ms to minimize.
[2022-06-09 00:48:58] [INFO ] Deduced a trap composed of 42 places in 54 ms of which 1 ms to minimize.
[2022-06-09 00:48:58] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 298 ms
[2022-06-09 00:48:58] [INFO ] Computed and/alt/rep : 151/208/151 causal constraints (skipped 42 transitions) in 27 ms.
[2022-06-09 00:48:59] [INFO ] Added : 105 causal constraints over 21 iterations in 563 ms. Result :sat
Minimization took 66 ms.
Current structural bounds on expressions (after SMT) : [1, 1] Max seen :[0, 0]
Incomplete Parikh walk after 23000 steps, including 381 resets, run finished after 79 ms. (steps per millisecond=291 ) properties (out of 2) seen :1 could not realise parikh vector
FORMULA AutonomousCar-PT-02b-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 21000 steps, including 354 resets, run finished after 50 ms. (steps per millisecond=420 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 155 places. Attempting structural reductions.
Drop transitions removed 1 transitions
Starting structural reductions, iteration 0 : 155/155 places, 193/193 transitions.
Graph (trivial) has 146 edges and 155 vertex of which 4 / 155 are part of one of the 2 SCC in 7 ms
Free SCC test removed 2 places
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 307 edges and 153 vertex of which 146 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.3 ms
Discarding 7 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 70 transitions
Trivial Post-agglo rules discarded 70 transitions
Performed 70 trivial Post agglomeration. Transition count delta: 70
Iterating post reduction 0 with 73 rules applied. Total rules applied 75 place count 145 transition count 111
Reduce places removed 70 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 1 with 89 rules applied. Total rules applied 164 place count 75 transition count 92
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 174 place count 65 transition count 92
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 174 place count 65 transition count 87
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 184 place count 60 transition count 87
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 196 place count 48 transition count 75
Iterating global reduction 3 with 12 rules applied. Total rules applied 208 place count 48 transition count 75
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 3 with 16 rules applied. Total rules applied 224 place count 48 transition count 59
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 224 place count 48 transition count 57
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 228 place count 46 transition count 57
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 230 place count 44 transition count 53
Iterating global reduction 4 with 2 rules applied. Total rules applied 232 place count 44 transition count 53
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 4 with 4 rules applied. Total rules applied 236 place count 44 transition count 49
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 238 place count 42 transition count 49
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 6 with 30 rules applied. Total rules applied 268 place count 27 transition count 34
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 270 place count 25 transition count 28
Iterating global reduction 6 with 2 rules applied. Total rules applied 272 place count 25 transition count 28
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 276 place count 23 transition count 34
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 277 place count 23 transition count 34
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 278 place count 22 transition count 33
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 279 place count 21 transition count 33
Applied a total of 279 rules in 114 ms. Remains 21 /155 variables (removed 134) and now considering 33/193 (removed 160) transitions.
Finished structural reductions, in 1 iterations. Remains : 21/155 places, 33/193 transitions.
// Phase 1: matrix 33 rows 21 cols
[2022-06-09 00:48:59] [INFO ] Computed 6 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 111689 resets, run finished after 1382 ms. (steps per millisecond=723 ) properties (out of 1) seen :1
FORMULA AutonomousCar-PT-02b-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.

BK_STOP 1654735744487

--------------------
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="AutonomousCar-PT-02b"
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 AutonomousCar-PT-02b, 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-165463878500163"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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