Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r516-tajo-171654446700234.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is PolyORBLF-PT-S02J04T10, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r516-tajo-171654446700234
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.4M
-rw-r--r-- 1 mcc users 25K Apr 11 16:48 CTLCardinality.txt
-rw-r--r-- 1 mcc users 137K Apr 11 16:48 CTLCardinality.xml
-rw-r--r-- 1 mcc users 46K Apr 11 16:46 CTLFireability.txt
-rw-r--r-- 1 mcc users 243K Apr 11 16:46 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 9.5K Apr 23 07:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 41K Apr 23 07:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 23 07:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 45K Apr 23 07:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 58K Apr 11 16:57 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 293K Apr 11 16:57 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 93K Apr 11 16:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 478K Apr 11 16:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.4K Apr 23 07:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 7.0K Apr 23 07:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 10 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 906K May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1717252482819

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-PT-S02J04T10
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 14:34:44] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 14:34:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 14:34:44] [INFO ] Load time of PNML (sax parser for PT used): 166 ms
[2024-06-01 14:34:44] [INFO ] Transformed 752 places.
[2024-06-01 14:34:44] [INFO ] Transformed 1572 transitions.
[2024-06-01 14:34:44] [INFO ] Parsed PT model containing 752 places and 1572 transitions and 7262 arcs in 320 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 28 ms.
[2024-06-01 14:34:44] [INFO ] Reduced 10 identical enabling conditions.
[2024-06-01 14:34:44] [INFO ] Reduced 110 identical enabling conditions.
[2024-06-01 14:34:44] [INFO ] Reduced 10 identical enabling conditions.
[2024-06-01 14:34:44] [INFO ] Reduced 110 identical enabling conditions.
[2024-06-01 14:34:44] [INFO ] Reduced 10 identical enabling conditions.
[2024-06-01 14:34:44] [INFO ] Reduced 10 identical enabling conditions.
[2024-06-01 14:34:44] [INFO ] Reduced 40 identical enabling conditions.
[2024-06-01 14:34:44] [INFO ] Reduced 40 identical enabling conditions.
[2024-06-01 14:34:44] [INFO ] Reduced 110 identical enabling conditions.
[2024-06-01 14:34:44] [INFO ] Reduced 10 identical enabling conditions.
Ensure Unique test removed 160 transitions
Reduce redundant transitions removed 160 transitions.
Support contains 613 out of 752 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 752/752 places, 1412/1412 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 750 transition count 1412
Applied a total of 2 rules in 53 ms. Remains 750 /752 variables (removed 2) and now considering 1412/1412 (removed 0) transitions.
Running 1410 sub problems to find dead transitions.
[2024-06-01 14:34:44] [INFO ] Flow matrix only has 1392 transitions (discarded 20 similar events)
// Phase 1: matrix 1392 rows 750 cols
[2024-06-01 14:34:44] [INFO ] Computed 52 invariants in 78 ms
[2024-06-01 14:34:44] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/748 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/748 variables, 38/50 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
[2024-06-01 14:35:01] [INFO ] Deduced a trap composed of 66 places in 225 ms of which 46 ms to minimize.
[2024-06-01 14:35:01] [INFO ] Deduced a trap composed of 65 places in 132 ms of which 1 ms to minimize.
[2024-06-01 14:35:01] [INFO ] Deduced a trap composed of 66 places in 68 ms of which 1 ms to minimize.
[2024-06-01 14:35:01] [INFO ] Deduced a trap composed of 66 places in 62 ms of which 1 ms to minimize.
[2024-06-01 14:35:02] [INFO ] Deduced a trap composed of 66 places in 63 ms of which 1 ms to minimize.
[2024-06-01 14:35:02] [INFO ] Deduced a trap composed of 66 places in 55 ms of which 2 ms to minimize.
[2024-06-01 14:35:02] [INFO ] Deduced a trap composed of 65 places in 434 ms of which 4 ms to minimize.
[2024-06-01 14:35:03] [INFO ] Deduced a trap composed of 406 places in 438 ms of which 5 ms to minimize.
[2024-06-01 14:35:03] [INFO ] Deduced a trap composed of 66 places in 73 ms of which 1 ms to minimize.
[2024-06-01 14:35:03] [INFO ] Deduced a trap composed of 67 places in 51 ms of which 1 ms to minimize.
[2024-06-01 14:35:03] [INFO ] Deduced a trap composed of 65 places in 78 ms of which 1 ms to minimize.
[2024-06-01 14:35:04] [INFO ] Deduced a trap composed of 245 places in 525 ms of which 8 ms to minimize.
[2024-06-01 14:35:05] [INFO ] Deduced a trap composed of 86 places in 246 ms of which 5 ms to minimize.
[2024-06-01 14:35:06] [INFO ] Deduced a trap composed of 410 places in 326 ms of which 4 ms to minimize.
SMT process timed out in 22168ms, After SMT, problems are : Problem set: 0 solved, 1410 unsolved
Search for dead transitions found 0 dead transitions in 22215ms
[2024-06-01 14:35:06] [INFO ] Flow matrix only has 1392 transitions (discarded 20 similar events)
[2024-06-01 14:35:06] [INFO ] Invariant cache hit.
[2024-06-01 14:35:07] [INFO ] Implicit Places using invariants in 281 ms returned []
[2024-06-01 14:35:07] [INFO ] Flow matrix only has 1392 transitions (discarded 20 similar events)
[2024-06-01 14:35:07] [INFO ] Invariant cache hit.
[2024-06-01 14:35:08] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-06-01 14:35:14] [INFO ] Implicit Places using invariants and state equation in 7028 ms returned []
Implicit Place search using SMT with State Equation took 7327 ms to find 0 implicit places.
Running 1410 sub problems to find dead transitions.
[2024-06-01 14:35:14] [INFO ] Flow matrix only has 1392 transitions (discarded 20 similar events)
[2024-06-01 14:35:14] [INFO ] Invariant cache hit.
[2024-06-01 14:35:14] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/748 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/748 variables, 38/50 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
[2024-06-01 14:35:29] [INFO ] Deduced a trap composed of 66 places in 88 ms of which 2 ms to minimize.
[2024-06-01 14:35:29] [INFO ] Deduced a trap composed of 65 places in 67 ms of which 1 ms to minimize.
[2024-06-01 14:35:30] [INFO ] Deduced a trap composed of 65 places in 103 ms of which 2 ms to minimize.
[2024-06-01 14:35:30] [INFO ] Deduced a trap composed of 67 places in 107 ms of which 2 ms to minimize.
[2024-06-01 14:35:30] [INFO ] Deduced a trap composed of 66 places in 70 ms of which 2 ms to minimize.
[2024-06-01 14:35:30] [INFO ] Deduced a trap composed of 66 places in 62 ms of which 2 ms to minimize.
[2024-06-01 14:35:30] [INFO ] Deduced a trap composed of 66 places in 61 ms of which 1 ms to minimize.
[2024-06-01 14:35:31] [INFO ] Deduced a trap composed of 65 places in 412 ms of which 6 ms to minimize.
[2024-06-01 14:35:31] [INFO ] Deduced a trap composed of 402 places in 346 ms of which 4 ms to minimize.
[2024-06-01 14:35:31] [INFO ] Deduced a trap composed of 65 places in 73 ms of which 1 ms to minimize.
[2024-06-01 14:35:31] [INFO ] Deduced a trap composed of 65 places in 68 ms of which 1 ms to minimize.
[2024-06-01 14:35:32] [INFO ] Deduced a trap composed of 165 places in 307 ms of which 5 ms to minimize.
[2024-06-01 14:35:33] [INFO ] Deduced a trap composed of 501 places in 411 ms of which 6 ms to minimize.
[2024-06-01 14:35:34] [INFO ] Deduced a trap composed of 498 places in 371 ms of which 5 ms to minimize.
[2024-06-01 14:35:34] [INFO ] Deduced a trap composed of 497 places in 373 ms of which 4 ms to minimize.
[2024-06-01 14:35:34] [INFO ] Deduced a trap composed of 495 places in 378 ms of which 5 ms to minimize.
[2024-06-01 14:35:35] [INFO ] Deduced a trap composed of 491 places in 350 ms of which 5 ms to minimize.
[2024-06-01 14:35:36] [INFO ] Deduced a trap composed of 409 places in 428 ms of which 5 ms to minimize.
[2024-06-01 14:35:36] [INFO ] Deduced a trap composed of 393 places in 446 ms of which 6 ms to minimize.
[2024-06-01 14:35:37] [INFO ] Deduced a trap composed of 415 places in 412 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/748 variables, 20/70 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
[2024-06-01 14:35:40] [INFO ] Deduced a trap composed of 247 places in 438 ms of which 8 ms to minimize.
[2024-06-01 14:35:40] [INFO ] Deduced a trap composed of 226 places in 403 ms of which 5 ms to minimize.
[2024-06-01 14:35:41] [INFO ] Deduced a trap composed of 234 places in 324 ms of which 4 ms to minimize.
[2024-06-01 14:35:41] [INFO ] Deduced a trap composed of 220 places in 364 ms of which 4 ms to minimize.
[2024-06-01 14:35:42] [INFO ] Deduced a trap composed of 409 places in 408 ms of which 6 ms to minimize.
[2024-06-01 14:35:42] [INFO ] Deduced a trap composed of 81 places in 291 ms of which 4 ms to minimize.
[2024-06-01 14:35:43] [INFO ] Deduced a trap composed of 443 places in 410 ms of which 6 ms to minimize.
[2024-06-01 14:35:43] [INFO ] Deduced a trap composed of 403 places in 418 ms of which 5 ms to minimize.
[2024-06-01 14:35:44] [INFO ] Deduced a trap composed of 391 places in 388 ms of which 6 ms to minimize.
[2024-06-01 14:35:44] [INFO ] Deduced a trap composed of 420 places in 361 ms of which 5 ms to minimize.
[2024-06-01 14:35:44] [INFO ] Deduced a trap composed of 422 places in 335 ms of which 4 ms to minimize.
[2024-06-01 14:35:45] [INFO ] Deduced a trap composed of 386 places in 333 ms of which 5 ms to minimize.
[2024-06-01 14:35:45] [INFO ] Deduced a trap composed of 23 places in 376 ms of which 4 ms to minimize.
[2024-06-01 14:35:46] [INFO ] Deduced a trap composed of 420 places in 383 ms of which 4 ms to minimize.
SMT process timed out in 31829ms, After SMT, problems are : Problem set: 0 solved, 1410 unsolved
Search for dead transitions found 0 dead transitions in 31841ms
Starting structural reductions in LTL mode, iteration 1 : 750/752 places, 1412/1412 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61488 ms. Remains : 750/752 places, 1412/1412 transitions.
Support contains 613 out of 750 places after structural reductions.
[2024-06-01 14:35:46] [INFO ] Flatten gal took : 177 ms
[2024-06-01 14:35:46] [INFO ] Flatten gal took : 112 ms
[2024-06-01 14:35:47] [INFO ] Input system was already deterministic with 1412 transitions.
RANDOM walk for 40000 steps (11 resets) in 2859 ms. (13 steps per ms) remains 22/101 properties
BEST_FIRST walk for 4004 steps (8 resets) in 272 ms. (14 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (8 resets) in 218 ms. (18 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (8 resets) in 91 ms. (43 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (8 resets) in 97 ms. (40 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4000 steps (8 resets) in 140 ms. (28 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (8 resets) in 67 ms. (58 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (8 resets) in 62 ms. (63 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4001 steps (9 resets) in 66 ms. (59 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (8 resets) in 92 ms. (43 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (8 resets) in 49 ms. (80 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (8 resets) in 53 ms. (74 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (8 resets) in 50 ms. (78 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (8 resets) in 49 ms. (80 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (8 resets) in 45 ms. (87 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (9 resets) in 45 ms. (87 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (8 resets) in 61 ms. (64 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (8 resets) in 70 ms. (56 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (8 resets) in 55 ms. (71 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (8 resets) in 60 ms. (65 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (8 resets) in 60 ms. (65 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (8 resets) in 70 ms. (56 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (8 resets) in 64 ms. (61 steps per ms) remains 22/22 properties
[2024-06-01 14:35:48] [INFO ] Flow matrix only has 1392 transitions (discarded 20 similar events)
[2024-06-01 14:35:48] [INFO ] Invariant cache hit.
[2024-06-01 14:35:48] [INFO ] State equation strengthened by 120 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/243 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 22 unsolved
Problem AtomicPropp51 is UNSAT
Problem AtomicPropp54 is UNSAT
Problem AtomicPropp64 is UNSAT
Problem AtomicPropp73 is UNSAT
Problem AtomicPropp75 is UNSAT
Problem AtomicPropp99 is UNSAT
At refinement iteration 1 (OVERLAPS) 96/339 variables, 11/11 constraints. Problems are: Problem set: 6 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/339 variables, 0/11 constraints. Problems are: Problem set: 6 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 1/340 variables, 1/12 constraints. Problems are: Problem set: 6 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/340 variables, 0/12 constraints. Problems are: Problem set: 6 solved, 16 unsolved
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp26 is UNSAT
Problem AtomicPropp32 is UNSAT
Problem AtomicPropp34 is UNSAT
Problem AtomicPropp37 is UNSAT
Problem AtomicPropp45 is UNSAT
Problem AtomicPropp60 is UNSAT
Problem AtomicPropp65 is UNSAT
Problem AtomicPropp74 is UNSAT
Problem AtomicPropp78 is UNSAT
Problem AtomicPropp88 is UNSAT
Problem AtomicPropp93 is UNSAT
Problem AtomicPropp96 is UNSAT
At refinement iteration 5 (OVERLAPS) 395/735 variables, 30/42 constraints. Problems are: Problem set: 21 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/735 variables, 0/42 constraints. Problems are: Problem set: 21 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/736 variables, 1/43 constraints. Problems are: Problem set: 21 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/736 variables, 0/43 constraints. Problems are: Problem set: 21 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 14/750 variables, 9/52 constraints. Problems are: Problem set: 21 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/750 variables, 0/52 constraints. Problems are: Problem set: 21 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2142/2142 variables, and 802 constraints, problems are : Problem set: 21 solved, 1 unsolved in 2040 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 39/39 constraints, State Equation: 750/750 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 22/22 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 21 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 21 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 345/355 variables, 4/4 constraints. Problems are: Problem set: 21 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/355 variables, 0/4 constraints. Problems are: Problem set: 21 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 80/435 variables, 6/10 constraints. Problems are: Problem set: 21 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/435 variables, 0/10 constraints. Problems are: Problem set: 21 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 7/442 variables, 4/14 constraints. Problems are: Problem set: 21 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/442 variables, 0/14 constraints. Problems are: Problem set: 21 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 304/746 variables, 35/49 constraints. Problems are: Problem set: 21 solved, 1 unsolved
[2024-06-01 14:35:51] [INFO ] Deduced a trap composed of 65 places in 280 ms of which 4 ms to minimize.
[2024-06-01 14:35:51] [INFO ] Deduced a trap composed of 65 places in 292 ms of which 4 ms to minimize.
[2024-06-01 14:35:52] [INFO ] Deduced a trap composed of 65 places in 216 ms of which 5 ms to minimize.
[2024-06-01 14:35:52] [INFO ] Deduced a trap composed of 66 places in 192 ms of which 3 ms to minimize.
[2024-06-01 14:35:52] [INFO ] Deduced a trap composed of 65 places in 158 ms of which 3 ms to minimize.
[2024-06-01 14:35:52] [INFO ] Deduced a trap composed of 65 places in 123 ms of which 2 ms to minimize.
[2024-06-01 14:35:52] [INFO ] Deduced a trap composed of 66 places in 80 ms of which 1 ms to minimize.
[2024-06-01 14:35:52] [INFO ] Deduced a trap composed of 65 places in 75 ms of which 1 ms to minimize.
[2024-06-01 14:35:52] [INFO ] Deduced a trap composed of 66 places in 60 ms of which 8 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/746 variables, 9/58 constraints. Problems are: Problem set: 21 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/746 variables, 0/58 constraints. Problems are: Problem set: 21 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 2/748 variables, 2/60 constraints. Problems are: Problem set: 21 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/748 variables, 0/60 constraints. Problems are: Problem set: 21 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2140/2142 variables, and 808 constraints, problems are : Problem set: 21 solved, 1 unsolved in 3587 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 39/39 constraints, State Equation: 748/750 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/22 constraints, Known Traps: 9/9 constraints]
After SMT, in 6144ms problems are : Problem set: 21 solved, 1 unsolved
Parikh walk visited 0 properties in 669 ms.
Support contains 10 out of 750 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 750/750 places, 1412/1412 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 90 transitions
Trivial Post-agglo rules discarded 90 transitions
Performed 90 trivial Post agglomeration. Transition count delta: 90
Iterating post reduction 0 with 90 rules applied. Total rules applied 90 place count 750 transition count 1322
Reduce places removed 90 places and 0 transitions.
Iterating post reduction 1 with 90 rules applied. Total rules applied 180 place count 660 transition count 1322
Performed 80 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 80 Pre rules applied. Total rules applied 180 place count 660 transition count 1242
Deduced a syphon composed of 80 places in 2 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 2 with 160 rules applied. Total rules applied 340 place count 580 transition count 1242
Performed 80 Post agglomeration using F-continuation condition.Transition count delta: 80
Deduced a syphon composed of 80 places in 2 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 2 with 160 rules applied. Total rules applied 500 place count 500 transition count 1162
Free-agglomeration rule (complex) applied 20 times.
Iterating global reduction 2 with 20 rules applied. Total rules applied 520 place count 500 transition count 1142
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 2 with 20 rules applied. Total rules applied 540 place count 480 transition count 1142
Applied a total of 540 rules in 313 ms. Remains 480 /750 variables (removed 270) and now considering 1142/1412 (removed 270) transitions.
Running 1140 sub problems to find dead transitions.
[2024-06-01 14:35:55] [INFO ] Flow matrix only has 1122 transitions (discarded 20 similar events)
// Phase 1: matrix 1122 rows 480 cols
[2024-06-01 14:35:55] [INFO ] Computed 52 invariants in 29 ms
[2024-06-01 14:35:55] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/478 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1140 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/478 variables, 36/50 constraints. Problems are: Problem set: 0 solved, 1140 unsolved
[2024-06-01 14:36:07] [INFO ] Deduced a trap composed of 38 places in 119 ms of which 2 ms to minimize.
[2024-06-01 14:36:07] [INFO ] Deduced a trap composed of 38 places in 150 ms of which 2 ms to minimize.
[2024-06-01 14:36:07] [INFO ] Deduced a trap composed of 39 places in 86 ms of which 1 ms to minimize.
[2024-06-01 14:36:07] [INFO ] Deduced a trap composed of 38 places in 46 ms of which 1 ms to minimize.
[2024-06-01 14:36:07] [INFO ] Deduced a trap composed of 39 places in 38 ms of which 1 ms to minimize.
[2024-06-01 14:36:07] [INFO ] Deduced a trap composed of 38 places in 63 ms of which 1 ms to minimize.
[2024-06-01 14:36:07] [INFO ] Deduced a trap composed of 39 places in 48 ms of which 1 ms to minimize.
[2024-06-01 14:36:07] [INFO ] Deduced a trap composed of 39 places in 31 ms of which 1 ms to minimize.
[2024-06-01 14:36:07] [INFO ] Deduced a trap composed of 39 places in 36 ms of which 1 ms to minimize.
[2024-06-01 14:36:07] [INFO ] Deduced a trap composed of 39 places in 46 ms of which 0 ms to minimize.
[2024-06-01 14:36:08] [INFO ] Deduced a trap composed of 23 places in 170 ms of which 3 ms to minimize.
[2024-06-01 14:36:08] [INFO ] Deduced a trap composed of 89 places in 263 ms of which 3 ms to minimize.
[2024-06-01 14:36:09] [INFO ] Deduced a trap composed of 312 places in 220 ms of which 3 ms to minimize.
[2024-06-01 14:36:09] [INFO ] Deduced a trap composed of 288 places in 290 ms of which 4 ms to minimize.
[2024-06-01 14:36:10] [INFO ] Deduced a trap composed of 286 places in 223 ms of which 3 ms to minimize.
[2024-06-01 14:36:11] [INFO ] Deduced a trap composed of 206 places in 222 ms of which 3 ms to minimize.
[2024-06-01 14:36:11] [INFO ] Deduced a trap composed of 239 places in 213 ms of which 3 ms to minimize.
[2024-06-01 14:36:13] [INFO ] Deduced a trap composed of 178 places in 257 ms of which 3 ms to minimize.
[2024-06-01 14:36:13] [INFO ] Deduced a trap composed of 170 places in 228 ms of which 3 ms to minimize.
[2024-06-01 14:36:13] [INFO ] Deduced a trap composed of 193 places in 244 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/478 variables, 20/70 constraints. Problems are: Problem set: 0 solved, 1140 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 478/1602 variables, and 70 constraints, problems are : Problem set: 0 solved, 1140 unsolved in 20031 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 36/37 constraints, State Equation: 0/480 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1140/1140 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1140 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/478 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1140 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/478 variables, 36/50 constraints. Problems are: Problem set: 0 solved, 1140 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/478 variables, 20/70 constraints. Problems are: Problem set: 0 solved, 1140 unsolved
[2024-06-01 14:36:25] [INFO ] Deduced a trap composed of 193 places in 320 ms of which 3 ms to minimize.
[2024-06-01 14:36:26] [INFO ] Deduced a trap composed of 262 places in 310 ms of which 4 ms to minimize.
[2024-06-01 14:36:26] [INFO ] Deduced a trap composed of 278 places in 264 ms of which 3 ms to minimize.
[2024-06-01 14:36:27] [INFO ] Deduced a trap composed of 166 places in 266 ms of which 2 ms to minimize.
[2024-06-01 14:36:29] [INFO ] Deduced a trap composed of 169 places in 263 ms of which 3 ms to minimize.
[2024-06-01 14:36:37] [INFO ] Deduced a trap composed of 169 places in 269 ms of which 5 ms to minimize.
[2024-06-01 14:36:38] [INFO ] Deduced a trap composed of 208 places in 305 ms of which 4 ms to minimize.
[2024-06-01 14:36:38] [INFO ] Deduced a trap composed of 182 places in 216 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 478/1602 variables, and 78 constraints, problems are : Problem set: 0 solved, 1140 unsolved in 20019 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 36/37 constraints, State Equation: 0/480 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1140 constraints, Known Traps: 28/28 constraints]
After SMT, in 43012ms problems are : Problem set: 0 solved, 1140 unsolved
Search for dead transitions found 0 dead transitions in 43034ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43351 ms. Remains : 480/750 places, 1142/1412 transitions.
RANDOM walk for 40000 steps (15 resets) in 406 ms. (98 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (10 resets) in 293 ms. (136 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 159198 steps, run timeout after 3001 ms. (steps per millisecond=53 ) properties seen :0 out of 1
Probabilistic random walk after 159198 steps, saw 110088 distinct states, run finished after 3014 ms. (steps per millisecond=52 ) properties seen :0
[2024-06-01 14:36:42] [INFO ] Flow matrix only has 1122 transitions (discarded 20 similar events)
[2024-06-01 14:36:42] [INFO ] Invariant cache hit.
[2024-06-01 14:36:42] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 65/75 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/77 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 331/408 variables, 9/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 14:36:42] [INFO ] Deduced a trap composed of 210 places in 225 ms of which 3 ms to minimize.
[2024-06-01 14:36:42] [INFO ] Deduced a trap composed of 225 places in 215 ms of which 3 ms to minimize.
[2024-06-01 14:36:42] [INFO ] Deduced a trap composed of 210 places in 305 ms of which 2 ms to minimize.
[2024-06-01 14:36:43] [INFO ] Deduced a trap composed of 214 places in 188 ms of which 2 ms to minimize.
[2024-06-01 14:36:43] [INFO ] Deduced a trap composed of 219 places in 187 ms of which 3 ms to minimize.
[2024-06-01 14:36:43] [INFO ] Deduced a trap composed of 235 places in 190 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/408 variables, 6/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 14:36:43] [INFO ] Deduced a trap composed of 222 places in 188 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/408 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/408 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 19/427 variables, 10/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/427 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 50/477 variables, 28/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 14:36:43] [INFO ] Deduced a trap composed of 38 places in 173 ms of which 3 ms to minimize.
[2024-06-01 14:36:44] [INFO ] Deduced a trap composed of 38 places in 160 ms of which 3 ms to minimize.
[2024-06-01 14:36:44] [INFO ] Deduced a trap composed of 38 places in 116 ms of which 2 ms to minimize.
[2024-06-01 14:36:44] [INFO ] Deduced a trap composed of 39 places in 89 ms of which 1 ms to minimize.
[2024-06-01 14:36:44] [INFO ] Deduced a trap composed of 38 places in 78 ms of which 1 ms to minimize.
[2024-06-01 14:36:44] [INFO ] Deduced a trap composed of 39 places in 68 ms of which 1 ms to minimize.
[2024-06-01 14:36:44] [INFO ] Deduced a trap composed of 39 places in 53 ms of which 1 ms to minimize.
[2024-06-01 14:36:44] [INFO ] Deduced a trap composed of 38 places in 45 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/477 variables, 8/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 14:36:44] [INFO ] Deduced a trap composed of 39 places in 46 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/477 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/477 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1/478 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/478 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 1122/1600 variables, 478/545 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1600 variables, 120/665 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1600 variables, 0/665 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 2/1602 variables, 2/667 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 21 (INCLUDED_ONLY) 0/1602 variables, 1/668 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1602 variables, 0/668 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/1602 variables, 0/668 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1602/1602 variables, and 668 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3944 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 37/37 constraints, State Equation: 480/480 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 65/75 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/77 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 331/408 variables, 9/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/408 variables, 7/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/408 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 19/427 variables, 10/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/427 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 50/477 variables, 28/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/477 variables, 9/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 14:36:46] [INFO ] Deduced a trap composed of 39 places in 28 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/477 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/477 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 1/478 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/478 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 1122/1600 variables, 478/546 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1600 variables, 120/666 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1600 variables, 1/667 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1600 variables, 0/667 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 2/1602 variables, 2/669 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1602 variables, 1/670 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1602 variables, 0/670 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/1602 variables, 0/670 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1602/1602 variables, and 670 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1765 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 37/37 constraints, State Equation: 480/480 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 17/17 constraints]
After SMT, in 5723ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 95 ms.
Support contains 10 out of 480 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 480/480 places, 1142/1142 transitions.
Applied a total of 0 rules in 29 ms. Remains 480 /480 variables (removed 0) and now considering 1142/1142 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 480/480 places, 1142/1142 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 480/480 places, 1142/1142 transitions.
Applied a total of 0 rules in 29 ms. Remains 480 /480 variables (removed 0) and now considering 1142/1142 (removed 0) transitions.
[2024-06-01 14:36:47] [INFO ] Flow matrix only has 1122 transitions (discarded 20 similar events)
[2024-06-01 14:36:47] [INFO ] Invariant cache hit.
[2024-06-01 14:36:48] [INFO ] Implicit Places using invariants in 643 ms returned [3, 58, 120, 171, 248, 276, 333, 364, 372, 429]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 648 ms to find 10 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 470/480 places, 1142/1142 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 461 transition count 1133
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 461 transition count 1133
Applied a total of 18 rules in 44 ms. Remains 461 /470 variables (removed 9) and now considering 1133/1142 (removed 9) transitions.
[2024-06-01 14:36:48] [INFO ] Flow matrix only has 1113 transitions (discarded 20 similar events)
// Phase 1: matrix 1113 rows 461 cols
[2024-06-01 14:36:48] [INFO ] Computed 42 invariants in 20 ms
[2024-06-01 14:36:49] [INFO ] Implicit Places using invariants in 745 ms returned []
[2024-06-01 14:36:49] [INFO ] Flow matrix only has 1113 transitions (discarded 20 similar events)
[2024-06-01 14:36:49] [INFO ] Invariant cache hit.
[2024-06-01 14:36:49] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-06-01 14:36:59] [INFO ] Implicit Places using invariants and state equation in 10286 ms returned []
Implicit Place search using SMT with State Equation took 11033 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 461/480 places, 1133/1142 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 11754 ms. Remains : 461/480 places, 1133/1142 transitions.
RANDOM walk for 40000 steps (11 resets) in 660 ms. (60 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (11 resets) in 217 ms. (183 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 171840 steps, run timeout after 3001 ms. (steps per millisecond=57 ) properties seen :0 out of 1
Probabilistic random walk after 171840 steps, saw 108363 distinct states, run finished after 3001 ms. (steps per millisecond=57 ) properties seen :0
[2024-06-01 14:37:02] [INFO ] Flow matrix only has 1113 transitions (discarded 20 similar events)
[2024-06-01 14:37:02] [INFO ] Invariant cache hit.
[2024-06-01 14:37:02] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 69/79 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/79 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/81 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 327/408 variables, 8/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/408 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 10/418 variables, 8/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/418 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 40/458 variables, 19/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 14:37:03] [INFO ] Deduced a trap composed of 39 places in 168 ms of which 2 ms to minimize.
[2024-06-01 14:37:03] [INFO ] Deduced a trap composed of 38 places in 200 ms of which 2 ms to minimize.
[2024-06-01 14:37:03] [INFO ] Deduced a trap composed of 38 places in 123 ms of which 1 ms to minimize.
[2024-06-01 14:37:03] [INFO ] Deduced a trap composed of 38 places in 99 ms of which 1 ms to minimize.
[2024-06-01 14:37:03] [INFO ] Deduced a trap composed of 38 places in 96 ms of which 1 ms to minimize.
[2024-06-01 14:37:03] [INFO ] Deduced a trap composed of 38 places in 69 ms of which 1 ms to minimize.
[2024-06-01 14:37:03] [INFO ] Deduced a trap composed of 38 places in 55 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/458 variables, 7/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 14:37:04] [INFO ] Deduced a trap composed of 39 places in 54 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/458 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 14:37:04] [INFO ] Deduced a trap composed of 38 places in 53 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/458 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/458 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 1/459 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/459 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 1113/1572 variables, 459/509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1572 variables, 120/629 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1572 variables, 0/629 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 2/1574 variables, 2/631 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1574 variables, 1/632 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1574 variables, 0/632 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/1574 variables, 0/632 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1574/1574 variables, and 632 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2384 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 461/461 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 69/79 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/79 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/81 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 327/408 variables, 8/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 14:37:05] [INFO ] Deduced a trap composed of 214 places in 221 ms of which 3 ms to minimize.
[2024-06-01 14:37:05] [INFO ] Deduced a trap composed of 230 places in 261 ms of which 3 ms to minimize.
[2024-06-01 14:37:06] [INFO ] Deduced a trap composed of 221 places in 226 ms of which 3 ms to minimize.
[2024-06-01 14:37:06] [INFO ] Deduced a trap composed of 217 places in 223 ms of which 3 ms to minimize.
[2024-06-01 14:37:06] [INFO ] Deduced a trap composed of 227 places in 199 ms of which 2 ms to minimize.
[2024-06-01 14:37:06] [INFO ] Deduced a trap composed of 244 places in 190 ms of which 3 ms to minimize.
[2024-06-01 14:37:06] [INFO ] Deduced a trap composed of 235 places in 193 ms of which 3 ms to minimize.
[2024-06-01 14:37:07] [INFO ] Deduced a trap composed of 245 places in 184 ms of which 2 ms to minimize.
[2024-06-01 14:37:07] [INFO ] Deduced a trap composed of 245 places in 177 ms of which 2 ms to minimize.
[2024-06-01 14:37:07] [INFO ] Deduced a trap composed of 237 places in 185 ms of which 6 ms to minimize.
[2024-06-01 14:37:07] [INFO ] Deduced a trap composed of 268 places in 185 ms of which 3 ms to minimize.
[2024-06-01 14:37:07] [INFO ] Deduced a trap composed of 216 places in 187 ms of which 3 ms to minimize.
[2024-06-01 14:37:08] [INFO ] Deduced a trap composed of 226 places in 172 ms of which 2 ms to minimize.
[2024-06-01 14:37:08] [INFO ] Deduced a trap composed of 232 places in 178 ms of which 3 ms to minimize.
[2024-06-01 14:37:08] [INFO ] Deduced a trap composed of 231 places in 181 ms of which 2 ms to minimize.
[2024-06-01 14:37:08] [INFO ] Deduced a trap composed of 229 places in 183 ms of which 2 ms to minimize.
[2024-06-01 14:37:08] [INFO ] Deduced a trap composed of 240 places in 184 ms of which 2 ms to minimize.
[2024-06-01 14:37:09] [INFO ] Deduced a trap composed of 225 places in 216 ms of which 3 ms to minimize.
[2024-06-01 14:37:09] [INFO ] Deduced a trap composed of 241 places in 213 ms of which 3 ms to minimize.
[2024-06-01 14:37:09] [INFO ] Deduced a trap composed of 248 places in 200 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/408 variables, 20/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 14:37:09] [INFO ] Deduced a trap composed of 239 places in 201 ms of which 2 ms to minimize.
[2024-06-01 14:37:09] [INFO ] Deduced a trap composed of 222 places in 181 ms of which 2 ms to minimize.
[2024-06-01 14:37:10] [INFO ] Deduced a trap composed of 233 places in 178 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/408 variables, 3/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 14:37:10] [INFO ] Deduced a trap composed of 243 places in 175 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/408 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 14:37:10] [INFO ] Deduced a trap composed of 230 places in 181 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/408 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 14:37:10] [INFO ] Deduced a trap composed of 235 places in 167 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/408 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 14:37:10] [INFO ] Deduced a trap composed of 244 places in 178 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/408 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 14:37:11] [INFO ] Deduced a trap composed of 233 places in 161 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/408 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 14:37:11] [INFO ] Deduced a trap composed of 226 places in 226 ms of which 3 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/408 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/408 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 10/418 variables, 8/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/418 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 40/458 variables, 19/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/458 variables, 9/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 14:37:11] [INFO ] Deduced a trap composed of 38 places in 33 ms of which 0 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/458 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/458 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 1/459 variables, 1/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/459 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 1113/1572 variables, 459/539 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1572 variables, 120/659 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1572 variables, 1/660 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1572 variables, 0/660 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 2/1574 variables, 2/662 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1574 variables, 1/663 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/1574 variables, 0/663 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (OVERLAPS) 0/1574 variables, 0/663 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1574/1574 variables, and 663 constraints, problems are : Problem set: 0 solved, 1 unsolved in 8052 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 461/461 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 39/39 constraints]
After SMT, in 10453ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 233 ms.
Support contains 10 out of 461 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 461/461 places, 1133/1133 transitions.
Applied a total of 0 rules in 32 ms. Remains 461 /461 variables (removed 0) and now considering 1133/1133 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 461/461 places, 1133/1133 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 461/461 places, 1133/1133 transitions.
Applied a total of 0 rules in 28 ms. Remains 461 /461 variables (removed 0) and now considering 1133/1133 (removed 0) transitions.
[2024-06-01 14:37:13] [INFO ] Flow matrix only has 1113 transitions (discarded 20 similar events)
[2024-06-01 14:37:13] [INFO ] Invariant cache hit.
[2024-06-01 14:37:14] [INFO ] Implicit Places using invariants in 624 ms returned []
[2024-06-01 14:37:14] [INFO ] Flow matrix only has 1113 transitions (discarded 20 similar events)
[2024-06-01 14:37:14] [INFO ] Invariant cache hit.
[2024-06-01 14:37:14] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-06-01 14:37:24] [INFO ] Implicit Places using invariants and state equation in 9984 ms returned []
Implicit Place search using SMT with State Equation took 10612 ms to find 0 implicit places.
[2024-06-01 14:37:24] [INFO ] Redundant transitions in 67 ms returned []
Running 1131 sub problems to find dead transitions.
[2024-06-01 14:37:24] [INFO ] Flow matrix only has 1113 transitions (discarded 20 similar events)
[2024-06-01 14:37:24] [INFO ] Invariant cache hit.
[2024-06-01 14:37:24] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/459 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1131 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/459 variables, 25/40 constraints. Problems are: Problem set: 0 solved, 1131 unsolved
[2024-06-01 14:37:34] [INFO ] Deduced a trap composed of 38 places in 178 ms of which 2 ms to minimize.
[2024-06-01 14:37:34] [INFO ] Deduced a trap composed of 37 places in 146 ms of which 4 ms to minimize.
[2024-06-01 14:37:34] [INFO ] Deduced a trap composed of 38 places in 64 ms of which 1 ms to minimize.
[2024-06-01 14:37:34] [INFO ] Deduced a trap composed of 39 places in 48 ms of which 1 ms to minimize.
[2024-06-01 14:37:34] [INFO ] Deduced a trap composed of 38 places in 65 ms of which 1 ms to minimize.
[2024-06-01 14:37:34] [INFO ] Deduced a trap composed of 38 places in 56 ms of which 1 ms to minimize.
[2024-06-01 14:37:34] [INFO ] Deduced a trap composed of 38 places in 47 ms of which 0 ms to minimize.
[2024-06-01 14:37:34] [INFO ] Deduced a trap composed of 38 places in 42 ms of which 1 ms to minimize.
[2024-06-01 14:37:35] [INFO ] Deduced a trap composed of 38 places in 41 ms of which 0 ms to minimize.
[2024-06-01 14:37:35] [INFO ] Deduced a trap composed of 38 places in 42 ms of which 1 ms to minimize.
[2024-06-01 14:37:35] [INFO ] Deduced a trap composed of 38 places in 44 ms of which 0 ms to minimize.
[2024-06-01 14:37:35] [INFO ] Deduced a trap composed of 23 places in 134 ms of which 2 ms to minimize.
[2024-06-01 14:37:35] [INFO ] Deduced a trap composed of 97 places in 278 ms of which 3 ms to minimize.
[2024-06-01 14:37:36] [INFO ] Deduced a trap composed of 96 places in 254 ms of which 3 ms to minimize.
[2024-06-01 14:37:40] [INFO ] Deduced a trap composed of 271 places in 253 ms of which 3 ms to minimize.
[2024-06-01 14:37:40] [INFO ] Deduced a trap composed of 270 places in 287 ms of which 3 ms to minimize.
[2024-06-01 14:37:42] [INFO ] Deduced a trap composed of 3 places in 183 ms of which 3 ms to minimize.
[2024-06-01 14:37:42] [INFO ] Deduced a trap composed of 181 places in 187 ms of which 3 ms to minimize.
[2024-06-01 14:37:42] [INFO ] Deduced a trap composed of 168 places in 184 ms of which 2 ms to minimize.
[2024-06-01 14:37:43] [INFO ] Deduced a trap composed of 160 places in 261 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/459 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 1131 unsolved
[2024-06-01 14:37:44] [INFO ] Deduced a trap composed of 184 places in 240 ms of which 3 ms to minimize.
[2024-06-01 14:37:44] [INFO ] Deduced a trap composed of 182 places in 231 ms of which 3 ms to minimize.
[2024-06-01 14:37:48] [INFO ] Deduced a trap composed of 198 places in 281 ms of which 3 ms to minimize.
[2024-06-01 14:37:50] [INFO ] Deduced a trap composed of 245 places in 264 ms of which 4 ms to minimize.
[2024-06-01 14:37:50] [INFO ] Deduced a trap composed of 204 places in 237 ms of which 3 ms to minimize.
[2024-06-01 14:37:51] [INFO ] Deduced a trap composed of 179 places in 250 ms of which 3 ms to minimize.
[2024-06-01 14:37:52] [INFO ] Deduced a trap composed of 172 places in 240 ms of which 2 ms to minimize.
[2024-06-01 14:37:52] [INFO ] Deduced a trap composed of 188 places in 217 ms of which 2 ms to minimize.
[2024-06-01 14:37:52] [INFO ] Deduced a trap composed of 190 places in 233 ms of which 3 ms to minimize.
[2024-06-01 14:37:53] [INFO ] Deduced a trap composed of 206 places in 270 ms of which 3 ms to minimize.
[2024-06-01 14:37:53] [INFO ] Deduced a trap composed of 185 places in 252 ms of which 4 ms to minimize.
[2024-06-01 14:37:54] [INFO ] Deduced a trap composed of 202 places in 235 ms of which 3 ms to minimize.
[2024-06-01 14:37:54] [INFO ] Deduced a trap composed of 172 places in 217 ms of which 3 ms to minimize.
[2024-06-01 14:37:54] [INFO ] Deduced a trap composed of 181 places in 217 ms of which 3 ms to minimize.
[2024-06-01 14:37:54] [INFO ] Deduced a trap composed of 173 places in 217 ms of which 3 ms to minimize.
[2024-06-01 14:37:56] [INFO ] Deduced a trap composed of 153 places in 264 ms of which 4 ms to minimize.
[2024-06-01 14:37:56] [INFO ] Deduced a trap composed of 275 places in 241 ms of which 3 ms to minimize.
[2024-06-01 14:37:56] [INFO ] Deduced a trap composed of 196 places in 201 ms of which 3 ms to minimize.
SMT process timed out in 32507ms, After SMT, problems are : Problem set: 0 solved, 1131 unsolved
Search for dead transitions found 0 dead transitions in 32519ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43247 ms. Remains : 461/461 places, 1133/1133 transitions.
Successfully simplified 21 atomic propositions for a total of 16 simplifications.
FORMULA PolyORBLF-PT-S02J04T10-CTLFireability-2024-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S02J04T10-CTLFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 14:37:57] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-06-01 14:37:57] [INFO ] Flatten gal took : 180 ms
FORMULA PolyORBLF-PT-S02J04T10-CTLFireability-2024-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 14:37:57] [INFO ] Flatten gal took : 111 ms
[2024-06-01 14:37:57] [INFO ] Input system was already deterministic with 1412 transitions.
Support contains 525 out of 750 places (down from 575) after GAL structural reductions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 750/750 places, 1412/1412 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 60 transitions
Trivial Post-agglo rules discarded 60 transitions
Performed 60 trivial Post agglomeration. Transition count delta: 60
Iterating post reduction 0 with 60 rules applied. Total rules applied 60 place count 750 transition count 1352
Reduce places removed 60 places and 0 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Iterating post reduction 1 with 70 rules applied. Total rules applied 130 place count 690 transition count 1342
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 140 place count 680 transition count 1342
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 60 Pre rules applied. Total rules applied 140 place count 680 transition count 1282
Deduced a syphon composed of 60 places in 1 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 3 with 120 rules applied. Total rules applied 260 place count 620 transition count 1282
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 3 with 140 rules applied. Total rules applied 400 place count 550 transition count 1212
Applied a total of 400 rules in 99 ms. Remains 550 /750 variables (removed 200) and now considering 1212/1412 (removed 200) transitions.
Running 1210 sub problems to find dead transitions.
[2024-06-01 14:37:57] [INFO ] Flow matrix only has 1192 transitions (discarded 20 similar events)
// Phase 1: matrix 1192 rows 550 cols
[2024-06-01 14:37:57] [INFO ] Computed 52 invariants in 30 ms
[2024-06-01 14:37:57] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/548 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1210 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/548 variables, 37/50 constraints. Problems are: Problem set: 0 solved, 1210 unsolved
[2024-06-01 14:38:08] [INFO ] Deduced a trap composed of 45 places in 71 ms of which 1 ms to minimize.
[2024-06-01 14:38:08] [INFO ] Deduced a trap composed of 45 places in 44 ms of which 0 ms to minimize.
[2024-06-01 14:38:08] [INFO ] Deduced a trap composed of 46 places in 40 ms of which 0 ms to minimize.
[2024-06-01 14:38:08] [INFO ] Deduced a trap composed of 45 places in 48 ms of which 1 ms to minimize.
[2024-06-01 14:38:08] [INFO ] Deduced a trap composed of 45 places in 31 ms of which 0 ms to minimize.
[2024-06-01 14:38:08] [INFO ] Deduced a trap composed of 46 places in 31 ms of which 1 ms to minimize.
[2024-06-01 14:38:08] [INFO ] Deduced a trap composed of 45 places in 31 ms of which 1 ms to minimize.
[2024-06-01 14:38:08] [INFO ] Deduced a trap composed of 45 places in 39 ms of which 0 ms to minimize.
[2024-06-01 14:38:08] [INFO ] Deduced a trap composed of 46 places in 39 ms of which 0 ms to minimize.
[2024-06-01 14:38:09] [INFO ] Deduced a trap composed of 240 places in 290 ms of which 4 ms to minimize.
[2024-06-01 14:38:09] [INFO ] Deduced a trap composed of 254 places in 200 ms of which 3 ms to minimize.
[2024-06-01 14:38:09] [INFO ] Deduced a trap composed of 267 places in 303 ms of which 4 ms to minimize.
[2024-06-01 14:38:09] [INFO ] Deduced a trap composed of 231 places in 273 ms of which 3 ms to minimize.
[2024-06-01 14:38:10] [INFO ] Deduced a trap composed of 45 places in 50 ms of which 1 ms to minimize.
[2024-06-01 14:38:10] [INFO ] Deduced a trap composed of 41 places in 185 ms of which 3 ms to minimize.
[2024-06-01 14:38:11] [INFO ] Deduced a trap composed of 122 places in 334 ms of which 4 ms to minimize.
[2024-06-01 14:38:12] [INFO ] Deduced a trap composed of 94 places in 204 ms of which 3 ms to minimize.
[2024-06-01 14:38:14] [INFO ] Deduced a trap composed of 42 places in 168 ms of which 2 ms to minimize.
[2024-06-01 14:38:16] [INFO ] Deduced a trap composed of 380 places in 227 ms of which 3 ms to minimize.
[2024-06-01 14:38:17] [INFO ] Deduced a trap composed of 328 places in 221 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/548 variables, 20/70 constraints. Problems are: Problem set: 0 solved, 1210 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 548/1742 variables, and 70 constraints, problems are : Problem set: 0 solved, 1210 unsolved in 20027 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 37/39 constraints, State Equation: 0/550 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1210/1210 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1210 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/548 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1210 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/548 variables, 37/50 constraints. Problems are: Problem set: 0 solved, 1210 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/548 variables, 20/70 constraints. Problems are: Problem set: 0 solved, 1210 unsolved
[2024-06-01 14:38:27] [INFO ] Deduced a trap composed of 328 places in 317 ms of which 4 ms to minimize.
[2024-06-01 14:38:28] [INFO ] Deduced a trap composed of 322 places in 242 ms of which 3 ms to minimize.
[2024-06-01 14:38:31] [INFO ] Deduced a trap composed of 36 places in 154 ms of which 2 ms to minimize.
[2024-06-01 14:38:32] [INFO ] Deduced a trap composed of 366 places in 291 ms of which 4 ms to minimize.
[2024-06-01 14:38:32] [INFO ] Deduced a trap composed of 326 places in 232 ms of which 3 ms to minimize.
[2024-06-01 14:38:33] [INFO ] Deduced a trap composed of 316 places in 232 ms of which 3 ms to minimize.
[2024-06-01 14:38:34] [INFO ] Deduced a trap composed of 322 places in 276 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 548/1742 variables, and 77 constraints, problems are : Problem set: 0 solved, 1210 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 37/39 constraints, State Equation: 0/550 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1210 constraints, Known Traps: 27/27 constraints]
After SMT, in 42070ms problems are : Problem set: 0 solved, 1210 unsolved
Search for dead transitions found 0 dead transitions in 42081ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 42183 ms. Remains : 550/750 places, 1212/1412 transitions.
[2024-06-01 14:38:39] [INFO ] Flatten gal took : 41 ms
[2024-06-01 14:38:39] [INFO ] Flatten gal took : 41 ms
[2024-06-01 14:38:39] [INFO ] Input system was already deterministic with 1212 transitions.
Starting structural reductions in LTL mode, iteration 0 : 750/750 places, 1412/1412 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 740 transition count 1402
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 740 transition count 1402
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 30 place count 730 transition count 1392
Iterating global reduction 0 with 10 rules applied. Total rules applied 40 place count 730 transition count 1392
Applied a total of 40 rules in 40 ms. Remains 730 /750 variables (removed 20) and now considering 1392/1412 (removed 20) transitions.
Running 1390 sub problems to find dead transitions.
[2024-06-01 14:38:39] [INFO ] Flow matrix only has 1372 transitions (discarded 20 similar events)
// Phase 1: matrix 1372 rows 730 cols
[2024-06-01 14:38:39] [INFO ] Computed 52 invariants in 15 ms
[2024-06-01 14:38:39] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/728 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/728 variables, 37/50 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
[2024-06-01 14:38:54] [INFO ] Deduced a trap composed of 64 places in 96 ms of which 2 ms to minimize.
[2024-06-01 14:38:54] [INFO ] Deduced a trap composed of 63 places in 75 ms of which 1 ms to minimize.
[2024-06-01 14:38:54] [INFO ] Deduced a trap composed of 63 places in 57 ms of which 1 ms to minimize.
[2024-06-01 14:38:54] [INFO ] Deduced a trap composed of 64 places in 46 ms of which 1 ms to minimize.
[2024-06-01 14:38:54] [INFO ] Deduced a trap composed of 63 places in 60 ms of which 1 ms to minimize.
[2024-06-01 14:38:54] [INFO ] Deduced a trap composed of 64 places in 59 ms of which 0 ms to minimize.
[2024-06-01 14:38:55] [INFO ] Deduced a trap composed of 64 places in 61 ms of which 0 ms to minimize.
[2024-06-01 14:38:55] [INFO ] Deduced a trap composed of 63 places in 57 ms of which 1 ms to minimize.
[2024-06-01 14:38:55] [INFO ] Deduced a trap composed of 63 places in 98 ms of which 2 ms to minimize.
[2024-06-01 14:38:55] [INFO ] Deduced a trap composed of 65 places in 51 ms of which 1 ms to minimize.
[2024-06-01 14:38:55] [INFO ] Deduced a trap composed of 387 places in 430 ms of which 6 ms to minimize.
[2024-06-01 14:38:56] [INFO ] Deduced a trap composed of 388 places in 383 ms of which 5 ms to minimize.
[2024-06-01 14:38:56] [INFO ] Deduced a trap composed of 380 places in 318 ms of which 3 ms to minimize.
[2024-06-01 14:38:57] [INFO ] Deduced a trap composed of 369 places in 394 ms of which 6 ms to minimize.
[2024-06-01 14:38:58] [INFO ] Deduced a trap composed of 496 places in 388 ms of which 6 ms to minimize.
[2024-06-01 14:38:58] [INFO ] Deduced a trap composed of 517 places in 320 ms of which 4 ms to minimize.
[2024-06-01 14:38:59] [INFO ] Deduced a trap composed of 494 places in 509 ms of which 5 ms to minimize.
[2024-06-01 14:38:59] [INFO ] Deduced a trap composed of 527 places in 365 ms of which 4 ms to minimize.
[2024-06-01 14:38:59] [INFO ] Deduced a trap composed of 504 places in 336 ms of which 4 ms to minimize.
[2024-06-01 14:39:00] [INFO ] Deduced a trap composed of 494 places in 284 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/728 variables, 20/70 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 728/2102 variables, and 70 constraints, problems are : Problem set: 0 solved, 1390 unsolved in 20019 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 37/39 constraints, State Equation: 0/730 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1390/1390 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1390 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/728 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/728 variables, 37/50 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/728 variables, 20/70 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 728/2102 variables, and 70 constraints, problems are : Problem set: 0 solved, 1390 unsolved in 20049 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 37/39 constraints, State Equation: 0/730 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1390 constraints, Known Traps: 20/20 constraints]
After SMT, in 41868ms problems are : Problem set: 0 solved, 1390 unsolved
Search for dead transitions found 0 dead transitions in 41897ms
Finished structural reductions in LTL mode , in 1 iterations and 41945 ms. Remains : 730/750 places, 1392/1412 transitions.
[2024-06-01 14:39:21] [INFO ] Flatten gal took : 64 ms
[2024-06-01 14:39:21] [INFO ] Flatten gal took : 64 ms
[2024-06-01 14:39:22] [INFO ] Input system was already deterministic with 1392 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 750/750 places, 1412/1412 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 90 transitions
Trivial Post-agglo rules discarded 90 transitions
Performed 90 trivial Post agglomeration. Transition count delta: 90
Iterating post reduction 0 with 90 rules applied. Total rules applied 90 place count 750 transition count 1322
Reduce places removed 90 places and 0 transitions.
Iterating post reduction 1 with 90 rules applied. Total rules applied 180 place count 660 transition count 1322
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 60 Pre rules applied. Total rules applied 180 place count 660 transition count 1262
Deduced a syphon composed of 60 places in 1 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 2 with 120 rules applied. Total rules applied 300 place count 600 transition count 1262
Performed 80 Post agglomeration using F-continuation condition.Transition count delta: 80
Deduced a syphon composed of 80 places in 1 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 2 with 160 rules applied. Total rules applied 460 place count 520 transition count 1182
Applied a total of 460 rules in 80 ms. Remains 520 /750 variables (removed 230) and now considering 1182/1412 (removed 230) transitions.
Running 1180 sub problems to find dead transitions.
[2024-06-01 14:39:22] [INFO ] Flow matrix only has 1162 transitions (discarded 20 similar events)
// Phase 1: matrix 1162 rows 520 cols
[2024-06-01 14:39:22] [INFO ] Computed 52 invariants in 19 ms
[2024-06-01 14:39:22] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/518 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1180 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/518 variables, 37/50 constraints. Problems are: Problem set: 0 solved, 1180 unsolved
[2024-06-01 14:39:33] [INFO ] Deduced a trap composed of 43 places in 58 ms of which 2 ms to minimize.
[2024-06-01 14:39:33] [INFO ] Deduced a trap composed of 42 places in 69 ms of which 1 ms to minimize.
[2024-06-01 14:39:33] [INFO ] Deduced a trap composed of 42 places in 69 ms of which 1 ms to minimize.
[2024-06-01 14:39:33] [INFO ] Deduced a trap composed of 42 places in 53 ms of which 0 ms to minimize.
[2024-06-01 14:39:33] [INFO ] Deduced a trap composed of 42 places in 41 ms of which 1 ms to minimize.
[2024-06-01 14:39:33] [INFO ] Deduced a trap composed of 42 places in 33 ms of which 2 ms to minimize.
[2024-06-01 14:39:33] [INFO ] Deduced a trap composed of 42 places in 38 ms of which 1 ms to minimize.
[2024-06-01 14:39:33] [INFO ] Deduced a trap composed of 42 places in 42 ms of which 0 ms to minimize.
[2024-06-01 14:39:33] [INFO ] Deduced a trap composed of 42 places in 30 ms of which 0 ms to minimize.
[2024-06-01 14:39:33] [INFO ] Deduced a trap composed of 42 places in 33 ms of which 0 ms to minimize.
[2024-06-01 14:39:34] [INFO ] Deduced a trap composed of 93 places in 211 ms of which 3 ms to minimize.
[2024-06-01 14:39:34] [INFO ] Deduced a trap composed of 108 places in 118 ms of which 2 ms to minimize.
[2024-06-01 14:39:35] [INFO ] Deduced a trap composed of 212 places in 186 ms of which 3 ms to minimize.
[2024-06-01 14:39:35] [INFO ] Deduced a trap composed of 108 places in 130 ms of which 2 ms to minimize.
[2024-06-01 14:39:37] [INFO ] Deduced a trap composed of 290 places in 365 ms of which 5 ms to minimize.
[2024-06-01 14:39:38] [INFO ] Deduced a trap composed of 39 places in 168 ms of which 3 ms to minimize.
[2024-06-01 14:39:39] [INFO ] Deduced a trap composed of 74 places in 146 ms of which 2 ms to minimize.
[2024-06-01 14:39:39] [INFO ] Deduced a trap composed of 223 places in 259 ms of which 3 ms to minimize.
[2024-06-01 14:39:39] [INFO ] Deduced a trap composed of 37 places in 209 ms of which 3 ms to minimize.
[2024-06-01 14:39:39] [INFO ] Deduced a trap composed of 232 places in 190 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/518 variables, 20/70 constraints. Problems are: Problem set: 0 solved, 1180 unsolved
[2024-06-01 14:39:44] [INFO ] Deduced a trap composed of 42 places in 131 ms of which 2 ms to minimize.
[2024-06-01 14:39:44] [INFO ] Deduced a trap composed of 99 places in 161 ms of which 1 ms to minimize.
SMT process timed out in 22330ms, After SMT, problems are : Problem set: 0 solved, 1180 unsolved
Search for dead transitions found 0 dead transitions in 22348ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 22432 ms. Remains : 520/750 places, 1182/1412 transitions.
[2024-06-01 14:39:44] [INFO ] Flatten gal took : 36 ms
[2024-06-01 14:39:44] [INFO ] Flatten gal took : 35 ms
[2024-06-01 14:39:44] [INFO ] Input system was already deterministic with 1182 transitions.
RANDOM walk for 414 steps (0 resets) in 8 ms. (46 steps per ms) remains 0/1 properties
FORMULA PolyORBLF-PT-S02J04T10-CTLFireability-2024-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in SI_CTL mode, iteration 0 : 750/750 places, 1412/1412 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 30 place count 750 transition count 1382
Reduce places removed 30 places and 0 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Iterating post reduction 1 with 40 rules applied. Total rules applied 70 place count 720 transition count 1372
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 80 place count 710 transition count 1372
Performed 80 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 80 Pre rules applied. Total rules applied 80 place count 710 transition count 1292
Deduced a syphon composed of 80 places in 13 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 3 with 160 rules applied. Total rules applied 240 place count 630 transition count 1292
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 40 rules applied. Total rules applied 280 place count 610 transition count 1272
Applied a total of 280 rules in 115 ms. Remains 610 /750 variables (removed 140) and now considering 1272/1412 (removed 140) transitions.
Running 1270 sub problems to find dead transitions.
[2024-06-01 14:39:44] [INFO ] Flow matrix only has 1252 transitions (discarded 20 similar events)
// Phase 1: matrix 1252 rows 610 cols
[2024-06-01 14:39:44] [INFO ] Computed 52 invariants in 26 ms
[2024-06-01 14:39:44] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/608 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1270 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/608 variables, 38/50 constraints. Problems are: Problem set: 0 solved, 1270 unsolved
[2024-06-01 14:39:56] [INFO ] Deduced a trap composed of 52 places in 96 ms of which 3 ms to minimize.
[2024-06-01 14:39:56] [INFO ] Deduced a trap composed of 51 places in 98 ms of which 2 ms to minimize.
[2024-06-01 14:39:56] [INFO ] Deduced a trap composed of 51 places in 70 ms of which 1 ms to minimize.
[2024-06-01 14:39:56] [INFO ] Deduced a trap composed of 51 places in 58 ms of which 1 ms to minimize.
[2024-06-01 14:39:56] [INFO ] Deduced a trap composed of 51 places in 36 ms of which 1 ms to minimize.
[2024-06-01 14:39:56] [INFO ] Deduced a trap composed of 52 places in 50 ms of which 1 ms to minimize.
[2024-06-01 14:39:56] [INFO ] Deduced a trap composed of 51 places in 44 ms of which 2 ms to minimize.
[2024-06-01 14:39:56] [INFO ] Deduced a trap composed of 52 places in 58 ms of which 4 ms to minimize.
[2024-06-01 14:39:57] [INFO ] Deduced a trap composed of 406 places in 261 ms of which 3 ms to minimize.
[2024-06-01 14:39:57] [INFO ] Deduced a trap composed of 51 places in 51 ms of which 0 ms to minimize.
[2024-06-01 14:39:57] [INFO ] Deduced a trap composed of 52 places in 56 ms of which 2 ms to minimize.
[2024-06-01 14:39:57] [INFO ] Deduced a trap composed of 382 places in 244 ms of which 4 ms to minimize.
[2024-06-01 14:39:58] [INFO ] Deduced a trap composed of 257 places in 273 ms of which 3 ms to minimize.
[2024-06-01 14:39:58] [INFO ] Deduced a trap composed of 238 places in 240 ms of which 3 ms to minimize.
[2024-06-01 14:39:59] [INFO ] Deduced a trap composed of 74 places in 163 ms of which 2 ms to minimize.
[2024-06-01 14:39:59] [INFO ] Deduced a trap composed of 158 places in 249 ms of which 4 ms to minimize.
[2024-06-01 14:39:59] [INFO ] Deduced a trap composed of 272 places in 256 ms of which 3 ms to minimize.
[2024-06-01 14:40:00] [INFO ] Deduced a trap composed of 276 places in 277 ms of which 3 ms to minimize.
[2024-06-01 14:40:01] [INFO ] Deduced a trap composed of 251 places in 279 ms of which 3 ms to minimize.
[2024-06-01 14:40:01] [INFO ] Deduced a trap composed of 269 places in 259 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/608 variables, 20/70 constraints. Problems are: Problem set: 0 solved, 1270 unsolved
[2024-06-01 14:40:04] [INFO ] Deduced a trap composed of 48 places in 216 ms of which 2 ms to minimize.
[2024-06-01 14:40:04] [INFO ] Deduced a trap composed of 72 places in 198 ms of which 3 ms to minimize.
[2024-06-01 14:40:04] [INFO ] Deduced a trap composed of 276 places in 266 ms of which 4 ms to minimize.
[2024-06-01 14:40:05] [INFO ] Deduced a trap composed of 250 places in 283 ms of which 4 ms to minimize.
[2024-06-01 14:40:05] [INFO ] Deduced a trap composed of 313 places in 283 ms of which 4 ms to minimize.
[2024-06-01 14:40:06] [INFO ] Deduced a trap composed of 372 places in 256 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 608/1862 variables, and 76 constraints, problems are : Problem set: 0 solved, 1270 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 38/40 constraints, State Equation: 0/610 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1270/1270 constraints, Known Traps: 26/26 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1270 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/608 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1270 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/608 variables, 38/50 constraints. Problems are: Problem set: 0 solved, 1270 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/608 variables, 26/76 constraints. Problems are: Problem set: 0 solved, 1270 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 608/1862 variables, and 76 constraints, problems are : Problem set: 0 solved, 1270 unsolved in 20034 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 38/40 constraints, State Equation: 0/610 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1270 constraints, Known Traps: 26/26 constraints]
After SMT, in 42199ms problems are : Problem set: 0 solved, 1270 unsolved
Search for dead transitions found 0 dead transitions in 42219ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 42337 ms. Remains : 610/750 places, 1272/1412 transitions.
[2024-06-01 14:40:27] [INFO ] Flatten gal took : 49 ms
[2024-06-01 14:40:27] [INFO ] Flatten gal took : 37 ms
[2024-06-01 14:40:27] [INFO ] Input system was already deterministic with 1272 transitions.
Starting structural reductions in LTL mode, iteration 0 : 750/750 places, 1412/1412 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 740 transition count 1402
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 740 transition count 1402
Applied a total of 20 rules in 38 ms. Remains 740 /750 variables (removed 10) and now considering 1402/1412 (removed 10) transitions.
Running 1400 sub problems to find dead transitions.
[2024-06-01 14:40:27] [INFO ] Flow matrix only has 1382 transitions (discarded 20 similar events)
// Phase 1: matrix 1382 rows 740 cols
[2024-06-01 14:40:27] [INFO ] Computed 52 invariants in 19 ms
[2024-06-01 14:40:27] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/738 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1400 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/738 variables, 36/50 constraints. Problems are: Problem set: 0 solved, 1400 unsolved
[2024-06-01 14:40:42] [INFO ] Deduced a trap composed of 64 places in 81 ms of which 2 ms to minimize.
[2024-06-01 14:40:42] [INFO ] Deduced a trap composed of 65 places in 67 ms of which 1 ms to minimize.
[2024-06-01 14:40:42] [INFO ] Deduced a trap composed of 65 places in 62 ms of which 1 ms to minimize.
[2024-06-01 14:40:42] [INFO ] Deduced a trap composed of 64 places in 65 ms of which 2 ms to minimize.
[2024-06-01 14:40:42] [INFO ] Deduced a trap composed of 64 places in 74 ms of which 1 ms to minimize.
[2024-06-01 14:40:42] [INFO ] Deduced a trap composed of 64 places in 57 ms of which 0 ms to minimize.
[2024-06-01 14:40:42] [INFO ] Deduced a trap composed of 66 places in 57 ms of which 0 ms to minimize.
[2024-06-01 14:40:42] [INFO ] Deduced a trap composed of 65 places in 55 ms of which 1 ms to minimize.
[2024-06-01 14:40:43] [INFO ] Deduced a trap composed of 66 places in 55 ms of which 1 ms to minimize.
[2024-06-01 14:40:43] [INFO ] Deduced a trap composed of 65 places in 60 ms of which 1 ms to minimize.
[2024-06-01 14:40:43] [INFO ] Deduced a trap composed of 388 places in 358 ms of which 4 ms to minimize.
[2024-06-01 14:40:44] [INFO ] Deduced a trap composed of 214 places in 367 ms of which 5 ms to minimize.
[2024-06-01 14:40:45] [INFO ] Deduced a trap composed of 214 places in 401 ms of which 5 ms to minimize.
[2024-06-01 14:40:45] [INFO ] Deduced a trap composed of 228 places in 329 ms of which 5 ms to minimize.
[2024-06-01 14:40:45] [INFO ] Deduced a trap composed of 235 places in 281 ms of which 4 ms to minimize.
[2024-06-01 14:40:46] [INFO ] Deduced a trap composed of 240 places in 323 ms of which 4 ms to minimize.
[2024-06-01 14:40:46] [INFO ] Deduced a trap composed of 255 places in 295 ms of which 4 ms to minimize.
[2024-06-01 14:40:46] [INFO ] Deduced a trap composed of 227 places in 270 ms of which 3 ms to minimize.
[2024-06-01 14:40:47] [INFO ] Deduced a trap composed of 23 places in 150 ms of which 2 ms to minimize.
[2024-06-01 14:40:48] [INFO ] Deduced a trap composed of 404 places in 274 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/738 variables, 20/70 constraints. Problems are: Problem set: 0 solved, 1400 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 738/2122 variables, and 70 constraints, problems are : Problem set: 0 solved, 1400 unsolved in 20046 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 36/38 constraints, State Equation: 0/740 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1400/1400 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1400 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/738 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1400 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/738 variables, 36/50 constraints. Problems are: Problem set: 0 solved, 1400 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/738 variables, 20/70 constraints. Problems are: Problem set: 0 solved, 1400 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 738/2122 variables, and 70 constraints, problems are : Problem set: 0 solved, 1400 unsolved in 20026 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 36/38 constraints, State Equation: 0/740 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1400 constraints, Known Traps: 20/20 constraints]
After SMT, in 41822ms problems are : Problem set: 0 solved, 1400 unsolved
Search for dead transitions found 0 dead transitions in 41839ms
Finished structural reductions in LTL mode , in 1 iterations and 41881 ms. Remains : 740/750 places, 1402/1412 transitions.
[2024-06-01 14:41:09] [INFO ] Flatten gal took : 37 ms
[2024-06-01 14:41:09] [INFO ] Flatten gal took : 41 ms
[2024-06-01 14:41:09] [INFO ] Input system was already deterministic with 1402 transitions.
Starting structural reductions in LTL mode, iteration 0 : 750/750 places, 1412/1412 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 740 transition count 1402
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 740 transition count 1402
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 30 place count 730 transition count 1392
Iterating global reduction 0 with 10 rules applied. Total rules applied 40 place count 730 transition count 1392
Applied a total of 40 rules in 24 ms. Remains 730 /750 variables (removed 20) and now considering 1392/1412 (removed 20) transitions.
Running 1390 sub problems to find dead transitions.
[2024-06-01 14:41:09] [INFO ] Flow matrix only has 1372 transitions (discarded 20 similar events)
// Phase 1: matrix 1372 rows 730 cols
[2024-06-01 14:41:09] [INFO ] Computed 52 invariants in 39 ms
[2024-06-01 14:41:09] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/728 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/728 variables, 37/50 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
[2024-06-01 14:41:24] [INFO ] Deduced a trap composed of 64 places in 94 ms of which 2 ms to minimize.
[2024-06-01 14:41:24] [INFO ] Deduced a trap composed of 63 places in 73 ms of which 1 ms to minimize.
[2024-06-01 14:41:24] [INFO ] Deduced a trap composed of 63 places in 43 ms of which 1 ms to minimize.
[2024-06-01 14:41:24] [INFO ] Deduced a trap composed of 64 places in 63 ms of which 2 ms to minimize.
[2024-06-01 14:41:24] [INFO ] Deduced a trap composed of 63 places in 54 ms of which 1 ms to minimize.
[2024-06-01 14:41:25] [INFO ] Deduced a trap composed of 64 places in 61 ms of which 1 ms to minimize.
[2024-06-01 14:41:25] [INFO ] Deduced a trap composed of 64 places in 67 ms of which 1 ms to minimize.
[2024-06-01 14:41:25] [INFO ] Deduced a trap composed of 63 places in 62 ms of which 1 ms to minimize.
[2024-06-01 14:41:25] [INFO ] Deduced a trap composed of 63 places in 95 ms of which 2 ms to minimize.
[2024-06-01 14:41:25] [INFO ] Deduced a trap composed of 65 places in 54 ms of which 0 ms to minimize.
[2024-06-01 14:41:26] [INFO ] Deduced a trap composed of 387 places in 412 ms of which 6 ms to minimize.
[2024-06-01 14:41:26] [INFO ] Deduced a trap composed of 388 places in 413 ms of which 6 ms to minimize.
[2024-06-01 14:41:26] [INFO ] Deduced a trap composed of 380 places in 404 ms of which 5 ms to minimize.
[2024-06-01 14:41:27] [INFO ] Deduced a trap composed of 369 places in 420 ms of which 6 ms to minimize.
[2024-06-01 14:41:28] [INFO ] Deduced a trap composed of 496 places in 442 ms of which 5 ms to minimize.
[2024-06-01 14:41:28] [INFO ] Deduced a trap composed of 517 places in 379 ms of which 4 ms to minimize.
[2024-06-01 14:41:29] [INFO ] Deduced a trap composed of 494 places in 439 ms of which 5 ms to minimize.
[2024-06-01 14:41:29] [INFO ] Deduced a trap composed of 527 places in 407 ms of which 5 ms to minimize.
[2024-06-01 14:41:30] [INFO ] Deduced a trap composed of 504 places in 331 ms of which 4 ms to minimize.
[2024-06-01 14:41:30] [INFO ] Deduced a trap composed of 494 places in 335 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/728 variables, 20/70 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 728/2102 variables, and 70 constraints, problems are : Problem set: 0 solved, 1390 unsolved in 20045 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 37/39 constraints, State Equation: 0/730 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1390/1390 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1390 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/728 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/728 variables, 37/50 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/728 variables, 20/70 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 728/2102 variables, and 70 constraints, problems are : Problem set: 0 solved, 1390 unsolved in 20044 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 37/39 constraints, State Equation: 0/730 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1390 constraints, Known Traps: 20/20 constraints]
After SMT, in 42453ms problems are : Problem set: 0 solved, 1390 unsolved
Search for dead transitions found 0 dead transitions in 42471ms
Finished structural reductions in LTL mode , in 1 iterations and 42499 ms. Remains : 730/750 places, 1392/1412 transitions.
[2024-06-01 14:41:52] [INFO ] Flatten gal took : 62 ms
[2024-06-01 14:41:52] [INFO ] Flatten gal took : 92 ms
[2024-06-01 14:41:52] [INFO ] Input system was already deterministic with 1392 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 750/750 places, 1412/1412 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 90 transitions
Trivial Post-agglo rules discarded 90 transitions
Performed 90 trivial Post agglomeration. Transition count delta: 90
Iterating post reduction 0 with 90 rules applied. Total rules applied 90 place count 750 transition count 1322
Reduce places removed 90 places and 0 transitions.
Iterating post reduction 1 with 90 rules applied. Total rules applied 180 place count 660 transition count 1322
Performed 79 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 79 Pre rules applied. Total rules applied 180 place count 660 transition count 1243
Deduced a syphon composed of 79 places in 1 ms
Reduce places removed 79 places and 0 transitions.
Iterating global reduction 2 with 158 rules applied. Total rules applied 338 place count 581 transition count 1243
Performed 80 Post agglomeration using F-continuation condition.Transition count delta: 80
Deduced a syphon composed of 80 places in 2 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 2 with 160 rules applied. Total rules applied 498 place count 501 transition count 1163
Applied a total of 498 rules in 62 ms. Remains 501 /750 variables (removed 249) and now considering 1163/1412 (removed 249) transitions.
Running 1161 sub problems to find dead transitions.
[2024-06-01 14:41:52] [INFO ] Flow matrix only has 1143 transitions (discarded 20 similar events)
// Phase 1: matrix 1143 rows 501 cols
[2024-06-01 14:41:52] [INFO ] Computed 52 invariants in 34 ms
[2024-06-01 14:41:52] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/499 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1161 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/499 variables, 37/50 constraints. Problems are: Problem set: 0 solved, 1161 unsolved
[2024-06-01 14:42:02] [INFO ] Deduced a trap composed of 41 places in 49 ms of which 1 ms to minimize.
[2024-06-01 14:42:02] [INFO ] Deduced a trap composed of 40 places in 44 ms of which 1 ms to minimize.
[2024-06-01 14:42:02] [INFO ] Deduced a trap composed of 41 places in 41 ms of which 1 ms to minimize.
[2024-06-01 14:42:02] [INFO ] Deduced a trap composed of 41 places in 43 ms of which 1 ms to minimize.
[2024-06-01 14:42:02] [INFO ] Deduced a trap composed of 40 places in 40 ms of which 1 ms to minimize.
[2024-06-01 14:42:02] [INFO ] Deduced a trap composed of 41 places in 39 ms of which 0 ms to minimize.
[2024-06-01 14:42:02] [INFO ] Deduced a trap composed of 40 places in 39 ms of which 0 ms to minimize.
[2024-06-01 14:42:02] [INFO ] Deduced a trap composed of 87 places in 240 ms of which 4 ms to minimize.
[2024-06-01 14:42:02] [INFO ] Deduced a trap composed of 41 places in 47 ms of which 1 ms to minimize.
[2024-06-01 14:42:03] [INFO ] Deduced a trap composed of 40 places in 45 ms of which 1 ms to minimize.
[2024-06-01 14:42:03] [INFO ] Deduced a trap composed of 42 places in 37 ms of which 0 ms to minimize.
[2024-06-01 14:42:03] [INFO ] Deduced a trap composed of 211 places in 285 ms of which 4 ms to minimize.
[2024-06-01 14:42:03] [INFO ] Deduced a trap composed of 185 places in 311 ms of which 4 ms to minimize.
[2024-06-01 14:42:04] [INFO ] Deduced a trap composed of 67 places in 139 ms of which 2 ms to minimize.
[2024-06-01 14:42:04] [INFO ] Deduced a trap composed of 270 places in 281 ms of which 3 ms to minimize.
[2024-06-01 14:42:05] [INFO ] Deduced a trap composed of 177 places in 185 ms of which 3 ms to minimize.
[2024-06-01 14:42:08] [INFO ] Deduced a trap composed of 41 places in 212 ms of which 3 ms to minimize.
[2024-06-01 14:42:08] [INFO ] Deduced a trap composed of 23 places in 188 ms of which 2 ms to minimize.
[2024-06-01 14:42:09] [INFO ] Deduced a trap composed of 315 places in 254 ms of which 3 ms to minimize.
[2024-06-01 14:42:11] [INFO ] Deduced a trap composed of 291 places in 299 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/499 variables, 20/70 constraints. Problems are: Problem set: 0 solved, 1161 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 499/1644 variables, and 70 constraints, problems are : Problem set: 0 solved, 1161 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 37/39 constraints, State Equation: 0/501 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1161/1161 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1161 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/499 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1161 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/499 variables, 37/50 constraints. Problems are: Problem set: 0 solved, 1161 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/499 variables, 20/70 constraints. Problems are: Problem set: 0 solved, 1161 unsolved
[2024-06-01 14:42:23] [INFO ] Deduced a trap composed of 182 places in 312 ms of which 4 ms to minimize.
[2024-06-01 14:42:24] [INFO ] Deduced a trap composed of 210 places in 345 ms of which 3 ms to minimize.
[2024-06-01 14:42:24] [INFO ] Deduced a trap composed of 194 places in 277 ms of which 3 ms to minimize.
[2024-06-01 14:42:24] [INFO ] Deduced a trap composed of 209 places in 254 ms of which 4 ms to minimize.
[2024-06-01 14:42:24] [INFO ] Deduced a trap composed of 222 places in 281 ms of which 3 ms to minimize.
[2024-06-01 14:42:25] [INFO ] Deduced a trap composed of 205 places in 255 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 499/1644 variables, and 76 constraints, problems are : Problem set: 0 solved, 1161 unsolved in 20024 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 37/39 constraints, State Equation: 0/501 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1161 constraints, Known Traps: 26/26 constraints]
After SMT, in 41979ms problems are : Problem set: 0 solved, 1161 unsolved
Search for dead transitions found 0 dead transitions in 41989ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 42054 ms. Remains : 501/750 places, 1163/1412 transitions.
[2024-06-01 14:42:34] [INFO ] Flatten gal took : 43 ms
[2024-06-01 14:42:34] [INFO ] Flatten gal took : 46 ms
[2024-06-01 14:42:34] [INFO ] Input system was already deterministic with 1163 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 750/750 places, 1412/1412 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 78 transitions
Trivial Post-agglo rules discarded 78 transitions
Performed 78 trivial Post agglomeration. Transition count delta: 78
Iterating post reduction 0 with 78 rules applied. Total rules applied 78 place count 750 transition count 1334
Reduce places removed 78 places and 0 transitions.
Iterating post reduction 1 with 78 rules applied. Total rules applied 156 place count 672 transition count 1334
Performed 80 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 80 Pre rules applied. Total rules applied 156 place count 672 transition count 1254
Deduced a syphon composed of 80 places in 2 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 2 with 160 rules applied. Total rules applied 316 place count 592 transition count 1254
Performed 78 Post agglomeration using F-continuation condition.Transition count delta: 78
Deduced a syphon composed of 78 places in 1 ms
Reduce places removed 78 places and 0 transitions.
Iterating global reduction 2 with 156 rules applied. Total rules applied 472 place count 514 transition count 1176
Applied a total of 472 rules in 119 ms. Remains 514 /750 variables (removed 236) and now considering 1176/1412 (removed 236) transitions.
Running 1174 sub problems to find dead transitions.
[2024-06-01 14:42:34] [INFO ] Flow matrix only has 1156 transitions (discarded 20 similar events)
// Phase 1: matrix 1156 rows 514 cols
[2024-06-01 14:42:34] [INFO ] Computed 52 invariants in 37 ms
[2024-06-01 14:42:34] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/512 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1174 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/512 variables, 38/50 constraints. Problems are: Problem set: 0 solved, 1174 unsolved
[2024-06-01 14:42:44] [INFO ] Deduced a trap composed of 41 places in 60 ms of which 1 ms to minimize.
[2024-06-01 14:42:44] [INFO ] Deduced a trap composed of 44 places in 44 ms of which 1 ms to minimize.
[2024-06-01 14:42:44] [INFO ] Deduced a trap composed of 42 places in 35 ms of which 1 ms to minimize.
[2024-06-01 14:42:44] [INFO ] Deduced a trap composed of 42 places in 29 ms of which 0 ms to minimize.
[2024-06-01 14:42:44] [INFO ] Deduced a trap composed of 41 places in 32 ms of which 1 ms to minimize.
[2024-06-01 14:42:44] [INFO ] Deduced a trap composed of 44 places in 34 ms of which 1 ms to minimize.
[2024-06-01 14:42:44] [INFO ] Deduced a trap composed of 43 places in 37 ms of which 1 ms to minimize.
[2024-06-01 14:42:44] [INFO ] Deduced a trap composed of 41 places in 36 ms of which 0 ms to minimize.
[2024-06-01 14:42:45] [INFO ] Deduced a trap composed of 105 places in 249 ms of which 4 ms to minimize.
[2024-06-01 14:42:45] [INFO ] Deduced a trap composed of 42 places in 50 ms of which 1 ms to minimize.
[2024-06-01 14:42:45] [INFO ] Deduced a trap composed of 41 places in 37 ms of which 1 ms to minimize.
[2024-06-01 14:42:45] [INFO ] Deduced a trap composed of 23 places in 188 ms of which 2 ms to minimize.
[2024-06-01 14:42:46] [INFO ] Deduced a trap composed of 96 places in 167 ms of which 3 ms to minimize.
[2024-06-01 14:42:47] [INFO ] Deduced a trap composed of 110 places in 208 ms of which 3 ms to minimize.
[2024-06-01 14:42:47] [INFO ] Deduced a trap composed of 302 places in 292 ms of which 4 ms to minimize.
[2024-06-01 14:42:48] [INFO ] Deduced a trap composed of 189 places in 249 ms of which 3 ms to minimize.
[2024-06-01 14:42:51] [INFO ] Deduced a trap composed of 190 places in 263 ms of which 3 ms to minimize.
[2024-06-01 14:42:56] [INFO ] Deduced a trap composed of 199 places in 290 ms of which 4 ms to minimize.
SMT process timed out in 22078ms, After SMT, problems are : Problem set: 0 solved, 1174 unsolved
Search for dead transitions found 0 dead transitions in 22092ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 22216 ms. Remains : 514/750 places, 1176/1412 transitions.
[2024-06-01 14:42:56] [INFO ] Flatten gal took : 61 ms
[2024-06-01 14:42:56] [INFO ] Flatten gal took : 51 ms
[2024-06-01 14:42:56] [INFO ] Input system was already deterministic with 1176 transitions.
Starting structural reductions in LTL mode, iteration 0 : 750/750 places, 1412/1412 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 740 transition count 1402
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 740 transition count 1402
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 30 place count 730 transition count 1392
Iterating global reduction 0 with 10 rules applied. Total rules applied 40 place count 730 transition count 1392
Applied a total of 40 rules in 34 ms. Remains 730 /750 variables (removed 20) and now considering 1392/1412 (removed 20) transitions.
Running 1390 sub problems to find dead transitions.
[2024-06-01 14:42:56] [INFO ] Flow matrix only has 1372 transitions (discarded 20 similar events)
// Phase 1: matrix 1372 rows 730 cols
[2024-06-01 14:42:57] [INFO ] Computed 52 invariants in 15 ms
[2024-06-01 14:42:57] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/728 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/728 variables, 37/50 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
[2024-06-01 14:43:10] [INFO ] Deduced a trap composed of 64 places in 82 ms of which 2 ms to minimize.
[2024-06-01 14:43:10] [INFO ] Deduced a trap composed of 63 places in 73 ms of which 2 ms to minimize.
[2024-06-01 14:43:10] [INFO ] Deduced a trap composed of 63 places in 42 ms of which 1 ms to minimize.
[2024-06-01 14:43:10] [INFO ] Deduced a trap composed of 64 places in 55 ms of which 1 ms to minimize.
[2024-06-01 14:43:10] [INFO ] Deduced a trap composed of 63 places in 47 ms of which 0 ms to minimize.
[2024-06-01 14:43:10] [INFO ] Deduced a trap composed of 64 places in 58 ms of which 1 ms to minimize.
[2024-06-01 14:43:10] [INFO ] Deduced a trap composed of 64 places in 69 ms of which 1 ms to minimize.
[2024-06-01 14:43:10] [INFO ] Deduced a trap composed of 63 places in 57 ms of which 1 ms to minimize.
[2024-06-01 14:43:10] [INFO ] Deduced a trap composed of 63 places in 89 ms of which 2 ms to minimize.
[2024-06-01 14:43:11] [INFO ] Deduced a trap composed of 65 places in 68 ms of which 1 ms to minimize.
[2024-06-01 14:43:11] [INFO ] Deduced a trap composed of 387 places in 433 ms of which 5 ms to minimize.
[2024-06-01 14:43:12] [INFO ] Deduced a trap composed of 388 places in 418 ms of which 5 ms to minimize.
[2024-06-01 14:43:12] [INFO ] Deduced a trap composed of 380 places in 386 ms of which 5 ms to minimize.
[2024-06-01 14:43:12] [INFO ] Deduced a trap composed of 369 places in 386 ms of which 5 ms to minimize.
[2024-06-01 14:43:13] [INFO ] Deduced a trap composed of 496 places in 409 ms of which 5 ms to minimize.
[2024-06-01 14:43:14] [INFO ] Deduced a trap composed of 517 places in 393 ms of which 5 ms to minimize.
[2024-06-01 14:43:14] [INFO ] Deduced a trap composed of 494 places in 372 ms of which 5 ms to minimize.
[2024-06-01 14:43:15] [INFO ] Deduced a trap composed of 527 places in 356 ms of which 5 ms to minimize.
[2024-06-01 14:43:15] [INFO ] Deduced a trap composed of 504 places in 397 ms of which 5 ms to minimize.
[2024-06-01 14:43:15] [INFO ] Deduced a trap composed of 494 places in 417 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/728 variables, 20/70 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
[2024-06-01 14:43:18] [INFO ] Deduced a trap composed of 493 places in 366 ms of which 5 ms to minimize.
[2024-06-01 14:43:18] [INFO ] Deduced a trap composed of 507 places in 417 ms of which 6 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 728/2102 variables, and 72 constraints, problems are : Problem set: 0 solved, 1390 unsolved in 20036 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 37/39 constraints, State Equation: 0/730 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1390/1390 constraints, Known Traps: 22/22 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1390 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/728 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/728 variables, 37/50 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/728 variables, 22/72 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 728/2102 variables, and 72 constraints, problems are : Problem set: 0 solved, 1390 unsolved in 20037 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 37/39 constraints, State Equation: 0/730 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1390 constraints, Known Traps: 22/22 constraints]
After SMT, in 42065ms problems are : Problem set: 0 solved, 1390 unsolved
Search for dead transitions found 0 dead transitions in 42081ms
Finished structural reductions in LTL mode , in 1 iterations and 42118 ms. Remains : 730/750 places, 1392/1412 transitions.
[2024-06-01 14:43:39] [INFO ] Flatten gal took : 47 ms
[2024-06-01 14:43:39] [INFO ] Flatten gal took : 50 ms
[2024-06-01 14:43:39] [INFO ] Input system was already deterministic with 1392 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 750/750 places, 1412/1412 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 90 transitions
Trivial Post-agglo rules discarded 90 transitions
Performed 90 trivial Post agglomeration. Transition count delta: 90
Iterating post reduction 0 with 90 rules applied. Total rules applied 90 place count 750 transition count 1322
Reduce places removed 90 places and 0 transitions.
Iterating post reduction 1 with 90 rules applied. Total rules applied 180 place count 660 transition count 1322
Performed 80 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 80 Pre rules applied. Total rules applied 180 place count 660 transition count 1242
Deduced a syphon composed of 80 places in 1 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 2 with 160 rules applied. Total rules applied 340 place count 580 transition count 1242
Performed 78 Post agglomeration using F-continuation condition.Transition count delta: 78
Deduced a syphon composed of 78 places in 1 ms
Reduce places removed 78 places and 0 transitions.
Iterating global reduction 2 with 156 rules applied. Total rules applied 496 place count 502 transition count 1164
Applied a total of 496 rules in 72 ms. Remains 502 /750 variables (removed 248) and now considering 1164/1412 (removed 248) transitions.
Running 1162 sub problems to find dead transitions.
[2024-06-01 14:43:39] [INFO ] Flow matrix only has 1144 transitions (discarded 20 similar events)
// Phase 1: matrix 1144 rows 502 cols
[2024-06-01 14:43:39] [INFO ] Computed 52 invariants in 26 ms
[2024-06-01 14:43:39] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/500 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1162 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/500 variables, 37/50 constraints. Problems are: Problem set: 0 solved, 1162 unsolved
[2024-06-01 14:43:49] [INFO ] Deduced a trap composed of 41 places in 97 ms of which 2 ms to minimize.
[2024-06-01 14:43:49] [INFO ] Deduced a trap composed of 41 places in 78 ms of which 1 ms to minimize.
[2024-06-01 14:43:49] [INFO ] Deduced a trap composed of 40 places in 67 ms of which 1 ms to minimize.
[2024-06-01 14:43:49] [INFO ] Deduced a trap composed of 40 places in 41 ms of which 1 ms to minimize.
[2024-06-01 14:43:49] [INFO ] Deduced a trap composed of 41 places in 40 ms of which 1 ms to minimize.
[2024-06-01 14:43:49] [INFO ] Deduced a trap composed of 40 places in 40 ms of which 1 ms to minimize.
[2024-06-01 14:43:49] [INFO ] Deduced a trap composed of 40 places in 40 ms of which 0 ms to minimize.
[2024-06-01 14:43:49] [INFO ] Deduced a trap composed of 41 places in 40 ms of which 0 ms to minimize.
[2024-06-01 14:43:49] [INFO ] Deduced a trap composed of 42 places in 39 ms of which 1 ms to minimize.
[2024-06-01 14:43:49] [INFO ] Deduced a trap composed of 40 places in 41 ms of which 1 ms to minimize.
[2024-06-01 14:43:50] [INFO ] Deduced a trap composed of 224 places in 201 ms of which 3 ms to minimize.
[2024-06-01 14:43:50] [INFO ] Deduced a trap composed of 191 places in 291 ms of which 3 ms to minimize.
[2024-06-01 14:43:50] [INFO ] Deduced a trap composed of 23 places in 192 ms of which 3 ms to minimize.
[2024-06-01 14:43:51] [INFO ] Deduced a trap composed of 68 places in 193 ms of which 3 ms to minimize.
[2024-06-01 14:43:51] [INFO ] Deduced a trap composed of 179 places in 286 ms of which 4 ms to minimize.
[2024-06-01 14:43:52] [INFO ] Deduced a trap composed of 199 places in 282 ms of which 4 ms to minimize.
[2024-06-01 14:43:52] [INFO ] Deduced a trap composed of 177 places in 195 ms of which 3 ms to minimize.
[2024-06-01 14:43:54] [INFO ] Deduced a trap composed of 314 places in 263 ms of which 3 ms to minimize.
[2024-06-01 14:44:01] [INFO ] Deduced a trap composed of 182 places in 274 ms of which 3 ms to minimize.
[2024-06-01 14:44:01] [INFO ] Deduced a trap composed of 194 places in 253 ms of which 3 ms to minimize.
SMT process timed out in 22245ms, After SMT, problems are : Problem set: 0 solved, 1162 unsolved
Search for dead transitions found 0 dead transitions in 22258ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 22334 ms. Remains : 502/750 places, 1164/1412 transitions.
[2024-06-01 14:44:01] [INFO ] Flatten gal took : 62 ms
[2024-06-01 14:44:01] [INFO ] Flatten gal took : 52 ms
[2024-06-01 14:44:01] [INFO ] Input system was already deterministic with 1164 transitions.
Starting structural reductions in LTL mode, iteration 0 : 750/750 places, 1412/1412 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 741 transition count 1403
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 741 transition count 1403
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 27 place count 732 transition count 1394
Iterating global reduction 0 with 9 rules applied. Total rules applied 36 place count 732 transition count 1394
Applied a total of 36 rules in 33 ms. Remains 732 /750 variables (removed 18) and now considering 1394/1412 (removed 18) transitions.
Running 1392 sub problems to find dead transitions.
[2024-06-01 14:44:01] [INFO ] Flow matrix only has 1374 transitions (discarded 20 similar events)
// Phase 1: matrix 1374 rows 732 cols
[2024-06-01 14:44:01] [INFO ] Computed 52 invariants in 28 ms
[2024-06-01 14:44:01] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/730 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1392 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/730 variables, 37/50 constraints. Problems are: Problem set: 0 solved, 1392 unsolved
[2024-06-01 14:44:17] [INFO ] Deduced a trap composed of 64 places in 88 ms of which 2 ms to minimize.
[2024-06-01 14:44:17] [INFO ] Deduced a trap composed of 63 places in 90 ms of which 1 ms to minimize.
[2024-06-01 14:44:17] [INFO ] Deduced a trap composed of 65 places in 69 ms of which 1 ms to minimize.
[2024-06-01 14:44:17] [INFO ] Deduced a trap composed of 63 places in 85 ms of which 2 ms to minimize.
[2024-06-01 14:44:17] [INFO ] Deduced a trap composed of 65 places in 70 ms of which 1 ms to minimize.
[2024-06-01 14:44:17] [INFO ] Deduced a trap composed of 64 places in 46 ms of which 0 ms to minimize.
[2024-06-01 14:44:17] [INFO ] Deduced a trap composed of 63 places in 46 ms of which 1 ms to minimize.
[2024-06-01 14:44:17] [INFO ] Deduced a trap composed of 64 places in 44 ms of which 1 ms to minimize.
[2024-06-01 14:44:17] [INFO ] Deduced a trap composed of 63 places in 60 ms of which 1 ms to minimize.
[2024-06-01 14:44:17] [INFO ] Deduced a trap composed of 64 places in 73 ms of which 1 ms to minimize.
[2024-06-01 14:44:18] [INFO ] Deduced a trap composed of 373 places in 404 ms of which 5 ms to minimize.
[2024-06-01 14:44:18] [INFO ] Deduced a trap composed of 372 places in 356 ms of which 5 ms to minimize.
[2024-06-01 14:44:19] [INFO ] Deduced a trap composed of 75 places in 383 ms of which 5 ms to minimize.
[2024-06-01 14:44:20] [INFO ] Deduced a trap composed of 388 places in 341 ms of which 5 ms to minimize.
[2024-06-01 14:44:20] [INFO ] Deduced a trap composed of 384 places in 376 ms of which 5 ms to minimize.
[2024-06-01 14:44:20] [INFO ] Deduced a trap composed of 468 places in 348 ms of which 5 ms to minimize.
[2024-06-01 14:44:21] [INFO ] Deduced a trap composed of 396 places in 425 ms of which 5 ms to minimize.
[2024-06-01 14:44:21] [INFO ] Deduced a trap composed of 225 places in 435 ms of which 6 ms to minimize.
[2024-06-01 14:44:22] [INFO ] Deduced a trap composed of 502 places in 304 ms of which 4 ms to minimize.
[2024-06-01 14:44:23] [INFO ] Deduced a trap composed of 506 places in 395 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/730 variables, 20/70 constraints. Problems are: Problem set: 0 solved, 1392 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 730/2106 variables, and 70 constraints, problems are : Problem set: 0 solved, 1392 unsolved in 20030 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 37/39 constraints, State Equation: 0/732 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1392/1392 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1392 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/730 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1392 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/730 variables, 37/50 constraints. Problems are: Problem set: 0 solved, 1392 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/730 variables, 20/70 constraints. Problems are: Problem set: 0 solved, 1392 unsolved
[2024-06-01 14:44:42] [INFO ] Deduced a trap composed of 253 places in 380 ms of which 5 ms to minimize.
[2024-06-01 14:44:42] [INFO ] Deduced a trap composed of 216 places in 380 ms of which 6 ms to minimize.
[2024-06-01 14:44:44] [INFO ] Deduced a trap composed of 115 places in 266 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 730/2106 variables, and 73 constraints, problems are : Problem set: 0 solved, 1392 unsolved in 20029 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 37/39 constraints, State Equation: 0/732 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1392 constraints, Known Traps: 23/23 constraints]
After SMT, in 42340ms problems are : Problem set: 0 solved, 1392 unsolved
Search for dead transitions found 0 dead transitions in 42357ms
Finished structural reductions in LTL mode , in 1 iterations and 42393 ms. Remains : 732/750 places, 1394/1412 transitions.
[2024-06-01 14:44:44] [INFO ] Flatten gal took : 51 ms
[2024-06-01 14:44:44] [INFO ] Flatten gal took : 65 ms
[2024-06-01 14:44:44] [INFO ] Input system was already deterministic with 1394 transitions.
Starting structural reductions in LTL mode, iteration 0 : 750/750 places, 1412/1412 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 740 transition count 1402
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 740 transition count 1402
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 28 place count 732 transition count 1394
Iterating global reduction 0 with 8 rules applied. Total rules applied 36 place count 732 transition count 1394
Applied a total of 36 rules in 37 ms. Remains 732 /750 variables (removed 18) and now considering 1394/1412 (removed 18) transitions.
Running 1392 sub problems to find dead transitions.
[2024-06-01 14:44:44] [INFO ] Flow matrix only has 1374 transitions (discarded 20 similar events)
// Phase 1: matrix 1374 rows 732 cols
[2024-06-01 14:44:44] [INFO ] Computed 52 invariants in 29 ms
[2024-06-01 14:44:44] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/730 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1392 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/730 variables, 39/50 constraints. Problems are: Problem set: 0 solved, 1392 unsolved
[2024-06-01 14:44:59] [INFO ] Deduced a trap composed of 65 places in 114 ms of which 3 ms to minimize.
[2024-06-01 14:44:59] [INFO ] Deduced a trap composed of 64 places in 75 ms of which 1 ms to minimize.
[2024-06-01 14:44:59] [INFO ] Deduced a trap composed of 63 places in 60 ms of which 2 ms to minimize.
[2024-06-01 14:45:00] [INFO ] Deduced a trap composed of 65 places in 65 ms of which 1 ms to minimize.
[2024-06-01 14:45:00] [INFO ] Deduced a trap composed of 64 places in 59 ms of which 1 ms to minimize.
[2024-06-01 14:45:00] [INFO ] Deduced a trap composed of 64 places in 53 ms of which 1 ms to minimize.
[2024-06-01 14:45:00] [INFO ] Deduced a trap composed of 63 places in 50 ms of which 0 ms to minimize.
[2024-06-01 14:45:00] [INFO ] Deduced a trap composed of 63 places in 53 ms of which 1 ms to minimize.
[2024-06-01 14:45:00] [INFO ] Deduced a trap composed of 65 places in 52 ms of which 1 ms to minimize.
[2024-06-01 14:45:01] [INFO ] Deduced a trap composed of 383 places in 427 ms of which 5 ms to minimize.
[2024-06-01 14:45:01] [INFO ] Deduced a trap composed of 384 places in 377 ms of which 5 ms to minimize.
[2024-06-01 14:45:02] [INFO ] Deduced a trap composed of 64 places in 55 ms of which 1 ms to minimize.
[2024-06-01 14:45:02] [INFO ] Deduced a trap composed of 546 places in 391 ms of which 5 ms to minimize.
[2024-06-01 14:45:02] [INFO ] Deduced a trap composed of 528 places in 334 ms of which 3 ms to minimize.
[2024-06-01 14:45:03] [INFO ] Deduced a trap composed of 523 places in 424 ms of which 18 ms to minimize.
[2024-06-01 14:45:03] [INFO ] Deduced a trap composed of 233 places in 398 ms of which 6 ms to minimize.
[2024-06-01 14:45:04] [INFO ] Deduced a trap composed of 221 places in 379 ms of which 6 ms to minimize.
[2024-06-01 14:45:04] [INFO ] Deduced a trap composed of 250 places in 351 ms of which 4 ms to minimize.
[2024-06-01 14:45:05] [INFO ] Deduced a trap composed of 202 places in 308 ms of which 4 ms to minimize.
[2024-06-01 14:45:05] [INFO ] Deduced a trap composed of 509 places in 405 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/730 variables, 20/70 constraints. Problems are: Problem set: 0 solved, 1392 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 730/2106 variables, and 70 constraints, problems are : Problem set: 0 solved, 1392 unsolved in 20024 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 39/41 constraints, State Equation: 0/732 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1392/1392 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1392 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/730 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1392 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/730 variables, 39/50 constraints. Problems are: Problem set: 0 solved, 1392 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/730 variables, 20/70 constraints. Problems are: Problem set: 0 solved, 1392 unsolved
[2024-06-01 14:45:25] [INFO ] Deduced a trap composed of 496 places in 401 ms of which 5 ms to minimize.
[2024-06-01 14:45:26] [INFO ] Deduced a trap composed of 394 places in 453 ms of which 5 ms to minimize.
SMT process timed out in 42110ms, After SMT, problems are : Problem set: 0 solved, 1392 unsolved
Search for dead transitions found 0 dead transitions in 42128ms
Finished structural reductions in LTL mode , in 1 iterations and 42171 ms. Remains : 732/750 places, 1394/1412 transitions.
[2024-06-01 14:45:26] [INFO ] Flatten gal took : 46 ms
[2024-06-01 14:45:26] [INFO ] Flatten gal took : 50 ms
[2024-06-01 14:45:26] [INFO ] Input system was already deterministic with 1394 transitions.
Starting structural reductions in LTL mode, iteration 0 : 750/750 places, 1412/1412 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 740 transition count 1402
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 740 transition count 1402
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 30 place count 730 transition count 1392
Iterating global reduction 0 with 10 rules applied. Total rules applied 40 place count 730 transition count 1392
Applied a total of 40 rules in 35 ms. Remains 730 /750 variables (removed 20) and now considering 1392/1412 (removed 20) transitions.
Running 1390 sub problems to find dead transitions.
[2024-06-01 14:45:26] [INFO ] Flow matrix only has 1372 transitions (discarded 20 similar events)
// Phase 1: matrix 1372 rows 730 cols
[2024-06-01 14:45:26] [INFO ] Computed 52 invariants in 30 ms
[2024-06-01 14:45:26] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/728 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/728 variables, 37/50 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
[2024-06-01 14:45:41] [INFO ] Deduced a trap composed of 64 places in 67 ms of which 1 ms to minimize.
[2024-06-01 14:45:41] [INFO ] Deduced a trap composed of 63 places in 73 ms of which 1 ms to minimize.
[2024-06-01 14:45:41] [INFO ] Deduced a trap composed of 63 places in 61 ms of which 0 ms to minimize.
[2024-06-01 14:45:41] [INFO ] Deduced a trap composed of 64 places in 62 ms of which 1 ms to minimize.
[2024-06-01 14:45:41] [INFO ] Deduced a trap composed of 63 places in 61 ms of which 1 ms to minimize.
[2024-06-01 14:45:42] [INFO ] Deduced a trap composed of 64 places in 62 ms of which 1 ms to minimize.
[2024-06-01 14:45:42] [INFO ] Deduced a trap composed of 64 places in 54 ms of which 1 ms to minimize.
[2024-06-01 14:45:42] [INFO ] Deduced a trap composed of 63 places in 57 ms of which 0 ms to minimize.
[2024-06-01 14:45:42] [INFO ] Deduced a trap composed of 63 places in 75 ms of which 1 ms to minimize.
[2024-06-01 14:45:42] [INFO ] Deduced a trap composed of 65 places in 57 ms of which 0 ms to minimize.
[2024-06-01 14:45:42] [INFO ] Deduced a trap composed of 387 places in 283 ms of which 4 ms to minimize.
[2024-06-01 14:45:43] [INFO ] Deduced a trap composed of 388 places in 304 ms of which 3 ms to minimize.
[2024-06-01 14:45:43] [INFO ] Deduced a trap composed of 380 places in 318 ms of which 4 ms to minimize.
[2024-06-01 14:45:43] [INFO ] Deduced a trap composed of 369 places in 304 ms of which 4 ms to minimize.
[2024-06-01 14:45:44] [INFO ] Deduced a trap composed of 496 places in 315 ms of which 4 ms to minimize.
[2024-06-01 14:45:44] [INFO ] Deduced a trap composed of 517 places in 285 ms of which 4 ms to minimize.
[2024-06-01 14:45:45] [INFO ] Deduced a trap composed of 494 places in 295 ms of which 3 ms to minimize.
[2024-06-01 14:45:45] [INFO ] Deduced a trap composed of 527 places in 321 ms of which 4 ms to minimize.
[2024-06-01 14:45:45] [INFO ] Deduced a trap composed of 504 places in 319 ms of which 4 ms to minimize.
[2024-06-01 14:45:46] [INFO ] Deduced a trap composed of 494 places in 273 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/728 variables, 20/70 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
[2024-06-01 14:45:48] [INFO ] Deduced a trap composed of 493 places in 318 ms of which 4 ms to minimize.
SMT process timed out in 21801ms, After SMT, problems are : Problem set: 0 solved, 1390 unsolved
Search for dead transitions found 0 dead transitions in 21817ms
Finished structural reductions in LTL mode , in 1 iterations and 21858 ms. Remains : 730/750 places, 1392/1412 transitions.
[2024-06-01 14:45:48] [INFO ] Flatten gal took : 44 ms
[2024-06-01 14:45:48] [INFO ] Flatten gal took : 34 ms
[2024-06-01 14:45:48] [INFO ] Input system was already deterministic with 1392 transitions.
[2024-06-01 14:45:48] [INFO ] Flatten gal took : 42 ms
[2024-06-01 14:45:48] [INFO ] Flatten gal took : 42 ms
[2024-06-01 14:45:49] [INFO ] Export to MCC of 12 properties in file /home/mcc/execution/CTLFireability.sr.xml took 23 ms.
[2024-06-01 14:45:49] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 750 places, 1412 transitions and 6120 arcs took 8 ms.
Total runtime 665015 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : PolyORBLF-PT-S02J04T10-CTLFireability-2024-00
Could not compute solution for formula : PolyORBLF-PT-S02J04T10-CTLFireability-2024-02
Could not compute solution for formula : PolyORBLF-PT-S02J04T10-CTLFireability-2024-04
Could not compute solution for formula : PolyORBLF-PT-S02J04T10-CTLFireability-2024-05
Could not compute solution for formula : PolyORBLF-PT-S02J04T10-CTLFireability-2024-06
Could not compute solution for formula : PolyORBLF-PT-S02J04T10-CTLFireability-2024-08
Could not compute solution for formula : PolyORBLF-PT-S02J04T10-CTLFireability-2024-09
Could not compute solution for formula : PolyORBLF-PT-S02J04T10-CTLFireability-2024-11
Could not compute solution for formula : PolyORBLF-PT-S02J04T10-CTLFireability-2024-12
Could not compute solution for formula : PolyORBLF-PT-S02J04T10-CTLFireability-2024-13
Could not compute solution for formula : PolyORBLF-PT-S02J04T10-CTLFireability-2024-14
Could not compute solution for formula : PolyORBLF-PT-S02J04T10-CTLFireability-2024-15

BK_STOP 1717253149404

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -timeout 360 -rebuildPNML
mcc2024
ctl formula name PolyORBLF-PT-S02J04T10-CTLFireability-2024-00
ctl formula formula --ctl=/tmp/2107/ctl_0_
ctl formula name PolyORBLF-PT-S02J04T10-CTLFireability-2024-02
ctl formula formula --ctl=/tmp/2107/ctl_1_
ctl formula name PolyORBLF-PT-S02J04T10-CTLFireability-2024-04
ctl formula formula --ctl=/tmp/2107/ctl_2_
ctl formula name PolyORBLF-PT-S02J04T10-CTLFireability-2024-05
ctl formula formula --ctl=/tmp/2107/ctl_3_
ctl formula name PolyORBLF-PT-S02J04T10-CTLFireability-2024-06
ctl formula formula --ctl=/tmp/2107/ctl_4_
ctl formula name PolyORBLF-PT-S02J04T10-CTLFireability-2024-08
ctl formula formula --ctl=/tmp/2107/ctl_5_
ctl formula name PolyORBLF-PT-S02J04T10-CTLFireability-2024-09
ctl formula formula --ctl=/tmp/2107/ctl_6_
ctl formula name PolyORBLF-PT-S02J04T10-CTLFireability-2024-11
ctl formula formula --ctl=/tmp/2107/ctl_7_
ctl formula name PolyORBLF-PT-S02J04T10-CTLFireability-2024-12
ctl formula formula --ctl=/tmp/2107/ctl_8_
ctl formula name PolyORBLF-PT-S02J04T10-CTLFireability-2024-13
ctl formula formula --ctl=/tmp/2107/ctl_9_
ctl formula name PolyORBLF-PT-S02J04T10-CTLFireability-2024-14
ctl formula formula --ctl=/tmp/2107/ctl_10_
ctl formula name PolyORBLF-PT-S02J04T10-CTLFireability-2024-15
ctl formula formula --ctl=/tmp/2107/ctl_11_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="PolyORBLF-PT-S02J04T10"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is PolyORBLF-PT-S02J04T10, 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 r516-tajo-171654446700234"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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