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

About the Execution of GreatSPN+red for RERS17pb114-PT-4

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
16195.848 612306.00 1437506.00 1118.80 ?T???T?F??FF???T normal

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.r311-tall-171662336100214.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 RERS17pb114-PT-4, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r311-tall-171662336100214
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 73M
-rw-r--r-- 1 mcc users 5.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 56K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K May 19 07:13 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 19 16:16 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.3K Apr 23 07:45 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Apr 23 07:45 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 164K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.9K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 53K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K May 19 07:14 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 19 15:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 2 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 73M May 18 16:43 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 RERS17pb114-PT-4-ReachabilityCardinality-2024-00
FORMULA_NAME RERS17pb114-PT-4-ReachabilityCardinality-2024-01
FORMULA_NAME RERS17pb114-PT-4-ReachabilityCardinality-2024-02
FORMULA_NAME RERS17pb114-PT-4-ReachabilityCardinality-2024-03
FORMULA_NAME RERS17pb114-PT-4-ReachabilityCardinality-2024-04
FORMULA_NAME RERS17pb114-PT-4-ReachabilityCardinality-2024-05
FORMULA_NAME RERS17pb114-PT-4-ReachabilityCardinality-2024-06
FORMULA_NAME RERS17pb114-PT-4-ReachabilityCardinality-2024-07
FORMULA_NAME RERS17pb114-PT-4-ReachabilityCardinality-2024-08
FORMULA_NAME RERS17pb114-PT-4-ReachabilityCardinality-2024-09
FORMULA_NAME RERS17pb114-PT-4-ReachabilityCardinality-2023-10
FORMULA_NAME RERS17pb114-PT-4-ReachabilityCardinality-2024-11
FORMULA_NAME RERS17pb114-PT-4-ReachabilityCardinality-2023-12
FORMULA_NAME RERS17pb114-PT-4-ReachabilityCardinality-2023-13
FORMULA_NAME RERS17pb114-PT-4-ReachabilityCardinality-2024-14
FORMULA_NAME RERS17pb114-PT-4-ReachabilityCardinality-2023-15

=== Now, execution of the tool begins

BK_START 1716708315589

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=RERS17pb114-PT-4
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-26 07:25:16] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-05-26 07:25:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-26 07:25:18] [INFO ] Load time of PNML (sax parser for PT used): 1981 ms
[2024-05-26 07:25:18] [INFO ] Transformed 1446 places.
[2024-05-26 07:25:19] [INFO ] Transformed 151085 transitions.
[2024-05-26 07:25:19] [INFO ] Parsed PT model containing 1446 places and 151085 transitions and 604252 arcs in 2530 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 23 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (8 resets) in 6677 ms. (5 steps per ms) remains 12/16 properties
FORMULA RERS17pb114-PT-4-ReachabilityCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA RERS17pb114-PT-4-ReachabilityCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA RERS17pb114-PT-4-ReachabilityCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA RERS17pb114-PT-4-ReachabilityCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 671 ms. (59 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 504 ms. (79 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 813 ms. (49 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 651 ms. (61 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 317 ms. (125 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 389 ms. (102 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 437 ms. (91 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 417 ms. (95 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 451 ms. (88 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 390 ms. (102 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 388 ms. (102 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 396 ms. (100 steps per ms) remains 12/12 properties
[2024-05-26 07:25:24] [INFO ] Flow matrix only has 84691 transitions (discarded 66394 similar events)
// Phase 1: matrix 84691 rows 1446 cols
[2024-05-26 07:25:24] [INFO ] Computed 35 invariants in 507 ms
[2024-05-26 07:25:30] [INFO ] State equation strengthened by 2342 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/302 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 103/405 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/405 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Problem RERS17pb114-PT-4-ReachabilityCardinality-2023-10 is UNSAT
FORMULA RERS17pb114-PT-4-ReachabilityCardinality-2023-10 FALSE TECHNIQUES SMT_REFINEMENT
Problem RERS17pb114-PT-4-ReachabilityCardinality-2023-15 is UNSAT
FORMULA RERS17pb114-PT-4-ReachabilityCardinality-2023-15 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 3 (OVERLAPS) 1041/1446 variables, 17/35 constraints. Problems are: Problem set: 2 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1446 variables, 0/35 constraints. Problems are: Problem set: 2 solved, 10 unsolved
SMT process timed out in 11957ms, After SMT, problems are : Problem set: 2 solved, 10 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 215 out of 1446 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1446/1446 places, 151085/151085 transitions.
Ensure Unique test removed 14 places
Drop transitions (Empty/Sink Transition effects.) removed 512 transitions
Reduce isomorphic transitions removed 512 transitions.
Iterating post reduction 0 with 526 rules applied. Total rules applied 526 place count 1432 transition count 150573
Applied a total of 526 rules in 2043 ms. Remains 1432 /1446 variables (removed 14) and now considering 150573/151085 (removed 512) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2072 ms. Remains : 1432/1446 places, 150573/151085 transitions.
RANDOM walk for 40000 steps (8 resets) in 4526 ms. (8 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 617 ms. (64 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 412 ms. (96 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 384 ms. (103 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 538 ms. (74 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 312 ms. (127 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 366 ms. (109 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 318 ms. (125 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (8 resets) in 541 ms. (73 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 323 ms. (123 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 296 ms. (134 steps per ms) remains 10/10 properties
Interrupted probabilistic random walk after 7678 steps, run timeout after 6006 ms. (steps per millisecond=1 ) properties seen :0 out of 10
Probabilistic random walk after 7678 steps, saw 6902 distinct states, run finished after 6010 ms. (steps per millisecond=1 ) properties seen :0
[2024-05-26 07:25:47] [INFO ] Flow matrix only has 84690 transitions (discarded 65883 similar events)
// Phase 1: matrix 84690 rows 1432 cols
[2024-05-26 07:25:47] [INFO ] Computed 21 invariants in 418 ms
[2024-05-26 07:25:52] [INFO ] State equation strengthened by 2341 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/215 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 58/273 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/273 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 1159/1432 variables, 17/21 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1432 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 86122/86122 variables, and 1453 constraints, problems are : Problem set: 0 solved, 10 unsolved in 45100 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 1432/1432 constraints, ReadFeed: 0/2341 constraints, PredecessorRefiner: 10/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/215 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 58/273 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/273 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 1159/1432 variables, 17/21 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-05-26 07:26:51] [INFO ] Deduced a trap composed of 41 places in 6360 ms of which 37 ms to minimize.
[2024-05-26 07:26:57] [INFO ] Deduced a trap composed of 41 places in 6272 ms of which 4 ms to minimize.
[2024-05-26 07:27:02] [INFO ] Deduced a trap composed of 65 places in 5306 ms of which 3 ms to minimize.
[2024-05-26 07:27:07] [INFO ] Deduced a trap composed of 65 places in 5076 ms of which 3 ms to minimize.
[2024-05-26 07:27:12] [INFO ] Deduced a trap composed of 65 places in 4894 ms of which 1 ms to minimize.
[2024-05-26 07:27:26] [INFO ] Deduced a trap composed of 97 places in 6638 ms of which 3 ms to minimize.
SMT process timed out in 99176ms, After SMT, problems are : Problem set: 0 solved, 10 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 215 out of 1432 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1432/1432 places, 150573/150573 transitions.
Applied a total of 0 rules in 1343 ms. Remains 1432 /1432 variables (removed 0) and now considering 150573/150573 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1343 ms. Remains : 1432/1432 places, 150573/150573 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1432/1432 places, 150573/150573 transitions.
Applied a total of 0 rules in 1264 ms. Remains 1432 /1432 variables (removed 0) and now considering 150573/150573 (removed 0) transitions.
[2024-05-26 07:27:29] [INFO ] Flow matrix only has 84690 transitions (discarded 65883 similar events)
[2024-05-26 07:27:29] [INFO ] Invariant cache hit.
[2024-05-26 07:27:37] [INFO ] Implicit Places using invariants in 8681 ms returned []
Implicit Place search using SMT only with invariants took 8691 ms to find 0 implicit places.
Running 150572 sub problems to find dead transitions.
[2024-05-26 07:27:39] [INFO ] Flow matrix only has 84690 transitions (discarded 65883 similar events)
[2024-05-26 07:27:39] [INFO ] Invariant cache hit.
[2024-05-26 07:27:44] [INFO ] State equation strengthened by 2341 read => feed constraints.
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running RERS17pb114-PT-4

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 1446
TRANSITIONS: 151085
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 3.514s, Sys 0.271s]


SAVING FILE /home/mcc/execution/model (.net / .def) ...
EXPORT TIME: [User 0.542s, Sys 0.043s]


----------------------------------------------------------------------
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: 573
MODEL NAME: /home/mcc/execution/model
1446 places, 151085 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
CANNOT_COMPUTE
EXITCODE: 87
----------------------------------------------------------------------

BK_STOP 1716708927895

--------------------
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 ReachabilityCardinality -timeout 360 -rebuildPNML
MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

Error in allocating array of size 1178103172 at storage/ct_typebased.h, line 1565
MEDDLY ERROR: Insufficient memory

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="RERS17pb114-PT-4"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="greatspnxred"
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-5568"
echo " Executing tool greatspnxred"
echo " Input is RERS17pb114-PT-4, 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 r311-tall-171662336100214"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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