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

About the Execution of LTSMin+red for BridgeAndVehicles-COL-V20P20N20

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
1679.147 10280.00 29641.00 51.80 TFFTFFFFTTFFFTTF 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.r472-tajo-171620398700055.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 ltsminxred
Input is BridgeAndVehicles-COL-V20P20N20, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r472-tajo-171620398700055
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 508K
-rw-r--r-- 1 mcc users 9.7K Apr 13 00:21 CTLCardinality.txt
-rw-r--r-- 1 mcc users 98K Apr 13 00:21 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Apr 13 00:17 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Apr 13 00:17 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 4.0K Apr 22 14:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 22 14:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Apr 22 14:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.8K Apr 13 00:50 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 74K Apr 13 00:50 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K Apr 13 00:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 102K Apr 13 00:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 22 14:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Apr 22 14:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:42 equiv_pt
-rw-r--r-- 1 mcc users 10 May 18 16:42 instance
-rw-r--r-- 1 mcc users 5 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 40K 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-COL-V20P20N20-ReachabilityFireability-2024-00
FORMULA_NAME BridgeAndVehicles-COL-V20P20N20-ReachabilityFireability-2024-01
FORMULA_NAME BridgeAndVehicles-COL-V20P20N20-ReachabilityFireability-2024-02
FORMULA_NAME BridgeAndVehicles-COL-V20P20N20-ReachabilityFireability-2024-03
FORMULA_NAME BridgeAndVehicles-COL-V20P20N20-ReachabilityFireability-2024-04
FORMULA_NAME BridgeAndVehicles-COL-V20P20N20-ReachabilityFireability-2024-05
FORMULA_NAME BridgeAndVehicles-COL-V20P20N20-ReachabilityFireability-2024-06
FORMULA_NAME BridgeAndVehicles-COL-V20P20N20-ReachabilityFireability-2024-07
FORMULA_NAME BridgeAndVehicles-COL-V20P20N20-ReachabilityFireability-2024-08
FORMULA_NAME BridgeAndVehicles-COL-V20P20N20-ReachabilityFireability-2024-09
FORMULA_NAME BridgeAndVehicles-COL-V20P20N20-ReachabilityFireability-2024-10
FORMULA_NAME BridgeAndVehicles-COL-V20P20N20-ReachabilityFireability-2024-11
FORMULA_NAME BridgeAndVehicles-COL-V20P20N20-ReachabilityFireability-2024-12
FORMULA_NAME BridgeAndVehicles-COL-V20P20N20-ReachabilityFireability-2024-13
FORMULA_NAME BridgeAndVehicles-COL-V20P20N20-ReachabilityFireability-2024-14
FORMULA_NAME BridgeAndVehicles-COL-V20P20N20-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717218059090

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BridgeAndVehicles-COL-V20P20N20
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 05:01:00] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 05:01:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 05:01:00] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-06-01 05:01:00] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-06-01 05:01:01] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 521 ms
[2024-06-01 05:01:01] [INFO ] Imported 15 HL places and 11 HL transitions for a total of 78 PT places and 37258.0 transition bindings in 15 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 19 ms.
Reduction of identical properties reduced properties to check from 16 to 15
Working with output stream class java.io.PrintStream
FORMULA BridgeAndVehicles-COL-V20P20N20-ReachabilityFireability-2024-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V20P20N20-ReachabilityFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 05:01:01] [INFO ] Built PT skeleton of HLPN with 15 places and 11 transitions 56 arcs in 3 ms.
[2024-06-01 05:01:01] [INFO ] Skeletonized 13 HLPN properties in 1 ms.
All 13 properties of the HLPN use transition enablings in a way that makes the skeleton too coarse.
Arc [13:1*[(MOD (ADD $cpt 1) 21)]] contains successor/predecessor on variables of sort compteur
Arc [1:1*[(MOD (ADD $cA 1) 21)]] contains successor/predecessor on variables of sort voitureA
Arc [6:1*[(MOD (ADD (MOD (MINUS $cB 1) 21) 21) 21)]] contains successor/predecessor on variables of sort voitureB
Arc [14:1*[(MOD (ADD $s 1) 2)]] contains successor/predecessor on variables of sort sens
[2024-06-01 05:01:01] [INFO ] Unfolded HLPN to a Petri net with 78 places and 968 transitions 7350 arcs in 60 ms.
[2024-06-01 05:01:01] [INFO ] Unfolded 13 HLPN properties in 1 ms.
Initial state reduction rules removed 1 formulas.
FORMULA BridgeAndVehicles-COL-V20P20N20-ReachabilityFireability-2024-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (228 resets) in 3363 ms. (11 steps per ms) remains 5/12 properties
FORMULA BridgeAndVehicles-COL-V20P20N20-ReachabilityFireability-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-COL-V20P20N20-ReachabilityFireability-2024-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-COL-V20P20N20-ReachabilityFireability-2024-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-COL-V20P20N20-ReachabilityFireability-2024-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-COL-V20P20N20-ReachabilityFireability-2024-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-COL-V20P20N20-ReachabilityFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-COL-V20P20N20-ReachabilityFireability-2024-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-COL-V20P20N20-ReachabilityFireability-2024-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40001 steps (105 resets) in 550 ms. (72 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40000 steps (108 resets) in 2800 ms. (14 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (108 resets) in 1237 ms. (32 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (108 resets) in 3287 ms. (12 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (72 resets) in 3080 ms. (12 steps per ms) remains 5/5 properties
[2024-06-01 05:01:05] [INFO ] Flow matrix only has 170 transitions (discarded 798 similar events)
// Phase 1: matrix 170 rows 78 cols
[2024-06-01 05:01:05] [INFO ] Computed 7 invariants in 26 ms
[2024-06-01 05:01:05] [INFO ] State equation strengthened by 42 read => feed constraints.
Problem BridgeAndVehicles-COL-V20P20N20-ReachabilityFireability-2024-05 is UNSAT
FORMULA BridgeAndVehicles-COL-V20P20N20-ReachabilityFireability-2024-05 FALSE TECHNIQUES SMT_REFINEMENT
Problem BridgeAndVehicles-COL-V20P20N20-ReachabilityFireability-2024-07 is UNSAT
FORMULA BridgeAndVehicles-COL-V20P20N20-ReachabilityFireability-2024-07 FALSE TECHNIQUES SMT_REFINEMENT
Problem BridgeAndVehicles-COL-V20P20N20-ReachabilityFireability-2024-09 is UNSAT
FORMULA BridgeAndVehicles-COL-V20P20N20-ReachabilityFireability-2024-09 TRUE TECHNIQUES SMT_REFINEMENT
Problem BridgeAndVehicles-COL-V20P20N20-ReachabilityFireability-2024-13 is UNSAT
FORMULA BridgeAndVehicles-COL-V20P20N20-ReachabilityFireability-2024-13 TRUE TECHNIQUES SMT_REFINEMENT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 5/5 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/76 variables, 0/5 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 2/78 variables, 2/7 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/78 variables, 0/7 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 170/248 variables, 78/85 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/248 variables, 42/127 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/248 variables, 0/127 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/248 variables, 0/127 constraints. Problems are: Problem set: 4 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 248/248 variables, and 127 constraints, problems are : Problem set: 4 solved, 1 unsolved in 367 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 78/78 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 4 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 1/1 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/25 variables, 0/1 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 27/52 variables, 3/4 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/52 variables, 0/4 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 2/54 variables, 1/5 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 0/5 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 3/57 variables, 1/6 constraints. Problems are: Problem set: 4 solved, 1 unsolved
[2024-06-01 05:01:08] [INFO ] Deduced a trap composed of 6 places in 173 ms of which 9 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/57 variables, 1/7 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/57 variables, 0/7 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 170/227 variables, 57/64 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/227 variables, 42/106 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/227 variables, 0/106 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 21/248 variables, 21/127 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/248 variables, 1/128 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/248 variables, 1/129 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/248 variables, 0/129 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/248 variables, 0/129 constraints. Problems are: Problem set: 4 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 248/248 variables, and 129 constraints, problems are : Problem set: 4 solved, 1 unsolved in 522 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 78/78 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 1/5 constraints, Known Traps: 1/1 constraints]
After SMT, in 3115ms problems are : Problem set: 4 solved, 1 unsolved
Parikh walk visited 0 properties in 179 ms.
Support contains 25 out of 78 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 78/78 places, 968/968 transitions.
Graph (complete) has 642 edges and 78 vertex of which 76 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.6 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 75 transition count 967
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 75 transition count 967
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 73 transition count 966
Applied a total of 6 rules in 158 ms. Remains 73 /78 variables (removed 5) and now considering 966/968 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 173 ms. Remains : 73/78 places, 966/968 transitions.
RANDOM walk for 40000 steps (313 resets) in 502 ms. (79 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (160 resets) in 270 ms. (147 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 208 steps, run visited all 1 properties in 18 ms. (steps per millisecond=11 )
Probabilistic random walk after 208 steps, saw 148 distinct states, run finished after 22 ms. (steps per millisecond=9 ) properties seen :1
FORMULA BridgeAndVehicles-COL-V20P20N20-ReachabilityFireability-2024-00 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
All properties solved without resorting to model-checking.
Total runtime 8880 ms.
ITS solved all properties within timeout

BK_STOP 1717218069370

--------------------
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 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-COL-V20P20N20"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is BridgeAndVehicles-COL-V20P20N20, 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 r472-tajo-171620398700055"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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