About the Execution of ITS-Tools for HexagonalGrid-PT-110
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
318.899 | 11538.00 | 19494.00 | 179.50 | T | 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.r211-smll-171649594100004.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 itstools
Input is HexagonalGrid-PT-110, examination is Liveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r211-smll-171649594100004
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 460K
-rw-r--r-- 1 mcc users 6.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K 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 3.7K Apr 22 14:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Apr 22 14:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 22 14:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 22 14:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 13 02:49 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 108K Apr 13 02:49 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 13 02:48 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 89K Apr 13 02:48 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:48 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:48 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rwxr-xr-x 1 mcc users 29K 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
FORMULA_NAME Liveness
=== Now, execution of the tool begins
BK_START 1716622690599
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=Liveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=HexagonalGrid-PT-110
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
Liveness PT
Running Version 202405141337
[2024-05-25 07:38:13] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, Liveness, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 1800]
[2024-05-25 07:38:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 07:38:13] [INFO ] Load time of PNML (sax parser for PT used): 98 ms
[2024-05-25 07:38:13] [INFO ] Transformed 31 places.
[2024-05-25 07:38:13] [INFO ] Transformed 42 transitions.
[2024-05-25 07:38:13] [INFO ] Parsed PT model containing 31 places and 42 transitions and 168 arcs in 324 ms.
Discarding 24 transitions out of 42. Remains 18
Built sparse matrix representations for Structural reductions in 8 ms.19461KB memory used
Starting structural reductions in DEADLOCK mode, iteration 0 : 31/31 places, 42/42 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Applied a total of 0 rules in 27 ms. Remains 31 /31 variables (removed 0) and now considering 42/42 (removed 0) transitions.
Finished structural reductions in DEADLOCK mode , in 1 iterations and 58 ms. Remains : 31/31 places, 42/42 transitions.
Starting structural reductions in DEADLOCK mode, iteration 0 : 31/31 places, 42/42 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Applied a total of 0 rules in 7 ms. Remains 31 /31 variables (removed 0) and now considering 42/42 (removed 0) transitions.
// Phase 1: matrix 42 rows 31 cols
[2024-05-25 07:38:13] [INFO ] Computed 14 invariants in 17 ms
[2024-05-25 07:38:14] [INFO ] Implicit Places using invariants in 324 ms returned []
[2024-05-25 07:38:14] [INFO ] Invariant cache hit.
[2024-05-25 07:38:14] [INFO ] Implicit Places using invariants and state equation in 153 ms returned []
Implicit Place search using SMT with State Equation took 542 ms to find 0 implicit places.
[2024-05-25 07:38:14] [INFO ] Redundant transitions in 1 ms returned []
Running 36 sub problems to find dead transitions.
[2024-05-25 07:38:14] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/19 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 2 (OVERLAPS) 6/25 variables, 7/13 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 4 (OVERLAPS) 6/31 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/31 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 6 (OVERLAPS) 42/73 variables, 31/45 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/73 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 8 (OVERLAPS) 0/73 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 36 unsolved
No progress, stopping.
After SMT solving in domain Real declared 73/73 variables, and 45 constraints, problems are : Problem set: 0 solved, 36 unsolved in 1163 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 31/31 constraints, PredecessorRefiner: 36/36 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 36 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/19 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 2 (OVERLAPS) 6/25 variables, 7/13 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 4 (OVERLAPS) 6/31 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/31 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 6 (OVERLAPS) 42/73 variables, 31/45 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/73 variables, 36/81 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/73 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 9 (OVERLAPS) 0/73 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 36 unsolved
No progress, stopping.
After SMT solving in domain Int declared 73/73 variables, and 81 constraints, problems are : Problem set: 0 solved, 36 unsolved in 1108 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 31/31 constraints, PredecessorRefiner: 36/36 constraints, Known Traps: 0/0 constraints]
After SMT, in 2488ms problems are : Problem set: 0 solved, 36 unsolved
Search for dead transitions found 0 dead transitions in 2506ms
Finished structural reductions in DEADLOCK mode , in 1 iterations and 3082 ms. Remains : 31/31 places, 42/42 transitions.
Random walk for 1250000 steps, including 0 resets, run took 3127 ms (no deadlock found). (steps per millisecond=399 )
Random directed walk for 1250002 steps, including 0 resets, run took 1645 ms (no deadlock found). (steps per millisecond=759 )
[2024-05-25 07:38:21] [INFO ] Invariant cache hit.
[2024-05-25 07:38:21] [INFO ] [Real]Absence check using 13 positive place invariants in 6 ms returned sat
[2024-05-25 07:38:21] [INFO ] [Real]Absence check using 13 positive and 1 generalized place invariants in 3 ms returned unsat
Starting structural reductions in LIVENESS mode, iteration 0 : 31/31 places, 42/42 transitions.
Applied a total of 0 rules in 1 ms. Remains 31 /31 variables (removed 0) and now considering 42/42 (removed 0) transitions.
[2024-05-25 07:38:21] [INFO ] Invariant cache hit.
[2024-05-25 07:38:21] [INFO ] Implicit Places using invariants in 104 ms returned [6]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 109 ms to find 1 implicit places.
Starting structural reductions in LIVENESS mode, iteration 1 : 30/31 places, 42/42 transitions.
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 6 Pre rules applied. Total rules applied 0 place count 30 transition count 36
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 0 with 18 rules applied. Total rules applied 18 place count 18 transition count 36
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 6 Pre rules applied. Total rules applied 18 place count 18 transition count 30
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 6 transition count 30
Graph (trivial) has 30 edges and 6 vertex of which 6 / 6 are part of one of the 1 SCC in 3 ms
Free SCC test removed 5 places
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 38 place count 0 transition count 30
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 29 transitions.
Iterating post reduction 0 with 29 rules applied. Total rules applied 67 place count 0 transition count 1
Applied a total of 67 rules in 34 ms. Remains 0 /30 variables (removed 30) and now considering 1/42 (removed 41) transitions.
[2024-05-25 07:38:21] [INFO ] Computed 0 invariants in 0 ms
[2024-05-25 07:38:21] [INFO ] Implicit Places using invariants in 15 ms returned []
[2024-05-25 07:38:21] [INFO ] Invariant cache hit.
[2024-05-25 07:38:21] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 43 ms to find 0 implicit places.
Starting structural reductions in LIVENESS mode, iteration 2 : 0/31 places, 1/42 transitions.
Finished structural reductions in LIVENESS mode , in 2 iterations and 189 ms. Remains : 0/31 places, 1/42 transitions.
Able to resolve query QuasiLiveness after proving 1 properties.
Starting structural reductions in LIVENESS mode, iteration 0 : 31/31 places, 42/42 transitions.
Applied a total of 0 rules in 0 ms. Remains 31 /31 variables (removed 0) and now considering 42/42 (removed 0) transitions.
// Phase 1: matrix 42 rows 31 cols
[2024-05-25 07:38:21] [INFO ] Computed 14 invariants in 3 ms
[2024-05-25 07:38:21] [INFO ] Implicit Places using invariants in 90 ms returned [6]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 92 ms to find 1 implicit places.
Starting structural reductions in LIVENESS mode, iteration 1 : 30/31 places, 42/42 transitions.
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 6 Pre rules applied. Total rules applied 0 place count 30 transition count 36
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 0 with 18 rules applied. Total rules applied 18 place count 18 transition count 36
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 6 Pre rules applied. Total rules applied 18 place count 18 transition count 30
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 6 transition count 30
Graph (trivial) has 30 edges and 6 vertex of which 6 / 6 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 38 place count 0 transition count 30
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 29 transitions.
Iterating post reduction 0 with 29 rules applied. Total rules applied 67 place count 0 transition count 1
Applied a total of 67 rules in 3 ms. Remains 0 /30 variables (removed 30) and now considering 1/42 (removed 41) transitions.
[2024-05-25 07:38:21] [INFO ] Computed 0 invariants in 0 ms
[2024-05-25 07:38:22] [INFO ] Implicit Places using invariants in 9 ms returned []
[2024-05-25 07:38:22] [INFO ] Invariant cache hit.
[2024-05-25 07:38:22] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 33 ms to find 0 implicit places.
Starting structural reductions in LIVENESS mode, iteration 2 : 0/31 places, 1/42 transitions.
Finished structural reductions in LIVENESS mode , in 2 iterations and 130 ms. Remains : 0/31 places, 1/42 transitions.
Net is quasi-live, checking if it is reversible to establish liveness.
Net is conservative; using simplified expression for initial state.
Able to resolve query Liveness after proving 1 properties.
FORMULA Liveness TRUE TECHNIQUES TOPOLOGICAL QUASI_LIVE_REVERSIBLE INITIAL_STATE
Total runtime 8851 ms.
BK_STOP 1716622702137
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ Liveness = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution Liveness -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination Liveness -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800
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="HexagonalGrid-PT-110"
export BK_EXAMINATION="Liveness"
export BK_TOOL="itstools"
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 itstools"
echo " Input is HexagonalGrid-PT-110, examination is Liveness"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r211-smll-171649594100004"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/HexagonalGrid-PT-110.tgz
mv HexagonalGrid-PT-110 execution
cd execution
if [ "Liveness" = "ReachabilityDeadlock" ] || [ "Liveness" = "UpperBounds" ] || [ "Liveness" = "QuasiLiveness" ] || [ "Liveness" = "StableMarking" ] || [ "Liveness" = "Liveness" ] || [ "Liveness" = "OneSafe" ] || [ "Liveness" = "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 [ "Liveness" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "Liveness" != "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 "Liveness.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property Liveness.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "Liveness.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 [ "Liveness" = "ReachabilityDeadlock" ] || [ "Liveness" = "QuasiLiveness" ] || [ "Liveness" = "StableMarking" ] || [ "Liveness" = "Liveness" ] || [ "Liveness" = "OneSafe" ] ; then
echo "FORMULA_NAME Liveness"
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 ;