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.r031-oct2-167813615400078.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 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 AutonomousCar-PT-06b, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r031-oct2-167813615400078
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 684K
-rw-r--r-- 1 mcc users 7.2K Feb 25 12:52 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K Feb 25 12:52 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Feb 25 12:51 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Feb 25 12:51 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:34 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 15:34 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 15:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:34 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 12:52 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 118K Feb 25 12:52 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K Feb 25 12:52 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 84K Feb 25 12:52 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:34 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:34 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 228K Mar 5 18:22 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-06b-UpperBounds-00
FORMULA_NAME AutonomousCar-PT-06b-UpperBounds-01
FORMULA_NAME AutonomousCar-PT-06b-UpperBounds-02
FORMULA_NAME AutonomousCar-PT-06b-UpperBounds-03
FORMULA_NAME AutonomousCar-PT-06b-UpperBounds-04
FORMULA_NAME AutonomousCar-PT-06b-UpperBounds-05
FORMULA_NAME AutonomousCar-PT-06b-UpperBounds-06
FORMULA_NAME AutonomousCar-PT-06b-UpperBounds-07
FORMULA_NAME AutonomousCar-PT-06b-UpperBounds-08
FORMULA_NAME AutonomousCar-PT-06b-UpperBounds-09
FORMULA_NAME AutonomousCar-PT-06b-UpperBounds-10
FORMULA_NAME AutonomousCar-PT-06b-UpperBounds-11
FORMULA_NAME AutonomousCar-PT-06b-UpperBounds-12
FORMULA_NAME AutonomousCar-PT-06b-UpperBounds-13
FORMULA_NAME AutonomousCar-PT-06b-UpperBounds-14
FORMULA_NAME AutonomousCar-PT-06b-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678867091762

Running Version 202205111006
[2023-03-15 07:58:13] [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-15 07:58:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-15 07:58:13] [INFO ] Load time of PNML (sax parser for PT used): 176 ms
[2023-03-15 07:58:14] [INFO ] Transformed 289 places.
[2023-03-15 07:58:14] [INFO ] Transformed 644 transitions.
[2023-03-15 07:58:14] [INFO ] Found NUPN structural information;
[2023-03-15 07:58:14] [INFO ] Parsed PT model containing 289 places and 644 transitions in 337 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 9 ms.
// Phase 1: matrix 644 rows 289 cols
[2023-03-15 07:58:14] [INFO ] Computed 11 place invariants in 18 ms
Incomplete random walk after 10000 steps, including 62 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 16) seen :14
FORMULA AutonomousCar-PT-06b-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-06b-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-06b-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-06b-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-06b-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-06b-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-06b-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-06b-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-06b-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-06b-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-06b-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-06b-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-06b-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-06b-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 11 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 2) seen :1
FORMULA AutonomousCar-PT-06b-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
// Phase 1: matrix 644 rows 289 cols
[2023-03-15 07:58:14] [INFO ] Computed 11 place invariants in 7 ms
[2023-03-15 07:58:14] [INFO ] [Real]Absence check using 11 positive place invariants in 10 ms returned sat
[2023-03-15 07:58:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 07:58:14] [INFO ] [Real]Absence check using state equation in 278 ms returned sat
[2023-03-15 07:58:14] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 07:58:14] [INFO ] [Nat]Absence check using 11 positive place invariants in 7 ms returned sat
[2023-03-15 07:58:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 07:58:15] [INFO ] [Nat]Absence check using state equation in 206 ms returned sat
[2023-03-15 07:58:15] [INFO ] Deduced a trap composed of 11 places in 225 ms of which 5 ms to minimize.
[2023-03-15 07:58:15] [INFO ] Deduced a trap composed of 17 places in 204 ms of which 2 ms to minimize.
[2023-03-15 07:58:15] [INFO ] Deduced a trap composed of 13 places in 151 ms of which 1 ms to minimize.
[2023-03-15 07:58:15] [INFO ] Deduced a trap composed of 21 places in 176 ms of which 3 ms to minimize.
[2023-03-15 07:58:16] [INFO ] Deduced a trap composed of 35 places in 196 ms of which 1 ms to minimize.
[2023-03-15 07:58:16] [INFO ] Deduced a trap composed of 35 places in 160 ms of which 1 ms to minimize.
[2023-03-15 07:58:16] [INFO ] Deduced a trap composed of 45 places in 170 ms of which 1 ms to minimize.
[2023-03-15 07:58:16] [INFO ] Deduced a trap composed of 30 places in 280 ms of which 1 ms to minimize.
[2023-03-15 07:58:17] [INFO ] Deduced a trap composed of 35 places in 214 ms of which 1 ms to minimize.
[2023-03-15 07:58:17] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 2009 ms
[2023-03-15 07:58:17] [INFO ] Computed and/alt/rep : 237/274/237 causal constraints (skipped 406 transitions) in 115 ms.
[2023-03-15 07:58:18] [INFO ] Added : 96 causal constraints over 20 iterations in 1043 ms. Result :sat
Minimization took 108 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 289 places. Attempting structural reductions.
Drop transitions removed 1 transitions
Starting structural reductions in SAFETY mode, iteration 0 : 289/289 places, 643/643 transitions.
Graph (trivial) has 275 edges and 289 vertex of which 4 / 289 are part of one of the 2 SCC in 4 ms
Free SCC test removed 2 places
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 957 edges and 287 vertex of which 280 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.6 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 127 transitions
Trivial Post-agglo rules discarded 127 transitions
Performed 127 trivial Post agglomeration. Transition count delta: 127
Iterating post reduction 0 with 130 rules applied. Total rules applied 132 place count 279 transition count 504
Reduce places removed 127 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Drop transitions removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 1 with 164 rules applied. Total rules applied 296 place count 152 transition count 467
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 2 with 21 rules applied. Total rules applied 317 place count 131 transition count 467
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 317 place count 131 transition count 462
Deduced a syphon composed of 5 places in 2 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 327 place count 126 transition count 462
Discarding 25 places :
Symmetric choice reduction at 3 with 25 rule applications. Total rules 352 place count 101 transition count 437
Iterating global reduction 3 with 25 rules applied. Total rules applied 377 place count 101 transition count 437
Ensure Unique test removed 144 transitions
Reduce isomorphic transitions removed 144 transitions.
Iterating post reduction 3 with 144 rules applied. Total rules applied 521 place count 101 transition count 293
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 521 place count 101 transition count 291
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 525 place count 99 transition count 291
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 532 place count 92 transition count 254
Iterating global reduction 4 with 7 rules applied. Total rules applied 539 place count 92 transition count 254
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 4 with 12 rules applied. Total rules applied 551 place count 92 transition count 242
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 557 place count 86 transition count 242
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 6 with 62 rules applied. Total rules applied 619 place count 55 transition count 211
Discarding 6 places :
Symmetric choice reduction at 6 with 6 rule applications. Total rules 625 place count 49 transition count 169
Iterating global reduction 6 with 6 rules applied. Total rules applied 631 place count 49 transition count 169
Free-agglomeration rule applied 6 times.
Iterating global reduction 6 with 6 rules applied. Total rules applied 637 place count 49 transition count 163
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 643 place count 43 transition count 163
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 644 place count 43 transition count 163
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 645 place count 42 transition count 162
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 646 place count 41 transition count 162
Applied a total of 646 rules in 165 ms. Remains 41 /289 variables (removed 248) and now considering 162/643 (removed 481) transitions.
Finished structural reductions, in 1 iterations. Remains : 41/289 places, 162/643 transitions.
// Phase 1: matrix 162 rows 41 cols
[2023-03-15 07:58:18] [INFO ] Computed 10 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 8465 resets, run finished after 2237 ms. (steps per millisecond=447 ) properties (out of 1) seen :1
FORMULA AutonomousCar-PT-06b-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 7254 ms.

BK_STOP 1678867100945

--------------------
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="AutonomousCar-PT-06b"
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 AutonomousCar-PT-06b, 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 r031-oct2-167813615400078"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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