Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r179-tall-171640601100257.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is FunctionPointer-PT-b064, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r179-tall-171640601100257
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 896K
-rw-r--r-- 1 mcc users 6.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K May 19 07:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 19 15:55 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:18 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 18:24 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 159K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 11 15:58 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 97K Apr 11 15:58 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 19 07:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 19 15:26 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 391K May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716432702189

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FunctionPointer-PT-b064
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-23 02:51:43] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-23 02:51:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 02:51:43] [INFO ] Load time of PNML (sax parser for PT used): 111 ms
[2024-05-23 02:51:43] [INFO ] Transformed 306 places.
[2024-05-23 02:51:43] [INFO ] Transformed 840 transitions.
[2024-05-23 02:51:43] [INFO ] Parsed PT model containing 306 places and 840 transitions and 3392 arcs in 224 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 15 ms.
Deduced a syphon composed of 84 places in 6 ms
Reduce places removed 84 places and 192 transitions.
FORMULA FunctionPointer-PT-b064-CTLCardinality-2023-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 68 out of 222 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 222/222 places, 648/648 transitions.
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 213 transition count 648
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 27 place count 195 transition count 534
Iterating global reduction 1 with 18 rules applied. Total rules applied 45 place count 195 transition count 534
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 1 with 32 rules applied. Total rules applied 77 place count 195 transition count 502
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 85 place count 187 transition count 486
Iterating global reduction 2 with 8 rules applied. Total rules applied 93 place count 187 transition count 486
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 105 place count 187 transition count 474
Applied a total of 105 rules in 58 ms. Remains 187 /222 variables (removed 35) and now considering 474/648 (removed 174) transitions.
[2024-05-23 02:51:43] [INFO ] Flow matrix only has 322 transitions (discarded 152 similar events)
// Phase 1: matrix 322 rows 187 cols
[2024-05-23 02:51:43] [INFO ] Computed 2 invariants in 20 ms
[2024-05-23 02:51:44] [INFO ] Implicit Places using invariants in 275 ms returned []
[2024-05-23 02:51:44] [INFO ] Flow matrix only has 322 transitions (discarded 152 similar events)
[2024-05-23 02:51:44] [INFO ] Invariant cache hit.
[2024-05-23 02:51:44] [INFO ] State equation strengthened by 62 read => feed constraints.
[2024-05-23 02:51:44] [INFO ] Implicit Places using invariants and state equation in 285 ms returned []
Implicit Place search using SMT with State Equation took 597 ms to find 0 implicit places.
Running 472 sub problems to find dead transitions.
[2024-05-23 02:51:44] [INFO ] Flow matrix only has 322 transitions (discarded 152 similar events)
[2024-05-23 02:51:44] [INFO ] Invariant cache hit.
[2024-05-23 02:51:44] [INFO ] State equation strengthened by 62 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/186 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 472 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/186 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 472 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/186 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 472 unsolved
At refinement iteration 3 (OVERLAPS) 322/508 variables, 186/188 constraints. Problems are: Problem set: 0 solved, 472 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/508 variables, 62/250 constraints. Problems are: Problem set: 0 solved, 472 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/508 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 472 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 1/509 variables, 1/251 constraints. Problems are: Problem set: 0 solved, 472 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/509 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 472 unsolved
At refinement iteration 8 (OVERLAPS) 0/509 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 472 unsolved
No progress, stopping.
After SMT solving in domain Real declared 509/509 variables, and 251 constraints, problems are : Problem set: 0 solved, 472 unsolved in 19925 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 187/187 constraints, ReadFeed: 62/62 constraints, PredecessorRefiner: 472/472 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 472 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/186 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 472 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/186 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 472 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/186 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 472 unsolved
At refinement iteration 3 (OVERLAPS) 322/508 variables, 186/188 constraints. Problems are: Problem set: 0 solved, 472 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/508 variables, 62/250 constraints. Problems are: Problem set: 0 solved, 472 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/508 variables, 32/282 constraints. Problems are: Problem set: 0 solved, 472 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/508 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 472 unsolved
At refinement iteration 7 (OVERLAPS) 1/509 variables, 1/283 constraints. Problems are: Problem set: 0 solved, 472 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/509 variables, 440/723 constraints. Problems are: Problem set: 0 solved, 472 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/509 variables, 0/723 constraints. Problems are: Problem set: 0 solved, 472 unsolved
At refinement iteration 10 (OVERLAPS) 0/509 variables, 0/723 constraints. Problems are: Problem set: 0 solved, 472 unsolved
No progress, stopping.
After SMT solving in domain Int declared 509/509 variables, and 723 constraints, problems are : Problem set: 0 solved, 472 unsolved in 29708 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 187/187 constraints, ReadFeed: 62/62 constraints, PredecessorRefiner: 472/472 constraints, Known Traps: 0/0 constraints]
After SMT, in 50391ms problems are : Problem set: 0 solved, 472 unsolved
Search for dead transitions found 0 dead transitions in 50409ms
Starting structural reductions in LTL mode, iteration 1 : 187/222 places, 474/648 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 51090 ms. Remains : 187/222 places, 474/648 transitions.
Support contains 68 out of 187 places after structural reductions.
[2024-05-23 02:52:34] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-05-23 02:52:35] [INFO ] Flatten gal took : 61 ms
FORMULA FunctionPointer-PT-b064-CTLCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-23 02:52:35] [INFO ] Flatten gal took : 53 ms
[2024-05-23 02:52:35] [INFO ] Input system was already deterministic with 474 transitions.
Support contains 63 out of 187 places (down from 68) after GAL structural reductions.
RANDOM walk for 40094 steps (27 resets) in 976 ms. (41 steps per ms) remains 25/49 properties
BEST_FIRST walk for 4003 steps (9 resets) in 36 ms. (108 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (10 resets) in 24 ms. (160 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (9 resets) in 39 ms. (100 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (10 resets) in 17 ms. (222 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (9 resets) in 31 ms. (125 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (9 resets) in 31 ms. (125 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (9 resets) in 8 ms. (444 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 7 ms. (500 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (10 resets) in 7 ms. (500 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (9 resets) in 7 ms. (500 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (9 resets) in 11 ms. (333 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (9 resets) in 18 ms. (210 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 7 ms. (500 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (9 resets) in 10 ms. (364 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (10 resets) in 12 ms. (307 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (8 resets) in 11 ms. (333 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (8 resets) in 11 ms. (333 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (9 resets) in 10 ms. (363 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (8 resets) in 7 ms. (500 steps per ms) remains 25/25 properties
[2024-05-23 02:52:35] [INFO ] Flow matrix only has 322 transitions (discarded 152 similar events)
[2024-05-23 02:52:35] [INFO ] Invariant cache hit.
[2024-05-23 02:52:35] [INFO ] State equation strengthened by 62 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 25 unsolved
Problem AtomicPropp24 is UNSAT
At refinement iteration 1 (OVERLAPS) 43/74 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 24 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/74 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 24 unsolved
At refinement iteration 3 (OVERLAPS) 22/96 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 24 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 24 unsolved
At refinement iteration 5 (OVERLAPS) 206/302 variables, 96/98 constraints. Problems are: Problem set: 1 solved, 24 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/302 variables, 19/117 constraints. Problems are: Problem set: 1 solved, 24 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/302 variables, 0/117 constraints. Problems are: Problem set: 1 solved, 24 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp46 is UNSAT
Problem AtomicPropp48 is UNSAT
At refinement iteration 8 (OVERLAPS) 135/437 variables, 49/166 constraints. Problems are: Problem set: 5 solved, 20 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/437 variables, 37/203 constraints. Problems are: Problem set: 5 solved, 20 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/437 variables, 0/203 constraints. Problems are: Problem set: 5 solved, 20 unsolved
At refinement iteration 11 (OVERLAPS) 63/500 variables, 33/236 constraints. Problems are: Problem set: 5 solved, 20 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/500 variables, 6/242 constraints. Problems are: Problem set: 5 solved, 20 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/500 variables, 0/242 constraints. Problems are: Problem set: 5 solved, 20 unsolved
At refinement iteration 14 (OVERLAPS) 9/509 variables, 9/251 constraints. Problems are: Problem set: 5 solved, 20 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/509 variables, 0/251 constraints. Problems are: Problem set: 5 solved, 20 unsolved
At refinement iteration 16 (OVERLAPS) 0/509 variables, 0/251 constraints. Problems are: Problem set: 5 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 509/509 variables, and 251 constraints, problems are : Problem set: 5 solved, 20 unsolved in 1027 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 187/187 constraints, ReadFeed: 62/62 constraints, PredecessorRefiner: 25/25 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 5 solved, 20 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 5 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 44/68 variables, 1/1 constraints. Problems are: Problem set: 5 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 0/1 constraints. Problems are: Problem set: 5 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 144/212 variables, 68/69 constraints. Problems are: Problem set: 5 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/212 variables, 6/75 constraints. Problems are: Problem set: 5 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/212 variables, 0/75 constraints. Problems are: Problem set: 5 solved, 20 unsolved
At refinement iteration 6 (OVERLAPS) 154/366 variables, 38/113 constraints. Problems are: Problem set: 5 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/366 variables, 40/153 constraints. Problems are: Problem set: 5 solved, 20 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/366 variables, 20/173 constraints. Problems are: Problem set: 5 solved, 20 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/366 variables, 0/173 constraints. Problems are: Problem set: 5 solved, 20 unsolved
At refinement iteration 10 (OVERLAPS) 20/386 variables, 1/174 constraints. Problems are: Problem set: 5 solved, 20 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/386 variables, 2/176 constraints. Problems are: Problem set: 5 solved, 20 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/386 variables, 0/176 constraints. Problems are: Problem set: 5 solved, 20 unsolved
At refinement iteration 13 (OVERLAPS) 102/488 variables, 60/236 constraints. Problems are: Problem set: 5 solved, 20 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/488 variables, 16/252 constraints. Problems are: Problem set: 5 solved, 20 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/488 variables, 0/252 constraints. Problems are: Problem set: 5 solved, 20 unsolved
At refinement iteration 16 (OVERLAPS) 21/509 variables, 19/271 constraints. Problems are: Problem set: 5 solved, 20 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/509 variables, 0/271 constraints. Problems are: Problem set: 5 solved, 20 unsolved
At refinement iteration 18 (OVERLAPS) 0/509 variables, 0/271 constraints. Problems are: Problem set: 5 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 509/509 variables, and 271 constraints, problems are : Problem set: 5 solved, 20 unsolved in 1503 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 187/187 constraints, ReadFeed: 62/62 constraints, PredecessorRefiner: 20/25 constraints, Known Traps: 0/0 constraints]
After SMT, in 2555ms problems are : Problem set: 5 solved, 20 unsolved
Fused 20 Parikh solutions to 14 different solutions.
Parikh walk visited 0 properties in 10 ms.
Support contains 24 out of 187 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 187/187 places, 474/474 transitions.
Graph (complete) has 749 edges and 187 vertex of which 168 are kept as prefixes of interest. Removing 19 places using SCC suffix rule.1 ms
Discarding 19 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 37 transitions
Reduce isomorphic transitions removed 37 transitions.
Iterating post reduction 0 with 37 rules applied. Total rules applied 38 place count 168 transition count 437
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 50 place count 156 transition count 411
Iterating global reduction 1 with 12 rules applied. Total rules applied 62 place count 156 transition count 411
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 72 place count 156 transition count 401
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 75 place count 153 transition count 395
Iterating global reduction 2 with 3 rules applied. Total rules applied 78 place count 153 transition count 395
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 81 place count 150 transition count 387
Iterating global reduction 2 with 3 rules applied. Total rules applied 84 place count 150 transition count 387
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 86 place count 148 transition count 381
Iterating global reduction 2 with 2 rules applied. Total rules applied 88 place count 148 transition count 381
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 90 place count 146 transition count 375
Iterating global reduction 2 with 2 rules applied. Total rules applied 92 place count 146 transition count 375
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 94 place count 144 transition count 367
Iterating global reduction 2 with 2 rules applied. Total rules applied 96 place count 144 transition count 367
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 98 place count 142 transition count 361
Iterating global reduction 2 with 2 rules applied. Total rules applied 100 place count 142 transition count 361
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 102 place count 140 transition count 357
Iterating global reduction 2 with 2 rules applied. Total rules applied 104 place count 140 transition count 357
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 106 place count 138 transition count 353
Iterating global reduction 2 with 2 rules applied. Total rules applied 108 place count 138 transition count 353
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 110 place count 136 transition count 349
Iterating global reduction 2 with 2 rules applied. Total rules applied 112 place count 136 transition count 349
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 114 place count 134 transition count 345
Iterating global reduction 2 with 2 rules applied. Total rules applied 116 place count 134 transition count 345
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 2 with 12 rules applied. Total rules applied 128 place count 134 transition count 333
Applied a total of 128 rules in 91 ms. Remains 134 /187 variables (removed 53) and now considering 333/474 (removed 141) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 91 ms. Remains : 134/187 places, 333/474 transitions.
RANDOM walk for 40000 steps (8 resets) in 284 ms. (140 steps per ms) remains 17/20 properties
BEST_FIRST walk for 4002 steps (8 resets) in 8 ms. (444 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (8 resets) in 9 ms. (400 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (8 resets) in 10 ms. (363 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (8 resets) in 10 ms. (363 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 7 ms. (500 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (8 resets) in 7 ms. (500 steps per ms) remains 17/17 properties
[2024-05-23 02:52:38] [INFO ] Flow matrix only has 221 transitions (discarded 112 similar events)
// Phase 1: matrix 221 rows 134 cols
[2024-05-23 02:52:38] [INFO ] Computed 2 invariants in 3 ms
[2024-05-23 02:52:38] [INFO ] State equation strengthened by 38 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (OVERLAPS) 45/67 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/67 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (OVERLAPS) 137/204 variables, 67/68 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/204 variables, 4/72 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/204 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (OVERLAPS) 104/308 variables, 35/107 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/308 variables, 29/136 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/308 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 9 (OVERLAPS) 11/319 variables, 1/137 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/319 variables, 3/140 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/319 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 12 (OVERLAPS) 31/350 variables, 25/165 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/350 variables, 5/170 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/350 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 15 (OVERLAPS) 5/355 variables, 4/174 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/355 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 17 (OVERLAPS) 0/355 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 355/355 variables, and 174 constraints, problems are : Problem set: 0 solved, 17 unsolved in 739 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 134/134 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 17 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (OVERLAPS) 45/67 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/67 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (OVERLAPS) 137/204 variables, 67/68 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/204 variables, 4/72 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/204 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (OVERLAPS) 104/308 variables, 35/107 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/308 variables, 29/136 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/308 variables, 17/153 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/308 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 10 (OVERLAPS) 11/319 variables, 1/154 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/319 variables, 3/157 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/319 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 13 (OVERLAPS) 31/350 variables, 25/182 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/350 variables, 5/187 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/350 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 16 (OVERLAPS) 5/355 variables, 4/191 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/355 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 18 (OVERLAPS) 0/355 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 355/355 variables, and 191 constraints, problems are : Problem set: 0 solved, 17 unsolved in 1051 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 134/134 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
After SMT, in 1804ms problems are : Problem set: 0 solved, 17 unsolved
Fused 17 Parikh solutions to 11 different solutions.
Parikh walk visited 0 properties in 3 ms.
Support contains 22 out of 134 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 134/134 places, 333/333 transitions.
Applied a total of 0 rules in 10 ms. Remains 134 /134 variables (removed 0) and now considering 333/333 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 134/134 places, 333/333 transitions.
RANDOM walk for 40002 steps (8 resets) in 210 ms. (189 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 7 ms. (500 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 7 ms. (500 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 7 ms. (500 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 7 ms. (500 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (8 resets) in 7 ms. (500 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 7 ms. (500 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 7 ms. (500 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (8 resets) in 29 ms. (133 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (8 resets) in 8 ms. (444 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (8 resets) in 8 ms. (444 steps per ms) remains 17/17 properties
Interrupted probabilistic random walk after 214057 steps, run timeout after 3001 ms. (steps per millisecond=71 ) properties seen :1 out of 17
Probabilistic random walk after 214057 steps, saw 134012 distinct states, run finished after 3023 ms. (steps per millisecond=70 ) properties seen :1
[2024-05-23 02:52:43] [INFO ] Flow matrix only has 221 transitions (discarded 112 similar events)
[2024-05-23 02:52:43] [INFO ] Invariant cache hit.
[2024-05-23 02:52:43] [INFO ] State equation strengthened by 38 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 45/66 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 132/198 variables, 66/67 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/198 variables, 4/71 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/198 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (OVERLAPS) 107/305 variables, 34/105 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/305 variables, 29/134 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/305 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (OVERLAPS) 11/316 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/316 variables, 3/138 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/316 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 12 (OVERLAPS) 34/350 variables, 27/165 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/350 variables, 5/170 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/350 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 15 (OVERLAPS) 5/355 variables, 4/174 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/355 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 17 (OVERLAPS) 0/355 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 355/355 variables, and 174 constraints, problems are : Problem set: 0 solved, 16 unsolved in 604 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 134/134 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 45/66 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 132/198 variables, 66/67 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/198 variables, 4/71 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/198 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (OVERLAPS) 107/305 variables, 34/105 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/305 variables, 29/134 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/305 variables, 16/150 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/305 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 10 (OVERLAPS) 11/316 variables, 1/151 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/316 variables, 3/154 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/316 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 13 (OVERLAPS) 34/350 variables, 27/181 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/350 variables, 5/186 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/350 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 16 (OVERLAPS) 5/355 variables, 4/190 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/355 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 18 (OVERLAPS) 0/355 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Int declared 355/355 variables, and 190 constraints, problems are : Problem set: 0 solved, 16 unsolved in 838 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 134/134 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
After SMT, in 1452ms problems are : Problem set: 0 solved, 16 unsolved
Fused 16 Parikh solutions to 10 different solutions.
Parikh walk visited 8 properties in 32555 ms.
Support contains 13 out of 134 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 134/134 places, 333/333 transitions.
Graph (complete) has 552 edges and 134 vertex of which 131 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 131 transition count 327
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 11 place count 127 transition count 317
Iterating global reduction 1 with 4 rules applied. Total rules applied 15 place count 127 transition count 317
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 17 place count 127 transition count 315
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 20 place count 124 transition count 305
Iterating global reduction 2 with 3 rules applied. Total rules applied 23 place count 124 transition count 305
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 25 place count 122 transition count 301
Iterating global reduction 2 with 2 rules applied. Total rules applied 27 place count 122 transition count 301
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 28 place count 121 transition count 297
Iterating global reduction 2 with 1 rules applied. Total rules applied 29 place count 121 transition count 297
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 30 place count 120 transition count 295
Iterating global reduction 2 with 1 rules applied. Total rules applied 31 place count 120 transition count 295
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 32 place count 119 transition count 293
Iterating global reduction 2 with 1 rules applied. Total rules applied 33 place count 119 transition count 293
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 34 place count 118 transition count 291
Iterating global reduction 2 with 1 rules applied. Total rules applied 35 place count 118 transition count 291
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 36 place count 117 transition count 289
Iterating global reduction 2 with 1 rules applied. Total rules applied 37 place count 117 transition count 289
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 38 place count 116 transition count 287
Iterating global reduction 2 with 1 rules applied. Total rules applied 39 place count 116 transition count 287
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 40 place count 115 transition count 285
Iterating global reduction 2 with 1 rules applied. Total rules applied 41 place count 115 transition count 285
Applied a total of 41 rules in 48 ms. Remains 115 /134 variables (removed 19) and now considering 285/333 (removed 48) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48 ms. Remains : 115/134 places, 285/333 transitions.
RANDOM walk for 40065 steps (8 resets) in 129 ms. (308 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 47 ms. (833 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 55 ms. (714 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 45 ms. (869 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 33 ms. (1176 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 30 ms. (1290 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 46 ms. (851 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 27 ms. (1428 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 32 ms. (1212 steps per ms) remains 8/8 properties
Interrupted probabilistic random walk after 276513 steps, run timeout after 3001 ms. (steps per millisecond=92 ) properties seen :0 out of 8
Probabilistic random walk after 276513 steps, saw 172889 distinct states, run finished after 3001 ms. (steps per millisecond=92 ) properties seen :0
[2024-05-23 02:53:21] [INFO ] Flow matrix only has 185 transitions (discarded 100 similar events)
// Phase 1: matrix 185 rows 115 cols
[2024-05-23 02:53:21] [INFO ] Computed 3 invariants in 2 ms
[2024-05-23 02:53:21] [INFO ] State equation strengthened by 32 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 47/60 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 112/172 variables, 60/61 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/172 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/172 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 83/255 variables, 25/88 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/255 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/255 variables, 25/114 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/255 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (OVERLAPS) 10/265 variables, 1/115 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/265 variables, 2/117 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/265 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (OVERLAPS) 32/297 variables, 25/142 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/297 variables, 5/147 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/297 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 16 (OVERLAPS) 3/300 variables, 3/150 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/300 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 18 (OVERLAPS) 0/300 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 300/300 variables, and 150 constraints, problems are : Problem set: 0 solved, 8 unsolved in 301 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 115/115 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 47/60 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 112/172 variables, 60/61 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/172 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/172 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 83/255 variables, 25/88 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/255 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/255 variables, 25/114 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/255 variables, 8/122 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/255 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (OVERLAPS) 10/265 variables, 1/123 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/265 variables, 2/125 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/265 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (OVERLAPS) 32/297 variables, 25/150 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/297 variables, 5/155 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/297 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 17 (OVERLAPS) 3/300 variables, 3/158 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/300 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 19 (OVERLAPS) 0/300 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 300/300 variables, and 158 constraints, problems are : Problem set: 0 solved, 8 unsolved in 397 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 115/115 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
After SMT, in 707ms problems are : Problem set: 0 solved, 8 unsolved
Fused 8 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 13 out of 115 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 115/115 places, 285/285 transitions.
Applied a total of 0 rules in 8 ms. Remains 115 /115 variables (removed 0) and now considering 285/285 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 115/115 places, 285/285 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 115/115 places, 285/285 transitions.
Applied a total of 0 rules in 7 ms. Remains 115 /115 variables (removed 0) and now considering 285/285 (removed 0) transitions.
[2024-05-23 02:53:21] [INFO ] Flow matrix only has 185 transitions (discarded 100 similar events)
[2024-05-23 02:53:21] [INFO ] Invariant cache hit.
[2024-05-23 02:53:21] [INFO ] Implicit Places using invariants in 80 ms returned []
[2024-05-23 02:53:21] [INFO ] Flow matrix only has 185 transitions (discarded 100 similar events)
[2024-05-23 02:53:21] [INFO ] Invariant cache hit.
[2024-05-23 02:53:22] [INFO ] State equation strengthened by 32 read => feed constraints.
[2024-05-23 02:53:22] [INFO ] Implicit Places using invariants and state equation in 151 ms returned []
Implicit Place search using SMT with State Equation took 234 ms to find 0 implicit places.
[2024-05-23 02:53:22] [INFO ] Redundant transitions in 13 ms returned []
Running 283 sub problems to find dead transitions.
[2024-05-23 02:53:22] [INFO ] Flow matrix only has 185 transitions (discarded 100 similar events)
[2024-05-23 02:53:22] [INFO ] Invariant cache hit.
[2024-05-23 02:53:22] [INFO ] State equation strengthened by 32 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/115 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 2 (OVERLAPS) 185/300 variables, 115/118 constraints. Problems are: Problem set: 0 solved, 283 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/300 variables, 32/150 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/300 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 5 (OVERLAPS) 0/300 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 283 unsolved
No progress, stopping.
After SMT solving in domain Real declared 300/300 variables, and 150 constraints, problems are : Problem set: 0 solved, 283 unsolved in 5086 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 115/115 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 283/283 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 283 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/115 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 2 (OVERLAPS) 185/300 variables, 115/118 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/300 variables, 32/150 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/300 variables, 283/433 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/300 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 6 (OVERLAPS) 0/300 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 283 unsolved
No progress, stopping.
After SMT solving in domain Int declared 300/300 variables, and 433 constraints, problems are : Problem set: 0 solved, 283 unsolved in 9516 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 115/115 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 283/283 constraints, Known Traps: 0/0 constraints]
After SMT, in 14864ms problems are : Problem set: 0 solved, 283 unsolved
Search for dead transitions found 0 dead transitions in 14867ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15130 ms. Remains : 115/115 places, 285/285 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 100 transitions
Reduce isomorphic transitions removed 100 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 106 rules applied. Total rules applied 106 place count 115 transition count 179
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 112 place count 109 transition count 179
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 22 Pre rules applied. Total rules applied 112 place count 109 transition count 157
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 44 rules applied. Total rules applied 156 place count 87 transition count 157
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 192 place count 69 transition count 139
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 198 place count 63 transition count 127
Iterating global reduction 2 with 6 rules applied. Total rules applied 204 place count 63 transition count 127
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 210 place count 57 transition count 115
Iterating global reduction 2 with 6 rules applied. Total rules applied 216 place count 57 transition count 115
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 222 place count 51 transition count 103
Iterating global reduction 2 with 6 rules applied. Total rules applied 228 place count 51 transition count 103
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 234 place count 51 transition count 97
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 240 place count 48 transition count 98
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 244 place count 48 transition count 94
Applied a total of 244 rules in 23 ms. Remains 48 /115 variables (removed 67) and now considering 94/285 (removed 191) transitions.
Running SMT prover for 8 properties.
// Phase 1: matrix 94 rows 48 cols
[2024-05-23 02:53:37] [INFO ] Computed 3 invariants in 0 ms
[2024-05-23 02:53:37] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 02:53:37] [INFO ] After 37ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2024-05-23 02:53:37] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 02:53:37] [INFO ] After 41ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2024-05-23 02:53:37] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-23 02:53:37] [INFO ] After 27ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :8
TRAPS : Iteration 0
[2024-05-23 02:53:37] [INFO ] After 83ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
[2024-05-23 02:53:37] [INFO ] After 185ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Over-approximation ignoring read arcs solved 0 properties in 258 ms.
Successfully simplified 5 atomic propositions for a total of 14 simplifications.
FORMULA FunctionPointer-PT-b064-CTLCardinality-2023-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-23 02:53:37] [INFO ] Flatten gal took : 21 ms
[2024-05-23 02:53:37] [INFO ] Flatten gal took : 24 ms
[2024-05-23 02:53:37] [INFO ] Input system was already deterministic with 474 transitions.
Computed a total of 24 stabilizing places and 64 stable transitions
Graph (complete) has 999 edges and 187 vertex of which 186 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Starting structural reductions in LTL mode, iteration 0 : 187/187 places, 474/474 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 186 transition count 474
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 19 place count 168 transition count 434
Iterating global reduction 1 with 18 rules applied. Total rules applied 37 place count 168 transition count 434
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 51 place count 168 transition count 420
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 60 place count 159 transition count 396
Iterating global reduction 2 with 9 rules applied. Total rules applied 69 place count 159 transition count 396
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 76 place count 152 transition count 378
Iterating global reduction 2 with 7 rules applied. Total rules applied 83 place count 152 transition count 378
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 90 place count 145 transition count 354
Iterating global reduction 2 with 7 rules applied. Total rules applied 97 place count 145 transition count 354
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 104 place count 138 transition count 330
Iterating global reduction 2 with 7 rules applied. Total rules applied 111 place count 138 transition count 330
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 118 place count 131 transition count 308
Iterating global reduction 2 with 7 rules applied. Total rules applied 125 place count 131 transition count 308
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 132 place count 124 transition count 290
Iterating global reduction 2 with 7 rules applied. Total rules applied 139 place count 124 transition count 290
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 146 place count 117 transition count 276
Iterating global reduction 2 with 7 rules applied. Total rules applied 153 place count 117 transition count 276
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 160 place count 110 transition count 262
Iterating global reduction 2 with 7 rules applied. Total rules applied 167 place count 110 transition count 262
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 174 place count 103 transition count 248
Iterating global reduction 2 with 7 rules applied. Total rules applied 181 place count 103 transition count 248
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 185 place count 99 transition count 240
Iterating global reduction 2 with 4 rules applied. Total rules applied 189 place count 99 transition count 240
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 191 place count 97 transition count 236
Iterating global reduction 2 with 2 rules applied. Total rules applied 193 place count 97 transition count 236
Applied a total of 193 rules in 33 ms. Remains 97 /187 variables (removed 90) and now considering 236/474 (removed 238) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33 ms. Remains : 97/187 places, 236/474 transitions.
[2024-05-23 02:53:37] [INFO ] Flatten gal took : 9 ms
[2024-05-23 02:53:37] [INFO ] Flatten gal took : 9 ms
[2024-05-23 02:53:37] [INFO ] Input system was already deterministic with 236 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 187/187 places, 474/474 transitions.
Graph (complete) has 999 edges and 187 vertex of which 186 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 19 place count 168 transition count 434
Iterating global reduction 0 with 18 rules applied. Total rules applied 37 place count 168 transition count 434
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 51 place count 168 transition count 420
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 60 place count 159 transition count 396
Iterating global reduction 1 with 9 rules applied. Total rules applied 69 place count 159 transition count 396
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 76 place count 152 transition count 378
Iterating global reduction 1 with 7 rules applied. Total rules applied 83 place count 152 transition count 378
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 90 place count 145 transition count 354
Iterating global reduction 1 with 7 rules applied. Total rules applied 97 place count 145 transition count 354
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 104 place count 138 transition count 330
Iterating global reduction 1 with 7 rules applied. Total rules applied 111 place count 138 transition count 330
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 118 place count 131 transition count 308
Iterating global reduction 1 with 7 rules applied. Total rules applied 125 place count 131 transition count 308
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 132 place count 124 transition count 290
Iterating global reduction 1 with 7 rules applied. Total rules applied 139 place count 124 transition count 290
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 146 place count 117 transition count 276
Iterating global reduction 1 with 7 rules applied. Total rules applied 153 place count 117 transition count 276
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 160 place count 110 transition count 262
Iterating global reduction 1 with 7 rules applied. Total rules applied 167 place count 110 transition count 262
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 174 place count 103 transition count 248
Iterating global reduction 1 with 7 rules applied. Total rules applied 181 place count 103 transition count 248
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 185 place count 99 transition count 240
Iterating global reduction 1 with 4 rules applied. Total rules applied 189 place count 99 transition count 240
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 191 place count 97 transition count 236
Iterating global reduction 1 with 2 rules applied. Total rules applied 193 place count 97 transition count 236
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 195 place count 97 transition count 234
Applied a total of 195 rules in 64 ms. Remains 97 /187 variables (removed 90) and now considering 234/474 (removed 240) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 64 ms. Remains : 97/187 places, 234/474 transitions.
[2024-05-23 02:53:37] [INFO ] Flatten gal took : 9 ms
[2024-05-23 02:53:37] [INFO ] Flatten gal took : 9 ms
[2024-05-23 02:53:37] [INFO ] Input system was already deterministic with 234 transitions.
RANDOM walk for 40102 steps (28 resets) in 232 ms. (172 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (31 resets) in 410 ms. (97 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1769448 steps, run timeout after 3001 ms. (steps per millisecond=589 ) properties seen :0 out of 1
Probabilistic random walk after 1769448 steps, saw 1163211 distinct states, run finished after 3001 ms. (steps per millisecond=589 ) properties seen :0
[2024-05-23 02:53:40] [INFO ] Flow matrix only has 158 transitions (discarded 76 similar events)
// Phase 1: matrix 158 rows 97 cols
[2024-05-23 02:53:40] [INFO ] Computed 2 invariants in 5 ms
[2024-05-23 02:53:40] [INFO ] State equation strengthened by 37 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) 47/48 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 81/129 variables, 48/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 41/170 variables, 4/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/170 variables, 26/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/170 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 63/233 variables, 29/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/233 variables, 1/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/233 variables, 11/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/233 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 15/248 variables, 12/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/248 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 4/252 variables, 2/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/252 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 3/255 variables, 2/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/255 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/255 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 255/255 variables, and 136 constraints, problems are : Problem set: 0 solved, 1 unsolved in 91 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 97/97 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 47/48 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 81/129 variables, 48/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 41/170 variables, 4/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/170 variables, 26/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/170 variables, 1/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/170 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 63/233 variables, 29/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/233 variables, 1/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/233 variables, 11/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/233 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 15/248 variables, 12/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/248 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 4/252 variables, 2/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/252 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 3/255 variables, 2/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/255 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/255 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 255/255 variables, and 137 constraints, problems are : Problem set: 0 solved, 1 unsolved in 99 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 97/97 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 207ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 55 ms.
Support contains 1 out of 97 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 97/97 places, 234/234 transitions.
Graph (complete) has 397 edges and 97 vertex of which 73 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.0 ms
Discarding 24 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Iterating post reduction 0 with 48 rules applied. Total rules applied 49 place count 73 transition count 186
Applied a total of 49 rules in 5 ms. Remains 73 /97 variables (removed 24) and now considering 186/234 (removed 48) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 73/97 places, 186/234 transitions.
RANDOM walk for 4000001 steps (8 resets) in 4961 ms. (806 steps per ms) remains 1/1 properties
BEST_FIRST walk for 4000004 steps (8 resets) in 2193 ms. (1823 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2091361 steps, run timeout after 3001 ms. (steps per millisecond=696 ) properties seen :0 out of 1
Probabilistic random walk after 2091361 steps, saw 1301786 distinct states, run finished after 3001 ms. (steps per millisecond=696 ) properties seen :0
[2024-05-23 02:53:45] [INFO ] Flow matrix only has 112 transitions (discarded 74 similar events)
// Phase 1: matrix 112 rows 73 cols
[2024-05-23 02:53:45] [INFO ] Computed 3 invariants in 2 ms
[2024-05-23 02:53:45] [INFO ] State equation strengthened by 15 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) 47/48 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 81/129 variables, 48/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 19/148 variables, 4/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/148 variables, 12/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/148 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 6/154 variables, 2/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/154 variables, 2/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/154 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 17/171 variables, 11/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/171 variables, 3/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/171 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 7/178 variables, 4/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/178 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 4/182 variables, 2/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/182 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 3/185 variables, 2/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/185 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/185 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 185/185 variables, and 91 constraints, problems are : Problem set: 0 solved, 1 unsolved in 105 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 73/73 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 47/48 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 81/129 variables, 48/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 19/148 variables, 4/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/148 variables, 12/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/148 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/148 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 6/154 variables, 2/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/154 variables, 2/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/154 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 17/171 variables, 11/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/171 variables, 3/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/171 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 7/178 variables, 4/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/178 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 4/182 variables, 2/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/182 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 3/185 variables, 2/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/185 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/185 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 185/185 variables, and 92 constraints, problems are : Problem set: 0 solved, 1 unsolved in 83 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 73/73 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 193ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 54 ms.
Support contains 1 out of 73 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 73/73 places, 186/186 transitions.
Applied a total of 0 rules in 10 ms. Remains 73 /73 variables (removed 0) and now considering 186/186 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 73/73 places, 186/186 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 73/73 places, 186/186 transitions.
Applied a total of 0 rules in 5 ms. Remains 73 /73 variables (removed 0) and now considering 186/186 (removed 0) transitions.
[2024-05-23 02:53:46] [INFO ] Flow matrix only has 112 transitions (discarded 74 similar events)
[2024-05-23 02:53:46] [INFO ] Invariant cache hit.
[2024-05-23 02:53:46] [INFO ] Implicit Places using invariants in 49 ms returned []
[2024-05-23 02:53:46] [INFO ] Flow matrix only has 112 transitions (discarded 74 similar events)
[2024-05-23 02:53:46] [INFO ] Invariant cache hit.
[2024-05-23 02:53:46] [INFO ] State equation strengthened by 15 read => feed constraints.
[2024-05-23 02:53:46] [INFO ] Implicit Places using invariants and state equation in 103 ms returned []
Implicit Place search using SMT with State Equation took 153 ms to find 0 implicit places.
[2024-05-23 02:53:46] [INFO ] Redundant transitions in 2 ms returned []
Running 184 sub problems to find dead transitions.
[2024-05-23 02:53:46] [INFO ] Flow matrix only has 112 transitions (discarded 74 similar events)
[2024-05-23 02:53:46] [INFO ] Invariant cache hit.
[2024-05-23 02:53:46] [INFO ] State equation strengthened by 15 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/73 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 2 (OVERLAPS) 112/185 variables, 73/76 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/185 variables, 15/91 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/185 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 5 (OVERLAPS) 0/185 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 184 unsolved
No progress, stopping.
After SMT solving in domain Real declared 185/185 variables, and 91 constraints, problems are : Problem set: 0 solved, 184 unsolved in 3201 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 73/73 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 184/184 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 184 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/73 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 2 (OVERLAPS) 112/185 variables, 73/76 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/185 variables, 15/91 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/185 variables, 184/275 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/185 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 6 (OVERLAPS) 0/185 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 184 unsolved
No progress, stopping.
After SMT solving in domain Int declared 185/185 variables, and 275 constraints, problems are : Problem set: 0 solved, 184 unsolved in 4285 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 73/73 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 184/184 constraints, Known Traps: 0/0 constraints]
After SMT, in 7599ms problems are : Problem set: 0 solved, 184 unsolved
Search for dead transitions found 0 dead transitions in 7601ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7766 ms. Remains : 73/73 places, 186/186 transitions.
RANDOM walk for 400002 steps (8 resets) in 1385 ms. (288 steps per ms) remains 1/1 properties
Running SMT prover for 1 properties.
[2024-05-23 02:53:54] [INFO ] Flow matrix only has 112 transitions (discarded 74 similar events)
[2024-05-23 02:53:54] [INFO ] Invariant cache hit.
[2024-05-23 02:53:54] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 02:53:54] [INFO ] After 23ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-23 02:53:54] [INFO ] State equation strengthened by 15 read => feed constraints.
[2024-05-23 02:53:54] [INFO ] After 3ms SMT Verify possible using 15 Read/Feed constraints in real domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-23 02:53:54] [INFO ] After 11ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 02:53:54] [INFO ] After 61ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 02:53:54] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 02:53:54] [INFO ] After 22ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 02:53:54] [INFO ] After 3ms SMT Verify possible using 15 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-23 02:53:54] [INFO ] After 9ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-23 02:53:54] [INFO ] After 52ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
RANDOM walk for 4000006 steps (8 resets) in 4402 ms. (908 steps per ms) remains 1/1 properties
BEST_FIRST walk for 4000004 steps (8 resets) in 2152 ms. (1857 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2071099 steps, run timeout after 3001 ms. (steps per millisecond=690 ) properties seen :0 out of 1
Probabilistic random walk after 2071099 steps, saw 1289173 distinct states, run finished after 3001 ms. (steps per millisecond=690 ) properties seen :0
[2024-05-23 02:53:59] [INFO ] Flow matrix only has 112 transitions (discarded 74 similar events)
[2024-05-23 02:53:59] [INFO ] Invariant cache hit.
[2024-05-23 02:53:59] [INFO ] State equation strengthened by 15 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) 47/48 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 81/129 variables, 48/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 19/148 variables, 4/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/148 variables, 12/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/148 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 6/154 variables, 2/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/154 variables, 2/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/154 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 17/171 variables, 11/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/171 variables, 3/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/171 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 7/178 variables, 4/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/178 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 4/182 variables, 2/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/182 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 3/185 variables, 2/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/185 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/185 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 185/185 variables, and 91 constraints, problems are : Problem set: 0 solved, 1 unsolved in 82 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 73/73 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 47/48 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 81/129 variables, 48/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 19/148 variables, 4/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/148 variables, 12/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/148 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/148 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 6/154 variables, 2/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/154 variables, 2/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/154 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 17/171 variables, 11/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/171 variables, 3/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/171 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 7/178 variables, 4/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/178 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 4/182 variables, 2/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/182 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 3/185 variables, 2/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/185 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/185 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 185/185 variables, and 92 constraints, problems are : Problem set: 0 solved, 1 unsolved in 98 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 73/73 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 183ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 61 ms.
Support contains 1 out of 73 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 73/73 places, 186/186 transitions.
Applied a total of 0 rules in 3 ms. Remains 73 /73 variables (removed 0) and now considering 186/186 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 73/73 places, 186/186 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 73/73 places, 186/186 transitions.
Applied a total of 0 rules in 3 ms. Remains 73 /73 variables (removed 0) and now considering 186/186 (removed 0) transitions.
[2024-05-23 02:53:59] [INFO ] Flow matrix only has 112 transitions (discarded 74 similar events)
[2024-05-23 02:53:59] [INFO ] Invariant cache hit.
[2024-05-23 02:53:59] [INFO ] Implicit Places using invariants in 59 ms returned []
[2024-05-23 02:53:59] [INFO ] Flow matrix only has 112 transitions (discarded 74 similar events)
[2024-05-23 02:53:59] [INFO ] Invariant cache hit.
[2024-05-23 02:53:59] [INFO ] State equation strengthened by 15 read => feed constraints.
[2024-05-23 02:53:59] [INFO ] Implicit Places using invariants and state equation in 99 ms returned []
Implicit Place search using SMT with State Equation took 160 ms to find 0 implicit places.
[2024-05-23 02:53:59] [INFO ] Redundant transitions in 2 ms returned []
Running 184 sub problems to find dead transitions.
[2024-05-23 02:53:59] [INFO ] Flow matrix only has 112 transitions (discarded 74 similar events)
[2024-05-23 02:53:59] [INFO ] Invariant cache hit.
[2024-05-23 02:53:59] [INFO ] State equation strengthened by 15 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/73 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 2 (OVERLAPS) 112/185 variables, 73/76 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/185 variables, 15/91 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/185 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 5 (OVERLAPS) 0/185 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 184 unsolved
No progress, stopping.
After SMT solving in domain Real declared 185/185 variables, and 91 constraints, problems are : Problem set: 0 solved, 184 unsolved in 3186 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 73/73 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 184/184 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 184 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/73 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 2 (OVERLAPS) 112/185 variables, 73/76 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/185 variables, 15/91 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/185 variables, 184/275 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/185 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 6 (OVERLAPS) 0/185 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 184 unsolved
No progress, stopping.
After SMT solving in domain Int declared 185/185 variables, and 275 constraints, problems are : Problem set: 0 solved, 184 unsolved in 4423 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 73/73 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 184/184 constraints, Known Traps: 0/0 constraints]
After SMT, in 7702ms problems are : Problem set: 0 solved, 184 unsolved
Search for dead transitions found 0 dead transitions in 7704ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7873 ms. Remains : 73/73 places, 186/186 transitions.
RANDOM walk for 400001 steps (8 resets) in 439 ms. (909 steps per ms) remains 1/1 properties
Running SMT prover for 1 properties.
[2024-05-23 02:54:07] [INFO ] Flow matrix only has 112 transitions (discarded 74 similar events)
[2024-05-23 02:54:07] [INFO ] Invariant cache hit.
[2024-05-23 02:54:07] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 02:54:07] [INFO ] After 23ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-23 02:54:07] [INFO ] State equation strengthened by 15 read => feed constraints.
[2024-05-23 02:54:07] [INFO ] After 6ms SMT Verify possible using 15 Read/Feed constraints in real domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-23 02:54:07] [INFO ] After 13ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 02:54:07] [INFO ] After 61ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 02:54:07] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 02:54:07] [INFO ] After 22ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 02:54:07] [INFO ] After 4ms SMT Verify possible using 15 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-23 02:54:07] [INFO ] After 9ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-23 02:54:07] [INFO ] After 58ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
RANDOM walk for 40003 steps (8 resets) in 95 ms. (416 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 62 ms. (634 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2072365 steps, run timeout after 3001 ms. (steps per millisecond=690 ) properties seen :0 out of 1
Probabilistic random walk after 2072365 steps, saw 1289960 distinct states, run finished after 3001 ms. (steps per millisecond=690 ) properties seen :0
[2024-05-23 02:54:10] [INFO ] Flow matrix only has 112 transitions (discarded 74 similar events)
[2024-05-23 02:54:10] [INFO ] Invariant cache hit.
[2024-05-23 02:54:10] [INFO ] State equation strengthened by 15 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) 47/48 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 81/129 variables, 48/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 19/148 variables, 4/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/148 variables, 12/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/148 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 6/154 variables, 2/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/154 variables, 2/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/154 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 17/171 variables, 11/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/171 variables, 3/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/171 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 7/178 variables, 4/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/178 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 4/182 variables, 2/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/182 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 3/185 variables, 2/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/185 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/185 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 185/185 variables, and 91 constraints, problems are : Problem set: 0 solved, 1 unsolved in 77 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 73/73 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 47/48 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 81/129 variables, 48/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 19/148 variables, 4/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/148 variables, 12/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/148 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/148 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 6/154 variables, 2/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/154 variables, 2/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/154 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 17/171 variables, 11/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/171 variables, 3/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/171 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 7/178 variables, 4/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/178 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 4/182 variables, 2/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/182 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 3/185 variables, 2/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/185 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/185 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 185/185 variables, and 92 constraints, problems are : Problem set: 0 solved, 1 unsolved in 74 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 73/73 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 155ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 58 ms.
Support contains 1 out of 73 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 73/73 places, 186/186 transitions.
Applied a total of 0 rules in 2 ms. Remains 73 /73 variables (removed 0) and now considering 186/186 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 73/73 places, 186/186 transitions.
RANDOM walk for 40000 steps (8 resets) in 61 ms. (645 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 22 ms. (1739 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2075912 steps, run timeout after 3001 ms. (steps per millisecond=691 ) properties seen :0 out of 1
Probabilistic random walk after 2075912 steps, saw 1292169 distinct states, run finished after 3001 ms. (steps per millisecond=691 ) properties seen :0
[2024-05-23 02:54:13] [INFO ] Flow matrix only has 112 transitions (discarded 74 similar events)
[2024-05-23 02:54:13] [INFO ] Invariant cache hit.
[2024-05-23 02:54:13] [INFO ] State equation strengthened by 15 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) 47/48 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 81/129 variables, 48/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 19/148 variables, 4/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/148 variables, 12/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/148 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 6/154 variables, 2/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/154 variables, 2/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/154 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 17/171 variables, 11/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/171 variables, 3/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/171 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 7/178 variables, 4/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/178 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 4/182 variables, 2/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/182 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 3/185 variables, 2/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/185 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/185 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 185/185 variables, and 91 constraints, problems are : Problem set: 0 solved, 1 unsolved in 78 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 73/73 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 47/48 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 81/129 variables, 48/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 19/148 variables, 4/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/148 variables, 12/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/148 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/148 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 6/154 variables, 2/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/154 variables, 2/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/154 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 17/171 variables, 11/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/171 variables, 3/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/171 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 7/178 variables, 4/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/178 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 4/182 variables, 2/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/182 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 3/185 variables, 2/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/185 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/185 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 185/185 variables, and 92 constraints, problems are : Problem set: 0 solved, 1 unsolved in 83 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 73/73 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 165ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 58 ms.
Support contains 1 out of 73 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 73/73 places, 186/186 transitions.
Applied a total of 0 rules in 2 ms. Remains 73 /73 variables (removed 0) and now considering 186/186 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 73/73 places, 186/186 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 73/73 places, 186/186 transitions.
Applied a total of 0 rules in 2 ms. Remains 73 /73 variables (removed 0) and now considering 186/186 (removed 0) transitions.
[2024-05-23 02:54:13] [INFO ] Flow matrix only has 112 transitions (discarded 74 similar events)
[2024-05-23 02:54:13] [INFO ] Invariant cache hit.
[2024-05-23 02:54:14] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-05-23 02:54:14] [INFO ] Flow matrix only has 112 transitions (discarded 74 similar events)
[2024-05-23 02:54:14] [INFO ] Invariant cache hit.
[2024-05-23 02:54:14] [INFO ] State equation strengthened by 15 read => feed constraints.
[2024-05-23 02:54:14] [INFO ] Implicit Places using invariants and state equation in 107 ms returned []
Implicit Place search using SMT with State Equation took 167 ms to find 0 implicit places.
[2024-05-23 02:54:14] [INFO ] Redundant transitions in 1 ms returned []
Running 184 sub problems to find dead transitions.
[2024-05-23 02:54:14] [INFO ] Flow matrix only has 112 transitions (discarded 74 similar events)
[2024-05-23 02:54:14] [INFO ] Invariant cache hit.
[2024-05-23 02:54:14] [INFO ] State equation strengthened by 15 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/73 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 2 (OVERLAPS) 112/185 variables, 73/76 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/185 variables, 15/91 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/185 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 5 (OVERLAPS) 0/185 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 184 unsolved
No progress, stopping.
After SMT solving in domain Real declared 185/185 variables, and 91 constraints, problems are : Problem set: 0 solved, 184 unsolved in 3256 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 73/73 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 184/184 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 184 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/73 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 2 (OVERLAPS) 112/185 variables, 73/76 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/185 variables, 15/91 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/185 variables, 184/275 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/185 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 6 (OVERLAPS) 0/185 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 184 unsolved
No progress, stopping.
After SMT solving in domain Int declared 185/185 variables, and 275 constraints, problems are : Problem set: 0 solved, 184 unsolved in 4161 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 73/73 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 184/184 constraints, Known Traps: 0/0 constraints]
After SMT, in 7524ms problems are : Problem set: 0 solved, 184 unsolved
Search for dead transitions found 0 dead transitions in 7526ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7701 ms. Remains : 73/73 places, 186/186 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 74 transitions
Reduce isomorphic transitions removed 74 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 81 rules applied. Total rules applied 81 place count 73 transition count 105
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 88 place count 66 transition count 105
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 88 place count 66 transition count 94
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 110 place count 55 transition count 94
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 138 place count 41 transition count 80
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 144 place count 35 transition count 68
Iterating global reduction 2 with 6 rules applied. Total rules applied 150 place count 35 transition count 68
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 156 place count 29 transition count 56
Iterating global reduction 2 with 6 rules applied. Total rules applied 162 place count 29 transition count 56
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 168 place count 23 transition count 44
Iterating global reduction 2 with 6 rules applied. Total rules applied 174 place count 23 transition count 44
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 180 place count 23 transition count 38
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 184 place count 21 transition count 39
Applied a total of 184 rules in 17 ms. Remains 21 /73 variables (removed 52) and now considering 39/186 (removed 147) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 39 rows 21 cols
[2024-05-23 02:54:21] [INFO ] Computed 3 invariants in 1 ms
[2024-05-23 02:54:21] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 02:54:21] [INFO ] After 28ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 02:54:21] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 02:54:21] [INFO ] After 10ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 02:54:21] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-23 02:54:21] [INFO ] After 2ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-23 02:54:21] [INFO ] After 7ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-23 02:54:21] [INFO ] After 37ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 87 ms.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 74 transitions
Reduce isomorphic transitions removed 74 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 81 rules applied. Total rules applied 81 place count 73 transition count 105
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 88 place count 66 transition count 105
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 88 place count 66 transition count 94
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 110 place count 55 transition count 94
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 138 place count 41 transition count 80
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 144 place count 35 transition count 68
Iterating global reduction 2 with 6 rules applied. Total rules applied 150 place count 35 transition count 68
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 156 place count 29 transition count 56
Iterating global reduction 2 with 6 rules applied. Total rules applied 162 place count 29 transition count 56
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 168 place count 23 transition count 44
Iterating global reduction 2 with 6 rules applied. Total rules applied 174 place count 23 transition count 44
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 180 place count 23 transition count 38
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 184 place count 21 transition count 39
Applied a total of 184 rules in 14 ms. Remains 21 /73 variables (removed 52) and now considering 39/186 (removed 147) transitions.
Running SMT prover for 1 properties.
[2024-05-23 02:54:21] [INFO ] Invariant cache hit.
[2024-05-23 02:54:21] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2024-05-23 02:54:21] [INFO ] After 30ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 02:54:21] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 02:54:21] [INFO ] After 10ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 02:54:21] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-23 02:54:21] [INFO ] After 2ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-23 02:54:21] [INFO ] After 5ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-23 02:54:21] [INFO ] After 34ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 82 ms.
Starting structural reductions in LTL mode, iteration 0 : 187/187 places, 474/474 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 186 transition count 474
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 17 place count 170 transition count 440
Iterating global reduction 1 with 16 rules applied. Total rules applied 33 place count 170 transition count 440
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 47 place count 170 transition count 426
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 55 place count 162 transition count 404
Iterating global reduction 2 with 8 rules applied. Total rules applied 63 place count 162 transition count 404
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 70 place count 155 transition count 386
Iterating global reduction 2 with 7 rules applied. Total rules applied 77 place count 155 transition count 386
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 83 place count 149 transition count 366
Iterating global reduction 2 with 6 rules applied. Total rules applied 89 place count 149 transition count 366
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 95 place count 143 transition count 346
Iterating global reduction 2 with 6 rules applied. Total rules applied 101 place count 143 transition count 346
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 107 place count 137 transition count 326
Iterating global reduction 2 with 6 rules applied. Total rules applied 113 place count 137 transition count 326
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 119 place count 131 transition count 310
Iterating global reduction 2 with 6 rules applied. Total rules applied 125 place count 131 transition count 310
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 131 place count 125 transition count 298
Iterating global reduction 2 with 6 rules applied. Total rules applied 137 place count 125 transition count 298
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 143 place count 119 transition count 286
Iterating global reduction 2 with 6 rules applied. Total rules applied 149 place count 119 transition count 286
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 154 place count 114 transition count 276
Iterating global reduction 2 with 5 rules applied. Total rules applied 159 place count 114 transition count 276
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 163 place count 110 transition count 268
Iterating global reduction 2 with 4 rules applied. Total rules applied 167 place count 110 transition count 268
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 169 place count 108 transition count 264
Iterating global reduction 2 with 2 rules applied. Total rules applied 171 place count 108 transition count 264
Applied a total of 171 rules in 28 ms. Remains 108 /187 variables (removed 79) and now considering 264/474 (removed 210) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 28 ms. Remains : 108/187 places, 264/474 transitions.
[2024-05-23 02:54:21] [INFO ] Flatten gal took : 10 ms
[2024-05-23 02:54:21] [INFO ] Flatten gal took : 9 ms
[2024-05-23 02:54:21] [INFO ] Input system was already deterministic with 264 transitions.
Starting structural reductions in LTL mode, iteration 0 : 187/187 places, 474/474 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 186 transition count 474
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 17 place count 170 transition count 438
Iterating global reduction 1 with 16 rules applied. Total rules applied 33 place count 170 transition count 438
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 45 place count 170 transition count 426
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 53 place count 162 transition count 406
Iterating global reduction 2 with 8 rules applied. Total rules applied 61 place count 162 transition count 406
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 67 place count 156 transition count 390
Iterating global reduction 2 with 6 rules applied. Total rules applied 73 place count 156 transition count 390
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 79 place count 150 transition count 370
Iterating global reduction 2 with 6 rules applied. Total rules applied 85 place count 150 transition count 370
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 91 place count 144 transition count 350
Iterating global reduction 2 with 6 rules applied. Total rules applied 97 place count 144 transition count 350
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 103 place count 138 transition count 330
Iterating global reduction 2 with 6 rules applied. Total rules applied 109 place count 138 transition count 330
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 115 place count 132 transition count 314
Iterating global reduction 2 with 6 rules applied. Total rules applied 121 place count 132 transition count 314
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 127 place count 126 transition count 302
Iterating global reduction 2 with 6 rules applied. Total rules applied 133 place count 126 transition count 302
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 139 place count 120 transition count 290
Iterating global reduction 2 with 6 rules applied. Total rules applied 145 place count 120 transition count 290
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 150 place count 115 transition count 280
Iterating global reduction 2 with 5 rules applied. Total rules applied 155 place count 115 transition count 280
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 159 place count 111 transition count 272
Iterating global reduction 2 with 4 rules applied. Total rules applied 163 place count 111 transition count 272
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 165 place count 109 transition count 268
Iterating global reduction 2 with 2 rules applied. Total rules applied 167 place count 109 transition count 268
Applied a total of 167 rules in 27 ms. Remains 109 /187 variables (removed 78) and now considering 268/474 (removed 206) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 27 ms. Remains : 109/187 places, 268/474 transitions.
[2024-05-23 02:54:21] [INFO ] Flatten gal took : 9 ms
[2024-05-23 02:54:21] [INFO ] Flatten gal took : 9 ms
[2024-05-23 02:54:21] [INFO ] Input system was already deterministic with 268 transitions.
Starting structural reductions in LTL mode, iteration 0 : 187/187 places, 474/474 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 186 transition count 474
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 16 place count 171 transition count 440
Iterating global reduction 1 with 15 rules applied. Total rules applied 31 place count 171 transition count 440
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 39 place count 171 transition count 432
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 46 place count 164 transition count 412
Iterating global reduction 2 with 7 rules applied. Total rules applied 53 place count 164 transition count 412
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 59 place count 158 transition count 398
Iterating global reduction 2 with 6 rules applied. Total rules applied 65 place count 158 transition count 398
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 69 place count 154 transition count 384
Iterating global reduction 2 with 4 rules applied. Total rules applied 73 place count 154 transition count 384
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 77 place count 150 transition count 372
Iterating global reduction 2 with 4 rules applied. Total rules applied 81 place count 150 transition count 372
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 85 place count 146 transition count 358
Iterating global reduction 2 with 4 rules applied. Total rules applied 89 place count 146 transition count 358
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 93 place count 142 transition count 346
Iterating global reduction 2 with 4 rules applied. Total rules applied 97 place count 142 transition count 346
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 101 place count 138 transition count 338
Iterating global reduction 2 with 4 rules applied. Total rules applied 105 place count 138 transition count 338
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 109 place count 134 transition count 330
Iterating global reduction 2 with 4 rules applied. Total rules applied 113 place count 134 transition count 330
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 117 place count 130 transition count 322
Iterating global reduction 2 with 4 rules applied. Total rules applied 121 place count 130 transition count 322
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 123 place count 128 transition count 318
Iterating global reduction 2 with 2 rules applied. Total rules applied 125 place count 128 transition count 318
Applied a total of 125 rules in 23 ms. Remains 128 /187 variables (removed 59) and now considering 318/474 (removed 156) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24 ms. Remains : 128/187 places, 318/474 transitions.
[2024-05-23 02:54:22] [INFO ] Flatten gal took : 9 ms
[2024-05-23 02:54:22] [INFO ] Flatten gal took : 10 ms
[2024-05-23 02:54:22] [INFO ] Input system was already deterministic with 318 transitions.
Starting structural reductions in LTL mode, iteration 0 : 187/187 places, 474/474 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 174 transition count 444
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 174 transition count 444
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 36 place count 174 transition count 434
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 42 place count 168 transition count 418
Iterating global reduction 1 with 6 rules applied. Total rules applied 48 place count 168 transition count 418
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 52 place count 164 transition count 408
Iterating global reduction 1 with 4 rules applied. Total rules applied 56 place count 164 transition count 408
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 59 place count 161 transition count 398
Iterating global reduction 1 with 3 rules applied. Total rules applied 62 place count 161 transition count 398
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 64 place count 159 transition count 392
Iterating global reduction 1 with 2 rules applied. Total rules applied 66 place count 159 transition count 392
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 68 place count 157 transition count 386
Iterating global reduction 1 with 2 rules applied. Total rules applied 70 place count 157 transition count 386
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 72 place count 155 transition count 380
Iterating global reduction 1 with 2 rules applied. Total rules applied 74 place count 155 transition count 380
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 76 place count 153 transition count 376
Iterating global reduction 1 with 2 rules applied. Total rules applied 78 place count 153 transition count 376
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 80 place count 151 transition count 372
Iterating global reduction 1 with 2 rules applied. Total rules applied 82 place count 151 transition count 372
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 83 place count 150 transition count 370
Iterating global reduction 1 with 1 rules applied. Total rules applied 84 place count 150 transition count 370
Applied a total of 84 rules in 22 ms. Remains 150 /187 variables (removed 37) and now considering 370/474 (removed 104) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 22 ms. Remains : 150/187 places, 370/474 transitions.
[2024-05-23 02:54:22] [INFO ] Flatten gal took : 11 ms
[2024-05-23 02:54:22] [INFO ] Flatten gal took : 12 ms
[2024-05-23 02:54:22] [INFO ] Input system was already deterministic with 370 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 187/187 places, 474/474 transitions.
Graph (complete) has 999 edges and 187 vertex of which 186 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 19 place count 168 transition count 434
Iterating global reduction 0 with 18 rules applied. Total rules applied 37 place count 168 transition count 434
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 51 place count 168 transition count 420
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 60 place count 159 transition count 396
Iterating global reduction 1 with 9 rules applied. Total rules applied 69 place count 159 transition count 396
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 76 place count 152 transition count 378
Iterating global reduction 1 with 7 rules applied. Total rules applied 83 place count 152 transition count 378
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 90 place count 145 transition count 354
Iterating global reduction 1 with 7 rules applied. Total rules applied 97 place count 145 transition count 354
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 104 place count 138 transition count 330
Iterating global reduction 1 with 7 rules applied. Total rules applied 111 place count 138 transition count 330
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 118 place count 131 transition count 308
Iterating global reduction 1 with 7 rules applied. Total rules applied 125 place count 131 transition count 308
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 132 place count 124 transition count 290
Iterating global reduction 1 with 7 rules applied. Total rules applied 139 place count 124 transition count 290
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 145 place count 118 transition count 278
Iterating global reduction 1 with 6 rules applied. Total rules applied 151 place count 118 transition count 278
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 157 place count 112 transition count 266
Iterating global reduction 1 with 6 rules applied. Total rules applied 163 place count 112 transition count 266
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 169 place count 106 transition count 254
Iterating global reduction 1 with 6 rules applied. Total rules applied 175 place count 106 transition count 254
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 179 place count 102 transition count 246
Iterating global reduction 1 with 4 rules applied. Total rules applied 183 place count 102 transition count 246
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 185 place count 100 transition count 242
Iterating global reduction 1 with 2 rules applied. Total rules applied 187 place count 100 transition count 242
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 189 place count 100 transition count 240
Applied a total of 189 rules in 39 ms. Remains 100 /187 variables (removed 87) and now considering 240/474 (removed 234) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 39 ms. Remains : 100/187 places, 240/474 transitions.
[2024-05-23 02:54:22] [INFO ] Flatten gal took : 7 ms
[2024-05-23 02:54:22] [INFO ] Flatten gal took : 7 ms
[2024-05-23 02:54:22] [INFO ] Input system was already deterministic with 240 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 187/187 places, 474/474 transitions.
Graph (complete) has 999 edges and 187 vertex of which 186 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 19 place count 168 transition count 434
Iterating global reduction 0 with 18 rules applied. Total rules applied 37 place count 168 transition count 434
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 51 place count 168 transition count 420
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 60 place count 159 transition count 396
Iterating global reduction 1 with 9 rules applied. Total rules applied 69 place count 159 transition count 396
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 76 place count 152 transition count 378
Iterating global reduction 1 with 7 rules applied. Total rules applied 83 place count 152 transition count 378
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 90 place count 145 transition count 354
Iterating global reduction 1 with 7 rules applied. Total rules applied 97 place count 145 transition count 354
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 104 place count 138 transition count 330
Iterating global reduction 1 with 7 rules applied. Total rules applied 111 place count 138 transition count 330
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 118 place count 131 transition count 308
Iterating global reduction 1 with 7 rules applied. Total rules applied 125 place count 131 transition count 308
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 132 place count 124 transition count 290
Iterating global reduction 1 with 7 rules applied. Total rules applied 139 place count 124 transition count 290
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 146 place count 117 transition count 276
Iterating global reduction 1 with 7 rules applied. Total rules applied 153 place count 117 transition count 276
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 160 place count 110 transition count 262
Iterating global reduction 1 with 7 rules applied. Total rules applied 167 place count 110 transition count 262
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 174 place count 103 transition count 248
Iterating global reduction 1 with 7 rules applied. Total rules applied 181 place count 103 transition count 248
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 185 place count 99 transition count 240
Iterating global reduction 1 with 4 rules applied. Total rules applied 189 place count 99 transition count 240
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 191 place count 97 transition count 236
Iterating global reduction 1 with 2 rules applied. Total rules applied 193 place count 97 transition count 236
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 195 place count 97 transition count 234
Applied a total of 195 rules in 34 ms. Remains 97 /187 variables (removed 90) and now considering 234/474 (removed 240) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 35 ms. Remains : 97/187 places, 234/474 transitions.
[2024-05-23 02:54:22] [INFO ] Flatten gal took : 7 ms
[2024-05-23 02:54:22] [INFO ] Flatten gal took : 7 ms
[2024-05-23 02:54:22] [INFO ] Input system was already deterministic with 234 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 187/187 places, 474/474 transitions.
Graph (complete) has 999 edges and 187 vertex of which 186 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 17 place count 170 transition count 440
Iterating global reduction 0 with 16 rules applied. Total rules applied 33 place count 170 transition count 440
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 49 place count 170 transition count 424
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 55 place count 164 transition count 408
Iterating global reduction 1 with 6 rules applied. Total rules applied 61 place count 164 transition count 408
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 66 place count 159 transition count 394
Iterating global reduction 1 with 5 rules applied. Total rules applied 71 place count 159 transition count 394
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 75 place count 155 transition count 382
Iterating global reduction 1 with 4 rules applied. Total rules applied 79 place count 155 transition count 382
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 83 place count 151 transition count 368
Iterating global reduction 1 with 4 rules applied. Total rules applied 87 place count 151 transition count 368
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 91 place count 147 transition count 354
Iterating global reduction 1 with 4 rules applied. Total rules applied 95 place count 147 transition count 354
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 98 place count 144 transition count 348
Iterating global reduction 1 with 3 rules applied. Total rules applied 101 place count 144 transition count 348
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 104 place count 141 transition count 342
Iterating global reduction 1 with 3 rules applied. Total rules applied 107 place count 141 transition count 342
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 110 place count 138 transition count 336
Iterating global reduction 1 with 3 rules applied. Total rules applied 113 place count 138 transition count 336
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 116 place count 135 transition count 330
Iterating global reduction 1 with 3 rules applied. Total rules applied 119 place count 135 transition count 330
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 121 place count 133 transition count 326
Iterating global reduction 1 with 2 rules applied. Total rules applied 123 place count 133 transition count 326
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 1 with 10 rules applied. Total rules applied 133 place count 133 transition count 316
Applied a total of 133 rules in 39 ms. Remains 133 /187 variables (removed 54) and now considering 316/474 (removed 158) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 39 ms. Remains : 133/187 places, 316/474 transitions.
[2024-05-23 02:54:22] [INFO ] Flatten gal took : 8 ms
[2024-05-23 02:54:22] [INFO ] Flatten gal took : 9 ms
[2024-05-23 02:54:22] [INFO ] Input system was already deterministic with 316 transitions.
Starting structural reductions in LTL mode, iteration 0 : 187/187 places, 474/474 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 186 transition count 474
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 19 place count 168 transition count 434
Iterating global reduction 1 with 18 rules applied. Total rules applied 37 place count 168 transition count 434
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 51 place count 168 transition count 420
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 58 place count 161 transition count 404
Iterating global reduction 2 with 7 rules applied. Total rules applied 65 place count 161 transition count 404
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 70 place count 156 transition count 390
Iterating global reduction 2 with 5 rules applied. Total rules applied 75 place count 156 transition count 390
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 80 place count 151 transition count 374
Iterating global reduction 2 with 5 rules applied. Total rules applied 85 place count 151 transition count 374
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 90 place count 146 transition count 358
Iterating global reduction 2 with 5 rules applied. Total rules applied 95 place count 146 transition count 358
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 99 place count 142 transition count 344
Iterating global reduction 2 with 4 rules applied. Total rules applied 103 place count 142 transition count 344
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 107 place count 138 transition count 332
Iterating global reduction 2 with 4 rules applied. Total rules applied 111 place count 138 transition count 332
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 115 place count 134 transition count 324
Iterating global reduction 2 with 4 rules applied. Total rules applied 119 place count 134 transition count 324
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 123 place count 130 transition count 316
Iterating global reduction 2 with 4 rules applied. Total rules applied 127 place count 130 transition count 316
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 131 place count 126 transition count 308
Iterating global reduction 2 with 4 rules applied. Total rules applied 135 place count 126 transition count 308
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 138 place count 123 transition count 302
Iterating global reduction 2 with 3 rules applied. Total rules applied 141 place count 123 transition count 302
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 143 place count 121 transition count 298
Iterating global reduction 2 with 2 rules applied. Total rules applied 145 place count 121 transition count 298
Applied a total of 145 rules in 21 ms. Remains 121 /187 variables (removed 66) and now considering 298/474 (removed 176) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 21 ms. Remains : 121/187 places, 298/474 transitions.
[2024-05-23 02:54:22] [INFO ] Flatten gal took : 8 ms
[2024-05-23 02:54:22] [INFO ] Flatten gal took : 9 ms
[2024-05-23 02:54:22] [INFO ] Input system was already deterministic with 298 transitions.
Starting structural reductions in LTL mode, iteration 0 : 187/187 places, 474/474 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 186 transition count 474
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 18 place count 169 transition count 438
Iterating global reduction 1 with 17 rules applied. Total rules applied 35 place count 169 transition count 438
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 51 place count 169 transition count 422
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 58 place count 162 transition count 404
Iterating global reduction 2 with 7 rules applied. Total rules applied 65 place count 162 transition count 404
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 71 place count 156 transition count 388
Iterating global reduction 2 with 6 rules applied. Total rules applied 77 place count 156 transition count 388
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 82 place count 151 transition count 372
Iterating global reduction 2 with 5 rules applied. Total rules applied 87 place count 151 transition count 372
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 92 place count 146 transition count 356
Iterating global reduction 2 with 5 rules applied. Total rules applied 97 place count 146 transition count 356
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 102 place count 141 transition count 338
Iterating global reduction 2 with 5 rules applied. Total rules applied 107 place count 141 transition count 338
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 112 place count 136 transition count 324
Iterating global reduction 2 with 5 rules applied. Total rules applied 117 place count 136 transition count 324
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 122 place count 131 transition count 314
Iterating global reduction 2 with 5 rules applied. Total rules applied 127 place count 131 transition count 314
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 132 place count 126 transition count 304
Iterating global reduction 2 with 5 rules applied. Total rules applied 137 place count 126 transition count 304
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 142 place count 121 transition count 294
Iterating global reduction 2 with 5 rules applied. Total rules applied 147 place count 121 transition count 294
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 150 place count 118 transition count 288
Iterating global reduction 2 with 3 rules applied. Total rules applied 153 place count 118 transition count 288
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 155 place count 116 transition count 284
Iterating global reduction 2 with 2 rules applied. Total rules applied 157 place count 116 transition count 284
Applied a total of 157 rules in 21 ms. Remains 116 /187 variables (removed 71) and now considering 284/474 (removed 190) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 21 ms. Remains : 116/187 places, 284/474 transitions.
[2024-05-23 02:54:22] [INFO ] Flatten gal took : 7 ms
[2024-05-23 02:54:22] [INFO ] Flatten gal took : 8 ms
[2024-05-23 02:54:22] [INFO ] Input system was already deterministic with 284 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 187/187 places, 474/474 transitions.
Graph (complete) has 999 edges and 187 vertex of which 186 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 19 place count 168 transition count 434
Iterating global reduction 0 with 18 rules applied. Total rules applied 37 place count 168 transition count 434
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 51 place count 168 transition count 420
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 60 place count 159 transition count 396
Iterating global reduction 1 with 9 rules applied. Total rules applied 69 place count 159 transition count 396
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 76 place count 152 transition count 378
Iterating global reduction 1 with 7 rules applied. Total rules applied 83 place count 152 transition count 378
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 90 place count 145 transition count 354
Iterating global reduction 1 with 7 rules applied. Total rules applied 97 place count 145 transition count 354
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 103 place count 139 transition count 334
Iterating global reduction 1 with 6 rules applied. Total rules applied 109 place count 139 transition count 334
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 115 place count 133 transition count 314
Iterating global reduction 1 with 6 rules applied. Total rules applied 121 place count 133 transition count 314
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 127 place count 127 transition count 298
Iterating global reduction 1 with 6 rules applied. Total rules applied 133 place count 127 transition count 298
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 139 place count 121 transition count 286
Iterating global reduction 1 with 6 rules applied. Total rules applied 145 place count 121 transition count 286
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 151 place count 115 transition count 274
Iterating global reduction 1 with 6 rules applied. Total rules applied 157 place count 115 transition count 274
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 163 place count 109 transition count 262
Iterating global reduction 1 with 6 rules applied. Total rules applied 169 place count 109 transition count 262
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 173 place count 105 transition count 254
Iterating global reduction 1 with 4 rules applied. Total rules applied 177 place count 105 transition count 254
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 179 place count 103 transition count 250
Iterating global reduction 1 with 2 rules applied. Total rules applied 181 place count 103 transition count 250
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 185 place count 103 transition count 246
Applied a total of 185 rules in 36 ms. Remains 103 /187 variables (removed 84) and now considering 246/474 (removed 228) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 36 ms. Remains : 103/187 places, 246/474 transitions.
[2024-05-23 02:54:22] [INFO ] Flatten gal took : 7 ms
[2024-05-23 02:54:22] [INFO ] Flatten gal took : 7 ms
[2024-05-23 02:54:22] [INFO ] Input system was already deterministic with 246 transitions.
Starting structural reductions in LTL mode, iteration 0 : 187/187 places, 474/474 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 186 transition count 474
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 19 place count 168 transition count 434
Iterating global reduction 1 with 18 rules applied. Total rules applied 37 place count 168 transition count 434
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 51 place count 168 transition count 420
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 59 place count 160 transition count 400
Iterating global reduction 2 with 8 rules applied. Total rules applied 67 place count 160 transition count 400
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 72 place count 155 transition count 386
Iterating global reduction 2 with 5 rules applied. Total rules applied 77 place count 155 transition count 386
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 82 place count 150 transition count 370
Iterating global reduction 2 with 5 rules applied. Total rules applied 87 place count 150 transition count 370
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 92 place count 145 transition count 354
Iterating global reduction 2 with 5 rules applied. Total rules applied 97 place count 145 transition count 354
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 102 place count 140 transition count 336
Iterating global reduction 2 with 5 rules applied. Total rules applied 107 place count 140 transition count 336
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 112 place count 135 transition count 322
Iterating global reduction 2 with 5 rules applied. Total rules applied 117 place count 135 transition count 322
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 122 place count 130 transition count 312
Iterating global reduction 2 with 5 rules applied. Total rules applied 127 place count 130 transition count 312
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 132 place count 125 transition count 302
Iterating global reduction 2 with 5 rules applied. Total rules applied 137 place count 125 transition count 302
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 142 place count 120 transition count 292
Iterating global reduction 2 with 5 rules applied. Total rules applied 147 place count 120 transition count 292
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 151 place count 116 transition count 284
Iterating global reduction 2 with 4 rules applied. Total rules applied 155 place count 116 transition count 284
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 157 place count 114 transition count 280
Iterating global reduction 2 with 2 rules applied. Total rules applied 159 place count 114 transition count 280
Applied a total of 159 rules in 21 ms. Remains 114 /187 variables (removed 73) and now considering 280/474 (removed 194) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 21 ms. Remains : 114/187 places, 280/474 transitions.
[2024-05-23 02:54:22] [INFO ] Flatten gal took : 6 ms
[2024-05-23 02:54:22] [INFO ] Flatten gal took : 7 ms
[2024-05-23 02:54:22] [INFO ] Input system was already deterministic with 280 transitions.
[2024-05-23 02:54:22] [INFO ] Flatten gal took : 12 ms
[2024-05-23 02:54:22] [INFO ] Flatten gal took : 13 ms
[2024-05-23 02:54:22] [INFO ] Export to MCC of 13 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 3 ms.
[2024-05-23 02:54:22] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 187 places, 474 transitions and 1908 arcs took 4 ms.
Total runtime 159261 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running FunctionPointer-PT-b064

IS_COLORED=
IS_NUPN=

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


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


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

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

Process ID: 727
MODEL NAME: /home/mcc/execution/412/model
187 places, 474 transitions.
Enabling coverability test.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Building monolithic NSF...
Building monolithic NSF...
Building monolithic NSF...
Building monolithic NSF...
Start RS construction.
coverability test failed!!
Convergence in 11 steps.
The state space is infinite.
CANNOT_COMPUTE
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716432868276

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLCardinality -timeout 360 -rebuildPNML

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="FunctionPointer-PT-b064"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is FunctionPointer-PT-b064, 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 r179-tall-171640601100257"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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