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

About the Execution of GreatSPN+red for NeighborGrid-PT-d5n4m1t35

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
1627.016 54812.00 166558.00 147.30 FFFTFTFFFFTTFTFT 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.r245-tall-171654349900438.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 NeighborGrid-PT-d5n4m1t35, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r245-tall-171654349900438
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 59M
-rw-r--r-- 1 mcc users 8.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K 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.4K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.6K May 19 07:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 19 16:10 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K May 19 07:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 18:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K Apr 11 17:26 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 153K Apr 11 17:26 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 15K Apr 11 17:09 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 87K Apr 11 17:09 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 23 07:40 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Apr 23 07:40 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 10 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rwxr-xr-x 1 mcc users 59M 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 NeighborGrid-PT-d5n4m1t35-ReachabilityCardinality-2024-00
FORMULA_NAME NeighborGrid-PT-d5n4m1t35-ReachabilityCardinality-2024-01
FORMULA_NAME NeighborGrid-PT-d5n4m1t35-ReachabilityCardinality-2024-02
FORMULA_NAME NeighborGrid-PT-d5n4m1t35-ReachabilityCardinality-2024-03
FORMULA_NAME NeighborGrid-PT-d5n4m1t35-ReachabilityCardinality-2024-04
FORMULA_NAME NeighborGrid-PT-d5n4m1t35-ReachabilityCardinality-2024-05
FORMULA_NAME NeighborGrid-PT-d5n4m1t35-ReachabilityCardinality-2024-06
FORMULA_NAME NeighborGrid-PT-d5n4m1t35-ReachabilityCardinality-2024-07
FORMULA_NAME NeighborGrid-PT-d5n4m1t35-ReachabilityCardinality-2024-08
FORMULA_NAME NeighborGrid-PT-d5n4m1t35-ReachabilityCardinality-2024-09
FORMULA_NAME NeighborGrid-PT-d5n4m1t35-ReachabilityCardinality-2024-10
FORMULA_NAME NeighborGrid-PT-d5n4m1t35-ReachabilityCardinality-2024-11
FORMULA_NAME NeighborGrid-PT-d5n4m1t35-ReachabilityCardinality-2024-12
FORMULA_NAME NeighborGrid-PT-d5n4m1t35-ReachabilityCardinality-2024-13
FORMULA_NAME NeighborGrid-PT-d5n4m1t35-ReachabilityCardinality-2024-14
FORMULA_NAME NeighborGrid-PT-d5n4m1t35-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1716667058492

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=NeighborGrid-PT-d5n4m1t35
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-25 19:57:39] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-05-25 19:57:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 19:57:41] [INFO ] Load time of PNML (sax parser for PT used): 1668 ms
[2024-05-25 19:57:41] [INFO ] Transformed 1024 places.
[2024-05-25 19:57:41] [INFO ] Transformed 196608 transitions.
[2024-05-25 19:57:42] [INFO ] Parsed PT model containing 1024 places and 196608 transitions and 393216 arcs in 2267 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 24 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 14003 steps (4 resets) in 120032 ms. (0 steps per ms) remains 4/16 properties
FORMULA NeighborGrid-PT-d5n4m1t35-ReachabilityCardinality-2024-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NeighborGrid-PT-d5n4m1t35-ReachabilityCardinality-2024-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NeighborGrid-PT-d5n4m1t35-ReachabilityCardinality-2024-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NeighborGrid-PT-d5n4m1t35-ReachabilityCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NeighborGrid-PT-d5n4m1t35-ReachabilityCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NeighborGrid-PT-d5n4m1t35-ReachabilityCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NeighborGrid-PT-d5n4m1t35-ReachabilityCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NeighborGrid-PT-d5n4m1t35-ReachabilityCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NeighborGrid-PT-d5n4m1t35-ReachabilityCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NeighborGrid-PT-d5n4m1t35-ReachabilityCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NeighborGrid-PT-d5n4m1t35-ReachabilityCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NeighborGrid-PT-d5n4m1t35-ReachabilityCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (0 resets) in 1249 ms. (32 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (0 resets) in 819 ms. (48 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (0 resets) in 859 ms. (46 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (0 resets) in 725 ms. (55 steps per ms) remains 4/4 properties
// Phase 1: matrix 196608 rows 1024 cols
[2024-05-25 19:58:17] [INFO ] Computed 1 invariants in 3397 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 886/1024 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1024 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
SMT process timed out in 9235ms, After SMT, problems are : Problem set: 0 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 138 out of 1024 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1024/1024 places, 196608/196608 transitions.
Graph (trivial) has 147098 edges and 1024 vertex of which 886 / 1024 are part of one of the 1 SCC in 117 ms
Free SCC test removed 885 places
Drop transitions (Empty/Sink Transition effects.) removed 147098 transitions
Ensure Unique test removed 45752 transitions
Reduce isomorphic transitions removed 192850 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 1104 transitions
Redundant transition composition rules discarded 1104 transitions
Iterating global reduction 0 with 1104 rules applied. Total rules applied 1105 place count 139 transition count 2654
Applied a total of 1105 rules in 3075 ms. Remains 139 /1024 variables (removed 885) and now considering 2654/196608 (removed 193954) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3085 ms. Remains : 139/1024 places, 2654/196608 transitions.
RANDOM walk for 41175 steps (8 resets) in 586 ms. (70 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 305 ms. (130 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 209 ms. (190 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 206 ms. (193 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 293 ms. (136 steps per ms) remains 4/4 properties
Probabilistic random walk after 183935 steps, saw 183663 distinct states, run finished after 3003 ms. (steps per millisecond=61 ) properties seen :0
// Phase 1: matrix 2654 rows 139 cols
[2024-05-25 19:58:29] [INFO ] Computed 1 invariants in 9 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 1/139 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/139 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 2654/2793 variables, 139/140 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2793 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 0/2793 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2793/2793 variables, and 140 constraints, problems are : Problem set: 0 solved, 4 unsolved in 640 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 139/139 constraints, PredecessorRefiner: 4/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 1/139 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/139 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 2654/2793 variables, 139/140 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2793 variables, 2/142 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2793 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 0/2793 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2793/2793 variables, and 142 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1217 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 139/139 constraints, PredecessorRefiner: 4/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 1979ms problems are : Problem set: 0 solved, 4 unsolved
Finished Parikh walk after 231752 steps, including 24 resets, run visited all 4 properties in 1541 ms. (steps per millisecond=150 )
FORMULA NeighborGrid-PT-d5n4m1t35-ReachabilityCardinality-2024-13 TRUE TECHNIQUES PARIKH_WALK
FORMULA NeighborGrid-PT-d5n4m1t35-ReachabilityCardinality-2024-11 TRUE TECHNIQUES PARIKH_WALK
FORMULA NeighborGrid-PT-d5n4m1t35-ReachabilityCardinality-2024-10 TRUE TECHNIQUES PARIKH_WALK
FORMULA NeighborGrid-PT-d5n4m1t35-ReachabilityCardinality-2024-05 TRUE TECHNIQUES PARIKH_WALK
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 2 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 4 properties in 1551 ms.
All properties solved without resorting to model-checking.
Total runtime 53516 ms.
ITS solved all properties within timeout

BK_STOP 1716667113304

--------------------
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

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="NeighborGrid-PT-d5n4m1t35"
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 NeighborGrid-PT-d5n4m1t35, 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 r245-tall-171654349900438"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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