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

About the Execution of LoLa+red for CANConstruction-PT-050

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
1221.500 170294.00 207433.00 95.80 TFTFFTTTFTTTTFTT normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r039-tajo-167813692800655.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool lolaxred
Input is CANConstruction-PT-050, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r039-tajo-167813692800655
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.2M
-rw-r--r-- 1 mcc users 7.6K Feb 25 21:51 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K Feb 25 21:51 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Feb 25 21:27 CTLFireability.txt
-rw-r--r-- 1 mcc users 33K Feb 25 21:27 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.1K Feb 25 15:40 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K Feb 25 15:40 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Feb 25 15:40 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 15:40 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 25 21:59 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 93K Feb 25 21:59 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 25 21:55 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 70K Feb 25 21:55 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Feb 25 15:40 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Feb 25 15:40 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 3.8M 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 CANConstruction-PT-050-ReachabilityFireability-00
FORMULA_NAME CANConstruction-PT-050-ReachabilityFireability-01
FORMULA_NAME CANConstruction-PT-050-ReachabilityFireability-02
FORMULA_NAME CANConstruction-PT-050-ReachabilityFireability-03
FORMULA_NAME CANConstruction-PT-050-ReachabilityFireability-04
FORMULA_NAME CANConstruction-PT-050-ReachabilityFireability-05
FORMULA_NAME CANConstruction-PT-050-ReachabilityFireability-06
FORMULA_NAME CANConstruction-PT-050-ReachabilityFireability-07
FORMULA_NAME CANConstruction-PT-050-ReachabilityFireability-08
FORMULA_NAME CANConstruction-PT-050-ReachabilityFireability-09
FORMULA_NAME CANConstruction-PT-050-ReachabilityFireability-10
FORMULA_NAME CANConstruction-PT-050-ReachabilityFireability-11
FORMULA_NAME CANConstruction-PT-050-ReachabilityFireability-12
FORMULA_NAME CANConstruction-PT-050-ReachabilityFireability-13
FORMULA_NAME CANConstruction-PT-050-ReachabilityFireability-14
FORMULA_NAME CANConstruction-PT-050-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1678504385405

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=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CANConstruction-PT-050
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-11 03:13:07] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-11 03:13:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 03:13:07] [INFO ] Load time of PNML (sax parser for PT used): 270 ms
[2023-03-11 03:13:07] [INFO ] Transformed 5602 places.
[2023-03-11 03:13:07] [INFO ] Transformed 10400 transitions.
[2023-03-11 03:13:07] [INFO ] Parsed PT model containing 5602 places and 10400 transitions and 31000 arcs in 377 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 12 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 11 resets, run finished after 492 ms. (steps per millisecond=20 ) properties (out of 16) seen :9
FORMULA CANConstruction-PT-050-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-050-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-050-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-050-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-050-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-050-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-050-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-050-ReachabilityFireability-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-050-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 10400 rows 5602 cols
[2023-03-11 03:13:08] [INFO ] Computed 101 place invariants in 137 ms
[2023-03-11 03:13:10] [INFO ] [Real]Absence check using 51 positive place invariants in 188 ms returned sat
[2023-03-11 03:13:10] [INFO ] [Real]Absence check using 51 positive and 50 generalized place invariants in 123 ms returned sat
[2023-03-11 03:13:14] [INFO ] After 6028ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-11 03:13:16] [INFO ] [Nat]Absence check using 51 positive place invariants in 159 ms returned sat
[2023-03-11 03:13:16] [INFO ] [Nat]Absence check using 51 positive and 50 generalized place invariants in 90 ms returned sat
[2023-03-11 03:13:23] [INFO ] After 6582ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :6
[2023-03-11 03:13:23] [INFO ] State equation strengthened by 4950 read => feed constraints.
[2023-03-11 03:13:28] [INFO ] After 4464ms SMT Verify possible using 4950 Read/Feed constraints in natural domain returned unsat :1 sat :6
[2023-03-11 03:13:33] [INFO ] After 9581ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :6
Attempting to minimize the solution found.
Minimization took 3566 ms.
[2023-03-11 03:13:36] [INFO ] After 22209ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :6
FORMULA CANConstruction-PT-050-ReachabilityFireability-01 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 7 Parikh solutions to 6 different solutions.
Parikh walk visited 0 properties in 154 ms.
Support contains 127 out of 5602 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5602/5602 places, 10400/10400 transitions.
Drop transitions removed 295 transitions
Trivial Post-agglo rules discarded 295 transitions
Performed 295 trivial Post agglomeration. Transition count delta: 295
Iterating post reduction 0 with 295 rules applied. Total rules applied 295 place count 5602 transition count 10105
Reduce places removed 295 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 297 rules applied. Total rules applied 592 place count 5307 transition count 10103
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 594 place count 5305 transition count 10103
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 22 Pre rules applied. Total rules applied 594 place count 5305 transition count 10081
Deduced a syphon composed of 22 places in 3 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 3 with 44 rules applied. Total rules applied 638 place count 5283 transition count 10081
Discarding 2351 places :
Symmetric choice reduction at 3 with 2351 rule applications. Total rules 2989 place count 2932 transition count 5379
Iterating global reduction 3 with 2351 rules applied. Total rules applied 5340 place count 2932 transition count 5379
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 3 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 3 with 54 rules applied. Total rules applied 5394 place count 2905 transition count 5352
Free-agglomeration rule applied 37 times.
Iterating global reduction 3 with 37 rules applied. Total rules applied 5431 place count 2905 transition count 5315
Reduce places removed 37 places and 0 transitions.
Iterating post reduction 3 with 37 rules applied. Total rules applied 5468 place count 2868 transition count 5315
Free-agglomeration rule (complex) applied 30 times.
Iterating global reduction 4 with 30 rules applied. Total rules applied 5498 place count 2868 transition count 5285
Reduce places removed 30 places and 0 transitions.
Iterating post reduction 4 with 30 rules applied. Total rules applied 5528 place count 2838 transition count 5285
Partial Free-agglomeration rule applied 83 times.
Drop transitions removed 83 transitions
Iterating global reduction 5 with 83 rules applied. Total rules applied 5611 place count 2838 transition count 5285
Partial Free-agglomeration rule applied 15 times.
Drop transitions removed 15 transitions
Iterating global reduction 5 with 15 rules applied. Total rules applied 5626 place count 2838 transition count 5285
Applied a total of 5626 rules in 2895 ms. Remains 2838 /5602 variables (removed 2764) and now considering 5285/10400 (removed 5115) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2898 ms. Remains : 2838/5602 places, 5285/10400 transitions.
Incomplete random walk after 10000 steps, including 26 resets, run finished after 263 ms. (steps per millisecond=38 ) properties (out of 6) seen :2
FORMULA CANConstruction-PT-050-ReachabilityFireability-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-050-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 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 5285 rows 2838 cols
[2023-03-11 03:13:40] [INFO ] Computed 101 place invariants in 33 ms
[2023-03-11 03:13:41] [INFO ] [Real]Absence check using 51 positive place invariants in 64 ms returned sat
[2023-03-11 03:13:41] [INFO ] [Real]Absence check using 51 positive and 50 generalized place invariants in 29 ms returned sat
[2023-03-11 03:13:41] [INFO ] After 760ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-11 03:13:41] [INFO ] [Nat]Absence check using 51 positive place invariants in 52 ms returned sat
[2023-03-11 03:13:41] [INFO ] [Nat]Absence check using 51 positive and 50 generalized place invariants in 30 ms returned sat
[2023-03-11 03:13:44] [INFO ] After 2408ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-11 03:13:44] [INFO ] State equation strengthened by 5026 read => feed constraints.
[2023-03-11 03:13:46] [INFO ] After 2162ms SMT Verify possible using 5026 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-11 03:13:48] [INFO ] After 3808ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 1222 ms.
[2023-03-11 03:13:49] [INFO ] After 8201ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 59 ms.
Support contains 79 out of 2838 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2838/2838 places, 5285/5285 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 2837 transition count 5283
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 2837 transition count 5283
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 2 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 0 with 50 rules applied. Total rules applied 52 place count 2812 transition count 5258
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 54 place count 2811 transition count 5258
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 55 place count 2811 transition count 5257
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 56 place count 2810 transition count 5257
Applied a total of 56 rules in 1624 ms. Remains 2810 /2838 variables (removed 28) and now considering 5257/5285 (removed 28) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1625 ms. Remains : 2810/2838 places, 5257/5285 transitions.
Incomplete random walk after 10000 steps, including 27 resets, run finished after 254 ms. (steps per millisecond=39 ) properties (out of 4) seen :1
FORMULA CANConstruction-PT-050-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 5257 rows 2810 cols
[2023-03-11 03:13:51] [INFO ] Computed 101 place invariants in 57 ms
[2023-03-11 03:13:51] [INFO ] [Real]Absence check using 51 positive place invariants in 38 ms returned sat
[2023-03-11 03:13:51] [INFO ] [Real]Absence check using 51 positive and 50 generalized place invariants in 22 ms returned sat
[2023-03-11 03:13:51] [INFO ] After 509ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-11 03:13:52] [INFO ] [Nat]Absence check using 51 positive place invariants in 87 ms returned sat
[2023-03-11 03:13:52] [INFO ] [Nat]Absence check using 51 positive and 50 generalized place invariants in 36 ms returned sat
[2023-03-11 03:13:54] [INFO ] After 2152ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-11 03:13:54] [INFO ] State equation strengthened by 5047 read => feed constraints.
[2023-03-11 03:13:56] [INFO ] After 1742ms SMT Verify possible using 5047 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-11 03:13:58] [INFO ] After 3318ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 1187 ms.
[2023-03-11 03:13:59] [INFO ] After 7350ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 16 ms.
Support contains 78 out of 2810 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2810/2810 places, 5257/5257 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 2809 transition count 5256
Applied a total of 2 rules in 560 ms. Remains 2809 /2810 variables (removed 1) and now considering 5256/5257 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 561 ms. Remains : 2809/2810 places, 5256/5257 transitions.
Incomplete random walk after 10000 steps, including 27 resets, run finished after 381 ms. (steps per millisecond=26 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 93063 steps, run timeout after 3001 ms. (steps per millisecond=31 ) properties seen :{}
Probabilistic random walk after 93063 steps, saw 42098 distinct states, run finished after 3003 ms. (steps per millisecond=30 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 5256 rows 2809 cols
[2023-03-11 03:14:03] [INFO ] Computed 101 place invariants in 43 ms
[2023-03-11 03:14:03] [INFO ] [Real]Absence check using 51 positive place invariants in 40 ms returned sat
[2023-03-11 03:14:03] [INFO ] [Real]Absence check using 51 positive and 50 generalized place invariants in 21 ms returned sat
[2023-03-11 03:14:03] [INFO ] After 475ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-11 03:14:04] [INFO ] [Nat]Absence check using 51 positive place invariants in 41 ms returned sat
[2023-03-11 03:14:04] [INFO ] [Nat]Absence check using 51 positive and 50 generalized place invariants in 28 ms returned sat
[2023-03-11 03:14:06] [INFO ] After 2002ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-11 03:14:06] [INFO ] State equation strengthened by 5048 read => feed constraints.
[2023-03-11 03:14:08] [INFO ] After 1839ms SMT Verify possible using 5048 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-11 03:14:09] [INFO ] After 3070ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 832 ms.
[2023-03-11 03:14:10] [INFO ] After 6464ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 21 ms.
Support contains 78 out of 2809 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2809/2809 places, 5256/5256 transitions.
Applied a total of 0 rules in 236 ms. Remains 2809 /2809 variables (removed 0) and now considering 5256/5256 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 236 ms. Remains : 2809/2809 places, 5256/5256 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2809/2809 places, 5256/5256 transitions.
Applied a total of 0 rules in 231 ms. Remains 2809 /2809 variables (removed 0) and now considering 5256/5256 (removed 0) transitions.
[2023-03-11 03:14:10] [INFO ] Invariant cache hit.
[2023-03-11 03:14:12] [INFO ] Implicit Places using invariants in 1748 ms returned [6, 11, 17, 21, 25, 29, 35, 42, 48, 54, 58, 64, 72, 78, 82, 88, 92, 98, 103, 109, 116, 122, 128, 134, 141, 147, 151, 158, 164, 170, 174, 180, 184, 190, 196, 203, 209, 216, 220, 225, 230, 236, 243, 250, 254, 258, 263, 269, 275, 280]
Discarding 50 places :
Implicit Place search using SMT only with invariants took 1754 ms to find 50 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 2759/2809 places, 5256/5256 transitions.
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 2759 transition count 5245
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 22 place count 2748 transition count 5245
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 32 place count 2738 transition count 5235
Iterating global reduction 2 with 10 rules applied. Total rules applied 42 place count 2738 transition count 5235
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 1 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 92 place count 2713 transition count 5210
Applied a total of 92 rules in 742 ms. Remains 2713 /2759 variables (removed 46) and now considering 5210/5256 (removed 46) transitions.
// Phase 1: matrix 5210 rows 2713 cols
[2023-03-11 03:14:13] [INFO ] Computed 51 place invariants in 119 ms
[2023-03-11 03:14:15] [INFO ] Implicit Places using invariants in 1651 ms returned []
[2023-03-11 03:14:15] [INFO ] Invariant cache hit.
[2023-03-11 03:14:16] [INFO ] State equation strengthened by 4971 read => feed constraints.
[2023-03-11 03:14:47] [INFO ] Performed 1252/2713 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2023-03-11 03:15:17] [INFO ] Performed 2578/2713 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2023-03-11 03:15:19] [INFO ] Implicit Places using invariants and state equation in 64898 ms returned []
Implicit Place search using SMT with State Equation took 66551 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 2713/2809 places, 5210/5256 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 69278 ms. Remains : 2713/2809 places, 5210/5256 transitions.
Incomplete random walk after 10000 steps, including 27 resets, run finished after 185 ms. (steps per millisecond=54 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 113237 steps, run timeout after 3007 ms. (steps per millisecond=37 ) properties seen :{}
Probabilistic random walk after 113237 steps, saw 53315 distinct states, run finished after 3007 ms. (steps per millisecond=37 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-11 03:15:23] [INFO ] Invariant cache hit.
[2023-03-11 03:15:23] [INFO ] [Real]Absence check using 51 positive place invariants in 49 ms returned sat
[2023-03-11 03:15:23] [INFO ] After 576ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-11 03:15:24] [INFO ] [Nat]Absence check using 51 positive place invariants in 55 ms returned sat
[2023-03-11 03:15:26] [INFO ] After 2088ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-11 03:15:26] [INFO ] State equation strengthened by 4971 read => feed constraints.
[2023-03-11 03:15:27] [INFO ] After 1369ms SMT Verify possible using 4971 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-11 03:15:29] [INFO ] After 2413ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 1052 ms.
[2023-03-11 03:15:30] [INFO ] After 6247ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 37 ms.
Support contains 78 out of 2713 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2713/2713 places, 5210/5210 transitions.
Applied a total of 0 rules in 387 ms. Remains 2713 /2713 variables (removed 0) and now considering 5210/5210 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 388 ms. Remains : 2713/2713 places, 5210/5210 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2713/2713 places, 5210/5210 transitions.
Applied a total of 0 rules in 388 ms. Remains 2713 /2713 variables (removed 0) and now considering 5210/5210 (removed 0) transitions.
[2023-03-11 03:15:30] [INFO ] Invariant cache hit.
[2023-03-11 03:15:32] [INFO ] Implicit Places using invariants in 1507 ms returned []
[2023-03-11 03:15:32] [INFO ] Invariant cache hit.
[2023-03-11 03:15:33] [INFO ] State equation strengthened by 4971 read => feed constraints.
[2023-03-11 03:15:43] [INFO ] Implicit Places using invariants and state equation in 11320 ms returned []
Implicit Place search using SMT with State Equation took 12832 ms to find 0 implicit places.
[2023-03-11 03:15:44] [INFO ] Redundant transitions in 585 ms returned []
[2023-03-11 03:15:44] [INFO ] Invariant cache hit.
[2023-03-11 03:15:46] [INFO ] Dead Transitions using invariants and state equation in 2376 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16193 ms. Remains : 2713/2713 places, 5210/5210 transitions.
Graph (trivial) has 4206 edges and 2713 vertex of which 1710 / 2713 are part of one of the 34 SCC in 8 ms
Free SCC test removed 1676 places
Drop transitions removed 3318 transitions
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 3325 transitions.
Graph (complete) has 2070 edges and 1037 vertex of which 983 are kept as prefixes of interest. Removing 54 places using SCC suffix rule.2 ms
Discarding 54 places :
Also discarding 24 output transitions
Drop transitions removed 24 transitions
Drop transitions removed 52 transitions
Reduce isomorphic transitions removed 52 transitions.
Drop transitions removed 46 transitions
Trivial Post-agglo rules discarded 46 transitions
Performed 46 trivial Post agglomeration. Transition count delta: 46
Iterating post reduction 0 with 98 rules applied. Total rules applied 100 place count 983 transition count 1763
Reduce places removed 46 places and 0 transitions.
Ensure Unique test removed 45 transitions
Reduce isomorphic transitions removed 45 transitions.
Performed 719 Post agglomeration using F-continuation condition.Transition count delta: 719
Iterating post reduction 1 with 810 rules applied. Total rules applied 910 place count 937 transition count 999
Reduce places removed 719 places and 0 transitions.
Ensure Unique test removed 699 transitions
Reduce isomorphic transitions removed 699 transitions.
Iterating post reduction 2 with 1418 rules applied. Total rules applied 2328 place count 218 transition count 300
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 2328 place count 218 transition count 295
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 2338 place count 213 transition count 295
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 2348 place count 203 transition count 285
Iterating global reduction 3 with 10 rules applied. Total rules applied 2358 place count 203 transition count 285
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 2363 place count 203 transition count 280
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 2371 place count 199 transition count 276
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2373 place count 198 transition count 277
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 4 with 8 rules applied. Total rules applied 2381 place count 198 transition count 269
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 4 with 3 rules applied. Total rules applied 2384 place count 198 transition count 266
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 2387 place count 195 transition count 266
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 2389 place count 194 transition count 266
Free-agglomeration rule applied 17 times.
Iterating global reduction 6 with 17 rules applied. Total rules applied 2406 place count 194 transition count 249
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 6 with 17 rules applied. Total rules applied 2423 place count 177 transition count 249
Partial Free-agglomeration rule applied 16 times.
Drop transitions removed 16 transitions
Iterating global reduction 7 with 16 rules applied. Total rules applied 2439 place count 177 transition count 249
Discarding 8 places :
Symmetric choice reduction at 7 with 8 rule applications. Total rules 2447 place count 169 transition count 241
Iterating global reduction 7 with 8 rules applied. Total rules applied 2455 place count 169 transition count 241
Reduce places removed 4 places and 4 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 2459 place count 165 transition count 237
Applied a total of 2459 rules in 114 ms. Remains 165 /2713 variables (removed 2548) and now considering 237/5210 (removed 4973) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 237 rows 165 cols
[2023-03-11 03:15:46] [INFO ] Computed 27 place invariants in 2 ms
[2023-03-11 03:15:46] [INFO ] [Real]Absence check using 27 positive place invariants in 3 ms returned sat
[2023-03-11 03:15:46] [INFO ] After 40ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-11 03:15:46] [INFO ] [Nat]Absence check using 27 positive place invariants in 2 ms returned sat
[2023-03-11 03:15:46] [INFO ] After 81ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-11 03:15:47] [INFO ] After 133ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 40 ms.
[2023-03-11 03:15:47] [INFO ] After 216ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
[2023-03-11 03:15:47] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 3 ms.
[2023-03-11 03:15:47] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 2713 places, 5210 transitions and 20553 arcs took 25 ms.
[2023-03-11 03:15:47] [INFO ] Flatten gal took : 284 ms
Total runtime 160525 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT CANConstruction-PT-050
BK_EXAMINATION: ReachabilityFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/369
ReachabilityFireability

FORMULA CANConstruction-PT-050-ReachabilityFireability-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CANConstruction-PT-050-ReachabilityFireability-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CANConstruction-PT-050-ReachabilityFireability-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1678504555699

--------------------
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 ReachabilityFireability -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/369/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/369/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/369/ReachabilityFireability.xml
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
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: LAUNCH task # 14 (type EXCL) for 0 CANConstruction-PT-050-ReachabilityFireability-08
lola: time limit : 1197 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 10 (type FNDP) for 0 CANConstruction-PT-050-ReachabilityFireability-08
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 11 (type EQUN) for 0 CANConstruction-PT-050-ReachabilityFireability-08
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: LAUNCH task # 13 (type SRCH) for 0 CANConstruction-PT-050-ReachabilityFireability-08
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
sara: try reading problem file /home/mcc/execution/369/ReachabilityFireability-11.sara.
lola: FINISHED task # 10 (type FNDP) for CANConstruction-PT-050-ReachabilityFireability-08
lola: result : true
lola: fired transitions : 3557
lola: tried executions : 15
lola: time used : 0.000000
lola: memory pages used : 0
lola: CANCELED task # 11 (type EQUN) for CANConstruction-PT-050-ReachabilityFireability-08 (obsolete)
lola: CANCELED task # 13 (type SRCH) for CANConstruction-PT-050-ReachabilityFireability-08 (obsolete)
lola: CANCELED task # 14 (type EXCL) for CANConstruction-PT-050-ReachabilityFireability-08 (obsolete)
lola: FINISHED task # 11 (type EQUN) for CANConstruction-PT-050-ReachabilityFireability-08
lola: result : unknown
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 # 20 (type EXCL) for 3 CANConstruction-PT-050-ReachabilityFireability-10
lola: time limit : 1796 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 16 (type FNDP) for 3 CANConstruction-PT-050-ReachabilityFireability-10
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 17 (type EQUN) for 3 CANConstruction-PT-050-ReachabilityFireability-10
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 19 (type SRCH) for 3 CANConstruction-PT-050-ReachabilityFireability-10
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: FINISHED task # 16 (type FNDP) for CANConstruction-PT-050-ReachabilityFireability-10
lola: result : true
lola: fired transitions : 11
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
lola: CANCELED task # 17 (type EQUN) for CANConstruction-PT-050-ReachabilityFireability-10 (obsolete)
lola: CANCELED task # 19 (type SRCH) for CANConstruction-PT-050-ReachabilityFireability-10 (obsolete)
lola: CANCELED task # 20 (type EXCL) for CANConstruction-PT-050-ReachabilityFireability-10 (obsolete)
lola: LAUNCH task # 27 (type EXCL) for 6 CANConstruction-PT-050-ReachabilityFireability-13
lola: time limit : 3592 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 23 (type FNDP) for 6 CANConstruction-PT-050-ReachabilityFireability-13
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 24 (type EQUN) for 6 CANConstruction-PT-050-ReachabilityFireability-13
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: LAUNCH task # 26 (type SRCH) for 6 CANConstruction-PT-050-ReachabilityFireability-13
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: FINISHED task # 23 (type FNDP) for CANConstruction-PT-050-ReachabilityFireability-13
lola: result : true
lola: fired transitions : 415
lola: tried executions : 3
lola: time used : 0.000000
lola: memory pages used : 0
lola: CANCELED task # 24 (type EQUN) for CANConstruction-PT-050-ReachabilityFireability-13 (obsolete)
lola: CANCELED task # 26 (type SRCH) for CANConstruction-PT-050-ReachabilityFireability-13 (obsolete)
lola: CANCELED task # 27 (type EXCL) for CANConstruction-PT-050-ReachabilityFireability-13 (obsolete)
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CANConstruction-PT-050-ReachabilityFireability-08: AG false findpath
CANConstruction-PT-050-ReachabilityFireability-10: EF true findpath
CANConstruction-PT-050-ReachabilityFireability-13: AG false findpath


Time elapsed: 8 secs. Pages in use: 4

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="CANConstruction-PT-050"
export BK_EXAMINATION="ReachabilityFireability"
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 CANConstruction-PT-050, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r039-tajo-167813692800655"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/CANConstruction-PT-050.tgz
mv CANConstruction-PT-050 execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;