About the Execution of GreatSPN+red for PolyORBNT-PT-S10J80
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
16195.327 | 3600000.00 | 14207334.00 | 204.40 | TF?TF??FFFFTTFTT | normal |
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.r289-tajo-171654446100519.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-S10J80, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r289-tajo-171654446100519
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 27M
-rw-r--r-- 1 mcc users 39K Apr 12 11:45 CTLCardinality.txt
-rw-r--r-- 1 mcc users 196K Apr 12 11:45 CTLCardinality.xml
-rw-r--r-- 1 mcc users 509K Apr 12 10:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 2.0M Apr 12 10:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 18K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 66K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 20K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 84K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 198K Apr 12 14:33 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 829K Apr 12 14:33 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 1.9M Apr 12 14:02 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 6.9M Apr 12 14:01 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.4K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 7.4K 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 14M 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
here is the order used to build the result vector(from text file)
FORMULA_NAME PolyORBNT-PT-S10J80-ReachabilityFireability-2024-00
FORMULA_NAME PolyORBNT-PT-S10J80-ReachabilityFireability-2024-01
FORMULA_NAME PolyORBNT-PT-S10J80-ReachabilityFireability-2024-02
FORMULA_NAME PolyORBNT-PT-S10J80-ReachabilityFireability-2024-03
FORMULA_NAME PolyORBNT-PT-S10J80-ReachabilityFireability-2024-04
FORMULA_NAME PolyORBNT-PT-S10J80-ReachabilityFireability-2024-05
FORMULA_NAME PolyORBNT-PT-S10J80-ReachabilityFireability-2024-06
FORMULA_NAME PolyORBNT-PT-S10J80-ReachabilityFireability-2024-07
FORMULA_NAME PolyORBNT-PT-S10J80-ReachabilityFireability-2024-08
FORMULA_NAME PolyORBNT-PT-S10J80-ReachabilityFireability-2024-09
FORMULA_NAME PolyORBNT-PT-S10J80-ReachabilityFireability-2024-10
FORMULA_NAME PolyORBNT-PT-S10J80-ReachabilityFireability-2024-11
FORMULA_NAME PolyORBNT-PT-S10J80-ReachabilityFireability-2024-12
FORMULA_NAME PolyORBNT-PT-S10J80-ReachabilityFireability-2024-13
FORMULA_NAME PolyORBNT-PT-S10J80-ReachabilityFireability-2024-14
FORMULA_NAME PolyORBNT-PT-S10J80-ReachabilityFireability-2024-15
=== Now, execution of the tool begins
BK_START 1716893802868
Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBNT-PT-S10J80
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-28 10:56:44] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-28 10:56:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 10:56:45] [INFO ] Load time of PNML (sax parser for PT used): 666 ms
[2024-05-28 10:56:45] [INFO ] Transformed 1614 places.
[2024-05-28 10:56:45] [INFO ] Transformed 13500 transitions.
[2024-05-28 10:56:45] [INFO ] Parsed PT model containing 1614 places and 13500 transitions and 119759 arcs in 933 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 199 ms.
Working with output stream class java.io.PrintStream
[2024-05-28 10:56:45] [INFO ] Reduced 45 identical enabling conditions.
[2024-05-28 10:56:45] [INFO ] Reduced 45 identical enabling conditions.
[2024-05-28 10:56:45] [INFO ] Reduced 9285 identical enabling conditions.
[2024-05-28 10:56:45] [INFO ] Reduced 780 identical enabling conditions.
[2024-05-28 10:56:45] [INFO ] Reduced 9285 identical enabling conditions.
[2024-05-28 10:56:45] [INFO ] Reduced 9285 identical enabling conditions.
[2024-05-28 10:56:45] [INFO ] Reduced 780 identical enabling conditions.
[2024-05-28 10:56:45] [INFO ] Reduced 9285 identical enabling conditions.
[2024-05-28 10:56:45] [INFO ] Reduced 9285 identical enabling conditions.
Ensure Unique test removed 10110 transitions
Reduce redundant transitions removed 10110 transitions.
RANDOM walk for 40000 steps (2239 resets) in 6149 ms. (6 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (36 resets) in 1804 ms. (2 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (40 resets) in 161 ms. (24 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (40 resets) in 1315 ms. (3 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (40 resets) in 413 ms. (9 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (18 resets) in 3282 ms. (1 steps per ms) remains 14/16 properties
FORMULA PolyORBNT-PT-S10J80-ReachabilityFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBNT-PT-S10J80-ReachabilityFireability-2024-01 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 4004 steps (40 resets) in 96 ms. (41 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4004 steps (41 resets) in 78 ms. (50 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4004 steps (40 resets) in 1090 ms. (3 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4004 steps (8 resets) in 96 ms. (41 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 13/14 properties
FORMULA PolyORBNT-PT-S10J80-ReachabilityFireability-2024-10 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 12/13 properties
FORMULA PolyORBNT-PT-S10J80-ReachabilityFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 11/12 properties
FORMULA PolyORBNT-PT-S10J80-ReachabilityFireability-2024-12 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 4003 steps (40 resets) in 71 ms. (55 steps per ms) remains 11/11 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 10/11 properties
FORMULA PolyORBNT-PT-S10J80-ReachabilityFireability-2024-14 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 9/10 properties
FORMULA PolyORBNT-PT-S10J80-ReachabilityFireability-2024-15 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2024-05-28 10:56:50] [INFO ] Flow matrix only has 3381 transitions (discarded 9 similar events)
// Phase 1: matrix 3381 rows 1614 cols
[2024-05-28 10:56:50] [INFO ] Computed 192 invariants in 284 ms
[2024-05-28 10:56:50] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1614 variables, 159/159 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Problem PolyORBNT-PT-S10J80-ReachabilityFireability-2024-00 is UNSAT
FORMULA PolyORBNT-PT-S10J80-ReachabilityFireability-2024-00 TRUE TECHNIQUES SMT_REFINEMENT
Problem PolyORBNT-PT-S10J80-ReachabilityFireability-2024-04 is UNSAT
FORMULA PolyORBNT-PT-S10J80-ReachabilityFireability-2024-04 FALSE TECHNIQUES SMT_REFINEMENT
Problem PolyORBNT-PT-S10J80-ReachabilityFireability-2024-07 is UNSAT
FORMULA PolyORBNT-PT-S10J80-ReachabilityFireability-2024-07 FALSE TECHNIQUES SMT_REFINEMENT
Problem PolyORBNT-PT-S10J80-ReachabilityFireability-2024-08 is UNSAT
FORMULA PolyORBNT-PT-S10J80-ReachabilityFireability-2024-08 FALSE TECHNIQUES SMT_REFINEMENT
Problem PolyORBNT-PT-S10J80-ReachabilityFireability-2024-09 is UNSAT
FORMULA PolyORBNT-PT-S10J80-ReachabilityFireability-2024-09 FALSE TECHNIQUES SMT_REFINEMENT
Problem PolyORBNT-PT-S10J80-ReachabilityFireability-2024-13 is UNSAT
FORMULA PolyORBNT-PT-S10J80-ReachabilityFireability-2024-13 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 1 (INCLUDED_ONLY) 0/1614 variables, 33/192 constraints. Problems are: Problem set: 6 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1614 variables, 0/192 constraints. Problems are: Problem set: 6 solved, 3 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 4995/4995 variables, and 1806 constraints, problems are : Problem set: 6 solved, 3 unsolved in 5073 ms.
Refiners :[Positive P Invariants (semi-flows): 159/159 constraints, Generalized P Invariants (flows): 33/33 constraints, State Equation: 1614/1614 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 3/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 6 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1437 variables, 3/3 constraints. Problems are: Problem set: 6 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1437 variables, 0/3 constraints. Problems are: Problem set: 6 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 164/1601 variables, 159/162 constraints. Problems are: Problem set: 6 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1601 variables, 7/169 constraints. Problems are: Problem set: 6 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1601 variables, 0/169 constraints. Problems are: Problem set: 6 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 13/1614 variables, 23/192 constraints. Problems are: Problem set: 6 solved, 3 unsolved
[2024-05-28 10:57:23] [INFO ] Deduced a trap composed of 427 places in 1179 ms of which 83 ms to minimize.
[2024-05-28 10:57:24] [INFO ] Deduced a trap composed of 182 places in 1172 ms of which 24 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/1614 variables, 2/194 constraints. Problems are: Problem set: 6 solved, 3 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1614/4995 variables, and 194 constraints, problems are : Problem set: 6 solved, 3 unsolved in 5010 ms.
Refiners :[Positive P Invariants (semi-flows): 159/159 constraints, Generalized P Invariants (flows): 33/33 constraints, State Equation: 0/1614 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 2/2 constraints]
After SMT, in 34797ms problems are : Problem set: 6 solved, 3 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1437 out of 1614 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1614/1614 places, 3390/3390 transitions.
Applied a total of 0 rules in 242 ms. Remains 1614 /1614 variables (removed 0) and now considering 3390/3390 (removed 0) transitions.
Running 3379 sub problems to find dead transitions.
[2024-05-28 10:57:25] [INFO ] Flow matrix only has 3381 transitions (discarded 9 similar events)
[2024-05-28 10:57:25] [INFO ] Invariant cache hit.
[2024-05-28 10:57:25] [INFO ] State equation strengthened by 1 read => feed constraints.
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------
Running PolyORBNT-PT-S10J80
IS_COLORED=
IS_NUPN=
LOADING PETRI NET FILE /home/mcc/execution/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 1614
TRANSITIONS: 13500
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.894s, Sys 0.049s]
SAVING FILE /home/mcc/execution/model (.net / .def) ...
EXPORT TIME: [User 0.150s, Sys 0.000s]
----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES
Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net
Process ID: 574
MODEL NAME: /home/mcc/execution/model
1614 places, 13500 transitions.
No place bound informations found.
No place bound informations found.
No place bound informations found.
No place bound informations found.
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
BK_TIME_CONFINEMENT_REACHED
--------------------
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 ReachabilityFireability -timeout 360 -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-S10J80"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
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-S10J80, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r289-tajo-171654446100519"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/PolyORBNT-PT-S10J80.tgz
mv PolyORBNT-PT-S10J80 execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "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 [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "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 "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.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 [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
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 ;