Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2021-input.r140-tall-162089127900427.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
..................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
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 r140-tall-162089127900427
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 484K
-rw-r--r-- 1 mcc users 12K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 119K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 12K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 109K May 10 09:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.1K Mar 28 16:24 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Mar 28 16:24 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.8K Mar 28 16:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 14K Mar 28 16:24 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Mar 27 06:37 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 27 06:37 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 25 07:58 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 25 07:58 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 22 09:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 22 09:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 4 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 107K May 5 16:51 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 1620980462146

Running Version 0
[2021-05-14 08:21:03] [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]
[2021-05-14 08:21:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-14 08:21:03] [INFO ] Load time of PNML (sax parser for PT used): 70 ms
[2021-05-14 08:21:03] [INFO ] Transformed 305 places.
[2021-05-14 08:21:03] [INFO ] Transformed 433 transitions.
[2021-05-14 08:21:03] [INFO ] Found NUPN structural information;
[2021-05-14 08:21:03] [INFO ] Parsed PT model containing 305 places and 433 transitions in 111 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
Ensure Unique test removed 176 transitions
Reduce redundant transitions removed 176 transitions.
// Phase 1: matrix 257 rows 305 cols
[2021-05-14 08:21:03] [INFO ] Computed 76 place invariants in 23 ms
Incomplete random walk after 10000 steps, including 128 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 16) seen :14
FORMULA Parking-PT-416-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
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-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Parking-PT-416-UpperBounds-08 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-04 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 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 2) seen :0
// Phase 1: matrix 257 rows 305 cols
[2021-05-14 08:21:03] [INFO ] Computed 76 place invariants in 4 ms
[2021-05-14 08:21:04] [INFO ] [Real]Absence check using 72 positive place invariants in 18 ms returned sat
[2021-05-14 08:21:04] [INFO ] [Real]Absence check using 72 positive and 4 generalized place invariants in 3 ms returned sat
[2021-05-14 08:21:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 08:21:04] [INFO ] [Real]Absence check using state equation in 74 ms returned sat
[2021-05-14 08:21:04] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 08:21:04] [INFO ] [Nat]Absence check using 72 positive place invariants in 14 ms returned sat
[2021-05-14 08:21:04] [INFO ] [Nat]Absence check using 72 positive and 4 generalized place invariants in 0 ms returned sat
[2021-05-14 08:21:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 08:21:04] [INFO ] [Nat]Absence check using state equation in 79 ms returned sat
[2021-05-14 08:21:04] [INFO ] State equation strengthened by 60 read => feed constraints.
[2021-05-14 08:21:04] [INFO ] [Nat]Added 60 Read/Feed constraints in 7 ms returned sat
[2021-05-14 08:21:04] [INFO ] Computed and/alt/rep : 256/848/256 causal constraints (skipped 0 transitions) in 28 ms.
[2021-05-14 08:21:05] [INFO ] Deduced a trap composed of 39 places in 52 ms of which 7 ms to minimize.
[2021-05-14 08:21:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 87 ms
[2021-05-14 08:21:05] [INFO ] Added : 189 causal constraints over 38 iterations in 876 ms. Result :sat
Minimization took 75 ms.
[2021-05-14 08:21:05] [INFO ] [Real]Absence check using 72 positive place invariants in 18 ms returned sat
[2021-05-14 08:21:05] [INFO ] [Real]Absence check using 72 positive and 4 generalized place invariants in 1 ms returned sat
[2021-05-14 08:21:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 08:21:05] [INFO ] [Real]Absence check using state equation in 79 ms returned sat
[2021-05-14 08:21:05] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 08:21:05] [INFO ] [Nat]Absence check using 72 positive place invariants in 22 ms returned sat
[2021-05-14 08:21:05] [INFO ] [Nat]Absence check using 72 positive and 4 generalized place invariants in 1 ms returned sat
[2021-05-14 08:21:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 08:21:05] [INFO ] [Nat]Absence check using state equation in 68 ms returned sat
[2021-05-14 08:21:05] [INFO ] [Nat]Added 60 Read/Feed constraints in 6 ms returned sat
[2021-05-14 08:21:05] [INFO ] Computed and/alt/rep : 256/848/256 causal constraints (skipped 0 transitions) in 18 ms.
[2021-05-14 08:21:06] [INFO ] Deduced a trap composed of 36 places in 23 ms of which 1 ms to minimize.
[2021-05-14 08:21:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 63 ms
[2021-05-14 08:21:06] [INFO ] Added : 191 causal constraints over 39 iterations in 793 ms. Result :sat
Minimization took 86 ms.
Current structural bounds on expressions (after SMT) : [1, 1] Max seen :[0, 0]
Incomplete Parikh walk after 4700 steps, including 119 resets, run finished after 29 ms. (steps per millisecond=162 ) properties (out of 2) seen :0 could not realise parikh vector
Incomplete Parikh walk after 3900 steps, including 117 resets, run finished after 23 ms. (steps per millisecond=169 ) properties (out of 2) seen :0 could not realise parikh vector
Support contains 2 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 1 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.1 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 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 4 with 70 rules applied. Total rules applied 240 place count 88 transition count 46
Reduce places removed 42 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 54 rules applied. Total rules applied 294 place count 46 transition count 34
Reduce places removed 8 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 6 with 9 rules applied. Total rules applied 303 place count 38 transition count 33
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 304 place count 37 transition count 33
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 10 Pre rules applied. Total rules applied 304 place count 37 transition count 23
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 324 place count 27 transition count 23
Applied a total of 324 rules in 98 ms. Remains 27 /305 variables (removed 278) and now considering 23/257 (removed 234) transitions.
Finished structural reductions, in 1 iterations. Remains : 27/305 places, 23/257 transitions.
// Phase 1: matrix 23 rows 27 cols
[2021-05-14 08:21:06] [INFO ] Computed 14 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1974 ms. (steps per millisecond=506 ) properties (out of 2) seen :2
FORMULA Parking-PT-416-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Parking-PT-416-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.

BK_STOP 1620980469816

--------------------
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="itstools"
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 itstools"
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 r140-tall-162089127900427"
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 ;