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

About the Execution of 2021-gold for LeafsetExtension-PT-S08C2

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
254.728 5379.00 12528.00 215.20 FTTTFTTTFFFTTTFT 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.r143-tall-165271830300170.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 LeafsetExtension-PT-S08C2, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r143-tall-165271830300170
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 9.9K Apr 29 12:41 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K Apr 29 12:41 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 29 12:40 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K Apr 29 12:40 CTLFireability.xml
-rw-r--r-- 1 mcc users 6.4K May 9 08:11 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 9 08:11 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.1K May 9 08:11 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 9 08:11 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 29 12:41 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 69K Apr 29 12:41 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 19K Apr 29 12:41 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 92K Apr 29 12:41 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.2K May 9 08:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.2K May 9 08:11 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 6 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 647K 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 LeafsetExtension-PT-S08C2-ReachabilityCardinality-00
FORMULA_NAME LeafsetExtension-PT-S08C2-ReachabilityCardinality-01
FORMULA_NAME LeafsetExtension-PT-S08C2-ReachabilityCardinality-02
FORMULA_NAME LeafsetExtension-PT-S08C2-ReachabilityCardinality-03
FORMULA_NAME LeafsetExtension-PT-S08C2-ReachabilityCardinality-04
FORMULA_NAME LeafsetExtension-PT-S08C2-ReachabilityCardinality-05
FORMULA_NAME LeafsetExtension-PT-S08C2-ReachabilityCardinality-06
FORMULA_NAME LeafsetExtension-PT-S08C2-ReachabilityCardinality-07
FORMULA_NAME LeafsetExtension-PT-S08C2-ReachabilityCardinality-08
FORMULA_NAME LeafsetExtension-PT-S08C2-ReachabilityCardinality-09
FORMULA_NAME LeafsetExtension-PT-S08C2-ReachabilityCardinality-10
FORMULA_NAME LeafsetExtension-PT-S08C2-ReachabilityCardinality-11
FORMULA_NAME LeafsetExtension-PT-S08C2-ReachabilityCardinality-12
FORMULA_NAME LeafsetExtension-PT-S08C2-ReachabilityCardinality-13
FORMULA_NAME LeafsetExtension-PT-S08C2-ReachabilityCardinality-14
FORMULA_NAME LeafsetExtension-PT-S08C2-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1655069141937

Running Version 0
[2022-06-12 21:25:43] [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:25:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-12 21:25:43] [INFO ] Load time of PNML (sax parser for PT used): 96 ms
[2022-06-12 21:25:43] [INFO ] Transformed 462 places.
[2022-06-12 21:25:43] [INFO ] Transformed 409 transitions.
[2022-06-12 21:25:43] [INFO ] Parsed PT model containing 462 places and 409 transitions in 149 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 540 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 16) seen :4
FORMULA LeafsetExtension-PT-S08C2-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S08C2-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S08C2-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S08C2-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 115 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 116 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 119 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 115 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 115 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 115 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 114 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 114 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 115 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 116 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 131 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 114 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 409 rows 462 cols
[2022-06-12 21:25:44] [INFO ] Computed 53 place invariants in 48 ms
[2022-06-12 21:25:44] [INFO ] [Real]Absence check using 11 positive place invariants in 13 ms returned sat
[2022-06-12 21:25:44] [INFO ] [Real]Absence check using 11 positive and 42 generalized place invariants in 8 ms returned unsat
[2022-06-12 21:25:44] [INFO ] [Real]Absence check using 11 positive place invariants in 13 ms returned sat
[2022-06-12 21:25:44] [INFO ] [Real]Absence check using 11 positive and 42 generalized place invariants in 20 ms returned sat
[2022-06-12 21:25:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:25:44] [INFO ] [Real]Absence check using state equation in 170 ms returned sat
[2022-06-12 21:25:44] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:25:44] [INFO ] [Nat]Absence check using 11 positive place invariants in 6 ms returned sat
[2022-06-12 21:25:44] [INFO ] [Nat]Absence check using 11 positive and 42 generalized place invariants in 17 ms returned sat
[2022-06-12 21:25:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:25:44] [INFO ] [Nat]Absence check using state equation in 129 ms returned sat
[2022-06-12 21:25:45] [INFO ] Deduced a trap composed of 69 places in 172 ms of which 3 ms to minimize.
[2022-06-12 21:25:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 247 ms
[2022-06-12 21:25:45] [INFO ] Computed and/alt/rep : 398/600/398 causal constraints (skipped 2 transitions) in 26 ms.
[2022-06-12 21:25:45] [INFO ] Added : 8 causal constraints over 2 iterations in 121 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 2 ms.
[2022-06-12 21:25:45] [INFO ] [Real]Absence check using 11 positive place invariants in 11 ms returned sat
[2022-06-12 21:25:45] [INFO ] [Real]Absence check using 11 positive and 42 generalized place invariants in 10 ms returned unsat
[2022-06-12 21:25:45] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2022-06-12 21:25:45] [INFO ] [Real]Absence check using 11 positive and 42 generalized place invariants in 4 ms returned unsat
[2022-06-12 21:25:45] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2022-06-12 21:25:45] [INFO ] [Real]Absence check using 11 positive and 42 generalized place invariants in 4 ms returned unsat
[2022-06-12 21:25:45] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2022-06-12 21:25:45] [INFO ] [Real]Absence check using 11 positive and 42 generalized place invariants in 7 ms returned unsat
[2022-06-12 21:25:45] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2022-06-12 21:25:45] [INFO ] [Real]Absence check using 11 positive and 42 generalized place invariants in 12 ms returned unsat
[2022-06-12 21:25:45] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2022-06-12 21:25:45] [INFO ] [Real]Absence check using 11 positive and 42 generalized place invariants in 6 ms returned unsat
[2022-06-12 21:25:45] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2022-06-12 21:25:45] [INFO ] [Real]Absence check using 11 positive and 42 generalized place invariants in 12 ms returned sat
[2022-06-12 21:25:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:25:45] [INFO ] [Real]Absence check using state equation in 99 ms returned sat
[2022-06-12 21:25:45] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:25:45] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2022-06-12 21:25:45] [INFO ] [Nat]Absence check using 11 positive and 42 generalized place invariants in 11 ms returned sat
[2022-06-12 21:25:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:25:46] [INFO ] [Nat]Absence check using state equation in 117 ms returned sat
[2022-06-12 21:25:46] [INFO ] Computed and/alt/rep : 398/600/398 causal constraints (skipped 2 transitions) in 24 ms.
[2022-06-12 21:25:46] [INFO ] Added : 6 causal constraints over 2 iterations in 119 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 1 ms.
[2022-06-12 21:25:46] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2022-06-12 21:25:46] [INFO ] [Real]Absence check using 11 positive and 42 generalized place invariants in 7 ms returned unsat
[2022-06-12 21:25:46] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2022-06-12 21:25:46] [INFO ] [Real]Absence check using 11 positive and 42 generalized place invariants in 7 ms returned unsat
[2022-06-12 21:25:46] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2022-06-12 21:25:46] [INFO ] [Real]Absence check using 11 positive and 42 generalized place invariants in 7 ms returned unsat
FORMULA LeafsetExtension-PT-S08C2-ReachabilityCardinality-15 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA LeafsetExtension-PT-S08C2-ReachabilityCardinality-14 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA LeafsetExtension-PT-S08C2-ReachabilityCardinality-13 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA LeafsetExtension-PT-S08C2-ReachabilityCardinality-10 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA LeafsetExtension-PT-S08C2-ReachabilityCardinality-08 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA LeafsetExtension-PT-S08C2-ReachabilityCardinality-07 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA LeafsetExtension-PT-S08C2-ReachabilityCardinality-06 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA LeafsetExtension-PT-S08C2-ReachabilityCardinality-05 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA LeafsetExtension-PT-S08C2-ReachabilityCardinality-03 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA LeafsetExtension-PT-S08C2-ReachabilityCardinality-01 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 12 Parikh solutions to 2 different solutions.
Incomplete Parikh walk after 1000 steps, including 119 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 2) seen :1 could not realise parikh vector
FORMULA LeafsetExtension-PT-S08C2-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Finished Parikh walk after 9 steps, including 1 resets, run visited all 1 properties in 2 ms. (steps per millisecond=4 )
FORMULA LeafsetExtension-PT-S08C2-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
All properties solved without resorting to model-checking.

BK_STOP 1655069147316

--------------------
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="LeafsetExtension-PT-S08C2"
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 LeafsetExtension-PT-S08C2, 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 r143-tall-165271830300170"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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