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-171654455700173.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-S04J04T08, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r518-tajo-171654455700173
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 5.4M
-rw-r--r-- 1 mcc users 21K Apr 11 16:50 CTLCardinality.txt
-rw-r--r-- 1 mcc users 131K Apr 11 16:50 CTLCardinality.xml
-rw-r--r-- 1 mcc users 109K Apr 11 16:48 CTLFireability.txt
-rw-r--r-- 1 mcc users 501K Apr 11 16:48 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 9.0K Apr 23 07:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 38K Apr 23 07:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 23 07:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 49K Apr 23 07:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 29K Apr 11 17:02 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 159K Apr 11 17:02 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 178K Apr 11 17:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 780K Apr 11 17:00 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.3K Apr 23 07:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 6.8K 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 3.3M 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 StableMarking

=== Now, execution of the tool begins

BK_START 1717269670392

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=PolyORBLF-PT-S04J04T08
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 19:21:11] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2024-06-01 19:21:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 19:21:11] [INFO ] Load time of PNML (sax parser for PT used): 252 ms
[2024-06-01 19:21:11] [INFO ] Transformed 712 places.
[2024-06-01 19:21:11] [INFO ] Transformed 4012 transitions.
[2024-06-01 19:21:12] [INFO ] Parsed PT model containing 712 places and 4012 transitions and 27744 arcs in 400 ms.
Ensure Unique test removed 2168 transitions
Reduce redundant transitions removed 2168 transitions.
RANDOM walk for 40000 steps (8 resets) in 2608 ms. (15 steps per ms) remains 5/712 properties
BEST_FIRST walk for 40003 steps (9 resets) in 324 ms. (123 steps per ms) remains 3/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 337 ms. (118 steps per ms) remains 2/3 properties
[2024-06-01 19:21:13] [INFO ] Flow matrix only has 1812 transitions (discarded 32 similar events)
// Phase 1: matrix 1812 rows 712 cols
[2024-06-01 19:21:13] [INFO ] Computed 54 invariants in 105 ms
[2024-06-01 19:21:13] [INFO ] State equation strengthened by 160 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 564/566 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/566 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 47/613 variables, 9/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/613 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1/614 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/614 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 94/708 variables, 37/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/708 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 2/710 variables, 2/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/710 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 1812/2522 variables, 710/763 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2522 variables, 160/923 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2522 variables, 0/923 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 2/2524 variables, 2/925 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2524 variables, 1/926 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2524 variables, 0/926 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 0/2524 variables, 0/926 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2524/2524 variables, and 926 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2150 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 41/41 constraints, State Equation: 712/712 constraints, ReadFeed: 160/160 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 564/566 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/566 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 47/613 variables, 9/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/613 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1/614 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/614 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 94/708 variables, 37/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 19:21:16] [INFO ] Deduced a trap composed of 76 places in 257 ms of which 27 ms to minimize.
[2024-06-01 19:21:16] [INFO ] Deduced a trap composed of 75 places in 215 ms of which 3 ms to minimize.
[2024-06-01 19:21:16] [INFO ] Deduced a trap composed of 76 places in 126 ms of which 2 ms to minimize.
[2024-06-01 19:21:16] [INFO ] Deduced a trap composed of 75 places in 85 ms of which 2 ms to minimize.
[2024-06-01 19:21:16] [INFO ] Deduced a trap composed of 75 places in 57 ms of which 1 ms to minimize.
[2024-06-01 19:21:16] [INFO ] Deduced a trap composed of 76 places in 54 ms of which 1 ms to minimize.
[2024-06-01 19:21:16] [INFO ] Deduced a trap composed of 76 places in 80 ms of which 2 ms to minimize.
[2024-06-01 19:21:17] [INFO ] Deduced a trap composed of 75 places in 52 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/708 variables, 8/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/708 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 2/710 variables, 2/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/710 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2522/2524 variables, and 771 constraints, problems are : Problem set: 0 solved, 2 unsolved in 5008 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 41/41 constraints, State Equation: 710/712 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 0/2 constraints, Known Traps: 8/8 constraints]
After SMT, in 7342ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 1 properties in 298 ms.
Support contains 1 out of 712 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 712/712 places, 1844/1844 transitions.
Ensure Unique test removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 71 transitions
Trivial Post-agglo rules discarded 71 transitions
Performed 71 trivial Post agglomeration. Transition count delta: 71
Iterating post reduction 0 with 75 rules applied. Total rules applied 75 place count 708 transition count 1773
Reduce places removed 71 places and 0 transitions.
Iterating post reduction 1 with 71 rules applied. Total rules applied 146 place count 637 transition count 1773
Performed 80 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 80 Pre rules applied. Total rules applied 146 place count 637 transition count 1693
Deduced a syphon composed of 80 places in 3 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 2 with 160 rules applied. Total rules applied 306 place count 557 transition count 1693
Performed 80 Post agglomeration using F-continuation condition.Transition count delta: 80
Deduced a syphon composed of 80 places in 3 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 2 with 160 rules applied. Total rules applied 466 place count 477 transition count 1613
Free-agglomeration rule (complex) applied 16 times.
Iterating global reduction 2 with 16 rules applied. Total rules applied 482 place count 477 transition count 1597
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 2 with 16 rules applied. Total rules applied 498 place count 461 transition count 1597
Applied a total of 498 rules in 381 ms. Remains 461 /712 variables (removed 251) and now considering 1597/1844 (removed 247) transitions.
Running 1593 sub problems to find dead transitions.
[2024-06-01 19:21:21] [INFO ] Flow matrix only has 1565 transitions (discarded 32 similar events)
// Phase 1: matrix 1565 rows 461 cols
[2024-06-01 19:21:21] [INFO ] Computed 50 invariants in 34 ms
[2024-06-01 19:21:21] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/457 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1593 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/457 variables, 34/46 constraints. Problems are: Problem set: 0 solved, 1593 unsolved
[2024-06-01 19:21:44] [INFO ] Deduced a trap composed of 44 places in 68 ms of which 2 ms to minimize.
[2024-06-01 19:21:44] [INFO ] Deduced a trap composed of 45 places in 95 ms of which 4 ms to minimize.
[2024-06-01 19:21:44] [INFO ] Deduced a trap composed of 44 places in 79 ms of which 1 ms to minimize.
[2024-06-01 19:21:44] [INFO ] Deduced a trap composed of 44 places in 70 ms of which 1 ms to minimize.
[2024-06-01 19:21:44] [INFO ] Deduced a trap composed of 44 places in 59 ms of which 0 ms to minimize.
[2024-06-01 19:21:44] [INFO ] Deduced a trap composed of 45 places in 55 ms of which 1 ms to minimize.
[2024-06-01 19:21:44] [INFO ] Deduced a trap composed of 44 places in 48 ms of which 1 ms to minimize.
[2024-06-01 19:21:45] [INFO ] Deduced a trap composed of 19 places in 172 ms of which 2 ms to minimize.
[2024-06-01 19:21:45] [INFO ] Deduced a trap composed of 45 places in 47 ms of which 1 ms to minimize.
[2024-06-01 19:21:47] [INFO ] Deduced a trap composed of 67 places in 388 ms of which 3 ms to minimize.
[2024-06-01 19:21:53] [INFO ] Deduced a trap composed of 181 places in 352 ms of which 4 ms to minimize.
SMT process timed out in 31789ms, After SMT, problems are : Problem set: 0 solved, 1593 unsolved
Search for dead transitions found 0 dead transitions in 31822ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32231 ms. Remains : 461/712 places, 1597/1844 transitions.
RANDOM walk for 64915 steps (10 resets) in 964 ms. (67 steps per ms) remains 0/1 properties
Able to resolve query StableMarking after proving 712 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK PARIKH_WALK BESTFIRST_WALK TOPOLOGICAL
Total runtime 41870 ms.
ITS solved all properties within timeout

BK_STOP 1717269713562

--------------------
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 StableMarking -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-S04J04T08"
export BK_EXAMINATION="StableMarking"
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-S04J04T08, examination is StableMarking"
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-171654455700173"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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