fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r144-tall-171631143300034
Last Updated
July 7, 2024

About the Execution of GreatSPN+red for DatabaseWithMutex-PT-04

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
4362.464 1800000.00 1838097.00 2967.20 [undef] Time out reached

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r144-tall-171631143300034.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is DatabaseWithMutex-PT-04, examination is Liveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r144-tall-171631143300034
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 20K Apr 11 18:02 CTLCardinality.txt
-rw-r--r-- 1 mcc users 117K Apr 11 18:02 CTLCardinality.xml
-rw-r--r-- 1 mcc users 28K Apr 11 18:00 CTLFireability.txt
-rw-r--r-- 1 mcc users 164K Apr 11 18:00 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 12K Apr 22 14:39 LTLCardinality.txt
-rw-r--r-- 1 mcc users 47K Apr 22 14:39 LTLCardinality.xml
-rw-r--r-- 1 mcc users 8.3K Apr 22 14:39 LTLFireability.txt
-rw-r--r-- 1 mcc users 38K Apr 22 14:39 LTLFireability.xml
-rw-r--r-- 1 mcc users 61K Apr 11 18:09 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 337K Apr 11 18:09 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 42K Apr 11 18:06 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 234K Apr 11 18:06 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.8K Apr 22 14:39 UpperBounds.txt
-rw-r--r-- 1 mcc users 6.3K Apr 22 14:39 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 61K May 18 16:42 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

FORMULA_NAME Liveness

=== Now, execution of the tool begins

BK_START 1716402904218

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=Liveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=DatabaseWithMutex-PT-04
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-22 18:35:05] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, Liveness, -timeout, 180, -rebuildPNML]
[2024-05-22 18:35:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 18:35:05] [INFO ] Load time of PNML (sax parser for PT used): 61 ms
[2024-05-22 18:35:05] [INFO ] Transformed 140 places.
[2024-05-22 18:35:05] [INFO ] Transformed 128 transitions.
[2024-05-22 18:35:05] [INFO ] Found NUPN structural information;
[2024-05-22 18:35:05] [INFO ] Parsed PT model containing 140 places and 128 transitions and 416 arcs in 151 ms.
Discarding 12 transitions out of 128. Remains 116
Built sparse matrix representations for Structural reductions in 14 ms.15559KB memory used
Starting structural reductions in DEADLOCK mode, iteration 0 : 140/140 places, 128/128 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Applied a total of 0 rules in 20 ms. Remains 140 /140 variables (removed 0) and now considering 128/128 (removed 0) transitions.
Finished structural reductions in DEADLOCK mode , in 1 iterations and 34 ms. Remains : 140/140 places, 128/128 transitions.
Starting structural reductions in DEADLOCK mode, iteration 0 : 140/140 places, 128/128 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Applied a total of 0 rules in 7 ms. Remains 140 /140 variables (removed 0) and now considering 128/128 (removed 0) transitions.
// Phase 1: matrix 128 rows 140 cols
[2024-05-22 18:35:05] [INFO ] Computed 28 invariants in 15 ms
[2024-05-22 18:35:05] [INFO ] Implicit Places using invariants in 213 ms returned []
[2024-05-22 18:35:05] [INFO ] Invariant cache hit.
[2024-05-22 18:35:06] [INFO ] Implicit Places using invariants and state equation in 130 ms returned []
Implicit Place search using SMT with State Equation took 376 ms to find 0 implicit places.
[2024-05-22 18:35:06] [INFO ] Redundant transitions in 3 ms returned []
Running 112 sub problems to find dead transitions.
[2024-05-22 18:35:06] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 136/136 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/136 variables, 7/143 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/136 variables, 12/155 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/136 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 4 (OVERLAPS) 1/137 variables, 1/156 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/137 variables, 1/157 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/137 variables, 2/159 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/137 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 8 (OVERLAPS) 3/140 variables, 6/165 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/140 variables, 3/168 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/140 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 11 (OVERLAPS) 128/268 variables, 140/308 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/268 variables, 0/308 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 13 (OVERLAPS) 0/268 variables, 0/308 constraints. Problems are: Problem set: 0 solved, 112 unsolved
No progress, stopping.
After SMT solving in domain Real declared 268/268 variables, and 308 constraints, problems are : Problem set: 0 solved, 112 unsolved in 4101 ms.
Refiners :[Domain max(s): 140/140 constraints, Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 140/140 constraints, PredecessorRefiner: 112/112 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 112 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 136/136 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/136 variables, 7/143 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/136 variables, 12/155 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/136 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 4 (OVERLAPS) 1/137 variables, 1/156 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/137 variables, 1/157 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/137 variables, 2/159 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/137 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 8 (OVERLAPS) 3/140 variables, 6/165 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/140 variables, 3/168 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/140 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 11 (OVERLAPS) 128/268 variables, 140/308 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/268 variables, 112/420 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/268 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 14 (OVERLAPS) 0/268 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 112 unsolved
No progress, stopping.
After SMT solving in domain Int declared 268/268 variables, and 420 constraints, problems are : Problem set: 0 solved, 112 unsolved in 4068 ms.
Refiners :[Domain max(s): 140/140 constraints, Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 140/140 constraints, PredecessorRefiner: 112/112 constraints, Known Traps: 0/0 constraints]
After SMT, in 8228ms problems are : Problem set: 0 solved, 112 unsolved
Search for dead transitions found 0 dead transitions in 8239ms
Finished structural reductions in DEADLOCK mode , in 1 iterations and 8639 ms. Remains : 140/140 places, 128/128 transitions.
Random walk for 1250000 steps, including 0 resets, run took 1615 ms (no deadlock found). (steps per millisecond=773 )
Random directed walk for 1250002 steps, including 0 resets, run took 1221 ms (no deadlock found). (steps per millisecond=1023 )
[2024-05-22 18:35:17] [INFO ] Invariant cache hit.
[2024-05-22 18:35:17] [INFO ] [Real]Absence check using 8 positive place invariants in 1 ms returned sat
[2024-05-22 18:35:17] [INFO ] [Real]Absence check using 8 positive and 20 generalized place invariants in 10 ms returned unsat
Starting structural reductions in LIVENESS mode, iteration 0 : 140/140 places, 128/128 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 140 transition count 96
Reduce places removed 36 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 1 with 68 rules applied. Total rules applied 100 place count 104 transition count 64
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 2 with 32 rules applied. Total rules applied 132 place count 72 transition count 64
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 16 Pre rules applied. Total rules applied 132 place count 72 transition count 48
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 164 place count 56 transition count 48
Applied a total of 164 rules in 28 ms. Remains 56 /140 variables (removed 84) and now considering 48/128 (removed 80) transitions.
// Phase 1: matrix 48 rows 56 cols
[2024-05-22 18:35:17] [INFO ] Computed 24 invariants in 1 ms
[2024-05-22 18:35:17] [INFO ] Implicit Places using invariants in 135 ms returned [0, 2, 4, 5, 6, 9, 10, 11, 12, 14, 15, 16, 18, 19, 20, 25, 28, 31, 32, 33, 34, 35, 36, 37, 38, 43, 46, 47, 48, 49, 50, 54]
[2024-05-22 18:35:17] [INFO ] Actually due to overlaps returned [0, 6, 14, 20, 19, 32, 36, 54]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 139 ms to find 8 implicit places.
Starting structural reductions in LIVENESS mode, iteration 1 : 48/140 places, 48/128 transitions.
Applied a total of 0 rules in 0 ms. Remains 48 /48 variables (removed 0) and now considering 48/48 (removed 0) transitions.
Finished structural reductions in LIVENESS mode , in 2 iterations and 168 ms. Remains : 48/140 places, 48/128 transitions.
Discarding 12 transitions out of 48. Remains 36
Initial state reduction rules removed 4 formulas.
RANDOM walk for 607 steps (0 resets) in 94 ms. (6 steps per ms) remains 0/32 properties
Able to resolve query QuasiLiveness after proving 36 properties.
Starting structural reductions in LIVENESS mode, iteration 0 : 140/140 places, 128/128 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 140 transition count 96
Reduce places removed 36 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 1 with 68 rules applied. Total rules applied 100 place count 104 transition count 64
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 2 with 32 rules applied. Total rules applied 132 place count 72 transition count 64
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 16 Pre rules applied. Total rules applied 132 place count 72 transition count 48
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 164 place count 56 transition count 48
Applied a total of 164 rules in 5 ms. Remains 56 /140 variables (removed 84) and now considering 48/128 (removed 80) transitions.
[2024-05-22 18:35:17] [INFO ] Invariant cache hit.
[2024-05-22 18:35:17] [INFO ] Implicit Places using invariants in 73 ms returned [0, 2, 4, 5, 6, 9, 10, 11, 12, 14, 15, 16, 18, 19, 20, 25, 28, 31, 32, 33, 34, 35, 36, 37, 38, 43, 46, 47, 48, 49, 50, 54]
[2024-05-22 18:35:17] [INFO ] Actually due to overlaps returned [0, 6, 14, 20, 19, 32, 36, 54]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 74 ms to find 8 implicit places.
Starting structural reductions in LIVENESS mode, iteration 1 : 48/140 places, 48/128 transitions.
Applied a total of 0 rules in 2 ms. Remains 48 /48 variables (removed 0) and now considering 48/48 (removed 0) transitions.
Finished structural reductions in LIVENESS mode , in 2 iterations and 81 ms. Remains : 48/140 places, 48/128 transitions.
Discarding 12 transitions out of 48. Remains 36
Net is quasi-live, checking if it is reversible to establish liveness.
Unable to solve all queries for examination Liveness. Remains :1 assertions to prove.
Unable to solve all queries for examination Liveness. Remains :36 assertions to prove.
No /home/mcc/execution/Liveness.xml examination file found. Proceeding without properties.
Parsed 36 properties from file /home/mcc/execution/Liveness.xml in 0 ms.
Working with output stream class java.io.PrintStream
Total runtime 12180 ms.
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running DatabaseWithMutex-PT-04

IS_COLORED=
IS_NUPN=1

LOADING model.pnml ...
MODEL CLASS: P/T NET WITH NUPN EXTENSION
PLACES: 140
TRANSITIONS: 128
CONSTANTS: 0
TEMPLATE VARS: 0
ARCS: 416
NUPN UNITS: 25
LOADING TIME: 0.208

SAVING AS /home/mcc/execution/model.(net/def) ...
exportGspn useExt=true
SAVING TIME: 0.02
SAVING NAME MAP FILE /home/mcc/execution/model.id2name ...
SAVING NUPN UNITS AS FILE /home/mcc/execution/model.nu ...
TOTAL TIME: 0.401
OK.
----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 549
MODEL NAME: /home/mcc/execution/model
140 places, 128 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...

BK_TIME_CONFINEMENT_REACHED

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination Liveness -timeout 180 -rebuildPNML

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="DatabaseWithMutex-PT-04"
export BK_EXAMINATION="Liveness"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
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-5568"
echo " Executing tool greatspnxred"
echo " Input is DatabaseWithMutex-PT-04, examination is Liveness"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r144-tall-171631143300034"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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