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.r528-tall-171683761200471.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 ShieldPPPs-PT-030A, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r528-tall-171683761200471
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 684K
-rw-r--r-- 1 mcc users 6.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K 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 54K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K May 19 07:16 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 19 16:34 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 19:09 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.9K Apr 13 11:25 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 77K Apr 13 11:25 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.9K Apr 13 11:17 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 78K Apr 13 11:17 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:53 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 265K May 18 16:43 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 ShieldPPPs-PT-030A-ReachabilityFireability-2024-00
FORMULA_NAME ShieldPPPs-PT-030A-ReachabilityFireability-2024-01
FORMULA_NAME ShieldPPPs-PT-030A-ReachabilityFireability-2024-02
FORMULA_NAME ShieldPPPs-PT-030A-ReachabilityFireability-2024-03
FORMULA_NAME ShieldPPPs-PT-030A-ReachabilityFireability-2024-04
FORMULA_NAME ShieldPPPs-PT-030A-ReachabilityFireability-2024-05
FORMULA_NAME ShieldPPPs-PT-030A-ReachabilityFireability-2024-06
FORMULA_NAME ShieldPPPs-PT-030A-ReachabilityFireability-2024-07
FORMULA_NAME ShieldPPPs-PT-030A-ReachabilityFireability-2024-08
FORMULA_NAME ShieldPPPs-PT-030A-ReachabilityFireability-2024-09
FORMULA_NAME ShieldPPPs-PT-030A-ReachabilityFireability-2024-10
FORMULA_NAME ShieldPPPs-PT-030A-ReachabilityFireability-2024-11
FORMULA_NAME ShieldPPPs-PT-030A-ReachabilityFireability-2024-12
FORMULA_NAME ShieldPPPs-PT-030A-ReachabilityFireability-2024-13
FORMULA_NAME ShieldPPPs-PT-030A-ReachabilityFireability-2024-14
FORMULA_NAME ShieldPPPs-PT-030A-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717247000108

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPs-PT-030A
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 13:03:21] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 13:03:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 13:03:21] [INFO ] Load time of PNML (sax parser for PT used): 122 ms
[2024-06-01 13:03:21] [INFO ] Transformed 933 places.
[2024-06-01 13:03:21] [INFO ] Transformed 783 transitions.
[2024-06-01 13:03:21] [INFO ] Found NUPN structural information;
[2024-06-01 13:03:21] [INFO ] Parsed PT model containing 933 places and 783 transitions and 3006 arcs in 249 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 14 ms.
Working with output stream class java.io.PrintStream
FORMULA ShieldPPPs-PT-030A-ReachabilityFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (16 resets) in 1819 ms. (21 steps per ms) remains 3/15 properties
FORMULA ShieldPPPs-PT-030A-ReachabilityFireability-2024-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-030A-ReachabilityFireability-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-030A-ReachabilityFireability-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-030A-ReachabilityFireability-2024-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-030A-ReachabilityFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-030A-ReachabilityFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-030A-ReachabilityFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-030A-ReachabilityFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-030A-ReachabilityFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-030A-ReachabilityFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-030A-ReachabilityFireability-2024-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-030A-ReachabilityFireability-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 669 ms. (59 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 300 ms. (132 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 313 ms. (127 steps per ms) remains 3/3 properties
// Phase 1: matrix 783 rows 933 cols
[2024-06-01 13:03:22] [INFO ] Computed 331 invariants in 22 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 56/56 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/56 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 135/191 variables, 59/115 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/191 variables, 135/250 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/191 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 742/933 variables, 272/522 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/933 variables, 742/1264 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/933 variables, 0/1264 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 783/1716 variables, 933/2197 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1716 variables, 0/2197 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 0/1716 variables, 0/2197 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1716/1716 variables, and 2197 constraints, problems are : Problem set: 0 solved, 3 unsolved in 813 ms.
Refiners :[Domain max(s): 933/933 constraints, Positive P Invariants (semi-flows): 331/331 constraints, State Equation: 933/933 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 56/56 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/56 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 135/191 variables, 59/115 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/191 variables, 135/250 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/191 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 742/933 variables, 272/522 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/933 variables, 742/1264 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 13:03:23] [INFO ] Deduced a trap composed of 12 places in 54 ms of which 9 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/933 variables, 1/1265 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/933 variables, 0/1265 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 783/1716 variables, 933/2198 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1716 variables, 3/2201 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1716 variables, 0/2201 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 0/1716 variables, 0/2201 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1716/1716 variables, and 2201 constraints, problems are : Problem set: 0 solved, 3 unsolved in 2003 ms.
Refiners :[Domain max(s): 933/933 constraints, Positive P Invariants (semi-flows): 331/331 constraints, State Equation: 933/933 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 1/1 constraints]
After SMT, in 2913ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
FORMULA ShieldPPPs-PT-030A-ReachabilityFireability-2024-09 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 3955 ms.
Support contains 52 out of 933 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 933/933 places, 783/783 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 932 transition count 782
Partial Free-agglomeration rule applied 243 times.
Drop transitions (Partial Free agglomeration) removed 243 transitions
Iterating global reduction 0 with 243 rules applied. Total rules applied 245 place count 932 transition count 782
Applied a total of 245 rules in 206 ms. Remains 932 /933 variables (removed 1) and now considering 782/783 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 216 ms. Remains : 932/933 places, 782/783 transitions.
RANDOM walk for 40000 steps (10 resets) in 1214 ms. (32 steps per ms) remains 1/2 properties
FORMULA ShieldPPPs-PT-030A-ReachabilityFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 235 ms. (169 steps per ms) remains 1/1 properties
// Phase 1: matrix 782 rows 932 cols
[2024-06-01 13:03:30] [INFO ] Computed 331 invariants in 34 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 69/97 variables, 28/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 69/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 792/889 variables, 281/406 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/889 variables, 792/1198 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/889 variables, 0/1198 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 43/932 variables, 22/1220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/932 variables, 43/1263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/932 variables, 0/1263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 782/1714 variables, 932/2195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1714 variables, 0/2195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/1714 variables, 0/2195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1714/1714 variables, and 2195 constraints, problems are : Problem set: 0 solved, 1 unsolved in 513 ms.
Refiners :[Domain max(s): 932/932 constraints, Positive P Invariants (semi-flows): 309/309 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 932/932 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/28 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 69/97 variables, 28/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 69/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 13:03:30] [INFO ] Deduced a trap composed of 5 places in 39 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 1/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/97 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 792/889 variables, 281/407 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/889 variables, 792/1199 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 13:03:31] [INFO ] Deduced a trap composed of 12 places in 53 ms of which 2 ms to minimize.
[2024-06-01 13:03:31] [INFO ] Deduced a trap composed of 5 places in 44 ms of which 1 ms to minimize.
[2024-06-01 13:03:31] [INFO ] Deduced a trap composed of 5 places in 40 ms of which 0 ms to minimize.
[2024-06-01 13:03:31] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 0 ms to minimize.
[2024-06-01 13:03:31] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 1 ms to minimize.
[2024-06-01 13:03:31] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/889 variables, 6/1205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/889 variables, 0/1205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 43/932 variables, 22/1227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/932 variables, 43/1270 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 13:03:31] [INFO ] Deduced a trap composed of 5 places in 61 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/932 variables, 1/1271 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 13:03:31] [INFO ] Deduced a trap composed of 7 places in 73 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/932 variables, 1/1272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 13:03:31] [INFO ] Deduced a trap composed of 7 places in 81 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/932 variables, 1/1273 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/932 variables, 0/1273 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 782/1714 variables, 932/2205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1714 variables, 1/2206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 13:03:36] [INFO ] Deduced a trap composed of 7 places in 35 ms of which 7 ms to minimize.
[2024-06-01 13:03:36] [INFO ] Deduced a trap composed of 5 places in 35 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/1714 variables, 2/2208 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1714 variables, 0/2208 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/1714 variables, 0/2208 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1714/1714 variables, and 2208 constraints, problems are : Problem set: 0 solved, 1 unsolved in 6434 ms.
Refiners :[Domain max(s): 932/932 constraints, Positive P Invariants (semi-flows): 309/309 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 932/932 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 12/12 constraints]
After SMT, in 7019ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 737 ms.
Support contains 28 out of 932 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 932/932 places, 782/782 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 931 transition count 781
Partial Free-agglomeration rule applied 9 times.
Drop transitions (Partial Free agglomeration) removed 9 transitions
Iterating global reduction 0 with 9 rules applied. Total rules applied 11 place count 931 transition count 781
Applied a total of 11 rules in 140 ms. Remains 931 /932 variables (removed 1) and now considering 781/782 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 140 ms. Remains : 931/932 places, 781/782 transitions.
RANDOM walk for 40000 steps (9 resets) in 474 ms. (84 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 294 ms. (135 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 251619 steps, run timeout after 3001 ms. (steps per millisecond=83 ) properties seen :0 out of 1
Probabilistic random walk after 251619 steps, saw 221185 distinct states, run finished after 3005 ms. (steps per millisecond=83 ) properties seen :0
// Phase 1: matrix 781 rows 931 cols
[2024-06-01 13:03:41] [INFO ] Computed 331 invariants in 25 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 69/97 variables, 28/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 69/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 793/890 variables, 282/407 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/890 variables, 793/1200 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/890 variables, 0/1200 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 41/931 variables, 21/1221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/931 variables, 41/1262 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/931 variables, 0/1262 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 781/1712 variables, 931/2193 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1712 variables, 0/2193 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/1712 variables, 0/2193 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1712/1712 variables, and 2193 constraints, problems are : Problem set: 0 solved, 1 unsolved in 509 ms.
Refiners :[Domain max(s): 931/931 constraints, Positive P Invariants (semi-flows): 310/310 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 931/931 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/28 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 69/97 variables, 28/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 69/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 13:03:41] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 1/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/97 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 793/890 variables, 282/408 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/890 variables, 793/1201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 13:03:42] [INFO ] Deduced a trap composed of 6 places in 43 ms of which 1 ms to minimize.
[2024-06-01 13:03:42] [INFO ] Deduced a trap composed of 5 places in 37 ms of which 1 ms to minimize.
[2024-06-01 13:03:42] [INFO ] Deduced a trap composed of 8 places in 36 ms of which 1 ms to minimize.
[2024-06-01 13:03:42] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 1 ms to minimize.
[2024-06-01 13:03:42] [INFO ] Deduced a trap composed of 5 places in 35 ms of which 1 ms to minimize.
[2024-06-01 13:03:42] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/890 variables, 6/1207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/890 variables, 0/1207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 41/931 variables, 21/1228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/931 variables, 41/1269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 13:03:42] [INFO ] Deduced a trap composed of 5 places in 36 ms of which 1 ms to minimize.
[2024-06-01 13:03:42] [INFO ] Deduced a trap composed of 7 places in 35 ms of which 1 ms to minimize.
[2024-06-01 13:03:42] [INFO ] Deduced a trap composed of 5 places in 31 ms of which 1 ms to minimize.
[2024-06-01 13:03:42] [INFO ] Deduced a trap composed of 5 places in 33 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/931 variables, 4/1273 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 13:03:42] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/931 variables, 1/1274 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 13:03:42] [INFO ] Deduced a trap composed of 7 places in 37 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/931 variables, 1/1275 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/931 variables, 0/1275 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 781/1712 variables, 931/2206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1712 variables, 1/2207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 13:03:47] [INFO ] Deduced a trap composed of 5 places in 57 ms of which 1 ms to minimize.
[2024-06-01 13:03:47] [INFO ] Deduced a trap composed of 5 places in 66 ms of which 1 ms to minimize.
[2024-06-01 13:03:48] [INFO ] Deduced a trap composed of 5 places in 38 ms of which 0 ms to minimize.
[2024-06-01 13:03:48] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 1 ms to minimize.
[2024-06-01 13:03:48] [INFO ] Deduced a trap composed of 7 places in 36 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/1712 variables, 5/2212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1712 variables, 0/2212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/1712 variables, 0/2212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1712/1712 variables, and 2212 constraints, problems are : Problem set: 0 solved, 1 unsolved in 6915 ms.
Refiners :[Domain max(s): 931/931 constraints, Positive P Invariants (semi-flows): 310/310 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 931/931 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 18/18 constraints]
After SMT, in 7465ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 752 ms.
Support contains 28 out of 931 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 931/931 places, 781/781 transitions.
Applied a total of 0 rules in 32 ms. Remains 931 /931 variables (removed 0) and now considering 781/781 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 931/931 places, 781/781 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 931/931 places, 781/781 transitions.
Applied a total of 0 rules in 31 ms. Remains 931 /931 variables (removed 0) and now considering 781/781 (removed 0) transitions.
[2024-06-01 13:03:49] [INFO ] Invariant cache hit.
[2024-06-01 13:03:50] [INFO ] Implicit Places using invariants in 592 ms returned []
[2024-06-01 13:03:50] [INFO ] Invariant cache hit.
[2024-06-01 13:03:51] [INFO ] Implicit Places using invariants and state equation in 1113 ms returned []
Implicit Place search using SMT with State Equation took 1715 ms to find 0 implicit places.
[2024-06-01 13:03:51] [INFO ] Redundant transitions in 39 ms returned []
Running 780 sub problems to find dead transitions.
[2024-06-01 13:03:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/930 variables, 930/930 constraints. Problems are: Problem set: 0 solved, 780 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/930 variables, 21/951 constraints. Problems are: Problem set: 0 solved, 780 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/930 variables, 0/951 constraints. Problems are: Problem set: 0 solved, 780 unsolved
At refinement iteration 3 (OVERLAPS) 1/931 variables, 310/1261 constraints. Problems are: Problem set: 0 solved, 780 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/931 variables, 1/1262 constraints. Problems are: Problem set: 0 solved, 780 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 931/1712 variables, and 1262 constraints, problems are : Problem set: 0 solved, 780 unsolved in 30024 ms.
Refiners :[Domain max(s): 931/931 constraints, Positive P Invariants (semi-flows): 310/310 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 0/931 constraints, PredecessorRefiner: 780/780 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 780 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/930 variables, 930/930 constraints. Problems are: Problem set: 0 solved, 780 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/930 variables, 21/951 constraints. Problems are: Problem set: 0 solved, 780 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/930 variables, 0/951 constraints. Problems are: Problem set: 0 solved, 780 unsolved
At refinement iteration 3 (OVERLAPS) 1/931 variables, 310/1261 constraints. Problems are: Problem set: 0 solved, 780 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/931 variables, 1/1262 constraints. Problems are: Problem set: 0 solved, 780 unsolved
[2024-06-01 13:04:32] [INFO ] Deduced a trap composed of 5 places in 126 ms of which 3 ms to minimize.
[2024-06-01 13:04:32] [INFO ] Deduced a trap composed of 5 places in 171 ms of which 3 ms to minimize.
[2024-06-01 13:04:32] [INFO ] Deduced a trap composed of 6 places in 124 ms of which 7 ms to minimize.
[2024-06-01 13:04:32] [INFO ] Deduced a trap composed of 5 places in 119 ms of which 3 ms to minimize.
[2024-06-01 13:04:32] [INFO ] Deduced a trap composed of 5 places in 115 ms of which 2 ms to minimize.
[2024-06-01 13:04:32] [INFO ] Deduced a trap composed of 5 places in 110 ms of which 2 ms to minimize.
[2024-06-01 13:04:33] [INFO ] Deduced a trap composed of 5 places in 103 ms of which 3 ms to minimize.
[2024-06-01 13:04:33] [INFO ] Deduced a trap composed of 6 places in 103 ms of which 2 ms to minimize.
[2024-06-01 13:04:33] [INFO ] Deduced a trap composed of 7 places in 104 ms of which 3 ms to minimize.
[2024-06-01 13:04:33] [INFO ] Deduced a trap composed of 5 places in 107 ms of which 2 ms to minimize.
[2024-06-01 13:04:33] [INFO ] Deduced a trap composed of 5 places in 105 ms of which 2 ms to minimize.
[2024-06-01 13:04:33] [INFO ] Deduced a trap composed of 5 places in 109 ms of which 2 ms to minimize.
[2024-06-01 13:04:33] [INFO ] Deduced a trap composed of 5 places in 102 ms of which 2 ms to minimize.
[2024-06-01 13:04:33] [INFO ] Deduced a trap composed of 5 places in 98 ms of which 2 ms to minimize.
[2024-06-01 13:04:33] [INFO ] Deduced a trap composed of 7 places in 100 ms of which 2 ms to minimize.
[2024-06-01 13:04:34] [INFO ] Deduced a trap composed of 7 places in 101 ms of which 2 ms to minimize.
[2024-06-01 13:04:34] [INFO ] Deduced a trap composed of 6 places in 99 ms of which 2 ms to minimize.
[2024-06-01 13:04:34] [INFO ] Deduced a trap composed of 7 places in 96 ms of which 2 ms to minimize.
[2024-06-01 13:04:34] [INFO ] Deduced a trap composed of 7 places in 94 ms of which 2 ms to minimize.
[2024-06-01 13:04:34] [INFO ] Deduced a trap composed of 5 places in 95 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/931 variables, 20/1282 constraints. Problems are: Problem set: 0 solved, 780 unsolved
[2024-06-01 13:04:34] [INFO ] Deduced a trap composed of 5 places in 100 ms of which 2 ms to minimize.
[2024-06-01 13:04:34] [INFO ] Deduced a trap composed of 6 places in 96 ms of which 2 ms to minimize.
[2024-06-01 13:04:34] [INFO ] Deduced a trap composed of 5 places in 92 ms of which 2 ms to minimize.
[2024-06-01 13:04:35] [INFO ] Deduced a trap composed of 5 places in 97 ms of which 2 ms to minimize.
[2024-06-01 13:04:35] [INFO ] Deduced a trap composed of 6 places in 94 ms of which 3 ms to minimize.
[2024-06-01 13:04:35] [INFO ] Deduced a trap composed of 5 places in 91 ms of which 2 ms to minimize.
[2024-06-01 13:04:35] [INFO ] Deduced a trap composed of 5 places in 94 ms of which 2 ms to minimize.
[2024-06-01 13:04:35] [INFO ] Deduced a trap composed of 5 places in 92 ms of which 2 ms to minimize.
[2024-06-01 13:04:35] [INFO ] Deduced a trap composed of 5 places in 89 ms of which 2 ms to minimize.
[2024-06-01 13:04:35] [INFO ] Deduced a trap composed of 6 places in 89 ms of which 1 ms to minimize.
[2024-06-01 13:04:35] [INFO ] Deduced a trap composed of 5 places in 85 ms of which 1 ms to minimize.
[2024-06-01 13:04:35] [INFO ] Deduced a trap composed of 5 places in 84 ms of which 2 ms to minimize.
[2024-06-01 13:04:36] [INFO ] Deduced a trap composed of 6 places in 83 ms of which 2 ms to minimize.
[2024-06-01 13:04:36] [INFO ] Deduced a trap composed of 6 places in 84 ms of which 2 ms to minimize.
[2024-06-01 13:04:36] [INFO ] Deduced a trap composed of 7 places in 83 ms of which 1 ms to minimize.
[2024-06-01 13:04:36] [INFO ] Deduced a trap composed of 5 places in 78 ms of which 2 ms to minimize.
[2024-06-01 13:04:36] [INFO ] Deduced a trap composed of 5 places in 79 ms of which 1 ms to minimize.
[2024-06-01 13:04:36] [INFO ] Deduced a trap composed of 6 places in 76 ms of which 2 ms to minimize.
[2024-06-01 13:04:36] [INFO ] Deduced a trap composed of 5 places in 72 ms of which 2 ms to minimize.
[2024-06-01 13:04:36] [INFO ] Deduced a trap composed of 5 places in 75 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/931 variables, 20/1302 constraints. Problems are: Problem set: 0 solved, 780 unsolved
[2024-06-01 13:04:36] [INFO ] Deduced a trap composed of 7 places in 83 ms of which 2 ms to minimize.
[2024-06-01 13:04:37] [INFO ] Deduced a trap composed of 5 places in 80 ms of which 1 ms to minimize.
[2024-06-01 13:04:37] [INFO ] Deduced a trap composed of 7 places in 77 ms of which 2 ms to minimize.
[2024-06-01 13:04:37] [INFO ] Deduced a trap composed of 7 places in 69 ms of which 2 ms to minimize.
[2024-06-01 13:04:37] [INFO ] Deduced a trap composed of 5 places in 72 ms of which 1 ms to minimize.
[2024-06-01 13:04:37] [INFO ] Deduced a trap composed of 5 places in 68 ms of which 2 ms to minimize.
[2024-06-01 13:04:37] [INFO ] Deduced a trap composed of 6 places in 71 ms of which 1 ms to minimize.
[2024-06-01 13:04:37] [INFO ] Deduced a trap composed of 5 places in 64 ms of which 2 ms to minimize.
[2024-06-01 13:04:37] [INFO ] Deduced a trap composed of 7 places in 69 ms of which 2 ms to minimize.
[2024-06-01 13:04:37] [INFO ] Deduced a trap composed of 7 places in 68 ms of which 2 ms to minimize.
[2024-06-01 13:04:37] [INFO ] Deduced a trap composed of 5 places in 66 ms of which 1 ms to minimize.
[2024-06-01 13:04:37] [INFO ] Deduced a trap composed of 5 places in 61 ms of which 2 ms to minimize.
[2024-06-01 13:04:37] [INFO ] Deduced a trap composed of 10 places in 62 ms of which 1 ms to minimize.
[2024-06-01 13:04:37] [INFO ] Deduced a trap composed of 5 places in 60 ms of which 1 ms to minimize.
[2024-06-01 13:04:38] [INFO ] Deduced a trap composed of 7 places in 56 ms of which 1 ms to minimize.
[2024-06-01 13:04:38] [INFO ] Deduced a trap composed of 5 places in 58 ms of which 2 ms to minimize.
[2024-06-01 13:04:38] [INFO ] Deduced a trap composed of 6 places in 60 ms of which 1 ms to minimize.
[2024-06-01 13:04:38] [INFO ] Deduced a trap composed of 5 places in 60 ms of which 1 ms to minimize.
[2024-06-01 13:04:38] [INFO ] Deduced a trap composed of 7 places in 52 ms of which 1 ms to minimize.
[2024-06-01 13:04:38] [INFO ] Deduced a trap composed of 7 places in 52 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/931 variables, 20/1322 constraints. Problems are: Problem set: 0 solved, 780 unsolved
[2024-06-01 13:04:38] [INFO ] Deduced a trap composed of 5 places in 60 ms of which 1 ms to minimize.
[2024-06-01 13:04:38] [INFO ] Deduced a trap composed of 7 places in 61 ms of which 1 ms to minimize.
[2024-06-01 13:04:38] [INFO ] Deduced a trap composed of 7 places in 56 ms of which 1 ms to minimize.
[2024-06-01 13:04:38] [INFO ] Deduced a trap composed of 7 places in 54 ms of which 2 ms to minimize.
[2024-06-01 13:04:39] [INFO ] Deduced a trap composed of 6 places in 53 ms of which 1 ms to minimize.
[2024-06-01 13:04:39] [INFO ] Deduced a trap composed of 6 places in 61 ms of which 1 ms to minimize.
[2024-06-01 13:04:39] [INFO ] Deduced a trap composed of 5 places in 57 ms of which 2 ms to minimize.
[2024-06-01 13:04:39] [INFO ] Deduced a trap composed of 5 places in 57 ms of which 1 ms to minimize.
[2024-06-01 13:04:39] [INFO ] Deduced a trap composed of 6 places in 57 ms of which 2 ms to minimize.
[2024-06-01 13:04:39] [INFO ] Deduced a trap composed of 6 places in 52 ms of which 1 ms to minimize.
[2024-06-01 13:04:39] [INFO ] Deduced a trap composed of 6 places in 59 ms of which 1 ms to minimize.
[2024-06-01 13:04:39] [INFO ] Deduced a trap composed of 5 places in 57 ms of which 1 ms to minimize.
[2024-06-01 13:04:39] [INFO ] Deduced a trap composed of 6 places in 52 ms of which 1 ms to minimize.
[2024-06-01 13:04:39] [INFO ] Deduced a trap composed of 5 places in 56 ms of which 1 ms to minimize.
[2024-06-01 13:04:39] [INFO ] Deduced a trap composed of 5 places in 55 ms of which 1 ms to minimize.
[2024-06-01 13:04:40] [INFO ] Deduced a trap composed of 5 places in 54 ms of which 1 ms to minimize.
[2024-06-01 13:04:40] [INFO ] Deduced a trap composed of 8 places in 51 ms of which 1 ms to minimize.
[2024-06-01 13:04:40] [INFO ] Deduced a trap composed of 5 places in 52 ms of which 1 ms to minimize.
[2024-06-01 13:04:40] [INFO ] Deduced a trap composed of 6 places in 51 ms of which 1 ms to minimize.
[2024-06-01 13:04:40] [INFO ] Deduced a trap composed of 5 places in 60 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/931 variables, 20/1342 constraints. Problems are: Problem set: 0 solved, 780 unsolved
[2024-06-01 13:04:40] [INFO ] Deduced a trap composed of 5 places in 63 ms of which 1 ms to minimize.
[2024-06-01 13:04:41] [INFO ] Deduced a trap composed of 5 places in 59 ms of which 1 ms to minimize.
[2024-06-01 13:04:41] [INFO ] Deduced a trap composed of 5 places in 59 ms of which 1 ms to minimize.
[2024-06-01 13:04:41] [INFO ] Deduced a trap composed of 5 places in 55 ms of which 1 ms to minimize.
[2024-06-01 13:04:41] [INFO ] Deduced a trap composed of 5 places in 58 ms of which 1 ms to minimize.
[2024-06-01 13:04:41] [INFO ] Deduced a trap composed of 5 places in 57 ms of which 1 ms to minimize.
[2024-06-01 13:04:41] [INFO ] Deduced a trap composed of 5 places in 56 ms of which 1 ms to minimize.
[2024-06-01 13:04:41] [INFO ] Deduced a trap composed of 5 places in 57 ms of which 2 ms to minimize.
[2024-06-01 13:04:41] [INFO ] Deduced a trap composed of 5 places in 57 ms of which 1 ms to minimize.
[2024-06-01 13:04:41] [INFO ] Deduced a trap composed of 6 places in 53 ms of which 1 ms to minimize.
[2024-06-01 13:04:41] [INFO ] Deduced a trap composed of 5 places in 54 ms of which 1 ms to minimize.
[2024-06-01 13:04:41] [INFO ] Deduced a trap composed of 5 places in 55 ms of which 2 ms to minimize.
[2024-06-01 13:04:42] [INFO ] Deduced a trap composed of 5 places in 54 ms of which 1 ms to minimize.
[2024-06-01 13:04:42] [INFO ] Deduced a trap composed of 5 places in 52 ms of which 2 ms to minimize.
[2024-06-01 13:04:42] [INFO ] Deduced a trap composed of 5 places in 55 ms of which 1 ms to minimize.
[2024-06-01 13:04:42] [INFO ] Deduced a trap composed of 6 places in 48 ms of which 1 ms to minimize.
[2024-06-01 13:04:42] [INFO ] Deduced a trap composed of 6 places in 53 ms of which 1 ms to minimize.
[2024-06-01 13:04:42] [INFO ] Deduced a trap composed of 5 places in 49 ms of which 1 ms to minimize.
[2024-06-01 13:04:42] [INFO ] Deduced a trap composed of 5 places in 51 ms of which 1 ms to minimize.
[2024-06-01 13:04:42] [INFO ] Deduced a trap composed of 5 places in 46 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/931 variables, 20/1362 constraints. Problems are: Problem set: 0 solved, 780 unsolved
[2024-06-01 13:04:42] [INFO ] Deduced a trap composed of 5 places in 57 ms of which 1 ms to minimize.
[2024-06-01 13:04:43] [INFO ] Deduced a trap composed of 6 places in 46 ms of which 1 ms to minimize.
[2024-06-01 13:04:43] [INFO ] Deduced a trap composed of 5 places in 51 ms of which 1 ms to minimize.
[2024-06-01 13:04:43] [INFO ] Deduced a trap composed of 7 places in 44 ms of which 1 ms to minimize.
[2024-06-01 13:04:43] [INFO ] Deduced a trap composed of 6 places in 53 ms of which 1 ms to minimize.
[2024-06-01 13:04:43] [INFO ] Deduced a trap composed of 5 places in 48 ms of which 1 ms to minimize.
[2024-06-01 13:04:44] [INFO ] Deduced a trap composed of 5 places in 49 ms of which 1 ms to minimize.
[2024-06-01 13:04:44] [INFO ] Deduced a trap composed of 5 places in 52 ms of which 1 ms to minimize.
[2024-06-01 13:04:44] [INFO ] Deduced a trap composed of 7 places in 52 ms of which 1 ms to minimize.
[2024-06-01 13:04:44] [INFO ] Deduced a trap composed of 6 places in 51 ms of which 1 ms to minimize.
[2024-06-01 13:04:44] [INFO ] Deduced a trap composed of 5 places in 51 ms of which 1 ms to minimize.
[2024-06-01 13:04:44] [INFO ] Deduced a trap composed of 5 places in 50 ms of which 1 ms to minimize.
[2024-06-01 13:04:44] [INFO ] Deduced a trap composed of 5 places in 50 ms of which 1 ms to minimize.
[2024-06-01 13:04:44] [INFO ] Deduced a trap composed of 5 places in 51 ms of which 1 ms to minimize.
[2024-06-01 13:04:44] [INFO ] Deduced a trap composed of 5 places in 51 ms of which 1 ms to minimize.
[2024-06-01 13:04:44] [INFO ] Deduced a trap composed of 7 places in 45 ms of which 1 ms to minimize.
[2024-06-01 13:04:44] [INFO ] Deduced a trap composed of 5 places in 54 ms of which 1 ms to minimize.
[2024-06-01 13:04:44] [INFO ] Deduced a trap composed of 5 places in 50 ms of which 1 ms to minimize.
[2024-06-01 13:04:44] [INFO ] Deduced a trap composed of 7 places in 49 ms of which 1 ms to minimize.
[2024-06-01 13:04:45] [INFO ] Deduced a trap composed of 5 places in 55 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/931 variables, 20/1382 constraints. Problems are: Problem set: 0 solved, 780 unsolved
[2024-06-01 13:04:45] [INFO ] Deduced a trap composed of 5 places in 55 ms of which 1 ms to minimize.
[2024-06-01 13:04:46] [INFO ] Deduced a trap composed of 7 places in 57 ms of which 1 ms to minimize.
[2024-06-01 13:04:46] [INFO ] Deduced a trap composed of 7 places in 54 ms of which 1 ms to minimize.
[2024-06-01 13:04:46] [INFO ] Deduced a trap composed of 7 places in 53 ms of which 1 ms to minimize.
[2024-06-01 13:04:46] [INFO ] Deduced a trap composed of 5 places in 54 ms of which 1 ms to minimize.
[2024-06-01 13:04:46] [INFO ] Deduced a trap composed of 7 places in 51 ms of which 1 ms to minimize.
[2024-06-01 13:04:46] [INFO ] Deduced a trap composed of 5 places in 52 ms of which 1 ms to minimize.
[2024-06-01 13:04:46] [INFO ] Deduced a trap composed of 6 places in 49 ms of which 1 ms to minimize.
[2024-06-01 13:04:46] [INFO ] Deduced a trap composed of 7 places in 59 ms of which 1 ms to minimize.
[2024-06-01 13:04:46] [INFO ] Deduced a trap composed of 6 places in 54 ms of which 2 ms to minimize.
[2024-06-01 13:04:47] [INFO ] Deduced a trap composed of 6 places in 56 ms of which 1 ms to minimize.
[2024-06-01 13:04:47] [INFO ] Deduced a trap composed of 7 places in 52 ms of which 1 ms to minimize.
[2024-06-01 13:04:47] [INFO ] Deduced a trap composed of 6 places in 59 ms of which 1 ms to minimize.
[2024-06-01 13:04:47] [INFO ] Deduced a trap composed of 5 places in 57 ms of which 2 ms to minimize.
[2024-06-01 13:04:47] [INFO ] Deduced a trap composed of 5 places in 54 ms of which 1 ms to minimize.
[2024-06-01 13:04:47] [INFO ] Deduced a trap composed of 7 places in 56 ms of which 1 ms to minimize.
[2024-06-01 13:04:48] [INFO ] Deduced a trap composed of 5 places in 56 ms of which 1 ms to minimize.
[2024-06-01 13:04:48] [INFO ] Deduced a trap composed of 5 places in 53 ms of which 2 ms to minimize.
[2024-06-01 13:04:48] [INFO ] Deduced a trap composed of 7 places in 57 ms of which 1 ms to minimize.
[2024-06-01 13:04:48] [INFO ] Deduced a trap composed of 7 places in 55 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/931 variables, 20/1402 constraints. Problems are: Problem set: 0 solved, 780 unsolved
[2024-06-01 13:04:50] [INFO ] Deduced a trap composed of 6 places in 80 ms of which 1 ms to minimize.
[2024-06-01 13:04:50] [INFO ] Deduced a trap composed of 5 places in 76 ms of which 1 ms to minimize.
[2024-06-01 13:04:50] [INFO ] Deduced a trap composed of 6 places in 77 ms of which 2 ms to minimize.
[2024-06-01 13:04:50] [INFO ] Deduced a trap composed of 5 places in 80 ms of which 1 ms to minimize.
[2024-06-01 13:04:50] [INFO ] Deduced a trap composed of 10 places in 76 ms of which 1 ms to minimize.
[2024-06-01 13:04:50] [INFO ] Deduced a trap composed of 6 places in 74 ms of which 2 ms to minimize.
[2024-06-01 13:04:50] [INFO ] Deduced a trap composed of 5 places in 74 ms of which 1 ms to minimize.
[2024-06-01 13:04:50] [INFO ] Deduced a trap composed of 7 places in 70 ms of which 2 ms to minimize.
[2024-06-01 13:04:50] [INFO ] Deduced a trap composed of 7 places in 65 ms of which 1 ms to minimize.
[2024-06-01 13:04:51] [INFO ] Deduced a trap composed of 9 places in 73 ms of which 1 ms to minimize.
[2024-06-01 13:04:51] [INFO ] Deduced a trap composed of 7 places in 68 ms of which 1 ms to minimize.
[2024-06-01 13:04:51] [INFO ] Deduced a trap composed of 7 places in 65 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 1)
(s2 0)
(s3 1)
(s4 0)
(s5 0)
(s6 0)
(s7 1)
(s8 0)
(s9 1)
(s10 0)
(s11 0)
(s12 1)
(s13 0)
(s14 1)
(s15 0)
(s16 0)
(s17 1)
(s18 0)
(s19 1)
(s20 0)
(s21 0)
(s22 1)
(s23 0)
(s24 1)
(s25 0)
(s26 0)
(s27 0)
(s28 1)
(s29 0)
(s30 0)
(s31 0)
(s32 1)
(s33 0)
(s34 1)
(s35 0)
(s36 0)
(s37 0)
(s38 1)
(s39 0)
(s40 1)
(s41 0)
(s42 0)
(s43 1)
(s44 0)
(s45 1)
(s46 0)
(s47 0)
(s48 1)
(s49 0)
(s50 1)
(s51 0)
(s52 0)
(s53 1)
(s54 0)
(s55 1)
(s56 0)
(s57 0)
(s58 1)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 1)
(s65 1)
(s66 0)
(s67 0)
(s68 0)
(s69 1)
(s70 0)
(s71 1)
(s72 0)
(s73 0)
(s74 1)
(s75 0)
(s76 1)
(s77 1)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 1)
(s84 0)
(s85 0)
(s86 1)
(s87 0)
(s88 0)
(s89 1)
(s90 0)
(s91 0)
(s92 0)
(s93 1)
(s94 0)
(s95 0)
(s96 1)
(s97 0)
(s98 0)
(s99 0)
(s100 1)
(s101 1)
(s102 0)
(s103 0)
(s104 0)
(s105 1)
(s106 0)
(s107 1)
(s108 1)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 1)
(s115 0)
(s116 0)
(s117 1)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 1)
(s123 0)
(s124 0)
(s125 0)
(s126 1)
(s127 1)
(s128 0)
(s129 1)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 1)
(s137 0)
(s138 1)
(s139 1)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 1)
(s147 0)
(s148 1)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 1)
(s154 0)
(s155 0)
(s156 0)
(s157 1)
(s158 1)
(s159 0)
(s160 1)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 1)
(s168 1)
(s169 0)
(s170 1)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 1)
(s179 1)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 1)
(s185 0)
(s186 1)
(s187 0)
(s188 0)
(s189 1)
(s190 0)
(s191 0)
(s192 0)
(s193 1)
(s194 0)
(s195 1)
(s196 0)
(s197 0)
(s198 1)
(s199 0)
(s200 1)
(s201 1)
(s202 0)
(s203 0)
(s204 0)
(s205 0)
(s206 1)
(s207 0)
(s208 0)
(s209 0)
(s210 1)
(s211 0)
(s212 0)
(s213 1)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 0)
(s219 1)
(s220 1)
(s221 0)
(s222 1)
(s223 0)
(s224 0)
(s225 0)
(s226 0)
(s227 0)
(s228 0)
(s229 1)
(s230 1)
(s231 0)
(s232 0)
(s233 0)
(s234 1)
(s235 0)
(s236 1)
(s237 0)
(s238 0)
(s239 1)
(s240 0)
(s241 1)
(s242 0)
(s243 0)
(s244 0)
(s245 1)
(s246 0)
(s247 0)
(s248 1)
(s249 0)
(s250 0)
(s251 1)
(s252 0)
(s253 0)
(s254 0)
(s255 1)
(s256 0)
(s257 1)
(s258 0)
(s259 0)
(s260 1)
(s261 0)
(s262 1)
(s263 1)
(s264 0)
(s265 0)
(s266 0)
(s267 0)
(s268 1)
(s269 0)
(s270 0)
(s271 0)
(s272 0)
(s273 1)
(s274 0)
(s275 1)
(s276 0)
(s277 0)
(s278 0)
(s279 1)
(s280 0)
(s281 0)
(s282 1)
(s283 0)
(s284 0)
(s285 0)
(s286 1)
(s287 0)
(s288 1)
(s289 0)
(s290 0)
(s291 1)
(s292 0)
(s293 1)
(s294 0)
(s295 0)
(s296 1)
(s297 0)
(s298 1)
(s299 1)
(s300 0)
(s301 0)
(s302 0)
(s303 1)
(s304 0)
(s305 1)
(s306 0)
(s307 0)
(s308 0)
(s309 0)
(s310 0)
(s311 1)
(s312 0)
(s313 1)
(s314 0)
(s315 0)
(s316 0)
(s317 1)
(s318 0)
(s319 1)
(s320 0)
(s321 0)
(s322 1)
(s323 0)
(s324 1)
(s325 1)
(s326 0)
(s327 0)
(s328 0)
(s329 0)
(s330 1)
(s331 0)
(s332 0)
(s333 0)
(s334 0)
(s335 1)
(s336 0)
(s337 1)
(s338 0)
(s339 0)
(s340 0)
(s341 0)
(s342 0)
(s343 1)
(s344 1)
(s345 0)
(s346 0)
(s347 0)
(s348 1)
(s349 1)
(s350 0)
(s351 0)
(s352 1)
(s353 0)
(s354 0)
(s355 1)
(s356 1)
(s357 0)
(s358 0)
(s359 0)
(s360 0)
(s361 0)
(s362 1)
(s363 0)
(s364 0)
(s365 1)
(s366 0)
(s367 0)
(s368 0)
(s369 0)
(s370 1)
(s371 0)
(s372 0)
(s373 0)
(s374 1)
(s375 1)
(s376 0)
(s377 0)
(s378 0)
(s379 1)
(s380 0)
(s381 1)
(s382 0)
(s383 1)
(s384 0)
(s385 0)
(s386 1)
(s387 1)
(s388 0)
(s389 0)
(s390 0)
(s391 0)
(s392 0)
(s393 1)
(s394 0)
(s395 0)
(s396 1)
(s397 0)
(s398 0)
(s399 1)
(s400 0)
(s401 0)
(s402 0)
(s403 0)
(s404 0)
(s405 1)
(s406 1)
(s407 0)
(s408 0)
(s409 0)
(s410 1)
(s411 0)
(s412 1)
(s413 0)
(s414 1)
(s415 0)
(s416 0)
(s417 1)
(s418 1)
(s419 0)
(s420 0)
(s421 0)
(s422 0)
(s423 1)
(s424 0)
(s425 0)
(s426 0)
(s427 1)
(s428 0)
(s429 0)
(s430 1)
(s431 0)
(s432 0)
(s433 0)
(s434 1)
(s435 0)
(s436 0)
(s437 1)
(s438 0)
(s439 0)
(s440 0)
(s441 1)
(s442 1)
(s443 0)
(s444 0)
(s445 1)
(s446 0)
(s447 0)
(s448 1)
(s449 1)
(s450 0)
(s451 0)
(s452 0)
(s453 0)
(s454 0)
(s455 1)
(s456 0)
(s457 0)
(s458 1)
(s459 0)
(s460 0)
(s461 1)
(s462 0)
(s463 0)
(s464 0)
(s465 0)
(s466 0)
(s467 1)
(s468 1)
(s469 0)
(s470 1)
(s471 0)
(s472 0)
(s473 0)
(s474 0)
(s475 0)
(s476 0)
(s477 1)
(s478 0)
(s479 1)
(s480 1)
(s481 0)
(s482 0)
(s483 timeout
0)
(s484 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 931/1712 variables, and 1414 constraints, problems are : Problem set: 0 solved, 780 unsolved in 30022 ms.
Refiners :[Domain max(s): 931/931 constraints, Positive P Invariants (semi-flows): 310/310 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 0/931 constraints, PredecessorRefiner: 0/780 constraints, Known Traps: 152/152 constraints]
After SMT, in 60302ms problems are : Problem set: 0 solved, 780 unsolved
Search for dead transitions found 0 dead transitions in 60313ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62117 ms. Remains : 931/931 places, 781/781 transitions.
[2024-06-01 13:04:51] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 4 ms.
[2024-06-01 13:04:51] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 931 places, 781 transitions and 3696 arcs took 10 ms.
[2024-06-01 13:04:51] [INFO ] Flatten gal took : 125 ms
Total runtime 90698 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 : ShieldPPPs-PT-030A-ReachabilityFireability-2024-14

BK_STOP 1717247092211

--------------------
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 ShieldPPPs-PT-030A-ReachabilityFireability-2024-14
rfs formula type EF
rfs formula formula --invariant=/tmp/1097/inv_0_
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="ShieldPPPs-PT-030A"
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 ShieldPPPs-PT-030A, 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 r528-tall-171683761200471"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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