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.r498-tall-171640617600322.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 GPUForwardProgress-PT-16a, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r498-tall-171640617600322
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 500K
-rw-r--r-- 1 mcc users 7.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Apr 22 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Apr 22 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 22 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 11 22:36 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 144K Apr 11 22:36 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.0K Apr 11 22:34 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 81K Apr 11 22:34 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:47 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 26K 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 QuasiLiveness

=== Now, execution of the tool begins

BK_START 1717193420106

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=QuasiLiveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=GPUForwardProgress-PT-16a
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 22:10:21] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2024-05-31 22:10:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 22:10:21] [INFO ] Load time of PNML (sax parser for PT used): 53 ms
[2024-05-31 22:10:21] [INFO ] Transformed 72 places.
[2024-05-31 22:10:21] [INFO ] Transformed 89 transitions.
[2024-05-31 22:10:21] [INFO ] Found NUPN structural information;
[2024-05-31 22:10:21] [INFO ] Parsed PT model containing 72 places and 89 transitions and 341 arcs in 152 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 72/72 places, 89/89 transitions.
Ensure Unique test removed 1 places
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 0 with 19 rules applied. Total rules applied 19 place count 71 transition count 71
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 16 Pre rules applied. Total rules applied 19 place count 71 transition count 55
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 1 with 32 rules applied. Total rules applied 51 place count 55 transition count 55
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 53 place count 54 transition count 54
Applied a total of 53 rules in 45 ms. Remains 54 /72 variables (removed 18) and now considering 54/89 (removed 35) transitions.
// Phase 1: matrix 54 rows 54 cols
[2024-05-31 22:10:21] [INFO ] Computed 17 invariants in 6 ms
[2024-05-31 22:10:21] [INFO ] Implicit Places using invariants in 200 ms returned []
[2024-05-31 22:10:21] [INFO ] Invariant cache hit.
[2024-05-31 22:10:21] [INFO ] State equation strengthened by 33 read => feed constraints.
[2024-05-31 22:10:21] [INFO ] Implicit Places using invariants and state equation in 119 ms returned []
Implicit Place search using SMT with State Equation took 347 ms to find 0 implicit places.
Running 53 sub problems to find dead transitions.
[2024-05-31 22:10:21] [INFO ] Invariant cache hit.
[2024-05-31 22:10:21] [INFO ] State equation strengthened by 33 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 53/53 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/53 variables, 17/70 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 3 (OVERLAPS) 53/106 variables, 53/123 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/106 variables, 32/155 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/106 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 6 (OVERLAPS) 1/107 variables, 1/156 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/107 variables, 1/157 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/107 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 9 (OVERLAPS) 1/108 variables, 1/158 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/108 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 11 (OVERLAPS) 0/108 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 53 unsolved
No progress, stopping.
After SMT solving in domain Real declared 108/108 variables, and 158 constraints, problems are : Problem set: 0 solved, 53 unsolved in 1515 ms.
Refiners :[Domain max(s): 54/54 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 54/54 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 53/53 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 53 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 53/53 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/53 variables, 17/70 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 3 (OVERLAPS) 53/106 variables, 53/123 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/106 variables, 32/155 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/106 variables, 53/208 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/106 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 7 (OVERLAPS) 1/107 variables, 1/209 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/107 variables, 1/210 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/107 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 10 (OVERLAPS) 1/108 variables, 1/211 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/108 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 12 (OVERLAPS) 0/108 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 53 unsolved
No progress, stopping.
After SMT solving in domain Int declared 108/108 variables, and 211 constraints, problems are : Problem set: 0 solved, 53 unsolved in 1842 ms.
Refiners :[Domain max(s): 54/54 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 54/54 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 53/53 constraints, Known Traps: 0/0 constraints]
After SMT, in 3434ms problems are : Problem set: 0 solved, 53 unsolved
Search for dead transitions found 0 dead transitions in 3447ms
Starting structural reductions in LIVENESS mode, iteration 1 : 54/72 places, 54/89 transitions.
Finished structural reductions in LIVENESS mode , in 1 iterations and 3870 ms. Remains : 54/72 places, 54/89 transitions.
Discarding 18 transitions out of 54. Remains 36
Initial state reduction rules removed 1 formulas.
RANDOM walk for 40000 steps (356 resets) in 935 ms. (42 steps per ms) remains 1/35 properties
BEST_FIRST walk for 40004 steps (625 resets) in 273 ms. (146 steps per ms) remains 1/1 properties
[2024-05-31 22:10:25] [INFO ] Invariant cache hit.
[2024-05-31 22:10:25] [INFO ] State equation strengthened by 33 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/17 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 34/51 variables, 16/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 34/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/53 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/53 variables, 2/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/53 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 53/106 variables, 53/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/106 variables, 32/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/106 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/107 variables, 1/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/107 variables, 1/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/107 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 1/108 variables, 1/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/108 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/108 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 108/108 variables, and 158 constraints, problems are : Problem set: 0 solved, 1 unsolved in 76 ms.
Refiners :[Domain max(s): 54/54 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 54/54 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/17 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 34/51 variables, 16/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 34/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/53 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/53 variables, 2/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/53 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 53/106 variables, 53/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/106 variables, 32/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/106 variables, 1/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/106 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1/107 variables, 1/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/107 variables, 1/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/107 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1/108 variables, 1/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/108 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/108 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 108/108 variables, and 159 constraints, problems are : Problem set: 0 solved, 1 unsolved in 96 ms.
Refiners :[Domain max(s): 54/54 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 54/54 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 177ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 125 steps, including 2 resets, run visited all 1 properties in 2 ms. (steps per millisecond=62 )
Parikh walk visited 1 properties in 6 ms.
Able to resolve query QuasiLiveness after proving 36 properties.
FORMULA QuasiLiveness TRUE TECHNIQUES RANDOM_WALK PARIKH_WALK TOPOLOGICAL INITIAL_STATE
Total runtime 4675 ms.
ITS solved all properties within timeout

BK_STOP 1717193425918

--------------------
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="GPUForwardProgress-PT-16a"
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 GPUForwardProgress-PT-16a, 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 r498-tall-171640617600322"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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