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

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

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
364.163 7012.00 19948.00 50.30 FFFFFFTTTFFTFFTF 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-171620398800086.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-V50P20N50, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r472-tajo-171620398800086
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 464K
-rw-r--r-- 1 mcc users 5.7K Apr 13 01:53 CTLCardinality.txt
-rw-r--r-- 1 mcc users 48K Apr 13 01:53 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Apr 13 01:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Apr 13 01:47 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.4K Apr 22 14:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 22 14:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Apr 22 14:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 13 03:40 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 100K Apr 13 03:40 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 13 03:32 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 82K Apr 13 03:32 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 22 14:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Apr 22 14:30 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 44K 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-V50P20N50-ReachabilityCardinality-2024-00
FORMULA_NAME BridgeAndVehicles-COL-V50P20N50-ReachabilityCardinality-2024-01
FORMULA_NAME BridgeAndVehicles-COL-V50P20N50-ReachabilityCardinality-2024-02
FORMULA_NAME BridgeAndVehicles-COL-V50P20N50-ReachabilityCardinality-2024-03
FORMULA_NAME BridgeAndVehicles-COL-V50P20N50-ReachabilityCardinality-2024-04
FORMULA_NAME BridgeAndVehicles-COL-V50P20N50-ReachabilityCardinality-2024-05
FORMULA_NAME BridgeAndVehicles-COL-V50P20N50-ReachabilityCardinality-2024-06
FORMULA_NAME BridgeAndVehicles-COL-V50P20N50-ReachabilityCardinality-2024-07
FORMULA_NAME BridgeAndVehicles-COL-V50P20N50-ReachabilityCardinality-2024-08
FORMULA_NAME BridgeAndVehicles-COL-V50P20N50-ReachabilityCardinality-2024-09
FORMULA_NAME BridgeAndVehicles-COL-V50P20N50-ReachabilityCardinality-2024-10
FORMULA_NAME BridgeAndVehicles-COL-V50P20N50-ReachabilityCardinality-2024-11
FORMULA_NAME BridgeAndVehicles-COL-V50P20N50-ReachabilityCardinality-2024-12
FORMULA_NAME BridgeAndVehicles-COL-V50P20N50-ReachabilityCardinality-2024-13
FORMULA_NAME BridgeAndVehicles-COL-V50P20N50-ReachabilityCardinality-2024-14
FORMULA_NAME BridgeAndVehicles-COL-V50P20N50-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717218649162

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BridgeAndVehicles-COL-V50P20N50
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 05:10:50] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 05:10:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 05:10:50] [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:10:51] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-06-01 05:10:51] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 660 ms
[2024-06-01 05:10:51] [INFO ] Imported 15 HL places and 11 HL transitions for a total of 168 PT places and 531118.0 transition bindings in 19 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 21 ms.
Working with output stream class java.io.PrintStream
[2024-06-01 05:10:51] [INFO ] Built PT skeleton of HLPN with 15 places and 11 transitions 56 arcs in 4 ms.
[2024-06-01 05:10:51] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
Remains 16 properties that can be checked using skeleton over-approximation.
Reduce places removed 3 places and 0 transitions.
Computed a total of 9 stabilizing places and 6 stable transitions
Graph (complete) has 22 edges and 12 vertex of which 10 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
RANDOM walk for 40000 steps (8 resets) in 1810 ms. (22 steps per ms) remains 8/13 properties
BEST_FIRST walk for 40002 steps (8 resets) in 493 ms. (80 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (8 resets) in 142 ms. (279 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 115 ms. (344 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (8 resets) in 362 ms. (110 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 474 ms. (84 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 179 ms. (222 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 174 ms. (228 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (8 resets) in 111 ms. (357 steps per ms) remains 8/8 properties
// Phase 1: matrix 10 rows 12 cols
[2024-06-01 05:10:53] [INFO ] Computed 4 invariants in 3 ms
Problem BridgeAndVehicles-COL-V50P20N50-ReachabilityCardinality-2024-00 is UNSAT
Problem BridgeAndVehicles-COL-V50P20N50-ReachabilityCardinality-2024-02 is UNSAT
Problem BridgeAndVehicles-COL-V50P20N50-ReachabilityCardinality-2024-04 is UNSAT
Problem BridgeAndVehicles-COL-V50P20N50-ReachabilityCardinality-2024-07 is UNSAT
Problem BridgeAndVehicles-COL-V50P20N50-ReachabilityCardinality-2024-13 is UNSAT
Problem BridgeAndVehicles-COL-V50P20N50-ReachabilityCardinality-2024-14 is UNSAT
Problem BridgeAndVehicles-COL-V50P20N50-ReachabilityCardinality-2024-15 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 4/4 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/12 variables, 0/4 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 10/22 variables, 12/16 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/22 variables, 0/16 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 0/22 variables, 0/16 constraints. Problems are: Problem set: 7 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 22/22 variables, and 16 constraints, problems are : Problem set: 7 solved, 1 unsolved in 198 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 12/12 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 7 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 1/1 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/8 variables, 0/1 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 4/12 variables, 3/4 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/12 variables, 0/4 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 10/22 variables, 12/16 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/22 variables, 1/17 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/22 variables, 0/17 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/22 variables, 0/17 constraints. Problems are: Problem set: 7 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 22/22 variables, and 17 constraints, problems are : Problem set: 7 solved, 1 unsolved in 174 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 12/12 constraints, PredecessorRefiner: 1/8 constraints, Known Traps: 0/0 constraints]
After SMT, in 409ms problems are : Problem set: 7 solved, 1 unsolved
Finished Parikh walk after 51 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=51 )
Parikh walk visited 1 properties in 39 ms.
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
[2024-06-01 05:10:53] [INFO ] Flatten gal took : 35 ms
[2024-06-01 05:10:53] [INFO ] Flatten gal took : 3 ms
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
FORMULA BridgeAndVehicles-COL-V50P20N50-ReachabilityCardinality-2024-00 FALSE TECHNIQUES CPN_APPROX
FORMULA BridgeAndVehicles-COL-V50P20N50-ReachabilityCardinality-2024-02 FALSE TECHNIQUES CPN_APPROX
FORMULA BridgeAndVehicles-COL-V50P20N50-ReachabilityCardinality-2024-04 FALSE TECHNIQUES CPN_APPROX
FORMULA BridgeAndVehicles-COL-V50P20N50-ReachabilityCardinality-2024-07 TRUE TECHNIQUES CPN_APPROX
FORMULA BridgeAndVehicles-COL-V50P20N50-ReachabilityCardinality-2024-08 TRUE TECHNIQUES CPN_APPROX
FORMULA BridgeAndVehicles-COL-V50P20N50-ReachabilityCardinality-2024-10 FALSE TECHNIQUES CPN_APPROX
FORMULA BridgeAndVehicles-COL-V50P20N50-ReachabilityCardinality-2024-11 TRUE TECHNIQUES CPN_APPROX
FORMULA BridgeAndVehicles-COL-V50P20N50-ReachabilityCardinality-2024-13 FALSE TECHNIQUES CPN_APPROX
FORMULA BridgeAndVehicles-COL-V50P20N50-ReachabilityCardinality-2024-14 TRUE TECHNIQUES CPN_APPROX
FORMULA BridgeAndVehicles-COL-V50P20N50-ReachabilityCardinality-2024-15 FALSE TECHNIQUES CPN_APPROX
Arc [13:1*[(MOD (ADD $cpt 1) 51)]] contains successor/predecessor on variables of sort compteur
Arc [1:1*[(MOD (ADD $cA 1) 51)]] contains successor/predecessor on variables of sort voitureA
Arc [6:1*[(MOD (ADD (MOD (MINUS $cB 1) 51) 51) 51)]] 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:10:54] [INFO ] Unfolded HLPN to a Petri net with 168 places and 5408 transitions 42330 arcs in 239 ms.
[2024-06-01 05:10:54] [INFO ] Unfolded 16 HLPN properties in 1 ms.
RANDOM walk for 40000 steps (92 resets) in 4752 ms. (8 steps per ms) remains 2/6 properties
FORMULA BridgeAndVehicles-COL-V50P20N50-ReachabilityCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-COL-V50P20N50-ReachabilityCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-COL-V50P20N50-ReachabilityCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-COL-V50P20N50-ReachabilityCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (24 resets) in 1285 ms. (31 steps per ms) remains 1/2 properties
FORMULA BridgeAndVehicles-COL-V50P20N50-ReachabilityCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 2723 steps (0 resets) in 57 ms. (46 steps per ms) remains 0/1 properties
FORMULA BridgeAndVehicles-COL-V50P20N50-ReachabilityCardinality-2024-12 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
All properties solved without resorting to model-checking.
Total runtime 5261 ms.
ITS solved all properties within timeout

BK_STOP 1717218656174

--------------------
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 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="BridgeAndVehicles-COL-V50P20N50"
export BK_EXAMINATION="ReachabilityCardinality"
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-V50P20N50, 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 r472-tajo-171620398800086"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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