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.r091-tall-171624188200658.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 greatspnxred
Input is DES-PT-05b, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r091-tall-171624188200658
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 520K
-rw-r--r-- 1 mcc users 6.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 64K 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.2K May 19 07:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 19 15:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.8K May 19 07:15 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 18:08 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 08:17 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 136K Apr 12 08:17 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Apr 12 08:17 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 52K Apr 12 08:17 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Apr 22 14:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Apr 22 14:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 73K 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-05b-CTLFireability-2024-00
FORMULA_NAME DES-PT-05b-CTLFireability-2024-01
FORMULA_NAME DES-PT-05b-CTLFireability-2024-02
FORMULA_NAME DES-PT-05b-CTLFireability-2024-03
FORMULA_NAME DES-PT-05b-CTLFireability-2024-04
FORMULA_NAME DES-PT-05b-CTLFireability-2024-05
FORMULA_NAME DES-PT-05b-CTLFireability-2024-06
FORMULA_NAME DES-PT-05b-CTLFireability-2024-07
FORMULA_NAME DES-PT-05b-CTLFireability-2024-08
FORMULA_NAME DES-PT-05b-CTLFireability-2024-09
FORMULA_NAME DES-PT-05b-CTLFireability-2024-10
FORMULA_NAME DES-PT-05b-CTLFireability-2024-11
FORMULA_NAME DES-PT-05b-CTLFireability-2023-12
FORMULA_NAME DES-PT-05b-CTLFireability-2023-13
FORMULA_NAME DES-PT-05b-CTLFireability-2023-14
FORMULA_NAME DES-PT-05b-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1716314164049

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DES-PT-05b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-21 17:56:05] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-21 17:56:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 17:56:05] [INFO ] Load time of PNML (sax parser for PT used): 82 ms
[2024-05-21 17:56:05] [INFO ] Transformed 300 places.
[2024-05-21 17:56:05] [INFO ] Transformed 251 transitions.
[2024-05-21 17:56:05] [INFO ] Found NUPN structural information;
[2024-05-21 17:56:05] [INFO ] Parsed PT model containing 300 places and 251 transitions and 747 arcs in 188 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 14 ms.
Support contains 165 out of 300 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 300/300 places, 251/251 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 297 transition count 251
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 11 place count 289 transition count 243
Iterating global reduction 1 with 8 rules applied. Total rules applied 19 place count 289 transition count 243
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 22 place count 286 transition count 240
Iterating global reduction 1 with 3 rules applied. Total rules applied 25 place count 286 transition count 240
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 26 place count 286 transition count 239
Applied a total of 26 rules in 56 ms. Remains 286 /300 variables (removed 14) and now considering 239/251 (removed 12) transitions.
// Phase 1: matrix 239 rows 286 cols
[2024-05-21 17:56:05] [INFO ] Computed 62 invariants in 24 ms
[2024-05-21 17:56:05] [INFO ] Implicit Places using invariants in 278 ms returned []
[2024-05-21 17:56:05] [INFO ] Invariant cache hit.
[2024-05-21 17:56:06] [INFO ] Implicit Places using invariants and state equation in 223 ms returned []
Implicit Place search using SMT with State Equation took 538 ms to find 0 implicit places.
Running 238 sub problems to find dead transitions.
[2024-05-21 17:56:06] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/285 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/285 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 2 (OVERLAPS) 1/286 variables, 32/47 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/286 variables, 15/62 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/286 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 5 (OVERLAPS) 239/525 variables, 286/348 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-05-21 17:56:10] [INFO ] Deduced a trap composed of 39 places in 126 ms of which 18 ms to minimize.
[2024-05-21 17:56:10] [INFO ] Deduced a trap composed of 29 places in 65 ms of which 3 ms to minimize.
[2024-05-21 17:56:10] [INFO ] Deduced a trap composed of 7 places in 86 ms of which 2 ms to minimize.
[2024-05-21 17:56:10] [INFO ] Deduced a trap composed of 8 places in 82 ms of which 2 ms to minimize.
[2024-05-21 17:56:10] [INFO ] Deduced a trap composed of 13 places in 55 ms of which 1 ms to minimize.
[2024-05-21 17:56:10] [INFO ] Deduced a trap composed of 10 places in 53 ms of which 1 ms to minimize.
[2024-05-21 17:56:11] [INFO ] Deduced a trap composed of 21 places in 50 ms of which 2 ms to minimize.
[2024-05-21 17:56:11] [INFO ] Deduced a trap composed of 31 places in 49 ms of which 2 ms to minimize.
[2024-05-21 17:56:11] [INFO ] Deduced a trap composed of 32 places in 59 ms of which 1 ms to minimize.
[2024-05-21 17:56:11] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 1 ms to minimize.
[2024-05-21 17:56:11] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 1 ms to minimize.
[2024-05-21 17:56:11] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 0 ms to minimize.
[2024-05-21 17:56:11] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 1 ms to minimize.
[2024-05-21 17:56:11] [INFO ] Deduced a trap composed of 31 places in 46 ms of which 1 ms to minimize.
[2024-05-21 17:56:12] [INFO ] Deduced a trap composed of 21 places in 50 ms of which 4 ms to minimize.
[2024-05-21 17:56:12] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 1 ms to minimize.
[2024-05-21 17:56:12] [INFO ] Deduced a trap composed of 28 places in 53 ms of which 1 ms to minimize.
[2024-05-21 17:56:12] [INFO ] Deduced a trap composed of 24 places in 65 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/525 variables, 18/366 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/525 variables, 0/366 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-05-21 17:56:17] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 1 ms to minimize.
[2024-05-21 17:56:17] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 1 ms to minimize.
[2024-05-21 17:56:17] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 0 ms to minimize.
[2024-05-21 17:56:17] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 2 ms to minimize.
[2024-05-21 17:56:17] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/525 variables, 5/371 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-05-21 17:56:19] [INFO ] Deduced a trap composed of 20 places in 51 ms of which 2 ms to minimize.
[2024-05-21 17:56:19] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 1 ms to minimize.
[2024-05-21 17:56:19] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 1 ms to minimize.
[2024-05-21 17:56:19] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 1 ms to minimize.
[2024-05-21 17:56:20] [INFO ] Deduced a trap composed of 11 places in 64 ms of which 1 ms to minimize.
[2024-05-21 17:56:20] [INFO ] Deduced a trap composed of 18 places in 66 ms of which 1 ms to minimize.
[2024-05-21 17:56:20] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 2 ms to minimize.
[2024-05-21 17:56:20] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/525 variables, 8/379 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/525 variables, 0/379 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-05-21 17:56:25] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 1 ms to minimize.
[2024-05-21 17:56:25] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 1 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/525 variables, 2/381 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-05-21 17:56:27] [INFO ] Deduced a trap composed of 24 places in 69 ms of which 2 ms to minimize.
[2024-05-21 17:56:27] [INFO ] Deduced a trap composed of 35 places in 68 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/525 variables, 2/383 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/525 variables, 0/383 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-05-21 17:56:32] [INFO ] Deduced a trap composed of 18 places in 48 ms of which 1 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/525 variables, 1/384 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-05-21 17:56:34] [INFO ] Deduced a trap composed of 24 places in 57 ms of which 1 ms to minimize.
[2024-05-21 17:56:34] [INFO ] Deduced a trap composed of 22 places in 67 ms of which 1 ms to minimize.
[2024-05-21 17:56:34] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 1 ms to minimize.
[2024-05-21 17:56:34] [INFO ] Deduced a trap composed of 22 places in 46 ms of which 2 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/525 variables, 4/388 constraints. Problems are: Problem set: 0 solved, 238 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 525/525 variables, and 388 constraints, problems are : Problem set: 0 solved, 238 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 286/286 constraints, PredecessorRefiner: 238/238 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 238 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/285 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/285 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 2 (OVERLAPS) 1/286 variables, 32/47 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/286 variables, 15/62 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/286 variables, 40/102 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-05-21 17:56:38] [INFO ] Deduced a trap composed of 12 places in 78 ms of which 1 ms to minimize.
[2024-05-21 17:56:38] [INFO ] Deduced a trap composed of 13 places in 75 ms of which 1 ms to minimize.
[2024-05-21 17:56:38] [INFO ] Deduced a trap composed of 21 places in 54 ms of which 1 ms to minimize.
[2024-05-21 17:56:38] [INFO ] Deduced a trap composed of 17 places in 59 ms of which 6 ms to minimize.
[2024-05-21 17:56:38] [INFO ] Deduced a trap composed of 26 places in 74 ms of which 2 ms to minimize.
[2024-05-21 17:56:38] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 1 ms to minimize.
[2024-05-21 17:56:39] [INFO ] Deduced a trap composed of 16 places in 24 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/286 variables, 7/109 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-05-21 17:56:40] [INFO ] Deduced a trap composed of 24 places in 27 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/286 variables, 1/110 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-05-21 17:56:42] [INFO ] Deduced a trap composed of 16 places in 58 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/286 variables, 1/111 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-05-21 17:56:43] [INFO ] Deduced a trap composed of 23 places in 59 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/286 variables, 1/112 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-05-21 17:56:44] [INFO ] Deduced a trap composed of 31 places in 74 ms of which 2 ms to minimize.
[2024-05-21 17:56:44] [INFO ] Deduced a trap composed of 30 places in 66 ms of which 1 ms to minimize.
[2024-05-21 17:56:45] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 1 ms to minimize.
[2024-05-21 17:56:45] [INFO ] Deduced a trap composed of 17 places in 56 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/286 variables, 4/116 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-05-21 17:56:46] [INFO ] Deduced a trap composed of 25 places in 75 ms of which 1 ms to minimize.
[2024-05-21 17:56:46] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 1 ms to minimize.
[2024-05-21 17:56:46] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 11 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/286 variables, 3/119 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-05-21 17:56:48] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/286 variables, 1/120 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/286 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 13 (OVERLAPS) 239/525 variables, 286/406 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/525 variables, 238/644 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-05-21 17:56:57] [INFO ] Deduced a trap composed of 14 places in 77 ms of which 1 ms to minimize.
[2024-05-21 17:56:57] [INFO ] Deduced a trap composed of 41 places in 81 ms of which 2 ms to minimize.
[2024-05-21 17:56:57] [INFO ] Deduced a trap composed of 33 places in 70 ms of which 1 ms to minimize.
[2024-05-21 17:56:58] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 0 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/525 variables, 4/648 constraints. Problems are: Problem set: 0 solved, 238 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 525/525 variables, and 648 constraints, problems are : Problem set: 0 solved, 238 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 286/286 constraints, PredecessorRefiner: 238/238 constraints, Known Traps: 62/62 constraints]
After SMT, in 60130ms problems are : Problem set: 0 solved, 238 unsolved
Search for dead transitions found 0 dead transitions in 60149ms
Starting structural reductions in LTL mode, iteration 1 : 286/300 places, 239/251 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60765 ms. Remains : 286/300 places, 239/251 transitions.
Support contains 165 out of 286 places after structural reductions.
[2024-05-21 17:57:06] [INFO ] Flatten gal took : 71 ms
[2024-05-21 17:57:06] [INFO ] Flatten gal took : 73 ms
[2024-05-21 17:57:06] [INFO ] Input system was already deterministic with 239 transitions.
Support contains 162 out of 286 places (down from 165) after GAL structural reductions.
RANDOM walk for 40000 steps (330 resets) in 2465 ms. (16 steps per ms) remains 10/103 properties
BEST_FIRST walk for 40003 steps (44 resets) in 239 ms. (166 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (42 resets) in 200 ms. (199 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (45 resets) in 140 ms. (283 steps per ms) remains 9/10 properties
BEST_FIRST walk for 40003 steps (49 resets) in 136 ms. (291 steps per ms) remains 8/9 properties
BEST_FIRST walk for 40004 steps (42 resets) in 105 ms. (377 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (36 resets) in 198 ms. (201 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (51 resets) in 65 ms. (606 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (49 resets) in 88 ms. (449 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (58 resets) in 80 ms. (493 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (52 resets) in 214 ms. (186 steps per ms) remains 8/8 properties
[2024-05-21 17:57:08] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 102/128 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/128 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 49/177 variables, 12/32 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/177 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Problem AtomicPropp82 is UNSAT
Problem AtomicPropp89 is UNSAT
At refinement iteration 5 (OVERLAPS) 86/263 variables, 27/59 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/263 variables, 0/59 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 5/268 variables, 3/62 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/268 variables, 0/62 constraints. Problems are: Problem set: 2 solved, 6 unsolved
Problem AtomicPropp88 is UNSAT
At refinement iteration 9 (OVERLAPS) 223/491 variables, 268/330 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/491 variables, 0/330 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 20/511 variables, 11/341 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/511 variables, 0/341 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 6/517 variables, 3/344 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/517 variables, 0/344 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 4/521 variables, 2/346 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/521 variables, 0/346 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 17 (OVERLAPS) 4/525 variables, 2/348 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/525 variables, 0/348 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 19 (OVERLAPS) 0/525 variables, 0/348 constraints. Problems are: Problem set: 3 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 525/525 variables, and 348 constraints, problems are : Problem set: 3 solved, 5 unsolved in 710 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 286/286 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 93/110 variables, 17/17 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/110 variables, 0/17 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 63/173 variables, 15/32 constraints. Problems are: Problem set: 3 solved, 5 unsolved
[2024-05-21 17:57:10] [INFO ] Deduced a trap composed of 24 places in 923 ms of which 2 ms to minimize.
[2024-05-21 17:57:10] [INFO ] Deduced a trap composed of 24 places in 61 ms of which 1 ms to minimize.
[2024-05-21 17:57:10] [INFO ] Deduced a trap composed of 22 places in 85 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/173 variables, 3/35 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/173 variables, 0/35 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 89/262 variables, 27/62 constraints. Problems are: Problem set: 3 solved, 5 unsolved
[2024-05-21 17:57:12] [INFO ] Deduced a trap composed of 27 places in 1347 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/262 variables, 1/63 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/262 variables, 0/63 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 5/267 variables, 3/66 constraints. Problems are: Problem set: 3 solved, 5 unsolved
[2024-05-21 17:57:12] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/267 variables, 1/67 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/267 variables, 0/67 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 223/490 variables, 267/334 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/490 variables, 5/339 constraints. Problems are: Problem set: 3 solved, 5 unsolved
[2024-05-21 17:57:12] [INFO ] Deduced a trap composed of 23 places in 53 ms of which 1 ms to minimize.
[2024-05-21 17:57:12] [INFO ] Deduced a trap composed of 32 places in 64 ms of which 1 ms to minimize.
[2024-05-21 17:57:12] [INFO ] Deduced a trap composed of 34 places in 72 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/490 variables, 3/342 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/490 variables, 0/342 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 16 (OVERLAPS) 21/511 variables, 12/354 constraints. Problems are: Problem set: 3 solved, 5 unsolved
[2024-05-21 17:57:12] [INFO ] Deduced a trap composed of 22 places in 56 ms of which 1 ms to minimize.
[2024-05-21 17:57:12] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 0 ms to minimize.
[2024-05-21 17:57:12] [INFO ] Deduced a trap composed of 24 places in 51 ms of which 1 ms to minimize.
[2024-05-21 17:57:12] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 0 ms to minimize.
[2024-05-21 17:57:13] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/511 variables, 5/359 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/511 variables, 0/359 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 19 (OVERLAPS) 6/517 variables, 3/362 constraints. Problems are: Problem set: 3 solved, 5 unsolved
[2024-05-21 17:57:13] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/517 variables, 1/363 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/517 variables, 0/363 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 22 (OVERLAPS) 4/521 variables, 2/365 constraints. Problems are: Problem set: 3 solved, 5 unsolved
[2024-05-21 17:57:13] [INFO ] Deduced a trap composed of 12 places in 51 ms of which 1 ms to minimize.
[2024-05-21 17:57:13] [INFO ] Deduced a trap composed of 38 places in 71 ms of which 1 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/521 variables, 2/367 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/521 variables, 0/367 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 25 (OVERLAPS) 4/525 variables, 2/369 constraints. Problems are: Problem set: 3 solved, 5 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 525/525 variables, and 369 constraints, problems are : Problem set: 3 solved, 5 unsolved in 5006 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 286/286 constraints, PredecessorRefiner: 5/8 constraints, Known Traps: 16/16 constraints]
After SMT, in 5744ms problems are : Problem set: 3 solved, 5 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 17 out of 286 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 286/286 places, 239/239 transitions.
Graph (complete) has 538 edges and 286 vertex of which 282 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 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 17 rules applied. Total rules applied 18 place count 282 transition count 218
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 33 place count 267 transition count 218
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 267 transition count 208
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 257 transition count 208
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 68 place count 242 transition count 193
Iterating global reduction 2 with 15 rules applied. Total rules applied 83 place count 242 transition count 193
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 2 rules applied. Total rules applied 85 place count 242 transition count 191
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 86 place count 241 transition count 191
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 97 place count 230 transition count 180
Iterating global reduction 4 with 11 rules applied. Total rules applied 108 place count 230 transition count 180
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 4 with 10 rules applied. Total rules applied 118 place count 230 transition count 170
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 118 place count 230 transition count 168
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 122 place count 228 transition count 168
Performed 66 Post agglomeration using F-continuation condition.Transition count delta: 66
Deduced a syphon composed of 66 places in 0 ms
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 5 with 132 rules applied. Total rules applied 254 place count 162 transition count 102
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 260 place count 159 transition count 105
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 261 place count 159 transition count 104
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 262 place count 159 transition count 103
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 263 place count 158 transition count 103
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 264 place count 157 transition count 102
Applied a total of 264 rules in 179 ms. Remains 157 /286 variables (removed 129) and now considering 102/239 (removed 137) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 179 ms. Remains : 157/286 places, 102/239 transitions.
RANDOM walk for 40000 steps (1136 resets) in 571 ms. (69 steps per ms) remains 4/5 properties
BEST_FIRST walk for 40003 steps (199 resets) in 99 ms. (400 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (229 resets) in 104 ms. (380 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (213 resets) in 66 ms. (597 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (206 resets) in 213 ms. (186 steps per ms) remains 4/4 properties
// Phase 1: matrix 102 rows 157 cols
[2024-05-21 17:57:14] [INFO ] Computed 64 invariants in 6 ms
[2024-05-21 17:57:14] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 30/42 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 66/108 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-21 17:57:15] [INFO ] Deduced a trap composed of 7 places in 71 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/108 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/108 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 49/157 variables, 28/65 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/157 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 102/259 variables, 157/222 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/259 variables, 8/230 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-21 17:57:15] [INFO ] Deduced a trap composed of 8 places in 59 ms of which 1 ms to minimize.
[2024-05-21 17:57:15] [INFO ] Deduced a trap composed of 11 places in 56 ms of which 1 ms to minimize.
[2024-05-21 17:57:15] [INFO ] Deduced a trap composed of 8 places in 52 ms of which 0 ms to minimize.
[2024-05-21 17:57:15] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 1 ms to minimize.
[2024-05-21 17:57:15] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/259 variables, 5/235 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-21 17:57:15] [INFO ] Deduced a trap composed of 22 places in 63 ms of which 1 ms to minimize.
[2024-05-21 17:57:15] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 1 ms to minimize.
[2024-05-21 17:57:15] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 1 ms to minimize.
[2024-05-21 17:57:15] [INFO ] Deduced a trap composed of 8 places in 38 ms of which 0 ms to minimize.
[2024-05-21 17:57:15] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/259 variables, 5/240 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/259 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 0/259 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 259/259 variables, and 240 constraints, problems are : Problem set: 0 solved, 4 unsolved in 938 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 157/157 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 30/42 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 66/108 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/108 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-21 17:57:15] [INFO ] Deduced a trap composed of 7 places in 18 ms of which 0 ms to minimize.
[2024-05-21 17:57:15] [INFO ] Deduced a trap composed of 7 places in 30 ms of which 1 ms to minimize.
[2024-05-21 17:57:15] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/108 variables, 3/40 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/108 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 49/157 variables, 28/68 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/157 variables, 10/78 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/157 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 102/259 variables, 157/235 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/259 variables, 8/243 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/259 variables, 4/247 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-21 17:57:16] [INFO ] Deduced a trap composed of 5 places in 43 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/259 variables, 1/248 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/259 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 0/259 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 259/259 variables, and 248 constraints, problems are : Problem set: 0 solved, 4 unsolved in 532 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 157/157 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 15/15 constraints]
After SMT, in 1506ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 0 properties in 1100 ms.
Support contains 12 out of 157 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 157/157 places, 102/102 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 0 with 1 rules applied. Total rules applied 1 place count 157 transition count 101
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 156 transition count 101
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 10 place count 152 transition count 97
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 11 place count 151 transition count 94
Iterating global reduction 2 with 1 rules applied. Total rules applied 12 place count 151 transition count 94
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 16 place count 151 transition count 90
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 18 place count 150 transition count 92
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 19 place count 149 transition count 91
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 20 place count 148 transition count 91
Applied a total of 20 rules in 21 ms. Remains 148 /157 variables (removed 9) and now considering 91/102 (removed 11) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 148/157 places, 91/102 transitions.
RANDOM walk for 40000 steps (1492 resets) in 290 ms. (137 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (248 resets) in 199 ms. (200 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (260 resets) in 122 ms. (325 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (267 resets) in 108 ms. (367 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (271 resets) in 73 ms. (540 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 939066 steps, run timeout after 3001 ms. (steps per millisecond=312 ) properties seen :0 out of 4
Probabilistic random walk after 939066 steps, saw 132822 distinct states, run finished after 3015 ms. (steps per millisecond=311 ) properties seen :0
// Phase 1: matrix 91 rows 148 cols
[2024-05-21 17:57:20] [INFO ] Computed 63 invariants in 2 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 29/41 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 36/77 variables, 15/25 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-21 17:57:21] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 1 ms to minimize.
[2024-05-21 17:57:21] [INFO ] Deduced a trap composed of 6 places in 24 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 2/27 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/77 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 50/127 variables, 27/54 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/127 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 7/134 variables, 5/59 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/134 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 2/136 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/136 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 87/223 variables, 136/196 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-21 17:57:21] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 1 ms to minimize.
[2024-05-21 17:57:21] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 1 ms to minimize.
[2024-05-21 17:57:21] [INFO ] Deduced a trap composed of 6 places in 17 ms of which 0 ms to minimize.
[2024-05-21 17:57:21] [INFO ] Deduced a trap composed of 10 places in 41 ms of which 0 ms to minimize.
[2024-05-21 17:57:21] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/223 variables, 5/201 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/223 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 14/237 variables, 10/211 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/237 variables, 4/215 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/237 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 2/239 variables, 1/216 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/239 variables, 2/218 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/239 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (OVERLAPS) 0/239 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 239/239 variables, and 218 constraints, problems are : Problem set: 0 solved, 4 unsolved in 606 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 148/148 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 29/41 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 36/77 variables, 15/25 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 3/28 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-21 17:57:21] [INFO ] Deduced a trap composed of 6 places in 26 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/77 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/77 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 50/127 variables, 27/56 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/127 variables, 4/60 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/127 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 7/134 variables, 5/65 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/134 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 2/136 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/136 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 87/223 variables, 136/202 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/223 variables, 3/205 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-21 17:57:21] [INFO ] Deduced a trap composed of 8 places in 68 ms of which 1 ms to minimize.
[2024-05-21 17:57:21] [INFO ] Deduced a trap composed of 16 places in 97 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/223 variables, 2/207 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/223 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 14/237 variables, 10/217 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/237 variables, 4/221 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/237 variables, 1/222 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/237 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (OVERLAPS) 2/239 variables, 1/223 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/239 variables, 2/225 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/239 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 25 (OVERLAPS) 0/239 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 239/239 variables, and 225 constraints, problems are : Problem set: 0 solved, 4 unsolved in 838 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 148/148 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 10/10 constraints]
After SMT, in 1453ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 1 properties in 697 ms.
Support contains 10 out of 148 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 148/148 places, 91/91 transitions.
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 147 transition count 90
Applied a total of 1 rules in 8 ms. Remains 147 /148 variables (removed 1) and now considering 90/91 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 147/148 places, 90/91 transitions.
RANDOM walk for 40000 steps (1556 resets) in 247 ms. (161 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (240 resets) in 66 ms. (597 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (292 resets) in 64 ms. (615 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (241 resets) in 44 ms. (888 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 793274 steps, run timeout after 3001 ms. (steps per millisecond=264 ) properties seen :0 out of 3
Probabilistic random walk after 793274 steps, saw 112747 distinct states, run finished after 3001 ms. (steps per millisecond=264 ) properties seen :0
// Phase 1: matrix 90 rows 147 cols
[2024-05-21 17:57:26] [INFO ] Computed 63 invariants in 5 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 24/34 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 2/36 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/36 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 68/104 variables, 24/33 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/104 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 24/128 variables, 20/53 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-21 17:57:26] [INFO ] Deduced a trap composed of 8 places in 19 ms of which 1 ms to minimize.
[2024-05-21 17:57:26] [INFO ] Deduced a trap composed of 8 places in 21 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/128 variables, 2/55 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/128 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 6/134 variables, 4/59 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/134 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 1/135 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/135 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 86/221 variables, 135/195 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-21 17:57:26] [INFO ] Deduced a trap composed of 10 places in 48 ms of which 0 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/221 variables, 1/196 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/221 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 14/235 variables, 10/206 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/235 variables, 4/210 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/235 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (OVERLAPS) 2/237 variables, 1/211 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/237 variables, 2/213 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/237 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (OVERLAPS) 0/237 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 237/237 variables, and 213 constraints, problems are : Problem set: 0 solved, 3 unsolved in 425 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 147/147 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 24/34 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 2/36 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/36 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 68/104 variables, 24/33 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/104 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 24/128 variables, 20/53 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/128 variables, 3/56 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/128 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 6/134 variables, 4/60 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/134 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 1/135 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/135 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 86/221 variables, 135/196 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/221 variables, 2/198 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-21 17:57:26] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 0 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/221 variables, 1/199 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-21 17:57:27] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 0 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/221 variables, 1/200 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/221 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 14/235 variables, 10/210 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/235 variables, 4/214 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/235 variables, 1/215 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-21 17:57:27] [INFO ] Deduced a trap composed of 13 places in 507 ms of which 0 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/235 variables, 1/216 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/235 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (OVERLAPS) 2/237 variables, 1/217 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/237 variables, 2/219 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-21 17:57:27] [INFO ] Deduced a trap composed of 8 places in 40 ms of which 0 ms to minimize.
At refinement iteration 26 (INCLUDED_ONLY) 0/237 variables, 1/220 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/237 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-21 17:57:28] [INFO ] Deduced a trap composed of 8 places in 489 ms of which 1 ms to minimize.
[2024-05-21 17:57:28] [INFO ] Deduced a trap composed of 5 places in 40 ms of which 1 ms to minimize.
At refinement iteration 28 (OVERLAPS) 0/237 variables, 2/222 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-21 17:57:28] [INFO ] Deduced a trap composed of 5 places in 35 ms of which 1 ms to minimize.
At refinement iteration 29 (INCLUDED_ONLY) 0/237 variables, 1/223 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/237 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 31 (OVERLAPS) 0/237 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 237/237 variables, and 223 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1966 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 147/147 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 10/10 constraints]
After SMT, in 2421ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 835 ms.
Support contains 10 out of 147 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 147/147 places, 90/90 transitions.
Applied a total of 0 rules in 17 ms. Remains 147 /147 variables (removed 0) and now considering 90/90 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 147/147 places, 90/90 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 147/147 places, 90/90 transitions.
Applied a total of 0 rules in 4 ms. Remains 147 /147 variables (removed 0) and now considering 90/90 (removed 0) transitions.
[2024-05-21 17:57:29] [INFO ] Invariant cache hit.
[2024-05-21 17:57:29] [INFO ] Implicit Places using invariants in 447 ms returned []
[2024-05-21 17:57:29] [INFO ] Invariant cache hit.
[2024-05-21 17:57:30] [INFO ] Implicit Places using invariants and state equation in 137 ms returned []
Implicit Place search using SMT with State Equation took 586 ms to find 0 implicit places.
[2024-05-21 17:57:30] [INFO ] Redundant transitions in 1 ms returned []
Running 85 sub problems to find dead transitions.
[2024-05-21 17:57:30] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/142 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/142 variables, 25/52 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/142 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 3 (OVERLAPS) 2/144 variables, 8/60 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/144 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 5 (OVERLAPS) 3/147 variables, 3/63 constraints. Problems are: Problem set: 0 solved, 85 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/147 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 7 (OVERLAPS) 90/237 variables, 147/210 constraints. Problems are: Problem set: 0 solved, 85 unsolved
[2024-05-21 17:57:31] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 1 ms to minimize.
[2024-05-21 17:57:31] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 0 ms to minimize.
[2024-05-21 17:57:31] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 1 ms to minimize.
[2024-05-21 17:57:31] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/237 variables, 4/214 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/237 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 85 unsolved
[2024-05-21 17:57:32] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 1 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/237 variables, 1/215 constraints. Problems are: Problem set: 0 solved, 85 unsolved
[2024-05-21 17:57:32] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/237 variables, 1/216 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/237 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 13 (OVERLAPS) 0/237 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 85 unsolved
No progress, stopping.
After SMT solving in domain Real declared 237/237 variables, and 216 constraints, problems are : Problem set: 0 solved, 85 unsolved in 3772 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 147/147 constraints, PredecessorRefiner: 85/85 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 85 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/142 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/142 variables, 25/52 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/142 variables, 4/56 constraints. Problems are: Problem set: 0 solved, 85 unsolved
[2024-05-21 17:57:34] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 1 ms to minimize.
[2024-05-21 17:57:34] [INFO ] Deduced a trap composed of 14 places in 22 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/142 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/142 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 5 (OVERLAPS) 2/144 variables, 8/66 constraints. Problems are: Problem set: 0 solved, 85 unsolved
[2024-05-21 17:57:34] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 1 ms to minimize.
[2024-05-21 17:57:34] [INFO ] Deduced a trap composed of 8 places in 42 ms of which 1 ms to minimize.
[2024-05-21 17:57:34] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 1 ms to minimize.
[2024-05-21 17:57:34] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 0 ms to minimize.
[2024-05-21 17:57:34] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/144 variables, 5/71 constraints. Problems are: Problem set: 0 solved, 85 unsolved
[2024-05-21 17:57:35] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 1 ms to minimize.
[2024-05-21 17:57:35] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 1 ms to minimize.
[2024-05-21 17:57:35] [INFO ] Deduced a trap composed of 8 places in 37 ms of which 0 ms to minimize.
[2024-05-21 17:57:35] [INFO ] Deduced a trap composed of 8 places in 45 ms of which 0 ms to minimize.
[2024-05-21 17:57:35] [INFO ] Deduced a trap composed of 8 places in 49 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/144 variables, 5/76 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/144 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 9 (OVERLAPS) 3/147 variables, 3/79 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/147 variables, 2/81 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/147 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 12 (OVERLAPS) 90/237 variables, 147/228 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/237 variables, 85/313 constraints. Problems are: Problem set: 0 solved, 85 unsolved
[2024-05-21 17:57:36] [INFO ] Deduced a trap composed of 10 places in 43 ms of which 1 ms to minimize.
[2024-05-21 17:57:37] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 1 ms to minimize.
[2024-05-21 17:57:37] [INFO ] Deduced a trap composed of 5 places in 35 ms of which 0 ms to minimize.
[2024-05-21 17:57:37] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 0 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/237 variables, 4/317 constraints. Problems are: Problem set: 0 solved, 85 unsolved
[2024-05-21 17:57:38] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 0 ms to minimize.
[2024-05-21 17:57:39] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 0 ms to minimize.
[2024-05-21 17:57:39] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/237 variables, 3/320 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/237 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 17 (OVERLAPS) 0/237 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 85 unsolved
No progress, stopping.
After SMT solving in domain Int declared 237/237 variables, and 320 constraints, problems are : Problem set: 0 solved, 85 unsolved in 12349 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 147/147 constraints, PredecessorRefiner: 85/85 constraints, Known Traps: 25/25 constraints]
After SMT, in 16149ms problems are : Problem set: 0 solved, 85 unsolved
Search for dead transitions found 0 dead transitions in 16151ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16748 ms. Remains : 147/147 places, 90/90 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 4 ms. Remains 147 /147 variables (removed 0) and now considering 90/90 (removed 0) transitions.
Running SMT prover for 3 properties.
[2024-05-21 17:57:46] [INFO ] Invariant cache hit.
[2024-05-21 17:57:46] [INFO ] [Real]Absence check using 35 positive place invariants in 5 ms returned sat
[2024-05-21 17:57:46] [INFO ] [Real]Absence check using 35 positive and 28 generalized place invariants in 17 ms returned sat
[2024-05-21 17:57:46] [INFO ] After 93ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-21 17:57:46] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2024-05-21 17:57:46] [INFO ] [Nat]Absence check using 35 positive and 28 generalized place invariants in 6 ms returned sat
[2024-05-21 17:57:46] [INFO ] After 49ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
TRAPS : Iteration 0
[2024-05-21 17:57:47] [INFO ] Deduced a trap composed of 8 places in 495 ms of which 25 ms to minimize.
[2024-05-21 17:57:47] [INFO ] Deduced a trap composed of 8 places in 54 ms of which 0 ms to minimize.
[2024-05-21 17:57:47] [INFO ] Deduced a trap composed of 5 places in 75 ms of which 1 ms to minimize.
[2024-05-21 17:57:47] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 683 ms
[2024-05-21 17:57:47] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 1 ms to minimize.
[2024-05-21 17:57:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 40 ms
[2024-05-21 17:57:47] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 1 ms to minimize.
[2024-05-21 17:57:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 48 ms
TRAPS : Iteration 1
[2024-05-21 17:57:47] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 0 ms to minimize.
[2024-05-21 17:57:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 63 ms
TRAPS : Iteration 2
[2024-05-21 17:57:47] [INFO ] After 966ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
[2024-05-21 17:57:47] [INFO ] After 1051ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Over-approximation ignoring read arcs solved 0 properties in 1181 ms.
Successfully simplified 3 atomic propositions for a total of 16 simplifications.
[2024-05-21 17:57:47] [INFO ] Flatten gal took : 43 ms
[2024-05-21 17:57:47] [INFO ] Flatten gal took : 27 ms
[2024-05-21 17:57:47] [INFO ] Input system was already deterministic with 239 transitions.
Computed a total of 82 stabilizing places and 74 stable transitions
Graph (complete) has 538 edges and 286 vertex of which 278 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.5 ms
Starting structural reductions in LTL mode, iteration 0 : 286/286 places, 239/239 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 269 transition count 222
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 269 transition count 222
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 35 place count 269 transition count 221
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 47 place count 257 transition count 209
Iterating global reduction 1 with 12 rules applied. Total rules applied 59 place count 257 transition count 209
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 69 place count 257 transition count 199
Applied a total of 69 rules in 66 ms. Remains 257 /286 variables (removed 29) and now considering 199/239 (removed 40) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 66 ms. Remains : 257/286 places, 199/239 transitions.
[2024-05-21 17:57:47] [INFO ] Flatten gal took : 10 ms
[2024-05-21 17:57:47] [INFO ] Flatten gal took : 11 ms
[2024-05-21 17:57:47] [INFO ] Input system was already deterministic with 199 transitions.
Starting structural reductions in LTL mode, iteration 0 : 286/286 places, 239/239 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 268 transition count 221
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 268 transition count 221
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 37 place count 268 transition count 220
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 49 place count 256 transition count 208
Iterating global reduction 1 with 12 rules applied. Total rules applied 61 place count 256 transition count 208
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 71 place count 256 transition count 198
Applied a total of 71 rules in 18 ms. Remains 256 /286 variables (removed 30) and now considering 198/239 (removed 41) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18 ms. Remains : 256/286 places, 198/239 transitions.
[2024-05-21 17:57:47] [INFO ] Flatten gal took : 13 ms
[2024-05-21 17:57:47] [INFO ] Flatten gal took : 19 ms
[2024-05-21 17:57:47] [INFO ] Input system was already deterministic with 198 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 286/286 places, 239/239 transitions.
Graph (complete) has 538 edges and 286 vertex of which 278 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 278 transition count 221
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 27 place count 265 transition count 221
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 27 place count 265 transition count 211
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 47 place count 255 transition count 211
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 61 place count 241 transition count 197
Iterating global reduction 2 with 14 rules applied. Total rules applied 75 place count 241 transition count 197
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 2 rules applied. Total rules applied 77 place count 241 transition count 195
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 78 place count 240 transition count 195
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 87 place count 231 transition count 186
Iterating global reduction 4 with 9 rules applied. Total rules applied 96 place count 231 transition count 186
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 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 4 with 10 rules applied. Total rules applied 106 place count 231 transition count 176
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 108 place count 230 transition count 175
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 108 place count 230 transition count 174
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 110 place count 229 transition count 174
Performed 68 Post agglomeration using F-continuation condition.Transition count delta: 68
Deduced a syphon composed of 68 places in 1 ms
Reduce places removed 68 places and 0 transitions.
Iterating global reduction 6 with 136 rules applied. Total rules applied 246 place count 161 transition count 106
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 248 place count 161 transition count 106
Applied a total of 248 rules in 90 ms. Remains 161 /286 variables (removed 125) and now considering 106/239 (removed 133) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 90 ms. Remains : 161/286 places, 106/239 transitions.
[2024-05-21 17:57:47] [INFO ] Flatten gal took : 6 ms
[2024-05-21 17:57:47] [INFO ] Flatten gal took : 7 ms
[2024-05-21 17:57:48] [INFO ] Input system was already deterministic with 106 transitions.
Starting structural reductions in LTL mode, iteration 0 : 286/286 places, 239/239 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 270 transition count 223
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 270 transition count 223
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 33 place count 270 transition count 222
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 44 place count 259 transition count 211
Iterating global reduction 1 with 11 rules applied. Total rules applied 55 place count 259 transition count 211
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 65 place count 259 transition count 201
Applied a total of 65 rules in 32 ms. Remains 259 /286 variables (removed 27) and now considering 201/239 (removed 38) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33 ms. Remains : 259/286 places, 201/239 transitions.
[2024-05-21 17:57:48] [INFO ] Flatten gal took : 25 ms
[2024-05-21 17:57:48] [INFO ] Flatten gal took : 13 ms
[2024-05-21 17:57:48] [INFO ] Input system was already deterministic with 201 transitions.
Starting structural reductions in LTL mode, iteration 0 : 286/286 places, 239/239 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 269 transition count 222
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 269 transition count 222
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 35 place count 269 transition count 221
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 47 place count 257 transition count 209
Iterating global reduction 1 with 12 rules applied. Total rules applied 59 place count 257 transition count 209
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 69 place count 257 transition count 199
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 70 place count 256 transition count 198
Iterating global reduction 2 with 1 rules applied. Total rules applied 71 place count 256 transition count 198
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 72 place count 256 transition count 197
Applied a total of 72 rules in 30 ms. Remains 256 /286 variables (removed 30) and now considering 197/239 (removed 42) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 43 ms. Remains : 256/286 places, 197/239 transitions.
[2024-05-21 17:57:48] [INFO ] Flatten gal took : 20 ms
[2024-05-21 17:57:48] [INFO ] Flatten gal took : 17 ms
[2024-05-21 17:57:48] [INFO ] Input system was already deterministic with 197 transitions.
Starting structural reductions in LTL mode, iteration 0 : 286/286 places, 239/239 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 270 transition count 223
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 270 transition count 223
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 42 place count 260 transition count 213
Iterating global reduction 0 with 10 rules applied. Total rules applied 52 place count 260 transition count 213
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 60 place count 260 transition count 205
Applied a total of 60 rules in 30 ms. Remains 260 /286 variables (removed 26) and now considering 205/239 (removed 34) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30 ms. Remains : 260/286 places, 205/239 transitions.
[2024-05-21 17:57:48] [INFO ] Flatten gal took : 24 ms
[2024-05-21 17:57:48] [INFO ] Flatten gal took : 9 ms
[2024-05-21 17:57:48] [INFO ] Input system was already deterministic with 205 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 286/286 places, 239/239 transitions.
Graph (complete) has 538 edges and 286 vertex of which 278 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 277 transition count 219
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 29 place count 263 transition count 219
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 29 place count 263 transition count 212
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 43 place count 256 transition count 212
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 56 place count 243 transition count 199
Iterating global reduction 2 with 13 rules applied. Total rules applied 69 place count 243 transition count 199
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 2 rules applied. Total rules applied 71 place count 243 transition count 197
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 72 place count 242 transition count 197
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 82 place count 232 transition count 187
Iterating global reduction 4 with 10 rules applied. Total rules applied 92 place count 232 transition count 187
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 4 with 10 rules applied. Total rules applied 102 place count 232 transition count 177
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 3 Pre rules applied. Total rules applied 102 place count 232 transition count 174
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 108 place count 229 transition count 174
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 242 place count 162 transition count 107
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 243 place count 162 transition count 106
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 245 place count 160 transition count 104
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 246 place count 159 transition count 104
Applied a total of 246 rules in 91 ms. Remains 159 /286 variables (removed 127) and now considering 104/239 (removed 135) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 91 ms. Remains : 159/286 places, 104/239 transitions.
[2024-05-21 17:57:48] [INFO ] Flatten gal took : 6 ms
[2024-05-21 17:57:48] [INFO ] Flatten gal took : 6 ms
[2024-05-21 17:57:48] [INFO ] Input system was already deterministic with 104 transitions.
Starting structural reductions in LTL mode, iteration 0 : 286/286 places, 239/239 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 269 transition count 222
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 269 transition count 222
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 35 place count 269 transition count 221
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 45 place count 259 transition count 211
Iterating global reduction 1 with 10 rules applied. Total rules applied 55 place count 259 transition count 211
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 63 place count 259 transition count 203
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 64 place count 258 transition count 202
Iterating global reduction 2 with 1 rules applied. Total rules applied 65 place count 258 transition count 202
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 66 place count 258 transition count 201
Applied a total of 66 rules in 37 ms. Remains 258 /286 variables (removed 28) and now considering 201/239 (removed 38) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 37 ms. Remains : 258/286 places, 201/239 transitions.
[2024-05-21 17:57:48] [INFO ] Flatten gal took : 23 ms
[2024-05-21 17:57:48] [INFO ] Flatten gal took : 60 ms
[2024-05-21 17:57:48] [INFO ] Input system was already deterministic with 201 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 286/286 places, 239/239 transitions.
Graph (complete) has 538 edges and 286 vertex of which 278 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 1 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 277 transition count 221
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 25 place count 265 transition count 221
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 25 place count 265 transition count 210
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 47 place count 254 transition count 210
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 61 place count 240 transition count 196
Iterating global reduction 2 with 14 rules applied. Total rules applied 75 place count 240 transition count 196
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 2 rules applied. Total rules applied 77 place count 240 transition count 194
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 78 place count 239 transition count 194
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 88 place count 229 transition count 184
Iterating global reduction 4 with 10 rules applied. Total rules applied 98 place count 229 transition count 184
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 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 4 with 10 rules applied. Total rules applied 108 place count 229 transition count 174
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 110 place count 228 transition count 173
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 110 place count 228 transition count 172
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 112 place count 227 transition count 172
Performed 70 Post agglomeration using F-continuation condition.Transition count delta: 70
Deduced a syphon composed of 70 places in 1 ms
Reduce places removed 70 places and 0 transitions.
Iterating global reduction 6 with 140 rules applied. Total rules applied 252 place count 157 transition count 102
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 254 place count 155 transition count 100
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 255 place count 154 transition count 100
Applied a total of 255 rules in 66 ms. Remains 154 /286 variables (removed 132) and now considering 100/239 (removed 139) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 66 ms. Remains : 154/286 places, 100/239 transitions.
[2024-05-21 17:57:48] [INFO ] Flatten gal took : 5 ms
[2024-05-21 17:57:48] [INFO ] Flatten gal took : 21 ms
[2024-05-21 17:57:48] [INFO ] Input system was already deterministic with 100 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 286/286 places, 239/239 transitions.
Graph (complete) has 538 edges and 286 vertex of which 278 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 277 transition count 220
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 27 place count 264 transition count 220
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 27 place count 264 transition count 210
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 47 place count 254 transition count 210
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 63 place count 238 transition count 194
Iterating global reduction 2 with 16 rules applied. Total rules applied 79 place count 238 transition count 194
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 2 rules applied. Total rules applied 81 place count 238 transition count 192
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 82 place count 237 transition count 192
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 93 place count 226 transition count 181
Iterating global reduction 4 with 11 rules applied. Total rules applied 104 place count 226 transition count 181
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 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 4 with 11 rules applied. Total rules applied 115 place count 226 transition count 170
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 117 place count 225 transition count 169
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 3 Pre rules applied. Total rules applied 117 place count 225 transition count 166
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 123 place count 222 transition count 166
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 6 with 134 rules applied. Total rules applied 257 place count 155 transition count 99
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 259 place count 155 transition count 99
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 261 place count 153 transition count 97
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 262 place count 152 transition count 97
Applied a total of 262 rules in 68 ms. Remains 152 /286 variables (removed 134) and now considering 97/239 (removed 142) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 68 ms. Remains : 152/286 places, 97/239 transitions.
[2024-05-21 17:57:48] [INFO ] Flatten gal took : 4 ms
[2024-05-21 17:57:48] [INFO ] Flatten gal took : 4 ms
[2024-05-21 17:57:48] [INFO ] Input system was already deterministic with 97 transitions.
Starting structural reductions in LTL mode, iteration 0 : 286/286 places, 239/239 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 270 transition count 223
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 270 transition count 223
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 33 place count 270 transition count 222
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 44 place count 259 transition count 211
Iterating global reduction 1 with 11 rules applied. Total rules applied 55 place count 259 transition count 211
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 64 place count 259 transition count 202
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 65 place count 258 transition count 201
Iterating global reduction 2 with 1 rules applied. Total rules applied 66 place count 258 transition count 201
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 67 place count 258 transition count 200
Applied a total of 67 rules in 34 ms. Remains 258 /286 variables (removed 28) and now considering 200/239 (removed 39) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 34 ms. Remains : 258/286 places, 200/239 transitions.
[2024-05-21 17:57:48] [INFO ] Flatten gal took : 23 ms
[2024-05-21 17:57:48] [INFO ] Flatten gal took : 7 ms
[2024-05-21 17:57:48] [INFO ] Input system was already deterministic with 200 transitions.
Starting structural reductions in LTL mode, iteration 0 : 286/286 places, 239/239 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 268 transition count 221
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 268 transition count 221
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 37 place count 268 transition count 220
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 50 place count 255 transition count 207
Iterating global reduction 1 with 13 rules applied. Total rules applied 63 place count 255 transition count 207
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 74 place count 255 transition count 196
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 75 place count 254 transition count 195
Iterating global reduction 2 with 1 rules applied. Total rules applied 76 place count 254 transition count 195
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 77 place count 254 transition count 194
Applied a total of 77 rules in 33 ms. Remains 254 /286 variables (removed 32) and now considering 194/239 (removed 45) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33 ms. Remains : 254/286 places, 194/239 transitions.
[2024-05-21 17:57:48] [INFO ] Flatten gal took : 28 ms
[2024-05-21 17:57:48] [INFO ] Flatten gal took : 19 ms
[2024-05-21 17:57:49] [INFO ] Input system was already deterministic with 194 transitions.
Starting structural reductions in LTL mode, iteration 0 : 286/286 places, 239/239 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 268 transition count 221
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 268 transition count 221
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 37 place count 268 transition count 220
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 49 place count 256 transition count 208
Iterating global reduction 1 with 12 rules applied. Total rules applied 61 place count 256 transition count 208
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 71 place count 256 transition count 198
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 72 place count 255 transition count 197
Iterating global reduction 2 with 1 rules applied. Total rules applied 73 place count 255 transition count 197
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 74 place count 255 transition count 196
Applied a total of 74 rules in 37 ms. Remains 255 /286 variables (removed 31) and now considering 196/239 (removed 43) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 37 ms. Remains : 255/286 places, 196/239 transitions.
[2024-05-21 17:57:49] [INFO ] Flatten gal took : 23 ms
[2024-05-21 17:57:49] [INFO ] Flatten gal took : 6 ms
[2024-05-21 17:57:49] [INFO ] Input system was already deterministic with 196 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 286/286 places, 239/239 transitions.
Graph (complete) has 538 edges and 286 vertex of which 278 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.0 ms
Discarding 8 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 1 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 277 transition count 221
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 25 place count 265 transition count 221
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 25 place count 265 transition count 210
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 47 place count 254 transition count 210
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 63 place count 238 transition count 194
Iterating global reduction 2 with 16 rules applied. Total rules applied 79 place count 238 transition count 194
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 2 rules applied. Total rules applied 81 place count 238 transition count 192
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 82 place count 237 transition count 192
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 93 place count 226 transition count 181
Iterating global reduction 4 with 11 rules applied. Total rules applied 104 place count 226 transition count 181
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 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 4 with 11 rules applied. Total rules applied 115 place count 226 transition count 170
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 117 place count 225 transition count 169
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 117 place count 225 transition count 167
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 121 place count 223 transition count 167
Performed 62 Post agglomeration using F-continuation condition.Transition count delta: 62
Deduced a syphon composed of 62 places in 0 ms
Reduce places removed 62 places and 0 transitions.
Iterating global reduction 6 with 124 rules applied. Total rules applied 245 place count 161 transition count 105
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 247 place count 161 transition count 105
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 249 place count 159 transition count 103
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 250 place count 158 transition count 103
Applied a total of 250 rules in 63 ms. Remains 158 /286 variables (removed 128) and now considering 103/239 (removed 136) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 63 ms. Remains : 158/286 places, 103/239 transitions.
[2024-05-21 17:57:49] [INFO ] Flatten gal took : 5 ms
[2024-05-21 17:57:49] [INFO ] Flatten gal took : 5 ms
[2024-05-21 17:57:49] [INFO ] Input system was already deterministic with 103 transitions.
Starting structural reductions in LTL mode, iteration 0 : 286/286 places, 239/239 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 268 transition count 221
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 268 transition count 221
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 37 place count 268 transition count 220
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 49 place count 256 transition count 208
Iterating global reduction 1 with 12 rules applied. Total rules applied 61 place count 256 transition count 208
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 71 place count 256 transition count 198
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 72 place count 255 transition count 197
Iterating global reduction 2 with 1 rules applied. Total rules applied 73 place count 255 transition count 197
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 74 place count 255 transition count 196
Applied a total of 74 rules in 32 ms. Remains 255 /286 variables (removed 31) and now considering 196/239 (removed 43) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32 ms. Remains : 255/286 places, 196/239 transitions.
[2024-05-21 17:57:49] [INFO ] Flatten gal took : 6 ms
[2024-05-21 17:57:49] [INFO ] Flatten gal took : 22 ms
[2024-05-21 17:57:49] [INFO ] Input system was already deterministic with 196 transitions.
Starting structural reductions in LTL mode, iteration 0 : 286/286 places, 239/239 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 272 transition count 225
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 272 transition count 225
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 29 place count 272 transition count 224
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 39 place count 262 transition count 214
Iterating global reduction 1 with 10 rules applied. Total rules applied 49 place count 262 transition count 214
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 57 place count 262 transition count 206
Applied a total of 57 rules in 26 ms. Remains 262 /286 variables (removed 24) and now considering 206/239 (removed 33) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 26 ms. Remains : 262/286 places, 206/239 transitions.
[2024-05-21 17:57:49] [INFO ] Flatten gal took : 22 ms
[2024-05-21 17:57:49] [INFO ] Flatten gal took : 6 ms
[2024-05-21 17:57:49] [INFO ] Input system was already deterministic with 206 transitions.
[2024-05-21 17:57:49] [INFO ] Flatten gal took : 23 ms
[2024-05-21 17:57:49] [INFO ] Flatten gal took : 23 ms
[2024-05-21 17:57:49] [INFO ] Export to MCC of 16 properties in file /home/mcc/execution/CTLFireability.sr.xml took 21 ms.
[2024-05-21 17:57:49] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 286 places, 239 transitions and 716 arcs took 2 ms.
Total runtime 104291 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running DES-PT-05b

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/415/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 286
TRANSITIONS: 239
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.004s, Sys 0.000s]


SAVING FILE /home/mcc/execution/415/model (.net / .def) ...
EXPORT TIME: [User 0.000s, Sys 0.000s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 1043
MODEL NAME: /home/mcc/execution/415/model
286 places, 239 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA DES-PT-05b-CTLFireability-2024-11 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA DES-PT-05b-CTLFireability-2024-00 CANNOT_COMPUTE
FORMULA DES-PT-05b-CTLFireability-2024-01 CANNOT_COMPUTE
FORMULA DES-PT-05b-CTLFireability-2024-02 CANNOT_COMPUTE
FORMULA DES-PT-05b-CTLFireability-2024-03 CANNOT_COMPUTE
FORMULA DES-PT-05b-CTLFireability-2024-04 CANNOT_COMPUTE
FORMULA DES-PT-05b-CTLFireability-2024-05 CANNOT_COMPUTE
FORMULA DES-PT-05b-CTLFireability-2024-06 CANNOT_COMPUTE
FORMULA DES-PT-05b-CTLFireability-2024-07 CANNOT_COMPUTE
FORMULA DES-PT-05b-CTLFireability-2024-08 CANNOT_COMPUTE
FORMULA DES-PT-05b-CTLFireability-2024-09 CANNOT_COMPUTE
FORMULA DES-PT-05b-CTLFireability-2024-10 CANNOT_COMPUTE
FORMULA DES-PT-05b-CTLFireability-2023-12 CANNOT_COMPUTE
FORMULA DES-PT-05b-CTLFireability-2023-13 CANNOT_COMPUTE
FORMULA DES-PT-05b-CTLFireability-2023-14 CANNOT_COMPUTE
FORMULA DES-PT-05b-CTLFireability-2023-15 CANNOT_COMPUTE
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716315945254

--------------------
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
MEDDLY ERROR: Insufficient memory

Error in allocating array of size 4194304 at unique_table.cc, line 313
MEDDLY ERROR: Insufficient memory

Error in allocating array of size 4194304 at unique_table.cc, line 313
MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

Error in allocating array of size 2097152 at unique_table.cc, line 313
MEDDLY ERROR: Insufficient memory

Error in allocating array of size 4194304 at unique_table.cc, line 313
MEDDLY ERROR: Insufficient memory

Error in allocating array of size 8388608 at unique_table.cc, line 313
MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

Error in allocating array of size 4194304 at unique_table.cc, line 313
MEDDLY ERROR: Insufficient memory

Error in allocating array of size 2097152 at unique_table.cc, line 313
MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

Error in allocating array of size 4194304 at unique_table.cc, line 313
MEDDLY ERROR: Insufficient memory

Error in allocating array of size 4194304 at unique_table.cc, line 313
MEDDLY ERROR: Insufficient memory

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-05b"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="greatspnxred"
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 greatspnxred"
echo " Input is DES-PT-05b, 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 r091-tall-171624188200658"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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