fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r523-tall-167987247800231
Last Updated
May 14, 2023

About the Execution of Smart+red for EisenbergMcGuire-PT-04

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
1056.359 84093.00 96331.00 550.00 FTTFTFFTFTFTTTTT 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.r523-tall-167987247800231.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 EisenbergMcGuire-PT-04, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r523-tall-167987247800231
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 624K
-rw-r--r-- 1 mcc users 7.3K Mar 23 15:20 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K Mar 23 15:20 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Mar 23 15:19 CTLFireability.txt
-rw-r--r-- 1 mcc users 40K Mar 23 15:19 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Mar 23 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Mar 23 07:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Mar 23 07:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 23 07:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Mar 26 22:42 NewModel
-rw-r--r-- 1 mcc users 11K Mar 23 15:20 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 96K Mar 23 15:20 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.8K Mar 23 15:20 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 48K Mar 23 15:20 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 23 07:07 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 23 07:07 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 26 22:42 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 26 22:42 instance
-rw-r--r-- 1 mcc users 6 Mar 26 22:42 iscolored
-rw-r--r-- 1 mcc users 255K Mar 31 16:48 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 EisenbergMcGuire-PT-04-ReachabilityFireability-00
FORMULA_NAME EisenbergMcGuire-PT-04-ReachabilityFireability-01
FORMULA_NAME EisenbergMcGuire-PT-04-ReachabilityFireability-02
FORMULA_NAME EisenbergMcGuire-PT-04-ReachabilityFireability-03
FORMULA_NAME EisenbergMcGuire-PT-04-ReachabilityFireability-04
FORMULA_NAME EisenbergMcGuire-PT-04-ReachabilityFireability-05
FORMULA_NAME EisenbergMcGuire-PT-04-ReachabilityFireability-06
FORMULA_NAME EisenbergMcGuire-PT-04-ReachabilityFireability-07
FORMULA_NAME EisenbergMcGuire-PT-04-ReachabilityFireability-08
FORMULA_NAME EisenbergMcGuire-PT-04-ReachabilityFireability-09
FORMULA_NAME EisenbergMcGuire-PT-04-ReachabilityFireability-10
FORMULA_NAME EisenbergMcGuire-PT-04-ReachabilityFireability-11
FORMULA_NAME EisenbergMcGuire-PT-04-ReachabilityFireability-12
FORMULA_NAME EisenbergMcGuire-PT-04-ReachabilityFireability-13
FORMULA_NAME EisenbergMcGuire-PT-04-ReachabilityFireability-14
FORMULA_NAME EisenbergMcGuire-PT-04-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1680811336301

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=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=EisenbergMcGuire-PT-04
Applying reductions before tool smart
Invoking reducer
Running Version 202304061127
[2023-04-06 20:02:18] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-04-06 20:02:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-04-06 20:02:18] [INFO ] Load time of PNML (sax parser for PT used): 70 ms
[2023-04-06 20:02:18] [INFO ] Transformed 196 places.
[2023-04-06 20:02:18] [INFO ] Transformed 448 transitions.
[2023-04-06 20:02:18] [INFO ] Found NUPN structural information;
[2023-04-06 20:02:18] [INFO ] Parsed PT model containing 196 places and 448 transitions and 1952 arcs in 142 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 2 resets, run finished after 360 ms. (steps per millisecond=27 ) properties (out of 16) seen :3
FORMULA EisenbergMcGuire-PT-04-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-04-ReachabilityFireability-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-04-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 13) seen :2
FORMULA EisenbergMcGuire-PT-04-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA EisenbergMcGuire-PT-04-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 11) seen :1
FORMULA EisenbergMcGuire-PT-04-ReachabilityFireability-06 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
[2023-04-06 20:02:19] [INFO ] Flow matrix only has 284 transitions (discarded 164 similar events)
// Phase 1: matrix 284 rows 196 cols
[2023-04-06 20:02:19] [INFO ] Computed 13 invariants in 15 ms
[2023-04-06 20:02:19] [INFO ] After 317ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2023-04-06 20:02:19] [INFO ] [Nat]Absence check using 9 positive place invariants in 92 ms returned sat
[2023-04-06 20:02:19] [INFO ] [Nat]Absence check using 9 positive and 4 generalized place invariants in 2 ms returned sat
[2023-04-06 20:02:20] [INFO ] After 328ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :8
[2023-04-06 20:02:20] [INFO ] State equation strengthened by 112 read => feed constraints.
[2023-04-06 20:02:20] [INFO ] After 174ms SMT Verify possible using 112 Read/Feed constraints in natural domain returned unsat :2 sat :8
[2023-04-06 20:02:20] [INFO ] Deduced a trap composed of 3 places in 109 ms of which 8 ms to minimize.
[2023-04-06 20:02:20] [INFO ] Deduced a trap composed of 32 places in 97 ms of which 0 ms to minimize.
[2023-04-06 20:02:20] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 247 ms
[2023-04-06 20:02:20] [INFO ] Deduced a trap composed of 5 places in 55 ms of which 0 ms to minimize.
[2023-04-06 20:02:20] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 0 ms to minimize.
[2023-04-06 20:02:20] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2023-04-06 20:02:20] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 172 ms
[2023-04-06 20:02:20] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 1 ms to minimize.
[2023-04-06 20:02:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 67 ms
[2023-04-06 20:02:20] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 0 ms to minimize.
[2023-04-06 20:02:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 63 ms
[2023-04-06 20:02:21] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 1 ms to minimize.
[2023-04-06 20:02:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 65 ms
[2023-04-06 20:02:21] [INFO ] Deduced a trap composed of 20 places in 55 ms of which 1 ms to minimize.
[2023-04-06 20:02:21] [INFO ] Deduced a trap composed of 48 places in 68 ms of which 0 ms to minimize.
[2023-04-06 20:02:21] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 162 ms
[2023-04-06 20:02:21] [INFO ] After 1126ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :8
Attempting to minimize the solution found.
Minimization took 165 ms.
[2023-04-06 20:02:21] [INFO ] After 1868ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :8
FORMULA EisenbergMcGuire-PT-04-ReachabilityFireability-05 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA EisenbergMcGuire-PT-04-ReachabilityFireability-03 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 10 Parikh solutions to 8 different solutions.
Parikh walk visited 0 properties in 59 ms.
Support contains 46 out of 196 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 196/196 places, 448/448 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 196 transition count 446
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 194 transition count 446
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 40 Pre rules applied. Total rules applied 4 place count 194 transition count 406
Deduced a syphon composed of 40 places in 4 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 2 with 80 rules applied. Total rules applied 84 place count 154 transition count 406
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 93 place count 145 transition count 370
Iterating global reduction 2 with 9 rules applied. Total rules applied 102 place count 145 transition count 370
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 124 place count 134 transition count 359
Applied a total of 124 rules in 74 ms. Remains 134 /196 variables (removed 62) and now considering 359/448 (removed 89) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 74 ms. Remains : 134/196 places, 359/448 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 207 ms. (steps per millisecond=48 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 8) seen :0
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 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 8) seen :0
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 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 8) seen :0
Interrupted probabilistic random walk after 900530 steps, run timeout after 3001 ms. (steps per millisecond=300 ) properties seen :{0=1, 1=1, 3=1, 4=1, 5=1, 6=1, 7=1}
Probabilistic random walk after 900530 steps, saw 182009 distinct states, run finished after 3002 ms. (steps per millisecond=299 ) properties seen :7
FORMULA EisenbergMcGuire-PT-04-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA EisenbergMcGuire-PT-04-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA EisenbergMcGuire-PT-04-ReachabilityFireability-08 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA EisenbergMcGuire-PT-04-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA EisenbergMcGuire-PT-04-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA EisenbergMcGuire-PT-04-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA EisenbergMcGuire-PT-04-ReachabilityFireability-00 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 1 properties.
[2023-04-06 20:02:25] [INFO ] Flow matrix only has 195 transitions (discarded 164 similar events)
// Phase 1: matrix 195 rows 134 cols
[2023-04-06 20:02:25] [INFO ] Computed 13 invariants in 5 ms
[2023-04-06 20:02:25] [INFO ] After 37ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 20:02:25] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2023-04-06 20:02:25] [INFO ] [Nat]Absence check using 9 positive and 4 generalized place invariants in 1 ms returned sat
[2023-04-06 20:02:25] [INFO ] After 46ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 20:02:25] [INFO ] State equation strengthened by 85 read => feed constraints.
[2023-04-06 20:02:25] [INFO ] After 26ms SMT Verify possible using 85 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 20:02:25] [INFO ] After 50ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 21 ms.
[2023-04-06 20:02:25] [INFO ] After 153ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 16 out of 134 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 134/134 places, 359/359 transitions.
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 13 Pre rules applied. Total rules applied 0 place count 134 transition count 346
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 0 with 26 rules applied. Total rules applied 26 place count 121 transition count 346
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 28 place count 119 transition count 338
Iterating global reduction 0 with 2 rules applied. Total rules applied 30 place count 119 transition count 338
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 32 place count 118 transition count 337
Applied a total of 32 rules in 28 ms. Remains 118 /134 variables (removed 16) and now considering 337/359 (removed 22) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 118/134 places, 337/359 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Finished probabilistic random walk after 657308 steps, run visited all 1 properties in 1355 ms. (steps per millisecond=485 )
Probabilistic random walk after 657308 steps, saw 133033 distinct states, run finished after 1356 ms. (steps per millisecond=484 ) properties seen :1
FORMULA EisenbergMcGuire-PT-04-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Parikh walk visited 0 properties in 0 ms.
All properties solved without resorting to model-checking.
Total runtime 8693 ms.
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running EisenbergMcGuire (PT), instance 04
Examination ReachabilityFireability
Parser /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//parser/Fireability.jar
Model checker /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//rem_exec//smart

GOT IT HERE. BS
Petri model created: 196 places, 448 transitions, 1952 arcs.
Final Score: 6805.048
Took : 18 seconds
Reachability Fireability file is: ReachabilityFireability.xml
READY TO PARSE. BS
FORMULA EisenbergMcGuire-PT-04-ReachabilityFireability-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA EisenbergMcGuire-PT-04-ReachabilityFireability-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA EisenbergMcGuire-PT-04-ReachabilityFireability-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA EisenbergMcGuire-PT-04-ReachabilityFireability-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA EisenbergMcGuire-PT-04-ReachabilityFireability-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA EisenbergMcGuire-PT-04-ReachabilityFireability-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA EisenbergMcGuire-PT-04-ReachabilityFireability-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA EisenbergMcGuire-PT-04-ReachabilityFireability-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA EisenbergMcGuire-PT-04-ReachabilityFireability-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA EisenbergMcGuire-PT-04-ReachabilityFireability-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA EisenbergMcGuire-PT-04-ReachabilityFireability-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA EisenbergMcGuire-PT-04-ReachabilityFireability-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA EisenbergMcGuire-PT-04-ReachabilityFireability-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA EisenbergMcGuire-PT-04-ReachabilityFireability-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA EisenbergMcGuire-PT-04-ReachabilityFireability-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA EisenbergMcGuire-PT-04-ReachabilityFireability-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS

BK_STOP 1680811420394

--------------------
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.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /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="EisenbergMcGuire-PT-04"
export BK_EXAMINATION="ReachabilityFireability"
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 EisenbergMcGuire-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 r523-tall-167987247800231"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/EisenbergMcGuire-PT-04.tgz
mv EisenbergMcGuire-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 '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;