About the Execution of LTSMin+red for ShieldPPPs-PT-040B
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
454.336 | 26412.00 | 45632.00 | 47.70 | 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/mcc2023-input.r407-oct2-167903726600307.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
......................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is ShieldPPPs-PT-040B, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r407-oct2-167903726600307
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 5.5K Feb 26 01:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 51K Feb 26 01:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Feb 26 01:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 72K Feb 26 01:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 16:59 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:59 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:59 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:59 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 26 01:59 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 115K Feb 26 01:59 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.5K Feb 26 01:58 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 60K Feb 26 01:58 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:59 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:59 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 708K Mar 5 18:23 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 QuasiLiveness
=== Now, execution of the tool begins
BK_START 1679763104893
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=QuasiLiveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=ShieldPPPs-PT-040B
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-25 16:51:48] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2023-03-25 16:51:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-25 16:51:48] [INFO ] Load time of PNML (sax parser for PT used): 265 ms
[2023-03-25 16:51:48] [INFO ] Transformed 2723 places.
[2023-03-25 16:51:48] [INFO ] Transformed 2523 transitions.
[2023-03-25 16:51:48] [INFO ] Found NUPN structural information;
[2023-03-25 16:51:48] [INFO ] Parsed PT model containing 2723 places and 2523 transitions and 6966 arcs in 697 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 2723/2723 places, 2523/2523 transitions.
Drop transitions removed 282 transitions
Trivial Post-agglo rules discarded 282 transitions
Performed 282 trivial Post agglomeration. Transition count delta: 282
Iterating post reduction 0 with 282 rules applied. Total rules applied 282 place count 2723 transition count 2241
Reduce places removed 282 places and 0 transitions.
Iterating post reduction 1 with 282 rules applied. Total rules applied 564 place count 2441 transition count 2241
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 200 Pre rules applied. Total rules applied 564 place count 2441 transition count 2041
Deduced a syphon composed of 200 places in 20 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 2 with 400 rules applied. Total rules applied 964 place count 2241 transition count 2041
Performed 960 Post agglomeration using F-continuation condition.Transition count delta: 960
Deduced a syphon composed of 960 places in 2 ms
Reduce places removed 960 places and 0 transitions.
Iterating global reduction 2 with 1920 rules applied. Total rules applied 2884 place count 1281 transition count 1081
Renaming transitions due to excessive name length > 1024 char.
Applied a total of 2884 rules in 389 ms. Remains 1281 /2723 variables (removed 1442) and now considering 1081/2523 (removed 1442) transitions.
// Phase 1: matrix 1081 rows 1281 cols
[2023-03-25 16:51:49] [INFO ] Computed 441 place invariants in 15 ms
[2023-03-25 16:51:51] [INFO ] Implicit Places using invariants in 2329 ms returned []
[2023-03-25 16:51:51] [INFO ] Invariant cache hit.
[2023-03-25 16:51:53] [INFO ] Implicit Places using invariants and state equation in 1813 ms returned []
Implicit Place search using SMT with State Equation took 4175 ms to find 0 implicit places.
[2023-03-25 16:51:53] [INFO ] Invariant cache hit.
[2023-03-25 16:51:54] [INFO ] Dead Transitions using invariants and state equation in 1239 ms found 0 transitions.
Starting structural reductions in LIVENESS mode, iteration 1 : 1281/2723 places, 1081/2523 transitions.
Finished structural reductions in LIVENESS mode , in 1 iterations and 5807 ms. Remains : 1281/2723 places, 1081/2523 transitions.
Discarding 240 transitions out of 1081. Remains 841
Initial state reduction rules removed 1 formulas.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 675 ms. (steps per millisecond=14 ) properties (out of 840) seen :837
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-25 16:51:55] [INFO ] Invariant cache hit.
[2023-03-25 16:51:56] [INFO ] [Real]Absence check using 441 positive place invariants in 121 ms returned sat
[2023-03-25 16:51:57] [INFO ] After 839ms SMT Verify possible using state equation in real domain returned unsat :0 sat :3
[2023-03-25 16:51:57] [INFO ] Deduced a trap composed of 4 places in 251 ms of which 7 ms to minimize.
[2023-03-25 16:51:57] [INFO ] Deduced a trap composed of 4 places in 197 ms of which 1 ms to minimize.
[2023-03-25 16:51:58] [INFO ] Deduced a trap composed of 4 places in 945 ms of which 0 ms to minimize.
[2023-03-25 16:51:58] [INFO ] Deduced a trap composed of 8 places in 216 ms of which 1 ms to minimize.
[2023-03-25 16:51:59] [INFO ] Deduced a trap composed of 4 places in 200 ms of which 1 ms to minimize.
[2023-03-25 16:51:59] [INFO ] Deduced a trap composed of 4 places in 156 ms of which 1 ms to minimize.
[2023-03-25 16:51:59] [INFO ] Deduced a trap composed of 4 places in 165 ms of which 1 ms to minimize.
[2023-03-25 16:51:59] [INFO ] Deduced a trap composed of 4 places in 192 ms of which 1 ms to minimize.
[2023-03-25 16:52:00] [INFO ] Deduced a trap composed of 4 places in 185 ms of which 1 ms to minimize.
[2023-03-25 16:52:00] [INFO ] Deduced a trap composed of 4 places in 188 ms of which 1 ms to minimize.
[2023-03-25 16:52:00] [INFO ] Deduced a trap composed of 4 places in 206 ms of which 0 ms to minimize.
[2023-03-25 16:52:01] [INFO ] Deduced a trap composed of 4 places in 340 ms of which 1 ms to minimize.
[2023-03-25 16:52:01] [INFO ] Deduced a trap composed of 4 places in 98 ms of which 1 ms to minimize.
[2023-03-25 16:52:01] [INFO ] Deduced a trap composed of 4 places in 157 ms of which 1 ms to minimize.
[2023-03-25 16:52:01] [INFO ] Deduced a trap composed of 4 places in 197 ms of which 0 ms to minimize.
[2023-03-25 16:52:01] [INFO ] Trap strengthening procedure interrupted after too many repetitions 4637 ms
[2023-03-25 16:52:01] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 4637 ms
[2023-03-25 16:52:02] [INFO ] Deduced a trap composed of 4 places in 174 ms of which 1 ms to minimize.
[2023-03-25 16:52:02] [INFO ] Deduced a trap composed of 8 places in 139 ms of which 1 ms to minimize.
[2023-03-25 16:52:02] [INFO ] Deduced a trap composed of 4 places in 189 ms of which 1 ms to minimize.
[2023-03-25 16:52:02] [INFO ] Deduced a trap composed of 8 places in 93 ms of which 0 ms to minimize.
[2023-03-25 16:52:02] [INFO ] Deduced a trap composed of 18 places in 106 ms of which 1 ms to minimize.
[2023-03-25 16:52:02] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 0 ms to minimize.
[2023-03-25 16:52:03] [INFO ] Deduced a trap composed of 18 places in 54 ms of which 1 ms to minimize.
[2023-03-25 16:52:03] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1223 ms
[2023-03-25 16:52:03] [INFO ] After 7018ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-25 16:52:03] [INFO ] After 7687ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-25 16:52:04] [INFO ] [Nat]Absence check using 441 positive place invariants in 176 ms returned sat
[2023-03-25 16:52:04] [INFO ] After 617ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-25 16:52:05] [INFO ] Deduced a trap composed of 4 places in 268 ms of which 3 ms to minimize.
[2023-03-25 16:52:05] [INFO ] Deduced a trap composed of 4 places in 179 ms of which 13 ms to minimize.
[2023-03-25 16:52:05] [INFO ] Deduced a trap composed of 4 places in 514 ms of which 1 ms to minimize.
[2023-03-25 16:52:06] [INFO ] Deduced a trap composed of 8 places in 127 ms of which 0 ms to minimize.
[2023-03-25 16:52:06] [INFO ] Deduced a trap composed of 4 places in 159 ms of which 0 ms to minimize.
[2023-03-25 16:52:06] [INFO ] Deduced a trap composed of 4 places in 141 ms of which 1 ms to minimize.
[2023-03-25 16:52:06] [INFO ] Deduced a trap composed of 4 places in 155 ms of which 1 ms to minimize.
[2023-03-25 16:52:06] [INFO ] Deduced a trap composed of 4 places in 182 ms of which 0 ms to minimize.
[2023-03-25 16:52:07] [INFO ] Deduced a trap composed of 4 places in 146 ms of which 0 ms to minimize.
[2023-03-25 16:52:07] [INFO ] Deduced a trap composed of 4 places in 137 ms of which 0 ms to minimize.
[2023-03-25 16:52:07] [INFO ] Deduced a trap composed of 4 places in 141 ms of which 1 ms to minimize.
[2023-03-25 16:52:07] [INFO ] Deduced a trap composed of 4 places in 154 ms of which 3 ms to minimize.
[2023-03-25 16:52:07] [INFO ] Deduced a trap composed of 4 places in 115 ms of which 0 ms to minimize.
[2023-03-25 16:52:08] [INFO ] Deduced a trap composed of 4 places in 137 ms of which 1 ms to minimize.
[2023-03-25 16:52:08] [INFO ] Deduced a trap composed of 4 places in 147 ms of which 0 ms to minimize.
[2023-03-25 16:52:08] [INFO ] Trap strengthening procedure interrupted after too many repetitions 3553 ms
[2023-03-25 16:52:08] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 3554 ms
[2023-03-25 16:52:08] [INFO ] Deduced a trap composed of 4 places in 172 ms of which 1 ms to minimize.
[2023-03-25 16:52:08] [INFO ] Deduced a trap composed of 4 places in 173 ms of which 1 ms to minimize.
[2023-03-25 16:52:09] [INFO ] Deduced a trap composed of 4 places in 139 ms of which 1 ms to minimize.
[2023-03-25 16:52:09] [INFO ] Deduced a trap composed of 18 places in 198 ms of which 0 ms to minimize.
[2023-03-25 16:52:09] [INFO ] Deduced a trap composed of 8 places in 241 ms of which 1 ms to minimize.
[2023-03-25 16:52:09] [INFO ] Deduced a trap composed of 4 places in 78 ms of which 1 ms to minimize.
[2023-03-25 16:52:10] [INFO ] Deduced a trap composed of 18 places in 72 ms of which 2 ms to minimize.
[2023-03-25 16:52:10] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1669 ms
[2023-03-25 16:52:10] [INFO ] After 6058ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 169 ms.
[2023-03-25 16:52:10] [INFO ] After 7106ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 2 different solutions.
Finished Parikh walk after 29705 steps, including 482 resets, run visited all 3 properties in 651 ms. (steps per millisecond=45 )
Parikh walk visited 3 properties in 655 ms.
Able to resolve query QuasiLiveness after proving 841 properties.
FORMULA QuasiLiveness TRUE TECHNIQUES RANDOM_WALK PARIKH_WALK TOPOLOGICAL INITIAL_STATE
Total runtime 23024 ms.
ITS solved all properties within timeout
BK_STOP 1679763131305
--------------------
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.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination QuasiLiveness -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="ShieldPPPs-PT-040B"
export BK_EXAMINATION="QuasiLiveness"
export BK_TOOL="ltsminxred"
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-5348"
echo " Executing tool ltsminxred"
echo " Input is ShieldPPPs-PT-040B, examination is QuasiLiveness"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r407-oct2-167903726600307"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldPPPs-PT-040B.tgz
mv ShieldPPPs-PT-040B execution
cd execution
if [ "QuasiLiveness" = "ReachabilityDeadlock" ] || [ "QuasiLiveness" = "UpperBounds" ] || [ "QuasiLiveness" = "QuasiLiveness" ] || [ "QuasiLiveness" = "StableMarking" ] || [ "QuasiLiveness" = "Liveness" ] || [ "QuasiLiveness" = "OneSafe" ] || [ "QuasiLiveness" = "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 [ "QuasiLiveness" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "QuasiLiveness" != "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 "QuasiLiveness.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property QuasiLiveness.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "QuasiLiveness.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 [ "QuasiLiveness" = "ReachabilityDeadlock" ] || [ "QuasiLiveness" = "QuasiLiveness" ] || [ "QuasiLiveness" = "StableMarking" ] || [ "QuasiLiveness" = "Liveness" ] || [ "QuasiLiveness" = "OneSafe" ] ; then
echo "FORMULA_NAME QuasiLiveness"
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 ;