fond
Model Checking Contest 2021
11th edition, Paris, France, June 23, 2021
Execution of r151-tall-162089151400279
Last Updated
Jun 28, 2021

About the Execution of 2020-gold for Peterson-COL-2

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
244.300 3600000.00 10004.00 190.70 TFFTTTFTTFTFFFFT normal

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-162089151400279.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 Peterson-COL-2, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r151-tall-162089151400279
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 420K
-rw-r--r-- 1 mcc users 16K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 118K 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 91K 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.6K Mar 28 16:24 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K 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 15K Mar 28 16:24 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K Mar 27 06:59 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 14K Mar 27 06:59 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.4K Mar 25 08:19 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 21K Mar 25 08:19 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 09:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 22 09:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 5 16:51 equiv_pt
-rw-r--r-- 1 mcc users 2 May 5 16:51 instance
-rw-r--r-- 1 mcc users 5 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 42K 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 Peterson-COL-2-ReachabilityCardinality-00
FORMULA_NAME Peterson-COL-2-ReachabilityCardinality-01
FORMULA_NAME Peterson-COL-2-ReachabilityCardinality-02
FORMULA_NAME Peterson-COL-2-ReachabilityCardinality-03
FORMULA_NAME Peterson-COL-2-ReachabilityCardinality-04
FORMULA_NAME Peterson-COL-2-ReachabilityCardinality-05
FORMULA_NAME Peterson-COL-2-ReachabilityCardinality-06
FORMULA_NAME Peterson-COL-2-ReachabilityCardinality-07
FORMULA_NAME Peterson-COL-2-ReachabilityCardinality-08
FORMULA_NAME Peterson-COL-2-ReachabilityCardinality-09
FORMULA_NAME Peterson-COL-2-ReachabilityCardinality-10
FORMULA_NAME Peterson-COL-2-ReachabilityCardinality-11
FORMULA_NAME Peterson-COL-2-ReachabilityCardinality-12
FORMULA_NAME Peterson-COL-2-ReachabilityCardinality-13
FORMULA_NAME Peterson-COL-2-ReachabilityCardinality-14
FORMULA_NAME Peterson-COL-2-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1621019632271

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-14 19:13:53] [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 19:13:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-14 19:13:53] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
SLF4J: Failed to load class "org.slf4j.impl.StaticLoggerBinder".
SLF4J: Defaulting to no-operation (NOP) logger implementation
SLF4J: See http://www.slf4j.org/codes.html#StaticLoggerBinder for further details.
[2021-05-14 19:13:54] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 545 ms
[2021-05-14 19:13:54] [INFO ] sort/places :
ProcTourProc->BeginLoop,TestIdentity,TestAlone,IsEndLoop,
ProcBool->WantSection,
TourProc->Turn,
ProcTour->AskForSection,TestTurn,EndTurn,
Process->Idle,CS,

[2021-05-14 19:13:54] [INFO ] Imported 11 HL places and 14 HL transitions for a total of 108 PT places and 159.0 transition bindings in 20 ms.
[2021-05-14 19:13:54] [INFO ] Computed order based on color domains.
[2021-05-14 19:13:54] [INFO ] Unfolded HLPN to a Petri net with 108 places and 138 transitions in 20 ms.
[2021-05-14 19:13:54] [INFO ] Unfolded HLPN properties in 0 ms.
Deduced a syphon composed of 6 places in 4 ms
Reduce places removed 6 places and 12 transitions.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 42 ms.
Working with output stream class java.io.PrintStream
FORMULA Peterson-COL-2-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-COL-2-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-COL-2-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-COL-2-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 0 resets, run finished after 79 ms. (steps per millisecond=126 ) properties seen :[1, 0, 0, 0, 1, 1, 1, 0, 0, 0, 0, 0]
FORMULA Peterson-COL-2-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-COL-2-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-COL-2-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-COL-2-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 0 resets, run finished after 23 ms. (steps per millisecond=434 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 0 resets, run finished after 26 ms. (steps per millisecond=384 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 0 resets, run finished after 19 ms. (steps per millisecond=526 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 0 resets, run finished after 15 ms. (steps per millisecond=666 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 0 resets, run finished after 19 ms. (steps per millisecond=526 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 0 resets, run finished after 22 ms. (steps per millisecond=454 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 0 resets, run finished after 15 ms. (steps per millisecond=666 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 0 resets, run finished after 19 ms. (steps per millisecond=526 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
[2021-05-14 19:13:54] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
// Phase 1: matrix 120 rows 102 cols
[2021-05-14 19:13:54] [INFO ] Computed 11 place invariants in 6 ms
[2021-05-14 19:13:54] [INFO ] [Real]Absence check using 8 positive place invariants in 12 ms returned unsat
[2021-05-14 19:13:54] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2021-05-14 19:13:54] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2021-05-14 19:13:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 19:13:54] [INFO ] [Real]Absence check using state equation in 77 ms returned sat
[2021-05-14 19:13:55] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 19:13:55] [INFO ] [Nat]Absence check using 8 positive place invariants in 10 ms returned unsat
[2021-05-14 19:13:55] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned unsat
[2021-05-14 19:13:55] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2021-05-14 19:13:55] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 2 ms returned sat
[2021-05-14 19:13:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 19:13:55] [INFO ] [Real]Absence check using state equation in 54 ms returned sat
[2021-05-14 19:13:55] [INFO ] State equation strengthened by 26 read => feed constraints.
[2021-05-14 19:13:55] [INFO ] [Real]Added 26 Read/Feed constraints in 7 ms returned sat
[2021-05-14 19:13:55] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 19:13:55] [INFO ] [Nat]Absence check using 8 positive place invariants in 7 ms returned sat
[2021-05-14 19:13:55] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2021-05-14 19:13:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 19:13:55] [INFO ] [Nat]Absence check using state equation in 50 ms returned sat
[2021-05-14 19:13:55] [INFO ] [Nat]Added 26 Read/Feed constraints in 4 ms returned sat
[2021-05-14 19:13:55] [INFO ] Deduced a trap composed of 8 places in 45 ms
[2021-05-14 19:13:55] [INFO ] Deduced a trap composed of 31 places in 33 ms
[2021-05-14 19:13:55] [INFO ] Deduced a trap composed of 27 places in 34 ms
[2021-05-14 19:13:55] [INFO ] Deduced a trap composed of 12 places in 30 ms
[2021-05-14 19:13:55] [INFO ] Deduced a trap composed of 8 places in 28 ms
[2021-05-14 19:13:55] [INFO ] Deduced a trap composed of 22 places in 23 ms
[2021-05-14 19:13:55] [INFO ] Deduced a trap composed of 26 places in 22 ms
[2021-05-14 19:13:55] [INFO ] Deduced a trap composed of 15 places in 27 ms
[2021-05-14 19:13:55] [INFO ] Deduced a trap composed of 29 places in 27 ms
[2021-05-14 19:13:55] [INFO ] Deduced a trap composed of 22 places in 20 ms
[2021-05-14 19:13:55] [INFO ] Deduced a trap composed of 15 places in 26 ms
[2021-05-14 19:13:55] [INFO ] Deduced a trap composed of 37 places in 22 ms
[2021-05-14 19:13:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 12 trap constraints in 434 ms
[2021-05-14 19:13:55] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2021-05-14 19:13:55] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 2 ms returned sat
[2021-05-14 19:13:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 19:13:55] [INFO ] [Real]Absence check using state equation in 53 ms returned sat
[2021-05-14 19:13:55] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 19:13:55] [INFO ] [Nat]Absence check using 8 positive place invariants in 7 ms returned sat
[2021-05-14 19:13:55] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2021-05-14 19:13:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 19:13:55] [INFO ] [Nat]Absence check using state equation in 47 ms returned sat
[2021-05-14 19:13:55] [INFO ] [Nat]Added 26 Read/Feed constraints in 3 ms returned sat
[2021-05-14 19:13:55] [INFO ] Deduced a trap composed of 8 places in 25 ms
[2021-05-14 19:13:55] [INFO ] Deduced a trap composed of 8 places in 33 ms
[2021-05-14 19:13:55] [INFO ] Deduced a trap composed of 22 places in 36 ms
[2021-05-14 19:13:55] [INFO ] Deduced a trap composed of 15 places in 27 ms
[2021-05-14 19:13:56] [INFO ] Deduced a trap composed of 12 places in 26 ms
[2021-05-14 19:13:56] [INFO ] Deduced a trap composed of 29 places in 24 ms
[2021-05-14 19:13:56] [INFO ] Deduced a trap composed of 12 places in 30 ms
[2021-05-14 19:13:56] [INFO ] Deduced a trap composed of 15 places in 25 ms
[2021-05-14 19:13:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 8 trap constraints in 268 ms
[2021-05-14 19:13:56] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned unsat
[2021-05-14 19:13:56] [INFO ] [Real]Absence check using 8 positive place invariants in 10 ms returned sat
[2021-05-14 19:13:56] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2021-05-14 19:13:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 19:13:56] [INFO ] [Real]Absence check using state equation in 49 ms returned sat
[2021-05-14 19:13:56] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 19:13:56] [INFO ] [Nat]Absence check using 8 positive place invariants in 7 ms returned sat
[2021-05-14 19:13:56] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 2 ms returned sat
[2021-05-14 19:13:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 19:13:56] [INFO ] [Nat]Absence check using state equation in 51 ms returned sat
[2021-05-14 19:13:56] [INFO ] [Nat]Added 26 Read/Feed constraints in 3 ms returned sat
[2021-05-14 19:13:56] [INFO ] Deduced a trap composed of 8 places in 28 ms
[2021-05-14 19:13:56] [INFO ] Deduced a trap composed of 8 places in 24 ms
[2021-05-14 19:13:56] [INFO ] Deduced a trap composed of 24 places in 24 ms
[2021-05-14 19:13:56] [INFO ] Deduced a trap composed of 24 places in 25 ms
[2021-05-14 19:13:56] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 128 ms
[2021-05-14 19:13:56] [INFO ] Computed and/alt/rep : 123/264/117 causal constraints in 9 ms.
[2021-05-14 19:13:56] [INFO ] Added : 117 causal constraints over 24 iterations in 241 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 6 ms.
[2021-05-14 19:13:56] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned unsat
FORMULA Peterson-COL-2-ReachabilityCardinality-13 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Peterson-COL-2-ReachabilityCardinality-11 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Peterson-COL-2-ReachabilityCardinality-10 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Peterson-COL-2-ReachabilityCardinality-09 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Peterson-COL-2-ReachabilityCardinality-04 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Peterson-COL-2-ReachabilityCardinality-03 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Peterson-COL-2-ReachabilityCardinality-02 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Finished Parikh walk after 66 steps, including 1 resets, run visited all 1 properties in 2 ms. (steps per millisecond=33 )
FORMULA Peterson-COL-2-ReachabilityCardinality-12 FALSE 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="Peterson-COL-2"
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 Peterson-COL-2, 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-162089151400279"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Peterson-COL-2.tgz
mv Peterson-COL-2 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 ;