About the Execution of GreatSPN+red for BusinessProcesses-PT-04
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
291.699 | 4692.00 | 10597.00 | 45.30 | TFFTTTFFTFTTTFFF | 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.r047-tajo-171620398300479.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 BusinessProcesses-PT-04, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r047-tajo-171620398300479
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 432K
-rw-r--r-- 1 mcc users 6.4K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K May 19 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 19 15:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 19 07:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 17:55 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.0K Apr 11 16:39 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 53K Apr 11 16:39 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Apr 11 16:39 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 60K Apr 11 16:39 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 79K May 18 16:42 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 BusinessProcesses-PT-04-ReachabilityFireability-2024-00
FORMULA_NAME BusinessProcesses-PT-04-ReachabilityFireability-2024-01
FORMULA_NAME BusinessProcesses-PT-04-ReachabilityFireability-2024-02
FORMULA_NAME BusinessProcesses-PT-04-ReachabilityFireability-2024-03
FORMULA_NAME BusinessProcesses-PT-04-ReachabilityFireability-2024-04
FORMULA_NAME BusinessProcesses-PT-04-ReachabilityFireability-2024-05
FORMULA_NAME BusinessProcesses-PT-04-ReachabilityFireability-2024-06
FORMULA_NAME BusinessProcesses-PT-04-ReachabilityFireability-2024-07
FORMULA_NAME BusinessProcesses-PT-04-ReachabilityFireability-2024-08
FORMULA_NAME BusinessProcesses-PT-04-ReachabilityFireability-2024-09
FORMULA_NAME BusinessProcesses-PT-04-ReachabilityFireability-2024-10
FORMULA_NAME BusinessProcesses-PT-04-ReachabilityFireability-2024-11
FORMULA_NAME BusinessProcesses-PT-04-ReachabilityFireability-2024-12
FORMULA_NAME BusinessProcesses-PT-04-ReachabilityFireability-2024-13
FORMULA_NAME BusinessProcesses-PT-04-ReachabilityFireability-2024-14
FORMULA_NAME BusinessProcesses-PT-04-ReachabilityFireability-2024-15
=== Now, execution of the tool begins
BK_START 1716303401291
Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-04
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-21 14:56:42] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-21 14:56:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 14:56:42] [INFO ] Load time of PNML (sax parser for PT used): 72 ms
[2024-05-21 14:56:42] [INFO ] Transformed 288 places.
[2024-05-21 14:56:42] [INFO ] Transformed 283 transitions.
[2024-05-21 14:56:42] [INFO ] Found NUPN structural information;
[2024-05-21 14:56:42] [INFO ] Parsed PT model containing 288 places and 283 transitions and 916 arcs in 168 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 14 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 2 transitions.
RANDOM walk for 40000 steps (436 resets) in 1908 ms. (20 steps per ms) remains 10/16 properties
FORMULA BusinessProcesses-PT-04-ReachabilityFireability-2024-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-04-ReachabilityFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-04-ReachabilityFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-04-ReachabilityFireability-2024-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-04-ReachabilityFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-04-ReachabilityFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (97 resets) in 240 ms. (165 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (89 resets) in 564 ms. (70 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (92 resets) in 108 ms. (367 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (127 resets) in 179 ms. (222 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (94 resets) in 118 ms. (336 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (92 resets) in 124 ms. (320 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (98 resets) in 110 ms. (360 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (97 resets) in 217 ms. (183 steps per ms) remains 9/10 properties
FORMULA BusinessProcesses-PT-04-ReachabilityFireability-2024-12 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40001 steps (89 resets) in 42 ms. (930 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (93 resets) in 37 ms. (1052 steps per ms) remains 9/9 properties
// Phase 1: matrix 281 rows 286 cols
[2024-05-21 14:56:44] [INFO ] Computed 44 invariants in 17 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 97/97 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Problem BusinessProcesses-PT-04-ReachabilityFireability-2024-02 is UNSAT
FORMULA BusinessProcesses-PT-04-ReachabilityFireability-2024-02 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 134/231 variables, 21/118 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/231 variables, 134/252 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/231 variables, 1/253 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/231 variables, 0/253 constraints. Problems are: Problem set: 1 solved, 8 unsolved
Problem BusinessProcesses-PT-04-ReachabilityFireability-2024-01 is UNSAT
FORMULA BusinessProcesses-PT-04-ReachabilityFireability-2024-01 FALSE TECHNIQUES SMT_REFINEMENT
Problem BusinessProcesses-PT-04-ReachabilityFireability-2024-07 is UNSAT
FORMULA BusinessProcesses-PT-04-ReachabilityFireability-2024-07 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 6 (OVERLAPS) 55/286 variables, 22/275 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/286 variables, 55/330 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/286 variables, 0/330 constraints. Problems are: Problem set: 3 solved, 6 unsolved
Problem BusinessProcesses-PT-04-ReachabilityFireability-2024-06 is UNSAT
FORMULA BusinessProcesses-PT-04-ReachabilityFireability-2024-06 FALSE TECHNIQUES SMT_REFINEMENT
Problem BusinessProcesses-PT-04-ReachabilityFireability-2024-13 is UNSAT
FORMULA BusinessProcesses-PT-04-ReachabilityFireability-2024-13 FALSE TECHNIQUES SMT_REFINEMENT
Problem BusinessProcesses-PT-04-ReachabilityFireability-2024-14 is UNSAT
FORMULA BusinessProcesses-PT-04-ReachabilityFireability-2024-14 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 9 (OVERLAPS) 281/567 variables, 286/616 constraints. Problems are: Problem set: 6 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/567 variables, 0/616 constraints. Problems are: Problem set: 6 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 0/567 variables, 0/616 constraints. Problems are: Problem set: 6 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 567/567 variables, and 616 constraints, problems are : Problem set: 6 solved, 3 unsolved in 904 ms.
Refiners :[Domain max(s): 286/286 constraints, Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 23/23 constraints, State Equation: 286/286 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 6 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 60/60 constraints. Problems are: Problem set: 6 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/60 variables, 0/60 constraints. Problems are: Problem set: 6 solved, 3 unsolved
Problem BusinessProcesses-PT-04-ReachabilityFireability-2024-00 is UNSAT
FORMULA BusinessProcesses-PT-04-ReachabilityFireability-2024-00 TRUE TECHNIQUES SMT_REFINEMENT
Problem BusinessProcesses-PT-04-ReachabilityFireability-2024-04 is UNSAT
FORMULA BusinessProcesses-PT-04-ReachabilityFireability-2024-04 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 153/213 variables, 20/80 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/213 variables, 153/233 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/213 variables, 1/234 constraints. Problems are: Problem set: 8 solved, 1 unsolved
[2024-05-21 14:56:45] [INFO ] Deduced a trap composed of 12 places in 102 ms of which 17 ms to minimize.
[2024-05-21 14:56:45] [INFO ] Deduced a trap composed of 24 places in 57 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/213 variables, 2/236 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/213 variables, 0/236 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 4/217 variables, 1/237 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/217 variables, 4/241 constraints. Problems are: Problem set: 8 solved, 1 unsolved
[2024-05-21 14:56:45] [INFO ] Deduced a trap composed of 8 places in 112 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/217 variables, 1/242 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/217 variables, 0/242 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 69/286 variables, 22/264 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/286 variables, 69/333 constraints. Problems are: Problem set: 8 solved, 1 unsolved
[2024-05-21 14:56:45] [INFO ] Deduced a trap composed of 39 places in 152 ms of which 11 ms to minimize.
Problem BusinessProcesses-PT-04-ReachabilityFireability-2024-05 is UNSAT
FORMULA BusinessProcesses-PT-04-ReachabilityFireability-2024-05 TRUE TECHNIQUES SMT_REFINEMENT
After SMT solving in domain Int declared 286/567 variables, and 334 constraints, problems are : Problem set: 9 solved, 0 unsolved in 755 ms.
Refiners :[Domain max(s): 286/286 constraints, Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 23/23 constraints, State Equation: 0/286 constraints, PredecessorRefiner: 0/9 constraints, Known Traps: 4/4 constraints]
After SMT, in 1782ms problems are : Problem set: 9 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
All properties solved without resorting to model-checking.
Total runtime 3283 ms.
ITS solved all properties within timeout
BK_STOP 1716303405983
--------------------
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="BusinessProcesses-PT-04"
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 BusinessProcesses-PT-04, 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 r047-tajo-171620398300479"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/BusinessProcesses-PT-04.tgz
mv BusinessProcesses-PT-04 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 ;