Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r026-smll-171620167200215.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is AutoFlight-PT-96b, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r026-smll-171620167200215
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.4M
-rw-r--r-- 1 mcc users 6.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K May 19 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 19 15:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 17:52 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 12 22:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 119K Apr 12 22:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.1K Apr 12 22:13 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 67K Apr 12 22:13 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:28 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:28 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 1.9M 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 AutoFlight-PT-96b-ReachabilityFireability-2024-00
FORMULA_NAME AutoFlight-PT-96b-ReachabilityFireability-2024-01
FORMULA_NAME AutoFlight-PT-96b-ReachabilityFireability-2024-02
FORMULA_NAME AutoFlight-PT-96b-ReachabilityFireability-2024-03
FORMULA_NAME AutoFlight-PT-96b-ReachabilityFireability-2024-04
FORMULA_NAME AutoFlight-PT-96b-ReachabilityFireability-2024-05
FORMULA_NAME AutoFlight-PT-96b-ReachabilityFireability-2024-06
FORMULA_NAME AutoFlight-PT-96b-ReachabilityFireability-2024-07
FORMULA_NAME AutoFlight-PT-96b-ReachabilityFireability-2024-08
FORMULA_NAME AutoFlight-PT-96b-ReachabilityFireability-2024-09
FORMULA_NAME AutoFlight-PT-96b-ReachabilityFireability-2024-10
FORMULA_NAME AutoFlight-PT-96b-ReachabilityFireability-2024-11
FORMULA_NAME AutoFlight-PT-96b-ReachabilityFireability-2024-12
FORMULA_NAME AutoFlight-PT-96b-ReachabilityFireability-2024-13
FORMULA_NAME AutoFlight-PT-96b-ReachabilityFireability-2024-14
FORMULA_NAME AutoFlight-PT-96b-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1716317855947

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutoFlight-PT-96b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityFireability PT
Running Version 202405141337
[2024-05-21 18:57:38] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-21 18:57:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 18:57:39] [INFO ] Load time of PNML (sax parser for PT used): 678 ms
[2024-05-21 18:57:39] [INFO ] Transformed 7894 places.
[2024-05-21 18:57:39] [INFO ] Transformed 7868 transitions.
[2024-05-21 18:57:39] [INFO ] Found NUPN structural information;
[2024-05-21 18:57:39] [INFO ] Parsed PT model containing 7894 places and 7868 transitions and 18200 arcs in 1321 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 26 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (8 resets) in 3953 ms. (10 steps per ms) remains 9/16 properties
FORMULA AutoFlight-PT-96b-ReachabilityFireability-2024-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-96b-ReachabilityFireability-2024-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-96b-ReachabilityFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-96b-ReachabilityFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-96b-ReachabilityFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-96b-ReachabilityFireability-2024-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-96b-ReachabilityFireability-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 745 ms. (53 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 192 ms. (207 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 416 ms. (95 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 411 ms. (97 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 977 ms. (40 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 112 ms. (354 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 254 ms. (156 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 159 ms. (250 steps per ms) remains 9/9 properties
[2024-05-21 18:57:42] [INFO ] Flatten gal took : 1165 ms
BEST_FIRST walk for 40004 steps (8 resets) in 195 ms. (204 steps per ms) remains 9/9 properties
// Phase 1: matrix 7868 rows 7894 cols
[2024-05-21 18:57:42] [INFO ] Flatten gal took : 393 ms
[2024-05-21 18:57:43] [INFO ] Computed 514 invariants in 295 ms
[2024-05-21 18:57:43] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17210469832930924497.gal : 130 ms
[2024-05-21 18:57:43] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17936487416675479108.prop : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality17210469832930924497.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17936487416675479108.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/163 variables, 163/163 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/163 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Loading property file /tmp/ReachabilityCardinality17936487416675479108.prop.
At refinement iteration 2 (OVERLAPS) 7379/7542 variables, 480/643 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/7542 variables, 7379/8022 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 7542/15762 variables, and 8022 constraints, problems are : Problem set: 0 solved, 9 unsolved in 5059 ms.
Refiners :[Domain max(s): 7542/7894 constraints, Positive P Invariants (semi-flows): 480/513 constraints, Generalized P Invariants (flows): 0/1 constraints, State Equation: 0/7894 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/163 variables, 163/163 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/163 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (OVERLAPS) 7379/7542 variables, 480/643 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/7542 variables, 7379/8022 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-05-21 18:57:58] [INFO ] Deduced a trap composed of 46 places in 6253 ms of which 305 ms to minimize.
SMT process timed out in 16155ms, After SMT, problems are : Problem set: 0 solved, 9 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 163 out of 7894 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 7894/7894 places, 7868/7868 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3201 transitions
Trivial Post-agglo rules discarded 3201 transitions
Performed 3201 trivial Post agglomeration. Transition count delta: 3201
Iterating post reduction 0 with 3201 rules applied. Total rules applied 3201 place count 7894 transition count 4667
Reduce places removed 3201 places and 0 transitions.
Ensure Unique test removed 351 transitions
Reduce isomorphic transitions removed 351 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 166 transitions
Trivial Post-agglo rules discarded 166 transitions
Performed 166 trivial Post agglomeration. Transition count delta: 166
Iterating post reduction 1 with 3718 rules applied. Total rules applied 6919 place count 4693 transition count 4150
Reduce places removed 166 places and 0 transitions.
Performed 77 Post agglomeration using F-continuation condition.Transition count delta: 77
Iterating post reduction 2 with 243 rules applied. Total rules applied 7162 place count 4527 transition count 4073
Reduce places removed 77 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 88 rules applied. Total rules applied 7250 place count 4450 transition count 4062
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 7251 place count 4449 transition count 4062
Performed 968 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 968 Pre rules applied. Total rules applied 7251 place count 4449 transition count 3094
Deduced a syphon composed of 968 places in 63 ms
Reduce places removed 968 places and 0 transitions.
Iterating global reduction 5 with 1936 rules applied. Total rules applied 9187 place count 3481 transition count 3094
Discarding 641 places :
Symmetric choice reduction at 5 with 641 rule applications. Total rules 9828 place count 2840 transition count 2453
Iterating global reduction 5 with 641 rules applied. Total rules applied 10469 place count 2840 transition count 2453
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 6 rules applied. Total rules applied 10475 place count 2840 transition count 2447
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 10476 place count 2839 transition count 2447
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 200 Pre rules applied. Total rules applied 10476 place count 2839 transition count 2247
Deduced a syphon composed of 200 places in 36 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 7 with 400 rules applied. Total rules applied 10876 place count 2639 transition count 2247
Performed 632 Post agglomeration using F-continuation condition.Transition count delta: 632
Deduced a syphon composed of 632 places in 4 ms
Reduce places removed 632 places and 0 transitions.
Iterating global reduction 7 with 1264 rules applied. Total rules applied 12140 place count 2007 transition count 1615
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 6 places in 4 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 7 with 12 rules applied. Total rules applied 12152 place count 2001 transition count 1616
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 7 with 12 rules applied. Total rules applied 12164 place count 2001 transition count 1604
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 3 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 7 with 10 rules applied. Total rules applied 12174 place count 1996 transition count 1599
Free-agglomeration rule applied 271 times.
Iterating global reduction 7 with 271 rules applied. Total rules applied 12445 place count 1996 transition count 1328
Reduce places removed 271 places and 0 transitions.
Iterating post reduction 7 with 271 rules applied. Total rules applied 12716 place count 1725 transition count 1328
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 12717 place count 1724 transition count 1327
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 12719 place count 1722 transition count 1327
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 2 Pre rules applied. Total rules applied 12719 place count 1722 transition count 1325
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 9 with 4 rules applied. Total rules applied 12723 place count 1720 transition count 1325
Applied a total of 12723 rules in 3906 ms. Remains 1720 /7894 variables (removed 6174) and now considering 1325/7868 (removed 6543) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3923 ms. Remains : 1720/7894 places, 1325/7868 transitions.
RANDOM walk for 40000 steps (185 resets) in 1481 ms. (26 steps per ms) remains 5/9 properties
FORMULA AutoFlight-PT-96b-ReachabilityFireability-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-96b-ReachabilityFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-96b-ReachabilityFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-96b-ReachabilityFireability-2024-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (12 resets) in 732 ms. (54 steps per ms) remains 4/5 properties
FORMULA AutoFlight-PT-96b-ReachabilityFireability-2024-06 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (14 resets) in 703 ms. (56 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (15 resets) in 674 ms. (59 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (15 resets) in 622 ms. (64 steps per ms) remains 3/4 properties
FORMULA AutoFlight-PT-96b-ReachabilityFireability-2024-12 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (18 resets) in 469 ms. (85 steps per ms) remains 3/3 properties
// Phase 1: matrix 1325 rows 1720 cols
[2024-05-21 18:58:04] [INFO ] Computed 512 invariants in 39 ms
[2024-05-21 18:58:04] [INFO ] State equation strengthened by 683 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 940/1007 variables, 422/422 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1007 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 634/1641 variables, 87/509 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1641 variables, 0/509 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem AutoFlight-PT-96b-ReachabilityFireability-2024-07 is UNSAT
FORMULA AutoFlight-PT-96b-ReachabilityFireability-2024-07 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 5 (OVERLAPS) 77/1718 variables, 2/511 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1718 variables, 0/511 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 1325/3043 variables, 1718/2229 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3043 variables, 683/2912 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3043 variables, 0/2912 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 2/3045 variables, 2/2914 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3045 variables, 1/2915 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3045 variables, 0/2915 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/3045 variables, 0/2915 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3045/3045 variables, and 2915 constraints, problems are : Problem set: 1 solved, 2 unsolved in 2969 ms.
Refiners :[Positive P Invariants (semi-flows): 510/510 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1720/1720 constraints, ReadFeed: 683/683 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 735/750 variables, 407/407 constraints. Problems are: Problem set: 1 solved, 2 unsolved
[2024-05-21 18:58:08] [INFO ] Deduced a trap composed of 9 places in 743 ms of which 11 ms to minimize.
[2024-05-21 18:58:09] [INFO ] Deduced a trap composed of 12 places in 627 ms of which 21 ms to minimize.
[2024-05-21 18:58:09] [INFO ] Deduced a trap composed of 11 places in 529 ms of which 9 ms to minimize.
[2024-05-21 18:58:10] [INFO ] Deduced a trap composed of 10 places in 604 ms of which 9 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/750 variables, 4/411 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/750 variables, 0/411 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 888/1638 variables, 102/513 constraints. Problems are: Problem set: 1 solved, 2 unsolved
[2024-05-21 18:58:12] [INFO ] Deduced a trap composed of 7 places in 1455 ms of which 15 ms to minimize.
[2024-05-21 18:58:12] [INFO ] Deduced a trap composed of 7 places in 555 ms of which 9 ms to minimize.
[2024-05-21 18:58:13] [INFO ] Deduced a trap composed of 7 places in 531 ms of which 9 ms to minimize.
[2024-05-21 18:58:13] [INFO ] Deduced a trap composed of 6 places in 507 ms of which 9 ms to minimize.
[2024-05-21 18:58:14] [INFO ] Deduced a trap composed of 7 places in 517 ms of which 9 ms to minimize.
[2024-05-21 18:58:15] [INFO ] Deduced a trap composed of 8 places in 726 ms of which 13 ms to minimize.
[2024-05-21 18:58:15] [INFO ] Deduced a trap composed of 10 places in 639 ms of which 8 ms to minimize.
[2024-05-21 18:58:16] [INFO ] Deduced a trap composed of 8 places in 611 ms of which 9 ms to minimize.
[2024-05-21 18:58:17] [INFO ] Deduced a trap composed of 10 places in 615 ms of which 8 ms to minimize.
[2024-05-21 18:58:17] [INFO ] Deduced a trap composed of 17 places in 616 ms of which 9 ms to minimize.
[2024-05-21 18:58:18] [INFO ] Deduced a trap composed of 5 places in 603 ms of which 9 ms to minimize.
[2024-05-21 18:58:19] [INFO ] Deduced a trap composed of 8 places in 593 ms of which 8 ms to minimize.
[2024-05-21 18:58:19] [INFO ] Deduced a trap composed of 5 places in 601 ms of which 9 ms to minimize.
[2024-05-21 18:58:20] [INFO ] Deduced a trap composed of 5 places in 611 ms of which 8 ms to minimize.
[2024-05-21 18:58:21] [INFO ] Deduced a trap composed of 5 places in 801 ms of which 14 ms to minimize.
[2024-05-21 18:58:21] [INFO ] Deduced a trap composed of 8 places in 610 ms of which 16 ms to minimize.
[2024-05-21 18:58:22] [INFO ] Deduced a trap composed of 5 places in 588 ms of which 9 ms to minimize.
[2024-05-21 18:58:23] [INFO ] Deduced a trap composed of 8 places in 596 ms of which 9 ms to minimize.
[2024-05-21 18:58:23] [INFO ] Deduced a trap composed of 10 places in 566 ms of which 8 ms to minimize.
[2024-05-21 18:58:24] [INFO ] Deduced a trap composed of 9 places in 575 ms of which 9 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/1638 variables, 20/533 constraints. Problems are: Problem set: 1 solved, 2 unsolved
[2024-05-21 18:58:25] [INFO ] Deduced a trap composed of 7 places in 604 ms of which 9 ms to minimize.
[2024-05-21 18:58:25] [INFO ] Deduced a trap composed of 9 places in 599 ms of which 8 ms to minimize.
[2024-05-21 18:58:26] [INFO ] Deduced a trap composed of 7 places in 589 ms of which 9 ms to minimize.
[2024-05-21 18:58:26] [INFO ] Deduced a trap composed of 10 places in 569 ms of which 8 ms to minimize.
[2024-05-21 18:58:27] [INFO ] Deduced a trap composed of 9 places in 563 ms of which 8 ms to minimize.
[2024-05-21 18:58:28] [INFO ] Deduced a trap composed of 10 places in 570 ms of which 9 ms to minimize.
[2024-05-21 18:58:28] [INFO ] Deduced a trap composed of 11 places in 565 ms of which 8 ms to minimize.
[2024-05-21 18:58:29] [INFO ] Deduced a trap composed of 11 places in 532 ms of which 8 ms to minimize.
[2024-05-21 18:58:29] [INFO ] Deduced a trap composed of 9 places in 523 ms of which 14 ms to minimize.
[2024-05-21 18:58:30] [INFO ] Deduced a trap composed of 10 places in 529 ms of which 8 ms to minimize.
[2024-05-21 18:58:30] [INFO ] Deduced a trap composed of 12 places in 509 ms of which 9 ms to minimize.
[2024-05-21 18:58:31] [INFO ] Deduced a trap composed of 10 places in 226 ms of which 5 ms to minimize.
[2024-05-21 18:58:31] [INFO ] Deduced a trap composed of 22 places in 246 ms of which 5 ms to minimize.
[2024-05-21 18:58:31] [INFO ] Deduced a trap composed of 15 places in 215 ms of which 5 ms to minimize.
[2024-05-21 18:58:31] [INFO ] Deduced a trap composed of 7 places in 255 ms of which 6 ms to minimize.
[2024-05-21 18:58:32] [INFO ] Deduced a trap composed of 7 places in 231 ms of which 5 ms to minimize.
[2024-05-21 18:58:32] [INFO ] Deduced a trap composed of 33 places in 256 ms of which 5 ms to minimize.
[2024-05-21 18:58:32] [INFO ] Deduced a trap composed of 36 places in 237 ms of which 5 ms to minimize.
[2024-05-21 18:58:33] [INFO ] Deduced a trap composed of 35 places in 241 ms of which 5 ms to minimize.
[2024-05-21 18:58:33] [INFO ] Deduced a trap composed of 37 places in 207 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/1638 variables, 20/553 constraints. Problems are: Problem set: 1 solved, 2 unsolved
[2024-05-21 18:58:33] [INFO ] Deduced a trap composed of 49 places in 168 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1638 variables, 1/554 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1638 variables, 0/554 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 80/1718 variables, 2/556 constraints. Problems are: Problem set: 1 solved, 2 unsolved
[2024-05-21 18:58:35] [INFO ] Deduced a trap composed of 11 places in 1422 ms of which 15 ms to minimize.
Problem AutoFlight-PT-96b-ReachabilityFireability-2024-09 is UNSAT
FORMULA AutoFlight-PT-96b-ReachabilityFireability-2024-09 TRUE TECHNIQUES SMT_REFINEMENT
[2024-05-21 18:58:36] [INFO ] Deduced a trap composed of 21 places in 796 ms of which 11 ms to minimize.
[2024-05-21 18:58:36] [INFO ] Deduced a trap composed of 7 places in 769 ms of which 10 ms to minimize.
[2024-05-21 18:58:37] [INFO ] Deduced a trap composed of 627 places in 761 ms of which 10 ms to minimize.
[2024-05-21 18:58:38] [INFO ] Deduced a trap composed of 52 places in 786 ms of which 12 ms to minimize.
[2024-05-21 18:58:39] [INFO ] Deduced a trap composed of 594 places in 802 ms of which 11 ms to minimize.
[2024-05-21 18:58:40] [INFO ] Deduced a trap composed of 57 places in 775 ms of which 10 ms to minimize.
[2024-05-21 18:58:41] [INFO ] Deduced a trap composed of 622 places in 790 ms of which 10 ms to minimize.
[2024-05-21 18:58:41] [INFO ] Deduced a trap composed of 596 places in 805 ms of which 10 ms to minimize.
[2024-05-21 18:58:42] [INFO ] Deduced a trap composed of 606 places in 779 ms of which 24 ms to minimize.
[2024-05-21 18:58:43] [INFO ] Deduced a trap composed of 14 places in 764 ms of which 10 ms to minimize.
[2024-05-21 18:58:44] [INFO ] Deduced a trap composed of 47 places in 780 ms of which 11 ms to minimize.
[2024-05-21 18:58:45] [INFO ] Deduced a trap composed of 32 places in 777 ms of which 10 ms to minimize.
[2024-05-21 18:58:46] [INFO ] Deduced a trap composed of 692 places in 784 ms of which 10 ms to minimize.
[2024-05-21 18:58:46] [INFO ] Deduced a trap composed of 652 places in 779 ms of which 10 ms to minimize.
[2024-05-21 18:58:47] [INFO ] Deduced a trap composed of 655 places in 769 ms of which 10 ms to minimize.
[2024-05-21 18:58:48] [INFO ] Deduced a trap composed of 594 places in 776 ms of which 10 ms to minimize.
[2024-05-21 18:58:49] [INFO ] Deduced a trap composed of 598 places in 761 ms of which 10 ms to minimize.
[2024-05-21 18:58:50] [INFO ] Deduced a trap composed of 658 places in 775 ms of which 10 ms to minimize.
[2024-05-21 18:58:50] [INFO ] Deduced a trap composed of 661 places in 788 ms of which 10 ms to minimize.
Problem AutoFlight-PT-96b-ReachabilityFireability-2024-09 is UNSAT
At refinement iteration 10 (INCLUDED_ONLY) 0/1718 variables, 20/576 constraints. Problems are: Problem set: 2 solved, 1 unsolved
[2024-05-21 18:58:51] [INFO ] Deduced a trap composed of 654 places in 761 ms of which 10 ms to minimize.
[2024-05-21 18:58:52] [INFO ] Deduced a trap composed of 695 places in 761 ms of which 10 ms to minimize.
SMT process timed out in 48373ms, After SMT, problems are : Problem set: 2 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 12 out of 1720 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1720/1720 places, 1325/1325 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 81 transitions
Trivial Post-agglo rules discarded 81 transitions
Performed 81 trivial Post agglomeration. Transition count delta: 81
Iterating post reduction 0 with 81 rules applied. Total rules applied 81 place count 1720 transition count 1244
Reduce places removed 81 places and 0 transitions.
Iterating post reduction 1 with 81 rules applied. Total rules applied 162 place count 1639 transition count 1244
Performed 44 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 44 Pre rules applied. Total rules applied 162 place count 1639 transition count 1200
Deduced a syphon composed of 44 places in 3 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 2 with 88 rules applied. Total rules applied 250 place count 1595 transition count 1200
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 252 place count 1593 transition count 1198
Iterating global reduction 2 with 2 rules applied. Total rules applied 254 place count 1593 transition count 1198
Performed 93 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 93 places in 1 ms
Reduce places removed 93 places and 0 transitions.
Iterating global reduction 2 with 186 rules applied. Total rules applied 440 place count 1500 transition count 1102
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 450 place count 1500 transition count 1092
Renaming transitions due to excessive name length > 1024 char.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 458 place count 1496 transition count 1088
Free-agglomeration rule applied 19 times.
Iterating global reduction 3 with 19 rules applied. Total rules applied 477 place count 1496 transition count 1069
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 3 with 19 rules applied. Total rules applied 496 place count 1477 transition count 1069
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 498 place count 1475 transition count 1067
Reduce places removed 321 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 485 transitions
Trivial Post-agglo rules discarded 485 transitions
Performed 485 trivial Post agglomeration. Transition count delta: 485
Iterating post reduction 4 with 806 rules applied. Total rules applied 1304 place count 1154 transition count 582
Reduce places removed 485 places and 0 transitions.
Iterating post reduction 5 with 485 rules applied. Total rules applied 1789 place count 669 transition count 582
Performed 180 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 180 Pre rules applied. Total rules applied 1789 place count 669 transition count 402
Deduced a syphon composed of 180 places in 0 ms
Reduce places removed 180 places and 0 transitions.
Iterating global reduction 6 with 360 rules applied. Total rules applied 2149 place count 489 transition count 402
Applied a total of 2149 rules in 612 ms. Remains 489 /1720 variables (removed 1231) and now considering 402/1325 (removed 923) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 613 ms. Remains : 489/1720 places, 402/1325 transitions.
RANDOM walk for 40000 steps (181 resets) in 1516 ms. (26 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (11 resets) in 325 ms. (122 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 278612 steps, run timeout after 3001 ms. (steps per millisecond=92 ) properties seen :0 out of 1
Probabilistic random walk after 278612 steps, saw 104638 distinct states, run finished after 3007 ms. (steps per millisecond=92 ) properties seen :0
// Phase 1: matrix 402 rows 489 cols
[2024-05-21 18:58:56] [INFO ] Computed 191 invariants in 4 ms
[2024-05-21 18:58:56] [INFO ] State equation strengthened by 80 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 25/37 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 175/212 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/212 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 125/337 variables, 101/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/337 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 402/739 variables, 337/452 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/739 variables, 80/532 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/739 variables, 0/532 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 152/891 variables, 152/684 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/891 variables, 76/760 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/891 variables, 0/760 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/891 variables, 0/760 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 891/891 variables, and 760 constraints, problems are : Problem set: 0 solved, 1 unsolved in 372 ms.
Refiners :[Positive P Invariants (semi-flows): 189/189 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 489/489 constraints, ReadFeed: 80/80 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/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 25/37 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 175/212 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/212 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 125/337 variables, 101/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 18:58:57] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/337 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/337 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 402/739 variables, 337/453 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/739 variables, 80/533 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/739 variables, 1/534 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/739 variables, 0/534 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 152/891 variables, 152/686 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/891 variables, 76/762 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/891 variables, 0/762 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/891 variables, 0/762 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 891/891 variables, and 762 constraints, problems are : Problem set: 0 solved, 1 unsolved in 488 ms.
Refiners :[Positive P Invariants (semi-flows): 189/189 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 489/489 constraints, ReadFeed: 80/80 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 894ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 64 steps, including 3 resets, run visited all 1 properties in 1 ms. (steps per millisecond=64 )
FORMULA AutoFlight-PT-96b-ReachabilityFireability-2024-15 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 9 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
All properties solved without resorting to model-checking.
Total runtime 79220 ms.

BK_STOP 1716317937712

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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="AutoFlight-PT-96b"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="itstools"
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 itstools"
echo " Input is AutoFlight-PT-96b, 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 r026-smll-171620167200215"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/AutoFlight-PT-96b.tgz
mv AutoFlight-PT-96b 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 ;