About the Execution of GreatSPN+red for StigmergyElection-PT-05b
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
398.140 | 14318.00 | 29048.00 | 80.90 | F | normal |
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.r408-tall-171690546400193.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 greatspnxred
Input is StigmergyElection-PT-05b, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r408-tall-171690546400193
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 852K
-rw-r--r-- 1 mcc users 6.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 70K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:59 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 23 07:59 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 23 07:59 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 23 07:59 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 11 18:44 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 127K Apr 11 18:44 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Apr 11 18:44 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 44K Apr 11 18:44 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 07:59 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:59 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 428K 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 1717102951115
Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=StigmergyElection-PT-05b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-30 21:02:32] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2024-05-30 21:02:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-30 21:02:32] [INFO ] Load time of PNML (sax parser for PT used): 124 ms
[2024-05-30 21:02:32] [INFO ] Transformed 699 places.
[2024-05-30 21:02:32] [INFO ] Transformed 1266 transitions.
[2024-05-30 21:02:32] [INFO ] Found NUPN structural information;
[2024-05-30 21:02:32] [INFO ] Parsed PT model containing 699 places and 1266 transitions and 6741 arcs in 239 ms.
Graph (trivial) has 713 edges and 699 vertex of which 105 / 699 are part of one of the 15 SCC in 7 ms
Free SCC test removed 90 places
Structural test allowed to assert that 449 places are NOT stable. Took 29 ms.
Ensure Unique test removed 100 transitions
Reduce redundant transitions removed 100 transitions.
RANDOM walk for 40000 steps (449 resets) in 2520 ms. (15 steps per ms) remains 232/250 properties
BEST_FIRST walk for 402 steps (8 resets) in 26 ms. (14 steps per ms) remains 232/232 properties
BEST_FIRST walk for 404 steps (8 resets) in 12 ms. (31 steps per ms) remains 232/232 properties
BEST_FIRST walk for 403 steps (8 resets) in 10 ms. (36 steps per ms) remains 232/232 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 232/232 properties
BEST_FIRST walk for 402 steps (8 resets) in 8 ms. (44 steps per ms) remains 232/232 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 232/232 properties
BEST_FIRST walk for 403 steps (8 resets) in 6 ms. (57 steps per ms) remains 232/232 properties
BEST_FIRST walk for 403 steps (8 resets) in 11 ms. (33 steps per ms) remains 232/232 properties
BEST_FIRST walk for 403 steps (8 resets) in 9 ms. (40 steps per ms) remains 232/232 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 232/232 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 232/232 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 232/232 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 232/232 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 232/232 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 232/232 properties
BEST_FIRST walk for 402 steps (8 resets) in 16 ms. (23 steps per ms) remains 232/232 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 232/232 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 232/232 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 232/232 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 232/232 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 232/232 properties
BEST_FIRST walk for 403 steps (8 resets) in 6 ms. (57 steps per ms) remains 232/232 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 232/232 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 232/232 properties
BEST_FIRST walk for 401 steps (8 resets) in 11 ms. (33 steps per ms) remains 232/232 properties
BEST_FIRST walk for 403 steps (8 resets) in 9 ms. (40 steps per ms) remains 232/232 properties
BEST_FIRST walk for 402 steps (8 resets) in 6 ms. (57 steps per ms) remains 232/232 properties
BEST_FIRST walk for 403 steps (8 resets) in 7 ms. (50 steps per ms) remains 232/232 properties
BEST_FIRST walk for 403 steps (8 resets) in 9 ms. (40 steps per ms) remains 232/232 properties
BEST_FIRST walk for 403 steps (8 resets) in 6 ms. (57 steps per ms) remains 232/232 properties
BEST_FIRST walk for 402 steps (8 resets) in 9 ms. (40 steps per ms) remains 232/232 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 232/232 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 232/232 properties
BEST_FIRST walk for 403 steps (8 resets) in 9 ms. (40 steps per ms) remains 232/232 properties
BEST_FIRST walk for 402 steps (8 resets) in 9 ms. (40 steps per ms) remains 232/232 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 232/232 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 232/232 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 232/232 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 232/232 properties
BEST_FIRST walk for 401 steps (8 resets) in 9 ms. (40 steps per ms) remains 232/232 properties
BEST_FIRST walk for 403 steps (8 resets) in 5 ms. (67 steps per ms) remains 232/232 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 232/232 properties
BEST_FIRST walk for 403 steps (8 resets) in 6 ms. (57 steps per ms) remains 232/232 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 232/232 properties
BEST_FIRST walk for 403 steps (8 resets) in 6 ms. (57 steps per ms) remains 232/232 properties
BEST_FIRST walk for 403 steps (8 resets) in 9 ms. (40 steps per ms) remains 232/232 properties
BEST_FIRST walk for 402 steps (8 resets) in 7 ms. (50 steps per ms) remains 232/232 properties
BEST_FIRST walk for 403 steps (8 resets) in 9 ms. (40 steps per ms) remains 232/232 properties
BEST_FIRST walk for 402 steps (8 resets) in 9 ms. (40 steps per ms) remains 232/232 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 232/232 properties
Probabilistic random walk after 100001 steps, saw 19257 distinct states, run finished after 892 ms. (steps per millisecond=112 ) properties seen :36
[2024-05-30 21:02:34] [INFO ] Flow matrix only has 1152 transitions (discarded 14 similar events)
// Phase 1: matrix 1152 rows 609 cols
[2024-05-30 21:02:34] [INFO ] Computed 6 invariants in 24 ms
[2024-05-30 21:02:34] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/196 variables, 196/196 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/196 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 2 (OVERLAPS) 394/590 variables, 5/201 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/590 variables, 394/595 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/590 variables, 0/595 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 5 (OVERLAPS) 19/609 variables, 1/596 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/609 variables, 19/615 constraints. Problems are: Problem set: 0 solved, 196 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 609/1761 variables, and 615 constraints, problems are : Problem set: 0 solved, 196 unsolved in 5066 ms.
Refiners :[Domain max(s): 609/609 constraints, Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 0/609 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 196/196 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 196 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/196 variables, 196/196 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/196 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 2 (OVERLAPS) 394/590 variables, 5/201 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/590 variables, 394/595 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-05-30 21:02:41] [INFO ] Deduced a trap composed of 171 places in 367 ms of which 36 ms to minimize.
[2024-05-30 21:02:41] [INFO ] Deduced a trap composed of 172 places in 336 ms of which 4 ms to minimize.
[2024-05-30 21:02:41] [INFO ] Deduced a trap composed of 174 places in 256 ms of which 3 ms to minimize.
[2024-05-30 21:02:41] [INFO ] Deduced a trap composed of 172 places in 289 ms of which 3 ms to minimize.
[2024-05-30 21:02:42] [INFO ] Deduced a trap composed of 174 places in 301 ms of which 4 ms to minimize.
[2024-05-30 21:02:42] [INFO ] Deduced a trap composed of 172 places in 273 ms of which 3 ms to minimize.
[2024-05-30 21:02:42] [INFO ] Deduced a trap composed of 173 places in 259 ms of which 3 ms to minimize.
[2024-05-30 21:02:43] [INFO ] Deduced a trap composed of 172 places in 264 ms of which 3 ms to minimize.
[2024-05-30 21:02:43] [INFO ] Deduced a trap composed of 174 places in 238 ms of which 3 ms to minimize.
[2024-05-30 21:02:43] [INFO ] Deduced a trap composed of 174 places in 228 ms of which 2 ms to minimize.
[2024-05-30 21:02:44] [INFO ] Deduced a trap composed of 175 places in 236 ms of which 3 ms to minimize.
[2024-05-30 21:02:44] [INFO ] Deduced a trap composed of 174 places in 284 ms of which 4 ms to minimize.
SMT process timed out in 10323ms, After SMT, problems are : Problem set: 0 solved, 196 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 196 out of 609 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 609/609 places, 1166/1166 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 304 transitions
Trivial Post-agglo rules discarded 304 transitions
Performed 304 trivial Post agglomeration. Transition count delta: 304
Iterating post reduction 0 with 319 rules applied. Total rules applied 319 place count 609 transition count 847
Reduce places removed 304 places and 0 transitions.
Iterating post reduction 1 with 304 rules applied. Total rules applied 623 place count 305 transition count 847
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 623 place count 305 transition count 837
Deduced a syphon composed of 10 places in 2 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 643 place count 295 transition count 837
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 651 place count 287 transition count 829
Iterating global reduction 2 with 8 rules applied. Total rules applied 659 place count 287 transition count 829
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 659 place count 287 transition count 828
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 661 place count 286 transition count 828
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 663 place count 284 transition count 737
Iterating global reduction 2 with 2 rules applied. Total rules applied 665 place count 284 transition count 737
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 667 place count 284 transition count 735
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 701 place count 267 transition count 718
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 717 place count 259 transition count 726
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 3 with 8 rules applied. Total rules applied 725 place count 259 transition count 718
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 727 place count 258 transition count 724
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 3 with 8 rules applied. Total rules applied 735 place count 258 transition count 716
Free-agglomeration rule applied 35 times.
Iterating global reduction 3 with 35 rules applied. Total rules applied 770 place count 258 transition count 681
Reduce places removed 35 places and 0 transitions.
Iterating post reduction 3 with 35 rules applied. Total rules applied 805 place count 223 transition count 681
Drop transitions (Redundant composition of simpler transitions.) removed 54 transitions
Redundant transition composition rules discarded 54 transitions
Iterating global reduction 4 with 54 rules applied. Total rules applied 859 place count 223 transition count 627
Applied a total of 859 rules in 255 ms. Remains 223 /609 variables (removed 386) and now considering 627/1166 (removed 539) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 265 ms. Remains : 223/609 places, 627/1166 transitions.
RANDOM walk for 11605 steps (37 resets) in 1014 ms. (11 steps per ms) remains 0/196 properties
Able to resolve query StableMarking after proving 252 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK PROBABILISTIC_WALK MARKED_SUFFIX_TEST TRIVIAL_UNMARKED_SCC_TEST TOPOLOGICAL
Total runtime 13147 ms.
ITS solved all properties within timeout
BK_STOP 1717102965433
--------------------
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="StigmergyElection-PT-05b"
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 StigmergyElection-PT-05b, 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 r408-tall-171690546400193"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/StigmergyElection-PT-05b.tgz
mv StigmergyElection-PT-05b 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 '
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 ;