About the Execution of Smart+red for FunctionPointer-PT-a032
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
16219.527 | 748363.00 | 771678.00 | 13828.60 | TTTF?FFTFFFTTTTF | 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.r171-tall-167838858900638.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..........................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool smartxred
Input is FunctionPointer-PT-a032, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r171-tall-167838858900638
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 444K
-rw-r--r-- 1 mcc users 5.5K Feb 25 11:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 55K Feb 25 11:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.0K Feb 25 11:53 CTLFireability.txt
-rw-r--r-- 1 mcc users 30K Feb 25 11:53 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:08 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:08 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:08 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 11:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 116K Feb 25 11:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.8K Feb 25 11:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 90K Feb 25 11:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:08 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:08 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 34K Mar 5 18:22 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 FunctionPointer-PT-a032-ReachabilityCardinality-00
FORMULA_NAME FunctionPointer-PT-a032-ReachabilityCardinality-01
FORMULA_NAME FunctionPointer-PT-a032-ReachabilityCardinality-02
FORMULA_NAME FunctionPointer-PT-a032-ReachabilityCardinality-03
FORMULA_NAME FunctionPointer-PT-a032-ReachabilityCardinality-04
FORMULA_NAME FunctionPointer-PT-a032-ReachabilityCardinality-05
FORMULA_NAME FunctionPointer-PT-a032-ReachabilityCardinality-06
FORMULA_NAME FunctionPointer-PT-a032-ReachabilityCardinality-07
FORMULA_NAME FunctionPointer-PT-a032-ReachabilityCardinality-08
FORMULA_NAME FunctionPointer-PT-a032-ReachabilityCardinality-09
FORMULA_NAME FunctionPointer-PT-a032-ReachabilityCardinality-10
FORMULA_NAME FunctionPointer-PT-a032-ReachabilityCardinality-11
FORMULA_NAME FunctionPointer-PT-a032-ReachabilityCardinality-12
FORMULA_NAME FunctionPointer-PT-a032-ReachabilityCardinality-13
FORMULA_NAME FunctionPointer-PT-a032-ReachabilityCardinality-14
FORMULA_NAME FunctionPointer-PT-a032-ReachabilityCardinality-15
=== Now, execution of the tool begins
BK_START 1679490954890
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=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FunctionPointer-PT-a032
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-22 13:15:56] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-22 13:15:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 13:15:56] [INFO ] Load time of PNML (sax parser for PT used): 36 ms
[2023-03-22 13:15:56] [INFO ] Transformed 40 places.
[2023-03-22 13:15:56] [INFO ] Transformed 70 transitions.
[2023-03-22 13:15:56] [INFO ] Parsed PT model containing 40 places and 70 transitions and 284 arcs in 91 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 14 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 4 transitions.
FORMULA FunctionPointer-PT-a032-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-a032-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-a032-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 34 resets, run finished after 261 ms. (steps per millisecond=38 ) properties (out of 13) seen :5
FORMULA FunctionPointer-PT-a032-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FunctionPointer-PT-a032-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FunctionPointer-PT-a032-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FunctionPointer-PT-a032-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FunctionPointer-PT-a032-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 8) seen :1
FORMULA FunctionPointer-PT-a032-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 52 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
[2023-03-22 13:15:57] [INFO ] Flow matrix only has 46 transitions (discarded 20 similar events)
// Phase 1: matrix 46 rows 34 cols
[2023-03-22 13:15:57] [INFO ] Computed 4 place invariants in 8 ms
[2023-03-22 13:15:57] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-22 13:15:57] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-22 13:15:57] [INFO ] After 166ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:6
[2023-03-22 13:15:57] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-22 13:15:57] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-22 13:15:57] [INFO ] After 35ms SMT Verify possible using state equation in natural domain returned unsat :5 sat :2
[2023-03-22 13:15:57] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-22 13:15:57] [INFO ] After 12ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :5 sat :2
[2023-03-22 13:15:57] [INFO ] After 33ms SMT Verify possible using trap constraints in natural domain returned unsat :5 sat :2
Attempting to minimize the solution found.
Minimization took 142 ms.
[2023-03-22 13:15:57] [INFO ] After 286ms SMT Verify possible using all constraints in natural domain returned unsat :5 sat :2
FORMULA FunctionPointer-PT-a032-ReachabilityCardinality-14 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA FunctionPointer-PT-a032-ReachabilityCardinality-11 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA FunctionPointer-PT-a032-ReachabilityCardinality-10 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA FunctionPointer-PT-a032-ReachabilityCardinality-09 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA FunctionPointer-PT-a032-ReachabilityCardinality-08 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 7 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 33 ms.
Support contains 19 out of 34 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 34/34 places, 66/66 transitions.
Graph (complete) has 118 edges and 34 vertex of which 33 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 32 transition count 64
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 32 transition count 64
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 5 place count 32 transition count 62
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 7 place count 32 transition count 60
Applied a total of 7 rules in 16 ms. Remains 32 /34 variables (removed 2) and now considering 60/66 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 32/34 places, 60/66 transitions.
Incomplete random walk after 10000 steps, including 20 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 7 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 2) seen :1
FORMULA FunctionPointer-PT-a032-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Running SMT prover for 1 properties.
[2023-03-22 13:15:57] [INFO ] Flow matrix only has 43 transitions (discarded 17 similar events)
// Phase 1: matrix 43 rows 32 cols
[2023-03-22 13:15:57] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-22 13:15:57] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-22 13:15:57] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-22 13:15:57] [INFO ] After 35ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 13:15:57] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2023-03-22 13:15:57] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-22 13:15:57] [INFO ] After 13ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 13:15:57] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-22 13:15:57] [INFO ] After 3ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-22 13:15:57] [INFO ] After 8ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 3 ms.
[2023-03-22 13:15:57] [INFO ] After 47ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 4 out of 32 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 32/32 places, 60/60 transitions.
Graph (complete) has 110 edges and 32 vertex of which 31 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 2 ms. Remains 31 /32 variables (removed 1) and now considering 60/60 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 31/32 places, 60/60 transitions.
Incomplete random walk after 10006 steps, including 25 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2451864 steps, run timeout after 3001 ms. (steps per millisecond=817 ) properties seen :{}
Probabilistic random walk after 2451864 steps, saw 1602894 distinct states, run finished after 3002 ms. (steps per millisecond=816 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-22 13:16:00] [INFO ] Flow matrix only has 43 transitions (discarded 17 similar events)
// Phase 1: matrix 43 rows 31 cols
[2023-03-22 13:16:00] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-22 13:16:00] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-22 13:16:00] [INFO ] After 39ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 13:16:00] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-22 13:16:00] [INFO ] After 19ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 13:16:00] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-22 13:16:00] [INFO ] After 4ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-22 13:16:00] [INFO ] After 11ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 3 ms.
[2023-03-22 13:16:00] [INFO ] After 54ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 31 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 31/31 places, 60/60 transitions.
Applied a total of 0 rules in 3 ms. Remains 31 /31 variables (removed 0) and now considering 60/60 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 31/31 places, 60/60 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 31/31 places, 60/60 transitions.
Applied a total of 0 rules in 2 ms. Remains 31 /31 variables (removed 0) and now considering 60/60 (removed 0) transitions.
[2023-03-22 13:16:00] [INFO ] Flow matrix only has 43 transitions (discarded 17 similar events)
[2023-03-22 13:16:00] [INFO ] Invariant cache hit.
[2023-03-22 13:16:00] [INFO ] Implicit Places using invariants in 31 ms returned []
[2023-03-22 13:16:00] [INFO ] Flow matrix only has 43 transitions (discarded 17 similar events)
[2023-03-22 13:16:00] [INFO ] Invariant cache hit.
[2023-03-22 13:16:00] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-22 13:16:00] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 92 ms to find 0 implicit places.
[2023-03-22 13:16:00] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-22 13:16:00] [INFO ] Flow matrix only has 43 transitions (discarded 17 similar events)
[2023-03-22 13:16:00] [INFO ] Invariant cache hit.
[2023-03-22 13:16:01] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 146 ms. Remains : 31/31 places, 60/60 transitions.
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 18 rules applied. Total rules applied 18 place count 31 transition count 42
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 19 place count 30 transition count 42
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 19 place count 30 transition count 37
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 29 place count 25 transition count 37
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 33 place count 23 transition count 35
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 34 place count 22 transition count 32
Iterating global reduction 2 with 1 rules applied. Total rules applied 35 place count 22 transition count 32
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 36 place count 22 transition count 31
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 37 place count 21 transition count 31
Applied a total of 37 rules in 7 ms. Remains 21 /31 variables (removed 10) and now considering 31/60 (removed 29) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 31 rows 21 cols
[2023-03-22 13:16:01] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-22 13:16:01] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2023-03-22 13:16:01] [INFO ] After 25ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 13:16:01] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-22 13:16:01] [INFO ] After 8ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 13:16:01] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-22 13:16:01] [INFO ] After 3ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-22 13:16:01] [INFO ] After 6ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 3 ms.
[2023-03-22 13:16:01] [INFO ] After 38ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-22 13:16:01] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 3 ms.
[2023-03-22 13:16:01] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 31 places, 60 transitions and 241 arcs took 1 ms.
[2023-03-22 13:16:01] [INFO ] Flatten gal took : 25 ms
Total runtime 4999 ms.
There are residual formulas that ITS could not solve within timeout
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running FunctionPointer (PT), instance a032
Examination ReachabilityCardinality
Parser /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//parser/Cardinality.jar
Model checker /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//rem_exec//smart
GOT IT HERE. BS
Petri model created: 31 places, 60 transitions, 241 arcs.
Final Score: 333.644
Took : 2 seconds
Reachability Cardinality file is: ReachabilityCardinality.xml
READY TO PARSE. BS
PROPERTY: FunctionPointer-PT-a032-ReachabilityCardinality-04 (reachable &!potential( ( (! ( (tk(P7)) <= (tk(P26)) )) | ( (! ( (tk(P11)) <= ( 14 ) )) | ( (tk(P23)) <= ( 20 ) ) ) )))
BK_STOP 1679491703253
--------------------
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 ReachabilityCardinality -timeout 360 -rebuildPNML
/home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//smart.sh: line 116: 533 Killed ${SMART}/smart ${INPUT_SM}
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="FunctionPointer-PT-a032"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="smartxred"
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-5348"
echo " Executing tool smartxred"
echo " Input is FunctionPointer-PT-a032, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r171-tall-167838858900638"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/FunctionPointer-PT-a032.tgz
mv FunctionPointer-PT-a032 execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "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 [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
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 ;