fond
Model Checking Contest 2020
10th edition, Paris, France, June 23, 2020
Execution of r182-oct2-158987914000502
Last Updated
Jun 28, 2020

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

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15745.270 3600000.00 26776.00 78.30 FTFFFFFFFTFFFFTT normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fko/mcc2020-input.r182-oct2-158987914000502.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2020-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 itslola
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 r182-oct2-158987914000502
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 260K
-rw-r--r-- 1 mcc users 3.4K Mar 26 02:50 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K Mar 26 02:50 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 25 22:44 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 25 22:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Apr 8 14:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Apr 8 14:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Mar 25 17:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K Mar 25 17:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 25 14:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 12K Mar 25 14:37 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 25 17:55 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 25 17:55 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 100K Mar 24 05:37 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 1591159924583

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 04:52:07] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-03 04:52:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 04:52:07] [INFO ] Load time of PNML (sax parser for PT used): 107 ms
[2020-06-03 04:52:07] [INFO ] Transformed 386 places.
[2020-06-03 04:52:07] [INFO ] Transformed 360 transitions.
[2020-06-03 04:52:07] [INFO ] Found NUPN structural information;
[2020-06-03 04:52:07] [INFO ] Parsed PT model containing 386 places and 360 transitions in 163 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 56 ms.
Working with output stream class java.io.PrintStream
FORMULA BusinessProcesses-PT-07-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-07-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-07-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 106 resets, run finished after 71 ms. (steps per millisecond=140 ) properties seen :[1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 0, 1]
FORMULA BusinessProcesses-PT-07-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-07-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-07-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-07-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-07-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-07-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-07-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-07-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-07-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-07-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 17 ms. (steps per millisecond=588 ) properties seen :[1, 0, 0]
FORMULA BusinessProcesses-PT-07-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 18 resets, run finished after 28 ms. (steps per millisecond=357 ) properties seen :[0, 0]
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 15 ms. (steps per millisecond=666 ) properties seen :[0, 0]
// Phase 1: matrix 360 rows 386 cols
[2020-06-03 04:52:07] [INFO ] Computed 62 place invariants in 43 ms
[2020-06-03 04:52:07] [INFO ] [Real]Absence check using 33 positive place invariants in 90 ms returned sat
[2020-06-03 04:52:08] [INFO ] [Real]Absence check using 33 positive and 29 generalized place invariants in 40 ms returned sat
[2020-06-03 04:52:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 04:52:08] [INFO ] [Real]Absence check using state equation in 665 ms returned sat
[2020-06-03 04:52:09] [INFO ] Deduced a trap composed of 8 places in 301 ms
[2020-06-03 04:52:10] [INFO ] Deduced a trap composed of 13 places in 1491 ms
[2020-06-03 04:52:10] [INFO ] Deduced a trap composed of 11 places in 228 ms
[2020-06-03 04:52:11] [INFO ] Deduced a trap composed of 35 places in 314 ms
[2020-06-03 04:52:11] [INFO ] Deduced a trap composed of 10 places in 531 ms
[2020-06-03 04:52:11] [INFO ] Deduced a trap composed of 34 places in 125 ms
[2020-06-03 04:52:12] [INFO ] Deduced a trap composed of 15 places in 105 ms
[2020-06-03 04:52:12] [INFO ] Deduced a trap composed of 28 places in 153 ms
[2020-06-03 04:52:12] [INFO ] Deduced a trap composed of 27 places in 54 ms
[2020-06-03 04:52:12] [INFO ] Deduced a trap composed of 22 places in 52 ms
[2020-06-03 04:52:12] [INFO ] Deduced a trap composed of 18 places in 38 ms
[2020-06-03 04:52:12] [INFO ] Deduced a trap composed of 26 places in 79 ms
[2020-06-03 04:52:12] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 3859 ms
[2020-06-03 04:52:12] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 04:52:12] [INFO ] [Nat]Absence check using 33 positive place invariants in 49 ms returned sat
[2020-06-03 04:52:12] [INFO ] [Nat]Absence check using 33 positive and 29 generalized place invariants in 25 ms returned sat
[2020-06-03 04:52:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 04:52:13] [INFO ] [Nat]Absence check using state equation in 631 ms returned sat
[2020-06-03 04:52:14] [INFO ] Deduced a trap composed of 12 places in 1417 ms
[2020-06-03 04:52:15] [INFO ] Deduced a trap composed of 11 places in 309 ms
[2020-06-03 04:52:15] [INFO ] Deduced a trap composed of 8 places in 319 ms
[2020-06-03 04:52:15] [INFO ] Deduced a trap composed of 13 places in 138 ms
[2020-06-03 04:52:16] [INFO ] Deduced a trap composed of 29 places in 908 ms
[2020-06-03 04:52:17] [INFO ] Deduced a trap composed of 12 places in 549 ms
[2020-06-03 04:52:17] [INFO ] Deduced a trap composed of 19 places in 517 ms
[2020-06-03 04:52:17] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s0 s1 s2 s3 s4 s5 s6 s7 s8 s125 s181 s185 s186 s187 s280 s281 s284 s331 s332) 0)") while checking expression at index 0
[2020-06-03 04:52:17] [INFO ] [Real]Absence check using 33 positive place invariants in 45 ms returned sat
[2020-06-03 04:52:17] [INFO ] [Real]Absence check using 33 positive and 29 generalized place invariants in 22 ms returned sat
[2020-06-03 04:52:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 04:52:18] [INFO ] [Real]Absence check using state equation in 688 ms returned sat
[2020-06-03 04:52:18] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 04:52:18] [INFO ] [Nat]Absence check using 33 positive place invariants in 149 ms returned sat
[2020-06-03 04:52:18] [INFO ] [Nat]Absence check using 33 positive and 29 generalized place invariants in 50 ms returned unsat
FORMULA BusinessProcesses-PT-07-ReachabilityCardinality-14 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Support contains 5 out of 386 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 386/386 places, 360/360 transitions.
Graph (trivial) has 210 edges and 386 vertex of which 4 / 386 are part of one of the 1 SCC in 19 ms
Free SCC test removed 3 places
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 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.18 ms
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Performed 82 Post agglomeration using F-continuation condition.Transition count delta: 82
Iterating post reduction 0 with 86 rules applied. Total rules applied 88 place count 381 transition count 273
Reduce places removed 82 places and 0 transitions.
Iterating post reduction 1 with 82 rules applied. Total rules applied 170 place count 299 transition count 273
Performed 56 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 56 Pre rules applied. Total rules applied 170 place count 299 transition count 217
Deduced a syphon composed of 56 places in 1 ms
Ensure Unique test removed 9 places
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 2 with 121 rules applied. Total rules applied 291 place count 234 transition count 217
Symmetric choice reduction at 2 with 43 rule applications. Total rules 334 place count 234 transition count 217
Deduced a syphon composed of 43 places in 1 ms
Reduce places removed 43 places and 43 transitions.
Iterating global reduction 2 with 86 rules applied. Total rules applied 420 place count 191 transition count 174
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 420 place count 191 transition count 168
Deduced a syphon composed of 6 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 13 rules applied. Total rules applied 433 place count 184 transition count 168
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: 59
Deduced a syphon composed of 59 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 61 places and 0 transitions.
Iterating global reduction 2 with 120 rules applied. Total rules applied 553 place count 123 transition count 109
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 555 place count 122 transition count 112
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 557 place count 122 transition count 110
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 559 place count 120 transition count 110
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 560 place count 120 transition count 110
Applied a total of 560 rules in 104 ms. Remains 120 /386 variables (removed 266) and now considering 110/360 (removed 250) transitions.
Finished structural reductions, in 1 iterations. Remains : 120/386 places, 110/360 transitions.
Finished random walk after 3413 steps, including 178 resets, run visited all 1 properties in 11 ms. (steps per millisecond=310 )
FORMULA BusinessProcesses-PT-07-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.

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

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="itslola"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# 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 itslola"
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 r182-oct2-158987914000502"
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 ;