About the Execution of Smart+red for ShieldRVs-PT-030A
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
329.384 | 19314.00 | 38634.00 | 119.80 | T | 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/mcc2023-input.r441-tajo-167905986900072.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.....................
=====================================================================
Generated by BenchKit 2-5348
Executing tool smartxred
Input is ShieldRVs-PT-030A, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r441-tajo-167905986900072
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 580K
-rw-r--r-- 1 mcc users 5.5K Feb 26 18:59 CTLCardinality.txt
-rw-r--r-- 1 mcc users 55K Feb 26 18:59 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Feb 26 18:40 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K Feb 26 18:40 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.9K Feb 25 17:02 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 17:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 17:02 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 17:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.7K Feb 26 19:13 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 62K Feb 26 19:13 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.7K Feb 26 19:06 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 88K Feb 26 19:06 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:02 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:02 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 191K 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 1679557775083
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=smartxred
BK_EXAMINATION=QuasiLiveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=ShieldRVs-PT-030A
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-23 07:49:37] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2023-03-23 07:49:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-23 07:49:37] [INFO ] Load time of PNML (sax parser for PT used): 113 ms
[2023-03-23 07:49:37] [INFO ] Transformed 423 places.
[2023-03-23 07:49:37] [INFO ] Transformed 573 transitions.
[2023-03-23 07:49:37] [INFO ] Found NUPN structural information;
[2023-03-23 07:49:37] [INFO ] Parsed PT model containing 423 places and 573 transitions and 2760 arcs in 222 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 423/423 places, 573/573 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 422 transition count 572
Applied a total of 2 rules in 77 ms. Remains 422 /423 variables (removed 1) and now considering 572/573 (removed 1) transitions.
// Phase 1: matrix 572 rows 422 cols
[2023-03-23 07:49:37] [INFO ] Computed 121 place invariants in 24 ms
[2023-03-23 07:49:38] [INFO ] Implicit Places using invariants in 740 ms returned []
[2023-03-23 07:49:38] [INFO ] Invariant cache hit.
[2023-03-23 07:49:39] [INFO ] Implicit Places using invariants and state equation in 770 ms returned []
Implicit Place search using SMT with State Equation took 1575 ms to find 0 implicit places.
[2023-03-23 07:49:39] [INFO ] Invariant cache hit.
[2023-03-23 07:49:40] [INFO ] Dead Transitions using invariants and state equation in 637 ms found 0 transitions.
Starting structural reductions in LIVENESS mode, iteration 1 : 422/423 places, 572/573 transitions.
Finished structural reductions in LIVENESS mode , in 1 iterations and 2298 ms. Remains : 422/423 places, 572/573 transitions.
Discarding 180 transitions out of 572. Remains 392
Initial state reduction rules removed 1 formulas.
Incomplete random walk after 10000 steps, including 24 resets, run finished after 669 ms. (steps per millisecond=14 ) properties (out of 391) seen :376
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 15) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 14) seen :0
Running SMT prover for 14 properties.
[2023-03-23 07:49:40] [INFO ] Invariant cache hit.
[2023-03-23 07:49:41] [INFO ] [Real]Absence check using 121 positive place invariants in 22 ms returned sat
[2023-03-23 07:49:42] [INFO ] After 1221ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:14
[2023-03-23 07:49:42] [INFO ] [Nat]Absence check using 121 positive place invariants in 24 ms returned sat
[2023-03-23 07:49:43] [INFO ] After 781ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :14
[2023-03-23 07:49:43] [INFO ] Deduced a trap composed of 7 places in 108 ms of which 32 ms to minimize.
[2023-03-23 07:49:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 183 ms
[2023-03-23 07:49:44] [INFO ] Deduced a trap composed of 13 places in 916 ms of which 28 ms to minimize.
[2023-03-23 07:49:44] [INFO ] Deduced a trap composed of 12 places in 156 ms of which 1 ms to minimize.
[2023-03-23 07:49:45] [INFO ] Deduced a trap composed of 8 places in 153 ms of which 2 ms to minimize.
[2023-03-23 07:49:45] [INFO ] Deduced a trap composed of 7 places in 98 ms of which 1 ms to minimize.
[2023-03-23 07:49:45] [INFO ] Deduced a trap composed of 12 places in 96 ms of which 0 ms to minimize.
[2023-03-23 07:49:45] [INFO ] Deduced a trap composed of 11 places in 134 ms of which 1 ms to minimize.
[2023-03-23 07:49:45] [INFO ] Deduced a trap composed of 11 places in 127 ms of which 1 ms to minimize.
[2023-03-23 07:49:45] [INFO ] Deduced a trap composed of 9 places in 108 ms of which 1 ms to minimize.
[2023-03-23 07:49:45] [INFO ] Deduced a trap composed of 12 places in 73 ms of which 1 ms to minimize.
[2023-03-23 07:49:46] [INFO ] Deduced a trap composed of 11 places in 115 ms of which 0 ms to minimize.
[2023-03-23 07:49:46] [INFO ] Deduced a trap composed of 8 places in 80 ms of which 0 ms to minimize.
[2023-03-23 07:49:46] [INFO ] Deduced a trap composed of 15 places in 78 ms of which 1 ms to minimize.
[2023-03-23 07:49:46] [INFO ] Deduced a trap composed of 24 places in 67 ms of which 1 ms to minimize.
[2023-03-23 07:49:46] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 0 ms to minimize.
[2023-03-23 07:49:46] [INFO ] Deduced a trap composed of 11 places in 38 ms of which 1 ms to minimize.
[2023-03-23 07:49:46] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 0 ms to minimize.
[2023-03-23 07:49:46] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 0 ms to minimize.
[2023-03-23 07:49:46] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 2836 ms
[2023-03-23 07:49:46] [INFO ] Deduced a trap composed of 7 places in 59 ms of which 0 ms to minimize.
[2023-03-23 07:49:46] [INFO ] Deduced a trap composed of 7 places in 45 ms of which 1 ms to minimize.
[2023-03-23 07:49:46] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 151 ms
[2023-03-23 07:49:47] [INFO ] Deduced a trap composed of 11 places in 79 ms of which 0 ms to minimize.
[2023-03-23 07:49:47] [INFO ] Deduced a trap composed of 7 places in 61 ms of which 2 ms to minimize.
[2023-03-23 07:49:47] [INFO ] Deduced a trap composed of 7 places in 47 ms of which 0 ms to minimize.
[2023-03-23 07:49:47] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 291 ms
[2023-03-23 07:49:47] [INFO ] Deduced a trap composed of 11 places in 48 ms of which 0 ms to minimize.
[2023-03-23 07:49:47] [INFO ] Deduced a trap composed of 12 places in 45 ms of which 0 ms to minimize.
[2023-03-23 07:49:47] [INFO ] Deduced a trap composed of 7 places in 123 ms of which 1 ms to minimize.
[2023-03-23 07:49:47] [INFO ] Deduced a trap composed of 7 places in 123 ms of which 1 ms to minimize.
[2023-03-23 07:49:47] [INFO ] Deduced a trap composed of 7 places in 78 ms of which 0 ms to minimize.
[2023-03-23 07:49:48] [INFO ] Deduced a trap composed of 11 places in 73 ms of which 1 ms to minimize.
[2023-03-23 07:49:48] [INFO ] Deduced a trap composed of 12 places in 79 ms of which 1 ms to minimize.
[2023-03-23 07:49:48] [INFO ] Deduced a trap composed of 11 places in 65 ms of which 0 ms to minimize.
[2023-03-23 07:49:48] [INFO ] Deduced a trap composed of 11 places in 46 ms of which 0 ms to minimize.
[2023-03-23 07:49:48] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 897 ms
[2023-03-23 07:49:48] [INFO ] Deduced a trap composed of 16 places in 55 ms of which 0 ms to minimize.
[2023-03-23 07:49:48] [INFO ] Deduced a trap composed of 16 places in 83 ms of which 1 ms to minimize.
[2023-03-23 07:49:48] [INFO ] Deduced a trap composed of 15 places in 73 ms of which 4 ms to minimize.
[2023-03-23 07:49:48] [INFO ] Deduced a trap composed of 16 places in 65 ms of which 0 ms to minimize.
[2023-03-23 07:49:48] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 409 ms
[2023-03-23 07:49:48] [INFO ] Deduced a trap composed of 8 places in 61 ms of which 0 ms to minimize.
[2023-03-23 07:49:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 114 ms
[2023-03-23 07:49:48] [INFO ] After 6326ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :14
Attempting to minimize the solution found.
Minimization took 411 ms.
[2023-03-23 07:49:49] [INFO ] After 7156ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :14
Finished Parikh walk after 41814 steps, including 1032 resets, run visited all 5 properties in 642 ms. (steps per millisecond=65 )
Parikh walk visited 14 properties in 4792 ms.
Able to resolve query QuasiLiveness after proving 392 properties.
FORMULA QuasiLiveness TRUE TECHNIQUES RANDOM_WALK PARIKH_WALK BESTFIRST_WALK TOPOLOGICAL INITIAL_STATE
Total runtime 16630 ms.
ITS solved all properties within timeout
BK_STOP 1679557794397
--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ 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="ShieldRVs-PT-030A"
export BK_EXAMINATION="QuasiLiveness"
export BK_TOOL="smartxred"
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 smartxred"
echo " Input is ShieldRVs-PT-030A, 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 r441-tajo-167905986900072"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldRVs-PT-030A.tgz
mv ShieldRVs-PT-030A 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 ;