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.r480-tall-171624189800682.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 DES-PT-20a, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r480-tall-171624189800682
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 540K
-rw-r--r-- 1 mcc users 7.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Apr 22 14:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 22 14:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 22 14:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 22 14:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 12 08:39 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 169K Apr 12 08:39 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Apr 12 08:34 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 47K Apr 12 08:34 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Apr 22 14:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Apr 22 14:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 57K May 18 16:42 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME DES-PT-20a-CTLFireability-2024-00
FORMULA_NAME DES-PT-20a-CTLFireability-2024-01
FORMULA_NAME DES-PT-20a-CTLFireability-2024-02
FORMULA_NAME DES-PT-20a-CTLFireability-2024-03
FORMULA_NAME DES-PT-20a-CTLFireability-2024-04
FORMULA_NAME DES-PT-20a-CTLFireability-2024-05
FORMULA_NAME DES-PT-20a-CTLFireability-2024-06
FORMULA_NAME DES-PT-20a-CTLFireability-2024-07
FORMULA_NAME DES-PT-20a-CTLFireability-2024-08
FORMULA_NAME DES-PT-20a-CTLFireability-2024-09
FORMULA_NAME DES-PT-20a-CTLFireability-2024-10
FORMULA_NAME DES-PT-20a-CTLFireability-2024-11
FORMULA_NAME DES-PT-20a-CTLFireability-2023-12
FORMULA_NAME DES-PT-20a-CTLFireability-2023-13
FORMULA_NAME DES-PT-20a-CTLFireability-2023-14
FORMULA_NAME DES-PT-20a-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1717193414784

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DES-PT-20a
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 22:10:16] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-31 22:10:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 22:10:16] [INFO ] Load time of PNML (sax parser for PT used): 107 ms
[2024-05-31 22:10:16] [INFO ] Transformed 195 places.
[2024-05-31 22:10:16] [INFO ] Transformed 152 transitions.
[2024-05-31 22:10:16] [INFO ] Found NUPN structural information;
[2024-05-31 22:10:16] [INFO ] Parsed PT model containing 195 places and 152 transitions and 742 arcs in 229 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 15 ms.
Ensure Unique test removed 14 transitions
Reduce redundant transitions removed 14 transitions.
Support contains 111 out of 195 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 195/195 places, 138/138 transitions.
Applied a total of 0 rules in 25 ms. Remains 195 /195 variables (removed 0) and now considering 138/138 (removed 0) transitions.
// Phase 1: matrix 138 rows 195 cols
[2024-05-31 22:10:16] [INFO ] Computed 59 invariants in 34 ms
[2024-05-31 22:10:17] [INFO ] Implicit Places using invariants in 453 ms returned [92]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 552 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 194/195 places, 138/138 transitions.
Applied a total of 0 rules in 5 ms. Remains 194 /194 variables (removed 0) and now considering 138/138 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 609 ms. Remains : 194/195 places, 138/138 transitions.
Support contains 111 out of 194 places after structural reductions.
[2024-05-31 22:10:17] [INFO ] Flatten gal took : 61 ms
[2024-05-31 22:10:17] [INFO ] Flatten gal took : 28 ms
[2024-05-31 22:10:17] [INFO ] Input system was already deterministic with 138 transitions.
Reduction of identical properties reduced properties to check from 67 to 65
RANDOM walk for 40000 steps (883 resets) in 1999 ms. (20 steps per ms) remains 21/65 properties
BEST_FIRST walk for 4001 steps (19 resets) in 39 ms. (100 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (19 resets) in 21 ms. (181 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (26 resets) in 43 ms. (90 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (19 resets) in 100 ms. (39 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (18 resets) in 108 ms. (36 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (18 resets) in 105 ms. (37 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (25 resets) in 65 ms. (60 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (15 resets) in 29 ms. (133 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (19 resets) in 26 ms. (148 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (17 resets) in 25 ms. (153 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (23 resets) in 20 ms. (190 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (24 resets) in 17 ms. (222 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (18 resets) in 26 ms. (148 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (17 resets) in 26 ms. (148 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (21 resets) in 17 ms. (222 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (20 resets) in 18 ms. (210 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (16 resets) in 23 ms. (166 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (23 resets) in 22 ms. (174 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (19 resets) in 15 ms. (250 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4001 steps (17 resets) in 29 ms. (133 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (19 resets) in 20 ms. (190 steps per ms) remains 21/21 properties
// Phase 1: matrix 138 rows 194 cols
[2024-05-31 22:10:18] [INFO ] Computed 58 invariants in 18 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/33 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (OVERLAPS) 20/53 variables, 9/42 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (OVERLAPS) 50/103 variables, 24/86 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/103 variables, 50/136 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/103 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 21 unsolved
Problem AtomicPropp34 is UNSAT
At refinement iteration 8 (OVERLAPS) 67/170 variables, 23/159 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/170 variables, 67/226 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/170 variables, 0/226 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 11 (OVERLAPS) 6/176 variables, 2/228 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/176 variables, 6/234 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/176 variables, 0/234 constraints. Problems are: Problem set: 1 solved, 20 unsolved
Problem AtomicPropp38 is UNSAT
At refinement iteration 14 (OVERLAPS) 137/313 variables, 176/410 constraints. Problems are: Problem set: 2 solved, 19 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/313 variables, 0/410 constraints. Problems are: Problem set: 2 solved, 19 unsolved
At refinement iteration 16 (OVERLAPS) 19/332 variables, 18/428 constraints. Problems are: Problem set: 2 solved, 19 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/332 variables, 18/446 constraints. Problems are: Problem set: 2 solved, 19 unsolved
[2024-05-31 22:10:20] [INFO ] Deduced a trap composed of 17 places in 111 ms of which 25 ms to minimize.
[2024-05-31 22:10:20] [INFO ] Deduced a trap composed of 12 places in 65 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/332 variables, 2/448 constraints. Problems are: Problem set: 2 solved, 19 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/332 variables, 0/448 constraints. Problems are: Problem set: 2 solved, 19 unsolved
At refinement iteration 20 (OVERLAPS) 0/332 variables, 0/448 constraints. Problems are: Problem set: 2 solved, 19 unsolved
No progress, stopping.
After SMT solving in domain Real declared 332/332 variables, and 448 constraints, problems are : Problem set: 2 solved, 19 unsolved in 2700 ms.
Refiners :[Domain max(s): 194/194 constraints, Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 194/194 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 2 solved, 19 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 29/29 constraints. Problems are: Problem set: 2 solved, 19 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/29 variables, 0/29 constraints. Problems are: Problem set: 2 solved, 19 unsolved
At refinement iteration 2 (OVERLAPS) 17/46 variables, 8/37 constraints. Problems are: Problem set: 2 solved, 19 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/46 variables, 17/54 constraints. Problems are: Problem set: 2 solved, 19 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 0/54 constraints. Problems are: Problem set: 2 solved, 19 unsolved
At refinement iteration 5 (OVERLAPS) 55/101 variables, 25/79 constraints. Problems are: Problem set: 2 solved, 19 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/101 variables, 55/134 constraints. Problems are: Problem set: 2 solved, 19 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/101 variables, 0/134 constraints. Problems are: Problem set: 2 solved, 19 unsolved
At refinement iteration 8 (OVERLAPS) 69/170 variables, 23/157 constraints. Problems are: Problem set: 2 solved, 19 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/170 variables, 69/226 constraints. Problems are: Problem set: 2 solved, 19 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/170 variables, 2/228 constraints. Problems are: Problem set: 2 solved, 19 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/170 variables, 0/228 constraints. Problems are: Problem set: 2 solved, 19 unsolved
At refinement iteration 12 (OVERLAPS) 6/176 variables, 2/230 constraints. Problems are: Problem set: 2 solved, 19 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/176 variables, 6/236 constraints. Problems are: Problem set: 2 solved, 19 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/176 variables, 0/236 constraints. Problems are: Problem set: 2 solved, 19 unsolved
At refinement iteration 15 (OVERLAPS) 137/313 variables, 176/412 constraints. Problems are: Problem set: 2 solved, 19 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/313 variables, 5/417 constraints. Problems are: Problem set: 2 solved, 19 unsolved
[2024-05-31 22:10:22] [INFO ] Deduced a trap composed of 16 places in 64 ms of which 1 ms to minimize.
[2024-05-31 22:10:22] [INFO ] Deduced a trap composed of 22 places in 47 ms of which 1 ms to minimize.
[2024-05-31 22:10:22] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/313 variables, 3/420 constraints. Problems are: Problem set: 2 solved, 19 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/313 variables, 0/420 constraints. Problems are: Problem set: 2 solved, 19 unsolved
At refinement iteration 19 (OVERLAPS) 19/332 variables, 18/438 constraints. Problems are: Problem set: 2 solved, 19 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/332 variables, 18/456 constraints. Problems are: Problem set: 2 solved, 19 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/332 variables, 14/470 constraints. Problems are: Problem set: 2 solved, 19 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 332/332 variables, and 470 constraints, problems are : Problem set: 2 solved, 19 unsolved in 5022 ms.
Refiners :[Domain max(s): 194/194 constraints, Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 194/194 constraints, PredecessorRefiner: 19/21 constraints, Known Traps: 5/5 constraints]
After SMT, in 7797ms problems are : Problem set: 2 solved, 19 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 29 out of 194 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 194/194 places, 138/138 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 194 transition count 136
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 193 transition count 135
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 193 transition count 135
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 8 place count 193 transition count 135
Applied a total of 8 rules in 66 ms. Remains 193 /194 variables (removed 1) and now considering 135/138 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66 ms. Remains : 193/194 places, 135/138 transitions.
RANDOM walk for 40000 steps (530 resets) in 712 ms. (56 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (15 resets) in 25 ms. (153 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (10 resets) in 16 ms. (235 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (28 resets) in 17 ms. (222 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (9 resets) in 13 ms. (285 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (9 resets) in 13 ms. (285 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (27 resets) in 17 ms. (222 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (11 resets) in 17 ms. (222 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (10 resets) in 20 ms. (190 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (10 resets) in 23 ms. (166 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (25 resets) in 26 ms. (148 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (27 resets) in 20 ms. (190 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (11 resets) in 15 ms. (250 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (25 resets) in 21 ms. (182 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (9 resets) in 12 ms. (307 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (8 resets) in 39 ms. (100 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (9 resets) in 16 ms. (235 steps per ms) remains 19/19 properties
Interrupted probabilistic random walk after 620606 steps, run timeout after 3001 ms. (steps per millisecond=206 ) properties seen :0 out of 19
Probabilistic random walk after 620606 steps, saw 89127 distinct states, run finished after 3005 ms. (steps per millisecond=206 ) properties seen :0
// Phase 1: matrix 135 rows 193 cols
[2024-05-31 22:10:29] [INFO ] Computed 60 invariants in 3 ms
[2024-05-31 22:10:29] [INFO ] State equation strengthened by 2 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (OVERLAPS) 17/46 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (OVERLAPS) 63/109 variables, 28/36 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/109 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 5 (OVERLAPS) 69/178 variables, 24/60 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/178 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 7 (OVERLAPS) 135/313 variables, 178/238 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/313 variables, 2/240 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/313 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 10 (OVERLAPS) 15/328 variables, 15/255 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/328 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 12 (OVERLAPS) 0/328 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 19 unsolved
No progress, stopping.
After SMT solving in domain Real declared 328/328 variables, and 255 constraints, problems are : Problem set: 0 solved, 19 unsolved in 1155 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 193/193 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 19 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (OVERLAPS) 17/46 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (OVERLAPS) 63/109 variables, 28/36 constraints. Problems are: Problem set: 0 solved, 19 unsolved
[2024-05-31 22:10:31] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/109 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/109 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 6 (OVERLAPS) 69/178 variables, 24/61 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/178 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 8 (OVERLAPS) 135/313 variables, 178/239 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/313 variables, 2/241 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/313 variables, 5/246 constraints. Problems are: Problem set: 0 solved, 19 unsolved
[2024-05-31 22:10:31] [INFO ] Deduced a trap composed of 12 places in 43 ms of which 1 ms to minimize.
[2024-05-31 22:10:31] [INFO ] Deduced a trap composed of 8 places in 60 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/313 variables, 2/248 constraints. Problems are: Problem set: 0 solved, 19 unsolved
[2024-05-31 22:10:32] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 1 ms to minimize.
[2024-05-31 22:10:32] [INFO ] Deduced a trap composed of 17 places in 79 ms of which 3 ms to minimize.
[2024-05-31 22:10:32] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 1 ms to minimize.
[2024-05-31 22:10:32] [INFO ] Deduced a trap composed of 7 places in 43 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/313 variables, 4/252 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/313 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 14 (OVERLAPS) 15/328 variables, 15/267 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/328 variables, 14/281 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/328 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 19 unsolved
[2024-05-31 22:10:34] [INFO ] Deduced a trap composed of 13 places in 54 ms of which 1 ms to minimize.
[2024-05-31 22:10:35] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 0 ms to minimize.
At refinement iteration 17 (OVERLAPS) 0/328 variables, 2/283 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/328 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 19 unsolved
[2024-05-31 22:10:37] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 1 ms to minimize.
[2024-05-31 22:10:37] [INFO ] Deduced a trap composed of 11 places in 43 ms of which 0 ms to minimize.
At refinement iteration 19 (OVERLAPS) 0/328 variables, 2/285 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/328 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 21 (OVERLAPS) 0/328 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 19 unsolved
No progress, stopping.
After SMT solving in domain Int declared 328/328 variables, and 285 constraints, problems are : Problem set: 0 solved, 19 unsolved in 9294 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 193/193 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 11/11 constraints]
After SMT, in 10480ms problems are : Problem set: 0 solved, 19 unsolved
Parikh walk visited 1 properties in 2780 ms.
Support contains 27 out of 193 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 193/193 places, 135/135 transitions.
Applied a total of 0 rules in 18 ms. Remains 193 /193 variables (removed 0) and now considering 135/135 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 193/193 places, 135/135 transitions.
RANDOM walk for 40000 steps (539 resets) in 345 ms. (115 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (9 resets) in 37 ms. (105 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (10 resets) in 16 ms. (235 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (28 resets) in 20 ms. (190 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (9 resets) in 15 ms. (250 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (8 resets) in 11 ms. (333 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4001 steps (27 resets) in 12 ms. (307 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (10 resets) in 9 ms. (400 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4001 steps (11 resets) in 10 ms. (363 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (9 resets) in 11 ms. (333 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (26 resets) in 12 ms. (307 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (28 resets) in 13 ms. (285 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (12 resets) in 12 ms. (307 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (9 resets) in 13 ms. (286 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (28 resets) in 13 ms. (285 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (10 resets) in 13 ms. (286 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (11 resets) in 9 ms. (400 steps per ms) remains 18/18 properties
Interrupted probabilistic random walk after 667232 steps, run timeout after 3001 ms. (steps per millisecond=222 ) properties seen :0 out of 18
Probabilistic random walk after 667232 steps, saw 95943 distinct states, run finished after 3001 ms. (steps per millisecond=222 ) properties seen :0
[2024-05-31 22:10:46] [INFO ] Invariant cache hit.
[2024-05-31 22:10:46] [INFO ] State equation strengthened by 2 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 17/44 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (OVERLAPS) 63/107 variables, 28/36 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/107 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (OVERLAPS) 70/177 variables, 24/60 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/177 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 7 (OVERLAPS) 135/312 variables, 177/237 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/312 variables, 2/239 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/312 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 10 (OVERLAPS) 16/328 variables, 16/255 constraints. Problems are: Problem set: 0 solved, 18 unsolved
[2024-05-31 22:10:47] [INFO ] Deduced a trap composed of 6 places in 57 ms of which 1 ms to minimize.
[2024-05-31 22:10:47] [INFO ] Deduced a trap composed of 11 places in 54 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/328 variables, 2/257 constraints. Problems are: Problem set: 0 solved, 18 unsolved
[2024-05-31 22:10:47] [INFO ] Deduced a trap composed of 12 places in 56 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/328 variables, 1/258 constraints. Problems are: Problem set: 0 solved, 18 unsolved
[2024-05-31 22:10:47] [INFO ] Deduced a trap composed of 7 places in 37 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/328 variables, 1/259 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/328 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 15 (OVERLAPS) 0/328 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Real declared 328/328 variables, and 259 constraints, problems are : Problem set: 0 solved, 18 unsolved in 1970 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 193/193 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 18 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 17/44 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (OVERLAPS) 63/107 variables, 28/36 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/107 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/107 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 6 (OVERLAPS) 70/177 variables, 24/61 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/177 variables, 3/64 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/177 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 9 (OVERLAPS) 135/312 variables, 177/241 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/312 variables, 2/243 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/312 variables, 5/248 constraints. Problems are: Problem set: 0 solved, 18 unsolved
[2024-05-31 22:10:49] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 1 ms to minimize.
[2024-05-31 22:10:49] [INFO ] Deduced a trap composed of 21 places in 51 ms of which 1 ms to minimize.
[2024-05-31 22:10:49] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 1 ms to minimize.
[2024-05-31 22:10:49] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 1 ms to minimize.
[2024-05-31 22:10:49] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 1 ms to minimize.
[2024-05-31 22:10:49] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/312 variables, 6/254 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/312 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 14 (OVERLAPS) 16/328 variables, 16/270 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/328 variables, 13/283 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/328 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 18 unsolved
[2024-05-31 22:10:51] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 1 ms to minimize.
At refinement iteration 17 (OVERLAPS) 0/328 variables, 1/284 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/328 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 19 (OVERLAPS) 0/328 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Int declared 328/328 variables, and 284 constraints, problems are : Problem set: 0 solved, 18 unsolved in 6585 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 193/193 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 11/11 constraints]
After SMT, in 8574ms problems are : Problem set: 0 solved, 18 unsolved
Parikh walk visited 0 properties in 2170 ms.
Support contains 27 out of 193 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 193/193 places, 135/135 transitions.
Applied a total of 0 rules in 18 ms. Remains 193 /193 variables (removed 0) and now considering 135/135 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 193/193 places, 135/135 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 193/193 places, 135/135 transitions.
Applied a total of 0 rules in 6 ms. Remains 193 /193 variables (removed 0) and now considering 135/135 (removed 0) transitions.
[2024-05-31 22:10:57] [INFO ] Invariant cache hit.
[2024-05-31 22:10:57] [INFO ] Implicit Places using invariants in 147 ms returned []
[2024-05-31 22:10:57] [INFO ] Invariant cache hit.
[2024-05-31 22:10:57] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-31 22:10:57] [INFO ] Implicit Places using invariants and state equation in 229 ms returned []
Implicit Place search using SMT with State Equation took 387 ms to find 0 implicit places.
[2024-05-31 22:10:57] [INFO ] Redundant transitions in 2 ms returned []
Running 134 sub problems to find dead transitions.
[2024-05-31 22:10:57] [INFO ] Invariant cache hit.
[2024-05-31 22:10:57] [INFO ] State equation strengthened by 2 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 2 (OVERLAPS) 1/193 variables, 36/47 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/193 variables, 13/60 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/193 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 5 (OVERLAPS) 135/328 variables, 193/253 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/328 variables, 2/255 constraints. Problems are: Problem set: 0 solved, 134 unsolved
[2024-05-31 22:10:59] [INFO ] Deduced a trap composed of 7 places in 54 ms of which 0 ms to minimize.
[2024-05-31 22:10:59] [INFO ] Deduced a trap composed of 19 places in 61 ms of which 2 ms to minimize.
[2024-05-31 22:10:59] [INFO ] Deduced a trap composed of 21 places in 60 ms of which 1 ms to minimize.
[2024-05-31 22:10:59] [INFO ] Deduced a trap composed of 20 places in 66 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/328 variables, 4/259 constraints. Problems are: Problem set: 0 solved, 134 unsolved
[2024-05-31 22:11:00] [INFO ] Deduced a trap composed of 12 places in 89 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/328 variables, 1/260 constraints. Problems are: Problem set: 0 solved, 134 unsolved
[2024-05-31 22:11:02] [INFO ] Deduced a trap composed of 8 places in 50 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/328 variables, 1/261 constraints. Problems are: Problem set: 0 solved, 134 unsolved
[2024-05-31 22:11:02] [INFO ] Deduced a trap composed of 19 places in 60 ms of which 1 ms to minimize.
[2024-05-31 22:11:03] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 4 ms to minimize.
[2024-05-31 22:11:03] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/328 variables, 3/264 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/328 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 134 unsolved
[2024-05-31 22:11:05] [INFO ] Deduced a trap composed of 10 places in 59 ms of which 1 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/328 variables, 1/265 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/328 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 14 (OVERLAPS) 0/328 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 134 unsolved
No progress, stopping.
After SMT solving in domain Real declared 328/328 variables, and 265 constraints, problems are : Problem set: 0 solved, 134 unsolved in 10723 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 193/193 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 134/134 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 134 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 2 (OVERLAPS) 1/193 variables, 36/47 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/193 variables, 13/60 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/193 variables, 10/70 constraints. Problems are: Problem set: 0 solved, 134 unsolved
[2024-05-31 22:11:08] [INFO ] Deduced a trap composed of 11 places in 45 ms of which 0 ms to minimize.
[2024-05-31 22:11:09] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 1 ms to minimize.
[2024-05-31 22:11:09] [INFO ] Deduced a trap composed of 8 places in 37 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/193 variables, 3/73 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/193 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 7 (OVERLAPS) 135/328 variables, 193/266 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/328 variables, 2/268 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/328 variables, 134/402 constraints. Problems are: Problem set: 0 solved, 134 unsolved
[2024-05-31 22:11:14] [INFO ] Deduced a trap composed of 7 places in 38 ms of which 1 ms to minimize.
[2024-05-31 22:11:14] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/328 variables, 2/404 constraints. Problems are: Problem set: 0 solved, 134 unsolved
[2024-05-31 22:11:22] [INFO ] Deduced a trap composed of 18 places in 58 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/328 variables, 1/405 constraints. Problems are: Problem set: 0 solved, 134 unsolved
[2024-05-31 22:11:31] [INFO ] Deduced a trap composed of 8 places in 49 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/328 variables, 1/406 constraints. Problems are: Problem set: 0 solved, 134 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 328/328 variables, and 406 constraints, problems are : Problem set: 0 solved, 134 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 193/193 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 134/134 constraints, Known Traps: 17/17 constraints]
After SMT, in 40806ms problems are : Problem set: 0 solved, 134 unsolved
Search for dead transitions found 0 dead transitions in 40810ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41215 ms. Remains : 193/193 places, 135/135 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 6 ms. Remains 193 /193 variables (removed 0) and now considering 135/135 (removed 0) transitions.
Running SMT prover for 18 properties.
[2024-05-31 22:11:38] [INFO ] Invariant cache hit.
[2024-05-31 22:11:38] [INFO ] [Real]Absence check using 36 positive place invariants in 7 ms returned sat
[2024-05-31 22:11:38] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 9 ms returned sat
[2024-05-31 22:11:38] [INFO ] After 184ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:18
[2024-05-31 22:11:38] [INFO ] [Nat]Absence check using 36 positive place invariants in 7 ms returned sat
[2024-05-31 22:11:38] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 11 ms returned sat
[2024-05-31 22:11:39] [INFO ] After 373ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :18
TRAPS : Iteration 0
[2024-05-31 22:11:39] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 1 ms to minimize.
[2024-05-31 22:11:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 54 ms
TRAPS : Iteration 1
[2024-05-31 22:11:39] [INFO ] After 1277ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :18
[2024-05-31 22:11:40] [INFO ] After 1782ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :18
Over-approximation ignoring read arcs solved 0 properties in 1999 ms.
Successfully simplified 2 atomic propositions for a total of 16 simplifications.
[2024-05-31 22:11:40] [INFO ] Flatten gal took : 15 ms
[2024-05-31 22:11:40] [INFO ] Flatten gal took : 16 ms
[2024-05-31 22:11:40] [INFO ] Input system was already deterministic with 138 transitions.
Computed a total of 97 stabilizing places and 92 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 194/194 places, 138/138 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 193 transition count 137
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 193 transition count 137
Applied a total of 2 rules in 4 ms. Remains 193 /194 variables (removed 1) and now considering 137/138 (removed 1) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 193/194 places, 137/138 transitions.
[2024-05-31 22:11:40] [INFO ] Flatten gal took : 10 ms
[2024-05-31 22:11:40] [INFO ] Flatten gal took : 11 ms
[2024-05-31 22:11:40] [INFO ] Input system was already deterministic with 137 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 194/194 places, 138/138 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 193 transition count 137
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 193 transition count 137
Applied a total of 2 rules in 14 ms. Remains 193 /194 variables (removed 1) and now considering 137/138 (removed 1) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 15 ms. Remains : 193/194 places, 137/138 transitions.
[2024-05-31 22:11:40] [INFO ] Flatten gal took : 11 ms
[2024-05-31 22:11:40] [INFO ] Flatten gal took : 11 ms
[2024-05-31 22:11:40] [INFO ] Input system was already deterministic with 137 transitions.
RANDOM walk for 40000 steps (883 resets) in 237 ms. (168 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (206 resets) in 64 ms. (615 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1701629 steps, run timeout after 3001 ms. (steps per millisecond=567 ) properties seen :0 out of 1
Probabilistic random walk after 1701629 steps, saw 232540 distinct states, run finished after 3002 ms. (steps per millisecond=566 ) properties seen :0
// Phase 1: matrix 137 rows 193 cols
[2024-05-31 22:11:43] [INFO ] Computed 58 invariants in 7 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 75/79 variables, 32/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/79 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 86/165 variables, 23/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/165 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 6/171 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/171 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 136/307 variables, 171/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/307 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 23/330 variables, 22/251 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/330 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/330 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 330/330 variables, and 251 constraints, problems are : Problem set: 0 solved, 1 unsolved in 146 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 193/193 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 75/79 variables, 32/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/79 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 86/165 variables, 23/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/165 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 6/171 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/171 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 136/307 variables, 171/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/307 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 23/330 variables, 22/251 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/330 variables, 1/252 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/330 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/330 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 330/330 variables, and 252 constraints, problems are : Problem set: 0 solved, 1 unsolved in 177 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 193/193 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 338ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 151 ms.
Support contains 2 out of 193 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 193/193 places, 137/137 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 193 transition count 135
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 1 with 5 rules applied. Total rules applied 7 place count 193 transition count 135
Applied a total of 7 rules in 19 ms. Remains 193 /193 variables (removed 0) and now considering 135/137 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 193/193 places, 135/137 transitions.
RANDOM walk for 4000000 steps (53758 resets) in 16320 ms. (245 steps per ms) remains 1/1 properties
BEST_FIRST walk for 4000003 steps (9618 resets) in 6168 ms. (648 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 10166416 steps, run timeout after 18001 ms. (steps per millisecond=564 ) properties seen :0 out of 1
Probabilistic random walk after 10166416 steps, saw 1288834 distinct states, run finished after 18001 ms. (steps per millisecond=564 ) properties seen :0
// Phase 1: matrix 135 rows 193 cols
[2024-05-31 22:12:08] [INFO ] Computed 60 invariants in 9 ms
[2024-05-31 22:12:08] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 81/85 variables, 34/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/85 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 89/174 variables, 25/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/174 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 135/309 variables, 174/234 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/309 variables, 2/236 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/309 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 19/328 variables, 19/255 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/328 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/328 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 328/328 variables, and 255 constraints, problems are : Problem set: 0 solved, 1 unsolved in 150 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 193/193 constraints, ReadFeed: 2/2 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 81/85 variables, 34/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/85 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 89/174 variables, 25/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 22:12:08] [INFO ] Deduced a trap composed of 16 places in 71 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/174 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/174 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 135/309 variables, 174/235 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/309 variables, 2/237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/309 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 19/328 variables, 19/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/328 variables, 1/257 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 22:12:09] [INFO ] Deduced a trap composed of 12 places in 72 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/328 variables, 1/258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/328 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/328 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 328/328 variables, and 258 constraints, problems are : Problem set: 0 solved, 1 unsolved in 372 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 193/193 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 550ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 146 ms.
Support contains 2 out of 193 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 193/193 places, 135/135 transitions.
Applied a total of 0 rules in 7 ms. Remains 193 /193 variables (removed 0) and now considering 135/135 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 193/193 places, 135/135 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 193/193 places, 135/135 transitions.
Applied a total of 0 rules in 13 ms. Remains 193 /193 variables (removed 0) and now considering 135/135 (removed 0) transitions.
[2024-05-31 22:12:09] [INFO ] Invariant cache hit.
[2024-05-31 22:12:09] [INFO ] Implicit Places using invariants in 241 ms returned []
[2024-05-31 22:12:09] [INFO ] Invariant cache hit.
[2024-05-31 22:12:09] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-31 22:12:09] [INFO ] Implicit Places using invariants and state equation in 244 ms returned []
Implicit Place search using SMT with State Equation took 490 ms to find 0 implicit places.
[2024-05-31 22:12:09] [INFO ] Redundant transitions in 5 ms returned []
Running 134 sub problems to find dead transitions.
[2024-05-31 22:12:09] [INFO ] Invariant cache hit.
[2024-05-31 22:12:09] [INFO ] State equation strengthened by 2 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 2 (OVERLAPS) 1/193 variables, 35/46 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/193 variables, 14/60 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/193 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 5 (OVERLAPS) 135/328 variables, 193/253 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/328 variables, 2/255 constraints. Problems are: Problem set: 0 solved, 134 unsolved
[2024-05-31 22:12:11] [INFO ] Deduced a trap composed of 22 places in 66 ms of which 1 ms to minimize.
[2024-05-31 22:12:11] [INFO ] Deduced a trap composed of 23 places in 66 ms of which 1 ms to minimize.
[2024-05-31 22:12:11] [INFO ] Deduced a trap composed of 7 places in 46 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/328 variables, 3/258 constraints. Problems are: Problem set: 0 solved, 134 unsolved
[2024-05-31 22:12:12] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 1 ms to minimize.
[2024-05-31 22:12:12] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 1 ms to minimize.
[2024-05-31 22:12:12] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 1 ms to minimize.
[2024-05-31 22:12:12] [INFO ] Deduced a trap composed of 11 places in 44 ms of which 1 ms to minimize.
[2024-05-31 22:12:13] [INFO ] Deduced a trap composed of 19 places in 62 ms of which 1 ms to minimize.
[2024-05-31 22:12:13] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/328 variables, 6/264 constraints. Problems are: Problem set: 0 solved, 134 unsolved
[2024-05-31 22:12:13] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/328 variables, 1/265 constraints. Problems are: Problem set: 0 solved, 134 unsolved
[2024-05-31 22:12:14] [INFO ] Deduced a trap composed of 6 places in 35 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/328 variables, 1/266 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/328 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 12 (OVERLAPS) 0/328 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 134 unsolved
No progress, stopping.
After SMT solving in domain Real declared 328/328 variables, and 266 constraints, problems are : Problem set: 0 solved, 134 unsolved in 8144 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 193/193 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 134/134 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 134 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 2 (OVERLAPS) 1/193 variables, 35/46 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/193 variables, 14/60 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/193 variables, 11/71 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/193 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 6 (OVERLAPS) 135/328 variables, 193/264 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/328 variables, 2/266 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/328 variables, 134/400 constraints. Problems are: Problem set: 0 solved, 134 unsolved
[2024-05-31 22:12:23] [INFO ] Deduced a trap composed of 8 places in 61 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/328 variables, 1/401 constraints. Problems are: Problem set: 0 solved, 134 unsolved
[2024-05-31 22:12:31] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 1 ms to minimize.
[2024-05-31 22:12:34] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/328 variables, 2/403 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/328 variables, 0/403 constraints. Problems are: Problem set: 0 solved, 134 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 328/328 variables, and 403 constraints, problems are : Problem set: 0 solved, 134 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 193/193 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 134/134 constraints, Known Traps: 14/14 constraints]
After SMT, in 38204ms problems are : Problem set: 0 solved, 134 unsolved
Search for dead transitions found 0 dead transitions in 38210ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38732 ms. Remains : 193/193 places, 135/135 transitions.
RANDOM walk for 400000 steps (5411 resets) in 2577 ms. (155 steps per ms) remains 1/2 properties
Running SMT prover for 1 properties.
[2024-05-31 22:12:48] [INFO ] Invariant cache hit.
[2024-05-31 22:12:48] [INFO ] [Real]Absence check using 35 positive place invariants in 5 ms returned sat
[2024-05-31 22:12:48] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 10 ms returned sat
[2024-05-31 22:12:48] [INFO ] After 59ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-31 22:12:48] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-31 22:12:48] [INFO ] After 6ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-31 22:12:48] [INFO ] After 23ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 22:12:48] [INFO ] After 132ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 22:12:48] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2024-05-31 22:12:48] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 9 ms returned sat
[2024-05-31 22:12:48] [INFO ] After 52ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-31 22:12:48] [INFO ] After 5ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-31 22:12:48] [INFO ] After 20ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-31 22:12:48] [INFO ] After 126ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
RANDOM walk for 4000000 steps (53823 resets) in 14286 ms. (279 steps per ms) remains 1/1 properties
BEST_FIRST walk for 4000004 steps (9621 resets) in 4827 ms. (828 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 7162481 steps, run timeout after 12001 ms. (steps per millisecond=596 ) properties seen :0 out of 1
Probabilistic random walk after 7162481 steps, saw 920045 distinct states, run finished after 12002 ms. (steps per millisecond=596 ) properties seen :0
[2024-05-31 22:13:05] [INFO ] Invariant cache hit.
[2024-05-31 22:13:05] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 81/85 variables, 34/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/85 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 89/174 variables, 25/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/174 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 135/309 variables, 174/234 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/309 variables, 2/236 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/309 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 19/328 variables, 19/255 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/328 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/328 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 328/328 variables, and 255 constraints, problems are : Problem set: 0 solved, 1 unsolved in 136 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 193/193 constraints, ReadFeed: 2/2 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 81/85 variables, 34/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/85 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 89/174 variables, 25/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 22:13:06] [INFO ] Deduced a trap composed of 28 places in 34 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/174 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/174 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 135/309 variables, 174/235 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/309 variables, 2/237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/309 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 19/328 variables, 19/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/328 variables, 1/257 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 22:13:06] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 0 ms to minimize.
[2024-05-31 22:13:06] [INFO ] Deduced a trap composed of 12 places in 51 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/328 variables, 2/259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/328 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/328 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 328/328 variables, and 259 constraints, problems are : Problem set: 0 solved, 1 unsolved in 371 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 193/193 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
After SMT, in 525ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 154 ms.
Support contains 2 out of 193 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 193/193 places, 135/135 transitions.
Applied a total of 0 rules in 7 ms. Remains 193 /193 variables (removed 0) and now considering 135/135 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 193/193 places, 135/135 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 193/193 places, 135/135 transitions.
Applied a total of 0 rules in 6 ms. Remains 193 /193 variables (removed 0) and now considering 135/135 (removed 0) transitions.
[2024-05-31 22:13:06] [INFO ] Invariant cache hit.
[2024-05-31 22:13:06] [INFO ] Implicit Places using invariants in 151 ms returned []
[2024-05-31 22:13:06] [INFO ] Invariant cache hit.
[2024-05-31 22:13:06] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-31 22:13:07] [INFO ] Implicit Places using invariants and state equation in 242 ms returned []
Implicit Place search using SMT with State Equation took 399 ms to find 0 implicit places.
[2024-05-31 22:13:07] [INFO ] Redundant transitions in 4 ms returned []
Running 134 sub problems to find dead transitions.
[2024-05-31 22:13:07] [INFO ] Invariant cache hit.
[2024-05-31 22:13:07] [INFO ] State equation strengthened by 2 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 2 (OVERLAPS) 1/193 variables, 35/46 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/193 variables, 14/60 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/193 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 5 (OVERLAPS) 135/328 variables, 193/253 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/328 variables, 2/255 constraints. Problems are: Problem set: 0 solved, 134 unsolved
[2024-05-31 22:13:09] [INFO ] Deduced a trap composed of 22 places in 64 ms of which 1 ms to minimize.
[2024-05-31 22:13:09] [INFO ] Deduced a trap composed of 23 places in 60 ms of which 2 ms to minimize.
[2024-05-31 22:13:09] [INFO ] Deduced a trap composed of 7 places in 43 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/328 variables, 3/258 constraints. Problems are: Problem set: 0 solved, 134 unsolved
[2024-05-31 22:13:09] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 0 ms to minimize.
[2024-05-31 22:13:09] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 1 ms to minimize.
[2024-05-31 22:13:09] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 1 ms to minimize.
[2024-05-31 22:13:10] [INFO ] Deduced a trap composed of 11 places in 46 ms of which 1 ms to minimize.
[2024-05-31 22:13:10] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 0 ms to minimize.
[2024-05-31 22:13:10] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/328 variables, 6/264 constraints. Problems are: Problem set: 0 solved, 134 unsolved
[2024-05-31 22:13:11] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/328 variables, 1/265 constraints. Problems are: Problem set: 0 solved, 134 unsolved
[2024-05-31 22:13:12] [INFO ] Deduced a trap composed of 6 places in 39 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/328 variables, 1/266 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/328 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 12 (OVERLAPS) 0/328 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 134 unsolved
No progress, stopping.
After SMT solving in domain Real declared 328/328 variables, and 266 constraints, problems are : Problem set: 0 solved, 134 unsolved in 8275 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 193/193 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 134/134 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 134 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 2 (OVERLAPS) 1/193 variables, 35/46 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/193 variables, 14/60 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/193 variables, 11/71 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/193 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 6 (OVERLAPS) 135/328 variables, 193/264 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/328 variables, 2/266 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/328 variables, 134/400 constraints. Problems are: Problem set: 0 solved, 134 unsolved
[2024-05-31 22:13:21] [INFO ] Deduced a trap composed of 8 places in 58 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/328 variables, 1/401 constraints. Problems are: Problem set: 0 solved, 134 unsolved
[2024-05-31 22:13:28] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 0 ms to minimize.
[2024-05-31 22:13:31] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/328 variables, 2/403 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/328 variables, 0/403 constraints. Problems are: Problem set: 0 solved, 134 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 328/328 variables, and 403 constraints, problems are : Problem set: 0 solved, 134 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 193/193 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 134/134 constraints, Known Traps: 14/14 constraints]
After SMT, in 38337ms problems are : Problem set: 0 solved, 134 unsolved
Search for dead transitions found 0 dead transitions in 38339ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38753 ms. Remains : 193/193 places, 135/135 transitions.
RANDOM walk for 400000 steps (5376 resets) in 1478 ms. (270 steps per ms) remains 1/2 properties
Running SMT prover for 1 properties.
[2024-05-31 22:13:45] [INFO ] Invariant cache hit.
[2024-05-31 22:13:45] [INFO ] [Real]Absence check using 35 positive place invariants in 6 ms returned sat
[2024-05-31 22:13:45] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 10 ms returned sat
[2024-05-31 22:13:45] [INFO ] After 68ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-31 22:13:45] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-31 22:13:45] [INFO ] After 7ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-31 22:13:45] [INFO ] After 25ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 22:13:45] [INFO ] After 153ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 22:13:46] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2024-05-31 22:13:46] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 9 ms returned sat
[2024-05-31 22:13:46] [INFO ] After 60ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-31 22:13:46] [INFO ] After 3ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-31 22:13:46] [INFO ] After 14ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-31 22:13:46] [INFO ] After 132ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
RANDOM walk for 40000 steps (543 resets) in 190 ms. (209 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (85 resets) in 148 ms. (268 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1483659 steps, run timeout after 3001 ms. (steps per millisecond=494 ) properties seen :0 out of 1
Probabilistic random walk after 1483659 steps, saw 207008 distinct states, run finished after 3007 ms. (steps per millisecond=493 ) properties seen :0
[2024-05-31 22:13:49] [INFO ] Invariant cache hit.
[2024-05-31 22:13:49] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 24/27 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/27 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/28 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/28 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/28 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 81/109 variables, 34/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/109 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 89/198 variables, 25/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/198 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 130/328 variables, 187/253 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/328 variables, 2/255 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/328 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (OVERLAPS) 0/328 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 328/328 variables, and 255 constraints, problems are : Problem set: 0 solved, 1 unsolved in 149 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 193/193 constraints, ReadFeed: 2/2 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/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 24/27 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/27 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/27 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 1/28 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/28 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/28 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 81/109 variables, 34/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/109 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 89/198 variables, 25/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/198 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 130/328 variables, 187/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/328 variables, 2/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/328 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/328 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 328/328 variables, and 256 constraints, problems are : Problem set: 0 solved, 1 unsolved in 119 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 193/193 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 277ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 367 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=122 )
Parikh walk visited 1 properties in 9 ms.
RANDOM walk for 4 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/1 properties
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 6 ms. Remains 193 /193 variables (removed 0) and now considering 135/135 (removed 0) transitions.
Running SMT prover for 1 properties.
[2024-05-31 22:13:49] [INFO ] Invariant cache hit.
[2024-05-31 22:13:49] [INFO ] [Real]Absence check using 35 positive place invariants in 5 ms returned sat
[2024-05-31 22:13:49] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 10 ms returned sat
[2024-05-31 22:13:49] [INFO ] After 56ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 22:13:49] [INFO ] [Nat]Absence check using 35 positive place invariants in 6 ms returned sat
[2024-05-31 22:13:49] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 10 ms returned sat
[2024-05-31 22:13:49] [INFO ] After 85ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-31 22:13:49] [INFO ] After 103ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-31 22:13:49] [INFO ] After 178ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 245 ms.
Starting structural reductions in SI_CTL mode, iteration 0 : 194/194 places, 138/138 transitions.
Applied a total of 0 rules in 9 ms. Remains 194 /194 variables (removed 0) and now considering 138/138 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 9 ms. Remains : 194/194 places, 138/138 transitions.
[2024-05-31 22:13:49] [INFO ] Flatten gal took : 9 ms
[2024-05-31 22:13:49] [INFO ] Flatten gal took : 10 ms
[2024-05-31 22:13:49] [INFO ] Input system was already deterministic with 138 transitions.
Starting structural reductions in LTL mode, iteration 0 : 194/194 places, 138/138 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 193 transition count 137
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 193 transition count 137
Applied a total of 2 rules in 3 ms. Remains 193 /194 variables (removed 1) and now considering 137/138 (removed 1) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 193/194 places, 137/138 transitions.
[2024-05-31 22:13:49] [INFO ] Flatten gal took : 9 ms
[2024-05-31 22:13:49] [INFO ] Flatten gal took : 9 ms
[2024-05-31 22:13:49] [INFO ] Input system was already deterministic with 137 transitions.
Starting structural reductions in LTL mode, iteration 0 : 194/194 places, 138/138 transitions.
Applied a total of 0 rules in 2 ms. Remains 194 /194 variables (removed 0) and now considering 138/138 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 194/194 places, 138/138 transitions.
[2024-05-31 22:13:49] [INFO ] Flatten gal took : 9 ms
[2024-05-31 22:13:49] [INFO ] Flatten gal took : 9 ms
[2024-05-31 22:13:49] [INFO ] Input system was already deterministic with 138 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 194/194 places, 138/138 transitions.
Applied a total of 0 rules in 6 ms. Remains 194 /194 variables (removed 0) and now considering 138/138 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 6 ms. Remains : 194/194 places, 138/138 transitions.
[2024-05-31 22:13:49] [INFO ] Flatten gal took : 8 ms
[2024-05-31 22:13:49] [INFO ] Flatten gal took : 8 ms
[2024-05-31 22:13:49] [INFO ] Input system was already deterministic with 138 transitions.
Starting structural reductions in LTL mode, iteration 0 : 194/194 places, 138/138 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 193 transition count 137
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 193 transition count 137
Applied a total of 2 rules in 3 ms. Remains 193 /194 variables (removed 1) and now considering 137/138 (removed 1) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 193/194 places, 137/138 transitions.
[2024-05-31 22:13:49] [INFO ] Flatten gal took : 7 ms
[2024-05-31 22:13:49] [INFO ] Flatten gal took : 7 ms
[2024-05-31 22:13:49] [INFO ] Input system was already deterministic with 137 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 194/194 places, 138/138 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 193 transition count 137
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 193 transition count 137
Applied a total of 2 rules in 7 ms. Remains 193 /194 variables (removed 1) and now considering 137/138 (removed 1) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 7 ms. Remains : 193/194 places, 137/138 transitions.
[2024-05-31 22:13:50] [INFO ] Flatten gal took : 7 ms
[2024-05-31 22:13:50] [INFO ] Flatten gal took : 7 ms
[2024-05-31 22:13:50] [INFO ] Input system was already deterministic with 137 transitions.
Starting structural reductions in LTL mode, iteration 0 : 194/194 places, 138/138 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 193 transition count 137
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 193 transition count 137
Applied a total of 2 rules in 2 ms. Remains 193 /194 variables (removed 1) and now considering 137/138 (removed 1) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 193/194 places, 137/138 transitions.
[2024-05-31 22:13:50] [INFO ] Flatten gal took : 6 ms
[2024-05-31 22:13:50] [INFO ] Flatten gal took : 7 ms
[2024-05-31 22:13:50] [INFO ] Input system was already deterministic with 137 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 194/194 places, 138/138 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 193 transition count 137
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 193 transition count 137
Applied a total of 2 rules in 8 ms. Remains 193 /194 variables (removed 1) and now considering 137/138 (removed 1) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 8 ms. Remains : 193/194 places, 137/138 transitions.
[2024-05-31 22:13:50] [INFO ] Flatten gal took : 7 ms
[2024-05-31 22:13:50] [INFO ] Flatten gal took : 6 ms
[2024-05-31 22:13:50] [INFO ] Input system was already deterministic with 137 transitions.
Starting structural reductions in LTL mode, iteration 0 : 194/194 places, 138/138 transitions.
Applied a total of 0 rules in 1 ms. Remains 194 /194 variables (removed 0) and now considering 138/138 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 194/194 places, 138/138 transitions.
[2024-05-31 22:13:50] [INFO ] Flatten gal took : 6 ms
[2024-05-31 22:13:50] [INFO ] Flatten gal took : 6 ms
[2024-05-31 22:13:50] [INFO ] Input system was already deterministic with 138 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 194/194 places, 138/138 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 193 transition count 137
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 193 transition count 137
Applied a total of 2 rules in 7 ms. Remains 193 /194 variables (removed 1) and now considering 137/138 (removed 1) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 7 ms. Remains : 193/194 places, 137/138 transitions.
[2024-05-31 22:13:50] [INFO ] Flatten gal took : 6 ms
[2024-05-31 22:13:50] [INFO ] Flatten gal took : 7 ms
[2024-05-31 22:13:50] [INFO ] Input system was already deterministic with 137 transitions.
Starting structural reductions in LTL mode, iteration 0 : 194/194 places, 138/138 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 193 transition count 137
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 193 transition count 137
Applied a total of 2 rules in 2 ms. Remains 193 /194 variables (removed 1) and now considering 137/138 (removed 1) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 193/194 places, 137/138 transitions.
[2024-05-31 22:13:50] [INFO ] Flatten gal took : 6 ms
[2024-05-31 22:13:50] [INFO ] Flatten gal took : 6 ms
[2024-05-31 22:13:50] [INFO ] Input system was already deterministic with 137 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 194/194 places, 138/138 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 193 transition count 137
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 193 transition count 137
Applied a total of 2 rules in 8 ms. Remains 193 /194 variables (removed 1) and now considering 137/138 (removed 1) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 8 ms. Remains : 193/194 places, 137/138 transitions.
[2024-05-31 22:13:50] [INFO ] Flatten gal took : 5 ms
[2024-05-31 22:13:50] [INFO ] Flatten gal took : 5 ms
[2024-05-31 22:13:50] [INFO ] Input system was already deterministic with 137 transitions.
Starting structural reductions in LTL mode, iteration 0 : 194/194 places, 138/138 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 193 transition count 137
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 193 transition count 137
Applied a total of 2 rules in 2 ms. Remains 193 /194 variables (removed 1) and now considering 137/138 (removed 1) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 193/194 places, 137/138 transitions.
[2024-05-31 22:13:50] [INFO ] Flatten gal took : 6 ms
[2024-05-31 22:13:50] [INFO ] Flatten gal took : 6 ms
[2024-05-31 22:13:50] [INFO ] Input system was already deterministic with 137 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 194/194 places, 138/138 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 193 transition count 137
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 193 transition count 137
Applied a total of 2 rules in 7 ms. Remains 193 /194 variables (removed 1) and now considering 137/138 (removed 1) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 7 ms. Remains : 193/194 places, 137/138 transitions.
[2024-05-31 22:13:50] [INFO ] Flatten gal took : 6 ms
[2024-05-31 22:13:50] [INFO ] Flatten gal took : 6 ms
[2024-05-31 22:13:50] [INFO ] Input system was already deterministic with 137 transitions.
[2024-05-31 22:13:50] [INFO ] Flatten gal took : 7 ms
[2024-05-31 22:13:50] [INFO ] Flatten gal took : 6 ms
[2024-05-31 22:13:50] [INFO ] Export to MCC of 16 properties in file /home/mcc/execution/CTLFireability.sr.xml took 5 ms.
[2024-05-31 22:13:50] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 194 places, 138 transitions and 675 arcs took 3 ms.
Total runtime 214187 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 : DES-PT-20a-CTLFireability-2024-00
Could not compute solution for formula : DES-PT-20a-CTLFireability-2024-01
Could not compute solution for formula : DES-PT-20a-CTLFireability-2024-02
Could not compute solution for formula : DES-PT-20a-CTLFireability-2024-03
Could not compute solution for formula : DES-PT-20a-CTLFireability-2024-04
Could not compute solution for formula : DES-PT-20a-CTLFireability-2024-05
Could not compute solution for formula : DES-PT-20a-CTLFireability-2024-06
Could not compute solution for formula : DES-PT-20a-CTLFireability-2024-07
Could not compute solution for formula : DES-PT-20a-CTLFireability-2024-08
Could not compute solution for formula : DES-PT-20a-CTLFireability-2024-09
Could not compute solution for formula : DES-PT-20a-CTLFireability-2024-10
Could not compute solution for formula : DES-PT-20a-CTLFireability-2024-11
Could not compute solution for formula : DES-PT-20a-CTLFireability-2023-12
Could not compute solution for formula : DES-PT-20a-CTLFireability-2023-13
Could not compute solution for formula : DES-PT-20a-CTLFireability-2023-14
Could not compute solution for formula : DES-PT-20a-CTLFireability-2023-15

BK_STOP 1717193630757

--------------------
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 CTLFireability -timeout 360 -rebuildPNML
mcc2024
ctl formula name DES-PT-20a-CTLFireability-2024-00
ctl formula formula --ctl=/tmp/875/ctl_0_
ctl formula name DES-PT-20a-CTLFireability-2024-01
ctl formula formula --ctl=/tmp/875/ctl_1_
ctl formula name DES-PT-20a-CTLFireability-2024-02
ctl formula formula --ctl=/tmp/875/ctl_2_
ctl formula name DES-PT-20a-CTLFireability-2024-03
ctl formula formula --ctl=/tmp/875/ctl_3_
ctl formula name DES-PT-20a-CTLFireability-2024-04
ctl formula formula --ctl=/tmp/875/ctl_4_
ctl formula name DES-PT-20a-CTLFireability-2024-05
ctl formula formula --ctl=/tmp/875/ctl_5_
ctl formula name DES-PT-20a-CTLFireability-2024-06
ctl formula formula --ctl=/tmp/875/ctl_6_
ctl formula name DES-PT-20a-CTLFireability-2024-07
ctl formula formula --ctl=/tmp/875/ctl_7_
ctl formula name DES-PT-20a-CTLFireability-2024-08
ctl formula formula --ctl=/tmp/875/ctl_8_
ctl formula name DES-PT-20a-CTLFireability-2024-09
ctl formula formula --ctl=/tmp/875/ctl_9_
ctl formula name DES-PT-20a-CTLFireability-2024-10
ctl formula formula --ctl=/tmp/875/ctl_10_
ctl formula name DES-PT-20a-CTLFireability-2024-11
ctl formula formula --ctl=/tmp/875/ctl_11_
ctl formula name DES-PT-20a-CTLFireability-2023-12
ctl formula formula --ctl=/tmp/875/ctl_12_
ctl formula name DES-PT-20a-CTLFireability-2023-13
ctl formula formula --ctl=/tmp/875/ctl_13_
ctl formula name DES-PT-20a-CTLFireability-2023-14
ctl formula formula --ctl=/tmp/875/ctl_14_
ctl formula name DES-PT-20a-CTLFireability-2023-15
ctl formula formula --ctl=/tmp/875/ctl_15_
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="DES-PT-20a"
export BK_EXAMINATION="CTLFireability"
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 DES-PT-20a, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r480-tall-171624189800682"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DES-PT-20a.tgz
mv DES-PT-20a execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "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 [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.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 '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
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 ;