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

About the Execution of 2021-gold for ClientsAndServers-PT-N0200P0

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
199.716 7363.00 8856.00 1029.70 TTTFFTFFFFTFFFFF 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.r028-tall-165251936400335.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 ClientsAndServers-PT-N0200P0, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r028-tall-165251936400335
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 456K
-rw-r--r-- 1 mcc users 6.5K Apr 29 12:28 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K Apr 29 12:28 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K Apr 29 12:27 CTLFireability.txt
-rw-r--r-- 1 mcc users 38K Apr 29 12:27 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K May 9 07:15 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 9 07:15 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 07:15 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 9 07:15 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 29 12:29 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 112K Apr 29 12:29 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.7K Apr 29 12:28 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 90K Apr 29 12:28 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 9 07:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 9 07:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 8 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 9.2K May 10 09:33 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 ClientsAndServers-PT-N0200P0-ReachabilityCardinality-00
FORMULA_NAME ClientsAndServers-PT-N0200P0-ReachabilityCardinality-01
FORMULA_NAME ClientsAndServers-PT-N0200P0-ReachabilityCardinality-02
FORMULA_NAME ClientsAndServers-PT-N0200P0-ReachabilityCardinality-03
FORMULA_NAME ClientsAndServers-PT-N0200P0-ReachabilityCardinality-04
FORMULA_NAME ClientsAndServers-PT-N0200P0-ReachabilityCardinality-05
FORMULA_NAME ClientsAndServers-PT-N0200P0-ReachabilityCardinality-06
FORMULA_NAME ClientsAndServers-PT-N0200P0-ReachabilityCardinality-07
FORMULA_NAME ClientsAndServers-PT-N0200P0-ReachabilityCardinality-08
FORMULA_NAME ClientsAndServers-PT-N0200P0-ReachabilityCardinality-09
FORMULA_NAME ClientsAndServers-PT-N0200P0-ReachabilityCardinality-10
FORMULA_NAME ClientsAndServers-PT-N0200P0-ReachabilityCardinality-11
FORMULA_NAME ClientsAndServers-PT-N0200P0-ReachabilityCardinality-12
FORMULA_NAME ClientsAndServers-PT-N0200P0-ReachabilityCardinality-13
FORMULA_NAME ClientsAndServers-PT-N0200P0-ReachabilityCardinality-14
FORMULA_NAME ClientsAndServers-PT-N0200P0-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1655087363277

Running Version 0
[2022-06-13 02:29:25] [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-13 02:29:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-13 02:29:25] [INFO ] Load time of PNML (sax parser for PT used): 22 ms
[2022-06-13 02:29:25] [INFO ] Transformed 25 places.
[2022-06-13 02:29:25] [INFO ] Transformed 18 transitions.
[2022-06-13 02:29:25] [INFO ] Parsed PT model containing 25 places and 18 transitions in 59 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 17 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10018 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=715 ) properties (out of 16) seen :4
FORMULA ClientsAndServers-PT-N0200P0-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ClientsAndServers-PT-N0200P0-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ClientsAndServers-PT-N0200P0-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ClientsAndServers-PT-N0200P0-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 176 ms. (steps per millisecond=56 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 12) seen :0
Running SMT prover for 12 properties.
// Phase 1: matrix 18 rows 25 cols
[2022-06-13 02:29:25] [INFO ] Computed 8 place invariants in 7 ms
[2022-06-13 02:29:25] [INFO ] [Real]Absence check using 5 positive place invariants in 11 ms returned unsat
[2022-06-13 02:29:25] [INFO ] [Real]Absence check using 5 positive place invariants in 5 ms returned sat
[2022-06-13 02:29:25] [INFO ] [Real]Absence check using 5 positive and 3 generalized place invariants in 12 ms returned sat
[2022-06-13 02:29:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 02:29:25] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2022-06-13 02:29:25] [INFO ] Solution in real domain found non-integer solution.
[2022-06-13 02:29:25] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2022-06-13 02:29:25] [INFO ] [Nat]Absence check using 5 positive and 3 generalized place invariants in 1 ms returned sat
[2022-06-13 02:29:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-13 02:29:25] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2022-06-13 02:29:25] [INFO ] Computed and/alt/rep : 17/21/17 causal constraints (skipped 0 transitions) in 3 ms.
[2022-06-13 02:29:25] [INFO ] Added : 16 causal constraints over 4 iterations in 42 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 3 ms.
[2022-06-13 02:29:25] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned unsat
[2022-06-13 02:29:25] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned unsat
[2022-06-13 02:29:25] [INFO ] [Real]Absence check using 5 positive place invariants in 5 ms returned unsat
[2022-06-13 02:29:25] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned unsat
[2022-06-13 02:29:25] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-06-13 02:29:25] [INFO ] [Real]Absence check using 5 positive and 3 generalized place invariants in 4 ms returned sat
[2022-06-13 02:29:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 02:29:25] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2022-06-13 02:29:25] [INFO ] Computed and/alt/rep : 17/21/17 causal constraints (skipped 0 transitions) in 2 ms.
[2022-06-13 02:29:26] [INFO ] Added : 9 causal constraints over 2 iterations in 14 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 1 ms.
[2022-06-13 02:29:26] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned unsat
[2022-06-13 02:29:26] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2022-06-13 02:29:26] [INFO ] [Real]Absence check using 5 positive and 3 generalized place invariants in 6 ms returned sat
[2022-06-13 02:29:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 02:29:26] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2022-06-13 02:29:26] [INFO ] Solution in real domain found non-integer solution.
[2022-06-13 02:29:26] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-06-13 02:29:26] [INFO ] [Nat]Absence check using 5 positive and 3 generalized place invariants in 1 ms returned sat
[2022-06-13 02:29:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-13 02:29:26] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2022-06-13 02:29:26] [INFO ] Computed and/alt/rep : 17/21/17 causal constraints (skipped 0 transitions) in 2 ms.
[2022-06-13 02:29:26] [INFO ] Added : 12 causal constraints over 3 iterations in 14 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 1 ms.
[2022-06-13 02:29:26] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-06-13 02:29:26] [INFO ] [Real]Absence check using 5 positive and 3 generalized place invariants in 4 ms returned sat
[2022-06-13 02:29:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 02:29:26] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2022-06-13 02:29:26] [INFO ] Computed and/alt/rep : 17/21/17 causal constraints (skipped 0 transitions) in 1 ms.
[2022-06-13 02:29:26] [INFO ] Solution in real domain found non-integer solution.
[2022-06-13 02:29:26] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-06-13 02:29:26] [INFO ] [Nat]Absence check using 5 positive and 3 generalized place invariants in 0 ms returned sat
[2022-06-13 02:29:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-13 02:29:26] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2022-06-13 02:29:26] [INFO ] Computed and/alt/rep : 17/21/17 causal constraints (skipped 0 transitions) in 1 ms.
[2022-06-13 02:29:26] [INFO ] Added : 9 causal constraints over 2 iterations in 8 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 1 ms.
[2022-06-13 02:29:26] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned unsat
[2022-06-13 02:29:26] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-06-13 02:29:26] [INFO ] [Real]Absence check using 5 positive and 3 generalized place invariants in 0 ms returned unsat
FORMULA ClientsAndServers-PT-N0200P0-ReachabilityCardinality-14 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ClientsAndServers-PT-N0200P0-ReachabilityCardinality-13 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ClientsAndServers-PT-N0200P0-ReachabilityCardinality-09 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ClientsAndServers-PT-N0200P0-ReachabilityCardinality-07 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ClientsAndServers-PT-N0200P0-ReachabilityCardinality-06 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ClientsAndServers-PT-N0200P0-ReachabilityCardinality-05 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ClientsAndServers-PT-N0200P0-ReachabilityCardinality-03 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ClientsAndServers-PT-N0200P0-ReachabilityCardinality-00 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 12 Parikh solutions to 4 different solutions.
Finished Parikh walk after 9829 steps, including 0 resets, run visited all 4 properties in 44 ms. (steps per millisecond=223 )
FORMULA ClientsAndServers-PT-N0200P0-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ClientsAndServers-PT-N0200P0-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ClientsAndServers-PT-N0200P0-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ClientsAndServers-PT-N0200P0-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
All properties solved without resorting to model-checking.

BK_STOP 1655087370640

--------------------
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="ClientsAndServers-PT-N0200P0"
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 ClientsAndServers-PT-N0200P0, 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 r028-tall-165251936400335"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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