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

About the Execution of 2021-gold for Sudoku-COL-AN11

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
282.367 7347.00 13057.00 374.40 FFTFFTFFTTTFTTFF 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.r269-tall-165303553200047.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 Sudoku-COL-AN11, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r269-tall-165303553200047
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 416K
-rw-r--r-- 1 mcc users 7.1K Apr 30 12:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K Apr 30 12:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Apr 30 12:12 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Apr 30 12:12 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K May 9 09:11 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 9 09:11 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 09:11 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 09:11 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.7K Apr 30 13:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 96K Apr 30 13:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Apr 30 12:49 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 56K Apr 30 12:49 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 09:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 9 09:11 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:34 equiv_pt
-rw-r--r-- 1 mcc users 5 May 10 09:34 instance
-rw-r--r-- 1 mcc users 5 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 6.5K May 10 09:34 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 Sudoku-COL-AN11-ReachabilityCardinality-00
FORMULA_NAME Sudoku-COL-AN11-ReachabilityCardinality-01
FORMULA_NAME Sudoku-COL-AN11-ReachabilityCardinality-02
FORMULA_NAME Sudoku-COL-AN11-ReachabilityCardinality-03
FORMULA_NAME Sudoku-COL-AN11-ReachabilityCardinality-04
FORMULA_NAME Sudoku-COL-AN11-ReachabilityCardinality-05
FORMULA_NAME Sudoku-COL-AN11-ReachabilityCardinality-06
FORMULA_NAME Sudoku-COL-AN11-ReachabilityCardinality-07
FORMULA_NAME Sudoku-COL-AN11-ReachabilityCardinality-08
FORMULA_NAME Sudoku-COL-AN11-ReachabilityCardinality-09
FORMULA_NAME Sudoku-COL-AN11-ReachabilityCardinality-10
FORMULA_NAME Sudoku-COL-AN11-ReachabilityCardinality-11
FORMULA_NAME Sudoku-COL-AN11-ReachabilityCardinality-12
FORMULA_NAME Sudoku-COL-AN11-ReachabilityCardinality-13
FORMULA_NAME Sudoku-COL-AN11-ReachabilityCardinality-14
FORMULA_NAME Sudoku-COL-AN11-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1655068555181

Running Version 0
[2022-06-12 21:15:56] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -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, 3600]
[2022-06-12 21:15:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-12 21:15:56] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
[2022-06-12 21:15:56] [WARNING] Using fallBack plugin, rng conformance not checked
[2022-06-12 21:15:57] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 457 ms
[2022-06-12 21:15:57] [WARNING] Unknown color function,Tuple skipping symmetry detection on parameters for transition select
[2022-06-12 21:15:57] [INFO ] Imported 4 HL places and 1 HL transitions for a total of 1694 PT places and 1331.0 transition bindings in 22 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 18 ms.
Working with output stream class java.io.PrintStream
[2022-06-12 21:15:57] [INFO ] Built PT skeleton of HLPN with 4 places and 1 transitions in 7 ms.
[2022-06-12 21:15:57] [INFO ] Skeletonized HLPN properties in 0 ms.
Successfully produced net in file /tmp/petri1000_16855856823390852492.dot
Incomplete random walk after 100000 steps, including 813 resets, run finished after 66 ms. (steps per millisecond=1515 ) properties (out of 16) seen :8
Running SMT prover for 8 properties.
// Phase 1: matrix 1 rows 4 cols
[2022-06-12 21:15:57] [INFO ] Computed 3 place invariants in 3 ms
[2022-06-12 21:15:57] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned unsat
[2022-06-12 21:15:57] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned unsat
[2022-06-12 21:15:57] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned unsat
[2022-06-12 21:15:57] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned unsat
[2022-06-12 21:15:57] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned unsat
[2022-06-12 21:15:57] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-12 21:15:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:15:57] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2022-06-12 21:15:57] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:15:57] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-12 21:15:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:15:57] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2022-06-12 21:15:57] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 0 ms.
[2022-06-12 21:15:57] [INFO ] Added : 0 causal constraints over 0 iterations in 4 ms. Result :sat
[2022-06-12 21:15:57] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned unsat
Successfully simplified 7 atomic propositions for a total of 7 simplifications.
FORMULA Sudoku-COL-AN11-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN11-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN11-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN11-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN11-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN11-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN11-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2022-06-12 21:15:57] [INFO ] Flatten gal took : 13 ms
[2022-06-12 21:15:57] [INFO ] Flatten gal took : 1 ms
[2022-06-12 21:15:57] [INFO ] Unfolded HLPN to a Petri net with 1694 places and 1331 transitions in 32 ms.
[2022-06-12 21:15:57] [INFO ] Unfolded HLPN properties in 6 ms.
Successfully produced net in file /tmp/petri1001_17335499174725529050.dot
Incomplete random walk after 10000 steps, including 94 resets, run finished after 996 ms. (steps per millisecond=10 ) properties (out of 9) seen :8
FORMULA Sudoku-COL-AN11-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Sudoku-COL-AN11-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Sudoku-COL-AN11-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Sudoku-COL-AN11-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Sudoku-COL-AN11-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Sudoku-COL-AN11-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Sudoku-COL-AN11-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Sudoku-COL-AN11-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 116 ms. (steps per millisecond=86 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1331 rows 1694 cols
[2022-06-12 21:15:58] [INFO ] Computed 363 place invariants in 32 ms
[2022-06-12 21:15:59] [INFO ] [Real]Absence check using 363 positive place invariants in 859 ms returned sat
[2022-06-12 21:15:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:16:00] [INFO ] [Real]Absence check using state equation in 726 ms returned sat
[2022-06-12 21:16:00] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 54 ms.
[2022-06-12 21:16:01] [INFO ] Added : 0 causal constraints over 0 iterations in 209 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 7 ms.
Finished Parikh walk after 117 steps, including 1 resets, run visited all 1 properties in 8 ms. (steps per millisecond=14 )
FORMULA Sudoku-COL-AN11-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
All properties solved without resorting to model-checking.

BK_STOP 1655068562528

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution ReachabilityCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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 ReachabilityCardinality -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 3600 -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="Sudoku-COL-AN11"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="gold2021"
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 gold2021"
echo " Input is Sudoku-COL-AN11, 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 r269-tall-165303553200047"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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