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.r298-tajo-171654455300288.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 greatspnxred
Input is PolyORBNT-PT-S05J40, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r298-tajo-171654455300288
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.9M
-rw-r--r-- 1 mcc users 17K Apr 12 09:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 116K Apr 12 09:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 76K Apr 12 09:52 CTLFireability.txt
-rw-r--r-- 1 mcc users 346K Apr 12 09:52 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 28K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 92K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 46K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 46K Apr 12 10:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 253K Apr 12 10:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 100K Apr 12 10:02 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 438K Apr 12 10:02 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 6.2K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 14K 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 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 1.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 1717104868776

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=PolyORBNT-PT-S05J40
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-30 21:34:30] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2024-05-30 21:34:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-30 21:34:30] [INFO ] Load time of PNML (sax parser for PT used): 152 ms
[2024-05-30 21:34:30] [INFO ] Transformed 629 places.
[2024-05-30 21:34:30] [INFO ] Transformed 1590 transitions.
[2024-05-30 21:34:30] [INFO ] Parsed PT model containing 629 places and 1590 transitions and 10704 arcs in 264 ms.
Structural test allowed to assert that 2 places are NOT stable. Took 10 ms.
Ensure Unique test removed 655 transitions
Reduce redundant transitions removed 655 transitions.
RANDOM walk for 40000 steps (2733 resets) in 2867 ms. (13 steps per ms) remains 24/627 properties
BEST_FIRST walk for 4003 steps (62 resets) in 62 ms. (63 steps per ms) remains 23/24 properties
BEST_FIRST walk for 4003 steps (56 resets) in 32 ms. (121 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4001 steps (54 resets) in 51 ms. (76 steps per ms) remains 19/23 properties
BEST_FIRST walk for 4003 steps (48 resets) in 51 ms. (76 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (74 resets) in 73 ms. (54 steps per ms) remains 18/19 properties
BEST_FIRST walk for 4003 steps (61 resets) in 63 ms. (62 steps per ms) remains 17/18 properties
BEST_FIRST walk for 4002 steps (71 resets) in 39 ms. (100 steps per ms) remains 16/17 properties
BEST_FIRST walk for 4003 steps (66 resets) in 29 ms. (133 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (49 resets) in 20 ms. (190 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (85 resets) in 33 ms. (117 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (62 resets) in 32 ms. (121 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (61 resets) in 21 ms. (182 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (42 resets) in 13 ms. (285 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (49 resets) in 18 ms. (210 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (48 resets) in 30 ms. (129 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (57 resets) in 17 ms. (222 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (57 resets) in 16 ms. (235 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (70 resets) in 29 ms. (133 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (57 resets) in 17 ms. (222 steps per ms) remains 16/16 properties
[2024-05-30 21:34:31] [INFO ] Flow matrix only has 931 transitions (discarded 4 similar events)
// Phase 1: matrix 931 rows 629 cols
[2024-05-30 21:34:31] [INFO ] Computed 102 invariants in 79 ms
[2024-05-30 21:34:31] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 132/148 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/148 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 183/331 variables, 31/35 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/331 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (OVERLAPS) 140/471 variables, 28/63 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/471 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (OVERLAPS) 144/615 variables, 26/89 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/615 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (OVERLAPS) 13/628 variables, 13/102 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/628 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 11 (OVERLAPS) 931/1559 variables, 628/730 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1559 variables, 1/731 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1559 variables, 0/731 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 14 (OVERLAPS) 1/1560 variables, 1/732 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1560 variables, 0/732 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 16 (OVERLAPS) 0/1560 variables, 0/732 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1560/1560 variables, and 732 constraints, problems are : Problem set: 0 solved, 16 unsolved in 2916 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 629/629 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 132/148 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/148 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 183/331 variables, 31/35 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/331 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (OVERLAPS) 140/471 variables, 28/63 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/471 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (OVERLAPS) 144/615 variables, 26/89 constraints. Problems are: Problem set: 0 solved, 16 unsolved
[2024-05-30 21:34:35] [INFO ] Deduced a trap composed of 24 places in 353 ms of which 42 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/615 variables, 1/90 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/615 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 10 (OVERLAPS) 13/628 variables, 13/103 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/628 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 12 (OVERLAPS) 931/1559 variables, 628/731 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1559 variables, 1/732 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1559 variables, 16/748 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1559 variables, 0/748 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 16 (OVERLAPS) 1/1560 variables, 1/749 constraints. Problems are: Problem set: 0 solved, 16 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1560/1560 variables, and 749 constraints, problems are : Problem set: 0 solved, 16 unsolved in 5014 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 629/629 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 1/1 constraints]
After SMT, in 8096ms problems are : Problem set: 0 solved, 16 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 16 out of 629 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 629/629 places, 935/935 transitions.
Ensure Unique test removed 5 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 41 transitions
Trivial Post-agglo rules discarded 41 transitions
Performed 41 trivial Post agglomeration. Transition count delta: 41
Iterating post reduction 0 with 46 rules applied. Total rules applied 46 place count 624 transition count 894
Reduce places removed 41 places and 0 transitions.
Iterating post reduction 1 with 41 rules applied. Total rules applied 87 place count 583 transition count 894
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 40 Pre rules applied. Total rules applied 87 place count 583 transition count 854
Deduced a syphon composed of 40 places in 1 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 2 with 80 rules applied. Total rules applied 167 place count 543 transition count 854
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 168 place count 542 transition count 853
Iterating global reduction 2 with 1 rules applied. Total rules applied 169 place count 542 transition count 853
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 173 place count 540 transition count 851
Applied a total of 173 rules in 200 ms. Remains 540 /629 variables (removed 89) and now considering 851/935 (removed 84) transitions.
Running 845 sub problems to find dead transitions.
[2024-05-30 21:34:39] [INFO ] Flow matrix only has 847 transitions (discarded 4 similar events)
// Phase 1: matrix 847 rows 540 cols
[2024-05-30 21:34:39] [INFO ] Computed 97 invariants in 36 ms
[2024-05-30 21:34:39] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/535 variables, 75/75 constraints. Problems are: Problem set: 0 solved, 845 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/535 variables, 17/92 constraints. Problems are: Problem set: 0 solved, 845 unsolved
[2024-05-30 21:34:48] [INFO ] Deduced a trap composed of 13 places in 165 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/535 variables, 1/93 constraints. Problems are: Problem set: 0 solved, 845 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/535 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 845 unsolved
SMT process timed out in 21850ms, After SMT, problems are : Problem set: 0 solved, 845 unsolved
Search for dead transitions found 0 dead transitions in 21866ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22084 ms. Remains : 540/629 places, 851/935 transitions.
RANDOM walk for 8494 steps (432 resets) in 268 ms. (31 steps per ms) remains 0/16 properties
Able to resolve query StableMarking after proving 628 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK MARKED_SUFFIX_TEST BESTFIRST_WALK TOPOLOGICAL
Total runtime 31869 ms.
ITS solved all properties within timeout

BK_STOP 1717104901965

--------------------
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="PolyORBNT-PT-S05J40"
export BK_EXAMINATION="StableMarking"
export BK_TOOL="greatspnxred"
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 greatspnxred"
echo " Input is PolyORBNT-PT-S05J40, 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 r298-tajo-171654455300288"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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