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

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

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15743.820 3600000.00 47936.00 130.90 FFFTFFTFFFTFTTFF 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-158987913900470.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-03, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r182-oct2-158987913900470
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 236K
-rw-r--r-- 1 mcc users 3.3K Mar 26 02:50 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K Mar 26 02:50 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Mar 25 22:43 CTLFireability.txt
-rw-r--r-- 1 mcc users 20K Mar 25 22:43 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 2.9K Apr 8 14:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 19K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 8 14:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Mar 25 17:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 21K 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.7K 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 63K 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-03-ReachabilityCardinality-00
FORMULA_NAME BusinessProcesses-PT-03-ReachabilityCardinality-01
FORMULA_NAME BusinessProcesses-PT-03-ReachabilityCardinality-02
FORMULA_NAME BusinessProcesses-PT-03-ReachabilityCardinality-03
FORMULA_NAME BusinessProcesses-PT-03-ReachabilityCardinality-04
FORMULA_NAME BusinessProcesses-PT-03-ReachabilityCardinality-05
FORMULA_NAME BusinessProcesses-PT-03-ReachabilityCardinality-06
FORMULA_NAME BusinessProcesses-PT-03-ReachabilityCardinality-07
FORMULA_NAME BusinessProcesses-PT-03-ReachabilityCardinality-08
FORMULA_NAME BusinessProcesses-PT-03-ReachabilityCardinality-09
FORMULA_NAME BusinessProcesses-PT-03-ReachabilityCardinality-10
FORMULA_NAME BusinessProcesses-PT-03-ReachabilityCardinality-11
FORMULA_NAME BusinessProcesses-PT-03-ReachabilityCardinality-12
FORMULA_NAME BusinessProcesses-PT-03-ReachabilityCardinality-13
FORMULA_NAME BusinessProcesses-PT-03-ReachabilityCardinality-14
FORMULA_NAME BusinessProcesses-PT-03-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1591156884703

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 04:01:28] [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:01:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 04:01:28] [INFO ] Load time of PNML (sax parser for PT used): 87 ms
[2020-06-03 04:01:28] [INFO ] Transformed 274 places.
[2020-06-03 04:01:28] [INFO ] Transformed 237 transitions.
[2020-06-03 04:01:28] [INFO ] Found NUPN structural information;
[2020-06-03 04:01:28] [INFO ] Parsed PT model containing 274 places and 237 transitions in 207 ms.
Deduced a syphon composed of 1 places in 13 ms
Reduce places removed 1 places and 1 transitions.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 78 ms.
Working with output stream class java.io.PrintStream
FORMULA BusinessProcesses-PT-03-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-03-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-03-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-03-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-03-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-03-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-03-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-03-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-03-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 118 resets, run finished after 83 ms. (steps per millisecond=120 ) properties seen :[0, 1, 0, 0, 0, 0, 0]
FORMULA BusinessProcesses-PT-03-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 33 ms. (steps per millisecond=303 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 24 ms. (steps per millisecond=416 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 22 resets, run finished after 23 ms. (steps per millisecond=434 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties seen :[0, 0, 0, 1, 0, 0]
FORMULA BusinessProcesses-PT-03-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 25 ms. (steps per millisecond=400 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 23 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties seen :[0, 0, 0, 0, 0]
// Phase 1: matrix 236 rows 273 cols
[2020-06-03 04:01:28] [INFO ] Computed 43 place invariants in 27 ms
[2020-06-03 04:01:29] [INFO ] [Real]Absence check using 31 positive place invariants in 93 ms returned sat
[2020-06-03 04:01:29] [INFO ] [Real]Absence check using 31 positive and 12 generalized place invariants in 14 ms returned sat
[2020-06-03 04:01:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 04:01:29] [INFO ] [Real]Absence check using state equation in 296 ms returned sat
[2020-06-03 04:01:29] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 04:01:29] [INFO ] [Nat]Absence check using 31 positive place invariants in 68 ms returned unsat
[2020-06-03 04:01:29] [INFO ] [Real]Absence check using 31 positive place invariants in 25 ms returned sat
[2020-06-03 04:01:29] [INFO ] [Real]Absence check using 31 positive and 12 generalized place invariants in 29 ms returned sat
[2020-06-03 04:01:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 04:01:30] [INFO ] [Real]Absence check using state equation in 294 ms returned sat
[2020-06-03 04:01:30] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 04:01:30] [INFO ] [Nat]Absence check using 31 positive place invariants in 43 ms returned sat
[2020-06-03 04:01:30] [INFO ] [Nat]Absence check using 31 positive and 12 generalized place invariants in 17 ms returned sat
[2020-06-03 04:01:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 04:01:30] [INFO ] [Nat]Absence check using state equation in 303 ms returned sat
[2020-06-03 04:01:30] [INFO ] Deduced a trap composed of 14 places in 438 ms
[2020-06-03 04:01:31] [INFO ] Deduced a trap composed of 12 places in 324 ms
[2020-06-03 04:01:31] [INFO ] Deduced a trap composed of 14 places in 332 ms
[2020-06-03 04:01:31] [INFO ] Deduced a trap composed of 15 places in 143 ms
[2020-06-03 04:01:31] [INFO ] Deduced a trap composed of 33 places in 139 ms
[2020-06-03 04:01:32] [INFO ] Deduced a trap composed of 11 places in 198 ms
[2020-06-03 04:01:35] [INFO ] Deduced a trap composed of 19 places in 2891 ms
[2020-06-03 04:01:35] [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 s9 s10 s50 s53 s54 s153 s154 s155 s242 s243) 0)") while checking expression at index 1
[2020-06-03 04:01:35] [INFO ] [Real]Absence check using 31 positive place invariants in 87 ms returned sat
[2020-06-03 04:01:35] [INFO ] [Real]Absence check using 31 positive and 12 generalized place invariants in 10 ms returned sat
[2020-06-03 04:01:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 04:01:36] [INFO ] [Real]Absence check using state equation in 1156 ms returned sat
[2020-06-03 04:01:36] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 04:01:36] [INFO ] [Nat]Absence check using 31 positive place invariants in 132 ms returned sat
[2020-06-03 04:01:36] [INFO ] [Nat]Absence check using 31 positive and 12 generalized place invariants in 5 ms returned sat
[2020-06-03 04:01:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 04:01:37] [INFO ] [Nat]Absence check using state equation in 1288 ms returned sat
[2020-06-03 04:01:38] [INFO ] Deduced a trap composed of 11 places in 80 ms
[2020-06-03 04:01:38] [INFO ] Deduced a trap composed of 19 places in 99 ms
[2020-06-03 04:01:38] [INFO ] Deduced a trap composed of 15 places in 176 ms
[2020-06-03 04:01:38] [INFO ] Deduced a trap composed of 69 places in 172 ms
[2020-06-03 04:01:39] [INFO ] Deduced a trap composed of 24 places in 677 ms
[2020-06-03 04:01:41] [INFO ] Deduced a trap composed of 13 places in 2032 ms
[2020-06-03 04:01:43] [INFO ] Deduced a trap composed of 12 places in 2130 ms
[2020-06-03 04:01:43] [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 s70 s173 s174 s175) 0)") while checking expression at index 2
[2020-06-03 04:01:43] [INFO ] [Real]Absence check using 31 positive place invariants in 129 ms returned sat
[2020-06-03 04:01:43] [INFO ] [Real]Absence check using 31 positive and 12 generalized place invariants in 5 ms returned sat
[2020-06-03 04:01:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 04:01:44] [INFO ] [Real]Absence check using state equation in 1129 ms returned sat
[2020-06-03 04:01:44] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 04:01:44] [INFO ] [Nat]Absence check using 31 positive place invariants in 96 ms returned unsat
[2020-06-03 04:01:45] [INFO ] [Real]Absence check using 31 positive place invariants in 39 ms returned sat
[2020-06-03 04:01:45] [INFO ] [Real]Absence check using 31 positive and 12 generalized place invariants in 20 ms returned sat
[2020-06-03 04:01:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 04:01:45] [INFO ] [Real]Absence check using state equation in 312 ms returned sat
[2020-06-03 04:01:45] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 04:01:45] [INFO ] [Nat]Absence check using 31 positive place invariants in 39 ms returned sat
[2020-06-03 04:01:45] [INFO ] [Nat]Absence check using 31 positive and 12 generalized place invariants in 17 ms returned sat
[2020-06-03 04:01:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 04:01:45] [INFO ] [Nat]Absence check using state equation in 157 ms returned sat
[2020-06-03 04:01:47] [INFO ] Deduced a trap composed of 11 places in 1796 ms
[2020-06-03 04:01:47] [INFO ] Deduced a trap composed of 21 places in 233 ms
[2020-06-03 04:01:49] [INFO ] Deduced a trap composed of 18 places in 1894 ms
[2020-06-03 04:01:49] [INFO ] Deduced a trap composed of 20 places in 144 ms
[2020-06-03 04:01:50] [INFO ] Deduced a trap composed of 29 places in 662 ms
[2020-06-03 04:01:50] [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 s50 s51 s52 s53 s54 s57 s58 s59 s62 s63 s91 s92 s93 s98 s101 s139 s179 s184 s189 s194 s242 s243 s260 s261 s264 s265) 0)") while checking expression at index 4
FORMULA BusinessProcesses-PT-03-ReachabilityCardinality-12 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-03-ReachabilityCardinality-03 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Support contains 8 out of 273 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 273/273 places, 236/236 transitions.
Graph (trivial) has 165 edges and 273 vertex of which 8 / 273 are part of one of the 1 SCC in 2 ms
Free SCC test removed 7 places
Discarding 3 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Graph (complete) has 512 edges and 266 vertex of which 263 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.4 ms
Drop transitions removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Performed 62 Post agglomeration using F-continuation condition.Transition count delta: 62
Iterating post reduction 0 with 73 rules applied. Total rules applied 75 place count 263 transition count 162
Reduce places removed 62 places and 0 transitions.
Iterating post reduction 1 with 62 rules applied. Total rules applied 137 place count 201 transition count 162
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 35 Pre rules applied. Total rules applied 137 place count 201 transition count 127
Deduced a syphon composed of 35 places in 1 ms
Ensure Unique test removed 9 places
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 2 with 79 rules applied. Total rules applied 216 place count 157 transition count 127
Symmetric choice reduction at 2 with 38 rule applications. Total rules 254 place count 157 transition count 127
Deduced a syphon composed of 38 places in 0 ms
Reduce places removed 38 places and 38 transitions.
Iterating global reduction 2 with 76 rules applied. Total rules applied 330 place count 119 transition count 89
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 330 place count 119 transition count 85
Deduced a syphon composed of 4 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 9 rules applied. Total rules applied 339 place count 114 transition count 85
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 0 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 2 with 84 rules applied. Total rules applied 423 place count 72 transition count 43
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 424 place count 71 transition count 42
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 425 place count 70 transition count 42
Applied a total of 425 rules in 112 ms. Remains 70 /273 variables (removed 203) and now considering 42/236 (removed 194) transitions.
Finished structural reductions, in 1 iterations. Remains : 70/273 places, 42/236 transitions.
Finished random walk after 117 steps, including 4 resets, run visited all 3 properties in 2 ms. (steps per millisecond=58 )
FORMULA BusinessProcesses-PT-03-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-03-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-03-ReachabilityCardinality-06 TRUE 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-03"
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-03, 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-158987913900470"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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