fond
Model Checking Contest 2022
12th edition, Bergen, Norway, June 21, 2022
Execution of r324-tall-165472294000651
Last Updated
Jun 22, 2022

About the Execution of 2021-gold for Szymanski-PT-b04

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
2223.544 46740.00 59459.00 278.00 T normal

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.r324-tall-165472294000651.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 Szymanski-PT-b04, examination is ReachabilityDeadlock
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r324-tall-165472294000651
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.1M
-rw-r--r-- 1 mcc users 6.5K Jun 7 17:07 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K Jun 7 17:07 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Jun 7 17:06 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K Jun 7 17:06 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Jun 6 15:33 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Jun 6 15:33 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Jun 6 15:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Jun 6 15:33 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 6 12:11 NewModel
-rw-r--r-- 1 mcc users 8.9K Jun 7 17:08 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 92K Jun 7 17:08 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.5K Jun 7 17:07 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 84K Jun 7 17:07 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 6 15:33 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 6 15:33 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 6 12:11 equiv_col
-rw-r--r-- 1 mcc users 4 Jun 6 12:11 instance
-rw-r--r-- 1 mcc users 6 Jun 6 12:11 iscolored
-rw-r--r-- 1 mcc users 3.7M Jun 6 12:11 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 1654759703955

Running Version 0
[2022-06-09 07:28:25] [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-06-09 07:28:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-09 07:28:25] [INFO ] Load time of PNML (sax parser for PT used): 373 ms
[2022-06-09 07:28:25] [INFO ] Transformed 568 places.
[2022-06-09 07:28:25] [INFO ] Transformed 8320 transitions.
[2022-06-09 07:28:25] [INFO ] Parsed PT model containing 568 places and 8320 transitions in 450 ms.
Parsed 1 properties from file /home/mcc/execution/ReachabilityDeadlock.xml in 4 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 260 places in 31 ms
Reduce places removed 260 places and 256 transitions.
Built sparse matrix representations for Structural reductions in 13 ms.29365KB memory used
Starting structural reductions, iteration 0 : 308/308 places, 8064/8064 transitions.
Graph (complete) has 12652 edges and 308 vertex of which 306 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.50 ms
Discarding 2 places :
Also discarding 0 output transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 305 transition count 7936
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 305 transition count 7936
Applied a total of 3 rules in 626 ms. Remains 305 /308 variables (removed 3) and now considering 7936/8064 (removed 128) transitions.
Finished structural reductions, in 1 iterations. Remains : 305/308 places, 7936/8064 transitions.
Random walk for 1250001 steps, including 0 resets, run took 3015 ms (no deadlock found). (steps per millisecond=414 )
Random directed walk for 1250002 steps, including 0 resets, run took 3085 ms (no deadlock found). (steps per millisecond=405 )
[2022-06-09 07:28:32] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-09 07:28:32] [INFO ] Computed 1 place invariants in 45 ms
[2022-06-09 07:28:33] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 9 ms returned sat
[2022-06-09 07:28:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 07:28:34] [INFO ] [Real]Absence check using state equation in 491 ms returned sat
[2022-06-09 07:28:34] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 07:28:35] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 5 ms returned sat
[2022-06-09 07:28:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 07:28:35] [INFO ] [Nat]Absence check using state equation in 687 ms returned sat
[2022-06-09 07:28:35] [INFO ] State equation strengthened by 188 read => feed constraints.
[2022-06-09 07:28:39] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-09 07:28:42] [INFO ] [Nat]Added 188 Read/Feed constraints in 6321 ms returned unknown
Random directed walk for 500003 steps, including 0 resets, run took 2499 ms (no deadlock found). (steps per millisecond=200 )
Random walk for 500000 steps, including 0 resets, run took 784 ms (no deadlock found). (steps per millisecond=637 )
Random directed walk for 500000 steps, including 0 resets, run took 1233 ms (no deadlock found). (steps per millisecond=405 )
Random walk for 500000 steps, including 0 resets, run took 757 ms (no deadlock found). (steps per millisecond=660 )
Starting structural reductions, iteration 0 : 305/305 places, 7936/7936 transitions.
Applied a total of 0 rules in 264 ms. Remains 305 /305 variables (removed 0) and now considering 7936/7936 (removed 0) transitions.
[2022-06-09 07:28:47] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-09 07:28:47] [INFO ] Computed 1 place invariants in 29 ms
[2022-06-09 07:28:48] [INFO ] Implicit Places using invariants in 522 ms returned []
[2022-06-09 07:28:48] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-09 07:28:48] [INFO ] Computed 1 place invariants in 26 ms
[2022-06-09 07:28:48] [INFO ] State equation strengthened by 188 read => feed constraints.
[2022-06-09 07:28:49] [INFO ] Implicit Places using invariants and state equation in 989 ms returned []
Implicit Place search using SMT with State Equation took 1515 ms to find 0 implicit places.
[2022-06-09 07:28:50] [INFO ] Redundant transitions in 1070 ms returned []
[2022-06-09 07:28:50] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-09 07:28:50] [INFO ] Computed 1 place invariants in 22 ms
[2022-06-09 07:28:52] [INFO ] Dead Transitions using invariants and state equation in 1975 ms returned []
Finished structural reductions, in 1 iterations. Remains : 305/305 places, 7936/7936 transitions.
Random walk for 1250000 steps, including 0 resets, run took 1893 ms (no deadlock found). (steps per millisecond=660 )
Random directed walk for 1250000 steps, including 0 resets, run took 3063 ms (no deadlock found). (steps per millisecond=408 )
[2022-06-09 07:28:57] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-09 07:28:57] [INFO ] Computed 1 place invariants in 19 ms
[2022-06-09 07:28:57] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 5 ms returned sat
[2022-06-09 07:28:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 07:28:58] [INFO ] [Real]Absence check using state equation in 482 ms returned sat
[2022-06-09 07:28:58] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 07:28:59] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 4 ms returned sat
[2022-06-09 07:28:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 07:28:59] [INFO ] [Nat]Absence check using state equation in 634 ms returned sat
[2022-06-09 07:28:59] [INFO ] State equation strengthened by 188 read => feed constraints.
[2022-06-09 07:29:03] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-09 07:29:06] [INFO ] [Nat]Added 188 Read/Feed constraints in 6325 ms returned unknown
Random directed walk for 500001 steps, including 0 resets, run took 1311 ms (no deadlock found). (steps per millisecond=381 )
Random walk for 500000 steps, including 0 resets, run took 768 ms (no deadlock found). (steps per millisecond=651 )
Random directed walk for 500002 steps, including 0 resets, run took 1195 ms (no deadlock found). (steps per millisecond=418 )
Finished random walk after 196 steps, including 0 resets, run found a deadlock after 3 ms. (steps per millisecond=65 )
FORMULA ReachabilityDeadlock TRUE TECHNIQUES TOPOLOGICAL STRUCTURAL_REDUCTION RANDOM_WALK

BK_STOP 1654759750695

--------------------
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="Szymanski-PT-b04"
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 Szymanski-PT-b04, 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 r324-tall-165472294000651"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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