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

About the Execution of GreatSPN+red for DrinkVendingMachine-PT-10

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
1368.323 28662.00 54812.00 1588.10 TTTTFFTFFTFTTFTF 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.r135-tall-171631131700718.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 DrinkVendingMachine-PT-10, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r135-tall-171631131700718
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 371M
-rw-r--r-- 1 mcc users 28K Apr 13 03:51 CTLCardinality.txt
-rw-r--r-- 1 mcc users 176K Apr 13 03:51 CTLCardinality.xml
-rw-r--r-- 1 mcc users 20M Apr 13 03:41 CTLFireability.txt
-rw-r--r-- 1 mcc users 68M Apr 13 03:34 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 17K Apr 22 14:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 74K Apr 22 14:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 16M Apr 22 14:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 42M Apr 22 14:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 34K Apr 13 11:57 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 232K Apr 13 11:57 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 27M Apr 13 11:49 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 90M Apr 13 11:40 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.5K Apr 22 14:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 8.3K Apr 22 14:42 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 111M 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 DrinkVendingMachine-PT-10-ReachabilityCardinality-2024-00
FORMULA_NAME DrinkVendingMachine-PT-10-ReachabilityCardinality-2024-01
FORMULA_NAME DrinkVendingMachine-PT-10-ReachabilityCardinality-2024-02
FORMULA_NAME DrinkVendingMachine-PT-10-ReachabilityCardinality-2024-03
FORMULA_NAME DrinkVendingMachine-PT-10-ReachabilityCardinality-2024-04
FORMULA_NAME DrinkVendingMachine-PT-10-ReachabilityCardinality-2024-05
FORMULA_NAME DrinkVendingMachine-PT-10-ReachabilityCardinality-2024-06
FORMULA_NAME DrinkVendingMachine-PT-10-ReachabilityCardinality-2024-07
FORMULA_NAME DrinkVendingMachine-PT-10-ReachabilityCardinality-2024-08
FORMULA_NAME DrinkVendingMachine-PT-10-ReachabilityCardinality-2024-09
FORMULA_NAME DrinkVendingMachine-PT-10-ReachabilityCardinality-2024-10
FORMULA_NAME DrinkVendingMachine-PT-10-ReachabilityCardinality-2024-11
FORMULA_NAME DrinkVendingMachine-PT-10-ReachabilityCardinality-2024-12
FORMULA_NAME DrinkVendingMachine-PT-10-ReachabilityCardinality-2024-13
FORMULA_NAME DrinkVendingMachine-PT-10-ReachabilityCardinality-2024-14
FORMULA_NAME DrinkVendingMachine-PT-10-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1716402596984

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DrinkVendingMachine-PT-10
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-22 18:29:58] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-05-22 18:29:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 18:30:01] [INFO ] Load time of PNML (sax parser for PT used): 2644 ms
[2024-05-22 18:30:01] [INFO ] Transformed 120 places.
[2024-05-22 18:30:01] [INFO ] Transformed 111160 transitions.
[2024-05-22 18:30:01] [INFO ] Parsed PT model containing 120 places and 111160 transitions and 1026520 arcs in 3224 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 36 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 82500 transitions
Reduce redundant transitions removed 82500 transitions.
RANDOM walk for 40000 steps (8 resets) in 7865 ms. (5 steps per ms) remains 8/16 properties
FORMULA DrinkVendingMachine-PT-10-ReachabilityCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DrinkVendingMachine-PT-10-ReachabilityCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DrinkVendingMachine-PT-10-ReachabilityCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DrinkVendingMachine-PT-10-ReachabilityCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DrinkVendingMachine-PT-10-ReachabilityCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DrinkVendingMachine-PT-10-ReachabilityCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DrinkVendingMachine-PT-10-ReachabilityCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DrinkVendingMachine-PT-10-ReachabilityCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (0 resets) in 321 ms. (124 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (0 resets) in 333 ms. (119 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (0 resets) in 444 ms. (89 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (0 resets) in 458 ms. (87 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (0 resets) in 1940 ms. (20 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (0 resets) in 1045 ms. (38 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (0 resets) in 278 ms. (143 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (0 resets) in 495 ms. (80 steps per ms) remains 8/8 properties
// Phase 1: matrix 28660 rows 120 cols
[2024-05-22 18:30:07] [INFO ] Computed 60 invariants in 166 ms
Problem DrinkVendingMachine-PT-10-ReachabilityCardinality-2024-03 is UNSAT
FORMULA DrinkVendingMachine-PT-10-ReachabilityCardinality-2024-03 TRUE TECHNIQUES SMT_REFINEMENT
Problem DrinkVendingMachine-PT-10-ReachabilityCardinality-2024-01 is UNSAT
FORMULA DrinkVendingMachine-PT-10-ReachabilityCardinality-2024-01 TRUE TECHNIQUES SMT_REFINEMENT
Problem DrinkVendingMachine-PT-10-ReachabilityCardinality-2024-02 is UNSAT
FORMULA DrinkVendingMachine-PT-10-ReachabilityCardinality-2024-02 TRUE TECHNIQUES SMT_REFINEMENT
Problem DrinkVendingMachine-PT-10-ReachabilityCardinality-2024-07 is UNSAT
FORMULA DrinkVendingMachine-PT-10-ReachabilityCardinality-2024-07 FALSE TECHNIQUES SMT_REFINEMENT
Problem DrinkVendingMachine-PT-10-ReachabilityCardinality-2024-11 is UNSAT
FORMULA DrinkVendingMachine-PT-10-ReachabilityCardinality-2024-11 TRUE TECHNIQUES SMT_REFINEMENT
Problem DrinkVendingMachine-PT-10-ReachabilityCardinality-2024-12 is UNSAT
FORMULA DrinkVendingMachine-PT-10-ReachabilityCardinality-2024-12 TRUE TECHNIQUES SMT_REFINEMENT
Problem DrinkVendingMachine-PT-10-ReachabilityCardinality-2024-14 is UNSAT
FORMULA DrinkVendingMachine-PT-10-ReachabilityCardinality-2024-14 TRUE TECHNIQUES SMT_REFINEMENT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/120 variables, 60/60 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/120 variables, 0/60 constraints. Problems are: Problem set: 7 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 28780/28780 variables, and 180 constraints, problems are : Problem set: 7 solved, 1 unsolved in 6253 ms.
Refiners :[Positive P Invariants (semi-flows): 60/60 constraints, State Equation: 120/120 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 7 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 0/0 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 50/100 variables, 50/50 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 0/50 constraints. Problems are: Problem set: 7 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 28750/28780 variables, and 150 constraints, problems are : Problem set: 7 solved, 1 unsolved in 4219 ms.
Refiners :[Positive P Invariants (semi-flows): 50/60 constraints, State Equation: 100/120 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 11963ms problems are : Problem set: 7 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 50 out of 120 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 120/120 places, 28660/28660 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 19 ms
Reduce places removed 20 places and 11000 transitions.
Iterating global reduction 0 with 30 rules applied. Total rules applied 30 place count 100 transition count 17650
Ensure Unique test removed 17200 transitions
Reduce isomorphic transitions removed 17200 transitions.
Iterating post reduction 0 with 17200 rules applied. Total rules applied 17230 place count 100 transition count 450
Applied a total of 17230 rules in 2594 ms. Remains 100 /120 variables (removed 20) and now considering 450/28660 (removed 28210) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2611 ms. Remains : 100/120 places, 450/28660 transitions.
RANDOM walk for 40000 steps (8 resets) in 446 ms. (89 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 153 ms. (259 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1103863 steps, run timeout after 3001 ms. (steps per millisecond=367 ) properties seen :0 out of 1
Probabilistic random walk after 1103863 steps, saw 782193 distinct states, run finished after 3005 ms. (steps per millisecond=367 ) properties seen :0
// Phase 1: matrix 450 rows 100 cols
[2024-05-22 18:30:25] [INFO ] Computed 50 invariants in 2 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 50/100 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 450/550 variables, 100/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/550 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 0/550 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 550/550 variables, and 150 constraints, problems are : Problem set: 0 solved, 1 unsolved in 226 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 100/100 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 50/100 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 450/550 variables, 100/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/550 variables, 1/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/550 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 0/550 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 550/550 variables, and 151 constraints, problems are : Problem set: 0 solved, 1 unsolved in 228 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 100/100 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 501ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 60 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=60 )
FORMULA DrinkVendingMachine-PT-10-ReachabilityCardinality-2024-05 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 6 ms.
All properties solved without resorting to model-checking.
Total runtime 27336 ms.
ITS solved all properties within timeout

BK_STOP 1716402625646

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ 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="DrinkVendingMachine-PT-10"
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 DrinkVendingMachine-PT-10, 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 r135-tall-171631131700718"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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