fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r047-tajo-171620397800247
Last Updated
July 7, 2024

About the Execution of GreatSPN+red for BridgeAndVehicles-PT-V50P20N50

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
16205.052 2577845.00 9297096.00 2960.70 FTFFTFFF???FF??? normal

Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r047-tajo-171620397800247.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is BridgeAndVehicles-PT-V50P20N50, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r047-tajo-171620397800247
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 13M
-rw-r--r-- 1 mcc users 15K Apr 13 01:56 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K Apr 13 01:56 CTLCardinality.xml
-rw-r--r-- 1 mcc users 587K Apr 13 01:50 CTLFireability.txt
-rw-r--r-- 1 mcc users 2.2M Apr 13 01:50 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 9.5K Apr 22 14:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 44K Apr 22 14:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 351K Apr 22 14:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 994K Apr 22 14:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 42K Apr 13 03:43 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 235K Apr 13 03:43 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 842K Apr 13 03:35 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 3.2M Apr 13 03:35 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.5K Apr 22 14:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 7.6K Apr 22 14:30 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 10 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 4.5M 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

here is the order used to build the result vector(from text file)
FORMULA_NAME BridgeAndVehicles-PT-V50P20N50-ReachabilityFireability-2024-00
FORMULA_NAME BridgeAndVehicles-PT-V50P20N50-ReachabilityFireability-2024-01
FORMULA_NAME BridgeAndVehicles-PT-V50P20N50-ReachabilityFireability-2024-02
FORMULA_NAME BridgeAndVehicles-PT-V50P20N50-ReachabilityFireability-2024-03
FORMULA_NAME BridgeAndVehicles-PT-V50P20N50-ReachabilityFireability-2024-04
FORMULA_NAME BridgeAndVehicles-PT-V50P20N50-ReachabilityFireability-2024-05
FORMULA_NAME BridgeAndVehicles-PT-V50P20N50-ReachabilityFireability-2024-06
FORMULA_NAME BridgeAndVehicles-PT-V50P20N50-ReachabilityFireability-2024-07
FORMULA_NAME BridgeAndVehicles-PT-V50P20N50-ReachabilityFireability-2024-08
FORMULA_NAME BridgeAndVehicles-PT-V50P20N50-ReachabilityFireability-2024-09
FORMULA_NAME BridgeAndVehicles-PT-V50P20N50-ReachabilityFireability-2024-10
FORMULA_NAME BridgeAndVehicles-PT-V50P20N50-ReachabilityFireability-2024-11
FORMULA_NAME BridgeAndVehicles-PT-V50P20N50-ReachabilityFireability-2024-12
FORMULA_NAME BridgeAndVehicles-PT-V50P20N50-ReachabilityFireability-2024-13
FORMULA_NAME BridgeAndVehicles-PT-V50P20N50-ReachabilityFireability-2024-14
FORMULA_NAME BridgeAndVehicles-PT-V50P20N50-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1716287725881

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BridgeAndVehicles-PT-V50P20N50
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-21 10:35:27] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-21 10:35:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 10:35:27] [INFO ] Load time of PNML (sax parser for PT used): 343 ms
[2024-05-21 10:35:27] [INFO ] Transformed 168 places.
[2024-05-21 10:35:27] [INFO ] Transformed 5408 transitions.
[2024-05-21 10:35:27] [INFO ] Parsed PT model containing 168 places and 5408 transitions and 42330 arcs in 509 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 143 ms.
Working with output stream class java.io.PrintStream
FORMULA BridgeAndVehicles-PT-V50P20N50-ReachabilityFireability-2024-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V50P20N50-ReachabilityFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (92 resets) in 4266 ms. (9 steps per ms) remains 10/14 properties
FORMULA BridgeAndVehicles-PT-V50P20N50-ReachabilityFireability-2024-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V50P20N50-ReachabilityFireability-2024-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V50P20N50-ReachabilityFireability-2024-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V50P20N50-ReachabilityFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (44 resets) in 1656 ms. (24 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (40 resets) in 1491 ms. (26 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (33 resets) in 622 ms. (64 steps per ms) remains 9/10 properties
FORMULA BridgeAndVehicles-PT-V50P20N50-ReachabilityFireability-2024-06 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (28 resets) in 500 ms. (79 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (32 resets) in 720 ms. (55 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (36 resets) in 482 ms. (82 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (32 resets) in 481 ms. (82 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (32 resets) in 954 ms. (41 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (32 resets) in 455 ms. (87 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (32 resets) in 478 ms. (83 steps per ms) remains 9/9 properties
[2024-05-21 10:35:32] [INFO ] Flow matrix only has 410 transitions (discarded 4998 similar events)
// Phase 1: matrix 410 rows 168 cols
[2024-05-21 10:35:32] [INFO ] Computed 7 invariants in 34 ms
[2024-05-21 10:35:32] [INFO ] State equation strengthened by 102 read => feed constraints.
Problem BridgeAndVehicles-PT-V50P20N50-ReachabilityFireability-2024-00 is UNSAT
FORMULA BridgeAndVehicles-PT-V50P20N50-ReachabilityFireability-2024-00 FALSE TECHNIQUES SMT_REFINEMENT
Problem BridgeAndVehicles-PT-V50P20N50-ReachabilityFireability-2024-11 is UNSAT
FORMULA BridgeAndVehicles-PT-V50P20N50-ReachabilityFireability-2024-11 FALSE TECHNIQUES SMT_REFINEMENT
Problem BridgeAndVehicles-PT-V50P20N50-ReachabilityFireability-2024-12 is UNSAT
FORMULA BridgeAndVehicles-PT-V50P20N50-ReachabilityFireability-2024-12 FALSE TECHNIQUES SMT_REFINEMENT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 3/3 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 0/3 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 19/168 variables, 4/7 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/168 variables, 0/7 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 410/578 variables, 168/175 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/578 variables, 102/277 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/578 variables, 0/277 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/578 variables, 0/277 constraints. Problems are: Problem set: 3 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 578/578 variables, and 277 constraints, problems are : Problem set: 3 solved, 6 unsolved in 2016 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 168/168 constraints, ReadFeed: 102/102 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/113 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 55/168 variables, 7/7 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/168 variables, 0/7 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 410/578 variables, 168/175 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/578 variables, 102/277 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/578 variables, 6/283 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/578 variables, 0/283 constraints. Problems are: Problem set: 3 solved, 6 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 578/578 variables, and 283 constraints, problems are : Problem set: 3 solved, 6 unsolved in 5015 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 168/168 constraints, ReadFeed: 102/102 constraints, PredecessorRefiner: 6/9 constraints, Known Traps: 0/0 constraints]
After SMT, in 8344ms problems are : Problem set: 3 solved, 6 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 113 out of 168 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 168/168 places, 5408/5408 transitions.
Graph (complete) has 1542 edges and 168 vertex of which 166 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.23 ms
Discarding 2 places :
Also discarding 0 output transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 8 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 165 transition count 5407
Applied a total of 3 rules in 1331 ms. Remains 165 /168 variables (removed 3) and now considering 5407/5408 (removed 1) transitions.
Running 5404 sub problems to find dead transitions.
[2024-05-21 10:35:41] [INFO ] Flow matrix only has 409 transitions (discarded 4998 similar events)
// Phase 1: matrix 409 rows 165 cols
[2024-05-21 10:35:41] [INFO ] Computed 5 invariants in 7 ms
[2024-05-21 10:35:42] [INFO ] State equation strengthened by 102 read => feed constraints.
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running BridgeAndVehicles-PT-V50P20N50

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: 168
TRANSITIONS: 5408
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.282s, Sys 0.027s]


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


----------------------------------------------------------------------
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: 568
MODEL NAME: /home/mcc/execution/model
168 places, 5408 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...
FORMULA BridgeAndVehicles-PT-V50P20N50-ReachabilityFireability-2024-11 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA BridgeAndVehicles-PT-V50P20N50-ReachabilityFireability-2024-12 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA BridgeAndVehicles-PT-V50P20N50-ReachabilityFireability-2024-00 CANNOT_COMPUTE
FORMULA BridgeAndVehicles-PT-V50P20N50-ReachabilityFireability-2024-01 CANNOT_COMPUTE
FORMULA BridgeAndVehicles-PT-V50P20N50-ReachabilityFireability-2024-03 CANNOT_COMPUTE
FORMULA BridgeAndVehicles-PT-V50P20N50-ReachabilityFireability-2024-04 CANNOT_COMPUTE
FORMULA BridgeAndVehicles-PT-V50P20N50-ReachabilityFireability-2024-06 CANNOT_COMPUTE
FORMULA BridgeAndVehicles-PT-V50P20N50-ReachabilityFireability-2024-10 CANNOT_COMPUTE
FORMULA BridgeAndVehicles-PT-V50P20N50-ReachabilityFireability-2024-13 CANNOT_COMPUTE
FORMULA BridgeAndVehicles-PT-V50P20N50-ReachabilityFireability-2024-14 CANNOT_COMPUTE
FORMULA BridgeAndVehicles-PT-V50P20N50-ReachabilityFireability-2024-15 CANNOT_COMPUTE
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716290303726

--------------------
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 ReachabilityFireability -timeout 360 -rebuildPNML
Error in allocating array of size 2097152 at unique_table.cc, line 313
MEDDLY ERROR: Insufficient memory

Error in allocating array of size 4194304 at unique_table.cc, line 313
MEDDLY ERROR: Insufficient memory

Error in allocating array of size 4194304 at unique_table.cc, line 313
MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

Error in allocating array of size 2097152 at unique_table.cc, line 313
MEDDLY ERROR: Insufficient memory

Error in allocating array of size 2097152 at unique_table.cc, line 313
MEDDLY ERROR: Insufficient memory

Error in allocating array of size 2097152 at unique_table.cc, line 313
MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

Error in allocating array of size 2097152 at unique_table.cc, line 313
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="BridgeAndVehicles-PT-V50P20N50"
export BK_EXAMINATION="ReachabilityFireability"
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 BridgeAndVehicles-PT-V50P20N50, 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 r047-tajo-171620397800247"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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