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

About the Execution of ITS-Tools for BusinessProcesses-PT-07

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
234.207 5372.00 12747.00 46.20 FFTFFFTFTFTTFTTF 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.r024-tall-165251918400374.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 itstools
Input is BusinessProcesses-PT-07, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r024-tall-165251918400374
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 648K
-rw-r--r-- 1 mcc users 6.0K Apr 30 00:02 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K Apr 30 00:02 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Apr 30 00:01 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Apr 30 00:01 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K May 9 07:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 9 07:09 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 07:09 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 07:09 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K Apr 30 00:03 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 193K Apr 30 00:03 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 10K Apr 30 00:02 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 92K Apr 30 00:02 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 07:09 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 07:09 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 3 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 100K 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 BusinessProcesses-PT-07-ReachabilityCardinality-00
FORMULA_NAME BusinessProcesses-PT-07-ReachabilityCardinality-01
FORMULA_NAME BusinessProcesses-PT-07-ReachabilityCardinality-02
FORMULA_NAME BusinessProcesses-PT-07-ReachabilityCardinality-03
FORMULA_NAME BusinessProcesses-PT-07-ReachabilityCardinality-04
FORMULA_NAME BusinessProcesses-PT-07-ReachabilityCardinality-05
FORMULA_NAME BusinessProcesses-PT-07-ReachabilityCardinality-06
FORMULA_NAME BusinessProcesses-PT-07-ReachabilityCardinality-07
FORMULA_NAME BusinessProcesses-PT-07-ReachabilityCardinality-08
FORMULA_NAME BusinessProcesses-PT-07-ReachabilityCardinality-09
FORMULA_NAME BusinessProcesses-PT-07-ReachabilityCardinality-10
FORMULA_NAME BusinessProcesses-PT-07-ReachabilityCardinality-11
FORMULA_NAME BusinessProcesses-PT-07-ReachabilityCardinality-12
FORMULA_NAME BusinessProcesses-PT-07-ReachabilityCardinality-13
FORMULA_NAME BusinessProcesses-PT-07-ReachabilityCardinality-14
FORMULA_NAME BusinessProcesses-PT-07-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1654200511814

Running Version 202205111006
[2022-06-02 20:08:33] [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-02 20:08:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-02 20:08:33] [INFO ] Load time of PNML (sax parser for PT used): 107 ms
[2022-06-02 20:08:33] [INFO ] Transformed 386 places.
[2022-06-02 20:08:33] [INFO ] Transformed 360 transitions.
[2022-06-02 20:08:33] [INFO ] Found NUPN structural information;
[2022-06-02 20:08:33] [INFO ] Parsed PT model containing 386 places and 360 transitions in 230 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 25 ms.
Working with output stream class java.io.PrintStream
FORMULA BusinessProcesses-PT-07-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-07-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-07-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-07-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 108 resets, run finished after 524 ms. (steps per millisecond=19 ) properties (out of 12) seen :6
FORMULA BusinessProcesses-PT-07-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-07-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-07-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-07-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-07-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-07-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 18 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 360 rows 386 cols
[2022-06-02 20:08:34] [INFO ] Computed 62 place invariants in 22 ms
[2022-06-02 20:08:34] [INFO ] After 293ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2022-06-02 20:08:34] [INFO ] [Nat]Absence check using 33 positive place invariants in 13 ms returned sat
[2022-06-02 20:08:34] [INFO ] [Nat]Absence check using 33 positive and 29 generalized place invariants in 12 ms returned sat
[2022-06-02 20:08:35] [INFO ] After 268ms SMT Verify possible using state equation in natural domain returned unsat :5 sat :1
[2022-06-02 20:08:35] [INFO ] Deduced a trap composed of 17 places in 107 ms of which 7 ms to minimize.
[2022-06-02 20:08:35] [INFO ] Deduced a trap composed of 15 places in 68 ms of which 1 ms to minimize.
[2022-06-02 20:08:35] [INFO ] Deduced a trap composed of 25 places in 45 ms of which 1 ms to minimize.
[2022-06-02 20:08:35] [INFO ] Deduced a trap composed of 26 places in 40 ms of which 2 ms to minimize.
[2022-06-02 20:08:35] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 0 ms to minimize.
[2022-06-02 20:08:35] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 1 ms to minimize.
[2022-06-02 20:08:35] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 558 ms
[2022-06-02 20:08:35] [INFO ] After 959ms SMT Verify possible using trap constraints in natural domain returned unsat :5 sat :1
Attempting to minimize the solution found.
Minimization took 173 ms.
[2022-06-02 20:08:36] [INFO ] After 1314ms SMT Verify possible using all constraints in natural domain returned unsat :5 sat :1
FORMULA BusinessProcesses-PT-07-ReachabilityCardinality-14 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-07-ReachabilityCardinality-13 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-07-ReachabilityCardinality-10 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-07-ReachabilityCardinality-06 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-07-ReachabilityCardinality-02 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 6 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 54 ms.
Support contains 52 out of 386 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 386/386 places, 360/360 transitions.
Graph (trivial) has 159 edges and 386 vertex of which 4 / 386 are part of one of the 1 SCC in 6 ms
Free SCC test removed 3 places
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 809 edges and 383 vertex of which 381 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 54 transitions
Trivial Post-agglo rules discarded 54 transitions
Performed 54 trivial Post agglomeration. Transition count delta: 54
Iterating post reduction 0 with 54 rules applied. Total rules applied 56 place count 381 transition count 301
Reduce places removed 54 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 60 rules applied. Total rules applied 116 place count 327 transition count 295
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 122 place count 321 transition count 295
Performed 46 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 46 Pre rules applied. Total rules applied 122 place count 321 transition count 249
Deduced a syphon composed of 46 places in 2 ms
Ensure Unique test removed 5 places
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 3 with 97 rules applied. Total rules applied 219 place count 270 transition count 249
Discarding 31 places :
Symmetric choice reduction at 3 with 31 rule applications. Total rules 250 place count 239 transition count 218
Iterating global reduction 3 with 31 rules applied. Total rules applied 281 place count 239 transition count 218
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 281 place count 239 transition count 216
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 285 place count 237 transition count 216
Performed 45 Post agglomeration using F-continuation condition.Transition count delta: 45
Deduced a syphon composed of 45 places in 0 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 3 with 90 rules applied. Total rules applied 375 place count 192 transition count 171
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 377 place count 191 transition count 174
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 378 place count 191 transition count 173
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 379 place count 190 transition count 173
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 380 place count 190 transition count 173
Partial Post-agglomeration rule applied 7 times.
Drop transitions removed 7 transitions
Iterating global reduction 4 with 7 rules applied. Total rules applied 387 place count 190 transition count 173
Applied a total of 387 rules in 126 ms. Remains 190 /386 variables (removed 196) and now considering 173/360 (removed 187) transitions.
Finished structural reductions, in 1 iterations. Remains : 190/386 places, 173/360 transitions.
Finished random walk after 346028 steps, including 6863 resets, run visited all 1 properties in 859 ms. (steps per millisecond=402 )
FORMULA BusinessProcesses-PT-07-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 4109 ms.

BK_STOP 1654200517186

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

+ export LANG=C
+ LANG=C
+ 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
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -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=@none -Xss128m -Xms40m -Xmx8192m

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="BusinessProcesses-PT-07"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="itstools"
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 itstools"
echo " Input is BusinessProcesses-PT-07, 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 r024-tall-165251918400374"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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