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-171620505500270.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 CSRepetitions-PT-10, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r476-tall-171620505500270
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 20M
-rw-r--r-- 1 mcc users 559K Apr 12 10:46 CTLCardinality.txt
-rw-r--r-- 1 mcc users 1.9M Apr 12 10:46 CTLCardinality.xml
-rw-r--r-- 1 mcc users 699K Apr 12 10:29 CTLFireability.txt
-rw-r--r-- 1 mcc users 2.9M Apr 12 10:29 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 243K Apr 22 14:32 LTLCardinality.txt
-rw-r--r-- 1 mcc users 645K Apr 22 14:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 252K Apr 22 14:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 779K Apr 22 14:32 LTLFireability.xml
-rw-r--r-- 1 mcc users 562K Apr 12 12:26 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 2.0M Apr 12 12:26 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 1.7M Apr 12 12:04 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 6.8M Apr 12 12:04 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 34K Apr 22 14:32 UpperBounds.txt
-rw-r--r-- 1 mcc users 67K Apr 22 14:32 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 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 1.2M 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 CSRepetitions-PT-10-ReachabilityCardinality-2024-00
FORMULA_NAME CSRepetitions-PT-10-ReachabilityCardinality-2024-01
FORMULA_NAME CSRepetitions-PT-10-ReachabilityCardinality-2024-02
FORMULA_NAME CSRepetitions-PT-10-ReachabilityCardinality-2024-03
FORMULA_NAME CSRepetitions-PT-10-ReachabilityCardinality-2024-04
FORMULA_NAME CSRepetitions-PT-10-ReachabilityCardinality-2024-05
FORMULA_NAME CSRepetitions-PT-10-ReachabilityCardinality-2024-06
FORMULA_NAME CSRepetitions-PT-10-ReachabilityCardinality-2024-07
FORMULA_NAME CSRepetitions-PT-10-ReachabilityCardinality-2024-08
FORMULA_NAME CSRepetitions-PT-10-ReachabilityCardinality-2024-09
FORMULA_NAME CSRepetitions-PT-10-ReachabilityCardinality-2024-10
FORMULA_NAME CSRepetitions-PT-10-ReachabilityCardinality-2024-11
FORMULA_NAME CSRepetitions-PT-10-ReachabilityCardinality-2024-12
FORMULA_NAME CSRepetitions-PT-10-ReachabilityCardinality-2024-13
FORMULA_NAME CSRepetitions-PT-10-ReachabilityCardinality-2024-14
FORMULA_NAME CSRepetitions-PT-10-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717203444284

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CSRepetitions-PT-10
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 00:57:25] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 00:57:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 00:57:25] [INFO ] Load time of PNML (sax parser for PT used): 164 ms
[2024-06-01 00:57:25] [INFO ] Transformed 1311 places.
[2024-06-01 00:57:25] [INFO ] Transformed 2300 transitions.
[2024-06-01 00:57:25] [INFO ] Parsed PT model containing 1311 places and 2300 transitions and 8700 arcs in 272 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 91 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (217 resets) in 3211 ms. (12 steps per ms) remains 9/16 properties
FORMULA CSRepetitions-PT-10-ReachabilityCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CSRepetitions-PT-10-ReachabilityCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CSRepetitions-PT-10-ReachabilityCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CSRepetitions-PT-10-ReachabilityCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CSRepetitions-PT-10-ReachabilityCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CSRepetitions-PT-10-ReachabilityCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CSRepetitions-PT-10-ReachabilityCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 167 ms. (238 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 2948 ms. (13 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 760 ms. (52 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 151 ms. (263 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 125 ms. (317 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 193 ms. (206 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 240 ms. (165 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 183 ms. (217 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 173 ms. (229 steps per ms) remains 9/9 properties
// Phase 1: matrix 2300 rows 1311 cols
[2024-06-01 00:57:28] [INFO ] Computed 110 invariants in 56 ms
[2024-06-01 00:57:28] [INFO ] State equation strengthened by 100 read => feed constraints.
Problem CSRepetitions-PT-10-ReachabilityCardinality-2024-08 is UNSAT
FORMULA CSRepetitions-PT-10-ReachabilityCardinality-2024-08 TRUE TECHNIQUES SMT_REFINEMENT
Problem CSRepetitions-PT-10-ReachabilityCardinality-2024-09 is UNSAT
FORMULA CSRepetitions-PT-10-ReachabilityCardinality-2024-09 TRUE TECHNIQUES SMT_REFINEMENT
Problem CSRepetitions-PT-10-ReachabilityCardinality-2024-10 is UNSAT
FORMULA CSRepetitions-PT-10-ReachabilityCardinality-2024-10 TRUE TECHNIQUES SMT_REFINEMENT
Problem CSRepetitions-PT-10-ReachabilityCardinality-2024-14 is UNSAT
FORMULA CSRepetitions-PT-10-ReachabilityCardinality-2024-14 TRUE TECHNIQUES SMT_REFINEMENT
Problem CSRepetitions-PT-10-ReachabilityCardinality-2024-15 is UNSAT
FORMULA CSRepetitions-PT-10-ReachabilityCardinality-2024-15 TRUE TECHNIQUES SMT_REFINEMENT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1311 variables, 110/110 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1311 variables, 0/110 constraints. Problems are: Problem set: 5 solved, 4 unsolved
Problem CSRepetitions-PT-10-ReachabilityCardinality-2024-00 is UNSAT
FORMULA CSRepetitions-PT-10-ReachabilityCardinality-2024-00 FALSE TECHNIQUES SMT_REFINEMENT
Problem CSRepetitions-PT-10-ReachabilityCardinality-2024-02 is UNSAT
FORMULA CSRepetitions-PT-10-ReachabilityCardinality-2024-02 FALSE TECHNIQUES SMT_REFINEMENT
Problem CSRepetitions-PT-10-ReachabilityCardinality-2024-04 is UNSAT
FORMULA CSRepetitions-PT-10-ReachabilityCardinality-2024-04 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 2300/3611 variables, 1311/1421 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/3611 variables, 100/1521 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3611 variables, 0/1521 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 0/3611 variables, 0/1521 constraints. Problems are: Problem set: 8 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3611/3611 variables, and 1521 constraints, problems are : Problem set: 8 solved, 1 unsolved in 1363 ms.
Refiners :[Positive P Invariants (semi-flows): 110/110 constraints, State Equation: 1311/1311 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 9/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 8 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 400/405 variables, 4/4 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/405 variables, 0/4 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 808/1213 variables, 405/409 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1213 variables, 0/409 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1804/3017 variables, 312/721 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3017 variables, 100/821 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3017 variables, 100/921 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3017 variables, 1/922 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3017 variables, 0/922 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 594/3611 variables, 6/928 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3611 variables, 594/1522 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3611 variables, 0/1522 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/3611 variables, 0/1522 constraints. Problems are: Problem set: 8 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3611/3611 variables, and 1522 constraints, problems are : Problem set: 8 solved, 1 unsolved in 868 ms.
Refiners :[Positive P Invariants (semi-flows): 110/110 constraints, State Equation: 1311/1311 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 1/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 3118ms problems are : Problem set: 8 solved, 1 unsolved
Finished Parikh walk after 20 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=20 )
FORMULA CSRepetitions-PT-10-ReachabilityCardinality-2024-12 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 7 ms.
All properties solved without resorting to model-checking.
Total runtime 6020 ms.
ITS solved all properties within timeout

BK_STOP 1717203451425

--------------------
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 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="CSRepetitions-PT-10"
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 CSRepetitions-PT-10, 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 r476-tall-171620505500270"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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