fond
Model Checking Contest 2021
11th edition, Paris, France, June 23, 2021
Execution of r189-tajo-162089432700224
Last Updated
Jun 28, 2021

About the Execution of 2020-gold for Railroad-PT-100

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
4405.955 3600000.00 237300.00 332.00 TTTTFTFFFTTFTFFT normal

Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2021-input.r189-tajo-162089432700224.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/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 Railroad-PT-100, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r189-tajo-162089432700224
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 5.6M
-rw-r--r-- 1 mcc users 20K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 142K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 16K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 99K May 10 09:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K Mar 28 16:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 28 16:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 28 16:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 16:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Mar 27 10:29 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K Mar 27 10:29 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.1K Mar 25 13:42 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 25 13:42 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 08:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 22 08: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 5.2M 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 Railroad-PT-100-ReachabilityFireability-00
FORMULA_NAME Railroad-PT-100-ReachabilityFireability-01
FORMULA_NAME Railroad-PT-100-ReachabilityFireability-02
FORMULA_NAME Railroad-PT-100-ReachabilityFireability-03
FORMULA_NAME Railroad-PT-100-ReachabilityFireability-04
FORMULA_NAME Railroad-PT-100-ReachabilityFireability-05
FORMULA_NAME Railroad-PT-100-ReachabilityFireability-06
FORMULA_NAME Railroad-PT-100-ReachabilityFireability-07
FORMULA_NAME Railroad-PT-100-ReachabilityFireability-08
FORMULA_NAME Railroad-PT-100-ReachabilityFireability-09
FORMULA_NAME Railroad-PT-100-ReachabilityFireability-10
FORMULA_NAME Railroad-PT-100-ReachabilityFireability-11
FORMULA_NAME Railroad-PT-100-ReachabilityFireability-12
FORMULA_NAME Railroad-PT-100-ReachabilityFireability-13
FORMULA_NAME Railroad-PT-100-ReachabilityFireability-14
FORMULA_NAME Railroad-PT-100-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1621425116410

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-19 11:51:58] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2021-05-19 11:51:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-19 11:51:58] [INFO ] Load time of PNML (sax parser for PT used): 490 ms
[2021-05-19 11:51:58] [INFO ] Transformed 1018 places.
[2021-05-19 11:51:58] [INFO ] Transformed 10506 transitions.
[2021-05-19 11:51:58] [INFO ] Found NUPN structural information;
[2021-05-19 11:51:58] [INFO ] Parsed PT model containing 1018 places and 10506 transitions in 571 ms.
Deduced a syphon composed of 301 places in 117 ms
Reduce places removed 301 places and 100 transitions.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 222 ms.
Working with output stream class java.io.PrintStream
FORMULA Railroad-PT-100-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 0 resets, run finished after 259 ms. (steps per millisecond=38 ) properties seen :[0, 1, 1, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0]
FORMULA Railroad-PT-100-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Railroad-PT-100-ReachabilityFireability-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Railroad-PT-100-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Railroad-PT-100-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 50 ms. (steps per millisecond=200 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 39 ms. (steps per millisecond=256 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 45 ms. (steps per millisecond=222 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 57 ms. (steps per millisecond=175 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 67 ms. (steps per millisecond=149 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 42 ms. (steps per millisecond=238 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 37 ms. (steps per millisecond=270 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 32 ms. (steps per millisecond=312 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 32 ms. (steps per millisecond=312 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 34 ms. (steps per millisecond=294 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 37 ms. (steps per millisecond=270 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 10406 rows 717 cols
[2021-05-19 11:51:59] [INFO ] Invariants computation overflowed in 95 ms
[2021-05-19 11:52:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 11:52:03] [INFO ] [Real]Absence check using state equation in 3800 ms returned unsat
[2021-05-19 11:52:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 11:52:08] [INFO ] [Real]Absence check using state equation in 4890 ms returned (error "Solver has unexpectedly terminated")
[2021-05-19 11:52:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 11:52:12] [INFO ] [Real]Absence check using state equation in 3672 ms returned unsat
[2021-05-19 11:52:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 11:52:17] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-19 11:52:17] [INFO ] [Real]Absence check using state equation in 4887 ms returned (error "Failed to check-sat")
[2021-05-19 11:52:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 11:52:21] [INFO ] [Real]Absence check using state equation in 4059 ms returned unsat
[2021-05-19 11:52:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 11:52:26] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-19 11:52:26] [INFO ] [Real]Absence check using state equation in 4883 ms returned (error "Failed to check-sat")
[2021-05-19 11:52:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 11:52:30] [INFO ] [Real]Absence check using state equation in 3413 ms returned unsat
[2021-05-19 11:52:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 11:52:34] [INFO ] [Real]Absence check using state equation in 3850 ms returned unsat
[2021-05-19 11:52:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 11:52:38] [INFO ] [Real]Absence check using state equation in 3871 ms returned unsat
[2021-05-19 11:52:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 11:52:42] [INFO ] [Real]Absence check using state equation in 3636 ms returned unsat
[2021-05-19 11:52:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 11:52:47] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-19 11:52:47] [INFO ] [Real]Absence check using state equation in 4910 ms returned (error "Failed to check-sat")
FORMULA Railroad-PT-100-ReachabilityFireability-14 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Railroad-PT-100-ReachabilityFireability-13 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Railroad-PT-100-ReachabilityFireability-11 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Railroad-PT-100-ReachabilityFireability-10 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Railroad-PT-100-ReachabilityFireability-06 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Railroad-PT-100-ReachabilityFireability-04 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Railroad-PT-100-ReachabilityFireability-00 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Support contains 32 out of 717 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 717/717 places, 10406/10406 transitions.
Ensure Unique test removed 102 places
Iterating post reduction 0 with 102 rules applied. Total rules applied 102 place count 615 transition count 10406
Performed 86 Post agglomeration using F-continuation condition.Transition count delta: 86
Deduced a syphon composed of 86 places in 36 ms
Reduce places removed 86 places and 0 transitions.
Iterating global reduction 1 with 172 rules applied. Total rules applied 274 place count 529 transition count 10320
Applied a total of 274 rules in 6950 ms. Remains 529 /717 variables (removed 188) and now considering 10320/10406 (removed 86) transitions.
Finished structural reductions, in 1 iterations. Remains : 529/717 places, 10320/10406 transitions.
Incomplete random walk after 1000000 steps, including 0 resets, run finished after 18046 ms. (steps per millisecond=55 ) properties seen :[0, 1, 0, 0]
FORMULA Railroad-PT-100-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 2710 ms. (steps per millisecond=369 ) properties seen :[0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 2934 ms. (steps per millisecond=340 ) properties seen :[0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 2930 ms. (steps per millisecond=341 ) properties seen :[0, 0, 0]
// Phase 1: matrix 10320 rows 529 cols
[2021-05-19 11:53:20] [INFO ] Invariants computation overflowed in 32 ms
[2021-05-19 11:53:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 11:53:27] [INFO ] [Real]Absence check using state equation in 6939 ms returned sat
[2021-05-19 11:53:29] [INFO ] Computed and/alt/rep : 10220/1030324/10220 causal constraints in 1481 ms.
[2021-05-19 11:53:30] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 11:53:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-19 11:53:37] [INFO ] [Nat]Absence check using state equation in 6870 ms returned sat
[2021-05-19 11:53:39] [INFO ] Computed and/alt/rep : 10220/1030324/10220 causal constraints in 1673 ms.
[2021-05-19 11:53:58] [INFO ] Added : 165 causal constraints over 33 iterations in 20258 ms.(timeout) Result :sat
[2021-05-19 11:53:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 11:54:06] [INFO ] [Real]Absence check using state equation in 7182 ms returned sat
[2021-05-19 11:54:07] [INFO ] Computed and/alt/rep : 10220/1030324/10220 causal constraints in 962 ms.
[2021-05-19 11:54:08] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 11:54:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-19 11:54:16] [INFO ] [Nat]Absence check using state equation in 7520 ms returned sat
[2021-05-19 11:54:16] [INFO ] Deduced a trap composed of 101 places in 204 ms
[2021-05-19 11:54:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 716 ms
[2021-05-19 11:54:18] [INFO ] Computed and/alt/rep : 10220/1030324/10220 causal constraints in 1347 ms.
[2021-05-19 11:54:37] [INFO ] Added : 165 causal constraints over 33 iterations in 20538 ms.(timeout) Result :sat
[2021-05-19 11:54:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 11:54:45] [INFO ] [Real]Absence check using state equation in 7277 ms returned sat
[2021-05-19 11:54:47] [INFO ] Computed and/alt/rep : 10220/1030324/10220 causal constraints in 1247 ms.
[2021-05-19 11:54:48] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 11:54:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-19 11:54:55] [INFO ] [Nat]Absence check using state equation in 7132 ms returned sat
[2021-05-19 11:54:57] [INFO ] Computed and/alt/rep : 10220/1030324/10220 causal constraints in 1554 ms.
[2021-05-19 11:55:16] [INFO ] Added : 175 causal constraints over 35 iterations in 20707 ms.(timeout) Result :sat
Finished Parikh walk after 5515 steps, including 9 resets, run visited all 3 properties in 166 ms. (steps per millisecond=33 )
FORMULA Railroad-PT-100-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Railroad-PT-100-ReachabilityFireability-08 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Railroad-PT-100-ReachabilityFireability-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="Railroad-PT-100"
export BK_EXAMINATION="ReachabilityFireability"
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 Railroad-PT-100, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r189-tajo-162089432700224"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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