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

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

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
247.903 9450.00 20607.00 55.50 FTTTTTTTFFTTTTTF 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-165251918500423.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-13, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r024-tall-165251918500423
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 576K
-rw-r--r-- 1 mcc users 6.3K Apr 29 23:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K Apr 29 23:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Apr 29 23:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Apr 29 23:57 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.6K May 9 07:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 9 07:10 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 07:10 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 07:10 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 29 23:59 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 110K Apr 29 23:59 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.6K Apr 29 23:59 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 65K Apr 29 23:59 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 07:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 9 07:10 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 148K 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-13-ReachabilityFireability-00
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityFireability-01
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityFireability-02
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityFireability-03
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityFireability-04
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityFireability-05
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityFireability-06
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityFireability-07
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityFireability-08
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityFireability-09
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityFireability-10
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityFireability-11
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityFireability-12
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityFireability-13
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityFireability-14
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1654200713689

Running Version 202205111006
[2022-06-02 20:11:54] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -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:11:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-02 20:11:55] [INFO ] Load time of PNML (sax parser for PT used): 120 ms
[2022-06-02 20:11:55] [INFO ] Transformed 593 places.
[2022-06-02 20:11:55] [INFO ] Transformed 536 transitions.
[2022-06-02 20:11:55] [INFO ] Found NUPN structural information;
[2022-06-02 20:11:55] [INFO ] Parsed PT model containing 593 places and 536 transitions in 245 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 13 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 8 places in 13 ms
Reduce places removed 8 places and 8 transitions.
Incomplete random walk after 10000 steps, including 73 resets, run finished after 562 ms. (steps per millisecond=17 ) properties (out of 16) seen :4
FORMULA BusinessProcesses-PT-13-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-13-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-13-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-13-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 12 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 12) seen :3
FORMULA BusinessProcesses-PT-13-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-13-ReachabilityFireability-08 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-13-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 9) seen :1
FORMULA BusinessProcesses-PT-13-ReachabilityFireability-09 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 8) seen :1
FORMULA BusinessProcesses-PT-13-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 528 rows 585 cols
[2022-06-02 20:11:56] [INFO ] Computed 95 place invariants in 29 ms
[2022-06-02 20:11:57] [INFO ] After 372ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2022-06-02 20:11:57] [INFO ] [Nat]Absence check using 57 positive place invariants in 22 ms returned sat
[2022-06-02 20:11:57] [INFO ] [Nat]Absence check using 57 positive and 38 generalized place invariants in 12 ms returned sat
[2022-06-02 20:11:57] [INFO ] After 414ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :5
[2022-06-02 20:11:57] [INFO ] Deduced a trap composed of 18 places in 127 ms of which 5 ms to minimize.
[2022-06-02 20:11:58] [INFO ] Deduced a trap composed of 11 places in 94 ms of which 1 ms to minimize.
[2022-06-02 20:11:58] [INFO ] Deduced a trap composed of 16 places in 113 ms of which 1 ms to minimize.
[2022-06-02 20:11:58] [INFO ] Deduced a trap composed of 8 places in 111 ms of which 1 ms to minimize.
[2022-06-02 20:11:58] [INFO ] Deduced a trap composed of 19 places in 121 ms of which 1 ms to minimize.
[2022-06-02 20:11:58] [INFO ] Deduced a trap composed of 66 places in 91 ms of which 0 ms to minimize.
[2022-06-02 20:11:58] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 827 ms
[2022-06-02 20:11:58] [INFO ] Deduced a trap composed of 21 places in 125 ms of which 0 ms to minimize.
[2022-06-02 20:11:58] [INFO ] Deduced a trap composed of 16 places in 104 ms of which 2 ms to minimize.
[2022-06-02 20:11:59] [INFO ] Deduced a trap composed of 21 places in 98 ms of which 1 ms to minimize.
[2022-06-02 20:11:59] [INFO ] Deduced a trap composed of 16 places in 96 ms of which 0 ms to minimize.
[2022-06-02 20:11:59] [INFO ] Deduced a trap composed of 37 places in 101 ms of which 0 ms to minimize.
[2022-06-02 20:11:59] [INFO ] Deduced a trap composed of 21 places in 98 ms of which 1 ms to minimize.
[2022-06-02 20:11:59] [INFO ] Deduced a trap composed of 19 places in 93 ms of which 0 ms to minimize.
[2022-06-02 20:11:59] [INFO ] Deduced a trap composed of 32 places in 79 ms of which 1 ms to minimize.
[2022-06-02 20:11:59] [INFO ] Deduced a trap composed of 23 places in 71 ms of which 1 ms to minimize.
[2022-06-02 20:11:59] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1121 ms
[2022-06-02 20:11:59] [INFO ] After 2597ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :5
Attempting to minimize the solution found.
Minimization took 181 ms.
[2022-06-02 20:12:00] [INFO ] After 3099ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :5
FORMULA BusinessProcesses-PT-13-ReachabilityFireability-15 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-13-ReachabilityFireability-00 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 7 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 2704 ms.
Support contains 9 out of 585 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 585/585 places, 528/528 transitions.
Graph (trivial) has 328 edges and 585 vertex of which 7 / 585 are part of one of the 1 SCC in 8 ms
Free SCC test removed 6 places
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1189 edges and 579 vertex of which 573 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.7 ms
Discarding 6 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 127 transitions
Trivial Post-agglo rules discarded 127 transitions
Performed 127 trivial Post agglomeration. Transition count delta: 127
Iterating post reduction 0 with 127 rules applied. Total rules applied 129 place count 573 transition count 392
Reduce places removed 127 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 130 rules applied. Total rules applied 259 place count 446 transition count 389
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 262 place count 443 transition count 389
Performed 85 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 85 Pre rules applied. Total rules applied 262 place count 443 transition count 304
Deduced a syphon composed of 85 places in 1 ms
Ensure Unique test removed 14 places
Reduce places removed 99 places and 0 transitions.
Iterating global reduction 3 with 184 rules applied. Total rules applied 446 place count 344 transition count 304
Discarding 75 places :
Symmetric choice reduction at 3 with 75 rule applications. Total rules 521 place count 269 transition count 229
Iterating global reduction 3 with 75 rules applied. Total rules applied 596 place count 269 transition count 229
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 596 place count 269 transition count 222
Deduced a syphon composed of 7 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 612 place count 260 transition count 222
Performed 87 Post agglomeration using F-continuation condition.Transition count delta: 87
Deduced a syphon composed of 87 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 3 with 176 rules applied. Total rules applied 788 place count 171 transition count 135
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 790 place count 170 transition count 139
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 792 place count 170 transition count 137
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 794 place count 168 transition count 137
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 795 place count 168 transition count 137
Applied a total of 795 rules in 153 ms. Remains 168 /585 variables (removed 417) and now considering 137/528 (removed 391) transitions.
Finished structural reductions, in 1 iterations. Remains : 168/585 places, 137/528 transitions.
Finished random walk after 596 steps, including 23 resets, run visited all 5 properties in 12 ms. (steps per millisecond=49 )
FORMULA BusinessProcesses-PT-13-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-13-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-13-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-13-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-13-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 8088 ms.

BK_STOP 1654200723139

--------------------
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
+ [[ ReachabilityFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution ReachabilityFireability -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 ReachabilityFireability -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-13"
export BK_EXAMINATION="ReachabilityFireability"
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-13, examination is ReachabilityFireability"
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-165251918500423"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BusinessProcesses-PT-13.tgz
mv BusinessProcesses-PT-13 execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "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 [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "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 "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.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 '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
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 ;