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.r510-tall-171654365200387.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 NoC3x3-PT-5A, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r510-tall-171654365200387
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 728K
-rw-r--r-- 1 mcc users 6.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.4K Apr 23 07:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 23 07:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 23 07:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 07:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Apr 12 07:34 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 185K Apr 12 07:34 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Apr 12 07:32 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 48K Apr 12 07:32 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.4K May 19 07:14 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 19 15:28 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 248K May 18 16:43 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 QuasiLiveness

=== Now, execution of the tool begins

BK_START 1717232191805

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=QuasiLiveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=NoC3x3-PT-5A
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 08:56:33] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2024-06-01 08:56:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 08:56:33] [INFO ] Load time of PNML (sax parser for PT used): 161 ms
[2024-06-01 08:56:33] [INFO ] Transformed 417 places.
[2024-06-01 08:56:33] [INFO ] Transformed 933 transitions.
[2024-06-01 08:56:33] [INFO ] Found NUPN structural information;
[2024-06-01 08:56:33] [INFO ] Parsed PT model containing 417 places and 933 transitions and 3585 arcs in 292 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 417/417 places, 933/933 transitions.
Applied a total of 0 rules in 29 ms. Remains 417 /417 variables (removed 0) and now considering 933/933 (removed 0) transitions.
[2024-06-01 08:56:33] [INFO ] Flow matrix only has 851 transitions (discarded 82 similar events)
// Phase 1: matrix 851 rows 417 cols
[2024-06-01 08:56:33] [INFO ] Computed 66 invariants in 29 ms
[2024-06-01 08:56:34] [INFO ] Implicit Places using invariants in 781 ms returned [13, 49, 91, 130, 192, 272, 318, 358, 403]
Discarding 9 places :
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Implicit Place search using SMT only with invariants took 834 ms to find 9 implicit places.
Starting structural reductions in LIVENESS mode, iteration 1 : 408/417 places, 923/933 transitions.
Applied a total of 0 rules in 14 ms. Remains 408 /408 variables (removed 0) and now considering 923/923 (removed 0) transitions.
Finished structural reductions in LIVENESS mode , in 2 iterations and 909 ms. Remains : 408/417 places, 923/933 transitions.
Discarding 174 transitions out of 923. Remains 749
Initial state reduction rules removed 1 formulas.
RANDOM walk for 40000 steps (8 resets) in 2431 ms. (16 steps per ms) remains 9/748 properties
BEST_FIRST walk for 40004 steps (8 resets) in 198 ms. (201 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 138 ms. (287 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 120 ms. (330 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 136 ms. (292 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 109 ms. (363 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 118 ms. (336 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 95 ms. (416 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 96 ms. (412 steps per ms) remains 8/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 83 ms. (476 steps per ms) remains 8/8 properties
[2024-06-01 08:56:35] [INFO ] Flow matrix only has 851 transitions (discarded 72 similar events)
// Phase 1: matrix 851 rows 408 cols
[2024-06-01 08:56:35] [INFO ] Computed 57 invariants in 10 ms
[2024-06-01 08:56:35] [INFO ] State equation strengthened by 18 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/16 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (OVERLAPS) 95/111 variables, 14/30 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/111 variables, 95/125 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/111 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 297/408 variables, 43/168 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/408 variables, 297/465 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-01 08:56:36] [INFO ] Deduced a trap composed of 28 places in 197 ms of which 47 ms to minimize.
[2024-06-01 08:56:36] [INFO ] Deduced a trap composed of 17 places in 152 ms of which 2 ms to minimize.
[2024-06-01 08:56:36] [INFO ] Deduced a trap composed of 21 places in 129 ms of which 2 ms to minimize.
[2024-06-01 08:56:36] [INFO ] Deduced a trap composed of 22 places in 118 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/408 variables, 4/469 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/408 variables, 0/469 constraints. Problems are: Problem set: 0 solved, 8 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 851/1259 variables, 408/877 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1259 variables, 18/895 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1259 variables, 0/895 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (OVERLAPS) 0/1259 variables, 0/895 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1259/1259 variables, and 895 constraints, problems are : Problem set: 0 solved, 8 unsolved in 1856 ms.
Refiners :[Domain max(s): 408/408 constraints, Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 408/408 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/16 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (OVERLAPS) 95/111 variables, 14/30 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/111 variables, 95/125 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/111 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 297/408 variables, 43/168 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/408 variables, 297/465 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/408 variables, 4/469 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/408 variables, 0/469 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (OVERLAPS) 851/1259 variables, 408/877 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1259 variables, 18/895 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1259 variables, 8/903 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-01 08:56:38] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/1259 variables, 1/904 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1259 variables, 0/904 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (OVERLAPS) 0/1259 variables, 0/904 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1259/1259 variables, and 904 constraints, problems are : Problem set: 0 solved, 8 unsolved in 1874 ms.
Refiners :[Domain max(s): 408/408 constraints, Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 408/408 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 5/5 constraints]
After SMT, in 3793ms problems are : Problem set: 0 solved, 8 unsolved
Fused 8 Parikh solutions to 6 different solutions.
Parikh walk visited 4 properties in 4075 ms.
Support contains 8 out of 408 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 408/408 places, 923/923 transitions.
Discarding 76 places :
Symmetric choice reduction at 0 with 76 rule applications. Total rules 76 place count 332 transition count 744
Iterating global reduction 0 with 76 rules applied. Total rules applied 152 place count 332 transition count 744
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 155 place count 329 transition count 732
Iterating global reduction 0 with 3 rules applied. Total rules applied 158 place count 329 transition count 732
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 164 place count 329 transition count 726
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 1 with 9 rules applied. Total rules applied 173 place count 329 transition count 717
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 175 place count 327 transition count 711
Iterating global reduction 1 with 2 rules applied. Total rules applied 177 place count 327 transition count 711
Partial Free-agglomeration rule applied 67 times.
Drop transitions (Partial Free agglomeration) removed 67 transitions
Iterating global reduction 1 with 67 rules applied. Total rules applied 244 place count 327 transition count 711
Applied a total of 244 rules in 119 ms. Remains 327 /408 variables (removed 81) and now considering 711/923 (removed 212) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 119 ms. Remains : 327/408 places, 711/923 transitions.
RANDOM walk for 3043894 steps (7 resets) in 17385 ms. (175 steps per ms) remains 0/4 properties
Able to resolve query QuasiLiveness after proving 749 properties.
FORMULA QuasiLiveness TRUE TECHNIQUES RANDOM_WALK PARIKH_WALK BESTFIRST_WALK TOPOLOGICAL INITIAL_STATE
Total runtime 16252 ms.
ITS solved all properties within timeout

BK_STOP 1717232209494

--------------------
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 QuasiLiveness -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="NoC3x3-PT-5A"
export BK_EXAMINATION="QuasiLiveness"
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 NoC3x3-PT-5A, examination is QuasiLiveness"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r510-tall-171654365200387"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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