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-171654446700249.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-S02J06T08, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r516-tajo-171654446700249
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.0M
-rw-r--r-- 1 mcc users 24K Apr 11 17:09 CTLCardinality.txt
-rw-r--r-- 1 mcc users 138K Apr 11 17:09 CTLCardinality.xml
-rw-r--r-- 1 mcc users 30K Apr 11 17:07 CTLFireability.txt
-rw-r--r-- 1 mcc users 163K Apr 11 17:07 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 13K Apr 23 07:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 47K Apr 23 07:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Apr 23 07:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 35K Apr 23 07:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 48K Apr 11 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 251K Apr 11 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 58K Apr 11 17:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 295K Apr 11 17:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.2K Apr 23 07:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.5K 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 807K 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-S02J06T08-CTLCardinality-2024-00
FORMULA_NAME PolyORBLF-PT-S02J06T08-CTLCardinality-2024-01
FORMULA_NAME PolyORBLF-PT-S02J06T08-CTLCardinality-2024-02
FORMULA_NAME PolyORBLF-PT-S02J06T08-CTLCardinality-2024-03
FORMULA_NAME PolyORBLF-PT-S02J06T08-CTLCardinality-2024-04
FORMULA_NAME PolyORBLF-PT-S02J06T08-CTLCardinality-2024-05
FORMULA_NAME PolyORBLF-PT-S02J06T08-CTLCardinality-2024-06
FORMULA_NAME PolyORBLF-PT-S02J06T08-CTLCardinality-2024-07
FORMULA_NAME PolyORBLF-PT-S02J06T08-CTLCardinality-2024-08
FORMULA_NAME PolyORBLF-PT-S02J06T08-CTLCardinality-2024-09
FORMULA_NAME PolyORBLF-PT-S02J06T08-CTLCardinality-2024-10
FORMULA_NAME PolyORBLF-PT-S02J06T08-CTLCardinality-2024-11
FORMULA_NAME PolyORBLF-PT-S02J06T08-CTLCardinality-2024-12
FORMULA_NAME PolyORBLF-PT-S02J06T08-CTLCardinality-2024-13
FORMULA_NAME PolyORBLF-PT-S02J06T08-CTLCardinality-2024-14
FORMULA_NAME PolyORBLF-PT-S02J06T08-CTLCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717253168510

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-PT-S02J06T08
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 14:46:10] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 14:46:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 14:46:11] [INFO ] Load time of PNML (sax parser for PT used): 255 ms
[2024-06-01 14:46:11] [INFO ] Transformed 690 places.
[2024-06-01 14:46:11] [INFO ] Transformed 1434 transitions.
[2024-06-01 14:46:11] [INFO ] Parsed PT model containing 690 places and 1434 transitions and 6564 arcs in 520 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 44 ms.
Ensure Unique test removed 128 transitions
Reduce redundant transitions removed 128 transitions.
Support contains 551 out of 690 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 690/690 places, 1306/1306 transitions.
Applied a total of 0 rules in 57 ms. Remains 690 /690 variables (removed 0) and now considering 1306/1306 (removed 0) transitions.
Running 1304 sub problems to find dead transitions.
[2024-06-01 14:46:11] [INFO ] Flow matrix only has 1290 transitions (discarded 16 similar events)
// Phase 1: matrix 1290 rows 690 cols
[2024-06-01 14:46:12] [INFO ] Computed 54 invariants in 115 ms
[2024-06-01 14:46:12] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/686 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1304 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/686 variables, 37/50 constraints. Problems are: Problem set: 0 solved, 1304 unsolved
[2024-06-01 14:46:29] [INFO ] Deduced a trap composed of 73 places in 463 ms of which 46 ms to minimize.
[2024-06-01 14:46:30] [INFO ] Deduced a trap composed of 181 places in 355 ms of which 5 ms to minimize.
[2024-06-01 14:46:30] [INFO ] Deduced a trap composed of 73 places in 69 ms of which 1 ms to minimize.
[2024-06-01 14:46:30] [INFO ] Deduced a trap composed of 73 places in 57 ms of which 1 ms to minimize.
[2024-06-01 14:46:30] [INFO ] Deduced a trap composed of 74 places in 58 ms of which 1 ms to minimize.
[2024-06-01 14:46:30] [INFO ] Deduced a trap composed of 73 places in 66 ms of which 1 ms to minimize.
[2024-06-01 14:46:30] [INFO ] Deduced a trap composed of 74 places in 52 ms of which 1 ms to minimize.
[2024-06-01 14:46:31] [INFO ] Deduced a trap composed of 74 places in 65 ms of which 2 ms to minimize.
[2024-06-01 14:46:31] [INFO ] Deduced a trap composed of 74 places in 48 ms of which 1 ms to minimize.
[2024-06-01 14:46:32] [INFO ] Deduced a trap composed of 376 places in 353 ms of which 5 ms to minimize.
[2024-06-01 14:46:32] [INFO ] Deduced a trap composed of 327 places in 311 ms of which 4 ms to minimize.
[2024-06-01 14:46:33] [INFO ] Deduced a trap composed of 358 places in 310 ms of which 4 ms to minimize.
[2024-06-01 14:46:33] [INFO ] Deduced a trap composed of 374 places in 385 ms of which 6 ms to minimize.
[2024-06-01 14:46:34] [INFO ] Deduced a trap composed of 19 places in 197 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 686/1980 variables, and 64 constraints, problems are : Problem set: 0 solved, 1304 unsolved in 20098 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 37/41 constraints, State Equation: 0/690 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1304/1304 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1304 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/686 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1304 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/686 variables, 37/50 constraints. Problems are: Problem set: 0 solved, 1304 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/686 variables, 14/64 constraints. Problems are: Problem set: 0 solved, 1304 unsolved
[2024-06-01 14:46:53] [INFO ] Deduced a trap composed of 54 places in 408 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 686/1980 variables, and 65 constraints, problems are : Problem set: 0 solved, 1304 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 37/41 constraints, State Equation: 0/690 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1304 constraints, Known Traps: 15/15 constraints]
After SMT, in 42622ms problems are : Problem set: 0 solved, 1304 unsolved
Search for dead transitions found 0 dead transitions in 42715ms
[2024-06-01 14:46:54] [INFO ] Flow matrix only has 1290 transitions (discarded 16 similar events)
[2024-06-01 14:46:54] [INFO ] Invariant cache hit.
[2024-06-01 14:46:54] [INFO ] Implicit Places using invariants in 314 ms returned [68, 180, 294, 347, 468, 494, 576]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 324 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 683/690 places, 1306/1306 transitions.
Applied a total of 0 rules in 13 ms. Remains 683 /683 variables (removed 0) and now considering 1306/1306 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 43367 ms. Remains : 683/690 places, 1306/1306 transitions.
Support contains 551 out of 683 places after structural reductions.
[2024-06-01 14:46:55] [INFO ] Flatten gal took : 215 ms
[2024-06-01 14:46:55] [INFO ] Flatten gal took : 113 ms
[2024-06-01 14:46:55] [INFO ] Input system was already deterministic with 1306 transitions.
RANDOM walk for 40000 steps (10 resets) in 4039 ms. (9 steps per ms) remains 70/99 properties
BEST_FIRST walk for 4003 steps (8 resets) in 96 ms. (41 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4002 steps (8 resets) in 116 ms. (34 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4002 steps (8 resets) in 76 ms. (51 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4003 steps (8 resets) in 60 ms. (65 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4002 steps (8 resets) in 45 ms. (87 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4002 steps (8 resets) in 60 ms. (65 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4001 steps (8 resets) in 53 ms. (74 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4003 steps (8 resets) in 74 ms. (53 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4003 steps (8 resets) in 66 ms. (59 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4001 steps (8 resets) in 77 ms. (51 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4001 steps (8 resets) in 54 ms. (72 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4002 steps (8 resets) in 62 ms. (63 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4004 steps (8 resets) in 72 ms. (54 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4003 steps (8 resets) in 41 ms. (95 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4003 steps (8 resets) in 56 ms. (70 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4001 steps (8 resets) in 51 ms. (76 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4001 steps (8 resets) in 46 ms. (85 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4003 steps (8 resets) in 41 ms. (95 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4002 steps (8 resets) in 102 ms. (38 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4003 steps (8 resets) in 41 ms. (95 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4002 steps (8 resets) in 109 ms. (36 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4002 steps (8 resets) in 93 ms. (42 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4001 steps (8 resets) in 51 ms. (76 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4002 steps (8 resets) in 47 ms. (83 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4003 steps (8 resets) in 46 ms. (85 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4002 steps (8 resets) in 117 ms. (33 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4001 steps (8 resets) in 121 ms. (32 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4003 steps (8 resets) in 91 ms. (43 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4002 steps (8 resets) in 53 ms. (74 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4002 steps (8 resets) in 60 ms. (65 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4002 steps (8 resets) in 72 ms. (54 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4002 steps (8 resets) in 78 ms. (50 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4003 steps (8 resets) in 51 ms. (76 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4001 steps (8 resets) in 56 ms. (70 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4002 steps (8 resets) in 50 ms. (78 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4003 steps (8 resets) in 66 ms. (59 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4002 steps (8 resets) in 93 ms. (42 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4003 steps (8 resets) in 43 ms. (90 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4002 steps (9 resets) in 167 ms. (23 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4001 steps (8 resets) in 59 ms. (66 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4003 steps (8 resets) in 56 ms. (70 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4002 steps (8 resets) in 66 ms. (59 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4001 steps (8 resets) in 60 ms. (65 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4003 steps (8 resets) in 40 ms. (97 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4003 steps (8 resets) in 42 ms. (93 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4001 steps (8 resets) in 41 ms. (95 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4002 steps (8 resets) in 50 ms. (78 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4001 steps (8 resets) in 51 ms. (76 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4002 steps (8 resets) in 40 ms. (97 steps per ms) remains 70/70 properties
[2024-06-01 14:46:58] [INFO ] Flow matrix only has 1290 transitions (discarded 16 similar events)
// Phase 1: matrix 1290 rows 683 cols
[2024-06-01 14:46:58] [INFO ] Computed 47 invariants in 53 ms
[2024-06-01 14:46:59] [INFO ] State equation strengthened by 96 read => feed constraints.
Problem AtomicPropp23 is UNSAT
Problem AtomicPropp31 is UNSAT
Problem AtomicPropp39 is UNSAT
Problem AtomicPropp46 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/340 variables, 2/2 constraints. Problems are: Problem set: 4 solved, 66 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/340 variables, 0/2 constraints. Problems are: Problem set: 4 solved, 66 unsolved
Problem AtomicPropp43 is UNSAT
Problem AtomicPropp53 is UNSAT
Problem AtomicPropp54 is UNSAT
Problem AtomicPropp57 is UNSAT
Problem AtomicPropp58 is UNSAT
Problem AtomicPropp63 is UNSAT
Problem AtomicPropp66 is UNSAT
Problem AtomicPropp77 is UNSAT
Problem AtomicPropp82 is UNSAT
Problem AtomicPropp92 is UNSAT
Problem AtomicPropp95 is UNSAT
Problem AtomicPropp96 is UNSAT
At refinement iteration 2 (OVERLAPS) 84/424 variables, 11/13 constraints. Problems are: Problem set: 16 solved, 54 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/424 variables, 0/13 constraints. Problems are: Problem set: 16 solved, 54 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp21 is UNSAT
Problem AtomicPropp24 is UNSAT
Problem AtomicPropp27 is UNSAT
Problem AtomicPropp29 is UNSAT
Problem AtomicPropp32 is UNSAT
Problem AtomicPropp34 is UNSAT
Problem AtomicPropp41 is UNSAT
Problem AtomicPropp42 is UNSAT
Problem AtomicPropp44 is UNSAT
Problem AtomicPropp48 is UNSAT
Problem AtomicPropp49 is UNSAT
Problem AtomicPropp50 is UNSAT
Problem AtomicPropp51 is UNSAT
Problem AtomicPropp55 is UNSAT
Problem AtomicPropp56 is UNSAT
Problem AtomicPropp62 is UNSAT
Problem AtomicPropp64 is UNSAT
Problem AtomicPropp65 is UNSAT
Problem AtomicPropp67 is UNSAT
Problem AtomicPropp69 is UNSAT
Problem AtomicPropp70 is UNSAT
Problem AtomicPropp71 is UNSAT
Problem AtomicPropp72 is UNSAT
Problem AtomicPropp74 is UNSAT
Problem AtomicPropp75 is UNSAT
Problem AtomicPropp78 is UNSAT
Problem AtomicPropp79 is UNSAT
Problem AtomicPropp81 is UNSAT
Problem AtomicPropp83 is UNSAT
Problem AtomicPropp84 is UNSAT
Problem AtomicPropp86 is UNSAT
Problem AtomicPropp88 is UNSAT
Problem AtomicPropp89 is UNSAT
At refinement iteration 4 (OVERLAPS) 258/682 variables, 33/46 constraints. Problems are: Problem set: 66 solved, 4 unsolved
[2024-06-01 14:47:01] [INFO ] Deduced a trap composed of 74 places in 509 ms of which 5 ms to minimize.
[2024-06-01 14:47:01] [INFO ] Deduced a trap composed of 74 places in 506 ms of which 6 ms to minimize.
[2024-06-01 14:47:02] [INFO ] Deduced a trap composed of 74 places in 467 ms of which 5 ms to minimize.
[2024-06-01 14:47:02] [INFO ] Deduced a trap composed of 74 places in 438 ms of which 4 ms to minimize.
[2024-06-01 14:47:03] [INFO ] Deduced a trap composed of 74 places in 477 ms of which 4 ms to minimize.
[2024-06-01 14:47:03] [INFO ] Deduced a trap composed of 74 places in 450 ms of which 4 ms to minimize.
[2024-06-01 14:47:04] [INFO ] Deduced a trap composed of 356 places in 503 ms of which 4 ms to minimize.
[2024-06-01 14:47:04] [INFO ] Deduced a trap composed of 352 places in 411 ms of which 4 ms to minimize.
SMT process timed out in 5734ms, After SMT, problems are : Problem set: 66 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 6 out of 683 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 683/683 places, 1306/1306 transitions.
Ensure Unique test removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 70 transitions
Trivial Post-agglo rules discarded 70 transitions
Performed 70 trivial Post agglomeration. Transition count delta: 70
Iterating post reduction 0 with 72 rules applied. Total rules applied 72 place count 681 transition count 1236
Reduce places removed 70 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 72 rules applied. Total rules applied 144 place count 611 transition count 1234
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 146 place count 609 transition count 1234
Performed 79 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 79 Pre rules applied. Total rules applied 146 place count 609 transition count 1155
Deduced a syphon composed of 79 places in 17 ms
Reduce places removed 79 places and 0 transitions.
Iterating global reduction 3 with 158 rules applied. Total rules applied 304 place count 530 transition count 1155
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 307 place count 527 transition count 1152
Iterating global reduction 3 with 3 rules applied. Total rules applied 310 place count 527 transition count 1152
Performed 61 Post agglomeration using F-continuation condition.Transition count delta: 61
Deduced a syphon composed of 61 places in 2 ms
Reduce places removed 61 places and 0 transitions.
Iterating global reduction 3 with 122 rules applied. Total rules applied 432 place count 466 transition count 1091
Free-agglomeration rule (complex) applied 15 times.
Iterating global reduction 3 with 15 rules applied. Total rules applied 447 place count 466 transition count 1076
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 3 with 15 rules applied. Total rules applied 462 place count 451 transition count 1076
Applied a total of 462 rules in 489 ms. Remains 451 /683 variables (removed 232) and now considering 1076/1306 (removed 230) transitions.
Running 1074 sub problems to find dead transitions.
[2024-06-01 14:47:05] [INFO ] Flow matrix only has 1060 transitions (discarded 16 similar events)
// Phase 1: matrix 1060 rows 451 cols
[2024-06-01 14:47:05] [INFO ] Computed 45 invariants in 24 ms
[2024-06-01 14:47:05] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/449 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1074 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/449 variables, 29/43 constraints. Problems are: Problem set: 0 solved, 1074 unsolved
[2024-06-01 14:47:14] [INFO ] Deduced a trap composed of 46 places in 94 ms of which 2 ms to minimize.
[2024-06-01 14:47:14] [INFO ] Deduced a trap composed of 45 places in 63 ms of which 2 ms to minimize.
[2024-06-01 14:47:14] [INFO ] Deduced a trap composed of 45 places in 59 ms of which 2 ms to minimize.
[2024-06-01 14:47:15] [INFO ] Deduced a trap composed of 45 places in 130 ms of which 1 ms to minimize.
[2024-06-01 14:47:15] [INFO ] Deduced a trap composed of 46 places in 88 ms of which 2 ms to minimize.
[2024-06-01 14:47:15] [INFO ] Deduced a trap composed of 46 places in 48 ms of which 1 ms to minimize.
[2024-06-01 14:47:15] [INFO ] Deduced a trap composed of 44 places in 48 ms of which 1 ms to minimize.
[2024-06-01 14:47:15] [INFO ] Deduced a trap composed of 44 places in 63 ms of which 1 ms to minimize.
[2024-06-01 14:47:16] [INFO ] Deduced a trap composed of 172 places in 300 ms of which 4 ms to minimize.
[2024-06-01 14:47:16] [INFO ] Deduced a trap composed of 146 places in 269 ms of which 4 ms to minimize.
[2024-06-01 14:47:18] [INFO ] Deduced a trap composed of 19 places in 139 ms of which 3 ms to minimize.
[2024-06-01 14:47:19] [INFO ] Deduced a trap composed of 67 places in 242 ms of which 6 ms to minimize.
[2024-06-01 14:47:21] [INFO ] Deduced a trap composed of 35 places in 290 ms of which 4 ms to minimize.
[2024-06-01 14:47:21] [INFO ] Deduced a trap composed of 166 places in 358 ms of which 3 ms to minimize.
[2024-06-01 14:47:22] [INFO ] Deduced a trap composed of 225 places in 293 ms of which 3 ms to minimize.
[2024-06-01 14:47:22] [INFO ] Deduced a trap composed of 164 places in 255 ms of which 3 ms to minimize.
[2024-06-01 14:47:22] [INFO ] Deduced a trap composed of 153 places in 261 ms of which 3 ms to minimize.
[2024-06-01 14:47:24] [INFO ] Deduced a trap composed of 160 places in 332 ms of which 6 ms to minimize.
[2024-06-01 14:47:25] [INFO ] Deduced a trap composed of 194 places in 284 ms of which 3 ms to minimize.
[2024-06-01 14:47:26] [INFO ] Deduced a trap composed of 31 places in 198 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/449 variables, 20/63 constraints. Problems are: Problem set: 0 solved, 1074 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 449/1511 variables, and 63 constraints, problems are : Problem set: 0 solved, 1074 unsolved in 20035 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 29/31 constraints, State Equation: 0/451 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1074/1074 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1074 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/449 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1074 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/449 variables, 29/43 constraints. Problems are: Problem set: 0 solved, 1074 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/449 variables, 20/63 constraints. Problems are: Problem set: 0 solved, 1074 unsolved
[2024-06-01 14:47:46] [INFO ] Deduced a trap composed of 273 places in 336 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 449/1511 variables, and 64 constraints, problems are : Problem set: 0 solved, 1074 unsolved in 20034 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 29/31 constraints, State Equation: 0/451 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1074 constraints, Known Traps: 21/21 constraints]
After SMT, in 42238ms problems are : Problem set: 0 solved, 1074 unsolved
Search for dead transitions found 0 dead transitions in 42335ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42842 ms. Remains : 451/683 places, 1076/1306 transitions.
RANDOM walk for 40000 steps (15 resets) in 1059 ms. (37 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (13 resets) in 506 ms. (78 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (8 resets) in 393 ms. (101 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (10 resets) in 355 ms. (112 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (8 resets) in 289 ms. (137 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 107898 steps, run timeout after 3001 ms. (steps per millisecond=35 ) properties seen :0 out of 4
Probabilistic random walk after 107898 steps, saw 67954 distinct states, run finished after 3018 ms. (steps per millisecond=35 ) properties seen :0
[2024-06-01 14:47:51] [INFO ] Flow matrix only has 1060 transitions (discarded 16 similar events)
[2024-06-01 14:47:51] [INFO ] Invariant cache hit.
[2024-06-01 14:47:51] [INFO ] State equation strengthened by 96 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 36/42 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 374/416 variables, 18/20 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/416 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 11/427 variables, 11/31 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/427 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 22/449 variables, 13/44 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/449 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 1060/1509 variables, 449/493 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1509 variables, 96/589 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1509 variables, 0/589 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 2/1511 variables, 2/591 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1511 variables, 1/592 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1511 variables, 0/592 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 0/1511 variables, 0/592 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1511/1511 variables, and 592 constraints, problems are : Problem set: 0 solved, 4 unsolved in 4210 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 31/31 constraints, State Equation: 451/451 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 36/42 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 374/416 variables, 18/20 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/416 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 11/427 variables, 11/31 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/427 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem AtomicPropp76 is UNSAT
At refinement iteration 7 (OVERLAPS) 22/449 variables, 13/44 constraints. Problems are: Problem set: 1 solved, 3 unsolved
[2024-06-01 14:47:56] [INFO ] Deduced a trap composed of 44 places in 151 ms of which 3 ms to minimize.
[2024-06-01 14:47:56] [INFO ] Deduced a trap composed of 46 places in 127 ms of which 2 ms to minimize.
[2024-06-01 14:47:56] [INFO ] Deduced a trap composed of 45 places in 108 ms of which 1 ms to minimize.
[2024-06-01 14:47:56] [INFO ] Deduced a trap composed of 45 places in 84 ms of which 1 ms to minimize.
[2024-06-01 14:47:56] [INFO ] Deduced a trap composed of 44 places in 62 ms of which 1 ms to minimize.
[2024-06-01 14:47:56] [INFO ] Deduced a trap composed of 46 places in 58 ms of which 2 ms to minimize.
[2024-06-01 14:47:56] [INFO ] Deduced a trap composed of 45 places in 43 ms of which 2 ms to minimize.
Problem AtomicPropp97 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/449 variables, 7/51 constraints. Problems are: Problem set: 2 solved, 2 unsolved
[2024-06-01 14:47:57] [INFO ] Deduced a trap composed of 201 places in 278 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/449 variables, 1/52 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/449 variables, 0/52 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 1060/1509 variables, 449/501 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1509 variables, 96/597 constraints. Problems are: Problem set: 2 solved, 2 unsolved
Problem AtomicPropp61 is UNSAT
At refinement iteration 13 (INCLUDED_ONLY) 0/1509 variables, 2/599 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1509 variables, 0/599 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 2/1511 variables, 2/601 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1511 variables, 1/602 constraints. Problems are: Problem set: 3 solved, 1 unsolved
[2024-06-01 14:48:03] [INFO ] Deduced a trap composed of 42 places in 403 ms of which 5 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/1511 variables, 1/603 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1511 variables, 0/603 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/1511 variables, 0/603 constraints. Problems are: Problem set: 3 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1511/1511 variables, and 603 constraints, problems are : Problem set: 3 solved, 1 unsolved in 8374 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 31/31 constraints, State Equation: 451/451 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 2/4 constraints, Known Traps: 9/9 constraints]
After SMT, in 12610ms problems are : Problem set: 3 solved, 1 unsolved
Parikh walk visited 0 properties in 442 ms.
Support contains 1 out of 451 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 451/451 places, 1076/1076 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 451 transition count 1075
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 450 transition count 1075
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 6 place count 448 transition count 1073
Applied a total of 6 rules in 66 ms. Remains 448 /451 variables (removed 3) and now considering 1073/1076 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 67 ms. Remains : 448/451 places, 1073/1076 transitions.
RANDOM walk for 40000 steps (22 resets) in 870 ms. (45 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (10 resets) in 270 ms. (147 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 184292 steps, run timeout after 3001 ms. (steps per millisecond=61 ) properties seen :0 out of 1
Probabilistic random walk after 184292 steps, saw 114307 distinct states, run finished after 3003 ms. (steps per millisecond=61 ) properties seen :0
[2024-06-01 14:48:08] [INFO ] Flow matrix only has 1057 transitions (discarded 16 similar events)
// Phase 1: matrix 1057 rows 448 cols
[2024-06-01 14:48:08] [INFO ] Computed 45 invariants in 25 ms
[2024-06-01 14:48:08] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 258/259 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/259 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 133/392 variables, 11/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 14:48:08] [INFO ] Deduced a trap composed of 40 places in 275 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/392 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/392 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/394 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/394 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 52/446 variables, 29/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/446 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1057/1503 variables, 446/491 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1503 variables, 96/587 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1503 variables, 0/587 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 2/1505 variables, 2/589 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1505 variables, 1/590 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1505 variables, 0/590 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/1505 variables, 0/590 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1505/1505 variables, and 590 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1823 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 32/32 constraints, State Equation: 448/448 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 258/259 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/259 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 133/392 variables, 11/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/392 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/392 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/394 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/394 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 52/446 variables, 29/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 14:48:10] [INFO ] Deduced a trap composed of 45 places in 193 ms of which 2 ms to minimize.
[2024-06-01 14:48:10] [INFO ] Deduced a trap composed of 45 places in 128 ms of which 2 ms to minimize.
[2024-06-01 14:48:10] [INFO ] Deduced a trap composed of 44 places in 100 ms of which 4 ms to minimize.
[2024-06-01 14:48:10] [INFO ] Deduced a trap composed of 45 places in 108 ms of which 1 ms to minimize.
[2024-06-01 14:48:10] [INFO ] Deduced a trap composed of 45 places in 105 ms of which 2 ms to minimize.
[2024-06-01 14:48:10] [INFO ] Deduced a trap composed of 44 places in 55 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/446 variables, 6/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/446 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1057/1503 variables, 446/497 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1503 variables, 96/593 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1503 variables, 1/594 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1503 variables, 0/594 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 2/1505 variables, 2/596 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1505 variables, 1/597 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 14:48:13] [INFO ] Deduced a trap composed of 19 places in 289 ms of which 4 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/1505 variables, 1/598 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1505 variables, 0/598 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/1505 variables, 0/598 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1505/1505 variables, and 598 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3697 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 32/32 constraints, State Equation: 448/448 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 8/8 constraints]
After SMT, in 5570ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 50 ms.
Support contains 1 out of 448 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 448/448 places, 1073/1073 transitions.
Applied a total of 0 rules in 56 ms. Remains 448 /448 variables (removed 0) and now considering 1073/1073 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 58 ms. Remains : 448/448 places, 1073/1073 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 448/448 places, 1073/1073 transitions.
Applied a total of 0 rules in 52 ms. Remains 448 /448 variables (removed 0) and now considering 1073/1073 (removed 0) transitions.
[2024-06-01 14:48:13] [INFO ] Flow matrix only has 1057 transitions (discarded 16 similar events)
[2024-06-01 14:48:13] [INFO ] Invariant cache hit.
[2024-06-01 14:48:15] [INFO ] Implicit Places using invariants in 1394 ms returned [378]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1411 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 447/448 places, 1073/1073 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 446 transition count 1072
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 446 transition count 1072
Applied a total of 2 rules in 49 ms. Remains 446 /447 variables (removed 1) and now considering 1072/1073 (removed 1) transitions.
[2024-06-01 14:48:15] [INFO ] Flow matrix only has 1056 transitions (discarded 16 similar events)
// Phase 1: matrix 1056 rows 446 cols
[2024-06-01 14:48:15] [INFO ] Computed 44 invariants in 14 ms
[2024-06-01 14:48:16] [INFO ] Implicit Places using invariants in 949 ms returned []
[2024-06-01 14:48:16] [INFO ] Flow matrix only has 1056 transitions (discarded 16 similar events)
[2024-06-01 14:48:16] [INFO ] Invariant cache hit.
[2024-06-01 14:48:17] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-06-01 14:48:26] [INFO ] Implicit Places using invariants and state equation in 10245 ms returned []
Implicit Place search using SMT with State Equation took 11228 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 446/448 places, 1072/1073 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 12744 ms. Remains : 446/448 places, 1072/1073 transitions.
RANDOM walk for 40000 steps (15 resets) in 464 ms. (86 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (9 resets) in 166 ms. (239 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 195205 steps, run timeout after 3001 ms. (steps per millisecond=65 ) properties seen :0 out of 1
Probabilistic random walk after 195205 steps, saw 119876 distinct states, run finished after 3001 ms. (steps per millisecond=65 ) properties seen :0
[2024-06-01 14:48:29] [INFO ] Flow matrix only has 1056 transitions (discarded 16 similar events)
[2024-06-01 14:48:29] [INFO ] Invariant cache hit.
[2024-06-01 14:48:29] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 296/297 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 14:48:29] [INFO ] Deduced a trap composed of 44 places in 135 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/297 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/297 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 81/378 variables, 12/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 14:48:30] [INFO ] Deduced a trap composed of 34 places in 257 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/378 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/378 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 66/444 variables, 28/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/444 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1056/1500 variables, 444/489 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1500 variables, 96/585 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1500 variables, 0/585 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 2/1502 variables, 2/587 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1502 variables, 1/588 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1502 variables, 0/588 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/1502 variables, 0/588 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1502/1502 variables, and 588 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2015 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 31/31 constraints, State Equation: 446/446 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 296/297 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/297 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 14:48:31] [INFO ] Deduced a trap composed of 44 places in 146 ms of which 4 ms to minimize.
[2024-06-01 14:48:32] [INFO ] Deduced a trap composed of 49 places in 161 ms of which 2 ms to minimize.
[2024-06-01 14:48:32] [INFO ] Deduced a trap composed of 49 places in 139 ms of which 2 ms to minimize.
[2024-06-01 14:48:32] [INFO ] Deduced a trap composed of 54 places in 145 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/297 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/297 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 81/378 variables, 12/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/378 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 66/444 variables, 28/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 14:48:32] [INFO ] Deduced a trap composed of 45 places in 109 ms of which 2 ms to minimize.
[2024-06-01 14:48:32] [INFO ] Deduced a trap composed of 44 places in 133 ms of which 1 ms to minimize.
[2024-06-01 14:48:32] [INFO ] Deduced a trap composed of 45 places in 110 ms of which 1 ms to minimize.
[2024-06-01 14:48:32] [INFO ] Deduced a trap composed of 44 places in 82 ms of which 1 ms to minimize.
[2024-06-01 14:48:33] [INFO ] Deduced a trap composed of 44 places in 62 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/444 variables, 5/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/444 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1056/1500 variables, 444/498 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1500 variables, 96/594 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1500 variables, 1/595 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1500 variables, 0/595 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 2/1502 variables, 2/597 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1502 variables, 1/598 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1502 variables, 0/598 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/1502 variables, 0/598 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1502/1502 variables, and 598 constraints, problems are : Problem set: 0 solved, 1 unsolved in 8366 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 31/31 constraints, State Equation: 446/446 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 11/11 constraints]
After SMT, in 10394ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 101 ms.
Support contains 1 out of 446 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 446/446 places, 1072/1072 transitions.
Applied a total of 0 rules in 30 ms. Remains 446 /446 variables (removed 0) and now considering 1072/1072 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31 ms. Remains : 446/446 places, 1072/1072 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 446/446 places, 1072/1072 transitions.
Applied a total of 0 rules in 40 ms. Remains 446 /446 variables (removed 0) and now considering 1072/1072 (removed 0) transitions.
[2024-06-01 14:48:40] [INFO ] Flow matrix only has 1056 transitions (discarded 16 similar events)
[2024-06-01 14:48:40] [INFO ] Invariant cache hit.
[2024-06-01 14:48:40] [INFO ] Implicit Places using invariants in 527 ms returned []
[2024-06-01 14:48:40] [INFO ] Flow matrix only has 1056 transitions (discarded 16 similar events)
[2024-06-01 14:48:40] [INFO ] Invariant cache hit.
[2024-06-01 14:48:41] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-06-01 14:48:49] [INFO ] Implicit Places using invariants and state equation in 8669 ms returned []
Implicit Place search using SMT with State Equation took 9212 ms to find 0 implicit places.
[2024-06-01 14:48:49] [INFO ] Redundant transitions in 64 ms returned []
Running 1070 sub problems to find dead transitions.
[2024-06-01 14:48:49] [INFO ] Flow matrix only has 1056 transitions (discarded 16 similar events)
[2024-06-01 14:48:49] [INFO ] Invariant cache hit.
[2024-06-01 14:48:49] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/444 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1070 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/444 variables, 29/42 constraints. Problems are: Problem set: 0 solved, 1070 unsolved
[2024-06-01 14:49:03] [INFO ] Deduced a trap composed of 45 places in 77 ms of which 1 ms to minimize.
[2024-06-01 14:49:03] [INFO ] Deduced a trap composed of 45 places in 45 ms of which 1 ms to minimize.
[2024-06-01 14:49:03] [INFO ] Deduced a trap composed of 45 places in 42 ms of which 1 ms to minimize.
[2024-06-01 14:49:03] [INFO ] Deduced a trap composed of 45 places in 81 ms of which 2 ms to minimize.
[2024-06-01 14:49:04] [INFO ] Deduced a trap composed of 44 places in 38 ms of which 1 ms to minimize.
[2024-06-01 14:49:04] [INFO ] Deduced a trap composed of 46 places in 48 ms of which 1 ms to minimize.
[2024-06-01 14:49:04] [INFO ] Deduced a trap composed of 45 places in 37 ms of which 1 ms to minimize.
[2024-06-01 14:49:04] [INFO ] Deduced a trap composed of 44 places in 79 ms of which 1 ms to minimize.
[2024-06-01 14:49:04] [INFO ] Deduced a trap composed of 150 places in 318 ms of which 4 ms to minimize.
[2024-06-01 14:49:05] [INFO ] Deduced a trap composed of 152 places in 340 ms of which 5 ms to minimize.
[2024-06-01 14:49:07] [INFO ] Deduced a trap composed of 64 places in 271 ms of which 2 ms to minimize.
[2024-06-01 14:49:09] [INFO ] Deduced a trap composed of 273 places in 258 ms of which 4 ms to minimize.
[2024-06-01 14:49:09] [INFO ] Deduced a trap composed of 285 places in 233 ms of which 3 ms to minimize.
[2024-06-01 14:49:11] [INFO ] Deduced a trap composed of 19 places in 231 ms of which 3 ms to minimize.
[2024-06-01 14:49:13] [INFO ] Deduced a trap composed of 177 places in 312 ms of which 5 ms to minimize.
[2024-06-01 14:49:13] [INFO ] Deduced a trap composed of 188 places in 269 ms of which 3 ms to minimize.
[2024-06-01 14:49:14] [INFO ] Deduced a trap composed of 181 places in 309 ms of which 4 ms to minimize.
[2024-06-01 14:49:15] [INFO ] Deduced a trap composed of 203 places in 305 ms of which 4 ms to minimize.
[2024-06-01 14:49:16] [INFO ] Deduced a trap composed of 192 places in 269 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/444 variables, 19/61 constraints. Problems are: Problem set: 0 solved, 1070 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 444/1502 variables, and 61 constraints, problems are : Problem set: 0 solved, 1070 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 29/31 constraints, State Equation: 0/446 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1070/1070 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1070 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/444 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1070 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/444 variables, 29/42 constraints. Problems are: Problem set: 0 solved, 1070 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/444 variables, 19/61 constraints. Problems are: Problem set: 0 solved, 1070 unsolved
[2024-06-01 14:49:27] [INFO ] Deduced a trap composed of 55 places in 179 ms of which 3 ms to minimize.
[2024-06-01 14:49:39] [INFO ] Deduced a trap composed of 196 places in 193 ms of which 3 ms to minimize.
[2024-06-01 14:49:42] [INFO ] Deduced a trap composed of 165 places in 275 ms of which 3 ms to minimize.
[2024-06-01 14:49:42] [INFO ] Deduced a trap composed of 204 places in 337 ms of which 4 ms to minimize.
[2024-06-01 14:49:43] [INFO ] Deduced a trap composed of 211 places in 263 ms of which 4 ms to minimize.
[2024-06-01 14:49:43] [INFO ] Deduced a trap composed of 188 places in 343 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/444 variables, 6/67 constraints. Problems are: Problem set: 0 solved, 1070 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 444/1502 variables, and 67 constraints, problems are : Problem set: 0 solved, 1070 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 29/31 constraints, State Equation: 0/446 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1070 constraints, Known Traps: 25/25 constraints]
After SMT, in 62397ms problems are : Problem set: 0 solved, 1070 unsolved
Search for dead transitions found 0 dead transitions in 62410ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 71763 ms. Remains : 446/446 places, 1072/1072 transitions.
Successfully simplified 69 atomic propositions for a total of 16 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA PolyORBLF-PT-S02J06T08-CTLCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S02J06T08-CTLCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S02J06T08-CTLCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S02J06T08-CTLCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S02J06T08-CTLCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S02J06T08-CTLCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 14:49:52] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2024-06-01 14:49:52] [INFO ] Flatten gal took : 145 ms
FORMULA PolyORBLF-PT-S02J06T08-CTLCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S02J06T08-CTLCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S02J06T08-CTLCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 14:49:52] [INFO ] Flatten gal took : 119 ms
[2024-06-01 14:49:52] [INFO ] Input system was already deterministic with 1306 transitions.
Support contains 49 out of 683 places (down from 122) after GAL structural reductions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 683/683 places, 1306/1306 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 681 transition count 1306
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 10 place count 673 transition count 1298
Iterating global reduction 1 with 8 rules applied. Total rules applied 18 place count 673 transition count 1298
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 26 place count 665 transition count 1290
Iterating global reduction 1 with 8 rules applied. Total rules applied 34 place count 665 transition count 1290
Applied a total of 34 rules in 75 ms. Remains 665 /683 variables (removed 18) and now considering 1290/1306 (removed 16) transitions.
Running 1288 sub problems to find dead transitions.
[2024-06-01 14:49:52] [INFO ] Flow matrix only has 1274 transitions (discarded 16 similar events)
// Phase 1: matrix 1274 rows 665 cols
[2024-06-01 14:49:52] [INFO ] Computed 45 invariants in 39 ms
[2024-06-01 14:49:52] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/663 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/663 variables, 27/43 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
[2024-06-01 14:50:07] [INFO ] Deduced a trap composed of 72 places in 423 ms of which 4 ms to minimize.
[2024-06-01 14:50:08] [INFO ] Deduced a trap composed of 72 places in 336 ms of which 4 ms to minimize.
[2024-06-01 14:50:08] [INFO ] Deduced a trap composed of 162 places in 376 ms of which 4 ms to minimize.
[2024-06-01 14:50:08] [INFO ] Deduced a trap composed of 72 places in 86 ms of which 1 ms to minimize.
[2024-06-01 14:50:08] [INFO ] Deduced a trap composed of 72 places in 73 ms of which 1 ms to minimize.
[2024-06-01 14:50:08] [INFO ] Deduced a trap composed of 72 places in 57 ms of which 1 ms to minimize.
[2024-06-01 14:50:09] [INFO ] Deduced a trap composed of 72 places in 98 ms of which 2 ms to minimize.
[2024-06-01 14:50:09] [INFO ] Deduced a trap composed of 72 places in 44 ms of which 1 ms to minimize.
[2024-06-01 14:50:10] [INFO ] Deduced a trap composed of 72 places in 380 ms of which 6 ms to minimize.
[2024-06-01 14:50:11] [INFO ] Deduced a trap composed of 352 places in 448 ms of which 4 ms to minimize.
[2024-06-01 14:50:11] [INFO ] Deduced a trap composed of 19 places in 357 ms of which 4 ms to minimize.
[2024-06-01 14:50:12] [INFO ] Deduced a trap composed of 353 places in 358 ms of which 4 ms to minimize.
[2024-06-01 14:50:12] [INFO ] Deduced a trap composed of 326 places in 390 ms of which 20 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 663/1939 variables, and 56 constraints, problems are : Problem set: 0 solved, 1288 unsolved in 20059 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 27/29 constraints, State Equation: 0/665 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1288/1288 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1288 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/663 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/663 variables, 27/43 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/663 variables, 13/56 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 663/1939 variables, and 56 constraints, problems are : Problem set: 0 solved, 1288 unsolved in 20034 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 27/29 constraints, State Equation: 0/665 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1288 constraints, Known Traps: 13/13 constraints]
After SMT, in 42291ms problems are : Problem set: 0 solved, 1288 unsolved
Search for dead transitions found 0 dead transitions in 42323ms
Finished structural reductions in LTL mode , in 1 iterations and 42403 ms. Remains : 665/683 places, 1290/1306 transitions.
[2024-06-01 14:50:35] [INFO ] Flatten gal took : 46 ms
[2024-06-01 14:50:35] [INFO ] Flatten gal took : 41 ms
[2024-06-01 14:50:35] [INFO ] Input system was already deterministic with 1290 transitions.
Starting structural reductions in LTL mode, iteration 0 : 683/683 places, 1306/1306 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 681 transition count 1306
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 10 place count 673 transition count 1298
Iterating global reduction 1 with 8 rules applied. Total rules applied 18 place count 673 transition count 1298
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 26 place count 665 transition count 1290
Iterating global reduction 1 with 8 rules applied. Total rules applied 34 place count 665 transition count 1290
Applied a total of 34 rules in 71 ms. Remains 665 /683 variables (removed 18) and now considering 1290/1306 (removed 16) transitions.
Running 1288 sub problems to find dead transitions.
[2024-06-01 14:50:35] [INFO ] Flow matrix only has 1274 transitions (discarded 16 similar events)
[2024-06-01 14:50:35] [INFO ] Invariant cache hit.
[2024-06-01 14:50:35] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/663 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/663 variables, 27/43 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
[2024-06-01 14:50:51] [INFO ] Deduced a trap composed of 72 places in 475 ms of which 6 ms to minimize.
[2024-06-01 14:50:51] [INFO ] Deduced a trap composed of 162 places in 342 ms of which 4 ms to minimize.
[2024-06-01 14:50:51] [INFO ] Deduced a trap composed of 72 places in 87 ms of which 1 ms to minimize.
[2024-06-01 14:50:51] [INFO ] Deduced a trap composed of 72 places in 97 ms of which 2 ms to minimize.
[2024-06-01 14:50:51] [INFO ] Deduced a trap composed of 72 places in 59 ms of which 1 ms to minimize.
[2024-06-01 14:50:52] [INFO ] Deduced a trap composed of 72 places in 78 ms of which 1 ms to minimize.
[2024-06-01 14:50:52] [INFO ] Deduced a trap composed of 72 places in 73 ms of which 1 ms to minimize.
[2024-06-01 14:50:52] [INFO ] Deduced a trap composed of 72 places in 75 ms of which 0 ms to minimize.
[2024-06-01 14:50:53] [INFO ] Deduced a trap composed of 72 places in 454 ms of which 5 ms to minimize.
[2024-06-01 14:50:53] [INFO ] Deduced a trap composed of 326 places in 395 ms of which 5 ms to minimize.
[2024-06-01 14:50:55] [INFO ] Deduced a trap composed of 114 places in 363 ms of which 5 ms to minimize.
[2024-06-01 14:50:55] [INFO ] Deduced a trap composed of 330 places in 412 ms of which 5 ms to minimize.
[2024-06-01 14:50:56] [INFO ] Deduced a trap composed of 346 places in 378 ms of which 5 ms to minimize.
[2024-06-01 14:50:56] [INFO ] Deduced a trap composed of 382 places in 371 ms of which 5 ms to minimize.
[2024-06-01 14:50:56] [INFO ] Deduced a trap composed of 343 places in 356 ms of which 5 ms to minimize.
[2024-06-01 14:50:57] [INFO ] Deduced a trap composed of 337 places in 385 ms of which 5 ms to minimize.
SMT process timed out in 22047ms, After SMT, problems are : Problem set: 0 solved, 1288 unsolved
Search for dead transitions found 0 dead transitions in 22073ms
Finished structural reductions in LTL mode , in 1 iterations and 22148 ms. Remains : 665/683 places, 1290/1306 transitions.
[2024-06-01 14:50:57] [INFO ] Flatten gal took : 56 ms
[2024-06-01 14:50:57] [INFO ] Flatten gal took : 62 ms
[2024-06-01 14:50:57] [INFO ] Input system was already deterministic with 1290 transitions.
Starting structural reductions in LTL mode, iteration 0 : 683/683 places, 1306/1306 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 681 transition count 1306
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 10 place count 673 transition count 1298
Iterating global reduction 1 with 8 rules applied. Total rules applied 18 place count 673 transition count 1298
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 26 place count 665 transition count 1290
Iterating global reduction 1 with 8 rules applied. Total rules applied 34 place count 665 transition count 1290
Applied a total of 34 rules in 35 ms. Remains 665 /683 variables (removed 18) and now considering 1290/1306 (removed 16) transitions.
Running 1288 sub problems to find dead transitions.
[2024-06-01 14:50:57] [INFO ] Flow matrix only has 1274 transitions (discarded 16 similar events)
[2024-06-01 14:50:57] [INFO ] Invariant cache hit.
[2024-06-01 14:50:57] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/663 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/663 variables, 27/43 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
[2024-06-01 14:51:11] [INFO ] Deduced a trap composed of 72 places in 366 ms of which 5 ms to minimize.
[2024-06-01 14:51:11] [INFO ] Deduced a trap composed of 162 places in 337 ms of which 4 ms to minimize.
[2024-06-01 14:51:11] [INFO ] Deduced a trap composed of 72 places in 101 ms of which 2 ms to minimize.
[2024-06-01 14:51:11] [INFO ] Deduced a trap composed of 72 places in 91 ms of which 2 ms to minimize.
[2024-06-01 14:51:11] [INFO ] Deduced a trap composed of 72 places in 63 ms of which 1 ms to minimize.
[2024-06-01 14:51:11] [INFO ] Deduced a trap composed of 72 places in 66 ms of which 1 ms to minimize.
[2024-06-01 14:51:12] [INFO ] Deduced a trap composed of 72 places in 72 ms of which 1 ms to minimize.
[2024-06-01 14:51:12] [INFO ] Deduced a trap composed of 72 places in 73 ms of which 1 ms to minimize.
[2024-06-01 14:51:13] [INFO ] Deduced a trap composed of 72 places in 393 ms of which 4 ms to minimize.
[2024-06-01 14:51:13] [INFO ] Deduced a trap composed of 326 places in 347 ms of which 4 ms to minimize.
[2024-06-01 14:51:15] [INFO ] Deduced a trap composed of 114 places in 357 ms of which 5 ms to minimize.
[2024-06-01 14:51:15] [INFO ] Deduced a trap composed of 330 places in 375 ms of which 5 ms to minimize.
[2024-06-01 14:51:16] [INFO ] Deduced a trap composed of 346 places in 623 ms of which 7 ms to minimize.
[2024-06-01 14:51:16] [INFO ] Deduced a trap composed of 382 places in 381 ms of which 20 ms to minimize.
[2024-06-01 14:51:17] [INFO ] Deduced a trap composed of 343 places in 546 ms of which 20 ms to minimize.
[2024-06-01 14:51:17] [INFO ] Deduced a trap composed of 337 places in 459 ms of which 5 ms to minimize.
[2024-06-01 14:51:18] [INFO ] Deduced a trap composed of 343 places in 375 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 663/1939 variables, and 60 constraints, problems are : Problem set: 0 solved, 1288 unsolved in 20036 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 27/29 constraints, State Equation: 0/665 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1288/1288 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1288 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/663 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/663 variables, 27/43 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/663 variables, 17/60 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 663/1939 variables, and 60 constraints, problems are : Problem set: 0 solved, 1288 unsolved in 20056 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 27/29 constraints, State Equation: 0/665 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1288 constraints, Known Traps: 17/17 constraints]
After SMT, in 41927ms problems are : Problem set: 0 solved, 1288 unsolved
Search for dead transitions found 0 dead transitions in 41944ms
Finished structural reductions in LTL mode , in 1 iterations and 41984 ms. Remains : 665/683 places, 1290/1306 transitions.
[2024-06-01 14:51:39] [INFO ] Flatten gal took : 58 ms
[2024-06-01 14:51:39] [INFO ] Flatten gal took : 52 ms
[2024-06-01 14:51:39] [INFO ] Input system was already deterministic with 1290 transitions.
Starting structural reductions in LTL mode, iteration 0 : 683/683 places, 1306/1306 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 681 transition count 1306
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 10 place count 673 transition count 1298
Iterating global reduction 1 with 8 rules applied. Total rules applied 18 place count 673 transition count 1298
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 26 place count 665 transition count 1290
Iterating global reduction 1 with 8 rules applied. Total rules applied 34 place count 665 transition count 1290
Applied a total of 34 rules in 33 ms. Remains 665 /683 variables (removed 18) and now considering 1290/1306 (removed 16) transitions.
Running 1288 sub problems to find dead transitions.
[2024-06-01 14:51:39] [INFO ] Flow matrix only has 1274 transitions (discarded 16 similar events)
[2024-06-01 14:51:39] [INFO ] Invariant cache hit.
[2024-06-01 14:51:39] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/663 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/663 variables, 27/43 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
[2024-06-01 14:51:54] [INFO ] Deduced a trap composed of 72 places in 473 ms of which 4 ms to minimize.
[2024-06-01 14:51:54] [INFO ] Deduced a trap composed of 162 places in 401 ms of which 4 ms to minimize.
[2024-06-01 14:51:55] [INFO ] Deduced a trap composed of 72 places in 91 ms of which 1 ms to minimize.
[2024-06-01 14:51:55] [INFO ] Deduced a trap composed of 72 places in 115 ms of which 1 ms to minimize.
[2024-06-01 14:51:55] [INFO ] Deduced a trap composed of 72 places in 61 ms of which 1 ms to minimize.
[2024-06-01 14:51:55] [INFO ] Deduced a trap composed of 72 places in 45 ms of which 0 ms to minimize.
[2024-06-01 14:51:55] [INFO ] Deduced a trap composed of 72 places in 45 ms of which 0 ms to minimize.
[2024-06-01 14:51:55] [INFO ] Deduced a trap composed of 72 places in 67 ms of which 1 ms to minimize.
[2024-06-01 14:51:56] [INFO ] Deduced a trap composed of 72 places in 403 ms of which 7 ms to minimize.
[2024-06-01 14:51:57] [INFO ] Deduced a trap composed of 326 places in 544 ms of which 5 ms to minimize.
[2024-06-01 14:51:58] [INFO ] Deduced a trap composed of 114 places in 416 ms of which 5 ms to minimize.
[2024-06-01 14:51:59] [INFO ] Deduced a trap composed of 330 places in 396 ms of which 3 ms to minimize.
[2024-06-01 14:51:59] [INFO ] Deduced a trap composed of 346 places in 368 ms of which 5 ms to minimize.
[2024-06-01 14:51:59] [INFO ] Deduced a trap composed of 382 places in 336 ms of which 4 ms to minimize.
[2024-06-01 14:52:00] [INFO ] Deduced a trap composed of 343 places in 358 ms of which 5 ms to minimize.
[2024-06-01 14:52:00] [INFO ] Deduced a trap composed of 337 places in 409 ms of which 5 ms to minimize.
[2024-06-01 14:52:01] [INFO ] Deduced a trap composed of 343 places in 373 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 663/1939 variables, and 60 constraints, problems are : Problem set: 0 solved, 1288 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 27/29 constraints, State Equation: 0/665 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1288/1288 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1288 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/663 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/663 variables, 27/43 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/663 variables, 17/60 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 663/1939 variables, and 60 constraints, problems are : Problem set: 0 solved, 1288 unsolved in 20050 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 27/29 constraints, State Equation: 0/665 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1288 constraints, Known Traps: 17/17 constraints]
After SMT, in 41831ms problems are : Problem set: 0 solved, 1288 unsolved
Search for dead transitions found 0 dead transitions in 41844ms
Finished structural reductions in LTL mode , in 1 iterations and 41884 ms. Remains : 665/683 places, 1290/1306 transitions.
[2024-06-01 14:52:21] [INFO ] Flatten gal took : 50 ms
[2024-06-01 14:52:21] [INFO ] Flatten gal took : 66 ms
[2024-06-01 14:52:22] [INFO ] Input system was already deterministic with 1290 transitions.
Starting structural reductions in LTL mode, iteration 0 : 683/683 places, 1306/1306 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 681 transition count 1306
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 10 place count 673 transition count 1298
Iterating global reduction 1 with 8 rules applied. Total rules applied 18 place count 673 transition count 1298
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 26 place count 665 transition count 1290
Iterating global reduction 1 with 8 rules applied. Total rules applied 34 place count 665 transition count 1290
Applied a total of 34 rules in 49 ms. Remains 665 /683 variables (removed 18) and now considering 1290/1306 (removed 16) transitions.
Running 1288 sub problems to find dead transitions.
[2024-06-01 14:52:22] [INFO ] Flow matrix only has 1274 transitions (discarded 16 similar events)
[2024-06-01 14:52:22] [INFO ] Invariant cache hit.
[2024-06-01 14:52:22] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/663 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/663 variables, 27/43 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
[2024-06-01 14:52:38] [INFO ] Deduced a trap composed of 72 places in 463 ms of which 9 ms to minimize.
[2024-06-01 14:52:38] [INFO ] Deduced a trap composed of 162 places in 508 ms of which 8 ms to minimize.
[2024-06-01 14:52:38] [INFO ] Deduced a trap composed of 72 places in 120 ms of which 1 ms to minimize.
[2024-06-01 14:52:39] [INFO ] Deduced a trap composed of 72 places in 379 ms of which 1 ms to minimize.
[2024-06-01 14:52:39] [INFO ] Deduced a trap composed of 72 places in 78 ms of which 1 ms to minimize.
[2024-06-01 14:52:39] [INFO ] Deduced a trap composed of 72 places in 74 ms of which 1 ms to minimize.
[2024-06-01 14:52:40] [INFO ] Deduced a trap composed of 72 places in 74 ms of which 1 ms to minimize.
[2024-06-01 14:52:40] [INFO ] Deduced a trap composed of 72 places in 100 ms of which 1 ms to minimize.
[2024-06-01 14:52:41] [INFO ] Deduced a trap composed of 72 places in 495 ms of which 6 ms to minimize.
[2024-06-01 14:52:42] [INFO ] Deduced a trap composed of 326 places in 406 ms of which 4 ms to minimize.
[2024-06-01 14:52:43] [INFO ] Deduced a trap composed of 114 places in 396 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 663/1939 variables, and 54 constraints, problems are : Problem set: 0 solved, 1288 unsolved in 20045 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 27/29 constraints, State Equation: 0/665 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1288/1288 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1288 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/663 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/663 variables, 27/43 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/663 variables, 11/54 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
[2024-06-01 14:53:04] [INFO ] Deduced a trap composed of 54 places in 658 ms of which 6 ms to minimize.
SMT process timed out in 42349ms, After SMT, problems are : Problem set: 0 solved, 1288 unsolved
Search for dead transitions found 0 dead transitions in 42362ms
Finished structural reductions in LTL mode , in 1 iterations and 42427 ms. Remains : 665/683 places, 1290/1306 transitions.
[2024-06-01 14:53:04] [INFO ] Flatten gal took : 67 ms
[2024-06-01 14:53:04] [INFO ] Flatten gal took : 74 ms
[2024-06-01 14:53:04] [INFO ] Input system was already deterministic with 1290 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 683/683 places, 1306/1306 transitions.
Ensure Unique test removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 72 transitions
Trivial Post-agglo rules discarded 72 transitions
Performed 72 trivial Post agglomeration. Transition count delta: 72
Iterating post reduction 0 with 72 rules applied. Total rules applied 72 place count 681 transition count 1234
Reduce places removed 72 places and 0 transitions.
Iterating post reduction 1 with 72 rules applied. Total rules applied 144 place count 609 transition count 1234
Performed 80 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 80 Pre rules applied. Total rules applied 144 place count 609 transition count 1154
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 304 place count 529 transition count 1154
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 307 place count 526 transition count 1151
Iterating global reduction 2 with 3 rules applied. Total rules applied 310 place count 526 transition count 1151
Performed 64 Post agglomeration using F-continuation condition.Transition count delta: 64
Deduced a syphon composed of 64 places in 1 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 2 with 128 rules applied. Total rules applied 438 place count 462 transition count 1087
Applied a total of 438 rules in 145 ms. Remains 462 /683 variables (removed 221) and now considering 1087/1306 (removed 219) transitions.
Running 1085 sub problems to find dead transitions.
[2024-06-01 14:53:04] [INFO ] Flow matrix only has 1071 transitions (discarded 16 similar events)
// Phase 1: matrix 1071 rows 462 cols
[2024-06-01 14:53:04] [INFO ] Computed 45 invariants in 16 ms
[2024-06-01 14:53:04] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/460 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1085 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/460 variables, 29/43 constraints. Problems are: Problem set: 0 solved, 1085 unsolved
[2024-06-01 14:53:16] [INFO ] Deduced a trap composed of 46 places in 140 ms of which 2 ms to minimize.
[2024-06-01 14:53:16] [INFO ] Deduced a trap composed of 47 places in 118 ms of which 1 ms to minimize.
[2024-06-01 14:53:16] [INFO ] Deduced a trap composed of 46 places in 72 ms of which 1 ms to minimize.
[2024-06-01 14:53:16] [INFO ] Deduced a trap composed of 47 places in 73 ms of which 1 ms to minimize.
[2024-06-01 14:53:16] [INFO ] Deduced a trap composed of 46 places in 74 ms of which 1 ms to minimize.
[2024-06-01 14:53:16] [INFO ] Deduced a trap composed of 46 places in 74 ms of which 1 ms to minimize.
[2024-06-01 14:53:16] [INFO ] Deduced a trap composed of 47 places in 132 ms of which 1 ms to minimize.
[2024-06-01 14:53:17] [INFO ] Deduced a trap composed of 158 places in 366 ms of which 5 ms to minimize.
[2024-06-01 14:53:18] [INFO ] Deduced a trap composed of 151 places in 328 ms of which 5 ms to minimize.
[2024-06-01 14:53:18] [INFO ] Deduced a trap composed of 31 places in 261 ms of which 2 ms to minimize.
[2024-06-01 14:53:18] [INFO ] Deduced a trap composed of 47 places in 501 ms of which 7 ms to minimize.
[2024-06-01 14:53:19] [INFO ] Deduced a trap composed of 73 places in 278 ms of which 3 ms to minimize.
[2024-06-01 14:53:24] [INFO ] Deduced a trap composed of 19 places in 203 ms of which 3 ms to minimize.
[2024-06-01 14:53:26] [INFO ] Deduced a trap composed of 205 places in 246 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 460/1533 variables, and 57 constraints, problems are : Problem set: 0 solved, 1085 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 29/31 constraints, State Equation: 0/462 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1085/1085 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1085 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/460 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1085 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/460 variables, 29/43 constraints. Problems are: Problem set: 0 solved, 1085 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/460 variables, 14/57 constraints. Problems are: Problem set: 0 solved, 1085 unsolved
[2024-06-01 14:53:40] [INFO ] Deduced a trap composed of 289 places in 277 ms of which 4 ms to minimize.
[2024-06-01 14:53:40] [INFO ] Deduced a trap composed of 287 places in 287 ms of which 5 ms to minimize.
[2024-06-01 14:53:43] [INFO ] Deduced a trap composed of 285 places in 284 ms of which 3 ms to minimize.
[2024-06-01 14:53:43] [INFO ] Deduced a trap composed of 297 places in 257 ms of which 4 ms to minimize.
[2024-06-01 14:53:46] [INFO ] Deduced a trap composed of 216 places in 282 ms of which 5 ms to minimize.
SMT process timed out in 41724ms, After SMT, problems are : Problem set: 0 solved, 1085 unsolved
Search for dead transitions found 0 dead transitions in 41737ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 41886 ms. Remains : 462/683 places, 1087/1306 transitions.
[2024-06-01 14:53:46] [INFO ] Flatten gal took : 57 ms
[2024-06-01 14:53:46] [INFO ] Flatten gal took : 32 ms
[2024-06-01 14:53:46] [INFO ] Input system was already deterministic with 1087 transitions.
RANDOM walk for 561 steps (1 resets) in 10 ms. (51 steps per ms) remains 0/1 properties
FORMULA PolyORBLF-PT-S02J06T08-CTLCardinality-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in SI_CTL mode, iteration 0 : 683/683 places, 1306/1306 transitions.
Ensure Unique test removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 69 transitions
Trivial Post-agglo rules discarded 69 transitions
Performed 69 trivial Post agglomeration. Transition count delta: 69
Iterating post reduction 0 with 69 rules applied. Total rules applied 69 place count 681 transition count 1237
Reduce places removed 69 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 70 rules applied. Total rules applied 139 place count 612 transition count 1236
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 140 place count 611 transition count 1236
Performed 80 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 80 Pre rules applied. Total rules applied 140 place count 611 transition count 1156
Deduced a syphon composed of 80 places in 1 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 3 with 160 rules applied. Total rules applied 300 place count 531 transition count 1156
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 303 place count 528 transition count 1153
Iterating global reduction 3 with 3 rules applied. Total rules applied 306 place count 528 transition count 1153
Performed 63 Post agglomeration using F-continuation condition.Transition count delta: 63
Deduced a syphon composed of 63 places in 0 ms
Reduce places removed 63 places and 0 transitions.
Iterating global reduction 3 with 126 rules applied. Total rules applied 432 place count 465 transition count 1090
Applied a total of 432 rules in 88 ms. Remains 465 /683 variables (removed 218) and now considering 1090/1306 (removed 216) transitions.
Running 1088 sub problems to find dead transitions.
[2024-06-01 14:53:46] [INFO ] Flow matrix only has 1074 transitions (discarded 16 similar events)
// Phase 1: matrix 1074 rows 465 cols
[2024-06-01 14:53:46] [INFO ] Computed 45 invariants in 32 ms
[2024-06-01 14:53:47] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/463 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1088 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/463 variables, 27/43 constraints. Problems are: Problem set: 0 solved, 1088 unsolved
[2024-06-01 14:53:57] [INFO ] Deduced a trap composed of 46 places in 101 ms of which 2 ms to minimize.
[2024-06-01 14:53:57] [INFO ] Deduced a trap composed of 46 places in 73 ms of which 1 ms to minimize.
[2024-06-01 14:53:57] [INFO ] Deduced a trap composed of 46 places in 72 ms of which 1 ms to minimize.
[2024-06-01 14:53:57] [INFO ] Deduced a trap composed of 48 places in 69 ms of which 2 ms to minimize.
[2024-06-01 14:53:57] [INFO ] Deduced a trap composed of 47 places in 77 ms of which 1 ms to minimize.
[2024-06-01 14:53:57] [INFO ] Deduced a trap composed of 47 places in 58 ms of which 0 ms to minimize.
[2024-06-01 14:53:57] [INFO ] Deduced a trap composed of 49 places in 66 ms of which 1 ms to minimize.
[2024-06-01 14:53:58] [INFO ] Deduced a trap composed of 73 places in 183 ms of which 2 ms to minimize.
[2024-06-01 14:53:58] [INFO ] Deduced a trap composed of 47 places in 63 ms of which 1 ms to minimize.
[2024-06-01 14:53:58] [INFO ] Deduced a trap composed of 182 places in 345 ms of which 6 ms to minimize.
[2024-06-01 14:53:59] [INFO ] Deduced a trap composed of 161 places in 310 ms of which 3 ms to minimize.
[2024-06-01 14:53:59] [INFO ] Deduced a trap composed of 104 places in 332 ms of which 3 ms to minimize.
[2024-06-01 14:54:00] [INFO ] Deduced a trap composed of 202 places in 349 ms of which 4 ms to minimize.
[2024-06-01 14:54:00] [INFO ] Deduced a trap composed of 171 places in 368 ms of which 5 ms to minimize.
[2024-06-01 14:54:01] [INFO ] Deduced a trap composed of 56 places in 234 ms of which 6 ms to minimize.
[2024-06-01 14:54:02] [INFO ] Deduced a trap composed of 96 places in 277 ms of which 4 ms to minimize.
[2024-06-01 14:54:05] [INFO ] Deduced a trap composed of 303 places in 314 ms of which 3 ms to minimize.
[2024-06-01 14:54:06] [INFO ] Deduced a trap composed of 19 places in 238 ms of which 5 ms to minimize.
[2024-06-01 14:54:08] [INFO ] Deduced a trap composed of 169 places in 276 ms of which 3 ms to minimize.
[2024-06-01 14:54:09] [INFO ] Deduced a trap composed of 136 places in 912 ms of which 3 ms to minimize.
SMT process timed out in 22803ms, After SMT, problems are : Problem set: 0 solved, 1088 unsolved
Search for dead transitions found 0 dead transitions in 22815ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 22906 ms. Remains : 465/683 places, 1090/1306 transitions.
[2024-06-01 14:54:09] [INFO ] Flatten gal took : 41 ms
[2024-06-01 14:54:09] [INFO ] Flatten gal took : 44 ms
[2024-06-01 14:54:09] [INFO ] Input system was already deterministic with 1090 transitions.
RANDOM walk for 776 steps (0 resets) in 21 ms. (35 steps per ms) remains 0/1 properties
FORMULA PolyORBLF-PT-S02J06T08-CTLCardinality-2024-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2024-06-01 14:54:10] [INFO ] Flatten gal took : 81 ms
[2024-06-01 14:54:10] [INFO ] Flatten gal took : 63 ms
[2024-06-01 14:54:10] [INFO ] Export to MCC of 5 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 14 ms.
[2024-06-01 14:54:10] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 683 places, 1306 transitions and 5654 arcs took 23 ms.
Total runtime 479487 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-S02J06T08-CTLCardinality-2024-00
Could not compute solution for formula : PolyORBLF-PT-S02J06T08-CTLCardinality-2024-01
Could not compute solution for formula : PolyORBLF-PT-S02J06T08-CTLCardinality-2024-05
Could not compute solution for formula : PolyORBLF-PT-S02J06T08-CTLCardinality-2024-06
Could not compute solution for formula : PolyORBLF-PT-S02J06T08-CTLCardinality-2024-10

BK_STOP 1717253650576

--------------------
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:
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLCardinality -timeout 360 -rebuildPNML
mcc2024
ctl formula name PolyORBLF-PT-S02J06T08-CTLCardinality-2024-00
ctl formula formula --ctl=/tmp/1306/ctl_0_
ctl formula name PolyORBLF-PT-S02J06T08-CTLCardinality-2024-01
ctl formula formula --ctl=/tmp/1306/ctl_1_
ctl formula name PolyORBLF-PT-S02J06T08-CTLCardinality-2024-05
ctl formula formula --ctl=/tmp/1306/ctl_2_
ctl formula name PolyORBLF-PT-S02J06T08-CTLCardinality-2024-06
ctl formula formula --ctl=/tmp/1306/ctl_3_
ctl formula name PolyORBLF-PT-S02J06T08-CTLCardinality-2024-10
ctl formula formula --ctl=/tmp/1306/ctl_4_
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-S02J06T08"
export BK_EXAMINATION="CTLCardinality"
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-S02J06T08, examination is CTLCardinality"
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-171654446700249"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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