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.r356-tall-171683761900791.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...............
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is ShieldRVs-PT-010A, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r356-tall-171683761900791
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 556K
-rw-r--r-- 1 mcc users 6.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K 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.4K May 19 07:16 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 19 16:37 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 19:13 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 12 18:00 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 176K Apr 12 18:00 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.8K Apr 12 17:53 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 66K Apr 12 17:53 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:55 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:55 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 63K 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 ShieldRVs-PT-010A-ReachabilityFireability-2024-00
FORMULA_NAME ShieldRVs-PT-010A-ReachabilityFireability-2024-01
FORMULA_NAME ShieldRVs-PT-010A-ReachabilityFireability-2024-02
FORMULA_NAME ShieldRVs-PT-010A-ReachabilityFireability-2024-03
FORMULA_NAME ShieldRVs-PT-010A-ReachabilityFireability-2024-04
FORMULA_NAME ShieldRVs-PT-010A-ReachabilityFireability-2024-05
FORMULA_NAME ShieldRVs-PT-010A-ReachabilityFireability-2024-06
FORMULA_NAME ShieldRVs-PT-010A-ReachabilityFireability-2024-07
FORMULA_NAME ShieldRVs-PT-010A-ReachabilityFireability-2024-08
FORMULA_NAME ShieldRVs-PT-010A-ReachabilityFireability-2024-09
FORMULA_NAME ShieldRVs-PT-010A-ReachabilityFireability-2024-10
FORMULA_NAME ShieldRVs-PT-010A-ReachabilityFireability-2024-11
FORMULA_NAME ShieldRVs-PT-010A-ReachabilityFireability-2024-12
FORMULA_NAME ShieldRVs-PT-010A-ReachabilityFireability-2024-13
FORMULA_NAME ShieldRVs-PT-010A-ReachabilityFireability-2024-14
FORMULA_NAME ShieldRVs-PT-010A-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717041921221

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldRVs-PT-010A
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityFireability PT
Running Version 202405141337
[2024-05-30 04:05:22] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-30 04:05:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-30 04:05:22] [INFO ] Load time of PNML (sax parser for PT used): 80 ms
[2024-05-30 04:05:22] [INFO ] Transformed 143 places.
[2024-05-30 04:05:22] [INFO ] Transformed 193 transitions.
[2024-05-30 04:05:22] [INFO ] Found NUPN structural information;
[2024-05-30 04:05:22] [INFO ] Parsed PT model containing 143 places and 193 transitions and 920 arcs in 185 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 14 ms.
Working with output stream class java.io.PrintStream
[2024-05-30 04:05:23] [INFO ] Flatten gal took : 131 ms
[2024-05-30 04:05:23] [INFO ] Flatten gal took : 64 ms
RANDOM walk for 40000 steps (272 resets) in 1665 ms. (24 steps per ms) remains 5/16 properties
FORMULA ShieldRVs-PT-010A-ReachabilityFireability-2024-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-010A-ReachabilityFireability-2024-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-010A-ReachabilityFireability-2024-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-010A-ReachabilityFireability-2024-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-010A-ReachabilityFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-010A-ReachabilityFireability-2024-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-010A-ReachabilityFireability-2024-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-010A-ReachabilityFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-010A-ReachabilityFireability-2024-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-010A-ReachabilityFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-010A-ReachabilityFireability-2024-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2024-05-30 04:05:23] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2982153854953353680.gal : 54 ms
[2024-05-30 04:05:23] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1583750319791123352.prop : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality2982153854953353680.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1583750319791123352.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
BEST_FIRST walk for 40004 steps (41 resets) in 923 ms. (43 steps per ms) remains 5/5 properties
Loading property file /tmp/ReachabilityCardinality1583750319791123352.prop.
BEST_FIRST walk for 40002 steps (40 resets) in 288 ms. (138 steps per ms) remains 4/5 properties
FORMULA ShieldRVs-PT-010A-ReachabilityFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
SDD proceeding with computation,5 properties remain. new max is 4
SDD size :3 after 5
SDD proceeding with computation,5 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,5 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,5 properties remain. new max is 32
SDD size :19 after 35
BEST_FIRST walk for 40004 steps (46 resets) in 142 ms. (279 steps per ms) remains 3/4 properties
FORMULA ShieldRVs-PT-010A-ReachabilityFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
SDD proceeding with computation,5 properties remain. new max is 64
SDD size :35 after 133
SDD proceeding with computation,5 properties remain. new max is 128
SDD size :133 after 796
SDD proceeding with computation,5 properties remain. new max is 256
SDD size :796 after 5404
SDD proceeding with computation,5 properties remain. new max is 512
SDD size :5404 after 57779
BEST_FIRST walk for 40004 steps (39 resets) in 911 ms. (43 steps per ms) remains 2/3 properties
FORMULA ShieldRVs-PT-010A-ReachabilityFireability-2024-08 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (48 resets) in 259 ms. (153 steps per ms) remains 2/2 properties
SDD proceeding with computation,5 properties remain. new max is 1024
SDD size :57779 after 640965
// Phase 1: matrix 193 rows 143 cols
[2024-05-30 04:05:24] [INFO ] Computed 41 invariants in 11 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 82/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 53/135 variables, 38/120 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/135 variables, 53/173 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/135 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 8/143 variables, 3/176 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/143 variables, 8/184 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/143 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 193/336 variables, 143/327 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/336 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/336 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 336/336 variables, and 327 constraints, problems are : Problem set: 0 solved, 2 unsolved in 433 ms.
Refiners :[Domain max(s): 143/143 constraints, Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 143/143 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Problem ShieldRVs-PT-010A-ReachabilityFireability-2024-12 is UNSAT
FORMULA ShieldRVs-PT-010A-ReachabilityFireability-2024-12 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 82/82 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 0/82 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 53/135 variables, 38/120 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/135 variables, 53/173 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-30 04:05:24] [INFO ] Deduced a trap composed of 8 places in 51 ms of which 7 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/135 variables, 1/174 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-30 04:05:24] [INFO ] Deduced a trap composed of 8 places in 46 ms of which 1 ms to minimize.
[2024-05-30 04:05:24] [INFO ] Deduced a trap composed of 11 places in 43 ms of which 1 ms to minimize.
[2024-05-30 04:05:25] [INFO ] Deduced a trap composed of 7 places in 39 ms of which 1 ms to minimize.
[2024-05-30 04:05:25] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/135 variables, 4/178 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/135 variables, 0/178 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 8/143 variables, 3/181 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/143 variables, 8/189 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/143 variables, 0/189 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 193/336 variables, 143/332 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/336 variables, 1/333 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-30 04:05:25] [INFO ] Deduced a trap composed of 8 places in 52 ms of which 2 ms to minimize.
[2024-05-30 04:05:25] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 1 ms to minimize.
[2024-05-30 04:05:25] [INFO ] Deduced a trap composed of 11 places in 37 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/336 variables, 3/336 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/336 variables, 0/336 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/336 variables, 0/336 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 336/336 variables, and 336 constraints, problems are : Problem set: 1 solved, 1 unsolved in 944 ms.
Refiners :[Domain max(s): 143/143 constraints, Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 143/143 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 8/8 constraints]
After SMT, in 1498ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 55 ms.
Support contains 72 out of 143 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 193/193 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 142 transition count 192
Partial Free-agglomeration rule applied 8 times.
Drop transitions (Partial Free agglomeration) removed 8 transitions
Iterating global reduction 0 with 8 rules applied. Total rules applied 10 place count 142 transition count 192
Applied a total of 10 rules in 69 ms. Remains 142 /143 variables (removed 1) and now considering 192/193 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 89 ms. Remains : 142/143 places, 192/193 transitions.
RANDOM walk for 40000 steps (279 resets) in 349 ms. (114 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (43 resets) in 255 ms. (156 steps per ms) remains 1/1 properties
SDD proceeding with computation,5 properties remain. new max is 2048
SDD size :640965 after 6.5531e+06
Interrupted probabilistic random walk after 1522770 steps, run timeout after 3001 ms. (steps per millisecond=507 ) properties seen :0 out of 1
Probabilistic random walk after 1522770 steps, saw 261892 distinct states, run finished after 3005 ms. (steps per millisecond=506 ) properties seen :0
// Phase 1: matrix 192 rows 142 cols
[2024-05-30 04:05:29] [INFO ] Computed 41 invariants in 6 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 72/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 59/131 variables, 36/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/131 variables, 59/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/131 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 11/142 variables, 5/172 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/142 variables, 11/183 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/142 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 192/334 variables, 142/325 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/334 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/334 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 334/334 variables, and 325 constraints, problems are : Problem set: 0 solved, 1 unsolved in 147 ms.
Refiners :[Domain max(s): 142/142 constraints, Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 142/142 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/72 variables, 72/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 59/131 variables, 36/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/131 variables, 59/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 04:05:29] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/131 variables, 1/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/131 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 11/142 variables, 5/173 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/142 variables, 11/184 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/142 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 192/334 variables, 142/326 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/334 variables, 1/327 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 04:05:29] [INFO ] Deduced a trap composed of 7 places in 21 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/334 variables, 1/328 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/334 variables, 0/328 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/334 variables, 0/328 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 334/334 variables, and 328 constraints, problems are : Problem set: 0 solved, 1 unsolved in 498 ms.
Refiners :[Domain max(s): 142/142 constraints, Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 142/142 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 680ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 64 ms.
Support contains 72 out of 142 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 142/142 places, 192/192 transitions.
Applied a total of 0 rules in 9 ms. Remains 142 /142 variables (removed 0) and now considering 192/192 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 142/142 places, 192/192 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 142/142 places, 192/192 transitions.
Applied a total of 0 rules in 7 ms. Remains 142 /142 variables (removed 0) and now considering 192/192 (removed 0) transitions.
[2024-05-30 04:05:29] [INFO ] Invariant cache hit.
[2024-05-30 04:05:29] [INFO ] Implicit Places using invariants in 85 ms returned []
[2024-05-30 04:05:29] [INFO ] Invariant cache hit.
[2024-05-30 04:05:30] [INFO ] Implicit Places using invariants and state equation in 125 ms returned []
Implicit Place search using SMT with State Equation took 217 ms to find 0 implicit places.
[2024-05-30 04:05:30] [INFO ] Redundant transitions in 48 ms returned [52]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 190 sub problems to find dead transitions.
// Phase 1: matrix 191 rows 142 cols
[2024-05-30 04:05:30] [INFO ] Computed 41 invariants in 6 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/141 variables, 141/141 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/141 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 2 (OVERLAPS) 1/142 variables, 41/182 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/142 variables, 1/183 constraints. Problems are: Problem set: 0 solved, 190 unsolved
[2024-05-30 04:05:31] [INFO ] Deduced a trap composed of 7 places in 43 ms of which 1 ms to minimize.
[2024-05-30 04:05:31] [INFO ] Deduced a trap composed of 6 places in 35 ms of which 1 ms to minimize.
[2024-05-30 04:05:31] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 0 ms to minimize.
[2024-05-30 04:05:31] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 1 ms to minimize.
[2024-05-30 04:05:31] [INFO ] Deduced a trap composed of 7 places in 21 ms of which 1 ms to minimize.
[2024-05-30 04:05:32] [INFO ] Deduced a trap composed of 7 places in 42 ms of which 1 ms to minimize.
[2024-05-30 04:05:32] [INFO ] Deduced a trap composed of 7 places in 55 ms of which 1 ms to minimize.
[2024-05-30 04:05:32] [INFO ] Deduced a trap composed of 7 places in 41 ms of which 1 ms to minimize.
[2024-05-30 04:05:32] [INFO ] Deduced a trap composed of 7 places in 44 ms of which 1 ms to minimize.
[2024-05-30 04:05:32] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 1 ms to minimize.
[2024-05-30 04:05:32] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 1 ms to minimize.
[2024-05-30 04:05:32] [INFO ] Deduced a trap composed of 7 places in 44 ms of which 1 ms to minimize.
[2024-05-30 04:05:32] [INFO ] Deduced a trap composed of 32 places in 31 ms of which 1 ms to minimize.
[2024-05-30 04:05:32] [INFO ] Deduced a trap composed of 7 places in 21 ms of which 1 ms to minimize.
[2024-05-30 04:05:32] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 1 ms to minimize.
[2024-05-30 04:05:32] [INFO ] Deduced a trap composed of 7 places in 46 ms of which 1 ms to minimize.
[2024-05-30 04:05:32] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 1 ms to minimize.
[2024-05-30 04:05:32] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 1 ms to minimize.
[2024-05-30 04:05:32] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 1 ms to minimize.
[2024-05-30 04:05:32] [INFO ] Deduced a trap composed of 13 places in 74 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/142 variables, 20/203 constraints. Problems are: Problem set: 0 solved, 190 unsolved
[2024-05-30 04:05:32] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 1 ms to minimize.
[2024-05-30 04:05:32] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 1 ms to minimize.
[2024-05-30 04:05:32] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 1 ms to minimize.
[2024-05-30 04:05:32] [INFO ] Deduced a trap composed of 12 places in 45 ms of which 5 ms to minimize.
[2024-05-30 04:05:33] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 1 ms to minimize.
[2024-05-30 04:05:33] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 1 ms to minimize.
[2024-05-30 04:05:33] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 0 ms to minimize.
[2024-05-30 04:05:33] [INFO ] Deduced a trap composed of 11 places in 43 ms of which 1 ms to minimize.
[2024-05-30 04:05:33] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 1 ms to minimize.
[2024-05-30 04:05:33] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 1 ms to minimize.
[2024-05-30 04:05:33] [INFO ] Deduced a trap composed of 13 places in 74 ms of which 1 ms to minimize.
[2024-05-30 04:05:33] [INFO ] Deduced a trap composed of 7 places in 32 ms of which 1 ms to minimize.
[2024-05-30 04:05:33] [INFO ] Deduced a trap composed of 10 places in 45 ms of which 1 ms to minimize.
[2024-05-30 04:05:33] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 1 ms to minimize.
[2024-05-30 04:05:33] [INFO ] Deduced a trap composed of 21 places in 43 ms of which 1 ms to minimize.
[2024-05-30 04:05:33] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 0 ms to minimize.
[2024-05-30 04:05:33] [INFO ] Deduced a trap composed of 7 places in 45 ms of which 1 ms to minimize.
[2024-05-30 04:05:33] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 1 ms to minimize.
[2024-05-30 04:05:33] [INFO ] Deduced a trap composed of 7 places in 49 ms of which 1 ms to minimize.
[2024-05-30 04:05:33] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/142 variables, 20/223 constraints. Problems are: Problem set: 0 solved, 190 unsolved
[2024-05-30 04:05:33] [INFO ] Deduced a trap composed of 7 places in 36 ms of which 0 ms to minimize.
[2024-05-30 04:05:33] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 0 ms to minimize.
[2024-05-30 04:05:34] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 1 ms to minimize.
[2024-05-30 04:05:34] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 1 ms to minimize.
[2024-05-30 04:05:34] [INFO ] Deduced a trap composed of 7 places in 32 ms of which 1 ms to minimize.
[2024-05-30 04:05:34] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 0 ms to minimize.
[2024-05-30 04:05:34] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 1 ms to minimize.
[2024-05-30 04:05:34] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 1 ms to minimize.
[2024-05-30 04:05:34] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 0 ms to minimize.
[2024-05-30 04:05:34] [INFO ] Deduced a trap composed of 7 places in 17 ms of which 0 ms to minimize.
[2024-05-30 04:05:34] [INFO ] Deduced a trap composed of 11 places in 35 ms of which 1 ms to minimize.
[2024-05-30 04:05:34] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
[2024-05-30 04:05:34] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 1 ms to minimize.
[2024-05-30 04:05:34] [INFO ] Deduced a trap composed of 11 places in 21 ms of which 0 ms to minimize.
[2024-05-30 04:05:34] [INFO ] Deduced a trap composed of 7 places in 17 ms of which 1 ms to minimize.
[2024-05-30 04:05:34] [INFO ] Deduced a trap composed of 7 places in 35 ms of which 1 ms to minimize.
[2024-05-30 04:05:34] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 0 ms to minimize.
[2024-05-30 04:05:34] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 0 ms to minimize.
[2024-05-30 04:05:34] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 0 ms to minimize.
[2024-05-30 04:05:34] [INFO ] Deduced a trap composed of 13 places in 22 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/142 variables, 20/243 constraints. Problems are: Problem set: 0 solved, 190 unsolved
[2024-05-30 04:05:35] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 1 ms to minimize.
[2024-05-30 04:05:35] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 1 ms to minimize.
[2024-05-30 04:05:35] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 0 ms to minimize.
[2024-05-30 04:05:35] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 1 ms to minimize.
[2024-05-30 04:05:35] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 1 ms to minimize.
[2024-05-30 04:05:35] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 0 ms to minimize.
[2024-05-30 04:05:35] [INFO ] Deduced a trap composed of 12 places in 21 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/142 variables, 7/250 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/142 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 9 (OVERLAPS) 191/333 variables, 142/392 constraints. Problems are: Problem set: 0 solved, 190 unsolved
[2024-05-30 04:05:37] [INFO ] Deduced a trap composed of 7 places in 37 ms of which 1 ms to minimize.
[2024-05-30 04:05:37] [INFO ] Deduced a trap composed of 24 places in 46 ms of which 1 ms to minimize.
[2024-05-30 04:05:37] [INFO ] Deduced a trap composed of 25 places in 37 ms of which 0 ms to minimize.
[2024-05-30 04:05:37] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 1 ms to minimize.
[2024-05-30 04:05:37] [INFO ] Deduced a trap composed of 12 places in 52 ms of which 1 ms to minimize.
[2024-05-30 04:05:37] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 2 ms to minimize.
[2024-05-30 04:05:37] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 1 ms to minimize.
[2024-05-30 04:05:37] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 1 ms to minimize.
[2024-05-30 04:05:37] [INFO ] Deduced a trap composed of 18 places in 58 ms of which 1 ms to minimize.
[2024-05-30 04:05:38] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 0 ms to minimize.
[2024-05-30 04:05:38] [INFO ] Deduced a trap composed of 12 places in 57 ms of which 0 ms to minimize.
[2024-05-30 04:05:38] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 1 ms to minimize.
[2024-05-30 04:05:38] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 1 ms to minimize.
[2024-05-30 04:05:38] [INFO ] Deduced a trap composed of 21 places in 51 ms of which 0 ms to minimize.
[2024-05-30 04:05:38] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 1 ms to minimize.
[2024-05-30 04:05:38] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 0 ms to minimize.
[2024-05-30 04:05:38] [INFO ] Deduced a trap composed of 22 places in 57 ms of which 1 ms to minimize.
[2024-05-30 04:05:38] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 1 ms to minimize.
[2024-05-30 04:05:38] [INFO ] Deduced a trap composed of 12 places in 22 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/333 variables, 19/411 constraints. Problems are: Problem set: 0 solved, 190 unsolved
[2024-05-30 04:05:39] [INFO ] Deduced a trap composed of 8 places in 16 ms of which 1 ms to minimize.
[2024-05-30 04:05:39] [INFO ] Deduced a trap composed of 7 places in 51 ms of which 1 ms to minimize.
[2024-05-30 04:05:39] [INFO ] Deduced a trap composed of 11 places in 60 ms of which 1 ms to minimize.
[2024-05-30 04:05:39] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 0 ms to minimize.
[2024-05-30 04:05:39] [INFO ] Deduced a trap composed of 11 places in 41 ms of which 0 ms to minimize.
[2024-05-30 04:05:39] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 1 ms to minimize.
[2024-05-30 04:05:39] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 0 ms to minimize.
[2024-05-30 04:05:40] [INFO ] Deduced a trap composed of 11 places in 42 ms of which 0 ms to minimize.
[2024-05-30 04:05:40] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 0 ms to minimize.
[2024-05-30 04:05:40] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/333 variables, 10/421 constraints. Problems are: Problem set: 0 solved, 190 unsolved
[2024-05-30 04:05:40] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 1 ms to minimize.
[2024-05-30 04:05:40] [INFO ] Deduced a trap composed of 11 places in 22 ms of which 1 ms to minimize.
[2024-05-30 04:05:41] [INFO ] Deduced a trap composed of 8 places in 21 ms of which 1 ms to minimize.
[2024-05-30 04:05:41] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 2 ms to minimize.
[2024-05-30 04:05:41] [INFO ] Deduced a trap composed of 11 places in 41 ms of which 1 ms to minimize.
[2024-05-30 04:05:41] [INFO ] Deduced a trap composed of 12 places in 22 ms of which 0 ms to minimize.
[2024-05-30 04:05:41] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/333 variables, 7/428 constraints. Problems are: Problem set: 0 solved, 190 unsolved
[2024-05-30 04:05:42] [INFO ] Deduced a trap composed of 12 places in 23 ms of which 1 ms to minimize.
[2024-05-30 04:05:42] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 0 ms to minimize.
[2024-05-30 04:05:43] [INFO ] Deduced a trap composed of 9 places in 19 ms of which 1 ms to minimize.
[2024-05-30 04:05:43] [INFO ] Deduced a trap composed of 8 places in 21 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/333 variables, 4/432 constraints. Problems are: Problem set: 0 solved, 190 unsolved
[2024-05-30 04:05:43] [INFO ] Deduced a trap composed of 11 places in 20 ms of which 1 ms to minimize.
[2024-05-30 04:05:43] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 1 ms to minimize.
[2024-05-30 04:05:43] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/333 variables, 3/435 constraints. Problems are: Problem set: 0 solved, 190 unsolved
[2024-05-30 04:05:44] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 1 ms to minimize.
[2024-05-30 04:05:44] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 1 ms to minimize.
[2024-05-30 04:05:44] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 1 ms to minimize.
[2024-05-30 04:05:44] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 0 ms to minimize.
[2024-05-30 04:05:44] [INFO ] Deduced a trap composed of 18 places in 51 ms of which 1 ms to minimize.
[2024-05-30 04:05:45] [INFO ] Deduced a trap composed of 7 places in 38 ms of which 1 ms to minimize.
[2024-05-30 04:05:45] [INFO ] Deduced a trap composed of 18 places in 62 ms of which 1 ms to minimize.
[2024-05-30 04:05:45] [INFO ] Deduced a trap composed of 18 places in 55 ms of which 1 ms to minimize.
[2024-05-30 04:05:45] [INFO ] Deduced a trap composed of 12 places in 21 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/333 variables, 9/444 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/333 variables, 0/444 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 17 (OVERLAPS) 0/333 variables, 0/444 constraints. Problems are: Problem set: 0 solved, 190 unsolved
No progress, stopping.
After SMT solving in domain Real declared 333/333 variables, and 444 constraints, problems are : Problem set: 0 solved, 190 unsolved in 18398 ms.
Refiners :[Domain max(s): 142/142 constraints, Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 142/142 constraints, PredecessorRefiner: 190/190 constraints, Known Traps: 119/119 constraints]
Escalating to Integer solving :Problem set: 0 solved, 190 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/141 variables, 141/141 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/141 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 2 (OVERLAPS) 1/142 variables, 41/182 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/142 variables, 1/183 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/142 variables, 119/302 constraints. Problems are: Problem set: 0 solved, 190 unsolved
[2024-05-30 04:05:49] [INFO ] Deduced a trap composed of 11 places in 38 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/142 variables, 1/303 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/142 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 7 (OVERLAPS) 191/333 variables, 142/445 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/333 variables, 190/635 constraints. Problems are: Problem set: 0 solved, 190 unsolved
[2024-05-30 04:05:56] [INFO ] Deduced a trap composed of 11 places in 1743 ms of which 1 ms to minimize.
[2024-05-30 04:05:57] [INFO ] Deduced a trap composed of 7 places in 52 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/333 variables, 2/637 constraints. Problems are: Problem set: 0 solved, 190 unsolved
[2024-05-30 04:06:07] [INFO ] Deduced a trap composed of 8 places in 424 ms of which 32 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/333 variables, 1/638 constraints. Problems are: Problem set: 0 solved, 190 unsolved
[2024-05-30 04:06:11] [INFO ] Deduced a trap composed of 7 places in 67 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/333 variables, 1/639 constraints. Problems are: Problem set: 0 solved, 190 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 333/333 variables, and 639 constraints, problems are : Problem set: 0 solved, 190 unsolved in 30015 ms.
Refiners :[Domain max(s): 142/142 constraints, Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 142/142 constraints, PredecessorRefiner: 190/190 constraints, Known Traps: 124/124 constraints]
After SMT, in 48496ms problems are : Problem set: 0 solved, 190 unsolved
Search for dead transitions found 0 dead transitions in 48499ms
Starting structural reductions in REACHABILITY mode, iteration 1 : 142/142 places, 191/192 transitions.
Applied a total of 0 rules in 8 ms. Remains 142 /142 variables (removed 0) and now considering 191/191 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 48788 ms. Remains : 142/142 places, 191/192 transitions.
RANDOM walk for 40000 steps (281 resets) in 165 ms. (240 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (43 resets) in 178 ms. (223 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1619606 steps, run timeout after 3001 ms. (steps per millisecond=539 ) properties seen :0 out of 1
Probabilistic random walk after 1619606 steps, saw 275569 distinct states, run finished after 3001 ms. (steps per millisecond=539 ) properties seen :0
[2024-05-30 04:06:21] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 72/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 59/131 variables, 36/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/131 variables, 59/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/131 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 11/142 variables, 5/172 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/142 variables, 11/183 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/142 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 191/333 variables, 142/325 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/333 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/333 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 333/333 variables, and 325 constraints, problems are : Problem set: 0 solved, 1 unsolved in 248 ms.
Refiners :[Domain max(s): 142/142 constraints, Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 142/142 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/72 variables, 72/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 59/131 variables, 36/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/131 variables, 59/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 04:06:22] [INFO ] Deduced a trap composed of 13 places in 884 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/131 variables, 1/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/131 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 11/142 variables, 5/173 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/142 variables, 11/184 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/142 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 191/333 variables, 142/326 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/333 variables, 1/327 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/333 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/333 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 333/333 variables, and 327 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1642 ms.
Refiners :[Domain max(s): 142/142 constraints, Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 142/142 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 1910ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 36 ms.
Support contains 72 out of 142 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 142/142 places, 191/191 transitions.
Applied a total of 0 rules in 6 ms. Remains 142 /142 variables (removed 0) and now considering 191/191 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 142/142 places, 191/191 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 142/142 places, 191/191 transitions.
Applied a total of 0 rules in 6 ms. Remains 142 /142 variables (removed 0) and now considering 191/191 (removed 0) transitions.
[2024-05-30 04:06:23] [INFO ] Invariant cache hit.
[2024-05-30 04:06:23] [INFO ] Implicit Places using invariants in 58 ms returned []
[2024-05-30 04:06:23] [INFO ] Invariant cache hit.
[2024-05-30 04:06:23] [INFO ] Implicit Places using invariants and state equation in 117 ms returned []
Implicit Place search using SMT with State Equation took 190 ms to find 0 implicit places.
[2024-05-30 04:06:23] [INFO ] Redundant transitions in 51 ms returned []
Running 190 sub problems to find dead transitions.
[2024-05-30 04:06:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/141 variables, 141/141 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/141 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 2 (OVERLAPS) 1/142 variables, 41/182 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/142 variables, 1/183 constraints. Problems are: Problem set: 0 solved, 190 unsolved
[2024-05-30 04:06:27] [INFO ] Deduced a trap composed of 7 places in 37 ms of which 0 ms to minimize.
[2024-05-30 04:06:27] [INFO ] Deduced a trap composed of 6 places in 41 ms of which 1 ms to minimize.
[2024-05-30 04:06:27] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 1 ms to minimize.
[2024-05-30 04:06:27] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 1 ms to minimize.
[2024-05-30 04:06:27] [INFO ] Deduced a trap composed of 7 places in 29 ms of which 1 ms to minimize.
[2024-05-30 04:06:27] [INFO ] Deduced a trap composed of 7 places in 58 ms of which 1 ms to minimize.
[2024-05-30 04:06:27] [INFO ] Deduced a trap composed of 7 places in 54 ms of which 2 ms to minimize.
[2024-05-30 04:06:27] [INFO ] Deduced a trap composed of 7 places in 50 ms of which 1 ms to minimize.
[2024-05-30 04:06:27] [INFO ] Deduced a trap composed of 7 places in 48 ms of which 1 ms to minimize.
[2024-05-30 04:06:27] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 0 ms to minimize.
[2024-05-30 04:06:27] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 1 ms to minimize.
[2024-05-30 04:06:27] [INFO ] Deduced a trap composed of 7 places in 56 ms of which 0 ms to minimize.
[2024-05-30 04:06:27] [INFO ] Deduced a trap composed of 32 places in 39 ms of which 1 ms to minimize.
[2024-05-30 04:06:27] [INFO ] Deduced a trap composed of 7 places in 21 ms of which 0 ms to minimize.
[2024-05-30 04:06:27] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 1 ms to minimize.
[2024-05-30 04:06:27] [INFO ] Deduced a trap composed of 7 places in 40 ms of which 0 ms to minimize.
[2024-05-30 04:06:27] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 0 ms to minimize.
[2024-05-30 04:06:27] [INFO ] Deduced a trap composed of 7 places in 32 ms of which 1 ms to minimize.
[2024-05-30 04:06:27] [INFO ] Deduced a trap composed of 11 places in 35 ms of which 0 ms to minimize.
[2024-05-30 04:06:27] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/142 variables, 20/203 constraints. Problems are: Problem set: 0 solved, 190 unsolved
[2024-05-30 04:06:28] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 1 ms to minimize.
[2024-05-30 04:06:28] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 0 ms to minimize.
[2024-05-30 04:06:28] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 1 ms to minimize.
[2024-05-30 04:06:28] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 0 ms to minimize.
[2024-05-30 04:06:28] [INFO ] Deduced a trap composed of 17 places in 58 ms of which 1 ms to minimize.
[2024-05-30 04:06:28] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 0 ms to minimize.
[2024-05-30 04:06:28] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 1 ms to minimize.
[2024-05-30 04:06:28] [INFO ] Deduced a trap composed of 11 places in 46 ms of which 0 ms to minimize.
[2024-05-30 04:06:28] [INFO ] Deduced a trap composed of 11 places in 44 ms of which 1 ms to minimize.
[2024-05-30 04:06:28] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 0 ms to minimize.
[2024-05-30 04:06:28] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 1 ms to minimize.
[2024-05-30 04:06:28] [INFO ] Deduced a trap composed of 7 places in 14 ms of which 1 ms to minimize.
[2024-05-30 04:06:28] [INFO ] Deduced a trap composed of 10 places in 49 ms of which 1 ms to minimize.
[2024-05-30 04:06:28] [INFO ] Deduced a trap composed of 13 places in 82 ms of which 1 ms to minimize.
[2024-05-30 04:06:28] [INFO ] Deduced a trap composed of 21 places in 51 ms of which 0 ms to minimize.
[2024-05-30 04:06:28] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 1 ms to minimize.
[2024-05-30 04:06:28] [INFO ] Deduced a trap composed of 7 places in 59 ms of which 1 ms to minimize.
[2024-05-30 04:06:29] [INFO ] Deduced a trap composed of 21 places in 66 ms of which 1 ms to minimize.
[2024-05-30 04:06:29] [INFO ] Deduced a trap composed of 7 places in 55 ms of which 0 ms to minimize.
[2024-05-30 04:06:29] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/142 variables, 20/223 constraints. Problems are: Problem set: 0 solved, 190 unsolved
[2024-05-30 04:06:29] [INFO ] Deduced a trap composed of 7 places in 38 ms of which 1 ms to minimize.
[2024-05-30 04:06:29] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 1 ms to minimize.
[2024-05-30 04:06:29] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 0 ms to minimize.
[2024-05-30 04:06:29] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 1 ms to minimize.
[2024-05-30 04:06:29] [INFO ] Deduced a trap composed of 7 places in 37 ms of which 0 ms to minimize.
[2024-05-30 04:06:29] [INFO ] Deduced a trap composed of 7 places in 22 ms of which 1 ms to minimize.
[2024-05-30 04:06:29] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 1 ms to minimize.
[2024-05-30 04:06:29] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 1 ms to minimize.
[2024-05-30 04:06:29] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 0 ms to minimize.
[2024-05-30 04:06:29] [INFO ] Deduced a trap composed of 7 places in 16 ms of which 1 ms to minimize.
[2024-05-30 04:06:29] [INFO ] Deduced a trap composed of 11 places in 37 ms of which 1 ms to minimize.
[2024-05-30 04:06:29] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 0 ms to minimize.
[2024-05-30 04:06:29] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 0 ms to minimize.
[2024-05-30 04:06:29] [INFO ] Deduced a trap composed of 11 places in 19 ms of which 0 ms to minimize.
[2024-05-30 04:06:29] [INFO ] Deduced a trap composed of 7 places in 19 ms of which 0 ms to minimize.
[2024-05-30 04:06:29] [INFO ] Deduced a trap composed of 7 places in 41 ms of which 0 ms to minimize.
[2024-05-30 04:06:29] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 0 ms to minimize.
[2024-05-30 04:06:30] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 1 ms to minimize.
[2024-05-30 04:06:30] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 0 ms to minimize.
[2024-05-30 04:06:30] [INFO ] Deduced a trap composed of 13 places in 23 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/142 variables, 20/243 constraints. Problems are: Problem set: 0 solved, 190 unsolved
[2024-05-30 04:06:30] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 1 ms to minimize.
[2024-05-30 04:06:30] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 1 ms to minimize.
[2024-05-30 04:06:30] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 0 ms to minimize.
[2024-05-30 04:06:30] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 1 ms to minimize.
[2024-05-30 04:06:30] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 1 ms to minimize.
[2024-05-30 04:06:31] [INFO ] Deduced a trap composed of 12 places in 21 ms of which 1 ms to minimize.
[2024-05-30 04:06:31] [INFO ] Deduced a trap composed of 12 places in 21 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/142 variables, 7/250 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/142 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 9 (OVERLAPS) 191/333 variables, 142/392 constraints. Problems are: Problem set: 0 solved, 190 unsolved
[2024-05-30 04:06:32] [INFO ] Deduced a trap composed of 7 places in 44 ms of which 0 ms to minimize.
[2024-05-30 04:06:32] [INFO ] Deduced a trap composed of 24 places in 48 ms of which 1 ms to minimize.
[2024-05-30 04:06:33] [INFO ] Deduced a trap composed of 25 places in 45 ms of which 1 ms to minimize.
[2024-05-30 04:06:33] [INFO ] Deduced a trap composed of 21 places in 43 ms of which 1 ms to minimize.
[2024-05-30 04:06:33] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 0 ms to minimize.
[2024-05-30 04:06:33] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 0 ms to minimize.
[2024-05-30 04:06:33] [INFO ] Deduced a trap composed of 12 places in 49 ms of which 1 ms to minimize.
[2024-05-30 04:06:33] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 1 ms to minimize.
[2024-05-30 04:06:33] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
[2024-05-30 04:06:33] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 1 ms to minimize.
[2024-05-30 04:06:33] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 1 ms to minimize.
[2024-05-30 04:06:33] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 1 ms to minimize.
[2024-05-30 04:06:33] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 1 ms to minimize.
[2024-05-30 04:06:33] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 1 ms to minimize.
[2024-05-30 04:06:33] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 1 ms to minimize.
[2024-05-30 04:06:33] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 1 ms to minimize.
[2024-05-30 04:06:33] [INFO ] Deduced a trap composed of 22 places in 49 ms of which 1 ms to minimize.
[2024-05-30 04:06:34] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 0 ms to minimize.
[2024-05-30 04:06:34] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/333 variables, 19/411 constraints. Problems are: Problem set: 0 solved, 190 unsolved
[2024-05-30 04:06:34] [INFO ] Deduced a trap composed of 8 places in 22 ms of which 1 ms to minimize.
[2024-05-30 04:06:34] [INFO ] Deduced a trap composed of 7 places in 41 ms of which 1 ms to minimize.
[2024-05-30 04:06:34] [INFO ] Deduced a trap composed of 11 places in 50 ms of which 1 ms to minimize.
[2024-05-30 04:06:34] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 0 ms to minimize.
[2024-05-30 04:06:35] [INFO ] Deduced a trap composed of 11 places in 35 ms of which 0 ms to minimize.
[2024-05-30 04:06:35] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 0 ms to minimize.
[2024-05-30 04:06:35] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 0 ms to minimize.
[2024-05-30 04:06:35] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 1 ms to minimize.
[2024-05-30 04:06:35] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 1 ms to minimize.
[2024-05-30 04:06:35] [INFO ] Deduced a trap composed of 12 places in 22 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/333 variables, 10/421 constraints. Problems are: Problem set: 0 solved, 190 unsolved
[2024-05-30 04:06:36] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 2 ms to minimize.
[2024-05-30 04:06:36] [INFO ] Deduced a trap composed of 11 places in 24 ms of which 1 ms to minimize.
[2024-05-30 04:06:36] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 1 ms to minimize.
[2024-05-30 04:06:36] [INFO ] Deduced a trap composed of 11 places in 22 ms of which 3 ms to minimize.
[2024-05-30 04:06:36] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 1 ms to minimize.
[2024-05-30 04:06:36] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 1 ms to minimize.
[2024-05-30 04:06:37] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/333 variables, 7/428 constraints. Problems are: Problem set: 0 solved, 190 unsolved
[2024-05-30 04:06:38] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 1 ms to minimize.
[2024-05-30 04:06:38] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 1 ms to minimize.
[2024-05-30 04:06:38] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 0 ms to minimize.
[2024-05-30 04:06:38] [INFO ] Deduced a trap composed of 8 places in 22 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/333 variables, 4/432 constraints. Problems are: Problem set: 0 solved, 190 unsolved
[2024-05-30 04:06:39] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 0 ms to minimize.
[2024-05-30 04:06:39] [INFO ] Deduced a trap composed of 12 places in 17 ms of which 1 ms to minimize.
[2024-05-30 04:06:39] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/333 variables, 3/435 constraints. Problems are: Problem set: 0 solved, 190 unsolved
[2024-05-30 04:06:40] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 1 ms to minimize.
[2024-05-30 04:06:40] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 0 ms to minimize.
[2024-05-30 04:06:40] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 1 ms to minimize.
[2024-05-30 04:06:40] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 1 ms to minimize.
[2024-05-30 04:06:40] [INFO ] Deduced a trap composed of 18 places in 52 ms of which 1 ms to minimize.
[2024-05-30 04:06:40] [INFO ] Deduced a trap composed of 7 places in 47 ms of which 1 ms to minimize.
[2024-05-30 04:06:40] [INFO ] Deduced a trap composed of 18 places in 53 ms of which 1 ms to minimize.
[2024-05-30 04:06:40] [INFO ] Deduced a trap composed of 18 places in 52 ms of which 1 ms to minimize.
[2024-05-30 04:06:40] [INFO ] Deduced a trap composed of 12 places in 18 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/333 variables, 9/444 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/333 variables, 0/444 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 17 (OVERLAPS) 0/333 variables, 0/444 constraints. Problems are: Problem set: 0 solved, 190 unsolved
No progress, stopping.
After SMT solving in domain Real declared 333/333 variables, and 444 constraints, problems are : Problem set: 0 solved, 190 unsolved in 19890 ms.
Refiners :[Domain max(s): 142/142 constraints, Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 142/142 constraints, PredecessorRefiner: 190/190 constraints, Known Traps: 119/119 constraints]
Escalating to Integer solving :Problem set: 0 solved, 190 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/141 variables, 141/141 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/141 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 2 (OVERLAPS) 1/142 variables, 41/182 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/142 variables, 1/183 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/142 variables, 119/302 constraints. Problems are: Problem set: 0 solved, 190 unsolved
[2024-05-30 04:06:44] [INFO ] Deduced a trap composed of 11 places in 41 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/142 variables, 1/303 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/142 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 7 (OVERLAPS) 191/333 variables, 142/445 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/333 variables, 190/635 constraints. Problems are: Problem set: 0 solved, 190 unsolved
[2024-05-30 04:06:49] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 6 ms to minimize.
[2024-05-30 04:06:49] [INFO ] Deduced a trap composed of 10 places in 20 ms of which 0 ms to minimize.
[2024-05-30 04:06:50] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 0 ms to minimize.
[2024-05-30 04:06:51] [INFO ] Deduced a trap composed of 16 places in 21 ms of which 1 ms to minimize.
[2024-05-30 04:06:51] [INFO ] Deduced a trap composed of 7 places in 22 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/333 variables, 5/640 constraints. Problems are: Problem set: 0 solved, 190 unsolved
[2024-05-30 04:06:56] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 0 ms to minimize.
[2024-05-30 04:06:56] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 1 ms to minimize.
[2024-05-30 04:06:57] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/333 variables, 3/643 constraints. Problems are: Problem set: 0 solved, 190 unsolved
[2024-05-30 04:07:03] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 1 ms to minimize.
[2024-05-30 04:07:03] [INFO ] Deduced a trap composed of 6 places in 28 ms of which 1 ms to minimize.
[2024-05-30 04:07:03] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 1 ms to minimize.
[2024-05-30 04:07:04] [INFO ] Deduced a trap composed of 11 places in 23 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/333 variables, 4/647 constraints. Problems are: Problem set: 0 solved, 190 unsolved
[2024-05-30 04:07:10] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 1 ms to minimize.
[2024-05-30 04:07:12] [INFO ] Deduced a trap composed of 15 places in 23 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 333/333 variables, and 649 constraints, problems are : Problem set: 0 solved, 190 unsolved in 30023 ms.
Refiners :[Domain max(s): 142/142 constraints, Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 142/142 constraints, PredecessorRefiner: 190/190 constraints, Known Traps: 134/134 constraints]
After SMT, in 49989ms problems are : Problem set: 0 solved, 190 unsolved
Search for dead transitions found 0 dead transitions in 49991ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50258 ms. Remains : 142/142 places, 191/191 transitions.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2024-05-30 04:07:13] [INFO ] Flatten gal took : 25 ms
[2024-05-30 04:07:13] [INFO ] Applying decomposition
[2024-05-30 04:07:13] [INFO ] Flatten gal took : 19 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph4589052545594862555.txt' '-o' '/tmp/graph4589052545594862555.bin' '-w' '/tmp/graph4589052545594862555.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4589052545594862555.bin' '-l' '-1' '-v' '-w' '/tmp/graph4589052545594862555.weights' '-q' '0' '-e' '0.001'
[2024-05-30 04:07:14] [INFO ] Decomposing Gal with order
[2024-05-30 04:07:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 04:07:14] [INFO ] Removed a total of 207 redundant transitions.
[2024-05-30 04:07:14] [INFO ] Flatten gal took : 52 ms
[2024-05-30 04:07:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 192 labels/synchronizations in 11 ms.
[2024-05-30 04:07:14] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality537462968504122171.gal : 4 ms
[2024-05-30 04:07:14] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10776557796222832702.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality537462968504122171.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10776557796222832702.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...307
Loading property file /tmp/ReachabilityCardinality10776557796222832702.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 11
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :11 after 45
Detected timeout of ITS tools.
[2024-05-30 04:37:14] [INFO ] Flatten gal took : 18 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin9916523603908695660
[2024-05-30 04:37:14] [INFO ] Applying decomposition
[2024-05-30 04:37:14] [INFO ] Flatten gal took : 14 ms
[2024-05-30 04:37:14] [INFO ] Computing symmetric may disable matrix : 191 transitions.
[2024-05-30 04:37:14] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 04:37:14] [INFO ] Computing symmetric may enable matrix : 191 transitions.
[2024-05-30 04:37:14] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph15882925168426925941.txt' '-o' '/tmp/graph15882925168426925941.bin' '-w' '/tmp/graph15882925168426925941.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph15882925168426925941.bin' '-l' '-1' '-v' '-w' '/tmp/graph15882925168426925941.weights' '-q' '0' '-e' '0.001'
[2024-05-30 04:37:14] [INFO ] Computing Do-Not-Accords matrix : 191 transitions.
[2024-05-30 04:37:14] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 04:37:14] [INFO ] Decomposing Gal with order
[2024-05-30 04:37:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 04:37:14] [INFO ] Built C files in 48ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9916523603908695660
Running compilation step : cd /tmp/ltsmin9916523603908695660;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2024-05-30 04:37:14] [INFO ] Removed a total of 219 redundant transitions.
[2024-05-30 04:37:14] [INFO ] Flatten gal took : 25 ms
[2024-05-30 04:37:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 152 labels/synchronizations in 6 ms.
[2024-05-30 04:37:14] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability17548611385078711416.gal : 2 ms
[2024-05-30 04:37:14] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability10571858114406090375.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityFireability17548611385078711416.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability10571858114406090375.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...309
Loading property file /tmp/ReachabilityFireability10571858114406090375.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 12
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :12 after 132
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :132 after 67684
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :67684 after 1.7624e+06
Compilation finished in 601 ms.
Running link step : cd /tmp/ltsmin9916523603908695660;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 46 ms.
Running LTSmin : cd /tmp/ltsmin9916523603908695660;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'ShieldRVsPT010AReachabilityFireability202402==true'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 1/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.008: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.007: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.008: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.008: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.009: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.009: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.011: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.014: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.021: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.022: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.022: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.024: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.024: Initializing POR dependencies: labels 192, guards 191
pins2lts-mc-linux64( 6/ 8), 0.027: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.027: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.027: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.027: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.027: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.027: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.029: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.035: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.035: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.219: Forcing use of the an ignoring proviso (closed-set)
pins2lts-mc-linux64( 0/ 8), 0.245: "ShieldRVsPT010AReachabilityFireability202402==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 1/ 8), 0.245: "ShieldRVsPT010AReachabilityFireability202402==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 0.245: There are 192 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.245: State length is 142, there are 191 groups
pins2lts-mc-linux64( 0/ 8), 0.245: Running bfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.245: Using a non-indexing tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.245: Successor permutation: none
pins2lts-mc-linux64( 0/ 8), 0.245: Visible groups: 0 / 191, labels: 1 / 192
pins2lts-mc-linux64( 0/ 8), 0.245: POR cycle proviso: closed-set
pins2lts-mc-linux64( 0/ 8), 0.245: Global bits: 0, count bits: 0, local bits: 0
pins2lts-mc-linux64( 5/ 8), 0.243: "ShieldRVsPT010AReachabilityFireability202402==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 3/ 8), 0.245: "ShieldRVsPT010AReachabilityFireability202402==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 6/ 8), 0.243: "ShieldRVsPT010AReachabilityFireability202402==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 7/ 8), 0.244: "ShieldRVsPT010AReachabilityFireability202402==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 4/ 8), 0.245: "ShieldRVsPT010AReachabilityFireability202402==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 2/ 8), 0.245: "ShieldRVsPT010AReachabilityFireability202402==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 0.274: ~10 levels ~960 states ~3752 transitions
pins2lts-mc-linux64( 0/ 8), 0.297: ~11 levels ~1920 states ~8056 transitions
pins2lts-mc-linux64( 0/ 8), 0.342: ~13 levels ~3840 states ~18072 transitions
pins2lts-mc-linux64( 0/ 8), 0.417: ~15 levels ~7680 states ~40312 transitions
pins2lts-mc-linux64( 0/ 8), 0.621: ~17 levels ~15360 states ~88872 transitions
pins2lts-mc-linux64( 0/ 8), 0.963: ~18 levels ~30720 states ~187384 transitions
pins2lts-mc-linux64( 4/ 8), 1.651: ~9 levels ~61440 states ~378936 transitions
pins2lts-mc-linux64( 4/ 8), 2.925: ~10 levels ~122880 states ~804448 transitions
pins2lts-mc-linux64( 3/ 8), 5.128: ~12 levels ~245760 states ~1744824 transitions
pins2lts-mc-linux64( 4/ 8), 9.035: ~12 levels ~491520 states ~3552664 transitions
pins2lts-mc-linux64( 3/ 8), 16.930: ~14 levels ~983040 states ~7540128 transitions
pins2lts-mc-linux64( 1/ 8), 32.836: ~12 levels ~1966080 states ~15534448 transitions
pins2lts-mc-linux64( 4/ 8), 66.722: ~15 levels ~3932160 states ~32287664 transitions
pins2lts-mc-linux64( 4/ 8), 156.594: ~17 levels ~7864320 states ~66727080 transitions
pins2lts-mc-linux64( 4/ 8), 349.371: ~18 levels ~15728640 states ~137983152 transitions
pins2lts-mc-linux64( 1/ 8), 656.306: ~16 levels ~31457280 states ~282596368 transitions
pins2lts-mc-linux64( 1/ 8), 1397.459: ~18 levels ~62914560 states ~584788712 transitions
pins2lts-mc-linux64( 7/ 8), 1670.206: Error: tree roots table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 1670.264:
pins2lts-mc-linux64( 0/ 8), 1670.264: mean standard work distribution: 5.9% (states) 2.8% (transitions)
pins2lts-mc-linux64( 0/ 8), 1670.264:
pins2lts-mc-linux64( 0/ 8), 1670.264: Explored 69733087 states 682179651 transitions, fanout: 9.783
pins2lts-mc-linux64( 0/ 8), 1670.264: Total exploration time 1670.010 sec (1669.970 sec minimum, 1669.987 sec on average)
pins2lts-mc-linux64( 0/ 8), 1670.264: States per second: 41756, Transitions per second: 408488
pins2lts-mc-linux64( 0/ 8), 1670.264: Ignoring proviso: 2339381
pins2lts-mc-linux64( 0/ 8), 1670.264:
pins2lts-mc-linux64( 0/ 8), 1670.264: Queue width: 8B, total height: 64484290, memory: 491.98MB
pins2lts-mc-linux64( 0/ 8), 1670.264: Tree memory: 1040.7MB, 8.1 B/state, compr.: 1.4%
pins2lts-mc-linux64( 0/ 8), 1670.264: Tree fill ratio (roots/leafs): 99.0%/6.0%
pins2lts-mc-linux64( 0/ 8), 1670.264: Stored 191 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 1670.264: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 1670.264: Est. total memory use: 1532.7MB (~1516.0MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin9916523603908695660;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'ShieldRVsPT010AReachabilityFireability202402==true'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin9916523603908695660;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'ShieldRVsPT010AReachabilityFireability202402==true'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:241)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:176)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:114)
at java.base/java.lang.Thread.run(Thread.java:840)

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldRVs-PT-010A"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is ShieldRVs-PT-010A, 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 r356-tall-171683761900791"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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