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.r579-smll-171734921100054.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 MedleyA-PT-07, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r579-smll-171734921100054
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 560K
-rw-r--r-- 1 mcc users 6.4K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 72K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 31K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 12K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 129K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.4K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 74K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 82K Jun 2 16:33 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 MedleyA-PT-07-ReachabilityCardinality-2024-00
FORMULA_NAME MedleyA-PT-07-ReachabilityCardinality-2024-01
FORMULA_NAME MedleyA-PT-07-ReachabilityCardinality-2024-02
FORMULA_NAME MedleyA-PT-07-ReachabilityCardinality-2024-03
FORMULA_NAME MedleyA-PT-07-ReachabilityCardinality-2024-04
FORMULA_NAME MedleyA-PT-07-ReachabilityCardinality-2024-05
FORMULA_NAME MedleyA-PT-07-ReachabilityCardinality-2024-06
FORMULA_NAME MedleyA-PT-07-ReachabilityCardinality-2024-07
FORMULA_NAME MedleyA-PT-07-ReachabilityCardinality-2024-08
FORMULA_NAME MedleyA-PT-07-ReachabilityCardinality-2024-09
FORMULA_NAME MedleyA-PT-07-ReachabilityCardinality-2024-10
FORMULA_NAME MedleyA-PT-07-ReachabilityCardinality-2024-11
FORMULA_NAME MedleyA-PT-07-ReachabilityCardinality-2024-12
FORMULA_NAME MedleyA-PT-07-ReachabilityCardinality-2024-13
FORMULA_NAME MedleyA-PT-07-ReachabilityCardinality-2024-14
FORMULA_NAME MedleyA-PT-07-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717353939405

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyA-PT-07
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-02 18:45:41] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-06-02 18:45:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 18:45:42] [INFO ] Load time of PNML (sax parser for PT used): 180 ms
[2024-06-02 18:45:42] [INFO ] Transformed 145 places.
[2024-06-02 18:45:42] [INFO ] Transformed 287 transitions.
[2024-06-02 18:45:42] [INFO ] Found NUPN structural information;
[2024-06-02 18:45:42] [INFO ] Parsed PT model containing 145 places and 287 transitions and 1240 arcs in 430 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 47 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 2 places in 9 ms
Reduce places removed 2 places and 2 transitions.
FORMULA MedleyA-PT-07-ReachabilityCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (1402 resets) in 3852 ms. (10 steps per ms) remains 9/15 properties
FORMULA MedleyA-PT-07-ReachabilityCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-07-ReachabilityCardinality-2024-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-07-ReachabilityCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-07-ReachabilityCardinality-2024-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-07-ReachabilityCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-07-ReachabilityCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (335 resets) in 686 ms. (58 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (318 resets) in 994 ms. (40 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (308 resets) in 97 ms. (408 steps per ms) remains 8/9 properties
FORMULA MedleyA-PT-07-ReachabilityCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (381 resets) in 127 ms. (312 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (317 resets) in 80 ms. (493 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (319 resets) in 203 ms. (196 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (314 resets) in 110 ms. (360 steps per ms) remains 7/8 properties
FORMULA MedleyA-PT-07-ReachabilityCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (301 resets) in 130 ms. (305 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40001 steps (317 resets) in 120 ms. (330 steps per ms) remains 7/7 properties
// Phase 1: matrix 285 rows 143 cols
[2024-06-02 18:45:44] [INFO ] Computed 11 invariants in 25 ms
Problem MedleyA-PT-07-ReachabilityCardinality-2024-01 is UNSAT
FORMULA MedleyA-PT-07-ReachabilityCardinality-2024-01 FALSE TECHNIQUES SMT_REFINEMENT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 52/52 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/52 variables, 0/52 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 52/104 variables, 6/58 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 52/110 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 0/110 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 39/143 variables, 5/115 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/143 variables, 39/154 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/143 variables, 0/154 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 285/428 variables, 143/297 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/428 variables, 0/297 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 0/428 variables, 0/297 constraints. Problems are: Problem set: 1 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 428/428 variables, and 297 constraints, problems are : Problem set: 1 solved, 6 unsolved in 784 ms.
Refiners :[Domain max(s): 143/143 constraints, Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 143/143 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 41/41 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/41 variables, 0/41 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 58/99 variables, 6/47 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 58/105 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 0/105 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 44/143 variables, 5/110 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/143 variables, 44/154 constraints. Problems are: Problem set: 1 solved, 6 unsolved
[2024-06-02 18:45:45] [INFO ] Deduced a trap composed of 44 places in 181 ms of which 34 ms to minimize.
[2024-06-02 18:45:46] [INFO ] Deduced a trap composed of 33 places in 151 ms of which 2 ms to minimize.
[2024-06-02 18:45:46] [INFO ] Deduced a trap composed of 26 places in 121 ms of which 2 ms to minimize.
[2024-06-02 18:45:46] [INFO ] Deduced a trap composed of 27 places in 112 ms of which 2 ms to minimize.
[2024-06-02 18:45:46] [INFO ] Deduced a trap composed of 51 places in 120 ms of which 2 ms to minimize.
[2024-06-02 18:45:46] [INFO ] Deduced a trap composed of 35 places in 107 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/143 variables, 6/160 constraints. Problems are: Problem set: 1 solved, 6 unsolved
[2024-06-02 18:45:46] [INFO ] Deduced a trap composed of 26 places in 81 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/143 variables, 1/161 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/143 variables, 0/161 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 285/428 variables, 143/304 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/428 variables, 6/310 constraints. Problems are: Problem set: 1 solved, 6 unsolved
[2024-06-02 18:45:47] [INFO ] Deduced a trap composed of 35 places in 119 ms of which 2 ms to minimize.
[2024-06-02 18:45:47] [INFO ] Deduced a trap composed of 29 places in 78 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/428 variables, 2/312 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/428 variables, 0/312 constraints. Problems are: Problem set: 1 solved, 6 unsolved
[2024-06-02 18:45:47] [INFO ] Deduced a trap composed of 23 places in 73 ms of which 3 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/428 variables, 1/313 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/428 variables, 0/313 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 16 (OVERLAPS) 0/428 variables, 0/313 constraints. Problems are: Problem set: 1 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 428/428 variables, and 313 constraints, problems are : Problem set: 1 solved, 6 unsolved in 2803 ms.
Refiners :[Domain max(s): 143/143 constraints, Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 143/143 constraints, PredecessorRefiner: 6/7 constraints, Known Traps: 10/10 constraints]
After SMT, in 3748ms problems are : Problem set: 1 solved, 6 unsolved
Fused 6 Parikh solutions to 4 different solutions.
FORMULA MedleyA-PT-07-ReachabilityCardinality-2024-11 TRUE TECHNIQUES PARIKH_WALK
FORMULA MedleyA-PT-07-ReachabilityCardinality-2024-09 FALSE TECHNIQUES PARIKH_WALK
FORMULA MedleyA-PT-07-ReachabilityCardinality-2024-05 FALSE TECHNIQUES PARIKH_WALK
FORMULA MedleyA-PT-07-ReachabilityCardinality-2024-04 TRUE TECHNIQUES PARIKH_WALK
Finished Parikh walk after 20216 steps, including 422 resets, run visited all 2 properties in 277 ms. (steps per millisecond=72 )
FORMULA MedleyA-PT-07-ReachabilityCardinality-2024-10 FALSE TECHNIQUES PARIKH_WALK
FORMULA MedleyA-PT-07-ReachabilityCardinality-2024-07 FALSE TECHNIQUES PARIKH_WALK
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 6 properties in 821 ms.
All properties solved without resorting to model-checking.
Total runtime 7381 ms.
ITS solved all properties within timeout

BK_STOP 1717353949271

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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="MedleyA-PT-07"
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 MedleyA-PT-07, 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 r579-smll-171734921100054"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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