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-171640602700111.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 FlexibleBarrier-PT-16b, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r496-tall-171640602700111
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.5M
-rw-r--r-- 1 mcc users 7.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K May 19 07:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 19 15:53 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 19 07:18 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 18:22 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K Apr 13 08:03 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 185K Apr 13 08:03 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.7K Apr 13 08:02 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 72K Apr 13 08:02 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:45 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:45 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 945K 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 FlexibleBarrier-PT-16b-ReachabilityFireability-2024-00
FORMULA_NAME FlexibleBarrier-PT-16b-ReachabilityFireability-2024-01
FORMULA_NAME FlexibleBarrier-PT-16b-ReachabilityFireability-2024-02
FORMULA_NAME FlexibleBarrier-PT-16b-ReachabilityFireability-2024-03
FORMULA_NAME FlexibleBarrier-PT-16b-ReachabilityFireability-2024-04
FORMULA_NAME FlexibleBarrier-PT-16b-ReachabilityFireability-2024-05
FORMULA_NAME FlexibleBarrier-PT-16b-ReachabilityFireability-2024-06
FORMULA_NAME FlexibleBarrier-PT-16b-ReachabilityFireability-2024-07
FORMULA_NAME FlexibleBarrier-PT-16b-ReachabilityFireability-2024-08
FORMULA_NAME FlexibleBarrier-PT-16b-ReachabilityFireability-2024-09
FORMULA_NAME FlexibleBarrier-PT-16b-ReachabilityFireability-2024-10
FORMULA_NAME FlexibleBarrier-PT-16b-ReachabilityFireability-2024-11
FORMULA_NAME FlexibleBarrier-PT-16b-ReachabilityFireability-2024-12
FORMULA_NAME FlexibleBarrier-PT-16b-ReachabilityFireability-2024-13
FORMULA_NAME FlexibleBarrier-PT-16b-ReachabilityFireability-2024-14
FORMULA_NAME FlexibleBarrier-PT-16b-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717183312878

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FlexibleBarrier-PT-16b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 19:21:53] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-31 19:21:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 19:21:54] [INFO ] Load time of PNML (sax parser for PT used): 228 ms
[2024-05-31 19:21:54] [INFO ] Transformed 3472 places.
[2024-05-31 19:21:54] [INFO ] Transformed 4001 transitions.
[2024-05-31 19:21:54] [INFO ] Found NUPN structural information;
[2024-05-31 19:21:54] [INFO ] Parsed PT model containing 3472 places and 4001 transitions and 10043 arcs in 398 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 (362 resets) in 2076 ms. (19 steps per ms) remains 13/16 properties
FORMULA FlexibleBarrier-PT-16b-ReachabilityFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-16b-ReachabilityFireability-2024-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-16b-ReachabilityFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (30 resets) in 377 ms. (105 steps per ms) remains 12/13 properties
FORMULA FlexibleBarrier-PT-16b-ReachabilityFireability-2024-14 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (30 resets) in 598 ms. (66 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (31 resets) in 99 ms. (400 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 91 ms. (434 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (29 resets) in 64 ms. (615 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (30 resets) in 115 ms. (344 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (29 resets) in 126 ms. (314 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (30 resets) in 73 ms. (540 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (28 resets) in 63 ms. (625 steps per ms) remains 11/12 properties
FORMULA FlexibleBarrier-PT-16b-ReachabilityFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (28 resets) in 100 ms. (396 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (28 resets) in 64 ms. (615 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (29 resets) in 64 ms. (615 steps per ms) remains 11/11 properties
// Phase 1: matrix 4001 rows 3472 cols
[2024-05-31 19:21:56] [INFO ] Computed 18 invariants in 110 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/189 variables, 189/189 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/189 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (OVERLAPS) 3283/3472 variables, 18/207 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/3472 variables, 3283/3490 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3472 variables, 0/3490 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 4001/7473 variables, 3472/6962 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/7473 variables, 0/6962 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 7473/7473 variables, and 6962 constraints, problems are : Problem set: 0 solved, 11 unsolved in 5122 ms.
Refiners :[Domain max(s): 3472/3472 constraints, Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 3472/3472 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 11 unsolved
Problem FlexibleBarrier-PT-16b-ReachabilityFireability-2024-08 is UNSAT
FORMULA FlexibleBarrier-PT-16b-ReachabilityFireability-2024-08 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 0 (INCLUDED_ONLY) 0/189 variables, 189/189 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/189 variables, 0/189 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 2 (OVERLAPS) 3283/3472 variables, 18/207 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/3472 variables, 3283/3490 constraints. Problems are: Problem set: 1 solved, 10 unsolved
[2024-05-31 19:22:02] [INFO ] Deduced a trap composed of 28 places in 202 ms of which 27 ms to minimize.
[2024-05-31 19:22:04] [INFO ] Deduced a trap composed of 1262 places in 1713 ms of which 21 ms to minimize.
[2024-05-31 19:22:06] [INFO ] Deduced a trap composed of 1330 places in 1796 ms of which 16 ms to minimize.
SMT process timed out in 10961ms, After SMT, problems are : Problem set: 1 solved, 10 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 174 out of 3472 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3472/3472 places, 4001/4001 transitions.
Graph (trivial) has 2348 edges and 3472 vertex of which 18 / 3472 are part of one of the 3 SCC in 13 ms
Free SCC test removed 15 places
Drop transitions (Empty/Sink Transition effects.) removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 579 transitions
Trivial Post-agglo rules discarded 579 transitions
Performed 579 trivial Post agglomeration. Transition count delta: 579
Iterating post reduction 0 with 579 rules applied. Total rules applied 580 place count 3457 transition count 3404
Reduce places removed 579 places and 0 transitions.
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Iterating post reduction 1 with 606 rules applied. Total rules applied 1186 place count 2878 transition count 3377
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 2 with 27 rules applied. Total rules applied 1213 place count 2851 transition count 3377
Performed 431 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 431 Pre rules applied. Total rules applied 1213 place count 2851 transition count 2946
Deduced a syphon composed of 431 places in 5 ms
Reduce places removed 431 places and 0 transitions.
Iterating global reduction 3 with 862 rules applied. Total rules applied 2075 place count 2420 transition count 2946
Discarding 1289 places :
Symmetric choice reduction at 3 with 1289 rule applications. Total rules 3364 place count 1131 transition count 1657
Iterating global reduction 3 with 1289 rules applied. Total rules applied 4653 place count 1131 transition count 1657
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 4654 place count 1131 transition count 1656
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 4654 place count 1131 transition count 1652
Deduced a syphon composed of 4 places in 3 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 4662 place count 1127 transition count 1652
Discarding 163 places :
Symmetric choice reduction at 4 with 163 rule applications. Total rules 4825 place count 964 transition count 1489
Iterating global reduction 4 with 163 rules applied. Total rules applied 4988 place count 964 transition count 1489
Ensure Unique test removed 142 transitions
Reduce isomorphic transitions removed 142 transitions.
Iterating post reduction 4 with 142 rules applied. Total rules applied 5130 place count 964 transition count 1347
Performed 121 Post agglomeration using F-continuation condition.Transition count delta: 121
Deduced a syphon composed of 121 places in 1 ms
Reduce places removed 121 places and 0 transitions.
Iterating global reduction 5 with 242 rules applied. Total rules applied 5372 place count 843 transition count 1226
Drop transitions (Empty/Sink Transition effects.) removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 5 with 14 rules applied. Total rules applied 5386 place count 843 transition count 1212
Discarding 12 places :
Symmetric choice reduction at 6 with 12 rule applications. Total rules 5398 place count 831 transition count 1200
Iterating global reduction 6 with 12 rules applied. Total rules applied 5410 place count 831 transition count 1200
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 6 with 24 rules applied. Total rules applied 5434 place count 819 transition count 1200
Free-agglomeration rule applied 66 times.
Iterating global reduction 6 with 66 rules applied. Total rules applied 5500 place count 819 transition count 1134
Reduce places removed 66 places and 0 transitions.
Iterating post reduction 6 with 66 rules applied. Total rules applied 5566 place count 753 transition count 1134
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 7 with 11 rules applied. Total rules applied 5577 place count 753 transition count 1123
Partial Free-agglomeration rule applied 9 times.
Drop transitions (Partial Free agglomeration) removed 9 transitions
Iterating global reduction 7 with 9 rules applied. Total rules applied 5586 place count 753 transition count 1123
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 5587 place count 752 transition count 1122
Applied a total of 5587 rules in 954 ms. Remains 752 /3472 variables (removed 2720) and now considering 1122/4001 (removed 2879) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 967 ms. Remains : 752/3472 places, 1122/4001 transitions.
RANDOM walk for 40000 steps (873 resets) in 926 ms. (43 steps per ms) remains 9/10 properties
FORMULA FlexibleBarrier-PT-16b-ReachabilityFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (37 resets) in 142 ms. (279 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (38 resets) in 177 ms. (224 steps per ms) remains 8/9 properties
FORMULA FlexibleBarrier-PT-16b-ReachabilityFireability-2024-00 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (39 resets) in 54 ms. (727 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (19 resets) in 43 ms. (909 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (39 resets) in 40 ms. (975 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (36 resets) in 51 ms. (769 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (38 resets) in 119 ms. (333 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (39 resets) in 118 ms. (336 steps per ms) remains 7/8 properties
FORMULA FlexibleBarrier-PT-16b-ReachabilityFireability-2024-09 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (39 resets) in 77 ms. (512 steps per ms) remains 7/7 properties
[2024-05-31 19:22:08] [INFO ] Flow matrix only has 1121 transitions (discarded 1 similar events)
// Phase 1: matrix 1121 rows 752 cols
[2024-05-31 19:22:08] [INFO ] Computed 18 invariants in 17 ms
[2024-05-31 19:22:08] [INFO ] State equation strengthened by 29 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 616/750 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/750 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 1120/1870 variables, 750/767 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1870 variables, 29/796 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1870 variables, 0/796 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 3/1873 variables, 2/798 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1873 variables, 1/799 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1873 variables, 0/799 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 0/1873 variables, 0/799 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1873/1873 variables, and 799 constraints, problems are : Problem set: 0 solved, 7 unsolved in 1113 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 752/752 constraints, ReadFeed: 29/29 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 616/750 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-31 19:22:10] [INFO ] Deduced a trap composed of 313 places in 257 ms of which 4 ms to minimize.
[2024-05-31 19:22:10] [INFO ] Deduced a trap composed of 290 places in 257 ms of which 4 ms to minimize.
[2024-05-31 19:22:10] [INFO ] Deduced a trap composed of 294 places in 214 ms of which 4 ms to minimize.
[2024-05-31 19:22:10] [INFO ] Deduced a trap composed of 40 places in 193 ms of which 3 ms to minimize.
[2024-05-31 19:22:11] [INFO ] Deduced a trap composed of 87 places in 184 ms of which 4 ms to minimize.
[2024-05-31 19:22:11] [INFO ] Deduced a trap composed of 49 places in 61 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/750 variables, 6/23 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-31 19:22:11] [INFO ] Deduced a trap composed of 148 places in 154 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/750 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-31 19:22:11] [INFO ] Deduced a trap composed of 54 places in 164 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/750 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/750 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 1120/1870 variables, 750/775 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1870 variables, 29/804 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1870 variables, 5/809 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1870 variables, 0/809 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (OVERLAPS) 3/1873 variables, 2/811 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1873 variables, 1/812 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1873 variables, 2/814 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-31 19:22:15] [INFO ] Deduced a trap composed of 17 places in 147 ms of which 3 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/1873 variables, 1/815 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1873 variables, 0/815 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (OVERLAPS) 0/1873 variables, 0/815 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1873/1873 variables, and 815 constraints, problems are : Problem set: 0 solved, 7 unsolved in 7731 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 752/752 constraints, ReadFeed: 29/29 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 9/9 constraints]
After SMT, in 8960ms problems are : Problem set: 0 solved, 7 unsolved
Fused 7 Parikh solutions to 6 different solutions.
FORMULA FlexibleBarrier-PT-16b-ReachabilityFireability-2024-13 FALSE TECHNIQUES PARIKH_WALK
FORMULA FlexibleBarrier-PT-16b-ReachabilityFireability-2024-12 FALSE TECHNIQUES PARIKH_WALK
FORMULA FlexibleBarrier-PT-16b-ReachabilityFireability-2024-02 TRUE TECHNIQUES PARIKH_WALK
FORMULA FlexibleBarrier-PT-16b-ReachabilityFireability-2024-15 TRUE TECHNIQUES PARIKH_WALK
FORMULA FlexibleBarrier-PT-16b-ReachabilityFireability-2024-04 TRUE TECHNIQUES PARIKH_WALK
FORMULA FlexibleBarrier-PT-16b-ReachabilityFireability-2024-03 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 6 properties in 2842 ms.
Support contains 39 out of 752 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 752/752 places, 1122/1122 transitions.
Graph (trivial) has 343 edges and 752 vertex of which 22 / 752 are part of one of the 9 SCC in 1 ms
Free SCC test removed 13 places
Drop transitions (Empty/Sink Transition effects.) removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 24 rules applied. Total rules applied 25 place count 739 transition count 1076
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 49 place count 715 transition count 1076
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 49 place count 715 transition count 1069
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 63 place count 708 transition count 1069
Discarding 65 places :
Symmetric choice reduction at 2 with 65 rule applications. Total rules 128 place count 643 transition count 1004
Iterating global reduction 2 with 65 rules applied. Total rules applied 193 place count 643 transition count 1004
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 204 place count 643 transition count 993
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 3 with 59 rules applied. Total rules applied 263 place count 613 transition count 964
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (trivial) has 283 edges and 613 vertex of which 31 / 613 are part of one of the 11 SCC in 1 ms
Free SCC test removed 20 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 3 with 8 rules applied. Total rules applied 271 place count 593 transition count 957
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 31 transitions
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 4 with 44 rules applied. Total rules applied 315 place count 589 transition count 917
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 17 Pre rules applied. Total rules applied 315 place count 589 transition count 900
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 5 with 34 rules applied. Total rules applied 349 place count 572 transition count 900
Discarding 40 places :
Symmetric choice reduction at 5 with 40 rule applications. Total rules 389 place count 532 transition count 860
Iterating global reduction 5 with 40 rules applied. Total rules applied 429 place count 532 transition count 860
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 5 with 40 rules applied. Total rules applied 469 place count 532 transition count 820
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 6 with 38 rules applied. Total rules applied 507 place count 513 transition count 801
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 508 place count 513 transition count 800
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 7 with 6 rules applied. Total rules applied 514 place count 510 transition count 800
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 7 with 6 rules applied. Total rules applied 520 place count 510 transition count 794
Drop transitions (Redundant composition of simpler transitions.) removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 8 with 14 rules applied. Total rules applied 534 place count 510 transition count 780
Free-agglomeration rule applied 174 times.
Iterating global reduction 8 with 174 rules applied. Total rules applied 708 place count 510 transition count 606
Reduce places removed 177 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 8 with 196 rules applied. Total rules applied 904 place count 333 transition count 587
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 9 with 8 rules applied. Total rules applied 912 place count 329 transition count 583
Discarding 62 places :
Symmetric choice reduction at 10 with 62 rule applications. Total rules 974 place count 267 transition count 521
Iterating global reduction 10 with 62 rules applied. Total rules applied 1036 place count 267 transition count 521
Ensure Unique test removed 62 transitions
Reduce isomorphic transitions removed 62 transitions.
Iterating post reduction 10 with 62 rules applied. Total rules applied 1098 place count 267 transition count 459
Drop transitions (Redundant composition of simpler transitions.) removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 11 with 21 rules applied. Total rules applied 1119 place count 267 transition count 438
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 1120 place count 266 transition count 437
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 11 with 2 rules applied. Total rules applied 1122 place count 265 transition count 436
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 12 with 2 rules applied. Total rules applied 1124 place count 264 transition count 435
Discarding 13 places :
Symmetric choice reduction at 13 with 13 rule applications. Total rules 1137 place count 251 transition count 422
Iterating global reduction 13 with 13 rules applied. Total rules applied 1150 place count 251 transition count 422
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 13 with 13 rules applied. Total rules applied 1163 place count 251 transition count 409
Applied a total of 1163 rules in 247 ms. Remains 251 /752 variables (removed 501) and now considering 409/1122 (removed 713) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 247 ms. Remains : 251/752 places, 409/1122 transitions.
RANDOM walk for 40000 steps (1843 resets) in 195 ms. (204 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (83 resets) in 129 ms. (307 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1618344 steps, run timeout after 3001 ms. (steps per millisecond=539 ) properties seen :0 out of 1
Probabilistic random walk after 1618344 steps, saw 861530 distinct states, run finished after 3004 ms. (steps per millisecond=538 ) properties seen :0
// Phase 1: matrix 409 rows 251 cols
[2024-05-31 19:22:23] [INFO ] Computed 13 invariants in 6 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 212/251 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/251 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 409/660 variables, 251/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/660 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 0/660 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 660/660 variables, and 264 constraints, problems are : Problem set: 0 solved, 1 unsolved in 141 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 251/251 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/39 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 212/251 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/251 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 409/660 variables, 251/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/660 variables, 1/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 19:22:24] [INFO ] Deduced a trap composed of 172 places in 80 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/660 variables, 1/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/660 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/660 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 660/660 variables, and 266 constraints, problems are : Problem set: 0 solved, 1 unsolved in 462 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 251/251 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 623ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 9 ms.
Support contains 39 out of 251 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 251/251 places, 409/409 transitions.
Applied a total of 0 rules in 8 ms. Remains 251 /251 variables (removed 0) and now considering 409/409 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 251/251 places, 409/409 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 251/251 places, 409/409 transitions.
Applied a total of 0 rules in 8 ms. Remains 251 /251 variables (removed 0) and now considering 409/409 (removed 0) transitions.
[2024-05-31 19:22:24] [INFO ] Invariant cache hit.
[2024-05-31 19:22:24] [INFO ] Implicit Places using invariants in 114 ms returned []
[2024-05-31 19:22:24] [INFO ] Invariant cache hit.
[2024-05-31 19:22:24] [INFO ] Implicit Places using invariants and state equation in 201 ms returned []
Implicit Place search using SMT with State Equation took 324 ms to find 0 implicit places.
[2024-05-31 19:22:24] [INFO ] Redundant transitions in 58 ms returned [273, 274, 277, 278, 281, 282]
Found 6 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 6 transitions
Redundant transitions reduction (with SMT) removed 6 transitions.
Running 389 sub problems to find dead transitions.
// Phase 1: matrix 403 rows 251 cols
[2024-05-31 19:22:24] [INFO ] Computed 13 invariants in 3 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/247 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/247 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 2 (OVERLAPS) 4/251 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 389 unsolved
[2024-05-31 19:22:29] [INFO ] Deduced a trap composed of 155 places in 80 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/251 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/251 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 5 (OVERLAPS) 403/654 variables, 251/265 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/654 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 7 (OVERLAPS) 0/654 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 389 unsolved
No progress, stopping.
After SMT solving in domain Real declared 654/654 variables, and 265 constraints, problems are : Problem set: 0 solved, 389 unsolved in 16372 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 251/251 constraints, PredecessorRefiner: 389/389 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 389 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/247 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/247 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 2 (OVERLAPS) 4/251 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/251 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/251 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 5 (OVERLAPS) 403/654 variables, 251/265 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/654 variables, 389/654 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/654 variables, 0/654 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 8 (OVERLAPS) 0/654 variables, 0/654 constraints. Problems are: Problem set: 0 solved, 389 unsolved
No progress, stopping.
After SMT solving in domain Int declared 654/654 variables, and 654 constraints, problems are : Problem set: 0 solved, 389 unsolved in 16930 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 251/251 constraints, PredecessorRefiner: 389/389 constraints, Known Traps: 1/1 constraints]
After SMT, in 33707ms problems are : Problem set: 0 solved, 389 unsolved
Search for dead transitions found 0 dead transitions in 33711ms
Starting structural reductions in REACHABILITY mode, iteration 1 : 251/251 places, 403/409 transitions.
Applied a total of 0 rules in 13 ms. Remains 251 /251 variables (removed 0) and now considering 403/403 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 34124 ms. Remains : 251/251 places, 403/409 transitions.
RANDOM walk for 40000 steps (1830 resets) in 180 ms. (220 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (84 resets) in 73 ms. (540 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1689876 steps, run timeout after 3027 ms. (steps per millisecond=558 ) properties seen :0 out of 1
Probabilistic random walk after 1689876 steps, saw 904541 distinct states, run finished after 3027 ms. (steps per millisecond=558 ) properties seen :0
[2024-05-31 19:23:01] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 212/251 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/251 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 403/654 variables, 251/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/654 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 0/654 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 654/654 variables, and 264 constraints, problems are : Problem set: 0 solved, 1 unsolved in 142 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 251/251 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/39 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 212/251 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 19:23:01] [INFO ] Deduced a trap composed of 172 places in 78 ms of which 2 ms to minimize.
[2024-05-31 19:23:01] [INFO ] Deduced a trap composed of 155 places in 81 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/251 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/251 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 403/654 variables, 251/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/654 variables, 1/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 19:23:02] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/654 variables, 1/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/654 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/654 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 654/654 variables, and 268 constraints, problems are : Problem set: 0 solved, 1 unsolved in 561 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 251/251 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
After SMT, in 717ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 752 steps, including 48 resets, run visited all 1 properties in 8 ms. (steps per millisecond=94 )
FORMULA FlexibleBarrier-PT-16b-ReachabilityFireability-2024-01 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 17 ms.
All properties solved without resorting to model-checking.
Total runtime 68327 ms.
ITS solved all properties within timeout

BK_STOP 1717183382333

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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

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="FlexibleBarrier-PT-16b"
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 FlexibleBarrier-PT-16b, 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-171640602700111"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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