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.r011-tall-162038006300327.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2021-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 gold2020
Input is BART-PT-060, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r011-tall-162038006300327
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 15M
-rw-r--r-- 1 mcc users 4.2K Mar 20 13:27 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K Mar 20 13:27 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.6K Jun 8 09:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Jun 8 09:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Jun 8 09:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Jun 8 09:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K Jun 8 09:15 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Jun 8 09:15 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.5K Jun 8 09:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K Jun 8 09:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Jun 8 09:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Jun 8 09:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 20 13:27 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 20 13:27 instance
-rw-r--r-- 1 mcc users 6 Mar 20 13:27 iscolored
-rw-r--r-- 1 mcc users 15M Mar 20 13:27 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME BART-PT-060-ReachabilityCardinality-00
FORMULA_NAME BART-PT-060-ReachabilityCardinality-01
FORMULA_NAME BART-PT-060-ReachabilityCardinality-02
FORMULA_NAME BART-PT-060-ReachabilityCardinality-03
FORMULA_NAME BART-PT-060-ReachabilityCardinality-04
FORMULA_NAME BART-PT-060-ReachabilityCardinality-05
FORMULA_NAME BART-PT-060-ReachabilityCardinality-06
FORMULA_NAME BART-PT-060-ReachabilityCardinality-07
FORMULA_NAME BART-PT-060-ReachabilityCardinality-08
FORMULA_NAME BART-PT-060-ReachabilityCardinality-09
FORMULA_NAME BART-PT-060-ReachabilityCardinality-10
FORMULA_NAME BART-PT-060-ReachabilityCardinality-11
FORMULA_NAME BART-PT-060-ReachabilityCardinality-12
FORMULA_NAME BART-PT-060-ReachabilityCardinality-13
FORMULA_NAME BART-PT-060-ReachabilityCardinality-14
FORMULA_NAME BART-PT-060-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1623185408001

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-06-08 20:50:09] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2021-06-08 20:50:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-06-08 20:50:10] [INFO ] Load time of PNML (sax parser for PT used): 591 ms
[2021-06-08 20:50:10] [INFO ] Transformed 8130 places.
[2021-06-08 20:50:10] [INFO ] Transformed 12120 transitions.
[2021-06-08 20:50:10] [INFO ] Found NUPN structural information;
[2021-06-08 20:50:10] [INFO ] Parsed PT model containing 8130 places and 12120 transitions in 725 ms.
Reduce places removed 210 places and 0 transitions.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 107 ms.
Working with output stream class java.io.PrintStream
FORMULA BART-PT-060-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-060-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-060-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-060-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-060-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 0 resets, run finished after 175 ms. (steps per millisecond=57 ) properties seen :[0, 1, 0, 0, 1, 0, 0, 1, 0, 1, 1]
FORMULA BART-PT-060-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BART-PT-060-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BART-PT-060-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BART-PT-060-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BART-PT-060-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 19 ms. (steps per millisecond=526 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 18 ms. (steps per millisecond=555 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 21 ms. (steps per millisecond=476 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 18 ms. (steps per millisecond=555 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 15 ms. (steps per millisecond=666 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 17 ms. (steps per millisecond=588 ) properties seen :[0, 0, 0, 0, 0, 0]
// Phase 1: matrix 12120 rows 7920 cols
[2021-06-08 20:50:11] [INFO ] Computed 60 place invariants in 278 ms
[2021-06-08 20:50:12] [INFO ] [Real]Absence check using 60 positive place invariants in 568 ms returned sat
[2021-06-08 20:50:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-08 20:50:16] [INFO ] SMT solver returned unknown. Retrying;
[2021-06-08 20:50:16] [INFO ] [Real]Absence check using state equation in 3480 ms returned (error "Failed to check-sat")
[2021-06-08 20:50:17] [INFO ] [Real]Absence check using 60 positive place invariants in 592 ms returned sat
[2021-06-08 20:50:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-08 20:50:21] [INFO ] SMT solver returned unknown. Retrying;
[2021-06-08 20:50:21] [INFO ] [Real]Absence check using state equation in 3573 ms returned (error "Failed to check-sat")
[2021-06-08 20:50:22] [INFO ] [Real]Absence check using 60 positive place invariants in 551 ms returned sat
[2021-06-08 20:50:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-08 20:50:26] [INFO ] SMT solver returned unknown. Retrying;
[2021-06-08 20:50:26] [INFO ] [Real]Absence check using state equation in 3589 ms returned (error "Failed to check-sat")
[2021-06-08 20:50:27] [INFO ] [Real]Absence check using 60 positive place invariants in 563 ms returned sat
[2021-06-08 20:50:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-08 20:50:31] [INFO ] SMT solver returned unknown. Retrying;
[2021-06-08 20:50:31] [INFO ] [Real]Absence check using state equation in 3621 ms returned (error "Failed to check-sat")
[2021-06-08 20:50:32] [INFO ] [Real]Absence check using 60 positive place invariants in 544 ms returned sat
[2021-06-08 20:50:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-08 20:50:36] [INFO ] SMT solver returned unknown. Retrying;
[2021-06-08 20:50:36] [INFO ] [Real]Absence check using state equation in 3646 ms returned (error "Failed to check-sat")
[2021-06-08 20:50:37] [INFO ] [Real]Absence check using 60 positive place invariants in 542 ms returned sat
[2021-06-08 20:50:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-08 20:50:41] [INFO ] SMT solver returned unknown. Retrying;
[2021-06-08 20:50:41] [INFO ] [Real]Absence check using state equation in 3642 ms returned (error "Failed to check-sat")
Support contains 18 out of 7920 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 7920/7920 places, 12120/12120 transitions.
Graph (trivial) has 12074 edges and 7920 vertex of which 7853 / 7920 are part of one of the 60 SCC in 28 ms
Free SCC test removed 7793 places
Discarding 44 places :
Also discarding 8888 output transitions
Drop transitions removed 8888 transitions
Graph (complete) has 96 edges and 127 vertex of which 83 are kept as prefixes of interest. Removing 44 places using SCC suffix rule.30 ms
Drop transitions removed 3132 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 3136 transitions.
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Iterating post reduction 0 with 3172 rules applied. Total rules applied 3174 place count 83 transition count 60
Reduce places removed 36 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 44 rules applied. Total rules applied 3218 place count 47 transition count 52
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 5 rules applied. Total rules applied 3223 place count 45 transition count 49
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 3225 place count 44 transition count 48
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 3225 place count 44 transition count 44
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 3233 place count 40 transition count 44
Symmetric choice reduction at 4 with 2 rule applications. Total rules 3235 place count 40 transition count 44
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 3239 place count 38 transition count 42
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 3241 place count 38 transition count 40
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 3241 place count 38 transition count 39
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 3243 place count 37 transition count 39
Free-agglomeration rule applied 3 times.
Iterating global reduction 5 with 3 rules applied. Total rules applied 3246 place count 37 transition count 36
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 3249 place count 34 transition count 36
Applied a total of 3249 rules in 116 ms. Remains 34 /7920 variables (removed 7886) and now considering 36/12120 (removed 12084) transitions.
Finished structural reductions, in 1 iterations. Remains : 34/7920 places, 36/12120 transitions.
Incomplete random walk after 1000000 steps, including 0 resets, run finished after 1195 ms. (steps per millisecond=836 ) properties seen :[1, 1, 1, 1, 1, 0]
FORMULA BART-PT-060-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BART-PT-060-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BART-PT-060-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BART-PT-060-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BART-PT-060-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 433 ms. (steps per millisecond=2309 ) properties seen :[0]
// Phase 1: matrix 36 rows 34 cols
[2021-06-08 20:50:42] [INFO ] Computed 16 place invariants in 0 ms
[2021-06-08 20:50:42] [INFO ] [Real]Absence check using 16 positive place invariants in 9 ms returned sat
[2021-06-08 20:50:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-08 20:50:42] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2021-06-08 20:50:42] [INFO ] Solution in real domain found non-integer solution.
[2021-06-08 20:50:43] [INFO ] [Nat]Absence check using 16 positive place invariants in 5 ms returned unsat
FORMULA BART-PT-060-ReachabilityCardinality-12 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
All properties solved without resorting to model-checking.

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

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="BART-PT-060"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="gold2020"
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 gold2020"
echo " Input is BART-PT-060, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r011-tall-162038006300327"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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