About the Execution of Marcie+red for AutonomousCar-PT-03b
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 5893.575 | 36423.00 | 50174.00 | 34.70 | FTFTTTTTTTFFTTTF | 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.r010-oct2-167813599200574.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 marciexred
Input is AutonomousCar-PT-03b, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r010-oct2-167813599200574
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 488K
-rw-r--r-- 1 mcc users 7.2K Feb 25 12:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K Feb 25 12:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Feb 25 12:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K Feb 25 12:55 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Feb 25 15:33 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 15:33 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 15:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:33 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.8K Feb 25 12:56 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 78K Feb 25 12:56 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.5K Feb 25 12:56 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 84K Feb 25 12:56 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:33 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:33 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 75K 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 AutonomousCar-PT-03b-ReachabilityCardinality-00
FORMULA_NAME AutonomousCar-PT-03b-ReachabilityCardinality-01
FORMULA_NAME AutonomousCar-PT-03b-ReachabilityCardinality-02
FORMULA_NAME AutonomousCar-PT-03b-ReachabilityCardinality-03
FORMULA_NAME AutonomousCar-PT-03b-ReachabilityCardinality-04
FORMULA_NAME AutonomousCar-PT-03b-ReachabilityCardinality-05
FORMULA_NAME AutonomousCar-PT-03b-ReachabilityCardinality-06
FORMULA_NAME AutonomousCar-PT-03b-ReachabilityCardinality-07
FORMULA_NAME AutonomousCar-PT-03b-ReachabilityCardinality-08
FORMULA_NAME AutonomousCar-PT-03b-ReachabilityCardinality-09
FORMULA_NAME AutonomousCar-PT-03b-ReachabilityCardinality-10
FORMULA_NAME AutonomousCar-PT-03b-ReachabilityCardinality-11
FORMULA_NAME AutonomousCar-PT-03b-ReachabilityCardinality-12
FORMULA_NAME AutonomousCar-PT-03b-ReachabilityCardinality-13
FORMULA_NAME AutonomousCar-PT-03b-ReachabilityCardinality-14
FORMULA_NAME AutonomousCar-PT-03b-ReachabilityCardinality-15
=== Now, execution of the tool begins
BK_START 1678699104634
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=marciexred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutonomousCar-PT-03b
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-13 09:18:27] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-13 09:18:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 09:18:28] [INFO ] Load time of PNML (sax parser for PT used): 109 ms
[2023-03-13 09:18:28] [INFO ] Transformed 190 places.
[2023-03-13 09:18:28] [INFO ] Transformed 273 transitions.
[2023-03-13 09:18:28] [INFO ] Found NUPN structural information;
[2023-03-13 09:18:28] [INFO ] Parsed PT model containing 190 places and 273 transitions and 1051 arcs in 330 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 14 ms.
Working with output stream class java.io.PrintStream
FORMULA AutonomousCar-PT-03b-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-03b-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 9 resets, run finished after 386 ms. (steps per millisecond=25 ) properties (out of 14) seen :8
FORMULA AutonomousCar-PT-03b-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-03b-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-03b-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-03b-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-03b-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-03b-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-03b-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-03b-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 108 ms. (steps per millisecond=92 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 6) seen :1
FORMULA AutonomousCar-PT-03b-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 12 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 9 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 273 rows 190 cols
[2023-03-13 09:18:29] [INFO ] Computed 8 place invariants in 8 ms
[2023-03-13 09:18:29] [INFO ] After 456ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-13 09:18:29] [INFO ] [Nat]Absence check using 8 positive place invariants in 16 ms returned sat
[2023-03-13 09:18:30] [INFO ] After 278ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :4
[2023-03-13 09:18:30] [INFO ] Deduced a trap composed of 12 places in 453 ms of which 5 ms to minimize.
[2023-03-13 09:18:30] [INFO ] Deduced a trap composed of 39 places in 97 ms of which 1 ms to minimize.
[2023-03-13 09:18:30] [INFO ] Deduced a trap composed of 35 places in 131 ms of which 1 ms to minimize.
[2023-03-13 09:18:30] [INFO ] Deduced a trap composed of 28 places in 185 ms of which 0 ms to minimize.
[2023-03-13 09:18:31] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 927 ms
[2023-03-13 09:18:31] [INFO ] Deduced a trap composed of 7 places in 274 ms of which 1 ms to minimize.
[2023-03-13 09:18:31] [INFO ] Deduced a trap composed of 17 places in 311 ms of which 1 ms to minimize.
[2023-03-13 09:18:32] [INFO ] Deduced a trap composed of 10 places in 309 ms of which 26 ms to minimize.
[2023-03-13 09:18:32] [INFO ] Deduced a trap composed of 45 places in 126 ms of which 26 ms to minimize.
[2023-03-13 09:18:32] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1186 ms
[2023-03-13 09:18:32] [INFO ] Deduced a trap composed of 31 places in 193 ms of which 13 ms to minimize.
[2023-03-13 09:18:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 212 ms
[2023-03-13 09:18:32] [INFO ] After 2713ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :2
Attempting to minimize the solution found.
Minimization took 106 ms.
[2023-03-13 09:18:32] [INFO ] After 3073ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :2
FORMULA AutonomousCar-PT-03b-ReachabilityCardinality-14 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA AutonomousCar-PT-03b-ReachabilityCardinality-13 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA AutonomousCar-PT-03b-ReachabilityCardinality-07 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 5 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 10 ms.
Support contains 45 out of 190 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 190/190 places, 273/273 transitions.
Graph (trivial) has 101 edges and 190 vertex of which 2 / 190 are part of one of the 1 SCC in 3 ms
Free SCC test removed 1 places
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 438 edges and 189 vertex of which 188 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 43 transitions
Trivial Post-agglo rules discarded 43 transitions
Performed 43 trivial Post agglomeration. Transition count delta: 43
Iterating post reduction 0 with 43 rules applied. Total rules applied 45 place count 188 transition count 228
Reduce places removed 43 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 50 rules applied. Total rules applied 95 place count 145 transition count 221
Reduce places removed 4 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 2 with 11 rules applied. Total rules applied 106 place count 141 transition count 214
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 113 place count 134 transition count 214
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 8 Pre rules applied. Total rules applied 113 place count 134 transition count 206
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 129 place count 126 transition count 206
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 138 place count 117 transition count 197
Iterating global reduction 4 with 9 rules applied. Total rules applied 147 place count 117 transition count 197
Ensure Unique test removed 37 transitions
Reduce isomorphic transitions removed 37 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 4 with 38 rules applied. Total rules applied 185 place count 117 transition count 159
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 186 place count 116 transition count 159
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 6 with 26 rules applied. Total rules applied 212 place count 103 transition count 146
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 216 place count 101 transition count 154
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 6 with 4 rules applied. Total rules applied 220 place count 101 transition count 150
Free-agglomeration rule applied 5 times.
Iterating global reduction 6 with 5 rules applied. Total rules applied 225 place count 101 transition count 145
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 230 place count 96 transition count 145
Applied a total of 230 rules in 95 ms. Remains 96 /190 variables (removed 94) and now considering 145/273 (removed 128) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 95 ms. Remains : 96/190 places, 145/273 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 21 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 16 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 2456827 steps, run timeout after 3001 ms. (steps per millisecond=818 ) properties seen :{0=1}
Probabilistic random walk after 2456827 steps, saw 427209 distinct states, run finished after 3007 ms. (steps per millisecond=817 ) properties seen :1
FORMULA AutonomousCar-PT-03b-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 1 properties.
// Phase 1: matrix 145 rows 96 cols
[2023-03-13 09:18:35] [INFO ] Computed 7 place invariants in 4 ms
[2023-03-13 09:18:36] [INFO ] After 84ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-13 09:18:36] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2023-03-13 09:18:36] [INFO ] After 102ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-13 09:18:36] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-13 09:18:36] [INFO ] After 27ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-13 09:18:36] [INFO ] Deduced a trap composed of 16 places in 128 ms of which 1 ms to minimize.
[2023-03-13 09:18:36] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 0 ms to minimize.
[2023-03-13 09:18:36] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 0 ms to minimize.
[2023-03-13 09:18:36] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 232 ms
[2023-03-13 09:18:36] [INFO ] After 295ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 44 ms.
[2023-03-13 09:18:36] [INFO ] After 497ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 32 out of 96 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 96/96 places, 145/145 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 96 transition count 143
Reduce places removed 2 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 6 rules applied. Total rules applied 8 place count 94 transition count 139
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 12 place count 90 transition count 139
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 12 place count 90 transition count 137
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 16 place count 88 transition count 137
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 18 place count 86 transition count 133
Iterating global reduction 3 with 2 rules applied. Total rules applied 20 place count 86 transition count 133
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 21 place count 86 transition count 132
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 31 place count 81 transition count 127
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 33 place count 79 transition count 120
Iterating global reduction 4 with 2 rules applied. Total rules applied 35 place count 79 transition count 120
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 36 place count 79 transition count 119
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 37 place count 79 transition count 118
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 38 place count 78 transition count 118
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 40 place count 78 transition count 118
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 41 place count 78 transition count 117
Applied a total of 41 rules in 54 ms. Remains 78 /96 variables (removed 18) and now considering 117/145 (removed 28) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54 ms. Remains : 78/96 places, 117/145 transitions.
Incomplete random walk after 10000 steps, including 13 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Finished Best-First random walk after 7403 steps, including 46 resets, run visited all 1 properties in 9 ms. (steps per millisecond=822 )
FORMULA AutonomousCar-PT-03b-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
All properties solved without resorting to model-checking.
Total runtime 8874 ms.
timeout --kill-after=10s --signal=SIGINT 1m for testing only
Marcie built on Linux at 2019-11-18.
A model checker for Generalized Stochastic Petri nets
authors: Alex Tovchigrechko (IDD package and CTL model checking)
Martin Schwarick (Symbolic numerical analysis and CSL model checking)
Christian Rohr (Simulative and approximative numerical model checking)
marcie@informatik.tu-cottbus.de
called as: /home/mcc/BenchKit/bin//../reducer/bin//../../marcie/bin/marcie --net-file=model.pnml --mcc-file=ReachabilityCardinality.xml --memory=6 --mcc-mode
parse successfull
net created successfully
Net: AutonomousCar_PT_03b
(NrP: 190 NrTr: 273 NrArc: 1051)
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.005sec
net check time: 0m 0.000sec
init dd package: 0m 2.857sec
RS generation: 0m 1.609sec
-> reachability set: #nodes 16622 (1.7e+04) #states 144,452,774 (8)
starting MCC model checker
--------------------------
checking: EF [1<=p67]
normalized: E [true U 1<=p67]
abstracting: (1<=p67)
states: 5,075,536 (6)
-> the formula is TRUE
FORMULA AutonomousCar-PT-03b-ReachabilityCardinality-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 1.380sec
checking: AG [p147<=0]
normalized: ~ [E [true U ~ [p147<=0]]]
abstracting: (p147<=0)
states: 126,746,466 (8)
-> the formula is FALSE
FORMULA AutonomousCar-PT-03b-ReachabilityCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.751sec
checking: AG [~ [1<=p63]]
normalized: ~ [E [true U 1<=p63]]
abstracting: (1<=p63)
states: 3,905,658 (6)
-> the formula is FALSE
FORMULA AutonomousCar-PT-03b-ReachabilityCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.979sec
checking: AG [p53<=1]
normalized: ~ [E [true U ~ [p53<=1]]]
abstracting: (p53<=1)
states: 144,452,774 (8)
-> the formula is TRUE
FORMULA AutonomousCar-PT-03b-ReachabilityCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.004sec
checking: AG [p60<=p71]
normalized: ~ [E [true U ~ [p60<=p71]]]
abstracting: (p60<=p71)
states: 139,377,238 (8)
-> the formula is FALSE
FORMULA AutonomousCar-PT-03b-ReachabilityCardinality-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.948sec
checking: EF [[1<=p160 & p153<=1]]
normalized: E [true U [1<=p160 & p153<=1]]
abstracting: (p153<=1)
states: 144,452,774 (8)
abstracting: (1<=p160)
states: 5,527,092 (6)
-> the formula is TRUE
FORMULA AutonomousCar-PT-03b-ReachabilityCardinality-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 2.079sec
checking: AG [p181<=p16]
normalized: ~ [E [true U ~ [p181<=p16]]]
abstracting: (p181<=p16)
states: 140,307,455 (8)
-> the formula is FALSE
FORMULA AutonomousCar-PT-03b-ReachabilityCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 2.073sec
checking: AG [[p142<=p23 | p39<=1]]
normalized: ~ [E [true U ~ [[p142<=p23 | p39<=1]]]]
abstracting: (p39<=1)
states: 144,452,774 (8)
abstracting: (p142<=p23)
states: 134,657,768 (8)
-> the formula is TRUE
FORMULA AutonomousCar-PT-03b-ReachabilityCardinality-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.016sec
checking: AG [[[[p97<=p78 & p19<=1] | ~ [1<=p111]] | [~ [[1<=p93 | [[p123<=0 | ~ [p116<=1]] | ~ [p14<=0]]]] | p180<=0]]]
normalized: ~ [E [true U ~ [[[p180<=0 | ~ [[1<=p93 | [~ [p14<=0] | [p123<=0 | ~ [p116<=1]]]]]] | [~ [1<=p111] | [p97<=p78 & p19<=1]]]]]]
abstracting: (p19<=1)
states: 144,452,774 (8)
abstracting: (p97<=p78)
states: 139,547,824 (8)
abstracting: (1<=p111)
states: 4,760,746 (6)
abstracting: (p116<=1)
states: 144,452,774 (8)
abstracting: (p123<=0)
states: 138,417,942 (8)
abstracting: (p14<=0)
states: 111,033,314 (8)
abstracting: (1<=p93)
states: 3,905,658 (6)
abstracting: (p180<=0)
states: 140,307,455 (8)
-> the formula is TRUE
FORMULA AutonomousCar-PT-03b-ReachabilityCardinality-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.038sec
checking: AG [[p14<=0 | [~ [[~ [p18<=0] | ~ [[~ [[[p182<=p157 | p130<=0] | ~ [1<=p51]]] | [[p43<=1 & p126<=p106] | [~ [p165<=0] | p157<=1]]]]]] | [p157<=p189 | 1<=p26]]]]
normalized: ~ [E [true U ~ [[p14<=0 | [[p157<=p189 | 1<=p26] | ~ [[~ [[[[p157<=1 | ~ [p165<=0]] | [p43<=1 & p126<=p106]] | ~ [[~ [1<=p51] | [p182<=p157 | p130<=0]]]]] | ~ [p18<=0]]]]]]]]
abstracting: (p18<=0)
states: 144,452,174 (8)
abstracting: (p130<=0)
states: 142,798,062 (8)
abstracting: (p182<=p157)
states: 140,307,455 (8)
abstracting: (1<=p51)
states: 8,024,746 (6)
abstracting: (p126<=p106)
states: 142,798,062 (8)
abstracting: (p43<=1)
states: 144,452,774 (8)
abstracting: (p165<=0)
states: 135,953,447 (8)
abstracting: (p157<=1)
states: 144,452,774 (8)
abstracting: (1<=p26)
states: 600
abstracting: (p157<=p189)
states: 138,925,682 (8)
abstracting: (p14<=0)
states: 111,033,314 (8)
-> the formula is TRUE
FORMULA AutonomousCar-PT-03b-ReachabilityCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.098sec
checking: AG [~ [[[~ [[~ [[1<=p120 | ~ [p54<=1]]] & ~ [p172<=0]]] | p48<=p188] & [~ [p78<=0] & [[1<=p119 & [[[[p75<=0 | p141<=1] | ~ [1<=p165]] & [[1<=p114 & 1<=p1] & [1<=p110 | p67<=p137]]] | 1<=p54]] | 1<=p67]]]]]
normalized: ~ [E [true U [[[1<=p67 | [1<=p119 & [1<=p54 | [[[1<=p110 | p67<=p137] & [1<=p114 & 1<=p1]] & [~ [1<=p165] | [p75<=0 | p141<=1]]]]]] & ~ [p78<=0]] & [p48<=p188 | ~ [[~ [p172<=0] & ~ [[1<=p120 | ~ [p54<=1]]]]]]]]]
abstracting: (p54<=1)
states: 144,452,774 (8)
abstracting: (1<=p120)
states: 10,200 (4)
abstracting: (p172<=0)
states: 140,307,455 (8)
abstracting: (p48<=p188)
states: 141,081,986 (8)
abstracting: (p78<=0)
states: 140,547,116 (8)
abstracting: (p141<=1)
states: 144,452,774 (8)
abstracting: (p75<=0)
states: 140,547,116 (8)
abstracting: (1<=p165)
states: 8,499,327 (6)
abstracting: (1<=p1)
states: 328,711 (5)
abstracting: (1<=p114)
states: 5,075,536 (6)
abstracting: (p67<=p137)
states: 139,449,182 (8)
abstracting: (1<=p110)
states: 3,513,618 (6)
abstracting: (1<=p54)
states: 5,075,536 (6)
abstracting: (1<=p119)
states: 10,200 (4)
abstracting: (1<=p67)
states: 5,075,536 (6)
-> the formula is TRUE
FORMULA AutonomousCar-PT-03b-ReachabilityCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.088sec
checking: EF [~ [[[~ [[~ [1<=p22] | [[1<=p183 & p1<=1] | [p43<=0 | p140<=p133]]]] | [[~ [[p119<=1 | 1<=p143]] & ~ [p63<=0]] & ~ [[~ [[p36<=p71 & p186<=1]] | [[p135<=p74 | p63<=p99] & ~ [1<=p73]]]]]] | ~ [1<=p45]]]]
normalized: E [true U ~ [[~ [1<=p45] | [[~ [[[~ [1<=p73] & [p135<=p74 | p63<=p99]] | ~ [[p36<=p71 & p186<=1]]]] & [~ [p63<=0] & ~ [[p119<=1 | 1<=p143]]]] | ~ [[[[p43<=0 | p140<=p133] | [1<=p183 & p1<=1]] | ~ [1<=p22]]]]]]]
abstracting: (1<=p22)
states: 600
abstracting: (p1<=1)
states: 144,452,774 (8)
abstracting: (1<=p183)
states: 20,398,440 (7)
abstracting: (p140<=p133)
states: 134,657,768 (8)
abstracting: (p43<=0)
states: 139,377,238 (8)
abstracting: (1<=p143)
states: 9,795,006 (6)
abstracting: (p119<=1)
states: 144,452,774 (8)
abstracting: (p63<=0)
states: 140,547,116 (8)
abstracting: (p186<=1)
states: 144,452,774 (8)
abstracting: (p36<=p71)
states: 139,542,660 (8)
abstracting: (p63<=p99)
states: 140,717,702 (8)
abstracting: (p135<=p74)
states: 142,870,006 (8)
abstracting: (1<=p73)
states: 5,075,536 (6)
abstracting: (1<=p45)
states: 5,075,536 (6)
-> the formula is TRUE
FORMULA AutonomousCar-PT-03b-ReachabilityCardinality-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 1.197sec
checking: AG [~ [[~ [[[[1<=p172 | [p3<=p28 & p71<=p155]] & p95<=p119] | ~ [[~ [1<=p133] & [[p50<=0 & p127<=p15] & p162<=p59]]]]] & ~ [[p180<=p76 & [[[~ [p69<=p69] & ~ [p187<=1]] & ~ [1<=p183]] | 1<=p21]]]]]]
normalized: ~ [E [true U [~ [[p180<=p76 & [1<=p21 | [~ [1<=p183] & [~ [p187<=1] & ~ [p69<=p69]]]]]] & ~ [[~ [[[p162<=p59 & [p50<=0 & p127<=p15]] & ~ [1<=p133]]] | [p95<=p119 & [1<=p172 | [p3<=p28 & p71<=p155]]]]]]]]
abstracting: (p71<=p155)
states: 139,411,878 (8)
abstracting: (p3<=p28)
states: 111,709,664 (8)
abstracting: (1<=p172)
states: 4,145,319 (6)
abstracting: (p95<=p119)
states: 139,377,238 (8)
abstracting: (1<=p133)
states: 1,654,712 (6)
abstracting: (p127<=p15)
states: 142,798,062 (8)
abstracting: (p50<=0)
states: 136,428,028 (8)
abstracting: (p162<=p59)
states: 138,925,682 (8)
abstracting: (p69<=p69)
states: 144,452,774 (8)
abstracting: (p187<=1)
states: 144,452,774 (8)
abstracting: (1<=p183)
states: 20,398,440 (7)
abstracting: (1<=p21)
states: 600
abstracting: (p180<=p76)
states: 140,447,063 (8)
-> the formula is FALSE
FORMULA AutonomousCar-PT-03b-ReachabilityCardinality-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 3.083sec
checking: EF [[~ [[~ [p1<=1] | ~ [[[[p174<=0 & [[p176<=p152 | p179<=p64] & p167<=p20]] & ~ [[[p148<=1 | 1<=p2] & ~ [1<=p162]]]] & ~ [[[~ [1<=p187] & [1<=p161 | 1<=p82]] | [[p75<=p118 | p141<=0] | ~ [p33<=p145]]]]]]]] & p189<=1]]
normalized: E [true U [p189<=1 & ~ [[~ [[[~ [[~ [1<=p162] & [p148<=1 | 1<=p2]]] & [p174<=0 & [p167<=p20 & [p176<=p152 | p179<=p64]]]] & ~ [[[[p75<=p118 | p141<=0] | ~ [p33<=p145]] | [[1<=p161 | 1<=p82] & ~ [1<=p187]]]]]] | ~ [p1<=1]]]]]
abstracting: (p1<=1)
states: 144,452,774 (8)
abstracting: (1<=p187)
states: 5,384,575 (6)
abstracting: (1<=p82)
states: 8,024,746 (6)
abstracting: (1<=p161)
states: 5,527,092 (6)
abstracting: (p33<=p145)
states: 139,669,090 (8)
abstracting: (p141<=0)
states: 134,657,768 (8)
abstracting: (p75<=p118)
states: 140,717,702 (8)
abstracting: (p179<=p64)
states: 140,447,063 (8)
abstracting: (p176<=p152)
states: 140,307,455 (8)
abstracting: (p167<=p20)
states: 139,068,299 (8)
abstracting: (p174<=0)
states: 132,871,781 (8)
abstracting: (1<=p2)
states: 328,711 (5)
abstracting: (p148<=1)
states: 144,452,774 (8)
abstracting: (1<=p162)
states: 5,527,092 (6)
abstracting: (p189<=1)
states: 144,452,774 (8)
-> the formula is TRUE
FORMULA AutonomousCar-PT-03b-ReachabilityCardinality-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 1.276sec
checking: EF [[[~ [[~ [[[[[p111<=1 & 1<=p8] & [1<=p51 & p152<=p106]] & ~ [p175<=p96]] & [[[p189<=p176 & p178<=0] & ~ [1<=p120]] | 1<=p112]]] & ~ [[~ [p171<=1] | 1<=p113]]]] | [[[[[[[p95<=p137 & p171<=p148] & [p141<=p42 | p14<=p57]] | ~ [p46<=p59]] | [[1<=p115 | p136<=p38] & p125<=p16]] | [~ [1<=p170] | ~ [p6<=0]]] & ~ [[~ [1<=p120] | [~ [1<=p53] & [p120<=1 & p175<=0]]]]] & 1<=p69]] & ~ [p157<=0]]]
normalized: E [true U [~ [p157<=0] & [[1<=p69 & [~ [[[[p120<=1 & p175<=0] & ~ [1<=p53]] | ~ [1<=p120]]] & [[~ [p6<=0] | ~ [1<=p170]] | [[p125<=p16 & [1<=p115 | p136<=p38]] | [~ [p46<=p59] | [[p141<=p42 | p14<=p57] & [p95<=p137 & p171<=p148]]]]]]] | ~ [[~ [[1<=p113 | ~ [p171<=1]]] & ~ [[[1<=p112 | [~ [1<=p120] & [p189<=p176 & p178<=0]]] & [~ [p175<=p96] & [[1<=p51 & p152<=p106] & [p111<=1 & 1<=p8]]]]]]]]]]
abstracting: (1<=p8)
states: 328,711 (5)
abstracting: (p111<=1)
states: 144,452,774 (8)
abstracting: (p152<=p106)
states: 143,417,493 (8)
abstracting: (1<=p51)
states: 8,024,746 (6)
abstracting: (p175<=p96)
states: 133,307,597 (8)
abstracting: (p178<=0)
states: 140,307,455 (8)
abstracting: (p189<=p176)
states: 139,068,199 (8)
abstracting: (1<=p120)
states: 10,200 (4)
abstracting: (1<=p112)
states: 8,024,746 (6)
abstracting: (p171<=1)
states: 144,452,774 (8)
abstracting: (1<=p113)
states: 8,024,746 (6)
abstracting: (p171<=p148)
states: 140,926,217 (8)
abstracting: (p95<=p137)
states: 139,449,182 (8)
abstracting: (p14<=p57)
states: 111,033,314 (8)
abstracting: (p141<=p42)
states: 134,949,620 (8)
abstracting: (p46<=p59)
states: 139,377,238 (8)
abstracting: (p136<=p38)
states: 142,870,006 (8)
abstracting: (1<=p115)
states: 5,075,536 (6)
abstracting: (p125<=p16)
states: 142,798,062 (8)
abstracting: (1<=p170)
states: 4,145,319 (6)
abstracting: (p6<=0)
states: 89,091,009 (7)
abstracting: (1<=p120)
states: 10,200 (4)
abstracting: (1<=p53)
states: 5,075,536 (6)
abstracting: (p175<=0)
states: 132,871,781 (8)
abstracting: (p120<=1)
states: 144,452,774 (8)
abstracting: (1<=p69)
states: 5,075,536 (6)
abstracting: (p157<=0)
states: 138,925,682 (8)
-> the formula is TRUE
FORMULA AutonomousCar-PT-03b-ReachabilityCardinality-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 1.529sec
checking: EF [[[p174<=p166 & ~ [[1<=p90 & ~ [[~ [[p6<=1 | p168<=0]] & ~ [p160<=p185]]]]]] & [[1<=p117 & ~ [[[p178<=0 & [~ [1<=p36] & p154<=1]] & [[1<=p55 | ~ [p59<=p7]] | [~ [[p138<=1 & p133<=p171]] & ~ [[1<=p21 & p57<=1]]]]]]] & [[[[~ [[p165<=p123 | [1<=p86 | p153<=p105]]] & [[[p148<=p114 & 1<=p129] | [p187<=p99 | p91<=p184]] | [p71<=1 | p125<=1]]] & ~ [p80<=p162]] | [[1<=p43 | [~ [[1<=p26 & 1<=p163]] & [[1<=p130 & 1<=p21] | [p102<=0 & 1<=p128]]]] | [p84<=1 & [[p68<=p60 & ~ [1<=p76]] | [1<=p28 & [1<=p189 & 1<=p100]]]]]] | p92<=p113]]]]
normalized: E [true U [[[p92<=p113 | [[[p84<=1 & [[p68<=p60 & ~ [1<=p76]] | [1<=p28 & [1<=p189 & 1<=p100]]]] | [1<=p43 | [[[p102<=0 & 1<=p128] | [1<=p130 & 1<=p21]] & ~ [[1<=p26 & 1<=p163]]]]] | [~ [p80<=p162] & [[[p71<=1 | p125<=1] | [[p187<=p99 | p91<=p184] | [p148<=p114 & 1<=p129]]] & ~ [[p165<=p123 | [1<=p86 | p153<=p105]]]]]]] & [1<=p117 & ~ [[[[~ [[1<=p21 & p57<=1]] & ~ [[p138<=1 & p133<=p171]]] | [1<=p55 | ~ [p59<=p7]]] & [p178<=0 & [p154<=1 & ~ [1<=p36]]]]]]] & [p174<=p166 & ~ [[1<=p90 & ~ [[~ [p160<=p185] & ~ [[p6<=1 | p168<=0]]]]]]]]]
abstracting: (p168<=0)
states: 140,307,455 (8)
abstracting: (p6<=1)
states: 144,452,774 (8)
abstracting: (p160<=p185)
states: 138,925,682 (8)
abstracting: (1<=p90)
states: 10,200 (4)
abstracting: (p174<=p166)
states: 132,871,781 (8)
abstracting: (1<=p36)
states: 5,075,536 (6)
abstracting: (p154<=1)
states: 144,452,774 (8)
abstracting: (p178<=0)
states: 140,307,455 (8)
abstracting: (p59<=p7)
states: 144,445,094 (8)
abstracting: (1<=p55)
states: 5,075,536 (6)
abstracting: (p133<=p171)
states: 142,798,062 (8)
abstracting: (p138<=1)
states: 144,452,774 (8)
abstracting: (p57<=1)
states: 144,452,774 (8)
abstracting: (1<=p21)
states: 600
abstracting: (1<=p117)
states: 5,075,536 (6)
abstracting: (p153<=p105)
states: 143,410,499 (8)
abstracting: (1<=p86)
states: 5,075,536 (6)
abstracting: (p165<=p123)
states: 135,953,447 (8)
abstracting: (1<=p129)
states: 1,654,712 (6)
abstracting: (p148<=p114)
states: 129,165,622 (8)
abstracting: (p91<=p184)
states: 139,948,478 (8)
abstracting: (p187<=p99)
states: 139,241,399 (8)
abstracting: (p125<=1)
states: 144,452,774 (8)
abstracting: (p71<=1)
states: 144,452,774 (8)
abstracting: (p80<=p162)
states: 139,878,172 (8)
abstracting: (1<=p163)
states: 30,958,901 (7)
abstracting: (1<=p26)
states: 600
abstracting: (1<=p21)
states: 600
abstracting: (1<=p130)
states: 1,654,712 (6)
abstracting: (1<=p128)
states: 1,654,712 (6)
abstracting: (p102<=0)
states: 139,377,238 (8)
abstracting: (1<=p43)
states: 5,075,536 (6)
abstracting: (1<=p100)
states: 5,075,536 (6)
abstracting: (1<=p189)
states: 5,384,575 (6)
abstracting: (1<=p28)
states: 9,600 (3)
abstracting: (1<=p76)
states: 5,075,536 (6)
abstracting: (p68<=p60)
states: 139,377,238 (8)
abstracting: (p84<=1)
states: 144,452,774 (8)
abstracting: (p92<=p113)
states: 139,377,238 (8)
-> the formula is TRUE
FORMULA AutonomousCar-PT-03b-ReachabilityCardinality-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 1.134sec
totally nodes used: 6093703 (6.1e+06)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 21275700 53385397 74661097
used/not used/entry size/cache size: 38799287 28309577 16 1024MB
basic ops cache: hits/miss/sum: 3167638 7427421 10595059
used/not used/entry size/cache size: 8976475 7800741 12 192MB
unary ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 8 128MB
abstract ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 12 192MB
state nr cache: hits/miss/sum: 151373 423511 574884
used/not used/entry size/cache size: 413623 7974985 32 256MB
max state cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 8388608 32 256MB
uniqueHash elements/entry size/size: 67108864 4 256MB
0 61831160
1 4584891
2 585026
3 93954
4 12407
5 1295
6 122
7 9
8 0
9 0
>= 10 0
Total processing time: 0m24.115sec
BK_STOP 1678699141057
--------------------
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
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok
initing FirstDep: 0m 0.000sec
iterations count:92724 (339), effective:5840 (21)
initing FirstDep: 0m 0.000sec
iterations count:12439 (45), effective:450 (1)
iterations count:4148 (15), effective:324 (1)
iterations count:16231 (59), effective:770 (2)
iterations count:12472 (45), effective:466 (1)
iterations count:20847 (76), effective:1045 (3)
iterations count:20852 (76), effective:1045 (3)
iterations count:11748 (43), effective:450 (1)
iterations count:27268 (99), effective:1234 (4)
iterations count:16985 (62), effective:765 (2)
iterations count:15709 (57), effective:720 (2)
iterations count:11855 (43), effective:501 (1)
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="AutonomousCar-PT-03b"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="marciexred"
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 marciexred"
echo " Input is AutonomousCar-PT-03b, 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 r010-oct2-167813599200574"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/AutonomousCar-PT-03b.tgz
mv AutonomousCar-PT-03b 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 ;