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.r496-tall-171640603000279.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 ltsminxred
Input is FunctionPointer-PT-c002, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r496-tall-171640603000279
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.6M
-rw-r--r-- 1 mcc users 5.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 54K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K Apr 22 14:46 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Apr 22 14:46 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 22 14:46 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:46 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 119K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.4K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 81K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 19 07:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 19 15:26 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 4.2M 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 FunctionPointer-PT-c002-ReachabilityFireability-2024-00
FORMULA_NAME FunctionPointer-PT-c002-ReachabilityFireability-2024-01
FORMULA_NAME FunctionPointer-PT-c002-ReachabilityFireability-2023-02
FORMULA_NAME FunctionPointer-PT-c002-ReachabilityFireability-2024-03
FORMULA_NAME FunctionPointer-PT-c002-ReachabilityFireability-2024-04
FORMULA_NAME FunctionPointer-PT-c002-ReachabilityFireability-2023-05
FORMULA_NAME FunctionPointer-PT-c002-ReachabilityFireability-2024-06
FORMULA_NAME FunctionPointer-PT-c002-ReachabilityFireability-2024-07
FORMULA_NAME FunctionPointer-PT-c002-ReachabilityFireability-2023-08
FORMULA_NAME FunctionPointer-PT-c002-ReachabilityFireability-2024-09
FORMULA_NAME FunctionPointer-PT-c002-ReachabilityFireability-2024-10
FORMULA_NAME FunctionPointer-PT-c002-ReachabilityFireability-2023-11
FORMULA_NAME FunctionPointer-PT-c002-ReachabilityFireability-2024-12
FORMULA_NAME FunctionPointer-PT-c002-ReachabilityFireability-2024-13
FORMULA_NAME FunctionPointer-PT-c002-ReachabilityFireability-2024-14
FORMULA_NAME FunctionPointer-PT-c002-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717190551196

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FunctionPointer-PT-c002
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 21:22:32] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-31 21:22:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 21:22:32] [INFO ] Load time of PNML (sax parser for PT used): 377 ms
[2024-05-31 21:22:32] [INFO ] Transformed 2826 places.
[2024-05-31 21:22:32] [INFO ] Transformed 8960 transitions.
[2024-05-31 21:22:32] [INFO ] Parsed PT model containing 2826 places and 8960 transitions and 36096 arcs in 525 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 19 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 1198 places in 46 ms
Reduce places removed 1198 places and 2998 transitions.
FORMULA FunctionPointer-PT-c002-ReachabilityFireability-2024-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c002-ReachabilityFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c002-ReachabilityFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c002-ReachabilityFireability-2024-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (8 resets) in 2746 ms. (14 steps per ms) remains 11/12 properties
FORMULA FunctionPointer-PT-c002-ReachabilityFireability-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 260 ms. (153 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (8 resets) in 552 ms. (72 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 710 ms. (56 steps per ms) remains 10/11 properties
FORMULA FunctionPointer-PT-c002-ReachabilityFireability-2024-00 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (8 resets) in 191 ms. (208 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (8 resets) in 159 ms. (250 steps per ms) remains 9/10 properties
FORMULA FunctionPointer-PT-c002-ReachabilityFireability-2024-10 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 145 ms. (274 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 140 ms. (283 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 118 ms. (336 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 88 ms. (449 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 87 ms. (454 steps per ms) remains 9/9 properties
[2024-05-31 21:22:34] [INFO ] Flow matrix only has 3540 transitions (discarded 2422 similar events)
// Phase 1: matrix 3540 rows 1628 cols
[2024-05-31 21:22:34] [INFO ] Computed 4 invariants in 94 ms
[2024-05-31 21:22:34] [INFO ] State equation strengthened by 479 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Problem FunctionPointer-PT-c002-ReachabilityFireability-2024-01 is UNSAT
FORMULA FunctionPointer-PT-c002-ReachabilityFireability-2024-01 TRUE TECHNIQUES SMT_REFINEMENT
Problem FunctionPointer-PT-c002-ReachabilityFireability-2024-03 is UNSAT
FORMULA FunctionPointer-PT-c002-ReachabilityFireability-2024-03 FALSE TECHNIQUES SMT_REFINEMENT
Problem FunctionPointer-PT-c002-ReachabilityFireability-2024-13 is UNSAT
FORMULA FunctionPointer-PT-c002-ReachabilityFireability-2024-13 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 1 (OVERLAPS) 527/599 variables, 3/3 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/599 variables, 0/3 constraints. Problems are: Problem set: 3 solved, 6 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 1/600 variables, 1/4 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/600 variables, 0/4 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 1654/2254 variables, 600/604 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2254 variables, 404/1008 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2254 variables, 0/1008 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 1996/4250 variables, 544/1552 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4250 variables, 75/1627 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4250 variables, 0/1627 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 596/4846 variables, 386/2013 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/4846 variables, 0/2013 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 230/5076 variables, 70/2083 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/5076 variables, 0/2083 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 92/5168 variables, 28/2111 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/5168 variables, 0/2111 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 17 (OVERLAPS) 0/5168 variables, 0/2111 constraints. Problems are: Problem set: 3 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 5168/5168 variables, and 2111 constraints, problems are : Problem set: 3 solved, 6 unsolved in 3166 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 1628/1628 constraints, ReadFeed: 479/479 constraints, PredecessorRefiner: 9/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 539/574 variables, 3/3 constraints. Problems are: Problem set: 3 solved, 6 unsolved
[2024-05-31 21:22:38] [INFO ] Deduced a trap composed of 135 places in 221 ms of which 25 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/574 variables, 1/4 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/574 variables, 0/4 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 1/575 variables, 1/5 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/575 variables, 0/5 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 1524/2099 variables, 575/580 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2099 variables, 401/981 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2099 variables, 0/981 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 1644/3743 variables, 478/1459 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3743 variables, 78/1537 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3743 variables, 3/1540 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3743 variables, 0/1540 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 692/4435 variables, 388/1928 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/4435 variables, 0/1928 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 471/4906 variables, 117/2045 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/4906 variables, 0/2045 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 17 (OVERLAPS) 262/5168 variables, 70/2115 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/5168 variables, 0/2115 constraints. Problems are: Problem set: 3 solved, 6 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 5168/5168 variables, and 2115 constraints, problems are : Problem set: 3 solved, 6 unsolved in 5019 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 1628/1628 constraints, ReadFeed: 479/479 constraints, PredecessorRefiner: 6/3 constraints, Known Traps: 1/1 constraints]
After SMT, in 8757ms problems are : Problem set: 3 solved, 6 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 35 out of 1628 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1628/1628 places, 5962/5962 transitions.
Graph (complete) has 7332 edges and 1628 vertex of which 1611 are kept as prefixes of interest. Removing 17 places using SCC suffix rule.15 ms
Discarding 17 places :
Also discarding 0 output transitions
Discarding 286 places :
Symmetric choice reduction at 0 with 286 rule applications. Total rules 287 place count 1325 transition count 3824
Iterating global reduction 0 with 286 rules applied. Total rules applied 573 place count 1325 transition count 3824
Ensure Unique test removed 424 transitions
Reduce isomorphic transitions removed 424 transitions.
Iterating post reduction 0 with 424 rules applied. Total rules applied 997 place count 1325 transition count 3400
Discarding 144 places :
Symmetric choice reduction at 1 with 144 rule applications. Total rules 1141 place count 1181 transition count 3112
Iterating global reduction 1 with 144 rules applied. Total rules applied 1285 place count 1181 transition count 3112
Ensure Unique test removed 92 transitions
Reduce isomorphic transitions removed 92 transitions.
Iterating post reduction 1 with 92 rules applied. Total rules applied 1377 place count 1181 transition count 3020
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 1389 place count 1169 transition count 2996
Iterating global reduction 2 with 12 rules applied. Total rules applied 1401 place count 1169 transition count 2996
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 1412 place count 1158 transition count 2974
Iterating global reduction 2 with 11 rules applied. Total rules applied 1423 place count 1158 transition count 2974
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 1434 place count 1147 transition count 2952
Iterating global reduction 2 with 11 rules applied. Total rules applied 1445 place count 1147 transition count 2952
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 1456 place count 1136 transition count 2930
Iterating global reduction 2 with 11 rules applied. Total rules applied 1467 place count 1136 transition count 2930
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 1478 place count 1125 transition count 2908
Iterating global reduction 2 with 11 rules applied. Total rules applied 1489 place count 1125 transition count 2908
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 1500 place count 1114 transition count 2886
Iterating global reduction 2 with 11 rules applied. Total rules applied 1511 place count 1114 transition count 2886
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 1519 place count 1106 transition count 2870
Iterating global reduction 2 with 8 rules applied. Total rules applied 1527 place count 1106 transition count 2870
Discarding 33 places :
Symmetric choice reduction at 2 with 33 rule applications. Total rules 1560 place count 1073 transition count 2744
Iterating global reduction 2 with 33 rules applied. Total rules applied 1593 place count 1073 transition count 2744
Discarding 36 places :
Symmetric choice reduction at 2 with 36 rule applications. Total rules 1629 place count 1037 transition count 2600
Iterating global reduction 2 with 36 rules applied. Total rules applied 1665 place count 1037 transition count 2600
Discarding 36 places :
Symmetric choice reduction at 2 with 36 rule applications. Total rules 1701 place count 1001 transition count 2514
Iterating global reduction 2 with 36 rules applied. Total rules applied 1737 place count 1001 transition count 2514
Discarding 36 places :
Symmetric choice reduction at 2 with 36 rule applications. Total rules 1773 place count 965 transition count 2442
Iterating global reduction 2 with 36 rules applied. Total rules applied 1809 place count 965 transition count 2442
Discarding 36 places :
Symmetric choice reduction at 2 with 36 rule applications. Total rules 1845 place count 929 transition count 2370
Iterating global reduction 2 with 36 rules applied. Total rules applied 1881 place count 929 transition count 2370
Discarding 36 places :
Symmetric choice reduction at 2 with 36 rule applications. Total rules 1917 place count 893 transition count 2298
Iterating global reduction 2 with 36 rules applied. Total rules applied 1953 place count 893 transition count 2298
Discarding 35 places :
Symmetric choice reduction at 2 with 35 rule applications. Total rules 1988 place count 858 transition count 2228
Iterating global reduction 2 with 35 rules applied. Total rules applied 2023 place count 858 transition count 2228
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 2030 place count 851 transition count 2214
Iterating global reduction 2 with 7 rules applied. Total rules applied 2037 place count 851 transition count 2214
Drop transitions (Redundant composition of simpler transitions.) removed 56 transitions
Redundant transition composition rules discarded 56 transitions
Iterating global reduction 2 with 56 rules applied. Total rules applied 2093 place count 851 transition count 2158
Applied a total of 2093 rules in 1583 ms. Remains 851 /1628 variables (removed 777) and now considering 2158/5962 (removed 3804) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1592 ms. Remains : 851/1628 places, 2158/5962 transitions.
RANDOM walk for 40003 steps (8 resets) in 349 ms. (114 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 146 ms. (272 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 94 ms. (421 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 91 ms. (434 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 110 ms. (360 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 104 ms. (380 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (8 resets) in 63 ms. (625 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 211049 steps, run timeout after 3001 ms. (steps per millisecond=70 ) properties seen :0 out of 6
Probabilistic random walk after 211049 steps, saw 137002 distinct states, run finished after 3007 ms. (steps per millisecond=70 ) properties seen :0
[2024-05-31 21:22:48] [INFO ] Flow matrix only has 1459 transitions (discarded 699 similar events)
// Phase 1: matrix 1459 rows 851 cols
[2024-05-31 21:22:48] [INFO ] Computed 2 invariants in 11 ms
[2024-05-31 21:22:48] [INFO ] State equation strengthened by 349 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 379/414 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/414 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 58/472 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/472 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 1103/1575 variables, 472/474 constraints. Problems are: Problem set: 0 solved, 6 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/1575 variables, 282/756 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1575 variables, 0/756 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 587/2162 variables, 253/1009 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2162 variables, 67/1076 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2162 variables, 0/1076 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 145/2307 variables, 124/1200 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2307 variables, 0/1200 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 3/2310 variables, 2/1202 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2310 variables, 0/1202 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 0/2310 variables, 0/1202 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2310/2310 variables, and 1202 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1490 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 851/851 constraints, ReadFeed: 349/349 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 379/414 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/414 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 58/472 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/472 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 1103/1575 variables, 472/474 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1575 variables, 282/756 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1575 variables, 0/756 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 587/2162 variables, 253/1009 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2162 variables, 67/1076 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2162 variables, 6/1082 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-31 21:22:51] [INFO ] Deduced a trap composed of 131 places in 189 ms of which 3 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/2162 variables, 1/1083 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2162 variables, 0/1083 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 145/2307 variables, 124/1207 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2307 variables, 0/1207 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 3/2310 variables, 2/1209 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2310 variables, 0/1209 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (OVERLAPS) 0/2310 variables, 0/1209 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2310/2310 variables, and 1209 constraints, problems are : Problem set: 0 solved, 6 unsolved in 4157 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 851/851 constraints, ReadFeed: 349/349 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 1/1 constraints]
After SMT, in 5804ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 12 ms.
Support contains 35 out of 851 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 851/851 places, 2158/2158 transitions.
Applied a total of 0 rules in 143 ms. Remains 851 /851 variables (removed 0) and now considering 2158/2158 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 143 ms. Remains : 851/851 places, 2158/2158 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 851/851 places, 2158/2158 transitions.
Applied a total of 0 rules in 136 ms. Remains 851 /851 variables (removed 0) and now considering 2158/2158 (removed 0) transitions.
[2024-05-31 21:22:54] [INFO ] Flow matrix only has 1459 transitions (discarded 699 similar events)
[2024-05-31 21:22:54] [INFO ] Invariant cache hit.
[2024-05-31 21:22:54] [INFO ] Implicit Places using invariants in 455 ms returned []
[2024-05-31 21:22:54] [INFO ] Flow matrix only has 1459 transitions (discarded 699 similar events)
[2024-05-31 21:22:54] [INFO ] Invariant cache hit.
[2024-05-31 21:22:55] [INFO ] State equation strengthened by 349 read => feed constraints.
[2024-05-31 21:22:57] [INFO ] Implicit Places using invariants and state equation in 3127 ms returned []
Implicit Place search using SMT with State Equation took 3595 ms to find 0 implicit places.
[2024-05-31 21:22:58] [INFO ] Redundant transitions in 99 ms returned []
Running 2156 sub problems to find dead transitions.
[2024-05-31 21:22:58] [INFO ] Flow matrix only has 1459 transitions (discarded 699 similar events)
[2024-05-31 21:22:58] [INFO ] Invariant cache hit.
[2024-05-31 21:22:58] [INFO ] State equation strengthened by 349 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/851 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2156 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/851 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2156 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 851/2310 variables, and 2 constraints, problems are : Problem set: 0 solved, 2156 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/851 constraints, ReadFeed: 0/349 constraints, PredecessorRefiner: 2156/2156 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2156 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/851 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2156 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/851 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2156 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 851/2310 variables, and 2 constraints, problems are : Problem set: 0 solved, 2156 unsolved in 30040 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/851 constraints, ReadFeed: 0/349 constraints, PredecessorRefiner: 0/2156 constraints, Known Traps: 0/0 constraints]
After SMT, in 70942ms problems are : Problem set: 0 solved, 2156 unsolved
Search for dead transitions found 0 dead transitions in 70962ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 74816 ms. Remains : 851/851 places, 2158/2158 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 1260 edges and 851 vertex of which 183 / 851 are part of one of the 61 SCC in 4 ms
Free SCC test removed 122 places
Drop transitions (Empty/Sink Transition effects.) removed 305 transitions
Ensure Unique test removed 577 transitions
Reduce isomorphic transitions removed 882 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 37 transitions
Trivial Post-agglo rules discarded 37 transitions
Performed 37 trivial Post agglomeration. Transition count delta: 37
Iterating post reduction 0 with 37 rules applied. Total rules applied 38 place count 729 transition count 1239
Reduce places removed 37 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 38 rules applied. Total rules applied 76 place count 692 transition count 1238
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 77 place count 691 transition count 1238
Performed 149 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 149 Pre rules applied. Total rules applied 77 place count 691 transition count 1089
Deduced a syphon composed of 149 places in 1 ms
Reduce places removed 149 places and 0 transitions.
Iterating global reduction 3 with 298 rules applied. Total rules applied 375 place count 542 transition count 1089
Discarding 60 places :
Symmetric choice reduction at 3 with 60 rule applications. Total rules 435 place count 482 transition count 1029
Iterating global reduction 3 with 60 rules applied. Total rules applied 495 place count 482 transition count 1029
Ensure Unique test removed 120 transitions
Reduce isomorphic transitions removed 120 transitions.
Iterating post reduction 3 with 120 rules applied. Total rules applied 615 place count 482 transition count 909
Performed 136 Post agglomeration using F-continuation condition.Transition count delta: 136
Deduced a syphon composed of 136 places in 0 ms
Reduce places removed 136 places and 0 transitions.
Iterating global reduction 4 with 272 rules applied. Total rules applied 887 place count 346 transition count 773
Discarding 62 places :
Symmetric choice reduction at 4 with 62 rule applications. Total rules 949 place count 284 transition count 649
Iterating global reduction 4 with 62 rules applied. Total rules applied 1011 place count 284 transition count 649
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 1013 place count 284 transition count 647
Discarding 59 places :
Symmetric choice reduction at 5 with 59 rule applications. Total rules 1072 place count 225 transition count 529
Iterating global reduction 5 with 59 rules applied. Total rules applied 1131 place count 225 transition count 529
Discarding 59 places :
Symmetric choice reduction at 5 with 59 rule applications. Total rules 1190 place count 166 transition count 411
Iterating global reduction 5 with 59 rules applied. Total rules applied 1249 place count 166 transition count 411
Ensure Unique test removed 57 transitions
Reduce isomorphic transitions removed 57 transitions.
Iterating post reduction 5 with 57 rules applied. Total rules applied 1306 place count 166 transition count 354
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 1308 place count 165 transition count 353
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 6 with 46 rules applied. Total rules applied 1354 place count 142 transition count 362
Drop transitions (Redundant composition of simpler transitions.) removed 22 transitions
Redundant transition composition rules discarded 22 transitions
Iterating global reduction 6 with 22 rules applied. Total rules applied 1376 place count 142 transition count 340
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1377 place count 141 transition count 339
Iterating global reduction 6 with 1 rules applied. Total rules applied 1378 place count 141 transition count 339
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 1380 place count 141 transition count 337
Free-agglomeration rule applied 2 times.
Iterating global reduction 7 with 2 rules applied. Total rules applied 1382 place count 141 transition count 335
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 1384 place count 139 transition count 335
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 8 with 2 rules applied. Total rules applied 1386 place count 139 transition count 335
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 8 with 2 rules applied. Total rules applied 1388 place count 139 transition count 333
Applied a total of 1388 rules in 154 ms. Remains 139 /851 variables (removed 712) and now considering 333/2158 (removed 1825) transitions.
Running SMT prover for 6 properties.
// Phase 1: matrix 333 rows 139 cols
[2024-05-31 21:24:09] [INFO ] Computed 2 invariants in 4 ms
[2024-05-31 21:24:09] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-31 21:24:09] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-31 21:24:09] [INFO ] After 155ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-31 21:24:09] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-31 21:24:09] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-31 21:24:09] [INFO ] After 200ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2024-05-31 21:24:09] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-31 21:24:09] [INFO ] After 151ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :6
TRAPS : Iteration 0
[2024-05-31 21:24:09] [INFO ] After 350ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
[2024-05-31 21:24:10] [INFO ] After 763ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Over-approximation ignoring read arcs solved 0 properties in 1111 ms.
[2024-05-31 21:24:10] [INFO ] Export to MCC of 6 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 4 ms.
[2024-05-31 21:24:10] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 851 places, 2158 transitions and 8758 arcs took 12 ms.
[2024-05-31 21:24:10] [INFO ] Flatten gal took : 177 ms
Total runtime 98339 ms.
There are residual formulas that ITS could not solve within timeout
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 : FunctionPointer-PT-c002-ReachabilityFireability-2023-02
Could not compute solution for formula : FunctionPointer-PT-c002-ReachabilityFireability-2023-05
Could not compute solution for formula : FunctionPointer-PT-c002-ReachabilityFireability-2024-07
Could not compute solution for formula : FunctionPointer-PT-c002-ReachabilityFireability-2023-08
Could not compute solution for formula : FunctionPointer-PT-c002-ReachabilityFireability-2023-11
Could not compute solution for formula : FunctionPointer-PT-c002-ReachabilityFireability-2024-14

BK_STOP 1717190650977

--------------------
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 ReachabilityFireability -timeout 360 -rebuildPNML
mcc2024
rfs formula name FunctionPointer-PT-c002-ReachabilityFireability-2023-02
rfs formula type EF
rfs formula formula --invariant=/tmp/553/inv_0_
rfs formula name FunctionPointer-PT-c002-ReachabilityFireability-2023-05
rfs formula type EF
rfs formula formula --invariant=/tmp/553/inv_1_
rfs formula name FunctionPointer-PT-c002-ReachabilityFireability-2024-07
rfs formula type EF
rfs formula formula --invariant=/tmp/553/inv_2_
rfs formula name FunctionPointer-PT-c002-ReachabilityFireability-2023-08
rfs formula type EF
rfs formula formula --invariant=/tmp/553/inv_3_
rfs formula name FunctionPointer-PT-c002-ReachabilityFireability-2023-11
rfs formula type EF
rfs formula formula --invariant=/tmp/553/inv_4_
rfs formula name FunctionPointer-PT-c002-ReachabilityFireability-2024-14
rfs formula type EF
rfs formula formula --invariant=/tmp/553/inv_5_
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="FunctionPointer-PT-c002"
export BK_EXAMINATION="ReachabilityFireability"
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 FunctionPointer-PT-c002, 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 r496-tall-171640603000279"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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