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.r151-tall-162089151300219.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 gold2020
Input is Parking-PT-432, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r151-tall-162089151300219
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 536K
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 103K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.0K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 81K 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 6.5K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.0K 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 2.0K Mar 28 16:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 28 16:24 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Mar 27 06:41 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Mar 27 06:41 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 25 08:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 25 08:00 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 192K 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 booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1621008486643

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-14 16:08:08] [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-05-14 16:08:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-14 16:08:08] [INFO ] Load time of PNML (sax parser for PT used): 86 ms
[2021-05-14 16:08:08] [INFO ] Transformed 529 places.
[2021-05-14 16:08:08] [INFO ] Transformed 785 transitions.
[2021-05-14 16:08:08] [INFO ] Found NUPN structural information;
[2021-05-14 16:08:08] [INFO ] Parsed PT model containing 529 places and 785 transitions in 128 ms.
Ensure Unique test removed 328 transitions
Reduce redundant transitions removed 328 transitions.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 26 ms.
Working with output stream class java.io.PrintStream
FORMULA Parking-PT-432-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-432-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-432-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-432-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-432-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-432-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-432-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 90 resets, run finished after 126 ms. (steps per millisecond=79 ) properties seen :[0, 1, 0, 1, 1, 0, 1, 1, 0]
FORMULA Parking-PT-432-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Parking-PT-432-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Parking-PT-432-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Parking-PT-432-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Parking-PT-432-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties seen :[0, 0, 0, 0]
// Phase 1: matrix 457 rows 529 cols
[2021-05-14 16:08:08] [INFO ] Computed 124 place invariants in 18 ms
[2021-05-14 16:08:09] [INFO ] [Real]Absence check using 120 positive place invariants in 70 ms returned sat
[2021-05-14 16:08:09] [INFO ] [Real]Absence check using 120 positive and 4 generalized place invariants in 2 ms returned sat
[2021-05-14 16:08:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 16:08:09] [INFO ] [Real]Absence check using state equation in 547 ms returned sat
[2021-05-14 16:08:09] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 16:08:09] [INFO ] [Nat]Absence check using 120 positive place invariants in 95 ms returned sat
[2021-05-14 16:08:09] [INFO ] [Nat]Absence check using 120 positive and 4 generalized place invariants in 11 ms returned sat
[2021-05-14 16:08:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 16:08:11] [INFO ] [Nat]Absence check using state equation in 1756 ms returned sat
[2021-05-14 16:08:11] [INFO ] State equation strengthened by 108 read => feed constraints.
[2021-05-14 16:08:11] [INFO ] [Nat]Added 108 Read/Feed constraints in 28 ms returned sat
[2021-05-14 16:08:11] [INFO ] Deduced a trap composed of 60 places in 72 ms
[2021-05-14 16:08:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 134 ms
[2021-05-14 16:08:11] [INFO ] Computed and/alt/rep : 456/1928/456 causal constraints in 30 ms.
[2021-05-14 16:08:14] [INFO ] Added : 400 causal constraints over 80 iterations in 2903 ms. Result :unknown
[2021-05-14 16:08:14] [INFO ] [Real]Absence check using 120 positive place invariants in 61 ms returned sat
[2021-05-14 16:08:14] [INFO ] [Real]Absence check using 120 positive and 4 generalized place invariants in 2 ms returned sat
[2021-05-14 16:08:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 16:08:15] [INFO ] [Real]Absence check using state equation in 525 ms returned sat
[2021-05-14 16:08:15] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 16:08:15] [INFO ] [Nat]Absence check using 120 positive place invariants in 52 ms returned sat
[2021-05-14 16:08:15] [INFO ] [Nat]Absence check using 120 positive and 4 generalized place invariants in 2 ms returned sat
[2021-05-14 16:08:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 16:08:16] [INFO ] [Nat]Absence check using state equation in 535 ms returned sat
[2021-05-14 16:08:16] [INFO ] [Nat]Added 108 Read/Feed constraints in 14 ms returned sat
[2021-05-14 16:08:16] [INFO ] Computed and/alt/rep : 456/1928/456 causal constraints in 31 ms.
[2021-05-14 16:08:18] [INFO ] Added : 427 causal constraints over 86 iterations in 2624 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 22 ms.
[2021-05-14 16:08:18] [INFO ] [Real]Absence check using 120 positive place invariants in 100 ms returned sat
[2021-05-14 16:08:18] [INFO ] [Real]Absence check using 120 positive and 4 generalized place invariants in 2 ms returned sat
[2021-05-14 16:08:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 16:08:19] [INFO ] [Real]Absence check using state equation in 690 ms returned sat
[2021-05-14 16:08:19] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 16:08:19] [INFO ] [Nat]Absence check using 120 positive place invariants in 55 ms returned sat
[2021-05-14 16:08:19] [INFO ] [Nat]Absence check using 120 positive and 4 generalized place invariants in 2 ms returned sat
[2021-05-14 16:08:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 16:08:20] [INFO ] [Nat]Absence check using state equation in 522 ms returned sat
[2021-05-14 16:08:20] [INFO ] [Nat]Added 108 Read/Feed constraints in 19 ms returned sat
[2021-05-14 16:08:20] [INFO ] Computed and/alt/rep : 456/1928/456 causal constraints in 29 ms.
[2021-05-14 16:08:23] [INFO ] Added : 441 causal constraints over 89 iterations in 2774 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 35 ms.
[2021-05-14 16:08:23] [INFO ] [Real]Absence check using 120 positive place invariants in 51 ms returned sat
[2021-05-14 16:08:23] [INFO ] [Real]Absence check using 120 positive and 4 generalized place invariants in 2 ms returned sat
[2021-05-14 16:08:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 16:08:23] [INFO ] [Real]Absence check using state equation in 528 ms returned sat
[2021-05-14 16:08:23] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 16:08:23] [INFO ] [Nat]Absence check using 120 positive place invariants in 49 ms returned sat
[2021-05-14 16:08:23] [INFO ] [Nat]Absence check using 120 positive and 4 generalized place invariants in 2 ms returned unsat
FORMULA Parking-PT-432-ReachabilityCardinality-14 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Incomplete Parikh walk after 53200 steps, including 449 resets, run finished after 415 ms. (steps per millisecond=128 ) properties seen :[0, 0, 1] could not realise parikh vector
FORMULA Parking-PT-432-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 52800 steps, including 495 resets, run finished after 369 ms. (steps per millisecond=143 ) properties seen :[0, 0] could not realise parikh vector
Incomplete Parikh walk after 44100 steps, including 348 resets, run finished after 304 ms. (steps per millisecond=145 ) properties seen :[0, 0] could not realise parikh vector
Support contains 11 out of 529 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 529/529 places, 457/457 transitions.
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 529 transition count 443
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 28 place count 515 transition count 443
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 28 place count 515 transition count 429
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 56 place count 501 transition count 429
Symmetric choice reduction at 2 with 4 rule applications. Total rules 60 place count 501 transition count 429
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 4 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 68 place count 497 transition count 425
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 1 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 106 place count 478 transition count 406
Free-agglomeration rule applied 80 times.
Iterating global reduction 2 with 80 rules applied. Total rules applied 186 place count 478 transition count 326
Reduce places removed 80 places and 0 transitions.
Discarding 95 places :
Also discarding 74 output transitions
Drop transitions removed 74 transitions
Graph (complete) has 845 edges and 398 vertex of which 303 are kept as prefixes of interest. Removing 95 places using SCC suffix rule.6 ms
Iterating post reduction 2 with 81 rules applied. Total rules applied 267 place count 303 transition count 252
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 273 place count 303 transition count 246
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 274 place count 303 transition count 245
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 275 place count 302 transition count 244
Reduce places removed 62 places and 0 transitions.
Performed 113 Post agglomeration using F-continuation condition.Transition count delta: 113
Iterating post reduction 4 with 175 rules applied. Total rules applied 450 place count 240 transition count 131
Reduce places removed 113 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Iterating post reduction 5 with 144 rules applied. Total rules applied 594 place count 127 transition count 100
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 6 with 20 rules applied. Total rules applied 614 place count 107 transition count 100
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 25 Pre rules applied. Total rules applied 614 place count 107 transition count 75
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 7 with 50 rules applied. Total rules applied 664 place count 82 transition count 75
Applied a total of 664 rules in 222 ms. Remains 82 /529 variables (removed 447) and now considering 75/457 (removed 382) transitions.
Finished structural reductions, in 1 iterations. Remains : 82/529 places, 75/457 transitions.
Incomplete random walk after 1000000 steps, including 0 resets, run finished after 2414 ms. (steps per millisecond=414 ) properties seen :[0, 0]
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 947 ms. (steps per millisecond=1055 ) properties seen :[1, 0]
FORMULA Parking-PT-432-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 888 ms. (steps per millisecond=1126 ) properties seen :[0]
// Phase 1: matrix 75 rows 82 cols
[2021-05-14 16:08:29] [INFO ] Computed 34 place invariants in 2 ms
[2021-05-14 16:08:29] [INFO ] [Real]Absence check using 31 positive place invariants in 9 ms returned sat
[2021-05-14 16:08:29] [INFO ] [Real]Absence check using 31 positive and 3 generalized place invariants in 1 ms returned sat
[2021-05-14 16:08:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 16:08:29] [INFO ] [Real]Absence check using state equation in 33 ms returned sat
[2021-05-14 16:08:29] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 16:08:29] [INFO ] [Nat]Absence check using 31 positive place invariants in 10 ms returned sat
[2021-05-14 16:08:29] [INFO ] [Nat]Absence check using 31 positive and 3 generalized place invariants in 1 ms returned sat
[2021-05-14 16:08:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 16:08:29] [INFO ] [Nat]Absence check using state equation in 32 ms returned sat
[2021-05-14 16:08:29] [INFO ] Computed and/alt/rep : 47/291/47 causal constraints in 4 ms.
[2021-05-14 16:08:29] [INFO ] Added : 3 causal constraints over 1 iterations in 18 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 2 ms.
Finished Parikh walk after 8 steps, including 1 resets, run visited all 1 properties in 1 ms. (steps per millisecond=8 )
FORMULA Parking-PT-432-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
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="Parking-PT-432"
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 Parking-PT-432, 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 r151-tall-162089151300219"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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