MCC'2024- Execution of r480-tall-171624189800706

About the Execution of LTSMin+red for DES-PT-30b

Execution Summary
Max Memory Used (MB)	Time wait (ms)	CPU Usage (ms)	I/O Wait (ms)	Computed Result	Execution Status
514.336	198102.00	249595.00	376.60	??????T?????????	normal

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-171624189800706.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-30b, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r480-tall-171624189800706
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 600K
-rw-r--r-- 1 mcc users 7.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K 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.6K May 19 07:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 19 15:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:15 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 18:08 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 08:09 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 144K Apr 12 08:09 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.6K Apr 12 08:09 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 88K Apr 12 08:09 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Apr 22 14:37 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Apr 22 14:37 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 103K 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-30b-CTLFireability-2024-00
FORMULA_NAME DES-PT-30b-CTLFireability-2024-01
FORMULA_NAME DES-PT-30b-CTLFireability-2024-02
FORMULA_NAME DES-PT-30b-CTLFireability-2024-03
FORMULA_NAME DES-PT-30b-CTLFireability-2024-04
FORMULA_NAME DES-PT-30b-CTLFireability-2024-05
FORMULA_NAME DES-PT-30b-CTLFireability-2024-06
FORMULA_NAME DES-PT-30b-CTLFireability-2024-07
FORMULA_NAME DES-PT-30b-CTLFireability-2024-08
FORMULA_NAME DES-PT-30b-CTLFireability-2024-09
FORMULA_NAME DES-PT-30b-CTLFireability-2024-10
FORMULA_NAME DES-PT-30b-CTLFireability-2024-11
FORMULA_NAME DES-PT-30b-CTLFireability-2023-12
FORMULA_NAME DES-PT-30b-CTLFireability-2023-13
FORMULA_NAME DES-PT-30b-CTLFireability-2023-14
FORMULA_NAME DES-PT-30b-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1717194691844

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-30b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 22:31:33] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-31 22:31:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 22:31:33] [INFO ] Load time of PNML (sax parser for PT used): 106 ms
[2024-05-31 22:31:33] [INFO ] Transformed 399 places.
[2024-05-31 22:31:33] [INFO ] Transformed 350 transitions.
[2024-05-31 22:31:33] [INFO ] Found NUPN structural information;
[2024-05-31 22:31:33] [INFO ] Parsed PT model containing 399 places and 350 transitions and 1143 arcs in 233 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 13 ms.
Support contains 99 out of 399 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 399/399 places, 350/350 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 396 transition count 350
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 21 place count 378 transition count 332
Iterating global reduction 1 with 18 rules applied. Total rules applied 39 place count 378 transition count 332
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 48 place count 369 transition count 323
Iterating global reduction 1 with 9 rules applied. Total rules applied 57 place count 369 transition count 323
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 65 place count 369 transition count 315
Applied a total of 65 rules in 97 ms. Remains 369 /399 variables (removed 30) and now considering 315/350 (removed 35) transitions.
// Phase 1: matrix 315 rows 369 cols
[2024-05-31 22:31:33] [INFO ] Computed 62 invariants in 36 ms
[2024-05-31 22:31:34] [INFO ] Implicit Places using invariants in 444 ms returned []
[2024-05-31 22:31:34] [INFO ] Invariant cache hit.
[2024-05-31 22:31:34] [INFO ] Implicit Places using invariants and state equation in 397 ms returned []
Implicit Place search using SMT with State Equation took 876 ms to find 0 implicit places.
Running 314 sub problems to find dead transitions.
[2024-05-31 22:31:34] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/368 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/368 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 2 (OVERLAPS) 1/369 variables, 33/49 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/369 variables, 13/62 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/369 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 5 (OVERLAPS) 315/684 variables, 369/431 constraints. Problems are: Problem set: 0 solved, 314 unsolved
[2024-05-31 22:31:41] [INFO ] Deduced a trap composed of 26 places in 140 ms of which 33 ms to minimize.
[2024-05-31 22:31:41] [INFO ] Deduced a trap composed of 13 places in 89 ms of which 3 ms to minimize.
[2024-05-31 22:31:41] [INFO ] Deduced a trap composed of 23 places in 76 ms of which 2 ms to minimize.
[2024-05-31 22:31:41] [INFO ] Deduced a trap composed of 29 places in 57 ms of which 1 ms to minimize.
[2024-05-31 22:31:41] [INFO ] Deduced a trap composed of 31 places in 51 ms of which 1 ms to minimize.
[2024-05-31 22:31:41] [INFO ] Deduced a trap composed of 30 places in 50 ms of which 2 ms to minimize.
[2024-05-31 22:31:42] [INFO ] Deduced a trap composed of 28 places in 49 ms of which 1 ms to minimize.
[2024-05-31 22:31:42] [INFO ] Deduced a trap composed of 19 places in 53 ms of which 2 ms to minimize.
[2024-05-31 22:31:42] [INFO ] Deduced a trap composed of 14 places in 70 ms of which 1 ms to minimize.
[2024-05-31 22:31:42] [INFO ] Deduced a trap composed of 15 places in 82 ms of which 1 ms to minimize.
[2024-05-31 22:31:42] [INFO ] Deduced a trap composed of 23 places in 67 ms of which 1 ms to minimize.
[2024-05-31 22:31:42] [INFO ] Deduced a trap composed of 21 places in 59 ms of which 1 ms to minimize.
[2024-05-31 22:31:42] [INFO ] Deduced a trap composed of 20 places in 56 ms of which 1 ms to minimize.
[2024-05-31 22:31:43] [INFO ] Deduced a trap composed of 21 places in 55 ms of which 1 ms to minimize.
[2024-05-31 22:31:43] [INFO ] Deduced a trap composed of 22 places in 54 ms of which 1 ms to minimize.
[2024-05-31 22:31:43] [INFO ] Deduced a trap composed of 22 places in 56 ms of which 1 ms to minimize.
[2024-05-31 22:31:43] [INFO ] Deduced a trap composed of 23 places in 61 ms of which 1 ms to minimize.
[2024-05-31 22:31:43] [INFO ] Deduced a trap composed of 33 places in 74 ms of which 1 ms to minimize.
[2024-05-31 22:31:43] [INFO ] Deduced a trap composed of 7 places in 87 ms of which 1 ms to minimize.
[2024-05-31 22:31:43] [INFO ] Deduced a trap composed of 9 places in 74 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/684 variables, 20/451 constraints. Problems are: Problem set: 0 solved, 314 unsolved
[2024-05-31 22:31:48] [INFO ] Deduced a trap composed of 14 places in 124 ms of which 2 ms to minimize.
[2024-05-31 22:31:48] [INFO ] Deduced a trap composed of 11 places in 125 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/684 variables, 2/453 constraints. Problems are: Problem set: 0 solved, 314 unsolved
[2024-05-31 22:31:51] [INFO ] Deduced a trap composed of 28 places in 90 ms of which 2 ms to minimize.
[2024-05-31 22:31:51] [INFO ] Deduced a trap composed of 13 places in 59 ms of which 2 ms to minimize.
[2024-05-31 22:31:51] [INFO ] Deduced a trap composed of 11 places in 54 ms of which 1 ms to minimize.
[2024-05-31 22:31:52] [INFO ] Deduced a trap composed of 14 places in 84 ms of which 1 ms to minimize.
[2024-05-31 22:31:52] [INFO ] Deduced a trap composed of 23 places in 57 ms of which 1 ms to minimize.
[2024-05-31 22:31:52] [INFO ] Deduced a trap composed of 16 places in 71 ms of which 2 ms to minimize.
[2024-05-31 22:31:52] [INFO ] Deduced a trap composed of 24 places in 107 ms of which 2 ms to minimize.
[2024-05-31 22:31:52] [INFO ] Deduced a trap composed of 26 places in 90 ms of which 2 ms to minimize.
[2024-05-31 22:31:52] [INFO ] Deduced a trap composed of 16 places in 89 ms of which 2 ms to minimize.
[2024-05-31 22:31:53] [INFO ] Deduced a trap composed of 25 places in 89 ms of which 2 ms to minimize.
[2024-05-31 22:31:53] [INFO ] Deduced a trap composed of 16 places in 72 ms of which 1 ms to minimize.
[2024-05-31 22:31:53] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/684 variables, 12/465 constraints. Problems are: Problem set: 0 solved, 314 unsolved
[2024-05-31 22:31:56] [INFO ] Deduced a trap composed of 31 places in 47 ms of which 1 ms to minimize.
[2024-05-31 22:31:57] [INFO ] Deduced a trap composed of 35 places in 63 ms of which 1 ms to minimize.
[2024-05-31 22:31:57] [INFO ] Deduced a trap composed of 31 places in 42 ms of which 1 ms to minimize.
[2024-05-31 22:31:57] [INFO ] Deduced a trap composed of 51 places in 79 ms of which 1 ms to minimize.
[2024-05-31 22:31:57] [INFO ] Deduced a trap composed of 16 places in 102 ms of which 2 ms to minimize.
[2024-05-31 22:31:57] [INFO ] Deduced a trap composed of 35 places in 82 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/684 variables, 6/471 constraints. Problems are: Problem set: 0 solved, 314 unsolved
[2024-05-31 22:32:04] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 684/684 variables, and 472 constraints, problems are : Problem set: 0 solved, 314 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 369/369 constraints, PredecessorRefiner: 314/314 constraints, Known Traps: 41/41 constraints]
Escalating to Integer solving :Problem set: 0 solved, 314 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/368 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/368 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 2 (OVERLAPS) 1/369 variables, 33/49 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/369 variables, 13/62 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/369 variables, 41/103 constraints. Problems are: Problem set: 0 solved, 314 unsolved
[2024-05-31 22:32:07] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 1 ms to minimize.
[2024-05-31 22:32:07] [INFO ] Deduced a trap composed of 12 places in 58 ms of which 1 ms to minimize.
[2024-05-31 22:32:07] [INFO ] Deduced a trap composed of 13 places in 65 ms of which 3 ms to minimize.
[2024-05-31 22:32:07] [INFO ] Deduced a trap composed of 30 places in 55 ms of which 1 ms to minimize.
[2024-05-31 22:32:07] [INFO ] Deduced a trap composed of 34 places in 57 ms of which 1 ms to minimize.
[2024-05-31 22:32:07] [INFO ] Deduced a trap composed of 30 places in 56 ms of which 1 ms to minimize.
[2024-05-31 22:32:07] [INFO ] Deduced a trap composed of 20 places in 47 ms of which 1 ms to minimize.
[2024-05-31 22:32:07] [INFO ] Deduced a trap composed of 29 places in 39 ms of which 1 ms to minimize.
[2024-05-31 22:32:07] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 1 ms to minimize.
[2024-05-31 22:32:08] [INFO ] Deduced a trap composed of 22 places in 47 ms of which 2 ms to minimize.
[2024-05-31 22:32:08] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 1 ms to minimize.
[2024-05-31 22:32:08] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 1 ms to minimize.
[2024-05-31 22:32:08] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 1 ms to minimize.
[2024-05-31 22:32:08] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 0 ms to minimize.
[2024-05-31 22:32:08] [INFO ] Deduced a trap composed of 21 places in 65 ms of which 1 ms to minimize.
[2024-05-31 22:32:08] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 7 ms to minimize.
[2024-05-31 22:32:08] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 0 ms to minimize.
[2024-05-31 22:32:08] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 1 ms to minimize.
[2024-05-31 22:32:09] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
[2024-05-31 22:32:10] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/369 variables, 20/123 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/369 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 7 (OVERLAPS) 315/684 variables, 369/492 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/684 variables, 314/806 constraints. Problems are: Problem set: 0 solved, 314 unsolved
[2024-05-31 22:32:26] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 1 ms to minimize.
[2024-05-31 22:32:26] [INFO ] Deduced a trap composed of 12 places in 45 ms of which 1 ms to minimize.
[2024-05-31 22:32:27] [INFO ] Deduced a trap composed of 14 places in 61 ms of which 2 ms to minimize.
[2024-05-31 22:32:27] [INFO ] Deduced a trap composed of 29 places in 55 ms of which 1 ms to minimize.
[2024-05-31 22:32:27] [INFO ] Deduced a trap composed of 33 places in 49 ms of which 1 ms to minimize.
[2024-05-31 22:32:28] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 1 ms to minimize.
[2024-05-31 22:32:30] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 684/684 variables, and 813 constraints, problems are : Problem set: 0 solved, 314 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 369/369 constraints, PredecessorRefiner: 314/314 constraints, Known Traps: 68/68 constraints]
After SMT, in 60246ms problems are : Problem set: 0 solved, 314 unsolved
Search for dead transitions found 0 dead transitions in 60263ms
Starting structural reductions in LTL mode, iteration 1 : 369/399 places, 315/350 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61266 ms. Remains : 369/399 places, 315/350 transitions.
Support contains 99 out of 369 places after structural reductions.
[2024-05-31 22:32:35] [INFO ] Flatten gal took : 54 ms
[2024-05-31 22:32:35] [INFO ] Flatten gal took : 23 ms
[2024-05-31 22:32:35] [INFO ] Input system was already deterministic with 315 transitions.
RANDOM walk for 40000 steps (343 resets) in 1369 ms. (29 steps per ms) remains 25/68 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 51 ms. (77 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (8 resets) in 55 ms. (71 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 65 ms. (60 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (8 resets) in 25 ms. (153 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 25/25 properties
[2024-05-31 22:32:36] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 25 unsolved
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp46 is UNSAT
At refinement iteration 1 (OVERLAPS) 162/199 variables, 33/33 constraints. Problems are: Problem set: 2 solved, 23 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/199 variables, 0/33 constraints. Problems are: Problem set: 2 solved, 23 unsolved
At refinement iteration 3 (OVERLAPS) 152/351 variables, 27/60 constraints. Problems are: Problem set: 2 solved, 23 unsolved
[2024-05-31 22:32:36] [INFO ] Deduced a trap composed of 22 places in 63 ms of which 2 ms to minimize.
[2024-05-31 22:32:36] [INFO ] Deduced a trap composed of 32 places in 61 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/351 variables, 2/62 constraints. Problems are: Problem set: 2 solved, 23 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/351 variables, 0/62 constraints. Problems are: Problem set: 2 solved, 23 unsolved
At refinement iteration 6 (OVERLAPS) 4/355 variables, 2/64 constraints. Problems are: Problem set: 2 solved, 23 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/355 variables, 0/64 constraints. Problems are: Problem set: 2 solved, 23 unsolved
At refinement iteration 8 (OVERLAPS) 305/660 variables, 355/419 constraints. Problems are: Problem set: 2 solved, 23 unsolved
[2024-05-31 22:32:37] [INFO ] Deduced a trap composed of 33 places in 108 ms of which 1 ms to minimize.
[2024-05-31 22:32:37] [INFO ] Deduced a trap composed of 19 places in 71 ms of which 1 ms to minimize.
[2024-05-31 22:32:37] [INFO ] Deduced a trap composed of 18 places in 54 ms of which 1 ms to minimize.
[2024-05-31 22:32:37] [INFO ] Deduced a trap composed of 24 places in 86 ms of which 2 ms to minimize.
[2024-05-31 22:32:37] [INFO ] Deduced a trap composed of 33 places in 85 ms of which 1 ms to minimize.
[2024-05-31 22:32:37] [INFO ] Deduced a trap composed of 24 places in 66 ms of which 5 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/660 variables, 6/425 constraints. Problems are: Problem set: 2 solved, 23 unsolved
[2024-05-31 22:32:38] [INFO ] Deduced a trap composed of 14 places in 78 ms of which 2 ms to minimize.
[2024-05-31 22:32:38] [INFO ] Deduced a trap composed of 32 places in 76 ms of which 2 ms to minimize.
[2024-05-31 22:32:38] [INFO ] Deduced a trap composed of 29 places in 63 ms of which 1 ms to minimize.
[2024-05-31 22:32:38] [INFO ] Deduced a trap composed of 45 places in 82 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/660 variables, 4/429 constraints. Problems are: Problem set: 2 solved, 23 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/660 variables, 0/429 constraints. Problems are: Problem set: 2 solved, 23 unsolved
At refinement iteration 12 (OVERLAPS) 23/683 variables, 13/442 constraints. Problems are: Problem set: 2 solved, 23 unsolved
[2024-05-31 22:32:39] [INFO ] Deduced a trap composed of 31 places in 101 ms of which 2 ms to minimize.
[2024-05-31 22:32:39] [INFO ] Deduced a trap composed of 12 places in 44 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/683 variables, 2/444 constraints. Problems are: Problem set: 2 solved, 23 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/683 variables, 0/444 constraints. Problems are: Problem set: 2 solved, 23 unsolved
At refinement iteration 15 (OVERLAPS) 1/684 variables, 1/445 constraints. Problems are: Problem set: 2 solved, 23 unsolved
[2024-05-31 22:32:40] [INFO ] Deduced a trap composed of 17 places in 66 ms of which 1 ms to minimize.
[2024-05-31 22:32:40] [INFO ] Deduced a trap composed of 30 places in 87 ms of which 2 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/684 variables, 2/447 constraints. Problems are: Problem set: 2 solved, 23 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 684/684 variables, and 447 constraints, problems are : Problem set: 2 solved, 23 unsolved in 5011 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 369/369 constraints, PredecessorRefiner: 25/25 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 2 solved, 23 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 23 unsolved
At refinement iteration 1 (OVERLAPS) 36/67 variables, 7/7 constraints. Problems are: Problem set: 2 solved, 23 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/67 variables, 0/7 constraints. Problems are: Problem set: 2 solved, 23 unsolved
At refinement iteration 3 (OVERLAPS) 132/199 variables, 26/33 constraints. Problems are: Problem set: 2 solved, 23 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/199 variables, 1/34 constraints. Problems are: Problem set: 2 solved, 23 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/199 variables, 0/34 constraints. Problems are: Problem set: 2 solved, 23 unsolved
At refinement iteration 6 (OVERLAPS) 152/351 variables, 27/61 constraints. Problems are: Problem set: 2 solved, 23 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/351 variables, 14/75 constraints. Problems are: Problem set: 2 solved, 23 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/351 variables, 0/75 constraints. Problems are: Problem set: 2 solved, 23 unsolved
At refinement iteration 9 (OVERLAPS) 4/355 variables, 2/77 constraints. Problems are: Problem set: 2 solved, 23 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/355 variables, 0/77 constraints. Problems are: Problem set: 2 solved, 23 unsolved
At refinement iteration 11 (OVERLAPS) 305/660 variables, 355/432 constraints. Problems are: Problem set: 2 solved, 23 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/660 variables, 22/454 constraints. Problems are: Problem set: 2 solved, 23 unsolved
[2024-05-31 22:32:43] [INFO ] Deduced a trap composed of 8 places in 79 ms of which 2 ms to minimize.
[2024-05-31 22:32:43] [INFO ] Deduced a trap composed of 14 places in 77 ms of which 2 ms to minimize.
[2024-05-31 22:32:43] [INFO ] Deduced a trap composed of 29 places in 67 ms of which 2 ms to minimize.
[2024-05-31 22:32:43] [INFO ] Deduced a trap composed of 30 places in 66 ms of which 1 ms to minimize.
[2024-05-31 22:32:43] [INFO ] Deduced a trap composed of 32 places in 74 ms of which 2 ms to minimize.
[2024-05-31 22:32:43] [INFO ] Deduced a trap composed of 34 places in 60 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/660 variables, 6/460 constraints. Problems are: Problem set: 2 solved, 23 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 660/684 variables, and 460 constraints, problems are : Problem set: 2 solved, 23 unsolved in 5013 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 355/369 constraints, PredecessorRefiner: 22/25 constraints, Known Traps: 21/22 constraints]
After SMT, in 10046ms problems are : Problem set: 2 solved, 23 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 31 out of 369 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 369/369 places, 315/315 transitions.
Graph (complete) has 798 edges and 369 vertex of which 364 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 364 transition count 301
Reduce places removed 12 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 14 rules applied. Total rules applied 27 place count 352 transition count 299
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 29 place count 350 transition count 299
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 29 place count 350 transition count 289
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 49 place count 340 transition count 289
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 56 place count 333 transition count 282
Iterating global reduction 3 with 7 rules applied. Total rules applied 63 place count 333 transition count 282
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 3 rules applied. Total rules applied 66 place count 333 transition count 279
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 68 place count 332 transition count 278
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 68 place count 332 transition count 277
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 70 place count 331 transition count 277
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 74 place count 327 transition count 273
Iterating global reduction 5 with 4 rules applied. Total rules applied 78 place count 327 transition count 273
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 81 place count 327 transition count 270
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 81 place count 327 transition count 269
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 83 place count 326 transition count 269
Performed 73 Post agglomeration using F-continuation condition.Transition count delta: 73
Deduced a syphon composed of 73 places in 0 ms
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 6 with 146 rules applied. Total rules applied 229 place count 253 transition count 196
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 231 place count 252 transition count 196
Free-agglomeration rule applied 1 times.
Iterating global reduction 6 with 1 rules applied. Total rules applied 232 place count 252 transition count 195
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 233 place count 251 transition count 195
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 7 with 2 rules applied. Total rules applied 235 place count 251 transition count 193
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 237 place count 249 transition count 193
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 238 place count 248 transition count 192
Applied a total of 238 rules in 158 ms. Remains 248 /369 variables (removed 121) and now considering 192/315 (removed 123) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 159 ms. Remains : 248/369 places, 192/315 transitions.
RANDOM walk for 40000 steps (1310 resets) in 974 ms. (41 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (24 resets) in 12 ms. (307 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (22 resets) in 16 ms. (235 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (25 resets) in 16 ms. (235 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (24 resets) in 17 ms. (222 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (22 resets) in 17 ms. (222 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (20 resets) in 18 ms. (210 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (25 resets) in 23 ms. (166 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (25 resets) in 16 ms. (235 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (23 resets) in 16 ms. (235 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (23 resets) in 15 ms. (250 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (26 resets) in 14 ms. (266 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (25 resets) in 21 ms. (181 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (25 resets) in 18 ms. (210 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (25 resets) in 14 ms. (266 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (22 resets) in 20 ms. (190 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (23 resets) in 23 ms. (166 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (23 resets) in 21 ms. (182 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (26 resets) in 15 ms. (250 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (23 resets) in 17 ms. (222 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (25 resets) in 17 ms. (222 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (26 resets) in 16 ms. (235 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (28 resets) in 16 ms. (235 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (26 resets) in 16 ms. (235 steps per ms) remains 23/23 properties
Interrupted probabilistic random walk after 596913 steps, run timeout after 3001 ms. (steps per millisecond=198 ) properties seen :0 out of 23
Probabilistic random walk after 596913 steps, saw 97547 distinct states, run finished after 3004 ms. (steps per millisecond=198 ) properties seen :0
// Phase 1: matrix 192 rows 248 cols
[2024-05-31 22:32:49] [INFO ] Computed 59 invariants in 5 ms
[2024-05-31 22:32:49] [INFO ] State equation strengthened by 2 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 1 (OVERLAPS) 19/50 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 3 (OVERLAPS) 63/113 variables, 25/33 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 5 (OVERLAPS) 100/213 variables, 23/56 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/213 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 7 (OVERLAPS) 1/214 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/214 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 9 (OVERLAPS) 6/220 variables, 2/59 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/220 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 11 (OVERLAPS) 192/412 variables, 220/279 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/412 variables, 2/281 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/412 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 14 (OVERLAPS) 28/440 variables, 28/309 constraints. Problems are: Problem set: 0 solved, 23 unsolved
[2024-05-31 22:32:50] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 0 ms to minimize.
[2024-05-31 22:32:51] [INFO ] Deduced a trap composed of 20 places in 65 ms of which 1 ms to minimize.
[2024-05-31 22:32:51] [INFO ] Deduced a trap composed of 19 places in 59 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/440 variables, 3/312 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/440 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 17 (OVERLAPS) 0/440 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 23 unsolved
No progress, stopping.
After SMT solving in domain Real declared 440/440 variables, and 312 constraints, problems are : Problem set: 0 solved, 23 unsolved in 2641 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 248/248 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 23/23 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 23 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 1 (OVERLAPS) 19/50 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 3 (OVERLAPS) 63/113 variables, 25/33 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 5 (OVERLAPS) 100/213 variables, 23/56 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/213 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/213 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 8 (OVERLAPS) 1/214 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/214 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 10 (OVERLAPS) 6/220 variables, 2/61 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/220 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/220 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 13 (OVERLAPS) 192/412 variables, 220/282 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/412 variables, 2/284 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/412 variables, 16/300 constraints. Problems are: Problem set: 0 solved, 23 unsolved
[2024-05-31 22:32:54] [INFO ] Deduced a trap composed of 19 places in 65 ms of which 1 ms to minimize.
[2024-05-31 22:32:54] [INFO ] Deduced a trap composed of 14 places in 79 ms of which 2 ms to minimize.
[2024-05-31 22:32:54] [INFO ] Deduced a trap composed of 5 places in 64 ms of which 1 ms to minimize.
[2024-05-31 22:32:55] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/412 variables, 4/304 constraints. Problems are: Problem set: 0 solved, 23 unsolved
[2024-05-31 22:32:56] [INFO ] Deduced a trap composed of 16 places in 59 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/412 variables, 1/305 constraints. Problems are: Problem set: 0 solved, 23 unsolved
[2024-05-31 22:32:59] [INFO ] Deduced a trap composed of 6 places in 43 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/412 variables, 1/306 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/412 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 20 (OVERLAPS) 28/440 variables, 28/334 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/440 variables, 7/341 constraints. Problems are: Problem set: 0 solved, 23 unsolved
[2024-05-31 22:33:05] [INFO ] Deduced a trap composed of 7 places in 37 ms of which 0 ms to minimize.
[2024-05-31 22:33:07] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 1 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/440 variables, 2/343 constraints. Problems are: Problem set: 0 solved, 23 unsolved
[2024-05-31 22:33:11] [INFO ] Deduced a trap composed of 6 places in 30 ms of which 1 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/440 variables, 1/344 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/440 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 23 unsolved
[2024-05-31 22:33:17] [INFO ] Deduced a trap composed of 5 places in 55 ms of which 1 ms to minimize.
At refinement iteration 25 (OVERLAPS) 0/440 variables, 1/345 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/440 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 27 (OVERLAPS) 0/440 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 23 unsolved
No progress, stopping.
After SMT solving in domain Int declared 440/440 variables, and 345 constraints, problems are : Problem set: 0 solved, 23 unsolved in 38617 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 248/248 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 23/23 constraints, Known Traps: 13/13 constraints]
After SMT, in 41288ms problems are : Problem set: 0 solved, 23 unsolved
Fused 23 Parikh solutions to 21 different solutions.
Parikh walk visited 2 properties in 4150 ms.
Support contains 30 out of 248 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 248/248 places, 192/192 transitions.
Applied a total of 0 rules in 9 ms. Remains 248 /248 variables (removed 0) and now considering 192/192 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 248/248 places, 192/192 transitions.
RANDOM walk for 40000 steps (1298 resets) in 480 ms. (83 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (24 resets) in 14 ms. (266 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (19 resets) in 14 ms. (266 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (25 resets) in 16 ms. (235 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (25 resets) in 24 ms. (160 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (24 resets) in 24 ms. (160 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (22 resets) in 20 ms. (190 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (26 resets) in 22 ms. (174 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (20 resets) in 15 ms. (250 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (26 resets) in 23 ms. (166 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 4003 steps (21 resets) in 12 ms. (307 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (26 resets) in 14 ms. (266 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (24 resets) in 22 ms. (174 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (22 resets) in 22 ms. (174 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (19 resets) in 19 ms. (200 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (25 resets) in 13 ms. (286 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (23 resets) in 20 ms. (190 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (25 resets) in 29 ms. (133 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (23 resets) in 16 ms. (235 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (26 resets) in 18 ms. (210 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (27 resets) in 19 ms. (200 steps per ms) remains 21/21 properties
Interrupted probabilistic random walk after 603234 steps, run timeout after 3001 ms. (steps per millisecond=201 ) properties seen :0 out of 21
Probabilistic random walk after 603234 steps, saw 98886 distinct states, run finished after 3001 ms. (steps per millisecond=201 ) properties seen :0
[2024-05-31 22:33:38] [INFO ] Invariant cache hit.
[2024-05-31 22:33:38] [INFO ] State equation strengthened by 2 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (OVERLAPS) 19/49 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (OVERLAPS) 63/112 variables, 25/33 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (OVERLAPS) 101/213 variables, 23/56 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/213 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 7 (OVERLAPS) 1/214 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/214 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 9 (OVERLAPS) 6/220 variables, 2/59 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/220 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 11 (OVERLAPS) 192/412 variables, 220/279 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/412 variables, 2/281 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/412 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 14 (OVERLAPS) 28/440 variables, 28/309 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/440 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-05-31 22:33:40] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 1 ms to minimize.
At refinement iteration 16 (OVERLAPS) 0/440 variables, 1/310 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/440 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 18 (OVERLAPS) 0/440 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Real declared 440/440 variables, and 310 constraints, problems are : Problem set: 0 solved, 21 unsolved in 2507 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 248/248 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 21 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (OVERLAPS) 19/49 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (OVERLAPS) 63/112 variables, 25/33 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (OVERLAPS) 101/213 variables, 23/56 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/213 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/213 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 8 (OVERLAPS) 1/214 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/214 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 10 (OVERLAPS) 6/220 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/220 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 12 (OVERLAPS) 192/412 variables, 220/280 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/412 variables, 2/282 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/412 variables, 14/296 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-05-31 22:33:42] [INFO ] Deduced a trap composed of 14 places in 71 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/412 variables, 1/297 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-05-31 22:33:44] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 1 ms to minimize.
[2024-05-31 22:33:44] [INFO ] Deduced a trap composed of 5 places in 59 ms of which 0 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/412 variables, 2/299 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-05-31 22:33:45] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 1 ms to minimize.
[2024-05-31 22:33:46] [INFO ] Deduced a trap composed of 18 places in 82 ms of which 1 ms to minimize.
[2024-05-31 22:33:46] [INFO ] Deduced a trap composed of 20 places in 62 ms of which 1 ms to minimize.
[2024-05-31 22:33:46] [INFO ] Deduced a trap composed of 20 places in 104 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/412 variables, 4/303 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/412 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 19 (OVERLAPS) 28/440 variables, 28/331 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/440 variables, 7/338 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-05-31 22:33:52] [INFO ] Deduced a trap composed of 6 places in 36 ms of which 0 ms to minimize.
[2024-05-31 22:33:53] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 1 ms to minimize.
[2024-05-31 22:33:53] [INFO ] Deduced a trap composed of 9 places in 66 ms of which 1 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/440 variables, 3/341 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/440 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 23 (OVERLAPS) 0/440 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Int declared 440/440 variables, and 341 constraints, problems are : Problem set: 0 solved, 21 unsolved in 24812 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 248/248 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 11/11 constraints]
After SMT, in 27349ms problems are : Problem set: 0 solved, 21 unsolved
Fused 21 Parikh solutions to 20 different solutions.
Parikh walk visited 0 properties in 2880 ms.
Support contains 30 out of 248 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 248/248 places, 192/192 transitions.
Applied a total of 0 rules in 12 ms. Remains 248 /248 variables (removed 0) and now considering 192/192 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 248/248 places, 192/192 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 248/248 places, 192/192 transitions.
Applied a total of 0 rules in 17 ms. Remains 248 /248 variables (removed 0) and now considering 192/192 (removed 0) transitions.
[2024-05-31 22:34:08] [INFO ] Invariant cache hit.
[2024-05-31 22:34:08] [INFO ] Implicit Places using invariants in 153 ms returned []
[2024-05-31 22:34:08] [INFO ] Invariant cache hit.
[2024-05-31 22:34:09] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-31 22:34:09] [INFO ] Implicit Places using invariants and state equation in 253 ms returned []
Implicit Place search using SMT with State Equation took 408 ms to find 0 implicit places.
[2024-05-31 22:34:09] [INFO ] Redundant transitions in 6 ms returned []
Running 188 sub problems to find dead transitions.
[2024-05-31 22:34:09] [INFO ] Invariant cache hit.
[2024-05-31 22:34:09] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/244 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/244 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/244 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 3 (OVERLAPS) 3/247 variables, 32/45 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/247 variables, 7/52 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/247 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 6 (OVERLAPS) 1/248 variables, 7/59 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/248 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 8 (OVERLAPS) 192/440 variables, 248/307 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/440 variables, 2/309 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/440 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 11 (OVERLAPS) 0/440 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 188 unsolved
No progress, stopping.
After SMT solving in domain Real declared 440/440 variables, and 309 constraints, problems are : Problem set: 0 solved, 188 unsolved in 8680 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 248/248 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 188/188 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 188 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/244 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/244 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/244 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 3 (OVERLAPS) 3/247 variables, 32/45 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/247 variables, 7/52 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/247 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 6 (OVERLAPS) 1/248 variables, 7/59 constraints. Problems are: Problem set: 0 solved, 188 unsolved
[2024-05-31 22:34:20] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 1 ms to minimize.
[2024-05-31 22:34:20] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
[2024-05-31 22:34:20] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 1 ms to minimize.
[2024-05-31 22:34:20] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 0 ms to minimize.
[2024-05-31 22:34:20] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 1 ms to minimize.
[2024-05-31 22:34:20] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 1 ms to minimize.
[2024-05-31 22:34:20] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/248 variables, 7/66 constraints. Problems are: Problem set: 0 solved, 188 unsolved
[2024-05-31 22:34:21] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/248 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/248 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 10 (OVERLAPS) 192/440 variables, 248/315 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/440 variables, 2/317 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/440 variables, 188/505 constraints. Problems are: Problem set: 0 solved, 188 unsolved
[2024-05-31 22:34:29] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 1 ms to minimize.
[2024-05-31 22:34:30] [INFO ] Deduced a trap composed of 5 places in 46 ms of which 1 ms to minimize.
[2024-05-31 22:34:31] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 1 ms to minimize.
[2024-05-31 22:34:31] [INFO ] Deduced a trap composed of 21 places in 51 ms of which 1 ms to minimize.
[2024-05-31 22:34:31] [INFO ] Deduced a trap composed of 19 places in 51 ms of which 1 ms to minimize.
[2024-05-31 22:34:31] [INFO ] Deduced a trap composed of 10 places in 55 ms of which 1 ms to minimize.
[2024-05-31 22:34:32] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 1 ms to minimize.
[2024-05-31 22:34:32] [INFO ] Deduced a trap composed of 10 places in 85 ms of which 2 ms to minimize.
[2024-05-31 22:34:32] [INFO ] Deduced a trap composed of 12 places in 72 ms of which 1 ms to minimize.
[2024-05-31 22:34:36] [INFO ] Deduced a trap composed of 6 places in 34 ms of which 0 ms to minimize.
[2024-05-31 22:34:39] [INFO ] Deduced a trap composed of 19 places in 63 ms of which 1 ms to minimize.
[2024-05-31 22:34:40] [INFO ] Deduced a trap composed of 18 places in 65 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/440 variables, 12/517 constraints. Problems are: Problem set: 0 solved, 188 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 440/440 variables, and 517 constraints, problems are : Problem set: 0 solved, 188 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 248/248 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 188/188 constraints, Known Traps: 20/20 constraints]
After SMT, in 38790ms problems are : Problem set: 0 solved, 188 unsolved
Search for dead transitions found 0 dead transitions in 38793ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39230 ms. Remains : 248/248 places, 192/192 transitions.
Successfully simplified 2 atomic propositions for a total of 16 simplifications.
[2024-05-31 22:34:48] [INFO ] Flatten gal took : 24 ms
[2024-05-31 22:34:48] [INFO ] Flatten gal took : 19 ms
[2024-05-31 22:34:48] [INFO ] Input system was already deterministic with 315 transitions.
Support contains 93 out of 369 places (down from 95) after GAL structural reductions.
Computed a total of 181 stabilizing places and 173 stable transitions
Graph (complete) has 798 edges and 369 vertex of which 362 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.10 ms
Starting structural reductions in LTL mode, iteration 0 : 369/369 places, 315/315 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 359 transition count 305
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 359 transition count 305
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 22 place count 359 transition count 303
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 28 place count 353 transition count 297
Iterating global reduction 1 with 6 rules applied. Total rules applied 34 place count 353 transition count 297
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 38 place count 353 transition count 293
Applied a total of 38 rules in 17 ms. Remains 353 /369 variables (removed 16) and now considering 293/315 (removed 22) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17 ms. Remains : 353/369 places, 293/315 transitions.
[2024-05-31 22:34:48] [INFO ] Flatten gal took : 15 ms
[2024-05-31 22:34:48] [INFO ] Flatten gal took : 14 ms
[2024-05-31 22:34:48] [INFO ] Input system was already deterministic with 293 transitions.
Starting structural reductions in LTL mode, iteration 0 : 369/369 places, 315/315 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 360 transition count 306
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 360 transition count 306
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 20 place count 360 transition count 304
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 24 place count 356 transition count 300
Iterating global reduction 1 with 4 rules applied. Total rules applied 28 place count 356 transition count 300
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 30 place count 356 transition count 298
Applied a total of 30 rules in 24 ms. Remains 356 /369 variables (removed 13) and now considering 298/315 (removed 17) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24 ms. Remains : 356/369 places, 298/315 transitions.
[2024-05-31 22:34:48] [INFO ] Flatten gal took : 19 ms
[2024-05-31 22:34:48] [INFO ] Flatten gal took : 14 ms
[2024-05-31 22:34:48] [INFO ] Input system was already deterministic with 298 transitions.
Starting structural reductions in LTL mode, iteration 0 : 369/369 places, 315/315 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 359 transition count 305
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 359 transition count 305
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 22 place count 359 transition count 303
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 27 place count 354 transition count 298
Iterating global reduction 1 with 5 rules applied. Total rules applied 32 place count 354 transition count 298
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 36 place count 354 transition count 294
Applied a total of 36 rules in 30 ms. Remains 354 /369 variables (removed 15) and now considering 294/315 (removed 21) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31 ms. Remains : 354/369 places, 294/315 transitions.
[2024-05-31 22:34:48] [INFO ] Flatten gal took : 13 ms
[2024-05-31 22:34:48] [INFO ] Flatten gal took : 13 ms
[2024-05-31 22:34:48] [INFO ] Input system was already deterministic with 294 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 369/369 places, 315/315 transitions.
Graph (complete) has 798 edges and 369 vertex of which 362 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.2 ms
Discarding 7 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 17 place count 361 transition count 294
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 33 place count 345 transition count 294
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 33 place count 345 transition count 284
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 53 place count 335 transition count 284
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 60 place count 328 transition count 277
Iterating global reduction 2 with 7 rules applied. Total rules applied 67 place count 328 transition count 277
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 70 place count 328 transition count 274
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 72 place count 327 transition count 273
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 72 place count 327 transition count 272
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 74 place count 326 transition count 272
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 78 place count 322 transition count 268
Iterating global reduction 4 with 4 rules applied. Total rules applied 82 place count 322 transition count 268
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 85 place count 322 transition count 265
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 85 place count 322 transition count 264
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 87 place count 321 transition count 264
Performed 67 Post agglomeration using F-continuation condition.Transition count delta: 67
Deduced a syphon composed of 67 places in 0 ms
Reduce places removed 67 places and 0 transitions.
Iterating global reduction 5 with 134 rules applied. Total rules applied 221 place count 254 transition count 197
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 223 place count 252 transition count 195
Applied a total of 223 rules in 90 ms. Remains 252 /369 variables (removed 117) and now considering 195/315 (removed 120) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 90 ms. Remains : 252/369 places, 195/315 transitions.
[2024-05-31 22:34:48] [INFO ] Flatten gal took : 10 ms
[2024-05-31 22:34:48] [INFO ] Flatten gal took : 10 ms
[2024-05-31 22:34:48] [INFO ] Input system was already deterministic with 195 transitions.
Starting structural reductions in LTL mode, iteration 0 : 369/369 places, 315/315 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 360 transition count 306
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 360 transition count 306
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 19 place count 360 transition count 305
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 24 place count 355 transition count 300
Iterating global reduction 1 with 5 rules applied. Total rules applied 29 place count 355 transition count 300
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 32 place count 355 transition count 297
Applied a total of 32 rules in 34 ms. Remains 355 /369 variables (removed 14) and now considering 297/315 (removed 18) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 35 ms. Remains : 355/369 places, 297/315 transitions.
[2024-05-31 22:34:48] [INFO ] Flatten gal took : 11 ms
[2024-05-31 22:34:48] [INFO ] Flatten gal took : 11 ms
[2024-05-31 22:34:48] [INFO ] Input system was already deterministic with 297 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 369/369 places, 315/315 transitions.
Graph (complete) has 798 edges and 369 vertex of which 362 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.1 ms
Discarding 7 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 17 place count 361 transition count 294
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 33 place count 345 transition count 294
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 33 place count 345 transition count 283
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 55 place count 334 transition count 283
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 62 place count 327 transition count 276
Iterating global reduction 2 with 7 rules applied. Total rules applied 69 place count 327 transition count 276
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 72 place count 327 transition count 273
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 74 place count 326 transition count 272
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 74 place count 326 transition count 271
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 76 place count 325 transition count 271
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 80 place count 321 transition count 267
Iterating global reduction 4 with 4 rules applied. Total rules applied 84 place count 321 transition count 267
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 87 place count 321 transition count 264
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 87 place count 321 transition count 263
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 89 place count 320 transition count 263
Performed 69 Post agglomeration using F-continuation condition.Transition count delta: 69
Deduced a syphon composed of 69 places in 0 ms
Reduce places removed 69 places and 0 transitions.
Iterating global reduction 5 with 138 rules applied. Total rules applied 227 place count 251 transition count 194
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 229 place count 249 transition count 192
Applied a total of 229 rules in 74 ms. Remains 249 /369 variables (removed 120) and now considering 192/315 (removed 123) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 74 ms. Remains : 249/369 places, 192/315 transitions.
[2024-05-31 22:34:48] [INFO ] Flatten gal took : 9 ms
[2024-05-31 22:34:48] [INFO ] Flatten gal took : 9 ms
[2024-05-31 22:34:48] [INFO ] Input system was already deterministic with 192 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 369/369 places, 315/315 transitions.
Graph (complete) has 798 edges and 369 vertex of which 362 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.1 ms
Discarding 7 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 361 transition count 295
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 31 place count 346 transition count 295
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 31 place count 346 transition count 284
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 53 place count 335 transition count 284
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 60 place count 328 transition count 277
Iterating global reduction 2 with 7 rules applied. Total rules applied 67 place count 328 transition count 277
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 70 place count 328 transition count 274
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 72 place count 327 transition count 273
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 72 place count 327 transition count 272
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 74 place count 326 transition count 272
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 78 place count 322 transition count 268
Iterating global reduction 4 with 4 rules applied. Total rules applied 82 place count 322 transition count 268
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 85 place count 322 transition count 265
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 85 place count 322 transition count 264
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 87 place count 321 transition count 264
Performed 71 Post agglomeration using F-continuation condition.Transition count delta: 71
Deduced a syphon composed of 71 places in 0 ms
Reduce places removed 71 places and 0 transitions.
Iterating global reduction 5 with 142 rules applied. Total rules applied 229 place count 250 transition count 193
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 231 place count 248 transition count 191
Applied a total of 231 rules in 60 ms. Remains 248 /369 variables (removed 121) and now considering 191/315 (removed 124) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 62 ms. Remains : 248/369 places, 191/315 transitions.
[2024-05-31 22:34:48] [INFO ] Flatten gal took : 9 ms
[2024-05-31 22:34:48] [INFO ] Flatten gal took : 9 ms
[2024-05-31 22:34:48] [INFO ] Input system was already deterministic with 191 transitions.
RANDOM walk for 45 steps (0 resets) in 6 ms. (6 steps per ms) remains 0/1 properties
FORMULA DES-PT-30b-CTLFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 369/369 places, 315/315 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 359 transition count 305
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 359 transition count 305
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 22 place count 359 transition count 303
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 27 place count 354 transition count 298
Iterating global reduction 1 with 5 rules applied. Total rules applied 32 place count 354 transition count 298
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 35 place count 354 transition count 295
Applied a total of 35 rules in 32 ms. Remains 354 /369 variables (removed 15) and now considering 295/315 (removed 20) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32 ms. Remains : 354/369 places, 295/315 transitions.
[2024-05-31 22:34:48] [INFO ] Flatten gal took : 10 ms
[2024-05-31 22:34:48] [INFO ] Flatten gal took : 10 ms
[2024-05-31 22:34:48] [INFO ] Input system was already deterministic with 295 transitions.
Starting structural reductions in LTL mode, iteration 0 : 369/369 places, 315/315 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 361 transition count 307
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 361 transition count 307
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 18 place count 361 transition count 305
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 21 place count 358 transition count 302
Iterating global reduction 1 with 3 rules applied. Total rules applied 24 place count 358 transition count 302
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 27 place count 358 transition count 299
Applied a total of 27 rules in 39 ms. Remains 358 /369 variables (removed 11) and now considering 299/315 (removed 16) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 40 ms. Remains : 358/369 places, 299/315 transitions.
[2024-05-31 22:34:48] [INFO ] Flatten gal took : 10 ms
[2024-05-31 22:34:48] [INFO ] Flatten gal took : 10 ms
[2024-05-31 22:34:48] [INFO ] Input system was already deterministic with 299 transitions.
Starting structural reductions in LTL mode, iteration 0 : 369/369 places, 315/315 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 359 transition count 305
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 359 transition count 305
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 22 place count 359 transition count 303
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 28 place count 353 transition count 297
Iterating global reduction 1 with 6 rules applied. Total rules applied 34 place count 353 transition count 297
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 38 place count 353 transition count 293
Applied a total of 38 rules in 44 ms. Remains 353 /369 variables (removed 16) and now considering 293/315 (removed 22) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 44 ms. Remains : 353/369 places, 293/315 transitions.
[2024-05-31 22:34:48] [INFO ] Flatten gal took : 11 ms
[2024-05-31 22:34:48] [INFO ] Flatten gal took : 11 ms
[2024-05-31 22:34:49] [INFO ] Input system was already deterministic with 293 transitions.
Starting structural reductions in LTL mode, iteration 0 : 369/369 places, 315/315 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 359 transition count 305
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 359 transition count 305
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 22 place count 359 transition count 303
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 28 place count 353 transition count 297
Iterating global reduction 1 with 6 rules applied. Total rules applied 34 place count 353 transition count 297
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 38 place count 353 transition count 293
Applied a total of 38 rules in 37 ms. Remains 353 /369 variables (removed 16) and now considering 293/315 (removed 22) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 38 ms. Remains : 353/369 places, 293/315 transitions.
[2024-05-31 22:34:49] [INFO ] Flatten gal took : 10 ms
[2024-05-31 22:34:49] [INFO ] Flatten gal took : 10 ms
[2024-05-31 22:34:49] [INFO ] Input system was already deterministic with 293 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 369/369 places, 315/315 transitions.
Graph (complete) has 798 edges and 369 vertex of which 362 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.1 ms
Discarding 7 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 17 place count 361 transition count 294
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 33 place count 345 transition count 294
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 33 place count 345 transition count 283
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 55 place count 334 transition count 283
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 62 place count 327 transition count 276
Iterating global reduction 2 with 7 rules applied. Total rules applied 69 place count 327 transition count 276
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 72 place count 327 transition count 273
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 74 place count 326 transition count 272
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 74 place count 326 transition count 271
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 76 place count 325 transition count 271
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 80 place count 321 transition count 267
Iterating global reduction 4 with 4 rules applied. Total rules applied 84 place count 321 transition count 267
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 87 place count 321 transition count 264
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 87 place count 321 transition count 263
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 89 place count 320 transition count 263
Performed 67 Post agglomeration using F-continuation condition.Transition count delta: 67
Deduced a syphon composed of 67 places in 0 ms
Reduce places removed 67 places and 0 transitions.
Iterating global reduction 5 with 134 rules applied. Total rules applied 223 place count 253 transition count 196
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 225 place count 251 transition count 194
Applied a total of 225 rules in 61 ms. Remains 251 /369 variables (removed 118) and now considering 194/315 (removed 121) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 61 ms. Remains : 251/369 places, 194/315 transitions.
[2024-05-31 22:34:49] [INFO ] Flatten gal took : 12 ms
[2024-05-31 22:34:49] [INFO ] Flatten gal took : 8 ms
[2024-05-31 22:34:49] [INFO ] Input system was already deterministic with 194 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 369/369 places, 315/315 transitions.
Graph (complete) has 798 edges and 369 vertex of which 362 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.0 ms
Discarding 7 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 361 transition count 295
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 31 place count 346 transition count 295
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 31 place count 346 transition count 284
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 53 place count 335 transition count 284
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 59 place count 329 transition count 278
Iterating global reduction 2 with 6 rules applied. Total rules applied 65 place count 329 transition count 278
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 68 place count 329 transition count 275
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 70 place count 328 transition count 274
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 70 place count 328 transition count 273
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 72 place count 327 transition count 273
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 75 place count 324 transition count 270
Iterating global reduction 4 with 3 rules applied. Total rules applied 78 place count 324 transition count 270
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 80 place count 324 transition count 268
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 80 place count 324 transition count 267
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 82 place count 323 transition count 267
Performed 67 Post agglomeration using F-continuation condition.Transition count delta: 67
Deduced a syphon composed of 67 places in 0 ms
Reduce places removed 67 places and 0 transitions.
Iterating global reduction 5 with 134 rules applied. Total rules applied 216 place count 256 transition count 200
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 218 place count 254 transition count 198
Applied a total of 218 rules in 46 ms. Remains 254 /369 variables (removed 115) and now considering 198/315 (removed 117) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 46 ms. Remains : 254/369 places, 198/315 transitions.
[2024-05-31 22:34:49] [INFO ] Flatten gal took : 9 ms
[2024-05-31 22:34:49] [INFO ] Flatten gal took : 9 ms
[2024-05-31 22:34:49] [INFO ] Input system was already deterministic with 198 transitions.
Starting structural reductions in LTL mode, iteration 0 : 369/369 places, 315/315 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 362 transition count 308
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 362 transition count 308
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 15 place count 362 transition count 307
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 19 place count 358 transition count 303
Iterating global reduction 1 with 4 rules applied. Total rules applied 23 place count 358 transition count 303
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 25 place count 358 transition count 301
Applied a total of 25 rules in 16 ms. Remains 358 /369 variables (removed 11) and now considering 301/315 (removed 14) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17 ms. Remains : 358/369 places, 301/315 transitions.
[2024-05-31 22:34:49] [INFO ] Flatten gal took : 9 ms
[2024-05-31 22:34:49] [INFO ] Flatten gal took : 10 ms
[2024-05-31 22:34:49] [INFO ] Input system was already deterministic with 301 transitions.
Starting structural reductions in LTL mode, iteration 0 : 369/369 places, 315/315 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 359 transition count 305
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 359 transition count 305
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 22 place count 359 transition count 303
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 28 place count 353 transition count 297
Iterating global reduction 1 with 6 rules applied. Total rules applied 34 place count 353 transition count 297
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 38 place count 353 transition count 293
Applied a total of 38 rules in 17 ms. Remains 353 /369 variables (removed 16) and now considering 293/315 (removed 22) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17 ms. Remains : 353/369 places, 293/315 transitions.
[2024-05-31 22:34:49] [INFO ] Flatten gal took : 9 ms
[2024-05-31 22:34:49] [INFO ] Flatten gal took : 9 ms
[2024-05-31 22:34:49] [INFO ] Input system was already deterministic with 293 transitions.
Starting structural reductions in LTL mode, iteration 0 : 369/369 places, 315/315 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 360 transition count 306
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 360 transition count 306
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 20 place count 360 transition count 304
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 26 place count 354 transition count 298
Iterating global reduction 1 with 6 rules applied. Total rules applied 32 place count 354 transition count 298
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 36 place count 354 transition count 294
Applied a total of 36 rules in 15 ms. Remains 354 /369 variables (removed 15) and now considering 294/315 (removed 21) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16 ms. Remains : 354/369 places, 294/315 transitions.
[2024-05-31 22:34:49] [INFO ] Flatten gal took : 9 ms
[2024-05-31 22:34:49] [INFO ] Flatten gal took : 9 ms
[2024-05-31 22:34:49] [INFO ] Input system was already deterministic with 294 transitions.
[2024-05-31 22:34:49] [INFO ] Flatten gal took : 10 ms
[2024-05-31 22:34:49] [INFO ] Flatten gal took : 10 ms
[2024-05-31 22:34:49] [INFO ] Export to MCC of 15 properties in file /home/mcc/execution/CTLFireability.sr.xml took 4 ms.
[2024-05-31 22:34:49] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 369 places, 315 transitions and 1053 arcs took 3 ms.
Total runtime 196395 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-30b-CTLFireability-2024-00
Could not compute solution for formula : DES-PT-30b-CTLFireability-2024-01
Could not compute solution for formula : DES-PT-30b-CTLFireability-2024-02
Could not compute solution for formula : DES-PT-30b-CTLFireability-2024-03
Could not compute solution for formula : DES-PT-30b-CTLFireability-2024-04
Could not compute solution for formula : DES-PT-30b-CTLFireability-2024-05
Could not compute solution for formula : DES-PT-30b-CTLFireability-2024-07
Could not compute solution for formula : DES-PT-30b-CTLFireability-2024-08
Could not compute solution for formula : DES-PT-30b-CTLFireability-2024-09
Could not compute solution for formula : DES-PT-30b-CTLFireability-2024-10
Could not compute solution for formula : DES-PT-30b-CTLFireability-2024-11
Could not compute solution for formula : DES-PT-30b-CTLFireability-2023-12
Could not compute solution for formula : DES-PT-30b-CTLFireability-2023-13
Could not compute solution for formula : DES-PT-30b-CTLFireability-2023-14
Could not compute solution for formula : DES-PT-30b-CTLFireability-2023-15

BK_STOP 1717194889946

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ 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-30b-CTLFireability-2024-00
ctl formula formula --ctl=/tmp/967/ctl_0_
ctl formula name DES-PT-30b-CTLFireability-2024-01
ctl formula formula --ctl=/tmp/967/ctl_1_
ctl formula name DES-PT-30b-CTLFireability-2024-02
ctl formula formula --ctl=/tmp/967/ctl_2_
ctl formula name DES-PT-30b-CTLFireability-2024-03
ctl formula formula --ctl=/tmp/967/ctl_3_
ctl formula name DES-PT-30b-CTLFireability-2024-04
ctl formula formula --ctl=/tmp/967/ctl_4_
ctl formula name DES-PT-30b-CTLFireability-2024-05
ctl formula formula --ctl=/tmp/967/ctl_5_
ctl formula name DES-PT-30b-CTLFireability-2024-07
ctl formula formula --ctl=/tmp/967/ctl_6_
ctl formula name DES-PT-30b-CTLFireability-2024-08
ctl formula formula --ctl=/tmp/967/ctl_7_
ctl formula name DES-PT-30b-CTLFireability-2024-09
ctl formula formula --ctl=/tmp/967/ctl_8_
ctl formula name DES-PT-30b-CTLFireability-2024-10
ctl formula formula --ctl=/tmp/967/ctl_9_
ctl formula name DES-PT-30b-CTLFireability-2024-11
ctl formula formula --ctl=/tmp/967/ctl_10_
ctl formula name DES-PT-30b-CTLFireability-2023-12
ctl formula formula --ctl=/tmp/967/ctl_11_
ctl formula name DES-PT-30b-CTLFireability-2023-13
ctl formula formula --ctl=/tmp/967/ctl_12_
ctl formula name DES-PT-30b-CTLFireability-2023-14
ctl formula formula --ctl=/tmp/967/ctl_13_
ctl formula name DES-PT-30b-CTLFireability-2023-15
ctl formula formula --ctl=/tmp/967/ctl_14_
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-30b"
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-30b, 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-171624189800706"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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