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.r162-smll-165277002900006.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 NeoElection-COL-3, examination is ReachabilityDeadlock
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r162-smll-165277002900006
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 344K
-rw-r--r-- 1 mcc users 11K Apr 30 04:07 CTLCardinality.txt
-rw-r--r-- 1 mcc users 100K Apr 30 04:07 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.5K Apr 30 04:00 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K Apr 30 04:00 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.4K May 9 08:20 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 9 08:20 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K May 9 08:20 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 08:20 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 9 08:20 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 9 08:20 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:34 equiv_pt
-rw-r--r-- 1 mcc users 2 May 10 09:34 instance
-rw-r--r-- 1 mcc users 5 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 75K 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 booleans
BOOL_VECTOR

FORMULA_NAME ReachabilityDeadlock

=== Now, execution of the tool begins

BK_START 1652989105215

Running Version 0
[2022-05-19 19:38:28] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityDeadlock, -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, 1800]
[2022-05-19 19:38:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-19 19:38:28] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
[2022-05-19 19:38:29] [WARNING] Using fallBack plugin, rng conformance not checked
[2022-05-19 19:38:30] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 1288 ms
[2022-05-19 19:38:30] [INFO ] Detected 4 constant HL places corresponding to 60 PT places.
[2022-05-19 19:38:30] [INFO ] Imported 18 HL places and 22 HL transitions for a total of 972 PT places and 1808.0 transition bindings in 51 ms.
Parsed 1 properties from file /home/mcc/execution/ReachabilityDeadlock.xml in 3 ms.
Working with output stream class java.io.PrintStream
[2022-05-19 19:38:30] [INFO ] Built PT skeleton of HLPN with 18 places and 22 transitions in 6 ms.
[2022-05-19 19:38:30] [INFO ] Skeletonized HLPN properties in 0 ms.
Successfully produced net in file /tmp/petri1000_17534389756403720007.dot
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 12 places and 7 transitions.
Prefix of Interest using HLPN skeleton for deadlock discarded 0 places and 0 transitions.
[2022-05-19 19:38:30] [INFO ] Unfolded HLPN to a Petri net with 972 places and 964 transitions in 89 ms.
[2022-05-19 19:38:30] [INFO ] Unfolded HLPN properties in 1 ms.
Successfully produced net in file /tmp/petri1001_9008610284021480264.dot
Deduced a syphon composed of 892 places in 5 ms
Reduce places removed 898 places and 906 transitions.
Reduce places removed 7 places and 0 transitions.
Built sparse matrix representations for Structural reductions in 0 ms.17388KB memory used
Starting structural reductions, iteration 0 : 67/67 places, 58/58 transitions.
Graph (complete) has 186 edges and 67 vertex of which 61 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.4 ms
Discarding 6 places :
Also discarding 0 output transitions
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 6 Pre rules applied. Total rules applied 1 place count 61 transition count 52
Deduced a syphon composed of 6 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 0 with 15 rules applied. Total rules applied 16 place count 52 transition count 52
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 24 place count 44 transition count 37
Iterating global reduction 0 with 8 rules applied. Total rules applied 32 place count 44 transition count 37
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 32 place count 44 transition count 34
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 38 place count 41 transition count 34
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 41 place count 38 transition count 31
Ensure Unique test removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 44 place count 35 transition count 31
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 1 with 3 rules applied. Total rules applied 47 place count 32 transition count 28
Reduce places removed 3 places and 0 transitions.
Graph (complete) has 44 edges and 29 vertex of which 20 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.0 ms
Discarding 9 places :
Also discarding 7 output transitions
Drop transitions removed 7 transitions
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 9 rules applied. Total rules applied 56 place count 20 transition count 16
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 61 place count 15 transition count 16
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 61 place count 15 transition count 15
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 63 place count 14 transition count 15
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 65 place count 12 transition count 12
Iterating global reduction 3 with 2 rules applied. Total rules applied 67 place count 12 transition count 12
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 67 place count 12 transition count 11
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 69 place count 11 transition count 11
Applied a total of 69 rules in 51 ms. Remains 11 /67 variables (removed 56) and now considering 11/58 (removed 47) transitions.
Finished structural reductions, in 1 iterations. Remains : 11/67 places, 11/58 transitions.
Finished random walk after 9 steps, including 0 resets, run found a deadlock after 1 ms. (steps per millisecond=9 )
FORMULA ReachabilityDeadlock TRUE TECHNIQUES TOPOLOGICAL STRUCTURAL_REDUCTION RANDOM_WALK

BK_STOP 1652989111576

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityDeadlock = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution ReachabilityDeadlock -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800
+ 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 ReachabilityDeadlock -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 1800 -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="NeoElection-COL-3"
export BK_EXAMINATION="ReachabilityDeadlock"
export BK_TOOL="gold2021"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
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 NeoElection-COL-3, examination is ReachabilityDeadlock"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r162-smll-165277002900006"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/NeoElection-COL-3.tgz
mv NeoElection-COL-3 execution
cd execution
if [ "ReachabilityDeadlock" = "ReachabilityDeadlock" ] || [ "ReachabilityDeadlock" = "UpperBounds" ] || [ "ReachabilityDeadlock" = "QuasiLiveness" ] || [ "ReachabilityDeadlock" = "StableMarking" ] || [ "ReachabilityDeadlock" = "Liveness" ] || [ "ReachabilityDeadlock" = "OneSafe" ] || [ "ReachabilityDeadlock" = "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 [ "ReachabilityDeadlock" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityDeadlock" != "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 "ReachabilityDeadlock.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityDeadlock.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityDeadlock.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 '' ReachabilityDeadlock.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityDeadlock" = "ReachabilityDeadlock" ] || [ "ReachabilityDeadlock" = "QuasiLiveness" ] || [ "ReachabilityDeadlock" = "StableMarking" ] || [ "ReachabilityDeadlock" = "Liveness" ] || [ "ReachabilityDeadlock" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityDeadlock"
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 ;