About the Execution of LTSMin+red for BugTracking-PT-q8m064
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16040.023 | 172983.00 | 255599.00 | 325.00 | ?????T?FFTF???F? | 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/mcc2024-input.r472-tajo-171620399500426.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.......................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is BugTracking-PT-q8m064, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r472-tajo-171620399500426
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 16M
-rw-r--r-- 1 mcc users 8.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 19 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 8.5K May 19 15:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 22 14:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 22 14:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 89K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.1K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 65K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 19 07:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 19 15:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 7 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 16M May 18 16:42 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 BugTracking-PT-q8m064-CTLFireability-2024-00
FORMULA_NAME BugTracking-PT-q8m064-CTLFireability-2024-01
FORMULA_NAME BugTracking-PT-q8m064-CTLFireability-2024-02
FORMULA_NAME BugTracking-PT-q8m064-CTLFireability-2024-03
FORMULA_NAME BugTracking-PT-q8m064-CTLFireability-2024-04
FORMULA_NAME BugTracking-PT-q8m064-CTLFireability-2024-05
FORMULA_NAME BugTracking-PT-q8m064-CTLFireability-2024-06
FORMULA_NAME BugTracking-PT-q8m064-CTLFireability-2024-07
FORMULA_NAME BugTracking-PT-q8m064-CTLFireability-2024-08
FORMULA_NAME BugTracking-PT-q8m064-CTLFireability-2024-09
FORMULA_NAME BugTracking-PT-q8m064-CTLFireability-2024-10
FORMULA_NAME BugTracking-PT-q8m064-CTLFireability-2024-11
FORMULA_NAME BugTracking-PT-q8m064-CTLFireability-2023-12
FORMULA_NAME BugTracking-PT-q8m064-CTLFireability-2023-13
FORMULA_NAME BugTracking-PT-q8m064-CTLFireability-2023-14
FORMULA_NAME BugTracking-PT-q8m064-CTLFireability-2023-15
=== Now, execution of the tool begins
BK_START 1717224462610
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BugTracking-PT-q8m064
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 06:47:43] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 06:47:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 06:47:45] [INFO ] Load time of PNML (sax parser for PT used): 1166 ms
[2024-06-01 06:47:45] [INFO ] Transformed 754 places.
[2024-06-01 06:47:45] [INFO ] Transformed 27370 transitions.
[2024-06-01 06:47:45] [INFO ] Parsed PT model containing 754 places and 27370 transitions and 136172 arcs in 1554 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 90 ms.
Deduced a syphon composed of 474 places in 193 ms
Reduce places removed 474 places and 23466 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA BugTracking-PT-q8m064-CTLFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m064-CTLFireability-2023-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 19 out of 280 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 280/280 places, 3904/3904 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 278 transition count 3904
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 277 transition count 3871
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 277 transition count 3871
Applied a total of 4 rules in 334 ms. Remains 277 /280 variables (removed 3) and now considering 3871/3904 (removed 33) transitions.
[2024-06-01 06:47:46] [INFO ] Flow matrix only has 3707 transitions (discarded 164 similar events)
// Phase 1: matrix 3707 rows 277 cols
[2024-06-01 06:47:46] [INFO ] Computed 8 invariants in 64 ms
[2024-06-01 06:47:47] [INFO ] Implicit Places using invariants in 1005 ms returned []
[2024-06-01 06:47:47] [INFO ] Flow matrix only has 3707 transitions (discarded 164 similar events)
[2024-06-01 06:47:47] [INFO ] Invariant cache hit.
[2024-06-01 06:47:48] [INFO ] State equation strengthened by 282 read => feed constraints.
[2024-06-01 06:47:50] [INFO ] Implicit Places using invariants and state equation in 2977 ms returned []
Implicit Place search using SMT with State Equation took 4305 ms to find 0 implicit places.
Running 3869 sub problems to find dead transitions.
[2024-06-01 06:47:51] [INFO ] Flow matrix only has 3707 transitions (discarded 164 similar events)
[2024-06-01 06:47:51] [INFO ] Invariant cache hit.
[2024-06-01 06:47:51] [INFO ] State equation strengthened by 282 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/276 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 3869 unsolved
[2024-06-01 06:48:56] [INFO ] Deduced a trap composed of 10 places in 177 ms of which 12 ms to minimize.
[2024-06-01 06:48:56] [INFO ] Deduced a trap composed of 7 places in 192 ms of which 2 ms to minimize.
[2024-06-01 06:48:56] [INFO ] Deduced a trap composed of 23 places in 155 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 276/3984 variables, and 11 constraints, problems are : Problem set: 0 solved, 3869 unsolved in 30150 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 0/277 constraints, ReadFeed: 0/282 constraints, PredecessorRefiner: 3869/2672 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3869 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/276 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 3869 unsolved
Problem TDEAD808 is UNSAT
Problem TDEAD809 is UNSAT
Problem TDEAD810 is UNSAT
Problem TDEAD811 is UNSAT
Problem TDEAD812 is UNSAT
Problem TDEAD813 is UNSAT
Problem TDEAD817 is UNSAT
Problem TDEAD818 is UNSAT
Problem TDEAD819 is UNSAT
Problem TDEAD2706 is UNSAT
Problem TDEAD2715 is UNSAT
Problem TDEAD2727 is UNSAT
Problem TDEAD2731 is UNSAT
Problem TDEAD2740 is UNSAT
Problem TDEAD2752 is UNSAT
Problem TDEAD2756 is UNSAT
Problem TDEAD2765 is UNSAT
Problem TDEAD2777 is UNSAT
Problem TDEAD2781 is UNSAT
Problem TDEAD2782 is UNSAT
Problem TDEAD2783 is UNSAT
Problem TDEAD2784 is UNSAT
Problem TDEAD2785 is UNSAT
Problem TDEAD2786 is UNSAT
Problem TDEAD2787 is UNSAT
Problem TDEAD2788 is UNSAT
Problem TDEAD2789 is UNSAT
Problem TDEAD2790 is UNSAT
Problem TDEAD2794 is UNSAT
Problem TDEAD2795 is UNSAT
Problem TDEAD2796 is UNSAT
Problem TDEAD2797 is UNSAT
Problem TDEAD2798 is UNSAT
Problem TDEAD2799 is UNSAT
Problem TDEAD2800 is UNSAT
Problem TDEAD2801 is UNSAT
Problem TDEAD2802 is UNSAT
Problem TDEAD2803 is UNSAT
Problem TDEAD2804 is UNSAT
Problem TDEAD2805 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/276 variables, 3/11 constraints. Problems are: Problem set: 40 solved, 3829 unsolved
[2024-06-01 06:49:23] [INFO ] Deduced a trap composed of 11 places in 71 ms of which 2 ms to minimize.
Problem TDEAD784 is UNSAT
Problem TDEAD790 is UNSAT
Problem TDEAD796 is UNSAT
Problem TDEAD802 is UNSAT
Problem TDEAD814 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 276/3984 variables, and 12 constraints, problems are : Problem set: 45 solved, 3824 unsolved in 30078 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 0/277 constraints, ReadFeed: 0/282 constraints, PredecessorRefiner: 1197/2672 constraints, Known Traps: 4/4 constraints]
After SMT, in 105084ms problems are : Problem set: 45 solved, 3824 unsolved
Search for dead transitions found 45 dead transitions in 105209ms
Found 45 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 45 transitions
Dead transitions reduction (with SMT) removed 45 transitions
Starting structural reductions in LTL mode, iteration 1 : 277/280 places, 3826/3904 transitions.
Reduce places removed 11 places and 334 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 266 transition count 3492
Reduce places removed 5 places and 152 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 16 place count 261 transition count 3340
Reduce places removed 2 places and 56 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 18 place count 259 transition count 3284
Reduce places removed 1 places and 32 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 19 place count 258 transition count 3252
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 20 place count 257 transition count 3227
Iterating global reduction 4 with 1 rules applied. Total rules applied 21 place count 257 transition count 3227
Applied a total of 21 rules in 51 ms. Remains 257 /277 variables (removed 20) and now considering 3227/3826 (removed 599) transitions.
[2024-06-01 06:49:36] [INFO ] Flow matrix only has 3100 transitions (discarded 127 similar events)
// Phase 1: matrix 3100 rows 257 cols
[2024-06-01 06:49:36] [INFO ] Computed 8 invariants in 13 ms
[2024-06-01 06:49:36] [INFO ] Implicit Places using invariants in 551 ms returned []
[2024-06-01 06:49:36] [INFO ] Flow matrix only has 3100 transitions (discarded 127 similar events)
[2024-06-01 06:49:36] [INFO ] Invariant cache hit.
[2024-06-01 06:49:37] [INFO ] State equation strengthened by 251 read => feed constraints.
[2024-06-01 06:49:38] [INFO ] Implicit Places using invariants and state equation in 1853 ms returned []
Implicit Place search using SMT with State Equation took 2417 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 257/280 places, 3227/3904 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 112424 ms. Remains : 257/280 places, 3227/3904 transitions.
Support contains 19 out of 257 places after structural reductions.
[2024-06-01 06:49:39] [INFO ] Initial state reduction rules for CTL removed 4 formulas.
[2024-06-01 06:49:39] [INFO ] Flatten gal took : 398 ms
FORMULA BugTracking-PT-q8m064-CTLFireability-2024-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m064-CTLFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m064-CTLFireability-2024-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m064-CTLFireability-2024-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 06:49:39] [INFO ] Flatten gal took : 232 ms
[2024-06-01 06:49:40] [INFO ] Input system was already deterministic with 3227 transitions.
Support contains 14 out of 257 places (down from 19) after GAL structural reductions.
RANDOM walk for 40060 steps (37 resets) in 2902 ms. (13 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 201 ms. (198 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 143 ms. (277 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (8 resets) in 225 ms. (177 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 165 ms. (240 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 118 ms. (336 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 130 ms. (305 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 122835 steps, run timeout after 3001 ms. (steps per millisecond=40 ) properties seen :0 out of 6
Probabilistic random walk after 122835 steps, saw 61528 distinct states, run finished after 3007 ms. (steps per millisecond=40 ) properties seen :0
[2024-06-01 06:49:44] [INFO ] Flow matrix only has 3100 transitions (discarded 127 similar events)
[2024-06-01 06:49:44] [INFO ] Invariant cache hit.
[2024-06-01 06:49:44] [INFO ] State equation strengthened by 251 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 92/106 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 06:49:45] [INFO ] Deduced a trap composed of 18 places in 343 ms of which 1 ms to minimize.
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp4 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 1/6 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/106 variables, 0/6 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 2317/2423 variables, 106/112 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2423 variables, 134/246 constraints. Problems are: Problem set: 2 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/2423 variables, 0/246 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 697/3120 variables, 95/341 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3120 variables, 79/420 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3120 variables, 0/420 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 197/3317 variables, 29/449 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3317 variables, 1/450 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3317 variables, 29/479 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3317 variables, 0/479 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 2/3319 variables, 1/480 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3319 variables, 0/480 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 38/3357 variables, 27/507 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3357 variables, 1/508 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/3357 variables, 9/517 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/3357 variables, 0/517 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 20 (OVERLAPS) 0/3357 variables, 0/517 constraints. Problems are: Problem set: 2 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3357/3357 variables, and 517 constraints, problems are : Problem set: 2 solved, 4 unsolved in 2707 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 257/257 constraints, ReadFeed: 251/251 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 2 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 56/65 variables, 3/3 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 0/3 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 1348/1413 variables, 65/68 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1413 variables, 60/128 constraints. Problems are: Problem set: 2 solved, 4 unsolved
[2024-06-01 06:49:47] [INFO ] Deduced a trap composed of 23 places in 157 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/1413 variables, 1/129 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1413 variables, 0/129 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 672/2085 variables, 64/193 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2085 variables, 80/273 constraints. Problems are: Problem set: 2 solved, 4 unsolved
Problem AtomicPropp2 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/2085 variables, 4/277 constraints. Problems are: Problem set: 3 solved, 3 unsolved
[2024-06-01 06:49:48] [INFO ] Deduced a trap composed of 16 places in 342 ms of which 1 ms to minimize.
Problem AtomicPropp3 is UNSAT
[2024-06-01 06:49:49] [INFO ] Deduced a trap composed of 23 places in 309 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/2085 variables, 2/279 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2085 variables, 0/279 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 592/2677 variables, 48/327 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2677 variables, 1/328 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2677 variables, 69/397 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2677 variables, 1/398 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2677 variables, 0/398 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 7/2684 variables, 2/400 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2684 variables, 0/400 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 619/3303 variables, 51/451 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/3303 variables, 1/452 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/3303 variables, 36/488 constraints. Problems are: Problem set: 4 solved, 2 unsolved
[2024-06-01 06:49:50] [INFO ] Deduced a trap composed of 41 places in 256 ms of which 1 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/3303 variables, 1/489 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/3303 variables, 0/489 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 53/3356 variables, 28/517 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/3356 variables, 1/518 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/3356 variables, 6/524 constraints. Problems are: Problem set: 4 solved, 2 unsolved
[2024-06-01 06:49:51] [INFO ] Deduced a trap composed of 41 places in 281 ms of which 3 ms to minimize.
At refinement iteration 27 (INCLUDED_ONLY) 0/3356 variables, 1/525 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/3356 variables, 0/525 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 29 (OVERLAPS) 1/3357 variables, 1/526 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/3357 variables, 0/526 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 31 (OVERLAPS) 0/3357 variables, 0/526 constraints. Problems are: Problem set: 4 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3357/3357 variables, and 526 constraints, problems are : Problem set: 4 solved, 2 unsolved in 4882 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 257/257 constraints, ReadFeed: 251/251 constraints, PredecessorRefiner: 4/6 constraints, Known Traps: 6/6 constraints]
After SMT, in 7690ms problems are : Problem set: 4 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 569 ms.
Support contains 5 out of 257 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 257/257 places, 3227/3227 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 256 transition count 3229
Free-agglomeration rule applied 7 times.
Iterating global reduction 0 with 7 rules applied. Total rules applied 9 place count 256 transition count 3222
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 16 place count 249 transition count 3222
Applied a total of 16 rules in 261 ms. Remains 249 /257 variables (removed 8) and now considering 3222/3227 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 262 ms. Remains : 249/257 places, 3222/3227 transitions.
RANDOM walk for 40129 steps (8 resets) in 117 ms. (340 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 148 ms. (268 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 171 ms. (232 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 121932 steps, run timeout after 3001 ms. (steps per millisecond=40 ) properties seen :0 out of 2
Probabilistic random walk after 121932 steps, saw 45822 distinct states, run finished after 3002 ms. (steps per millisecond=40 ) properties seen :0
[2024-06-01 06:49:56] [INFO ] Flow matrix only has 3092 transitions (discarded 130 similar events)
// Phase 1: matrix 3092 rows 249 cols
[2024-06-01 06:49:56] [INFO ] Computed 8 invariants in 37 ms
[2024-06-01 06:49:56] [INFO ] State equation strengthened by 252 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 56/61 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1326/1387 variables, 61/64 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1387 variables, 42/106 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1387 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 692/2079 variables, 65/171 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2079 variables, 98/269 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2079 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 601/2680 variables, 48/317 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2680 variables, 1/318 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2680 variables, 77/395 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2680 variables, 0/395 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 4/2684 variables, 2/397 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2684 variables, 2/399 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2684 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 607/3291 variables, 46/445 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3291 variables, 1/446 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/3291 variables, 29/475 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/3291 variables, 0/475 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 50/3341 variables, 27/502 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/3341 variables, 1/503 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/3341 variables, 6/509 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/3341 variables, 0/509 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 0/3341 variables, 0/509 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3341/3341 variables, and 509 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1502 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 249/249 constraints, ReadFeed: 252/252 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 56/61 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1326/1387 variables, 61/64 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1387 variables, 42/106 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1387 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 692/2079 variables, 65/171 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2079 variables, 98/269 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2079 variables, 2/271 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 06:49:58] [INFO ] Deduced a trap composed of 37 places in 298 ms of which 2 ms to minimize.
[2024-06-01 06:49:59] [INFO ] Deduced a trap composed of 29 places in 235 ms of which 1 ms to minimize.
[2024-06-01 06:49:59] [INFO ] Deduced a trap composed of 22 places in 169 ms of which 1 ms to minimize.
[2024-06-01 06:49:59] [INFO ] Deduced a trap composed of 24 places in 233 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/2079 variables, 4/275 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2079 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 601/2680 variables, 48/323 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2680 variables, 1/324 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2680 variables, 77/401 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2680 variables, 0/401 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 4/2684 variables, 2/403 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2684 variables, 2/405 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2684 variables, 0/405 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 607/3291 variables, 46/451 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/3291 variables, 1/452 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/3291 variables, 29/481 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 06:50:01] [INFO ] Deduced a trap composed of 4 places in 76 ms of which 1 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/3291 variables, 1/482 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/3291 variables, 0/482 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 50/3341 variables, 27/509 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/3341 variables, 1/510 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/3341 variables, 6/516 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/3341 variables, 0/516 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (OVERLAPS) 0/3341 variables, 0/516 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3341/3341 variables, and 516 constraints, problems are : Problem set: 0 solved, 2 unsolved in 4099 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 249/249 constraints, ReadFeed: 252/252 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 5/5 constraints]
After SMT, in 5694ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 359 ms.
Support contains 5 out of 249 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 249/249 places, 3222/3222 transitions.
Applied a total of 0 rules in 56 ms. Remains 249 /249 variables (removed 0) and now considering 3222/3222 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 56 ms. Remains : 249/249 places, 3222/3222 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 249/249 places, 3222/3222 transitions.
Applied a total of 0 rules in 55 ms. Remains 249 /249 variables (removed 0) and now considering 3222/3222 (removed 0) transitions.
[2024-06-01 06:50:02] [INFO ] Flow matrix only has 3092 transitions (discarded 130 similar events)
[2024-06-01 06:50:02] [INFO ] Invariant cache hit.
[2024-06-01 06:50:02] [INFO ] Implicit Places using invariants in 446 ms returned []
[2024-06-01 06:50:02] [INFO ] Flow matrix only has 3092 transitions (discarded 130 similar events)
[2024-06-01 06:50:02] [INFO ] Invariant cache hit.
[2024-06-01 06:50:03] [INFO ] State equation strengthened by 252 read => feed constraints.
[2024-06-01 06:50:05] [INFO ] Implicit Places using invariants and state equation in 2187 ms returned []
Implicit Place search using SMT with State Equation took 2638 ms to find 0 implicit places.
[2024-06-01 06:50:05] [INFO ] Redundant transitions in 302 ms returned []
Running 3221 sub problems to find dead transitions.
[2024-06-01 06:50:05] [INFO ] Flow matrix only has 3092 transitions (discarded 130 similar events)
[2024-06-01 06:50:05] [INFO ] Invariant cache hit.
[2024-06-01 06:50:05] [INFO ] State equation strengthened by 252 read => feed constraints.
Usage: pnml2lts-sym [-gvqh] [--order=
[--mu-opt] [--saturation=
[--sat-granularity=
[--guidance=
[--action=
[--trace=
[--mu=
[--ctl=
[--save-levels=STRING] [--pg-solve] [--attr=
[--saturating-attractor] [--write-strategy=
[--check-strategy] [--interactive-play] [--player]
[--pg-write=
[--edge-label=
[--mucalc=
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por=
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=
[--cw-max-cols=
[--mh-timeout=
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=
[--ldd32-cache=
[--cache-ratio=
[--min-free-nodes=
[--fdd-reorder=
[--vset-cache-diff=
[--next-union] [--peak-nodes] [--maxsum=
[--block-size=
[--debug=
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS]
Could not compute solution for formula : BugTracking-PT-q8m064-CTLFireability-2024-00
Could not compute solution for formula : BugTracking-PT-q8m064-CTLFireability-2024-01
Could not compute solution for formula : BugTracking-PT-q8m064-CTLFireability-2024-02
Could not compute solution for formula : BugTracking-PT-q8m064-CTLFireability-2024-03
Could not compute solution for formula : BugTracking-PT-q8m064-CTLFireability-2024-04
Could not compute solution for formula : BugTracking-PT-q8m064-CTLFireability-2024-05
Could not compute solution for formula : BugTracking-PT-q8m064-CTLFireability-2024-06
Could not compute solution for formula : BugTracking-PT-q8m064-CTLFireability-2024-07
Could not compute solution for formula : BugTracking-PT-q8m064-CTLFireability-2024-08
Could not compute solution for formula : BugTracking-PT-q8m064-CTLFireability-2024-09
Could not compute solution for formula : BugTracking-PT-q8m064-CTLFireability-2024-10
Could not compute solution for formula : BugTracking-PT-q8m064-CTLFireability-2024-11
Could not compute solution for formula : BugTracking-PT-q8m064-CTLFireability-2023-12
Could not compute solution for formula : BugTracking-PT-q8m064-CTLFireability-2023-13
Could not compute solution for formula : BugTracking-PT-q8m064-CTLFireability-2023-14
Could not compute solution for formula : BugTracking-PT-q8m064-CTLFireability-2023-15
BK_STOP 1717224635593
--------------------
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.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -timeout 360 -rebuildPNML
mcc2024
ctl formula name BugTracking-PT-q8m064-CTLFireability-2024-00
ctl formula formula --ctl=/tmp/622/ctl_0_
ctl formula name BugTracking-PT-q8m064-CTLFireability-2024-01
ctl formula formula --ctl=/tmp/622/ctl_1_
ctl formula name BugTracking-PT-q8m064-CTLFireability-2024-02
ctl formula formula --ctl=/tmp/622/ctl_2_
ctl formula name BugTracking-PT-q8m064-CTLFireability-2024-03
ctl formula formula --ctl=/tmp/622/ctl_3_
ctl formula name BugTracking-PT-q8m064-CTLFireability-2024-04
ctl formula formula --ctl=/tmp/622/ctl_4_
ctl formula name BugTracking-PT-q8m064-CTLFireability-2024-05
ctl formula formula --ctl=/tmp/622/ctl_5_
ctl formula name BugTracking-PT-q8m064-CTLFireability-2024-06
ctl formula formula --ctl=/tmp/622/ctl_6_
ctl formula name BugTracking-PT-q8m064-CTLFireability-2024-07
ctl formula formula --ctl=/tmp/622/ctl_7_
ctl formula name BugTracking-PT-q8m064-CTLFireability-2024-08
ctl formula formula --ctl=/tmp/622/ctl_8_
ctl formula name BugTracking-PT-q8m064-CTLFireability-2024-09
ctl formula formula --ctl=/tmp/622/ctl_9_
ctl formula name BugTracking-PT-q8m064-CTLFireability-2024-10
ctl formula formula --ctl=/tmp/622/ctl_10_
ctl formula name BugTracking-PT-q8m064-CTLFireability-2024-11
ctl formula formula --ctl=/tmp/622/ctl_11_
ctl formula name BugTracking-PT-q8m064-CTLFireability-2023-12
ctl formula formula --ctl=/tmp/622/ctl_12_
ctl formula name BugTracking-PT-q8m064-CTLFireability-2023-13
ctl formula formula --ctl=/tmp/622/ctl_13_
ctl formula name BugTracking-PT-q8m064-CTLFireability-2023-14
ctl formula formula --ctl=/tmp/622/ctl_14_
ctl formula name BugTracking-PT-q8m064-CTLFireability-2023-15
ctl formula formula --ctl=/tmp/622/ctl_15_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc
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="BugTracking-PT-q8m064"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="ltsminxred"
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-5568"
echo " Executing tool ltsminxred"
echo " Input is BugTracking-PT-q8m064, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r472-tajo-171620399500426"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/BugTracking-PT-q8m064.tgz
mv BugTracking-PT-q8m064 execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "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 [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
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 ;