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

About the Execution of LTSMin+red for Anderson-PT-05

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
467.976 12690.00 28819.00 267.70 F 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.r466-smll-171620124600203.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 Anderson-PT-05, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r466-smll-171620124600203
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 712K
-rw-r--r-- 1 mcc users 6.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 60K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 22 14:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Apr 22 14:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Apr 12 15:36 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 162K Apr 12 15:36 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 16K Apr 12 15:35 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 108K Apr 12 15:35 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:27 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:27 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 185K 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

FORMULA_NAME StableMarking

=== Now, execution of the tool begins

BK_START 1717200654008

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=Anderson-PT-05
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 00:10:56] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2024-06-01 00:10:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 00:10:56] [INFO ] Load time of PNML (sax parser for PT used): 171 ms
[2024-06-01 00:10:56] [INFO ] Transformed 161 places.
[2024-06-01 00:10:56] [INFO ] Transformed 365 transitions.
[2024-06-01 00:10:56] [INFO ] Found NUPN structural information;
[2024-06-01 00:10:57] [INFO ] Parsed PT model containing 161 places and 365 transitions and 1380 arcs in 416 ms.
RANDOM walk for 40000 steps (8 resets) in 3155 ms. (12 steps per ms) remains 5/161 properties
BEST_FIRST walk for 40004 steps (8 resets) in 166 ms. (239 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (8 resets) in 179 ms. (222 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 95 ms. (416 steps per ms) remains 3/5 properties
// Phase 1: matrix 365 rows 161 cols
[2024-06-01 00:10:58] [INFO ] Computed 13 invariants in 41 ms
[2024-06-01 00:10:58] [INFO ] State equation strengthened by 20 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/3 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 84/87 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/87 variables, 84/90 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 15/102 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/102 variables, 15/106 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/102 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 48/150 variables, 2/108 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/150 variables, 48/156 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/150 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 11/161 variables, 7/163 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/161 variables, 11/174 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/161 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 365/526 variables, 161/335 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/526 variables, 20/355 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/526 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 0/526 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 526/526 variables, and 355 constraints, problems are : Problem set: 0 solved, 3 unsolved in 910 ms.
Refiners :[Domain max(s): 161/161 constraints, Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 161/161 constraints, ReadFeed: 20/20 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/3 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/3 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 84/87 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/87 variables, 84/90 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 15/102 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/102 variables, 15/106 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/102 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 48/150 variables, 2/108 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/150 variables, 48/156 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/150 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 11/161 variables, 7/163 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/161 variables, 11/174 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 00:11:00] [INFO ] Deduced a trap composed of 96 places in 248 ms of which 30 ms to minimize.
[2024-06-01 00:11:00] [INFO ] Deduced a trap composed of 88 places in 240 ms of which 4 ms to minimize.
[2024-06-01 00:11:00] [INFO ] Deduced a trap composed of 65 places in 228 ms of which 3 ms to minimize.
[2024-06-01 00:11:00] [INFO ] Deduced a trap composed of 93 places in 144 ms of which 3 ms to minimize.
[2024-06-01 00:11:00] [INFO ] Deduced a trap composed of 77 places in 146 ms of which 3 ms to minimize.
[2024-06-01 00:11:01] [INFO ] Deduced a trap composed of 65 places in 222 ms of which 3 ms to minimize.
[2024-06-01 00:11:01] [INFO ] Deduced a trap composed of 101 places in 305 ms of which 3 ms to minimize.
[2024-06-01 00:11:01] [INFO ] Deduced a trap composed of 59 places in 161 ms of which 3 ms to minimize.
[2024-06-01 00:11:01] [INFO ] Deduced a trap composed of 80 places in 180 ms of which 3 ms to minimize.
[2024-06-01 00:11:02] [INFO ] Deduced a trap composed of 84 places in 166 ms of which 3 ms to minimize.
[2024-06-01 00:11:02] [INFO ] Deduced a trap composed of 63 places in 127 ms of which 2 ms to minimize.
[2024-06-01 00:11:02] [INFO ] Deduced a trap composed of 100 places in 171 ms of which 3 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/161 variables, 12/186 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/161 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 365/526 variables, 161/347 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/526 variables, 20/367 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/526 variables, 3/370 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/526 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 0/526 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 526/526 variables, and 370 constraints, problems are : Problem set: 0 solved, 3 unsolved in 3495 ms.
Refiners :[Domain max(s): 161/161 constraints, Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 161/161 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 12/12 constraints]
After SMT, in 4528ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 1103 ms.
Support contains 3 out of 161 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 161/161 places, 365/365 transitions.
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 17 Pre rules applied. Total rules applied 0 place count 161 transition count 348
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 0 with 34 rules applied. Total rules applied 34 place count 144 transition count 348
Discarding 37 places :
Symmetric choice reduction at 0 with 37 rule applications. Total rules 71 place count 107 transition count 151
Iterating global reduction 0 with 37 rules applied. Total rules applied 108 place count 107 transition count 151
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 114 place count 104 transition count 148
Applied a total of 114 rules in 99 ms. Remains 104 /161 variables (removed 57) and now considering 148/365 (removed 217) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 121 ms. Remains : 104/161 places, 148/365 transitions.
RANDOM walk for 1275794 steps (2 resets) in 4863 ms. (262 steps per ms) remains 0/3 properties
Able to resolve query StableMarking after proving 161 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK BESTFIRST_WALK TOPOLOGICAL
Total runtime 10099 ms.
ITS solved all properties within timeout

BK_STOP 1717200666698

--------------------
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 StableMarking -timeout 180 -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="Anderson-PT-05"
export BK_EXAMINATION="StableMarking"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
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 Anderson-PT-05, examination is StableMarking"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r466-smll-171620124600203"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Anderson-PT-05.tgz
mv Anderson-PT-05 execution
cd execution
if [ "StableMarking" = "ReachabilityDeadlock" ] || [ "StableMarking" = "UpperBounds" ] || [ "StableMarking" = "QuasiLiveness" ] || [ "StableMarking" = "StableMarking" ] || [ "StableMarking" = "Liveness" ] || [ "StableMarking" = "OneSafe" ] || [ "StableMarking" = "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 [ "StableMarking" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "StableMarking" != "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 "StableMarking.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property StableMarking.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "StableMarking.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 '' StableMarking.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "StableMarking" = "ReachabilityDeadlock" ] || [ "StableMarking" = "QuasiLiveness" ] || [ "StableMarking" = "StableMarking" ] || [ "StableMarking" = "Liveness" ] || [ "StableMarking" = "OneSafe" ] ; then
echo "FORMULA_NAME StableMarking"
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 ;