Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r518-tajo-171654455700149.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.......................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is PolyORBLF-PT-S02J04T10, examination is Liveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r518-tajo-171654455700149
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.4M
-rw-r--r-- 1 mcc users 25K Apr 11 16:48 CTLCardinality.txt
-rw-r--r-- 1 mcc users 137K Apr 11 16:48 CTLCardinality.xml
-rw-r--r-- 1 mcc users 46K Apr 11 16:46 CTLFireability.txt
-rw-r--r-- 1 mcc users 243K Apr 11 16:46 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 9.5K Apr 23 07:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 41K Apr 23 07:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 23 07:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 45K Apr 23 07:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 58K Apr 11 16:57 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 293K Apr 11 16:57 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 93K Apr 11 16:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 478K Apr 11 16:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.4K Apr 23 07:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 7.0K Apr 23 07:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 10 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 906K 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 Liveness

=== Now, execution of the tool begins

BK_START 1717269563088

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=Liveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=PolyORBLF-PT-S02J04T10
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 19:19:24] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, Liveness, -timeout, 180, -rebuildPNML]
[2024-06-01 19:19:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 19:19:24] [INFO ] Load time of PNML (sax parser for PT used): 129 ms
[2024-06-01 19:19:24] [INFO ] Transformed 752 places.
[2024-06-01 19:19:24] [INFO ] Transformed 1572 transitions.
[2024-06-01 19:19:24] [INFO ] Parsed PT model containing 752 places and 1572 transitions and 7262 arcs in 241 ms.
Discarding 160 transitions out of 1572. Remains 1412
Ensure Unique test removed 160 transitions
Reduce redundant transitions removed 160 transitions.
Built sparse matrix representations for Structural reductions in 9 ms.25025KB memory used
Starting structural reductions in DEADLOCK mode, iteration 0 : 752/752 places, 1412/1412 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Applied a total of 0 rules in 85 ms. Remains 752 /752 variables (removed 0) and now considering 1412/1412 (removed 0) transitions.
Running 1410 sub problems to find dead transitions.
[2024-06-01 19:19:24] [INFO ] Flow matrix only has 1392 transitions (discarded 20 similar events)
// Phase 1: matrix 1392 rows 752 cols
[2024-06-01 19:19:24] [INFO ] Computed 54 invariants in 74 ms
[2024-06-01 19:19:24] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/748 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/748 variables, 35/50 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
[2024-06-01 19:19:43] [INFO ] Deduced a trap composed of 66 places in 116 ms of which 13 ms to minimize.
[2024-06-01 19:19:43] [INFO ] Deduced a trap composed of 66 places in 55 ms of which 1 ms to minimize.
[2024-06-01 19:19:43] [INFO ] Deduced a trap composed of 65 places in 86 ms of which 10 ms to minimize.
[2024-06-01 19:19:43] [INFO ] Deduced a trap composed of 66 places in 102 ms of which 5 ms to minimize.
[2024-06-01 19:19:43] [INFO ] Deduced a trap composed of 65 places in 55 ms of which 1 ms to minimize.
[2024-06-01 19:19:44] [INFO ] Deduced a trap composed of 66 places in 76 ms of which 1 ms to minimize.
[2024-06-01 19:19:44] [INFO ] Deduced a trap composed of 65 places in 44 ms of which 1 ms to minimize.
[2024-06-01 19:19:44] [INFO ] Deduced a trap composed of 403 places in 300 ms of which 4 ms to minimize.
[2024-06-01 19:19:44] [INFO ] Deduced a trap composed of 65 places in 292 ms of which 4 ms to minimize.
[2024-06-01 19:19:45] [INFO ] Deduced a trap composed of 485 places in 293 ms of which 4 ms to minimize.
[2024-06-01 19:19:45] [INFO ] Deduced a trap composed of 406 places in 367 ms of which 4 ms to minimize.
[2024-06-01 19:19:45] [INFO ] Deduced a trap composed of 66 places in 385 ms of which 6 ms to minimize.
[2024-06-01 19:19:46] [INFO ] Deduced a trap composed of 495 places in 353 ms of which 5 ms to minimize.
[2024-06-01 19:19:46] [INFO ] Deduced a trap composed of 66 places in 63 ms of which 1 ms to minimize.
[2024-06-01 19:19:47] [INFO ] Deduced a trap composed of 405 places in 333 ms of which 4 ms to minimize.
[2024-06-01 19:19:47] [INFO ] Deduced a trap composed of 397 places in 287 ms of which 4 ms to minimize.
SMT process timed out in 22683ms, After SMT, problems are : Problem set: 0 solved, 1410 unsolved
Search for dead transitions found 0 dead transitions in 22725ms
Finished structural reductions in DEADLOCK mode , in 1 iterations and 22856 ms. Remains : 752/752 places, 1412/1412 transitions.
Starting structural reductions in DEADLOCK mode, iteration 0 : 752/752 places, 1412/1412 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Applied a total of 0 rules in 45 ms. Remains 752 /752 variables (removed 0) and now considering 1412/1412 (removed 0) transitions.
[2024-06-01 19:19:47] [INFO ] Flow matrix only has 1392 transitions (discarded 20 similar events)
[2024-06-01 19:19:47] [INFO ] Invariant cache hit.
[2024-06-01 19:19:47] [INFO ] Implicit Places using invariants in 105 ms returned []
[2024-06-01 19:19:47] [INFO ] Flow matrix only has 1392 transitions (discarded 20 similar events)
[2024-06-01 19:19:47] [INFO ] Invariant cache hit.
[2024-06-01 19:19:48] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-06-01 19:19:49] [INFO ] Implicit Places using invariants and state equation in 1354 ms returned []
Implicit Place search using SMT with State Equation took 1465 ms to find 0 implicit places.
[2024-06-01 19:19:49] [INFO ] Redundant transitions in 122 ms returned []
Running 1410 sub problems to find dead transitions.
[2024-06-01 19:19:49] [INFO ] Flow matrix only has 1392 transitions (discarded 20 similar events)
[2024-06-01 19:19:49] [INFO ] Invariant cache hit.
[2024-06-01 19:19:49] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/748 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/748 variables, 35/50 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
[2024-06-01 19:20:05] [INFO ] Deduced a trap composed of 65 places in 109 ms of which 2 ms to minimize.
[2024-06-01 19:20:06] [INFO ] Deduced a trap composed of 66 places in 88 ms of which 1 ms to minimize.
[2024-06-01 19:20:06] [INFO ] Deduced a trap composed of 65 places in 86 ms of which 2 ms to minimize.
[2024-06-01 19:20:06] [INFO ] Deduced a trap composed of 66 places in 48 ms of which 1 ms to minimize.
[2024-06-01 19:20:06] [INFO ] Deduced a trap composed of 66 places in 55 ms of which 2 ms to minimize.
[2024-06-01 19:20:06] [INFO ] Deduced a trap composed of 67 places in 86 ms of which 2 ms to minimize.
[2024-06-01 19:20:06] [INFO ] Deduced a trap composed of 66 places in 55 ms of which 1 ms to minimize.
[2024-06-01 19:20:06] [INFO ] Deduced a trap composed of 66 places in 74 ms of which 1 ms to minimize.
[2024-06-01 19:20:07] [INFO ] Deduced a trap composed of 402 places in 339 ms of which 4 ms to minimize.
[2024-06-01 19:20:07] [INFO ] Deduced a trap composed of 65 places in 405 ms of which 7 ms to minimize.
[2024-06-01 19:20:07] [INFO ] Deduced a trap composed of 231 places in 352 ms of which 5 ms to minimize.
[2024-06-01 19:20:08] [INFO ] Deduced a trap composed of 229 places in 353 ms of which 4 ms to minimize.
[2024-06-01 19:20:08] [INFO ] Deduced a trap composed of 65 places in 45 ms of which 1 ms to minimize.
[2024-06-01 19:20:09] [INFO ] Deduced a trap composed of 31 places in 214 ms of which 4 ms to minimize.
[2024-06-01 19:20:11] [INFO ] Deduced a trap composed of 414 places in 446 ms of which 5 ms to minimize.
[2024-06-01 19:20:11] [INFO ] Deduced a trap composed of 412 places in 411 ms of which 6 ms to minimize.
[2024-06-01 19:20:14] [INFO ] Deduced a trap composed of 491 places in 306 ms of which 4 ms to minimize.
[2024-06-01 19:20:15] [INFO ] Deduced a trap composed of 75 places in 265 ms of which 4 ms to minimize.
[2024-06-01 19:20:17] [INFO ] Deduced a trap composed of 399 places in 323 ms of which 7 ms to minimize.
[2024-06-01 19:20:18] [INFO ] Deduced a trap composed of 398 places in 342 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/748 variables, 20/70 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 748/2144 variables, and 70 constraints, problems are : Problem set: 0 solved, 1410 unsolved in 30040 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 35/39 constraints, State Equation: 0/752 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1410/1410 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1410 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/748 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/748 variables, 35/50 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/748 variables, 20/70 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
[2024-06-01 19:20:41] [INFO ] Deduced a trap composed of 406 places in 403 ms of which 5 ms to minimize.
[2024-06-01 19:20:41] [INFO ] Deduced a trap composed of 408 places in 372 ms of which 5 ms to minimize.
[2024-06-01 19:20:42] [INFO ] Deduced a trap composed of 381 places in 322 ms of which 4 ms to minimize.
[2024-06-01 19:20:42] [INFO ] Deduced a trap composed of 422 places in 393 ms of which 5 ms to minimize.
[2024-06-01 19:20:43] [INFO ] Deduced a trap composed of 425 places in 411 ms of which 4 ms to minimize.
[2024-06-01 19:20:43] [INFO ] Deduced a trap composed of 419 places in 445 ms of which 5 ms to minimize.
[2024-06-01 19:20:44] [INFO ] Deduced a trap composed of 414 places in 408 ms of which 6 ms to minimize.
[2024-06-01 19:20:44] [INFO ] Deduced a trap composed of 426 places in 422 ms of which 5 ms to minimize.
[2024-06-01 19:20:45] [INFO ] Deduced a trap composed of 417 places in 402 ms of which 5 ms to minimize.
[2024-06-01 19:20:46] [INFO ] Deduced a trap composed of 400 places in 324 ms of which 5 ms to minimize.
[2024-06-01 19:20:47] [INFO ] Deduced a trap composed of 395 places in 423 ms of which 5 ms to minimize.
[2024-06-01 19:20:47] [INFO ] Deduced a trap composed of 513 places in 397 ms of which 4 ms to minimize.
[2024-06-01 19:20:49] [INFO ] Deduced a trap composed of 418 places in 470 ms of which 6 ms to minimize.
[2024-06-01 19:20:50] [INFO ] Deduced a trap composed of 421 places in 406 ms of which 5 ms to minimize.
[2024-06-01 19:20:50] [INFO ] Deduced a trap composed of 413 places in 363 ms of which 4 ms to minimize.
[2024-06-01 19:20:51] [INFO ] Deduced a trap composed of 418 places in 415 ms of which 6 ms to minimize.
[2024-06-01 19:20:51] [INFO ] Deduced a trap composed of 373 places in 455 ms of which 5 ms to minimize.
SMT process timed out in 62478ms, After SMT, problems are : Problem set: 0 solved, 1410 unsolved
Search for dead transitions found 0 dead transitions in 62497ms
Finished structural reductions in DEADLOCK mode , in 1 iterations and 64144 ms. Remains : 752/752 places, 1412/1412 transitions.
Finished random walk after 4056 steps, including 0 resets, run found a deadlock after 34 ms. (steps per millisecond=119 )
FORMULA Liveness FALSE TECHNIQUES STRUCTURAL DEADLOCK_TEST
Total runtime 87497 ms.
ITS solved all properties within timeout

BK_STOP 1717269651822

--------------------
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 Liveness -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="PolyORBLF-PT-S02J04T10"
export BK_EXAMINATION="Liveness"
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 PolyORBLF-PT-S02J04T10, examination is Liveness"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r518-tajo-171654455700149"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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