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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 6.0M
-rw-r--r-- 1 mcc users 21K Apr 11 16:59 CTLCardinality.txt
-rw-r--r-- 1 mcc users 119K Apr 11 16:59 CTLCardinality.xml
-rw-r--r-- 1 mcc users 69K Apr 11 16:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 339K Apr 11 16:56 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 14K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 51K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 21K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 77K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 50K Apr 11 17:10 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 256K Apr 11 17:10 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 113K Apr 11 17:07 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 540K Apr 11 17:07 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 4.6K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 9.6K Apr 23 07:44 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 4.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 1717269794918

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-S04J06T10
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 19:23:16] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2024-06-01 19:23:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 19:23:16] [INFO ] Load time of PNML (sax parser for PT used): 278 ms
[2024-06-01 19:23:16] [INFO ] Transformed 966 places.
[2024-06-01 19:23:16] [INFO ] Transformed 5354 transitions.
[2024-06-01 19:23:16] [INFO ] Parsed PT model containing 966 places and 5354 transitions and 36134 arcs in 422 ms.
Ensure Unique test removed 2710 transitions
Reduce redundant transitions removed 2710 transitions.
RANDOM walk for 40000 steps (10 resets) in 2581 ms. (15 steps per ms) remains 3/966 properties
BEST_FIRST walk for 40003 steps (8 resets) in 339 ms. (117 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 203 ms. (196 steps per ms) remains 2/2 properties
[2024-06-01 19:23:17] [INFO ] Flow matrix only has 2604 transitions (discarded 40 similar events)
// Phase 1: matrix 2604 rows 966 cols
[2024-06-01 19:23:18] [INFO ] Computed 62 invariants in 167 ms
[2024-06-01 19:23:18] [INFO ] State equation strengthened by 200 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) 764/766 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/766 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 40/806 variables, 8/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/806 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 16/822 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/822 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 139/961 variables, 42/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/961 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 3/964 variables, 3/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/964 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3568/3570 variables, and 1025 constraints, problems are : Problem set: 0 solved, 2 unsolved in 5093 ms.
Refiners :[Positive P Invariants (semi-flows): 15/16 constraints, Generalized P Invariants (flows): 46/46 constraints, State Equation: 964/966 constraints, ReadFeed: 0/200 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) 764/766 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/766 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 40/806 variables, 8/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 19:23:24] [INFO ] Deduced a trap composed of 692 places in 634 ms of which 50 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/806 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/806 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 16/822 variables, 4/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/822 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 139/961 variables, 42/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 19:23:25] [INFO ] Deduced a trap composed of 556 places in 729 ms of which 7 ms to minimize.
[2024-06-01 19:23:26] [INFO ] Deduced a trap composed of 83 places in 756 ms of which 8 ms to minimize.
[2024-06-01 19:23:27] [INFO ] Deduced a trap composed of 83 places in 850 ms of which 7 ms to minimize.
[2024-06-01 19:23:27] [INFO ] Deduced a trap composed of 84 places in 833 ms of which 7 ms to minimize.
[2024-06-01 19:23:28] [INFO ] Deduced a trap composed of 83 places in 751 ms of which 7 ms to minimize.
SMT process timed out in 10719ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2 out of 966 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 966/966 places, 2644/2644 transitions.
Ensure Unique test removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 88 transitions
Trivial Post-agglo rules discarded 88 transitions
Performed 88 trivial Post agglomeration. Transition count delta: 88
Iterating post reduction 0 with 92 rules applied. Total rules applied 92 place count 962 transition count 2556
Reduce places removed 88 places and 0 transitions.
Iterating post reduction 1 with 88 rules applied. Total rules applied 180 place count 874 transition count 2556
Performed 120 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 120 Pre rules applied. Total rules applied 180 place count 874 transition count 2436
Deduced a syphon composed of 120 places in 3 ms
Reduce places removed 120 places and 0 transitions.
Iterating global reduction 2 with 240 rules applied. Total rules applied 420 place count 754 transition count 2436
Performed 100 Post agglomeration using F-continuation condition.Transition count delta: 100
Deduced a syphon composed of 100 places in 3 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 2 with 200 rules applied. Total rules applied 620 place count 654 transition count 2336
Free-agglomeration rule (complex) applied 20 times.
Iterating global reduction 2 with 20 rules applied. Total rules applied 640 place count 654 transition count 2316
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 2 with 20 rules applied. Total rules applied 660 place count 634 transition count 2316
Applied a total of 660 rules in 407 ms. Remains 634 /966 variables (removed 332) and now considering 2316/2644 (removed 328) transitions.
Running 2312 sub problems to find dead transitions.
[2024-06-01 19:23:29] [INFO ] Flow matrix only has 2276 transitions (discarded 40 similar events)
// Phase 1: matrix 2276 rows 634 cols
[2024-06-01 19:23:29] [INFO ] Computed 58 invariants in 86 ms
[2024-06-01 19:23:29] [INFO ] State equation strengthened by 200 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/630 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 2312 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/630 variables, 38/53 constraints. Problems are: Problem set: 0 solved, 2312 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 630/2910 variables, and 53 constraints, problems are : Problem set: 0 solved, 2312 unsolved in 20072 ms.
Refiners :[Positive P Invariants (semi-flows): 15/16 constraints, Generalized P Invariants (flows): 38/42 constraints, State Equation: 0/634 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 2312/2312 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2312 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/630 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 2312 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/630 variables, 38/53 constraints. Problems are: Problem set: 0 solved, 2312 unsolved
[2024-06-01 19:24:13] [INFO ] Deduced a trap composed of 42 places in 422 ms of which 4 ms to minimize.
[2024-06-01 19:24:13] [INFO ] Deduced a trap composed of 79 places in 325 ms of which 2 ms to minimize.
[2024-06-01 19:24:14] [INFO ] Deduced a trap composed of 209 places in 349 ms of which 4 ms to minimize.
[2024-06-01 19:24:14] [INFO ] Deduced a trap composed of 50 places in 183 ms of which 2 ms to minimize.
[2024-06-01 19:24:14] [INFO ] Deduced a trap composed of 51 places in 160 ms of which 3 ms to minimize.
[2024-06-01 19:24:14] [INFO ] Deduced a trap composed of 50 places in 127 ms of which 2 ms to minimize.
[2024-06-01 19:24:14] [INFO ] Deduced a trap composed of 52 places in 87 ms of which 1 ms to minimize.
[2024-06-01 19:24:14] [INFO ] Deduced a trap composed of 50 places in 66 ms of which 1 ms to minimize.
[2024-06-01 19:24:15] [INFO ] Deduced a trap composed of 51 places in 74 ms of which 1 ms to minimize.
[2024-06-01 19:24:15] [INFO ] Deduced a trap composed of 51 places in 74 ms of which 1 ms to minimize.
[2024-06-01 19:24:15] [INFO ] Deduced a trap composed of 51 places in 60 ms of which 1 ms to minimize.
[2024-06-01 19:24:17] [INFO ] Deduced a trap composed of 23 places in 186 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 630/2910 variables, and 65 constraints, problems are : Problem set: 0 solved, 2312 unsolved in 20038 ms.
Refiners :[Positive P Invariants (semi-flows): 15/16 constraints, Generalized P Invariants (flows): 38/42 constraints, State Equation: 0/634 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 0/2312 constraints, Known Traps: 12/12 constraints]
After SMT, in 58272ms problems are : Problem set: 0 solved, 2312 unsolved
Search for dead transitions found 0 dead transitions in 58314ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 58755 ms. Remains : 634/966 places, 2316/2644 transitions.
RANDOM walk for 48300 steps (3 resets) in 1152 ms. (41 steps per ms) remains 0/2 properties
Able to resolve query StableMarking after proving 966 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK BESTFIRST_WALK TOPOLOGICAL
Total runtime 71508 ms.
ITS solved all properties within timeout

BK_STOP 1717269867944

--------------------
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-S04J06T10"
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-S04J06T10, 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-171654455800193"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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