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-171620399300338.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-q3m008, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r472-tajo-171620399300338
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 16M
-rw-r--r-- 1 mcc users 11K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 92K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 75K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Apr 22 14:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 22 14:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 17:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.4K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 74K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.1K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 56K 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:23 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-q3m008-CTLFireability-2024-00
FORMULA_NAME BugTracking-PT-q3m008-CTLFireability-2024-01
FORMULA_NAME BugTracking-PT-q3m008-CTLFireability-2024-02
FORMULA_NAME BugTracking-PT-q3m008-CTLFireability-2024-03
FORMULA_NAME BugTracking-PT-q3m008-CTLFireability-2024-04
FORMULA_NAME BugTracking-PT-q3m008-CTLFireability-2024-05
FORMULA_NAME BugTracking-PT-q3m008-CTLFireability-2024-06
FORMULA_NAME BugTracking-PT-q3m008-CTLFireability-2024-07
FORMULA_NAME BugTracking-PT-q3m008-CTLFireability-2024-08
FORMULA_NAME BugTracking-PT-q3m008-CTLFireability-2024-09
FORMULA_NAME BugTracking-PT-q3m008-CTLFireability-2024-10
FORMULA_NAME BugTracking-PT-q3m008-CTLFireability-2024-11
FORMULA_NAME BugTracking-PT-q3m008-CTLFireability-2023-12
FORMULA_NAME BugTracking-PT-q3m008-CTLFireability-2023-13
FORMULA_NAME BugTracking-PT-q3m008-CTLFireability-2023-14
FORMULA_NAME BugTracking-PT-q3m008-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1717223088725

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-q3m008
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 06:24:49] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 06:24:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 06:24:50] [INFO ] Load time of PNML (sax parser for PT used): 837 ms
[2024-06-01 06:24:50] [INFO ] Transformed 754 places.
[2024-06-01 06:24:51] [INFO ] Transformed 27370 transitions.
[2024-06-01 06:24:51] [INFO ] Parsed PT model containing 754 places and 27370 transitions and 136172 arcs in 1084 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 44 ms.
Deduced a syphon composed of 514 places in 116 ms
Reduce places removed 514 places and 24601 transitions.
FORMULA BugTracking-PT-q3m008-CTLFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m008-CTLFireability-2024-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m008-CTLFireability-2023-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 19 out of 240 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 240/240 places, 2769/2769 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 238 transition count 2769
Applied a total of 2 rules in 57 ms. Remains 238 /240 variables (removed 2) and now considering 2769/2769 (removed 0) transitions.
[2024-06-01 06:24:51] [INFO ] Flow matrix only has 2642 transitions (discarded 127 similar events)
// Phase 1: matrix 2642 rows 238 cols
[2024-06-01 06:24:51] [INFO ] Computed 8 invariants in 42 ms
[2024-06-01 06:24:51] [INFO ] Implicit Places using invariants in 494 ms returned []
[2024-06-01 06:24:51] [INFO ] Flow matrix only has 2642 transitions (discarded 127 similar events)
[2024-06-01 06:24:51] [INFO ] Invariant cache hit.
[2024-06-01 06:24:52] [INFO ] State equation strengthened by 255 read => feed constraints.
[2024-06-01 06:24:54] [INFO ] Implicit Places using invariants and state equation in 2039 ms returned []
Implicit Place search using SMT with State Equation took 2563 ms to find 0 implicit places.
Running 2767 sub problems to find dead transitions.
[2024-06-01 06:24:54] [INFO ] Flow matrix only has 2642 transitions (discarded 127 similar events)
[2024-06-01 06:24:54] [INFO ] Invariant cache hit.
[2024-06-01 06:24:54] [INFO ] State equation strengthened by 255 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/237 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 2767 unsolved
[2024-06-01 06:25:31] [INFO ] Deduced a trap composed of 10 places in 253 ms of which 11 ms to minimize.
[2024-06-01 06:25:31] [INFO ] Deduced a trap composed of 10 places in 270 ms of which 2 ms to minimize.
[2024-06-01 06:25:31] [INFO ] Deduced a trap composed of 7 places in 129 ms of which 1 ms to minimize.
[2024-06-01 06:25:31] [INFO ] Deduced a trap composed of 21 places in 126 ms of which 1 ms to minimize.
[2024-06-01 06:25:39] [INFO ] Deduced a trap composed of 11 places in 47 ms of which 1 ms to minimize.
Problem TDEAD1005 is UNSAT
Problem TDEAD1011 is UNSAT
Problem TDEAD1017 is UNSAT
Problem TDEAD1023 is UNSAT
Problem TDEAD1029 is UNSAT
Problem TDEAD1030 is UNSAT
Problem TDEAD1031 is UNSAT
Problem TDEAD1032 is UNSAT
Problem TDEAD1033 is UNSAT
Problem TDEAD1034 is UNSAT
Problem TDEAD1035 is UNSAT
Problem TDEAD1038 is UNSAT
Problem TDEAD1039 is UNSAT
Problem TDEAD1040 is UNSAT
Problem TDEAD2310 is UNSAT
Problem TDEAD2318 is UNSAT
[2024-06-01 06:25:47] [INFO ] Deduced a trap composed of 21 places in 90 ms of which 1 ms to minimize.
Problem TDEAD2319 is UNSAT
Problem TDEAD2329 is UNSAT
Problem TDEAD2330 is UNSAT
Problem TDEAD2333 is UNSAT
[2024-06-01 06:25:48] [INFO ] Deduced a trap composed of 12 places in 115 ms of which 0 ms to minimize.
Problem TDEAD2334 is UNSAT
Problem TDEAD2335 is UNSAT
Problem TDEAD2336 is UNSAT
Problem TDEAD2337 is UNSAT
Problem TDEAD2338 is UNSAT
Problem TDEAD2339 is UNSAT
Problem TDEAD2340 is UNSAT
Problem TDEAD2341 is UNSAT
[2024-06-01 06:25:48] [INFO ] Deduced a trap composed of 21 places in 65 ms of which 2 ms to minimize.
Problem TDEAD2342 is UNSAT
[2024-06-01 06:25:48] [INFO ] Deduced a trap composed of 9 places in 71 ms of which 1 ms to minimize.
Problem TDEAD2343 is UNSAT
Problem TDEAD2344 is UNSAT
Problem TDEAD2345 is UNSAT
Problem TDEAD2346 is UNSAT
Problem TDEAD2347 is UNSAT
Problem TDEAD2348 is UNSAT
Problem TDEAD2349 is UNSAT
Problem TDEAD2350 is UNSAT
Problem TDEAD2351 is UNSAT
Problem TDEAD2352 is UNSAT
Problem TDEAD2356 is UNSAT
Problem TDEAD2364 is UNSAT
Problem TDEAD2365 is UNSAT
Problem TDEAD2375 is UNSAT
Problem TDEAD2376 is UNSAT
Problem TDEAD2379 is UNSAT
Problem TDEAD2380 is UNSAT
Problem TDEAD2381 is UNSAT
Problem TDEAD2382 is UNSAT
Problem TDEAD2383 is UNSAT
Problem TDEAD2384 is UNSAT
Problem TDEAD2385 is UNSAT
Problem TDEAD2386 is UNSAT
Problem TDEAD2387 is UNSAT
Problem TDEAD2391 is UNSAT
Problem TDEAD2392 is UNSAT
Problem TDEAD2393 is UNSAT
Problem TDEAD2394 is UNSAT
Problem TDEAD2395 is UNSAT
Problem TDEAD2396 is UNSAT
Problem TDEAD2397 is UNSAT
Problem TDEAD2398 is UNSAT
Problem TDEAD2399 is UNSAT
Problem TDEAD2400 is UNSAT
Problem TDEAD2401 is UNSAT
[2024-06-01 06:25:50] [INFO ] Deduced a trap composed of 10 places in 59 ms of which 1 ms to minimize.
Problem TDEAD2674 is UNSAT
Problem TDEAD2675 is UNSAT
Problem TDEAD2676 is UNSAT
Problem TDEAD2677 is UNSAT
[2024-06-01 06:25:50] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 0 ms to minimize.
Problem TDEAD2678 is UNSAT
Problem TDEAD2679 is UNSAT
Problem TDEAD2680 is UNSAT
Problem TDEAD2681 is UNSAT
Problem TDEAD2682 is UNSAT
Problem TDEAD2683 is UNSAT
Problem TDEAD2684 is UNSAT
Problem TDEAD2685 is UNSAT
Problem TDEAD2686 is UNSAT
Problem TDEAD2687 is UNSAT
Problem TDEAD2688 is UNSAT
Problem TDEAD2691 is UNSAT
Problem TDEAD2692 is UNSAT
[2024-06-01 06:25:50] [INFO ] Deduced a trap composed of 14 places in 61 ms of which 0 ms to minimize.
Problem TDEAD2693 is UNSAT
Problem TDEAD2694 is UNSAT
Problem TDEAD2695 is UNSAT
[2024-06-01 06:25:50] [INFO ] Deduced a trap composed of 10 places in 58 ms of which 1 ms to minimize.
Problem TDEAD2696 is UNSAT
[2024-06-01 06:25:50] [INFO ] Deduced a trap composed of 17 places in 62 ms of which 0 ms to minimize.
Problem TDEAD2697 is UNSAT
[2024-06-01 06:25:50] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 2 ms to minimize.
Problem TDEAD2698 is UNSAT
Problem TDEAD2699 is UNSAT
Problem TDEAD2700 is UNSAT
Problem TDEAD2701 is UNSAT
Problem TDEAD2702 is UNSAT
Problem TDEAD2703 is UNSAT
Problem TDEAD2704 is UNSAT
Problem TDEAD2705 is UNSAT
[2024-06-01 06:25:50] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 0 ms to minimize.
SMT process timed out in 56629ms, After SMT, problems are : Problem set: 0 solved, 2767 unsolved
Search for dead transitions found 0 dead transitions in 56705ms
Starting structural reductions in LTL mode, iteration 1 : 238/240 places, 2769/2769 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 59361 ms. Remains : 238/240 places, 2769/2769 transitions.
Support contains 19 out of 238 places after structural reductions.
[2024-06-01 06:25:51] [INFO ] Initial state reduction rules for CTL removed 4 formulas.
[2024-06-01 06:25:51] [INFO ] Flatten gal took : 368 ms
[2024-06-01 06:25:51] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
FORMULA BugTracking-PT-q3m008-CTLFireability-2023-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m008-CTLFireability-2023-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m008-CTLFireability-2024-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m008-CTLFireability-2024-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m008-CTLFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m008-CTLFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m008-CTLFireability-2024-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 06:25:51] [INFO ] Flatten gal took : 362 ms
[2024-06-01 06:25:52] [INFO ] Input system was already deterministic with 2769 transitions.
Support contains 5 out of 238 places (down from 19) after GAL structural reductions.
RANDOM walk for 40001 steps (263 resets) in 2042 ms. (19 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (43 resets) in 264 ms. (150 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (55 resets) in 191 ms. (208 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 141645 steps, run timeout after 3001 ms. (steps per millisecond=47 ) properties seen :0 out of 2
Probabilistic random walk after 141645 steps, saw 81653 distinct states, run finished after 3005 ms. (steps per millisecond=47 ) properties seen :0
[2024-06-01 06:25:56] [INFO ] Flow matrix only has 2642 transitions (discarded 127 similar events)
[2024-06-01 06:25:56] [INFO ] Invariant cache hit.
[2024-06-01 06:25:56] [INFO ] State equation strengthened by 255 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) 52/57 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 06:25:56] [INFO ] Deduced a trap composed of 12 places in 57 ms of which 1 ms to minimize.
Problem AtomicPropp1 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 1/5 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/57 variables, 0/5 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 838/895 variables, 57/62 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/895 variables, 109/171 constraints. Problems are: Problem set: 1 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/895 variables, 0/171 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1326/2221 variables, 72/243 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2221 variables, 79/322 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2221 variables, 0/322 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 614/2835 variables, 78/400 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2835 variables, 2/402 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2835 variables, 58/460 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2835 variables, 0/460 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 2/2837 variables, 1/461 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2837 variables, 0/461 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 43/2880 variables, 31/492 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2880 variables, 1/493 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2880 variables, 9/502 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/2880 variables, 0/502 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/2880 variables, 0/502 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2880/2880 variables, and 502 constraints, problems are : Problem set: 1 solved, 1 unsolved in 766 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 238/238 constraints, ReadFeed: 255/255 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 27/30 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 486/516 variables, 30/32 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/516 variables, 46/78 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/516 variables, 0/78 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 1104/1620 variables, 48/126 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1620 variables, 82/208 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1620 variables, 0/208 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 841/2461 variables, 84/292 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2461 variables, 2/294 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2461 variables, 95/389 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2461 variables, 1/390 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2461 variables, 1/391 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2461 variables, 0/391 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 8/2469 variables, 2/393 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2469 variables, 0/393 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 406/2875 variables, 73/466 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2875 variables, 2/468 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/2875 variables, 32/500 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/2875 variables, 0/500 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 5/2880 variables, 3/503 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-06-01 06:25:58] [INFO ] Deduced a trap composed of 19 places in 202 ms of which 1 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/2880 variables, 1/504 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/2880 variables, 0/504 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/2880 variables, 0/504 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2880/2880 variables, and 504 constraints, problems are : Problem set: 1 solved, 1 unsolved in 1627 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 238/238 constraints, ReadFeed: 255/255 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 2/2 constraints]
After SMT, in 2446ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 131 ms.
Support contains 3 out of 238 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 238/238 places, 2769/2769 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 237 transition count 2750
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 237 transition count 2750
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 2 places in 8 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 6 place count 235 transition count 2753
Free-agglomeration rule applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 235 transition count 2747
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 18 place count 229 transition count 2747
Applied a total of 18 rules in 314 ms. Remains 229 /238 variables (removed 9) and now considering 2747/2769 (removed 22) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 314 ms. Remains : 229/238 places, 2747/2769 transitions.
RANDOM walk for 40003 steps (8 resets) in 469 ms. (85 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (8 resets) in 217 ms. (183 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 185937 steps, run timeout after 3001 ms. (steps per millisecond=61 ) properties seen :0 out of 1
Probabilistic random walk after 185937 steps, saw 89336 distinct states, run finished after 3001 ms. (steps per millisecond=61 ) properties seen :0
[2024-06-01 06:26:02] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2024-06-01 06:26:02] [INFO ] Computed 8 invariants in 32 ms
[2024-06-01 06:26:02] [INFO ] State equation strengthened by 241 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 25/28 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 484/512 variables, 28/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/512 variables, 46/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/512 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 1104/1616 variables, 48/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1616 variables, 82/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1616 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 835/2451 variables, 84/290 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2451 variables, 2/292 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2451 variables, 88/380 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2451 variables, 0/380 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 4/2455 variables, 2/382 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2455 variables, 2/384 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2455 variables, 0/384 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 391/2846 variables, 66/450 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2846 variables, 2/452 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2846 variables, 25/477 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/2846 variables, 0/477 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 1/2847 variables, 1/478 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/2847 variables, 0/478 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/2847 variables, 0/478 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2847/2847 variables, and 478 constraints, problems are : Problem set: 0 solved, 1 unsolved in 680 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 229/229 constraints, ReadFeed: 241/241 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 25/28 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 484/512 variables, 28/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/512 variables, 46/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/512 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 1104/1616 variables, 48/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1616 variables, 82/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1616 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 835/2451 variables, 84/290 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2451 variables, 2/292 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2451 variables, 88/380 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2451 variables, 1/381 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2451 variables, 0/381 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 4/2455 variables, 2/383 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2455 variables, 2/385 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2455 variables, 0/385 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 391/2846 variables, 66/451 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2846 variables, 2/453 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/2846 variables, 25/478 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 06:26:04] [INFO ] Deduced a trap composed of 15 places in 340 ms of which 2 ms to minimize.
[2024-06-01 06:26:04] [INFO ] Deduced a trap composed of 51 places in 347 ms of which 1 ms to minimize.
[2024-06-01 06:26:04] [INFO ] Deduced a trap composed of 14 places in 334 ms of which 1 ms to minimize.
[2024-06-01 06:26:05] [INFO ] Deduced a trap composed of 47 places in 298 ms of which 1 ms to minimize.
[2024-06-01 06:26:05] [INFO ] Deduced a trap composed of 20 places in 212 ms of which 1 ms to minimize.
[2024-06-01 06:26:05] [INFO ] Deduced a trap composed of 20 places in 275 ms of which 1 ms to minimize.
[2024-06-01 06:26:06] [INFO ] Deduced a trap composed of 19 places in 302 ms of which 1 ms to minimize.
[2024-06-01 06:26:06] [INFO ] Deduced a trap composed of 19 places in 229 ms of which 1 ms to minimize.
[2024-06-01 06:26:06] [INFO ] Deduced a trap composed of 18 places in 263 ms of which 1 ms to minimize.
[2024-06-01 06:26:07] [INFO ] Deduced a trap composed of 19 places in 272 ms of which 2 ms to minimize.
[2024-06-01 06:26:07] [INFO ] Deduced a trap composed of 18 places in 268 ms of which 2 ms to minimize.
[2024-06-01 06:26:07] [INFO ] Deduced a trap composed of 19 places in 298 ms of which 1 ms to minimize.
[2024-06-01 06:26:08] [INFO ] Deduced a trap composed of 19 places in 264 ms of which 1 ms to minimize.
[2024-06-01 06:26:08] [INFO ] Deduced a trap composed of 17 places in 294 ms of which 2 ms to minimize.
[2024-06-01 06:26:08] [INFO ] Deduced a trap composed of 20 places in 226 ms of which 2 ms to minimize.
[2024-06-01 06:26:08] [INFO ] Deduced a trap composed of 11 places in 218 ms of which 2 ms to minimize.
[2024-06-01 06:26:09] [INFO ] Deduced a trap composed of 55 places in 350 ms of which 2 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/2846 variables, 17/495 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/2846 variables, 0/495 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 1/2847 variables, 1/496 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/2847 variables, 0/496 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/2847 variables, 0/496 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2847/2847 variables, and 496 constraints, problems are : Problem set: 0 solved, 1 unsolved in 6836 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 229/229 constraints, ReadFeed: 241/241 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 17/17 constraints]
After SMT, in 7596ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 318 ms.
Support contains 3 out of 229 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 229/229 places, 2747/2747 transitions.
Applied a total of 0 rules in 64 ms. Remains 229 /229 variables (removed 0) and now considering 2747/2747 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64 ms. Remains : 229/229 places, 2747/2747 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 229/229 places, 2747/2747 transitions.
Applied a total of 0 rules in 44 ms. Remains 229 /229 variables (removed 0) and now considering 2747/2747 (removed 0) transitions.
[2024-06-01 06:26:10] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2024-06-01 06:26:10] [INFO ] Invariant cache hit.
[2024-06-01 06:26:10] [INFO ] Implicit Places using invariants in 346 ms returned []
[2024-06-01 06:26:10] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2024-06-01 06:26:10] [INFO ] Invariant cache hit.
[2024-06-01 06:26:11] [INFO ] State equation strengthened by 241 read => feed constraints.
[2024-06-01 06:26:12] [INFO ] Implicit Places using invariants and state equation in 1517 ms returned []
Implicit Place search using SMT with State Equation took 1866 ms to find 0 implicit places.
[2024-06-01 06:26:12] [INFO ] Redundant transitions in 196 ms returned []
Running 2746 sub problems to find dead transitions.
[2024-06-01 06:26:12] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2024-06-01 06:26:12] [INFO ] Invariant cache hit.
[2024-06-01 06:26:12] [INFO ] State equation strengthened by 241 read => feed constraints.
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : BugTracking-PT-q3m008-CTLFireability-2024-00
Could not compute solution for formula : BugTracking-PT-q3m008-CTLFireability-2024-01
Could not compute solution for formula : BugTracking-PT-q3m008-CTLFireability-2024-02
Could not compute solution for formula : BugTracking-PT-q3m008-CTLFireability-2024-03
Could not compute solution for formula : BugTracking-PT-q3m008-CTLFireability-2024-04
Could not compute solution for formula : BugTracking-PT-q3m008-CTLFireability-2024-05
Could not compute solution for formula : BugTracking-PT-q3m008-CTLFireability-2024-06
Could not compute solution for formula : BugTracking-PT-q3m008-CTLFireability-2024-07
Could not compute solution for formula : BugTracking-PT-q3m008-CTLFireability-2024-08
Could not compute solution for formula : BugTracking-PT-q3m008-CTLFireability-2024-09
Could not compute solution for formula : BugTracking-PT-q3m008-CTLFireability-2024-10
Could not compute solution for formula : BugTracking-PT-q3m008-CTLFireability-2024-11
Could not compute solution for formula : BugTracking-PT-q3m008-CTLFireability-2023-12
Could not compute solution for formula : BugTracking-PT-q3m008-CTLFireability-2023-13
Could not compute solution for formula : BugTracking-PT-q3m008-CTLFireability-2023-14
Could not compute solution for formula : BugTracking-PT-q3m008-CTLFireability-2023-15

BK_STOP 1717223201843

--------------------
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-q3m008-CTLFireability-2024-00
ctl formula formula --ctl=/tmp/669/ctl_0_
ctl formula name BugTracking-PT-q3m008-CTLFireability-2024-01
ctl formula formula --ctl=/tmp/669/ctl_1_
ctl formula name BugTracking-PT-q3m008-CTLFireability-2024-02
ctl formula formula --ctl=/tmp/669/ctl_2_
ctl formula name BugTracking-PT-q3m008-CTLFireability-2024-03
ctl formula formula --ctl=/tmp/669/ctl_3_
ctl formula name BugTracking-PT-q3m008-CTLFireability-2024-04
ctl formula formula --ctl=/tmp/669/ctl_4_
ctl formula name BugTracking-PT-q3m008-CTLFireability-2024-05
ctl formula formula --ctl=/tmp/669/ctl_5_
ctl formula name BugTracking-PT-q3m008-CTLFireability-2024-06
ctl formula formula --ctl=/tmp/669/ctl_6_
ctl formula name BugTracking-PT-q3m008-CTLFireability-2024-07
ctl formula formula --ctl=/tmp/669/ctl_7_
ctl formula name BugTracking-PT-q3m008-CTLFireability-2024-08
ctl formula formula --ctl=/tmp/669/ctl_8_
ctl formula name BugTracking-PT-q3m008-CTLFireability-2024-09
ctl formula formula --ctl=/tmp/669/ctl_9_
ctl formula name BugTracking-PT-q3m008-CTLFireability-2024-10
ctl formula formula --ctl=/tmp/669/ctl_10_
ctl formula name BugTracking-PT-q3m008-CTLFireability-2024-11
ctl formula formula --ctl=/tmp/669/ctl_11_
ctl formula name BugTracking-PT-q3m008-CTLFireability-2023-12
ctl formula formula --ctl=/tmp/669/ctl_12_
ctl formula name BugTracking-PT-q3m008-CTLFireability-2023-13
ctl formula formula --ctl=/tmp/669/ctl_13_
ctl formula name BugTracking-PT-q3m008-CTLFireability-2023-14
ctl formula formula --ctl=/tmp/669/ctl_14_
ctl formula name BugTracking-PT-q3m008-CTLFireability-2023-15
ctl formula formula --ctl=/tmp/669/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-q3m008"
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-q3m008, 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-171620399300338"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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