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

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

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
790.184 10019.00 30408.00 78.60 FFTTFTTTFFTFFFFF 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-171620397700207.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-V20P20N10, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r047-tajo-171620397700207
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.0M
-rw-r--r-- 1 mcc users 15K Apr 13 01:39 CTLCardinality.txt
-rw-r--r-- 1 mcc users 100K Apr 13 01:39 CTLCardinality.xml
-rw-r--r-- 1 mcc users 52K Apr 13 01:37 CTLFireability.txt
-rw-r--r-- 1 mcc users 220K Apr 13 01:37 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 6.4K Apr 22 14:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 35K Apr 22 14:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 26K Apr 22 14:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 86K Apr 22 14:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 25K Apr 13 01:56 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 181K Apr 13 01:56 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 156K Apr 13 01:53 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 648K Apr 13 01:53 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.4K Apr 22 14:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.1K Apr 22 14:29 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 434K 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-V20P20N10-ReachabilityFireability-2024-00
FORMULA_NAME BridgeAndVehicles-PT-V20P20N10-ReachabilityFireability-2024-01
FORMULA_NAME BridgeAndVehicles-PT-V20P20N10-ReachabilityFireability-2024-02
FORMULA_NAME BridgeAndVehicles-PT-V20P20N10-ReachabilityFireability-2024-03
FORMULA_NAME BridgeAndVehicles-PT-V20P20N10-ReachabilityFireability-2024-04
FORMULA_NAME BridgeAndVehicles-PT-V20P20N10-ReachabilityFireability-2024-05
FORMULA_NAME BridgeAndVehicles-PT-V20P20N10-ReachabilityFireability-2024-06
FORMULA_NAME BridgeAndVehicles-PT-V20P20N10-ReachabilityFireability-2024-07
FORMULA_NAME BridgeAndVehicles-PT-V20P20N10-ReachabilityFireability-2024-08
FORMULA_NAME BridgeAndVehicles-PT-V20P20N10-ReachabilityFireability-2024-09
FORMULA_NAME BridgeAndVehicles-PT-V20P20N10-ReachabilityFireability-2024-10
FORMULA_NAME BridgeAndVehicles-PT-V20P20N10-ReachabilityFireability-2024-11
FORMULA_NAME BridgeAndVehicles-PT-V20P20N10-ReachabilityFireability-2024-12
FORMULA_NAME BridgeAndVehicles-PT-V20P20N10-ReachabilityFireability-2024-13
FORMULA_NAME BridgeAndVehicles-PT-V20P20N10-ReachabilityFireability-2024-14
FORMULA_NAME BridgeAndVehicles-PT-V20P20N10-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1716285942053

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-V20P20N10
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-21 10:05:43] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-21 10:05:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 10:05:43] [INFO ] Load time of PNML (sax parser for PT used): 161 ms
[2024-05-21 10:05:44] [INFO ] Transformed 68 places.
[2024-05-21 10:05:44] [INFO ] Transformed 548 transitions.
[2024-05-21 10:05:44] [INFO ] Parsed PT model containing 68 places and 548 transitions and 4070 arcs in 314 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 92 ms.
Working with output stream class java.io.PrintStream
FORMULA BridgeAndVehicles-PT-V20P20N10-ReachabilityFireability-2024-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (224 resets) in 2580 ms. (15 steps per ms) remains 10/15 properties
FORMULA BridgeAndVehicles-PT-V20P20N10-ReachabilityFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V20P20N10-ReachabilityFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V20P20N10-ReachabilityFireability-2024-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V20P20N10-ReachabilityFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V20P20N10-ReachabilityFireability-2024-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40001 steps (104 resets) in 5913 ms. (6 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (84 resets) in 1562 ms. (25 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (88 resets) in 1509 ms. (26 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (83 resets) in 616 ms. (64 steps per ms) remains 9/10 properties
FORMULA BridgeAndVehicles-PT-V20P20N10-ReachabilityFireability-2024-09 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (84 resets) in 412 ms. (96 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (89 resets) in 570 ms. (70 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (88 resets) in 507 ms. (78 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40001 steps (92 resets) in 570 ms. (70 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (88 resets) in 357 ms. (111 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (84 resets) in 451 ms. (88 steps per ms) remains 9/9 properties
[2024-05-21 10:05:48] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 68 cols
[2024-05-21 10:05:48] [INFO ] Computed 7 invariants in 9 ms
[2024-05-21 10:05:48] [INFO ] State equation strengthened by 22 read => feed constraints.
Problem BridgeAndVehicles-PT-V20P20N10-ReachabilityFireability-2024-02 is UNSAT
FORMULA BridgeAndVehicles-PT-V20P20N10-ReachabilityFireability-2024-02 TRUE TECHNIQUES SMT_REFINEMENT
Problem BridgeAndVehicles-PT-V20P20N10-ReachabilityFireability-2024-06 is UNSAT
FORMULA BridgeAndVehicles-PT-V20P20N10-ReachabilityFireability-2024-06 TRUE TECHNIQUES SMT_REFINEMENT
Problem BridgeAndVehicles-PT-V20P20N10-ReachabilityFireability-2024-08 is UNSAT
FORMULA BridgeAndVehicles-PT-V20P20N10-ReachabilityFireability-2024-08 FALSE TECHNIQUES SMT_REFINEMENT
Problem BridgeAndVehicles-PT-V20P20N10-ReachabilityFireability-2024-11 is UNSAT
FORMULA BridgeAndVehicles-PT-V20P20N10-ReachabilityFireability-2024-11 FALSE TECHNIQUES SMT_REFINEMENT
Problem BridgeAndVehicles-PT-V20P20N10-ReachabilityFireability-2024-12 is UNSAT
FORMULA BridgeAndVehicles-PT-V20P20N10-ReachabilityFireability-2024-12 FALSE TECHNIQUES SMT_REFINEMENT
Problem BridgeAndVehicles-PT-V20P20N10-ReachabilityFireability-2024-13 is UNSAT
FORMULA BridgeAndVehicles-PT-V20P20N10-ReachabilityFireability-2024-13 FALSE TECHNIQUES SMT_REFINEMENT
Problem BridgeAndVehicles-PT-V20P20N10-ReachabilityFireability-2024-14 is UNSAT
FORMULA BridgeAndVehicles-PT-V20P20N10-ReachabilityFireability-2024-14 FALSE TECHNIQUES SMT_REFINEMENT
Problem BridgeAndVehicles-PT-V20P20N10-ReachabilityFireability-2024-15 is UNSAT
FORMULA BridgeAndVehicles-PT-V20P20N10-ReachabilityFireability-2024-15 FALSE TECHNIQUES SMT_REFINEMENT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 5/5 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 0/5 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 2/68 variables, 2/7 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/68 variables, 0/7 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 130/198 variables, 68/75 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/198 variables, 22/97 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/198 variables, 0/97 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/198 variables, 0/97 constraints. Problems are: Problem set: 8 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 198/198 variables, and 97 constraints, problems are : Problem set: 8 solved, 1 unsolved in 696 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 68/68 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 8 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 55/59 variables, 4/4 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 0/4 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 128/187 variables, 59/63 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/187 variables, 22/85 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/187 variables, 0/85 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 9/196 variables, 7/92 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/196 variables, 1/93 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/196 variables, 1/94 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/196 variables, 0/94 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 2/198 variables, 2/96 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/198 variables, 2/98 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/198 variables, 0/98 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/198 variables, 0/98 constraints. Problems are: Problem set: 8 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 198/198 variables, and 98 constraints, problems are : Problem set: 8 solved, 1 unsolved in 279 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 68/68 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 1/9 constraints, Known Traps: 0/0 constraints]
After SMT, in 2357ms problems are : Problem set: 8 solved, 1 unsolved
Parikh walk visited 0 properties in 30 ms.
Support contains 4 out of 68 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 68/68 places, 548/548 transitions.
Graph (complete) has 562 edges and 68 vertex of which 66 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Discarding 2 places :
Also discarding 0 output transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 65 transition count 547
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 65 transition count 547
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 63 transition count 546
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 10 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 10 place count 61 transition count 544
Applied a total of 10 rules in 170 ms. Remains 61 /68 variables (removed 7) and now considering 544/548 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 195 ms. Remains : 61/68 places, 544/548 transitions.
RANDOM walk for 40000 steps (316 resets) in 383 ms. (104 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (147 resets) in 142 ms. (279 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 15071 steps, run visited all 1 properties in 342 ms. (steps per millisecond=44 )
Probabilistic random walk after 15071 steps, saw 5331 distinct states, run finished after 372 ms. (steps per millisecond=40 ) properties seen :1
FORMULA BridgeAndVehicles-PT-V20P20N10-ReachabilityFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
All properties solved without resorting to model-checking.
Total runtime 8292 ms.
ITS solved all properties within timeout

BK_STOP 1716285952072

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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="BridgeAndVehicles-PT-V20P20N10"
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-V20P20N10, 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-171620397700207"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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