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

About the Execution of LTSMin+red for CANConstruction-PT-080

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
1183.539 105168.00 136368.00 354.50 TTTTFTTFFTTTTTTT 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.r476-tall-171620505100071.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 ltsminxred
Input is CANConstruction-PT-080, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r476-tall-171620505100071
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 9.9M
-rw-r--r-- 1 mcc users 9.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 19 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 19 15:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.2K Apr 22 14:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Apr 22 14:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 12 20:28 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 114K Apr 12 20:28 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Apr 12 20:04 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 26K Apr 12 20:04 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 22 14:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Apr 22 14:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 9.5M 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 CANConstruction-PT-080-ReachabilityFireability-2024-00
FORMULA_NAME CANConstruction-PT-080-ReachabilityFireability-2024-01
FORMULA_NAME CANConstruction-PT-080-ReachabilityFireability-2024-02
FORMULA_NAME CANConstruction-PT-080-ReachabilityFireability-2024-03
FORMULA_NAME CANConstruction-PT-080-ReachabilityFireability-2024-04
FORMULA_NAME CANConstruction-PT-080-ReachabilityFireability-2024-05
FORMULA_NAME CANConstruction-PT-080-ReachabilityFireability-2024-06
FORMULA_NAME CANConstruction-PT-080-ReachabilityFireability-2024-07
FORMULA_NAME CANConstruction-PT-080-ReachabilityFireability-2024-08
FORMULA_NAME CANConstruction-PT-080-ReachabilityFireability-2024-09
FORMULA_NAME CANConstruction-PT-080-ReachabilityFireability-2024-10
FORMULA_NAME CANConstruction-PT-080-ReachabilityFireability-2024-11
FORMULA_NAME CANConstruction-PT-080-ReachabilityFireability-2024-12
FORMULA_NAME CANConstruction-PT-080-ReachabilityFireability-2024-13
FORMULA_NAME CANConstruction-PT-080-ReachabilityFireability-2024-14
FORMULA_NAME CANConstruction-PT-080-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717183164141

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CANConstruction-PT-080
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 19:19:25] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-31 19:19:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 19:19:25] [INFO ] Load time of PNML (sax parser for PT used): 553 ms
[2024-05-31 19:19:25] [INFO ] Transformed 13762 places.
[2024-05-31 19:19:26] [INFO ] Transformed 26240 transitions.
[2024-05-31 19:19:26] [INFO ] Parsed PT model containing 13762 places and 26240 transitions and 78400 arcs in 768 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 32 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (25 resets) in 3755 ms. (10 steps per ms) remains 8/16 properties
FORMULA CANConstruction-PT-080-ReachabilityFireability-2024-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-080-ReachabilityFireability-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-080-ReachabilityFireability-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-080-ReachabilityFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-080-ReachabilityFireability-2024-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-080-ReachabilityFireability-2024-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-080-ReachabilityFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-080-ReachabilityFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 263 ms. (151 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 316 ms. (126 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 136 ms. (292 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 122 ms. (325 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 141 ms. (281 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 81 ms. (487 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 125 ms. (317 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 143 ms. (277 steps per ms) remains 8/8 properties
// Phase 1: matrix 26240 rows 13762 cols
[2024-05-31 19:19:28] [INFO ] Computed 161 invariants in 340 ms
[2024-05-31 19:19:28] [INFO ] State equation strengthened by 12720 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 13590/13643 variables, 43/43 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13643 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 8 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 38/13681 variables, 38/81 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13681 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 80/13761 variables, 80/161 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 13761/40002 variables, and 161 constraints, problems are : Problem set: 0 solved, 8 unsolved in 5054 ms.
Refiners :[Positive P Invariants (semi-flows): 81/81 constraints, Generalized P Invariants (flows): 80/80 constraints, State Equation: 0/13762 constraints, ReadFeed: 0/12720 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 13590/13643 variables, 43/43 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-31 19:20:04] [INFO ] Deduced a trap composed of 5 places in 29268 ms of which 505 ms to minimize.
SMT process timed out in 37065ms, After SMT, problems are : Problem set: 0 solved, 8 unsolved
Fused 8 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 53 out of 13762 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 13762/13762 places, 26240/26240 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 540 transitions
Trivial Post-agglo rules discarded 540 transitions
Performed 540 trivial Post agglomeration. Transition count delta: 540
Iterating post reduction 0 with 540 rules applied. Total rules applied 540 place count 13762 transition count 25700
Reduce places removed 540 places and 0 transitions.
Iterating post reduction 1 with 540 rules applied. Total rules applied 1080 place count 13222 transition count 25700
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 1080 place count 13222 transition count 25696
Deduced a syphon composed of 4 places in 14 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 1088 place count 13218 transition count 25696
Discarding 6218 places :
Symmetric choice reduction at 2 with 6218 rule applications. Total rules 7306 place count 7000 transition count 13260
Iterating global reduction 2 with 6218 rules applied. Total rules applied 13524 place count 7000 transition count 13260
Performed 76 Post agglomeration using F-continuation condition.Transition count delta: 76
Deduced a syphon composed of 76 places in 8 ms
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 2 with 152 rules applied. Total rules applied 13676 place count 6924 transition count 13184
Free-agglomeration rule applied 124 times.
Iterating global reduction 2 with 124 rules applied. Total rules applied 13800 place count 6924 transition count 13060
Reduce places removed 124 places and 0 transitions.
Iterating post reduction 2 with 124 rules applied. Total rules applied 13924 place count 6800 transition count 13060
Free-agglomeration rule (complex) applied 15 times.
Iterating global reduction 3 with 15 rules applied. Total rules applied 13939 place count 6800 transition count 13045
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 3 with 15 rules applied. Total rules applied 13954 place count 6785 transition count 13045
Partial Free-agglomeration rule applied 40 times.
Drop transitions (Partial Free agglomeration) removed 40 transitions
Iterating global reduction 4 with 40 rules applied. Total rules applied 13994 place count 6785 transition count 13045
Applied a total of 13994 rules in 10718 ms. Remains 6785 /13762 variables (removed 6977) and now considering 13045/26240 (removed 13195) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10733 ms. Remains : 6785/13762 places, 13045/26240 transitions.
RANDOM walk for 40000 steps (69 resets) in 1478 ms. (27 steps per ms) remains 1/8 properties
FORMULA CANConstruction-PT-080-ReachabilityFireability-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-080-ReachabilityFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-080-ReachabilityFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-080-ReachabilityFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-080-ReachabilityFireability-2024-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-080-ReachabilityFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-080-ReachabilityFireability-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 148 ms. (268 steps per ms) remains 1/1 properties
// Phase 1: matrix 13045 rows 6785 cols
[2024-05-31 19:20:16] [INFO ] Computed 161 invariants in 101 ms
[2024-05-31 19:20:16] [INFO ] State equation strengthened by 12817 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 6624/6625 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 19:20:30] [INFO ] Deduced a trap composed of 2 places in 12619 ms of which 42 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/6625 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/6625 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 79/6704 variables, 79/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 19:20:46] [INFO ] Deduced a trap composed of 83 places in 15671 ms of which 57 ms to minimize.
[2024-05-31 19:21:02] [INFO ] Deduced a trap composed of 92 places in 15884 ms of which 46 ms to minimize.
SMT process timed out in 45968ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 6785 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6785/6785 places, 13045/13045 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 6785 transition count 13044
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 6784 transition count 13044
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 6 place count 6780 transition count 13036
Iterating global reduction 2 with 4 rules applied. Total rules applied 10 place count 6780 transition count 13036
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 2 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 46 place count 6762 transition count 13018
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 3 places in 3 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 52 place count 6759 transition count 13019
Applied a total of 52 rules in 5950 ms. Remains 6759 /6785 variables (removed 26) and now considering 13019/13045 (removed 26) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5950 ms. Remains : 6759/6785 places, 13019/13045 transitions.
RANDOM walk for 40000 steps (70 resets) in 1132 ms. (35 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 113 ms. (350 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 62139 steps, run visited all 1 properties in 623 ms. (steps per millisecond=99 )
Probabilistic random walk after 62139 steps, saw 60711 distinct states, run finished after 628 ms. (steps per millisecond=98 ) properties seen :1
FORMULA CANConstruction-PT-080-ReachabilityFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
All properties solved without resorting to model-checking.
Total runtime 103982 ms.
ITS solved all properties within timeout

BK_STOP 1717183269309

--------------------
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="CANConstruction-PT-080"
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 CANConstruction-PT-080, 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 r476-tall-171620505100071"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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