fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r267-smll-171654405600071
Last Updated
July 7, 2024

About the Execution of GreatSPN+red for Parking-PT-208

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
305.783 8086.00 20724.00 139.00 TTFTFFFTTTTFFTFT 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.r267-smll-171654405600071.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 Parking-PT-208, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r267-smll-171654405600071
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 544K
-rw-r--r-- 1 mcc users 7.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 95K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K 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.8K Apr 23 07:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Apr 23 07:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 23 07:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 23 07:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 11 16:23 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 120K Apr 11 16:23 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.6K Apr 11 16:21 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 89K Apr 11 16:21 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:41 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:41 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 49K 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 Parking-PT-208-ReachabilityFireability-2024-00
FORMULA_NAME Parking-PT-208-ReachabilityFireability-2024-01
FORMULA_NAME Parking-PT-208-ReachabilityFireability-2024-02
FORMULA_NAME Parking-PT-208-ReachabilityFireability-2024-03
FORMULA_NAME Parking-PT-208-ReachabilityFireability-2024-04
FORMULA_NAME Parking-PT-208-ReachabilityFireability-2024-05
FORMULA_NAME Parking-PT-208-ReachabilityFireability-2024-06
FORMULA_NAME Parking-PT-208-ReachabilityFireability-2024-07
FORMULA_NAME Parking-PT-208-ReachabilityFireability-2024-08
FORMULA_NAME Parking-PT-208-ReachabilityFireability-2024-09
FORMULA_NAME Parking-PT-208-ReachabilityFireability-2024-10
FORMULA_NAME Parking-PT-208-ReachabilityFireability-2024-11
FORMULA_NAME Parking-PT-208-ReachabilityFireability-2024-12
FORMULA_NAME Parking-PT-208-ReachabilityFireability-2024-13
FORMULA_NAME Parking-PT-208-ReachabilityFireability-2024-14
FORMULA_NAME Parking-PT-208-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1716653025962

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Parking-PT-208
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-25 16:03:48] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-25 16:03:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 16:03:48] [INFO ] Load time of PNML (sax parser for PT used): 100 ms
[2024-05-25 16:03:48] [INFO ] Transformed 137 places.
[2024-05-25 16:03:48] [INFO ] Transformed 201 transitions.
[2024-05-25 16:03:48] [INFO ] Found NUPN structural information;
[2024-05-25 16:03:48] [INFO ] Parsed PT model containing 137 places and 201 transitions and 593 arcs in 252 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 28 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 84 transitions
Reduce redundant transitions removed 84 transitions.
RANDOM walk for 40000 steps (1156 resets) in 2691 ms. (14 steps per ms) remains 10/16 properties
FORMULA Parking-PT-208-ReachabilityFireability-2024-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Parking-PT-208-ReachabilityFireability-2024-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Parking-PT-208-ReachabilityFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Parking-PT-208-ReachabilityFireability-2024-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Parking-PT-208-ReachabilityFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Parking-PT-208-ReachabilityFireability-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (99 resets) in 506 ms. (78 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (86 resets) in 306 ms. (130 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (83 resets) in 1030 ms. (38 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (104 resets) in 348 ms. (114 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (93 resets) in 162 ms. (245 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (86 resets) in 339 ms. (117 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (102 resets) in 101 ms. (392 steps per ms) remains 9/10 properties
FORMULA Parking-PT-208-ReachabilityFireability-2024-14 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (87 resets) in 158 ms. (251 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (100 resets) in 105 ms. (377 steps per ms) remains 9/9 properties
// Phase 1: matrix 117 rows 137 cols
[2024-05-25 16:03:50] [INFO ] Computed 34 invariants in 11 ms
[2024-05-25 16:03:50] [INFO ] State equation strengthened by 26 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 101/101 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 13/114 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Problem Parking-PT-208-ReachabilityFireability-2024-04 is UNSAT
FORMULA Parking-PT-208-ReachabilityFireability-2024-04 FALSE TECHNIQUES SMT_REFINEMENT
Problem Parking-PT-208-ReachabilityFireability-2024-06 is UNSAT
FORMULA Parking-PT-208-ReachabilityFireability-2024-06 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 3 (OVERLAPS) 34/135 variables, 19/133 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/135 variables, 34/167 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/135 variables, 1/168 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/135 variables, 0/168 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 2/137 variables, 1/169 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/137 variables, 2/171 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/137 variables, 0/171 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 10 (OVERLAPS) 117/254 variables, 137/308 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/254 variables, 26/334 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/254 variables, 0/334 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 13 (OVERLAPS) 0/254 variables, 0/334 constraints. Problems are: Problem set: 2 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 254/254 variables, and 334 constraints, problems are : Problem set: 2 solved, 7 unsolved in 985 ms.
Refiners :[Domain max(s): 137/137 constraints, Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 137/137 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 89/89 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 11/100 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 0/100 constraints. Problems are: Problem set: 2 solved, 7 unsolved
Problem Parking-PT-208-ReachabilityFireability-2024-03 is UNSAT
FORMULA Parking-PT-208-ReachabilityFireability-2024-03 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 3 (OVERLAPS) 44/133 variables, 21/121 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/133 variables, 44/165 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/133 variables, 0/165 constraints. Problems are: Problem set: 3 solved, 6 unsolved
Problem Parking-PT-208-ReachabilityFireability-2024-07 is UNSAT
FORMULA Parking-PT-208-ReachabilityFireability-2024-07 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 6 (OVERLAPS) 4/137 variables, 2/167 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/137 variables, 4/171 constraints. Problems are: Problem set: 4 solved, 5 unsolved
[2024-05-25 16:03:51] [INFO ] Deduced a trap composed of 32 places in 70 ms of which 16 ms to minimize.
[2024-05-25 16:03:51] [INFO ] Deduced a trap composed of 28 places in 55 ms of which 3 ms to minimize.
[2024-05-25 16:03:52] [INFO ] Deduced a trap composed of 32 places in 46 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/137 variables, 3/174 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/137 variables, 0/174 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 117/254 variables, 137/311 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/254 variables, 26/337 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/254 variables, 5/342 constraints. Problems are: Problem set: 4 solved, 5 unsolved
[2024-05-25 16:03:52] [INFO ] Deduced a trap composed of 28 places in 41 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/254 variables, 1/343 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/254 variables, 0/343 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 0/254 variables, 0/343 constraints. Problems are: Problem set: 4 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 254/254 variables, and 343 constraints, problems are : Problem set: 4 solved, 5 unsolved in 1205 ms.
Refiners :[Domain max(s): 137/137 constraints, Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 137/137 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 5/9 constraints, Known Traps: 4/4 constraints]
After SMT, in 2373ms problems are : Problem set: 4 solved, 5 unsolved
FORMULA Parking-PT-208-ReachabilityFireability-2024-13 TRUE TECHNIQUES PARIKH_WALK
FORMULA Parking-PT-208-ReachabilityFireability-2024-08 TRUE TECHNIQUES PARIKH_WALK
FORMULA Parking-PT-208-ReachabilityFireability-2024-02 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 3 properties in 926 ms.
Support contains 26 out of 137 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 137/137 places, 117/117 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 136 transition count 116
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 136 transition count 116
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 8 place count 133 transition count 113
Free-agglomeration rule applied 12 times.
Iterating global reduction 0 with 12 rules applied. Total rules applied 20 place count 133 transition count 101
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 32 place count 121 transition count 101
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 121 transition count 101
Applied a total of 33 rules in 76 ms. Remains 121 /137 variables (removed 16) and now considering 101/117 (removed 16) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 91 ms. Remains : 121/137 places, 101/117 transitions.
RANDOM walk for 40000 steps (1595 resets) in 612 ms. (65 steps per ms) remains 1/2 properties
FORMULA Parking-PT-208-ReachabilityFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 28147 steps (153 resets) in 103 ms. (270 steps per ms) remains 0/1 properties
FORMULA Parking-PT-208-ReachabilityFireability-2024-12 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
All properties solved without resorting to model-checking.
Total runtime 5951 ms.
ITS solved all properties within timeout

BK_STOP 1716653034048

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

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="Parking-PT-208"
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 Parking-PT-208, 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 r267-smll-171654405600071"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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