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.r103-tall-167814478300454.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 lolaxred
Input is DES-PT-30b, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r103-tall-167814478300454
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 552K
-rw-r--r-- 1 mcc users 7.1K Feb 26 15:41 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K Feb 26 15:41 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K Feb 26 15:40 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K Feb 26 15:40 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:50 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 15:50 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 15:50 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 15:50 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 26 15:42 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 121K Feb 26 15:42 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.0K Feb 26 15:41 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 69K Feb 26 15:41 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Feb 25 15:50 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Feb 25 15:50 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 103K 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 DES-PT-30b-ReachabilityCardinality-00
FORMULA_NAME DES-PT-30b-ReachabilityCardinality-01
FORMULA_NAME DES-PT-30b-ReachabilityCardinality-02
FORMULA_NAME DES-PT-30b-ReachabilityCardinality-03
FORMULA_NAME DES-PT-30b-ReachabilityCardinality-04
FORMULA_NAME DES-PT-30b-ReachabilityCardinality-05
FORMULA_NAME DES-PT-30b-ReachabilityCardinality-06
FORMULA_NAME DES-PT-30b-ReachabilityCardinality-07
FORMULA_NAME DES-PT-30b-ReachabilityCardinality-08
FORMULA_NAME DES-PT-30b-ReachabilityCardinality-09
FORMULA_NAME DES-PT-30b-ReachabilityCardinality-10
FORMULA_NAME DES-PT-30b-ReachabilityCardinality-11
FORMULA_NAME DES-PT-30b-ReachabilityCardinality-12
FORMULA_NAME DES-PT-30b-ReachabilityCardinality-13
FORMULA_NAME DES-PT-30b-ReachabilityCardinality-14
FORMULA_NAME DES-PT-30b-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678252702881

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=lolaxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DES-PT-30b
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-08 05:18:24] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-08 05:18:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-08 05:18:24] [INFO ] Load time of PNML (sax parser for PT used): 61 ms
[2023-03-08 05:18:24] [INFO ] Transformed 399 places.
[2023-03-08 05:18:24] [INFO ] Transformed 350 transitions.
[2023-03-08 05:18:24] [INFO ] Found NUPN structural information;
[2023-03-08 05:18:24] [INFO ] Parsed PT model containing 399 places and 350 transitions and 1143 arcs in 124 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 13 ms.
Working with output stream class java.io.PrintStream
FORMULA DES-PT-30b-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-30b-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 86 resets, run finished after 382 ms. (steps per millisecond=26 ) properties (out of 14) seen :7
FORMULA DES-PT-30b-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-30b-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-30b-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-30b-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-30b-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-30b-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-30b-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 13 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 10 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 7) seen :1
FORMULA DES-PT-30b-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Running SMT prover for 6 properties.
// Phase 1: matrix 350 rows 399 cols
[2023-03-08 05:18:25] [INFO ] Computed 65 place invariants in 24 ms
[2023-03-08 05:18:25] [INFO ] After 269ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-08 05:18:25] [INFO ] [Nat]Absence check using 39 positive place invariants in 13 ms returned sat
[2023-03-08 05:18:25] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 21 ms returned sat
[2023-03-08 05:18:27] [INFO ] After 1222ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-08 05:18:28] [INFO ] Deduced a trap composed of 8 places in 104 ms of which 4 ms to minimize.
[2023-03-08 05:18:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 170 ms
[2023-03-08 05:18:28] [INFO ] Deduced a trap composed of 17 places in 80 ms of which 1 ms to minimize.
[2023-03-08 05:18:28] [INFO ] Deduced a trap composed of 37 places in 82 ms of which 1 ms to minimize.
[2023-03-08 05:18:28] [INFO ] Deduced a trap composed of 36 places in 79 ms of which 2 ms to minimize.
[2023-03-08 05:18:28] [INFO ] Deduced a trap composed of 38 places in 75 ms of which 1 ms to minimize.
[2023-03-08 05:18:28] [INFO ] Deduced a trap composed of 37 places in 65 ms of which 0 ms to minimize.
[2023-03-08 05:18:28] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 612 ms
[2023-03-08 05:18:29] [INFO ] Deduced a trap composed of 37 places in 84 ms of which 1 ms to minimize.
[2023-03-08 05:18:29] [INFO ] Deduced a trap composed of 16 places in 72 ms of which 1 ms to minimize.
[2023-03-08 05:18:29] [INFO ] Deduced a trap composed of 13 places in 70 ms of which 1 ms to minimize.
[2023-03-08 05:18:29] [INFO ] Deduced a trap composed of 31 places in 76 ms of which 1 ms to minimize.
[2023-03-08 05:18:29] [INFO ] Deduced a trap composed of 19 places in 65 ms of which 0 ms to minimize.
[2023-03-08 05:18:29] [INFO ] Deduced a trap composed of 30 places in 58 ms of which 0 ms to minimize.
[2023-03-08 05:18:29] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 549 ms
[2023-03-08 05:18:29] [INFO ] Deduced a trap composed of 25 places in 88 ms of which 0 ms to minimize.
[2023-03-08 05:18:30] [INFO ] Deduced a trap composed of 12 places in 65 ms of which 0 ms to minimize.
[2023-03-08 05:18:30] [INFO ] Deduced a trap composed of 10 places in 54 ms of which 0 ms to minimize.
[2023-03-08 05:18:30] [INFO ] Deduced a trap composed of 36 places in 53 ms of which 0 ms to minimize.
[2023-03-08 05:18:30] [INFO ] Deduced a trap composed of 18 places in 50 ms of which 0 ms to minimize.
[2023-03-08 05:18:30] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 691 ms
[2023-03-08 05:18:30] [INFO ] Deduced a trap composed of 40 places in 100 ms of which 0 ms to minimize.
[2023-03-08 05:18:30] [INFO ] Deduced a trap composed of 19 places in 84 ms of which 0 ms to minimize.
[2023-03-08 05:18:30] [INFO ] Deduced a trap composed of 37 places in 76 ms of which 1 ms to minimize.
[2023-03-08 05:18:31] [INFO ] Deduced a trap composed of 33 places in 78 ms of which 1 ms to minimize.
[2023-03-08 05:18:31] [INFO ] Deduced a trap composed of 31 places in 66 ms of which 1 ms to minimize.
[2023-03-08 05:18:31] [INFO ] Deduced a trap composed of 43 places in 80 ms of which 1 ms to minimize.
[2023-03-08 05:18:31] [INFO ] Deduced a trap composed of 17 places in 63 ms of which 0 ms to minimize.
[2023-03-08 05:18:31] [INFO ] Deduced a trap composed of 14 places in 66 ms of which 0 ms to minimize.
[2023-03-08 05:18:31] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 871 ms
[2023-03-08 05:18:31] [INFO ] After 4915ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 678 ms.
[2023-03-08 05:18:32] [INFO ] After 6749ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 497 ms.
Support contains 59 out of 399 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 399/399 places, 350/350 transitions.
Graph (complete) has 858 edges and 399 vertex of which 389 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.1 ms
Discarding 10 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 11 rules applied. Total rules applied 12 place count 389 transition count 335
Reduce places removed 10 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 13 rules applied. Total rules applied 25 place count 379 transition count 332
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 28 place count 376 transition count 332
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 28 place count 376 transition count 326
Deduced a syphon composed of 6 places in 5 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 40 place count 370 transition count 326
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 56 place count 354 transition count 310
Iterating global reduction 3 with 16 rules applied. Total rules applied 72 place count 354 transition count 310
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 82 place count 344 transition count 300
Iterating global reduction 3 with 10 rules applied. Total rules applied 92 place count 344 transition count 300
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 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 3 with 9 rules applied. Total rules applied 101 place count 344 transition count 291
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 102 place count 343 transition count 291
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 50
Deduced a syphon composed of 50 places in 1 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 5 with 100 rules applied. Total rules applied 202 place count 293 transition count 241
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 210 place count 289 transition count 243
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 211 place count 289 transition count 242
Free-agglomeration rule applied 4 times.
Iterating global reduction 5 with 4 rules applied. Total rules applied 215 place count 289 transition count 238
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 219 place count 285 transition count 238
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 6 with 2 rules applied. Total rules applied 221 place count 285 transition count 236
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 223 place count 283 transition count 236
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 7 with 3 rules applied. Total rules applied 226 place count 283 transition count 236
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 227 place count 282 transition count 235
Applied a total of 227 rules in 161 ms. Remains 282 /399 variables (removed 117) and now considering 235/350 (removed 115) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 162 ms. Remains : 282/399 places, 235/350 transitions.
Incomplete random walk after 10000 steps, including 154 resets, run finished after 163 ms. (steps per millisecond=61 ) properties (out of 6) seen :1
FORMULA DES-PT-30b-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 5) seen :1
FORMULA DES-PT-30b-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 235 rows 282 cols
[2023-03-08 05:18:33] [INFO ] Computed 60 place invariants in 5 ms
[2023-03-08 05:18:33] [INFO ] After 70ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-08 05:18:33] [INFO ] [Nat]Absence check using 34 positive place invariants in 6 ms returned sat
[2023-03-08 05:18:33] [INFO ] [Nat]Absence check using 34 positive and 26 generalized place invariants in 12 ms returned sat
[2023-03-08 05:18:33] [INFO ] After 376ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-08 05:18:33] [INFO ] Deduced a trap composed of 5 places in 62 ms of which 0 ms to minimize.
[2023-03-08 05:18:33] [INFO ] Deduced a trap composed of 6 places in 37 ms of which 1 ms to minimize.
[2023-03-08 05:18:33] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 145 ms
[2023-03-08 05:18:33] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 0 ms to minimize.
[2023-03-08 05:18:34] [INFO ] Deduced a trap composed of 7 places in 51 ms of which 1 ms to minimize.
[2023-03-08 05:18:34] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 0 ms to minimize.
[2023-03-08 05:18:34] [INFO ] Deduced a trap composed of 6 places in 44 ms of which 1 ms to minimize.
[2023-03-08 05:18:34] [INFO ] Deduced a trap composed of 7 places in 39 ms of which 0 ms to minimize.
[2023-03-08 05:18:34] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 286 ms
[2023-03-08 05:18:34] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 1 ms to minimize.
[2023-03-08 05:18:34] [INFO ] Deduced a trap composed of 7 places in 52 ms of which 2 ms to minimize.
[2023-03-08 05:18:34] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 185 ms
[2023-03-08 05:18:34] [INFO ] After 1405ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 172 ms.
[2023-03-08 05:18:34] [INFO ] After 1686ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 185 ms.
Support contains 16 out of 282 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 282/282 places, 235/235 transitions.
Graph (complete) has 782 edges and 282 vertex of which 281 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 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 3 rules applied. Total rules applied 4 place count 281 transition count 231
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 6 place count 279 transition count 231
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 6 place count 279 transition count 229
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 10 place count 277 transition count 229
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 12 place count 275 transition count 227
Iterating global reduction 2 with 2 rules applied. Total rules applied 14 place count 275 transition count 227
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 15 place count 274 transition count 226
Iterating global reduction 2 with 1 rules applied. Total rules applied 16 place count 274 transition count 226
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 2 with 2 rules applied. Total rules applied 18 place count 274 transition count 224
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 19 place count 273 transition count 224
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 4 with 33 rules applied. Total rules applied 52 place count 256 transition count 208
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 53 place count 255 transition count 205
Iterating global reduction 4 with 1 rules applied. Total rules applied 54 place count 255 transition count 205
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 56 place count 255 transition count 203
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 58 place count 254 transition count 203
Free-agglomeration rule applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 59 place count 254 transition count 202
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 62 place count 253 transition count 200
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 6 with 3 rules applied. Total rules applied 65 place count 250 transition count 197
Applied a total of 65 rules in 75 ms. Remains 250 /282 variables (removed 32) and now considering 197/235 (removed 38) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 76 ms. Remains : 250/282 places, 197/235 transitions.
Incomplete random walk after 10000 steps, including 278 resets, run finished after 115 ms. (steps per millisecond=86 ) properties (out of 4) seen :1
FORMULA DES-PT-30b-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 54 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 45 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 48 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 197 rows 250 cols
[2023-03-08 05:18:35] [INFO ] Computed 60 place invariants in 16 ms
[2023-03-08 05:18:35] [INFO ] After 55ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-08 05:18:35] [INFO ] [Nat]Absence check using 35 positive place invariants in 8 ms returned sat
[2023-03-08 05:18:35] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 11 ms returned sat
[2023-03-08 05:18:35] [INFO ] After 203ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-08 05:18:35] [INFO ] Deduced a trap composed of 5 places in 52 ms of which 1 ms to minimize.
[2023-03-08 05:18:35] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 0 ms to minimize.
[2023-03-08 05:18:35] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 118 ms
[2023-03-08 05:18:36] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 0 ms to minimize.
[2023-03-08 05:18:36] [INFO ] Deduced a trap composed of 7 places in 38 ms of which 1 ms to minimize.
[2023-03-08 05:18:36] [INFO ] Deduced a trap composed of 6 places in 37 ms of which 0 ms to minimize.
[2023-03-08 05:18:36] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 210 ms
[2023-03-08 05:18:36] [INFO ] After 609ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 79 ms.
[2023-03-08 05:18:36] [INFO ] After 862ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 95 ms.
Support contains 15 out of 250 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 250/250 places, 197/197 transitions.
Applied a total of 0 rules in 9 ms. Remains 250 /250 variables (removed 0) and now considering 197/197 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 250/250 places, 197/197 transitions.
Incomplete random walk after 10000 steps, including 274 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 55 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 53 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 58 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 958137 steps, run timeout after 3001 ms. (steps per millisecond=319 ) properties seen :{}
Probabilistic random walk after 958137 steps, saw 170501 distinct states, run finished after 3002 ms. (steps per millisecond=319 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-08 05:18:39] [INFO ] Invariant cache hit.
[2023-03-08 05:18:39] [INFO ] After 50ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-08 05:18:39] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-08 05:18:39] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 11 ms returned sat
[2023-03-08 05:18:40] [INFO ] After 206ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-08 05:18:40] [INFO ] Deduced a trap composed of 5 places in 55 ms of which 0 ms to minimize.
[2023-03-08 05:18:40] [INFO ] Deduced a trap composed of 6 places in 44 ms of which 0 ms to minimize.
[2023-03-08 05:18:40] [INFO ] Deduced a trap composed of 5 places in 41 ms of which 0 ms to minimize.
[2023-03-08 05:18:40] [INFO ] Deduced a trap composed of 10 places in 38 ms of which 0 ms to minimize.
[2023-03-08 05:18:40] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 1 ms to minimize.
[2023-03-08 05:18:40] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 0 ms to minimize.
[2023-03-08 05:18:40] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 317 ms
[2023-03-08 05:18:40] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 1 ms to minimize.
[2023-03-08 05:18:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 50 ms
[2023-03-08 05:18:40] [INFO ] After 654ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 79 ms.
[2023-03-08 05:18:40] [INFO ] After 865ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 37 ms.
Support contains 15 out of 250 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 250/250 places, 197/197 transitions.
Applied a total of 0 rules in 7 ms. Remains 250 /250 variables (removed 0) and now considering 197/197 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 250/250 places, 197/197 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 250/250 places, 197/197 transitions.
Applied a total of 0 rules in 6 ms. Remains 250 /250 variables (removed 0) and now considering 197/197 (removed 0) transitions.
[2023-03-08 05:18:40] [INFO ] Invariant cache hit.
[2023-03-08 05:18:40] [INFO ] Implicit Places using invariants in 121 ms returned []
[2023-03-08 05:18:40] [INFO ] Invariant cache hit.
[2023-03-08 05:18:40] [INFO ] Implicit Places using invariants and state equation in 262 ms returned []
Implicit Place search using SMT with State Equation took 385 ms to find 0 implicit places.
[2023-03-08 05:18:40] [INFO ] Redundant transitions in 6 ms returned []
[2023-03-08 05:18:41] [INFO ] Invariant cache hit.
[2023-03-08 05:18:41] [INFO ] Dead Transitions using invariants and state equation in 106 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 512 ms. Remains : 250/250 places, 197/197 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 250 transition count 197
Applied a total of 1 rules in 15 ms. Remains 250 /250 variables (removed 0) and now considering 197/197 (removed 0) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 197 rows 250 cols
[2023-03-08 05:18:41] [INFO ] Computed 60 place invariants in 2 ms
[2023-03-08 05:18:41] [INFO ] After 41ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-08 05:18:41] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-08 05:18:41] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 11 ms returned sat
[2023-03-08 05:18:41] [INFO ] After 213ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-08 05:18:41] [INFO ] Deduced a trap composed of 6 places in 47 ms of which 1 ms to minimize.
[2023-03-08 05:18:41] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 0 ms to minimize.
[2023-03-08 05:18:41] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
[2023-03-08 05:18:41] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 158 ms
[2023-03-08 05:18:41] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 1 ms to minimize.
[2023-03-08 05:18:41] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 0 ms to minimize.
[2023-03-08 05:18:41] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 2 ms to minimize.
[2023-03-08 05:18:41] [INFO ] Deduced a trap composed of 25 places in 55 ms of which 0 ms to minimize.
[2023-03-08 05:18:41] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 223 ms
[2023-03-08 05:18:42] [INFO ] Deduced a trap composed of 6 places in 44 ms of which 0 ms to minimize.
[2023-03-08 05:18:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 94 ms
[2023-03-08 05:18:42] [INFO ] After 742ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 115 ms.
[2023-03-08 05:18:42] [INFO ] After 1049ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
[2023-03-08 05:18:42] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 3 ms.
[2023-03-08 05:18:42] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 250 places, 197 transitions and 922 arcs took 2 ms.
[2023-03-08 05:18:42] [INFO ] Flatten gal took : 60 ms
Total runtime 18177 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT DES-PT-30b
BK_EXAMINATION: ReachabilityCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/373
ReachabilityCardinality

FORMULA DES-PT-30b-ReachabilityCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DES-PT-30b-ReachabilityCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DES-PT-30b-ReachabilityCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1678252724134

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/373/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/373/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/373/ReachabilityCardinality.xml
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: LAUNCH task # 13 (type EXCL) for 3 DES-PT-30b-ReachabilityCardinality-13
lola: time limit : 1200 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 9 (type FNDP) for 3 DES-PT-30b-ReachabilityCardinality-13
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 10 (type EQUN) for 3 DES-PT-30b-ReachabilityCardinality-13
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 12 (type SRCH) for 3 DES-PT-30b-ReachabilityCardinality-13
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
sara: try reading problem file /home/mcc/execution/373/ReachabilityCardinality-10.sara.
sara: place or transition ordering is non-deterministic
lola: FINISHED task # 13 (type EXCL) for DES-PT-30b-ReachabilityCardinality-13
lola: result : true
lola: markings : 14974
lola: fired transitions : 15864
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 9 (type FNDP) for DES-PT-30b-ReachabilityCardinality-13 (obsolete)
lola: CANCELED task # 10 (type EQUN) for DES-PT-30b-ReachabilityCardinality-13 (obsolete)
lola: CANCELED task # 12 (type SRCH) for DES-PT-30b-ReachabilityCardinality-13 (obsolete)
lola: LAUNCH task # 20 (type EXCL) for 0 DES-PT-30b-ReachabilityCardinality-11
lola: time limit : 1800 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 22 (type FNDP) for 6 DES-PT-30b-ReachabilityCardinality-15
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 23 (type EQUN) for 6 DES-PT-30b-ReachabilityCardinality-15
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: LAUNCH task # 25 (type SRCH) for 6 DES-PT-30b-ReachabilityCardinality-15
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: FINISHED task # 9 (type FNDP) for DES-PT-30b-ReachabilityCardinality-13
lola: result : unknown
lola: fired transitions : 61135
lola: tried executions : 3714
lola: time used : 0.000000
lola: memory pages used : 0
lola: FINISHED task # 10 (type EQUN) for DES-PT-30b-ReachabilityCardinality-13
lola: result : unknown
sara: try reading problem file /home/mcc/execution/373/ReachabilityCardinality-23.sara.
sara: place or transition ordering is non-deterministic
lola: FINISHED task # 20 (type EXCL) for DES-PT-30b-ReachabilityCardinality-11
lola: result : true
lola: markings : 18957
lola: fired transitions : 21227
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 26 (type EXCL) for 6 DES-PT-30b-ReachabilityCardinality-15
lola: time limit : 3600 sec
lola: memory limit: 32 pages
lola: FINISHED task # 25 (type SRCH) for DES-PT-30b-ReachabilityCardinality-15
lola: result : false
lola: markings : 160890
lola: fired transitions : 277702
lola: time used : 1.000000
lola: memory pages used : 1
lola: CANCELED task # 22 (type FNDP) for DES-PT-30b-ReachabilityCardinality-15 (obsolete)
lola: CANCELED task # 23 (type EQUN) for DES-PT-30b-ReachabilityCardinality-15 (obsolete)
lola: CANCELED task # 26 (type EXCL) for DES-PT-30b-ReachabilityCardinality-15 (obsolete)
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DES-PT-30b-ReachabilityCardinality-11: AG false tandem / relaxed
DES-PT-30b-ReachabilityCardinality-13: EF true tandem / relaxed
DES-PT-30b-ReachabilityCardinality-15: EF false tandem / insertion


Time elapsed: 1 secs. Pages in use: 2

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="DES-PT-30b"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="lolaxred"
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 lolaxred"
echo " Input is DES-PT-30b, 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 r103-tall-167814478300454"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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