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

About the Execution of GreatSPN+red for Philosophers-PT-000200

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
4310.140 91708.00 158224.00 328.60 TFTTFFFTFFFFFTFT 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-171654406600527.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 Philosophers-PT-000200, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r267-smll-171654406600527
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 6.8M
-rw-r--r-- 1 mcc users 168K Apr 13 10:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 945K Apr 13 10:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 101K Apr 13 10:08 CTLFireability.txt
-rw-r--r-- 1 mcc users 641K Apr 13 10:08 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 72K Apr 23 07:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 284K Apr 23 07:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 71K Apr 23 07:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 342K Apr 23 07:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 227K Apr 13 10:59 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 1.3M Apr 13 10:59 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 301K Apr 13 10:45 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 2.0M Apr 13 10:45 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 20K Apr 23 07:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 55K Apr 23 07:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 445K 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 Philosophers-PT-000200-ReachabilityFireability-2024-00
FORMULA_NAME Philosophers-PT-000200-ReachabilityFireability-2024-01
FORMULA_NAME Philosophers-PT-000200-ReachabilityFireability-2024-02
FORMULA_NAME Philosophers-PT-000200-ReachabilityFireability-2024-03
FORMULA_NAME Philosophers-PT-000200-ReachabilityFireability-2024-04
FORMULA_NAME Philosophers-PT-000200-ReachabilityFireability-2024-05
FORMULA_NAME Philosophers-PT-000200-ReachabilityFireability-2024-06
FORMULA_NAME Philosophers-PT-000200-ReachabilityFireability-2024-07
FORMULA_NAME Philosophers-PT-000200-ReachabilityFireability-2024-08
FORMULA_NAME Philosophers-PT-000200-ReachabilityFireability-2024-09
FORMULA_NAME Philosophers-PT-000200-ReachabilityFireability-2024-10
FORMULA_NAME Philosophers-PT-000200-ReachabilityFireability-2024-11
FORMULA_NAME Philosophers-PT-000200-ReachabilityFireability-2024-12
FORMULA_NAME Philosophers-PT-000200-ReachabilityFireability-2024-13
FORMULA_NAME Philosophers-PT-000200-ReachabilityFireability-2024-14
FORMULA_NAME Philosophers-PT-000200-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1716935592078

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Philosophers-PT-000200
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-28 22:33:14] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-28 22:33:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 22:33:15] [INFO ] Load time of PNML (sax parser for PT used): 425 ms
[2024-05-28 22:33:15] [INFO ] Transformed 1000 places.
[2024-05-28 22:33:15] [INFO ] Transformed 1000 transitions.
[2024-05-28 22:33:15] [INFO ] Found NUPN structural information;
[2024-05-28 22:33:15] [INFO ] Parsed PT model containing 1000 places and 1000 transitions and 3200 arcs in 668 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 202 ms.
Working with output stream class java.io.PrintStream
FORMULA Philosophers-PT-000200-ReachabilityFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-000200-ReachabilityFireability-2024-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (8 resets) in 3499 ms. (11 steps per ms) remains 3/14 properties
FORMULA Philosophers-PT-000200-ReachabilityFireability-2024-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Philosophers-PT-000200-ReachabilityFireability-2024-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Philosophers-PT-000200-ReachabilityFireability-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Philosophers-PT-000200-ReachabilityFireability-2024-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Philosophers-PT-000200-ReachabilityFireability-2024-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Philosophers-PT-000200-ReachabilityFireability-2024-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Philosophers-PT-000200-ReachabilityFireability-2024-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Philosophers-PT-000200-ReachabilityFireability-2024-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Philosophers-PT-000200-ReachabilityFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Philosophers-PT-000200-ReachabilityFireability-2024-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Philosophers-PT-000200-ReachabilityFireability-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 4290 ms. (9 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 13628 ms. (2 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 474 ms. (84 steps per ms) remains 3/3 properties
// Phase 1: matrix 1000 rows 1000 cols
[2024-05-28 22:33:21] [INFO ] Computed 400 invariants in 39 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1000 variables, 1000/1000 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1000 variables, 400/1400 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1000 variables, 0/1400 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 1000/2000 variables, 1000/2400 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2000 variables, 0/2400 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 0/2000 variables, 0/2400 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2000/2000 variables, and 2400 constraints, problems are : Problem set: 0 solved, 3 unsolved in 3180 ms.
Refiners :[Domain max(s): 1000/1000 constraints, Positive P Invariants (semi-flows): 400/400 constraints, State Equation: 1000/1000 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1000 variables, 1000/1000 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1000 variables, 400/1400 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1000 variables, 0/1400 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 1000/2000 variables, 1000/2400 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2000/2000 variables, and 2403 constraints, problems are : Problem set: 0 solved, 3 unsolved in 6939 ms.
Refiners :[Domain max(s): 1000/1000 constraints, Positive P Invariants (semi-flows): 400/400 constraints, State Equation: 1000/1000 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 15728ms problems are : Problem set: 0 solved, 3 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1000 out of 1000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1000/1000 places, 1000/1000 transitions.
Applied a total of 0 rules in 70 ms. Remains 1000 /1000 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 103 ms. Remains : 1000/1000 places, 1000/1000 transitions.
RANDOM walk for 40000 steps (8 resets) in 1739 ms. (22 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 3419 ms. (11 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 13876 ms. (2 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 476 ms. (83 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 385829 steps, run timeout after 15004 ms. (steps per millisecond=25 ) properties seen :0 out of 3
Probabilistic random walk after 385829 steps, saw 381972 distinct states, run finished after 15013 ms. (steps per millisecond=25 ) properties seen :0
[2024-05-28 22:33:57] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1000 variables, 1000/1000 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1000 variables, 400/1400 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1000 variables, 0/1400 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 1000/2000 variables, 1000/2400 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2000 variables, 0/2400 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 0/2000 variables, 0/2400 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2000/2000 variables, and 2400 constraints, problems are : Problem set: 0 solved, 3 unsolved in 2795 ms.
Refiners :[Domain max(s): 1000/1000 constraints, Positive P Invariants (semi-flows): 400/400 constraints, State Equation: 1000/1000 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1000 variables, 1000/1000 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem Philosophers-PT-000200-ReachabilityFireability-2024-07 is UNSAT
FORMULA Philosophers-PT-000200-ReachabilityFireability-2024-07 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 1 (INCLUDED_ONLY) 0/1000 variables, 400/1400 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1000 variables, 0/1400 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1000/2000 variables, 1000/2400 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2000 variables, 2/2402 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2000 variables, 0/2402 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 0/2000 variables, 0/2402 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2000/2000 variables, and 2402 constraints, problems are : Problem set: 1 solved, 2 unsolved in 38313 ms.
Refiners :[Domain max(s): 1000/1000 constraints, Positive P Invariants (semi-flows): 400/400 constraints, State Equation: 1000/1000 constraints, PredecessorRefiner: 2/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 45663ms problems are : Problem set: 1 solved, 2 unsolved
Finished Parikh walk after 1110 steps, including 6 resets, run visited all 2 properties in 46 ms. (steps per millisecond=24 )
FORMULA Philosophers-PT-000200-ReachabilityFireability-2024-10 FALSE TECHNIQUES PARIKH_WALK
FORMULA Philosophers-PT-000200-ReachabilityFireability-2024-05 FALSE TECHNIQUES PARIKH_WALK
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 2 properties in 70 ms.
All properties solved without resorting to model-checking.
Total runtime 89145 ms.
ITS solved all properties within timeout

BK_STOP 1716935683786

--------------------
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="Philosophers-PT-000200"
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 Philosophers-PT-000200, 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-171654406600527"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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