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-171640601100225.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-b004, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r179-tall-171640601100225
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 820K
-rw-r--r-- 1 mcc users 8.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 100K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:45 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 22 14:45 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:18 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 18:23 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.9K Apr 11 16:08 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 90K Apr 11 16:08 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.0K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K May 14 13:22 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-b004-CTLCardinality-2024-00
FORMULA_NAME FunctionPointer-PT-b004-CTLCardinality-2024-01
FORMULA_NAME FunctionPointer-PT-b004-CTLCardinality-2024-02
FORMULA_NAME FunctionPointer-PT-b004-CTLCardinality-2024-03
FORMULA_NAME FunctionPointer-PT-b004-CTLCardinality-2024-04
FORMULA_NAME FunctionPointer-PT-b004-CTLCardinality-2024-05
FORMULA_NAME FunctionPointer-PT-b004-CTLCardinality-2024-06
FORMULA_NAME FunctionPointer-PT-b004-CTLCardinality-2024-07
FORMULA_NAME FunctionPointer-PT-b004-CTLCardinality-2024-08
FORMULA_NAME FunctionPointer-PT-b004-CTLCardinality-2024-09
FORMULA_NAME FunctionPointer-PT-b004-CTLCardinality-2024-10
FORMULA_NAME FunctionPointer-PT-b004-CTLCardinality-2024-11
FORMULA_NAME FunctionPointer-PT-b004-CTLCardinality-2023-12
FORMULA_NAME FunctionPointer-PT-b004-CTLCardinality-2023-13
FORMULA_NAME FunctionPointer-PT-b004-CTLCardinality-2023-14
FORMULA_NAME FunctionPointer-PT-b004-CTLCardinality-2023-15

=== Now, execution of the tool begins

BK_START 1716431626213

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-b004
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-23 02:33:47] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-23 02:33:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 02:33:47] [INFO ] Load time of PNML (sax parser for PT used): 101 ms
[2024-05-23 02:33:47] [INFO ] Transformed 306 places.
[2024-05-23 02:33:47] [INFO ] Transformed 840 transitions.
[2024-05-23 02:33:47] [INFO ] Parsed PT model containing 306 places and 840 transitions and 3392 arcs in 205 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 16 ms.
Deduced a syphon composed of 84 places in 7 ms
Reduce places removed 84 places and 192 transitions.
FORMULA FunctionPointer-PT-b004-CTLCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 90 out of 222 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 222/222 places, 648/648 transitions.
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 215 transition count 648
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 19 place count 203 transition count 576
Iterating global reduction 1 with 12 rules applied. Total rules applied 31 place count 203 transition count 576
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 1 with 40 rules applied. Total rules applied 71 place count 203 transition count 536
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 76 place count 198 transition count 526
Iterating global reduction 2 with 5 rules applied. Total rules applied 81 place count 198 transition count 526
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 2 with 20 rules applied. Total rules applied 101 place count 198 transition count 506
Applied a total of 101 rules in 58 ms. Remains 198 /222 variables (removed 24) and now considering 506/648 (removed 142) transitions.
[2024-05-23 02:33:47] [INFO ] Flow matrix only has 341 transitions (discarded 165 similar events)
// Phase 1: matrix 341 rows 198 cols
[2024-05-23 02:33:47] [INFO ] Computed 2 invariants in 21 ms
[2024-05-23 02:33:48] [INFO ] Implicit Places using invariants in 277 ms returned []
[2024-05-23 02:33:48] [INFO ] Flow matrix only has 341 transitions (discarded 165 similar events)
[2024-05-23 02:33:48] [INFO ] Invariant cache hit.
[2024-05-23 02:33:48] [INFO ] State equation strengthened by 64 read => feed constraints.
[2024-05-23 02:33:48] [INFO ] Implicit Places using invariants and state equation in 295 ms returned []
Implicit Place search using SMT with State Equation took 600 ms to find 0 implicit places.
Running 504 sub problems to find dead transitions.
[2024-05-23 02:33:48] [INFO ] Flow matrix only has 341 transitions (discarded 165 similar events)
[2024-05-23 02:33:48] [INFO ] Invariant cache hit.
[2024-05-23 02:33:48] [INFO ] State equation strengthened by 64 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/195 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 504 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/195 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 504 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/195 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 504 unsolved
At refinement iteration 3 (OVERLAPS) 341/536 variables, 195/197 constraints. Problems are: Problem set: 0 solved, 504 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/536 variables, 64/261 constraints. Problems are: Problem set: 0 solved, 504 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/536 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 504 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 3/539 variables, 3/264 constraints. Problems are: Problem set: 0 solved, 504 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/539 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 504 unsolved
At refinement iteration 8 (OVERLAPS) 0/539 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 504 unsolved
No progress, stopping.
After SMT solving in domain Real declared 539/539 variables, and 264 constraints, problems are : Problem set: 0 solved, 504 unsolved in 20992 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 198/198 constraints, ReadFeed: 64/64 constraints, PredecessorRefiner: 504/504 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 504 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/195 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 504 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/195 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 504 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/195 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 504 unsolved
At refinement iteration 3 (OVERLAPS) 341/536 variables, 195/197 constraints. Problems are: Problem set: 0 solved, 504 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/536 variables, 64/261 constraints. Problems are: Problem set: 0 solved, 504 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/536 variables, 32/293 constraints. Problems are: Problem set: 0 solved, 504 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/536 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 504 unsolved
At refinement iteration 7 (OVERLAPS) 3/539 variables, 3/296 constraints. Problems are: Problem set: 0 solved, 504 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/539 variables, 472/768 constraints. Problems are: Problem set: 0 solved, 504 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/539 variables, 0/768 constraints. Problems are: Problem set: 0 solved, 504 unsolved
At refinement iteration 10 (OVERLAPS) 0/539 variables, 0/768 constraints. Problems are: Problem set: 0 solved, 504 unsolved
No progress, stopping.
After SMT solving in domain Int declared 539/539 variables, and 768 constraints, problems are : Problem set: 0 solved, 504 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 198/198 constraints, ReadFeed: 64/64 constraints, PredecessorRefiner: 504/504 constraints, Known Traps: 0/0 constraints]
After SMT, in 51771ms problems are : Problem set: 0 solved, 504 unsolved
Search for dead transitions found 0 dead transitions in 51788ms
Starting structural reductions in LTL mode, iteration 1 : 198/222 places, 506/648 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 52467 ms. Remains : 198/222 places, 506/648 transitions.
Support contains 90 out of 198 places after structural reductions.
[2024-05-23 02:34:40] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-05-23 02:34:40] [INFO ] Flatten gal took : 59 ms
FORMULA FunctionPointer-PT-b004-CTLCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-23 02:34:40] [INFO ] Flatten gal took : 28 ms
[2024-05-23 02:34:40] [INFO ] Input system was already deterministic with 506 transitions.
Support contains 78 out of 198 places (down from 90) after GAL structural reductions.
RANDOM walk for 40003 steps (49 resets) in 1720 ms. (23 steps per ms) remains 10/52 properties
BEST_FIRST walk for 40004 steps (10 resets) in 140 ms. (283 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (12 resets) in 72 ms. (548 steps per ms) remains 9/10 properties
BEST_FIRST walk for 40003 steps (10 resets) in 79 ms. (500 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (15 resets) in 76 ms. (519 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (11 resets) in 63 ms. (625 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (10 resets) in 83 ms. (476 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (9 resets) in 62 ms. (634 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (11 resets) in 62 ms. (634 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (9 resets) in 163 ms. (243 steps per ms) remains 9/9 properties
[2024-05-23 02:34:41] [INFO ] Flow matrix only has 341 transitions (discarded 165 similar events)
[2024-05-23 02:34:41] [INFO ] Invariant cache hit.
[2024-05-23 02:34:41] [INFO ] State equation strengthened by 64 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 46/65 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 24/89 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 196/285 variables, 89/91 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/285 variables, 31/122 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/285 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp26 is UNSAT
Problem AtomicPropp29 is UNSAT
At refinement iteration 8 (OVERLAPS) 171/456 variables, 56/178 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/456 variables, 25/203 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/456 variables, 0/203 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 78/534 variables, 48/251 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/534 variables, 8/259 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/534 variables, 0/259 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 5/539 variables, 5/264 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/539 variables, 0/264 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 0/539 variables, 0/264 constraints. Problems are: Problem set: 7 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 539/539 variables, and 264 constraints, problems are : Problem set: 7 solved, 2 unsolved in 273 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 198/198 constraints, ReadFeed: 64/64 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 7 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 47/56 variables, 1/1 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/1 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 30/86 variables, 1/2 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/86 variables, 0/2 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 174/260 variables, 86/88 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/260 variables, 15/103 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/260 variables, 0/103 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 150/410 variables, 41/144 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/410 variables, 41/185 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/410 variables, 2/187 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/410 variables, 0/187 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 115/525 variables, 57/244 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/525 variables, 8/252 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/525 variables, 0/252 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 14/539 variables, 14/266 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/539 variables, 0/266 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 0/539 variables, 0/266 constraints. Problems are: Problem set: 7 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 539/539 variables, and 266 constraints, problems are : Problem set: 7 solved, 2 unsolved in 260 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 198/198 constraints, ReadFeed: 64/64 constraints, PredecessorRefiner: 2/9 constraints, Known Traps: 0/0 constraints]
After SMT, in 546ms problems are : Problem set: 7 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 3 ms.
Support contains 9 out of 198 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 198/198 places, 506/506 transitions.
Graph (complete) has 792 edges and 198 vertex of which 174 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.3 ms
Discarding 24 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 43 transitions
Reduce isomorphic transitions removed 43 transitions.
Iterating post reduction 0 with 43 rules applied. Total rules applied 44 place count 174 transition count 463
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 62 place count 156 transition count 415
Iterating global reduction 1 with 18 rules applied. Total rules applied 80 place count 156 transition count 415
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 98 place count 156 transition count 397
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 107 place count 147 transition count 377
Iterating global reduction 2 with 9 rules applied. Total rules applied 116 place count 147 transition count 377
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 120 place count 143 transition count 367
Iterating global reduction 2 with 4 rules applied. Total rules applied 124 place count 143 transition count 367
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 128 place count 139 transition count 353
Iterating global reduction 2 with 4 rules applied. Total rules applied 132 place count 139 transition count 353
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 136 place count 135 transition count 341
Iterating global reduction 2 with 4 rules applied. Total rules applied 140 place count 135 transition count 341
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 144 place count 131 transition count 327
Iterating global reduction 2 with 4 rules applied. Total rules applied 148 place count 131 transition count 327
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 152 place count 127 transition count 315
Iterating global reduction 2 with 4 rules applied. Total rules applied 156 place count 127 transition count 315
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 160 place count 123 transition count 307
Iterating global reduction 2 with 4 rules applied. Total rules applied 164 place count 123 transition count 307
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 168 place count 119 transition count 299
Iterating global reduction 2 with 4 rules applied. Total rules applied 172 place count 119 transition count 299
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 174 place count 117 transition count 295
Iterating global reduction 2 with 2 rules applied. Total rules applied 176 place count 117 transition count 295
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 178 place count 115 transition count 291
Iterating global reduction 2 with 2 rules applied. Total rules applied 180 place count 115 transition count 291
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 181 place count 114 transition count 289
Iterating global reduction 2 with 1 rules applied. Total rules applied 182 place count 114 transition count 289
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 2 with 8 rules applied. Total rules applied 190 place count 114 transition count 281
Applied a total of 190 rules in 110 ms. Remains 114 /198 variables (removed 84) and now considering 281/506 (removed 225) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 110 ms. Remains : 114/198 places, 281/506 transitions.
RANDOM walk for 40004 steps (8 resets) in 153 ms. (259 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 46 ms. (851 steps per ms) remains 1/1 properties
[2024-05-23 02:34:42] [INFO ] Flow matrix only has 185 transitions (discarded 96 similar events)
// Phase 1: matrix 185 rows 114 cols
[2024-05-23 02:34:42] [INFO ] Computed 3 invariants in 1 ms
[2024-05-23 02:34:42] [INFO ] State equation strengthened by 32 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 47/54 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 100/154 variables, 54/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/154 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 71/225 variables, 17/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/225 variables, 1/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/225 variables, 27/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/225 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 9/234 variables, 1/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/234 variables, 1/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/234 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 50/284 variables, 32/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/284 variables, 5/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/284 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 15/299 variables, 10/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/299 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/299 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 299/299 variables, and 149 constraints, problems are : Problem set: 0 solved, 1 unsolved in 96 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 114/114 constraints, ReadFeed: 32/32 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/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 47/54 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 100/154 variables, 54/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/154 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 71/225 variables, 17/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/225 variables, 1/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/225 variables, 27/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/225 variables, 1/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/225 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 9/234 variables, 1/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/234 variables, 1/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/234 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 50/284 variables, 32/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/284 variables, 5/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/284 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 15/299 variables, 10/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/299 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/299 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 299/299 variables, and 150 constraints, problems are : Problem set: 0 solved, 1 unsolved in 112 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 114/114 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 216ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 36 ms.
Support contains 7 out of 114 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 114/114 places, 281/281 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 113 transition count 279
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 113 transition count 279
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 112 transition count 277
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 112 transition count 277
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 111 transition count 273
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 111 transition count 273
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 110 transition count 271
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 110 transition count 271
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 109 transition count 267
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 109 transition count 267
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 108 transition count 265
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 108 transition count 265
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 107 transition count 263
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 107 transition count 263
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 106 transition count 261
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 106 transition count 261
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 105 transition count 259
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 105 transition count 259
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 104 transition count 257
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 104 transition count 257
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 103 transition count 255
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 103 transition count 255
Applied a total of 22 rules in 35 ms. Remains 103 /114 variables (removed 11) and now considering 255/281 (removed 26) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35 ms. Remains : 103/114 places, 255/281 transitions.
RANDOM walk for 40005 steps (8 resets) in 100 ms. (396 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 66 ms. (597 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1612319 steps, run timeout after 3018 ms. (steps per millisecond=534 ) properties seen :0 out of 1
Probabilistic random walk after 1612319 steps, saw 1054725 distinct states, run finished after 3032 ms. (steps per millisecond=531 ) properties seen :0
[2024-05-23 02:34:45] [INFO ] Flow matrix only has 166 transitions (discarded 89 similar events)
// Phase 1: matrix 166 rows 103 cols
[2024-05-23 02:34:45] [INFO ] Computed 3 invariants in 1 ms
[2024-05-23 02:34:45] [INFO ] State equation strengthened by 28 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 47/54 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 100/154 variables, 54/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/154 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 61/215 variables, 17/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/215 variables, 1/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/215 variables, 25/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/215 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 6/221 variables, 1/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/221 variables, 2/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/221 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 38/259 variables, 23/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/259 variables, 3/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/259 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 10/269 variables, 7/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/269 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/269 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 269/269 variables, and 134 constraints, problems are : Problem set: 0 solved, 1 unsolved in 86 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 103/103 constraints, ReadFeed: 28/28 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/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 47/54 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 100/154 variables, 54/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/154 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 61/215 variables, 17/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/215 variables, 1/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/215 variables, 25/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/215 variables, 1/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/215 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 6/221 variables, 1/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/221 variables, 2/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/221 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 38/259 variables, 23/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/259 variables, 3/128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/259 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 10/269 variables, 7/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/269 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/269 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 269/269 variables, and 135 constraints, problems are : Problem set: 0 solved, 1 unsolved in 112 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 103/103 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 204ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 27 ms.
Support contains 7 out of 103 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 103/103 places, 255/255 transitions.
Applied a total of 0 rules in 7 ms. Remains 103 /103 variables (removed 0) and now considering 255/255 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 103/103 places, 255/255 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 103/103 places, 255/255 transitions.
Applied a total of 0 rules in 6 ms. Remains 103 /103 variables (removed 0) and now considering 255/255 (removed 0) transitions.
[2024-05-23 02:34:45] [INFO ] Flow matrix only has 166 transitions (discarded 89 similar events)
[2024-05-23 02:34:45] [INFO ] Invariant cache hit.
[2024-05-23 02:34:45] [INFO ] Implicit Places using invariants in 75 ms returned []
[2024-05-23 02:34:45] [INFO ] Flow matrix only has 166 transitions (discarded 89 similar events)
[2024-05-23 02:34:45] [INFO ] Invariant cache hit.
[2024-05-23 02:34:45] [INFO ] State equation strengthened by 28 read => feed constraints.
[2024-05-23 02:34:45] [INFO ] Implicit Places using invariants and state equation in 128 ms returned []
Implicit Place search using SMT with State Equation took 214 ms to find 0 implicit places.
[2024-05-23 02:34:45] [INFO ] Redundant transitions in 9 ms returned []
Running 253 sub problems to find dead transitions.
[2024-05-23 02:34:46] [INFO ] Flow matrix only has 166 transitions (discarded 89 similar events)
[2024-05-23 02:34:46] [INFO ] Invariant cache hit.
[2024-05-23 02:34:46] [INFO ] State equation strengthened by 28 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 2 (OVERLAPS) 166/269 variables, 103/106 constraints. Problems are: Problem set: 0 solved, 253 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/269 variables, 28/134 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/269 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 5 (OVERLAPS) 0/269 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 253 unsolved
No progress, stopping.
After SMT solving in domain Real declared 269/269 variables, and 134 constraints, problems are : Problem set: 0 solved, 253 unsolved in 4221 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 103/103 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 253/253 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 253 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 2 (OVERLAPS) 166/269 variables, 103/106 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/269 variables, 28/134 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/269 variables, 253/387 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/269 variables, 0/387 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 6 (OVERLAPS) 0/269 variables, 0/387 constraints. Problems are: Problem set: 0 solved, 253 unsolved
No progress, stopping.
After SMT solving in domain Int declared 269/269 variables, and 387 constraints, problems are : Problem set: 0 solved, 253 unsolved in 7024 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 103/103 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 253/253 constraints, Known Traps: 0/0 constraints]
After SMT, in 11456ms problems are : Problem set: 0 solved, 253 unsolved
Search for dead transitions found 0 dead transitions in 11459ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11704 ms. Remains : 103/103 places, 255/255 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 89 transitions
Reduce isomorphic transitions removed 89 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 97 rules applied. Total rules applied 97 place count 103 transition count 158
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 105 place count 95 transition count 158
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 19 Pre rules applied. Total rules applied 105 place count 95 transition count 139
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 143 place count 76 transition count 139
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 179 place count 58 transition count 121
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 185 place count 52 transition count 109
Iterating global reduction 2 with 6 rules applied. Total rules applied 191 place count 52 transition count 109
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 197 place count 46 transition count 97
Iterating global reduction 2 with 6 rules applied. Total rules applied 203 place count 46 transition count 97
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 209 place count 40 transition count 85
Iterating global reduction 2 with 6 rules applied. Total rules applied 215 place count 40 transition count 85
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 221 place count 40 transition count 79
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 229 place count 36 transition count 80
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 232 place count 36 transition count 77
Applied a total of 232 rules in 19 ms. Remains 36 /103 variables (removed 67) and now considering 77/255 (removed 178) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 77 rows 36 cols
[2024-05-23 02:34:57] [INFO ] Computed 3 invariants in 0 ms
[2024-05-23 02:34:57] [INFO ] After 20ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 02:34:57] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 02:34:57] [INFO ] After 17ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 02:34:57] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-23 02:34:57] [INFO ] After 3ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-23 02:34:57] [INFO ] After 9ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-23 02:34:57] [INFO ] After 59ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 120 ms.
Successfully simplified 7 atomic propositions for a total of 14 simplifications.
[2024-05-23 02:34:57] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-05-23 02:34:57] [INFO ] Flatten gal took : 24 ms
FORMULA FunctionPointer-PT-b004-CTLCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-23 02:34:57] [INFO ] Flatten gal took : 25 ms
[2024-05-23 02:34:57] [INFO ] Input system was already deterministic with 506 transitions.
Support contains 62 out of 198 places (down from 63) after GAL structural reductions.
Computed a total of 24 stabilizing places and 64 stable transitions
Graph (complete) has 1054 edges and 198 vertex of which 195 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.4 ms
Starting structural reductions in LTL mode, iteration 0 : 198/198 places, 506/506 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 195 transition count 506
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 23 place count 175 transition count 450
Iterating global reduction 1 with 20 rules applied. Total rules applied 43 place count 175 transition count 450
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 59 place count 175 transition count 434
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 70 place count 164 transition count 410
Iterating global reduction 2 with 11 rules applied. Total rules applied 81 place count 164 transition count 410
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 88 place count 157 transition count 394
Iterating global reduction 2 with 7 rules applied. Total rules applied 95 place count 157 transition count 394
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 102 place count 150 transition count 368
Iterating global reduction 2 with 7 rules applied. Total rules applied 109 place count 150 transition count 368
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 115 place count 144 transition count 352
Iterating global reduction 2 with 6 rules applied. Total rules applied 121 place count 144 transition count 352
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 127 place count 138 transition count 330
Iterating global reduction 2 with 6 rules applied. Total rules applied 133 place count 138 transition count 330
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 139 place count 132 transition count 310
Iterating global reduction 2 with 6 rules applied. Total rules applied 145 place count 132 transition count 310
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 151 place count 126 transition count 298
Iterating global reduction 2 with 6 rules applied. Total rules applied 157 place count 126 transition count 298
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 163 place count 120 transition count 286
Iterating global reduction 2 with 6 rules applied. Total rules applied 169 place count 120 transition count 286
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 175 place count 114 transition count 274
Iterating global reduction 2 with 6 rules applied. Total rules applied 181 place count 114 transition count 274
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 186 place count 109 transition count 264
Iterating global reduction 2 with 5 rules applied. Total rules applied 191 place count 109 transition count 264
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 195 place count 105 transition count 256
Iterating global reduction 2 with 4 rules applied. Total rules applied 199 place count 105 transition count 256
Applied a total of 199 rules in 31 ms. Remains 105 /198 variables (removed 93) and now considering 256/506 (removed 250) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31 ms. Remains : 105/198 places, 256/506 transitions.
[2024-05-23 02:34:57] [INFO ] Flatten gal took : 11 ms
[2024-05-23 02:34:57] [INFO ] Flatten gal took : 11 ms
[2024-05-23 02:34:57] [INFO ] Input system was already deterministic with 256 transitions.
Starting structural reductions in LTL mode, iteration 0 : 198/198 places, 506/506 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 195 transition count 506
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 23 place count 175 transition count 450
Iterating global reduction 1 with 20 rules applied. Total rules applied 43 place count 175 transition count 450
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 59 place count 175 transition count 434
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 70 place count 164 transition count 410
Iterating global reduction 2 with 11 rules applied. Total rules applied 81 place count 164 transition count 410
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 88 place count 157 transition count 394
Iterating global reduction 2 with 7 rules applied. Total rules applied 95 place count 157 transition count 394
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 102 place count 150 transition count 368
Iterating global reduction 2 with 7 rules applied. Total rules applied 109 place count 150 transition count 368
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 116 place count 143 transition count 350
Iterating global reduction 2 with 7 rules applied. Total rules applied 123 place count 143 transition count 350
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 130 place count 136 transition count 324
Iterating global reduction 2 with 7 rules applied. Total rules applied 137 place count 136 transition count 324
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 144 place count 129 transition count 300
Iterating global reduction 2 with 7 rules applied. Total rules applied 151 place count 129 transition count 300
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 158 place count 122 transition count 286
Iterating global reduction 2 with 7 rules applied. Total rules applied 165 place count 122 transition count 286
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 172 place count 115 transition count 272
Iterating global reduction 2 with 7 rules applied. Total rules applied 179 place count 115 transition count 272
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 186 place count 108 transition count 258
Iterating global reduction 2 with 7 rules applied. Total rules applied 193 place count 108 transition count 258
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 199 place count 102 transition count 246
Iterating global reduction 2 with 6 rules applied. Total rules applied 205 place count 102 transition count 246
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 209 place count 98 transition count 238
Iterating global reduction 2 with 4 rules applied. Total rules applied 213 place count 98 transition count 238
Applied a total of 213 rules in 33 ms. Remains 98 /198 variables (removed 100) and now considering 238/506 (removed 268) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33 ms. Remains : 98/198 places, 238/506 transitions.
[2024-05-23 02:34:57] [INFO ] Flatten gal took : 9 ms
[2024-05-23 02:34:57] [INFO ] Flatten gal took : 10 ms
[2024-05-23 02:34:57] [INFO ] Input system was already deterministic with 238 transitions.
Starting structural reductions in LTL mode, iteration 0 : 198/198 places, 506/506 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 181 transition count 456
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 181 transition count 456
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 50 place count 181 transition count 440
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 57 place count 174 transition count 424
Iterating global reduction 1 with 7 rules applied. Total rules applied 64 place count 174 transition count 424
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 67 place count 171 transition count 416
Iterating global reduction 1 with 3 rules applied. Total rules applied 70 place count 171 transition count 416
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 73 place count 168 transition count 406
Iterating global reduction 1 with 3 rules applied. Total rules applied 76 place count 168 transition count 406
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 79 place count 165 transition count 396
Iterating global reduction 1 with 3 rules applied. Total rules applied 82 place count 165 transition count 396
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 85 place count 162 transition count 386
Iterating global reduction 1 with 3 rules applied. Total rules applied 88 place count 162 transition count 386
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 91 place count 159 transition count 378
Iterating global reduction 1 with 3 rules applied. Total rules applied 94 place count 159 transition count 378
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 97 place count 156 transition count 372
Iterating global reduction 1 with 3 rules applied. Total rules applied 100 place count 156 transition count 372
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 103 place count 153 transition count 366
Iterating global reduction 1 with 3 rules applied. Total rules applied 106 place count 153 transition count 366
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 109 place count 150 transition count 360
Iterating global reduction 1 with 3 rules applied. Total rules applied 112 place count 150 transition count 360
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 114 place count 148 transition count 356
Iterating global reduction 1 with 2 rules applied. Total rules applied 116 place count 148 transition count 356
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 117 place count 147 transition count 354
Iterating global reduction 1 with 1 rules applied. Total rules applied 118 place count 147 transition count 354
Applied a total of 118 rules in 30 ms. Remains 147 /198 variables (removed 51) and now considering 354/506 (removed 152) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30 ms. Remains : 147/198 places, 354/506 transitions.
[2024-05-23 02:34:57] [INFO ] Flatten gal took : 14 ms
[2024-05-23 02:34:57] [INFO ] Flatten gal took : 14 ms
[2024-05-23 02:34:57] [INFO ] Input system was already deterministic with 354 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 198/198 places, 506/506 transitions.
Graph (complete) has 1054 edges and 198 vertex of which 195 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 0 output transitions
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 21 place count 175 transition count 450
Iterating global reduction 0 with 20 rules applied. Total rules applied 41 place count 175 transition count 450
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 57 place count 175 transition count 434
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 68 place count 164 transition count 410
Iterating global reduction 1 with 11 rules applied. Total rules applied 79 place count 164 transition count 410
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 86 place count 157 transition count 394
Iterating global reduction 1 with 7 rules applied. Total rules applied 93 place count 157 transition count 394
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 100 place count 150 transition count 368
Iterating global reduction 1 with 7 rules applied. Total rules applied 107 place count 150 transition count 368
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 114 place count 143 transition count 350
Iterating global reduction 1 with 7 rules applied. Total rules applied 121 place count 143 transition count 350
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 127 place count 137 transition count 328
Iterating global reduction 1 with 6 rules applied. Total rules applied 133 place count 137 transition count 328
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 139 place count 131 transition count 308
Iterating global reduction 1 with 6 rules applied. Total rules applied 145 place count 131 transition count 308
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 151 place count 125 transition count 296
Iterating global reduction 1 with 6 rules applied. Total rules applied 157 place count 125 transition count 296
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 163 place count 119 transition count 284
Iterating global reduction 1 with 6 rules applied. Total rules applied 169 place count 119 transition count 284
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 175 place count 113 transition count 272
Iterating global reduction 1 with 6 rules applied. Total rules applied 181 place count 113 transition count 272
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 186 place count 108 transition count 262
Iterating global reduction 1 with 5 rules applied. Total rules applied 191 place count 108 transition count 262
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 195 place count 104 transition count 254
Iterating global reduction 1 with 4 rules applied. Total rules applied 199 place count 104 transition count 254
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 201 place count 104 transition count 252
Applied a total of 201 rules in 63 ms. Remains 104 /198 variables (removed 94) and now considering 252/506 (removed 254) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 63 ms. Remains : 104/198 places, 252/506 transitions.
[2024-05-23 02:34:58] [INFO ] Flatten gal took : 9 ms
[2024-05-23 02:34:58] [INFO ] Flatten gal took : 9 ms
[2024-05-23 02:34:58] [INFO ] Input system was already deterministic with 252 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 198/198 places, 506/506 transitions.
Graph (complete) has 1054 edges and 198 vertex of which 195 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 0 output transitions
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 19 place count 177 transition count 458
Iterating global reduction 0 with 18 rules applied. Total rules applied 37 place count 177 transition count 458
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 55 place count 177 transition count 440
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 65 place count 167 transition count 418
Iterating global reduction 1 with 10 rules applied. Total rules applied 75 place count 167 transition count 418
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 80 place count 162 transition count 406
Iterating global reduction 1 with 5 rules applied. Total rules applied 85 place count 162 transition count 406
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 90 place count 157 transition count 388
Iterating global reduction 1 with 5 rules applied. Total rules applied 95 place count 157 transition count 388
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 100 place count 152 transition count 374
Iterating global reduction 1 with 5 rules applied. Total rules applied 105 place count 152 transition count 374
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 110 place count 147 transition count 356
Iterating global reduction 1 with 5 rules applied. Total rules applied 115 place count 147 transition count 356
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 120 place count 142 transition count 340
Iterating global reduction 1 with 5 rules applied. Total rules applied 125 place count 142 transition count 340
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 130 place count 137 transition count 330
Iterating global reduction 1 with 5 rules applied. Total rules applied 135 place count 137 transition count 330
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 140 place count 132 transition count 320
Iterating global reduction 1 with 5 rules applied. Total rules applied 145 place count 132 transition count 320
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 148 place count 129 transition count 314
Iterating global reduction 1 with 3 rules applied. Total rules applied 151 place count 129 transition count 314
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 154 place count 126 transition count 308
Iterating global reduction 1 with 3 rules applied. Total rules applied 157 place count 126 transition count 308
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 159 place count 124 transition count 304
Iterating global reduction 1 with 2 rules applied. Total rules applied 161 place count 124 transition count 304
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 167 place count 124 transition count 298
Applied a total of 167 rules in 55 ms. Remains 124 /198 variables (removed 74) and now considering 298/506 (removed 208) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 55 ms. Remains : 124/198 places, 298/506 transitions.
[2024-05-23 02:34:58] [INFO ] Flatten gal took : 10 ms
[2024-05-23 02:34:58] [INFO ] Flatten gal took : 10 ms
[2024-05-23 02:34:58] [INFO ] Input system was already deterministic with 298 transitions.
RANDOM walk for 40001 steps (80 resets) in 224 ms. (177 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (20 resets) in 127 ms. (312 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1597922 steps, run timeout after 3001 ms. (steps per millisecond=532 ) properties seen :0 out of 1
Probabilistic random walk after 1597922 steps, saw 1050444 distinct states, run finished after 3001 ms. (steps per millisecond=532 ) properties seen :0
[2024-05-23 02:35:01] [INFO ] Flow matrix only has 207 transitions (discarded 91 similar events)
// Phase 1: matrix 207 rows 124 cols
[2024-05-23 02:35:01] [INFO ] Computed 2 invariants in 5 ms
[2024-05-23 02:35:01] [INFO ] State equation strengthened by 47 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 47/54 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 100/154 variables, 54/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/154 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 81/235 variables, 17/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/235 variables, 37/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/235 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 6/241 variables, 1/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/241 variables, 2/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/241 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 73/314 variables, 37/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/314 variables, 10/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/314 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 17/331 variables, 14/173 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/331 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/331 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 331/331 variables, and 173 constraints, problems are : Problem set: 0 solved, 1 unsolved in 106 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 124/124 constraints, ReadFeed: 47/47 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/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 47/54 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 100/154 variables, 54/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/154 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 81/235 variables, 17/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/235 variables, 37/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/235 variables, 1/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/235 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 6/241 variables, 1/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/241 variables, 2/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/241 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 73/314 variables, 37/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/314 variables, 10/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/314 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 17/331 variables, 14/174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/331 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/331 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 331/331 variables, and 174 constraints, problems are : Problem set: 0 solved, 1 unsolved in 124 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 124/124 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 247ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 0 ms.
Support contains 7 out of 124 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 124/124 places, 298/298 transitions.
Graph (complete) has 499 edges and 124 vertex of which 103 are kept as prefixes of interest. Removing 21 places using SCC suffix rule.0 ms
Discarding 21 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 43 transitions
Reduce isomorphic transitions removed 43 transitions.
Iterating post reduction 0 with 43 rules applied. Total rules applied 44 place count 103 transition count 255
Applied a total of 44 rules in 11 ms. Remains 103 /124 variables (removed 21) and now considering 255/298 (removed 43) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 103/124 places, 255/298 transitions.
RANDOM walk for 4000000 steps (8 resets) in 6019 ms. (664 steps per ms) remains 1/1 properties
BEST_FIRST walk for 4000004 steps (8 resets) in 2590 ms. (1543 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 3436891 steps, run timeout after 6001 ms. (steps per millisecond=572 ) properties seen :0 out of 1
Probabilistic random walk after 3436891 steps, saw 2127123 distinct states, run finished after 6001 ms. (steps per millisecond=572 ) properties seen :0
[2024-05-23 02:35:09] [INFO ] Flow matrix only has 166 transitions (discarded 89 similar events)
// Phase 1: matrix 166 rows 103 cols
[2024-05-23 02:35:09] [INFO ] Computed 3 invariants in 1 ms
[2024-05-23 02:35:09] [INFO ] State equation strengthened by 28 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 47/54 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 100/154 variables, 54/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/154 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 61/215 variables, 17/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/215 variables, 1/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/215 variables, 25/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/215 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 6/221 variables, 1/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/221 variables, 2/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/221 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 38/259 variables, 23/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/259 variables, 3/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/259 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 10/269 variables, 7/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/269 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/269 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 269/269 variables, and 134 constraints, problems are : Problem set: 0 solved, 1 unsolved in 121 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 103/103 constraints, ReadFeed: 28/28 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/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 47/54 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 100/154 variables, 54/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/154 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 61/215 variables, 17/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/215 variables, 1/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/215 variables, 25/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/215 variables, 1/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/215 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 6/221 variables, 1/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/221 variables, 2/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/221 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 38/259 variables, 23/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/259 variables, 3/128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/259 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 10/269 variables, 7/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/269 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/269 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 269/269 variables, and 135 constraints, problems are : Problem set: 0 solved, 1 unsolved in 130 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 103/103 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 258ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 29 ms.
Support contains 7 out of 103 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 103/103 places, 255/255 transitions.
Applied a total of 0 rules in 5 ms. Remains 103 /103 variables (removed 0) and now considering 255/255 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 103/103 places, 255/255 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 103/103 places, 255/255 transitions.
Applied a total of 0 rules in 5 ms. Remains 103 /103 variables (removed 0) and now considering 255/255 (removed 0) transitions.
[2024-05-23 02:35:10] [INFO ] Flow matrix only has 166 transitions (discarded 89 similar events)
[2024-05-23 02:35:10] [INFO ] Invariant cache hit.
[2024-05-23 02:35:10] [INFO ] Implicit Places using invariants in 68 ms returned []
[2024-05-23 02:35:10] [INFO ] Flow matrix only has 166 transitions (discarded 89 similar events)
[2024-05-23 02:35:10] [INFO ] Invariant cache hit.
[2024-05-23 02:35:10] [INFO ] State equation strengthened by 28 read => feed constraints.
[2024-05-23 02:35:10] [INFO ] Implicit Places using invariants and state equation in 140 ms returned []
Implicit Place search using SMT with State Equation took 210 ms to find 0 implicit places.
[2024-05-23 02:35:10] [INFO ] Redundant transitions in 4 ms returned []
Running 253 sub problems to find dead transitions.
[2024-05-23 02:35:10] [INFO ] Flow matrix only has 166 transitions (discarded 89 similar events)
[2024-05-23 02:35:10] [INFO ] Invariant cache hit.
[2024-05-23 02:35:10] [INFO ] State equation strengthened by 28 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 2 (OVERLAPS) 166/269 variables, 103/106 constraints. Problems are: Problem set: 0 solved, 253 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/269 variables, 28/134 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/269 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 5 (OVERLAPS) 0/269 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 253 unsolved
No progress, stopping.
After SMT solving in domain Real declared 269/269 variables, and 134 constraints, problems are : Problem set: 0 solved, 253 unsolved in 4015 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 103/103 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 253/253 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 253 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 2 (OVERLAPS) 166/269 variables, 103/106 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/269 variables, 28/134 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/269 variables, 253/387 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/269 variables, 0/387 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 6 (OVERLAPS) 0/269 variables, 0/387 constraints. Problems are: Problem set: 0 solved, 253 unsolved
No progress, stopping.
After SMT solving in domain Int declared 269/269 variables, and 387 constraints, problems are : Problem set: 0 solved, 253 unsolved in 7024 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 103/103 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 253/253 constraints, Known Traps: 0/0 constraints]
After SMT, in 11274ms problems are : Problem set: 0 solved, 253 unsolved
Search for dead transitions found 0 dead transitions in 11278ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11508 ms. Remains : 103/103 places, 255/255 transitions.
RANDOM walk for 400000 steps (8 resets) in 2832 ms. (141 steps per ms) remains 2/5 properties
Running SMT prover for 2 properties.
[2024-05-23 02:35:22] [INFO ] Flow matrix only has 166 transitions (discarded 89 similar events)
[2024-05-23 02:35:22] [INFO ] Invariant cache hit.
[2024-05-23 02:35:22] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2024-05-23 02:35:22] [INFO ] After 31ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2024-05-23 02:35:22] [INFO ] State equation strengthened by 28 read => feed constraints.
[2024-05-23 02:35:22] [INFO ] After 5ms SMT Verify possible using 28 Read/Feed constraints in real domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-05-23 02:35:22] [INFO ] After 21ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-23 02:35:22] [INFO ] After 77ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-23 02:35:22] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 02:35:22] [INFO ] After 34ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-23 02:35:22] [INFO ] After 4ms SMT Verify possible using 28 Read/Feed constraints in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-05-23 02:35:22] [INFO ] After 26ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-05-23 02:35:22] [INFO ] After 106ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
RANDOM walk for 4000000 steps (8 resets) in 5275 ms. (758 steps per ms) remains 1/1 properties
BEST_FIRST walk for 4000004 steps (8 resets) in 2568 ms. (1557 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 3608210 steps, run timeout after 6001 ms. (steps per millisecond=601 ) properties seen :0 out of 1
Probabilistic random walk after 3608210 steps, saw 2224236 distinct states, run finished after 6001 ms. (steps per millisecond=601 ) properties seen :0
[2024-05-23 02:35:30] [INFO ] Flow matrix only has 166 transitions (discarded 89 similar events)
[2024-05-23 02:35:30] [INFO ] Invariant cache hit.
[2024-05-23 02:35:30] [INFO ] State equation strengthened by 28 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 47/54 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 100/154 variables, 54/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/154 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 61/215 variables, 17/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/215 variables, 1/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/215 variables, 25/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/215 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 6/221 variables, 1/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/221 variables, 2/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/221 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 38/259 variables, 23/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/259 variables, 3/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/259 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 10/269 variables, 7/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/269 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/269 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 269/269 variables, and 134 constraints, problems are : Problem set: 0 solved, 1 unsolved in 100 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 103/103 constraints, ReadFeed: 28/28 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/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 47/54 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 100/154 variables, 54/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/154 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 61/215 variables, 17/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/215 variables, 1/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/215 variables, 25/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/215 variables, 1/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/215 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 6/221 variables, 1/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/221 variables, 2/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/221 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 38/259 variables, 23/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/259 variables, 3/128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/259 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 10/269 variables, 7/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/269 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/269 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 269/269 variables, and 135 constraints, problems are : Problem set: 0 solved, 1 unsolved in 131 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 103/103 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 240ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 27 ms.
Support contains 7 out of 103 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 103/103 places, 255/255 transitions.
Applied a total of 0 rules in 4 ms. Remains 103 /103 variables (removed 0) and now considering 255/255 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 103/103 places, 255/255 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 103/103 places, 255/255 transitions.
Applied a total of 0 rules in 4 ms. Remains 103 /103 variables (removed 0) and now considering 255/255 (removed 0) transitions.
[2024-05-23 02:35:30] [INFO ] Flow matrix only has 166 transitions (discarded 89 similar events)
[2024-05-23 02:35:30] [INFO ] Invariant cache hit.
[2024-05-23 02:35:31] [INFO ] Implicit Places using invariants in 64 ms returned []
[2024-05-23 02:35:31] [INFO ] Flow matrix only has 166 transitions (discarded 89 similar events)
[2024-05-23 02:35:31] [INFO ] Invariant cache hit.
[2024-05-23 02:35:31] [INFO ] State equation strengthened by 28 read => feed constraints.
[2024-05-23 02:35:31] [INFO ] Implicit Places using invariants and state equation in 127 ms returned []
Implicit Place search using SMT with State Equation took 192 ms to find 0 implicit places.
[2024-05-23 02:35:31] [INFO ] Redundant transitions in 3 ms returned []
Running 253 sub problems to find dead transitions.
[2024-05-23 02:35:31] [INFO ] Flow matrix only has 166 transitions (discarded 89 similar events)
[2024-05-23 02:35:31] [INFO ] Invariant cache hit.
[2024-05-23 02:35:31] [INFO ] State equation strengthened by 28 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 2 (OVERLAPS) 166/269 variables, 103/106 constraints. Problems are: Problem set: 0 solved, 253 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/269 variables, 28/134 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/269 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 5 (OVERLAPS) 0/269 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 253 unsolved
No progress, stopping.
After SMT solving in domain Real declared 269/269 variables, and 134 constraints, problems are : Problem set: 0 solved, 253 unsolved in 4055 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 103/103 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 253/253 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 253 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 2 (OVERLAPS) 166/269 variables, 103/106 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/269 variables, 28/134 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/269 variables, 253/387 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/269 variables, 0/387 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 6 (OVERLAPS) 0/269 variables, 0/387 constraints. Problems are: Problem set: 0 solved, 253 unsolved
No progress, stopping.
After SMT solving in domain Int declared 269/269 variables, and 387 constraints, problems are : Problem set: 0 solved, 253 unsolved in 7126 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 103/103 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 253/253 constraints, Known Traps: 0/0 constraints]
After SMT, in 11369ms problems are : Problem set: 0 solved, 253 unsolved
Search for dead transitions found 0 dead transitions in 11404ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11611 ms. Remains : 103/103 places, 255/255 transitions.
RANDOM walk for 400000 steps (8 resets) in 759 ms. (526 steps per ms) remains 0/5 properties
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 89 transitions
Reduce isomorphic transitions removed 89 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 97 rules applied. Total rules applied 97 place count 103 transition count 158
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 105 place count 95 transition count 158
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 19 Pre rules applied. Total rules applied 105 place count 95 transition count 139
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 143 place count 76 transition count 139
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 179 place count 58 transition count 121
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 185 place count 52 transition count 109
Iterating global reduction 2 with 6 rules applied. Total rules applied 191 place count 52 transition count 109
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 197 place count 46 transition count 97
Iterating global reduction 2 with 6 rules applied. Total rules applied 203 place count 46 transition count 97
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 209 place count 40 transition count 85
Iterating global reduction 2 with 6 rules applied. Total rules applied 215 place count 40 transition count 85
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 221 place count 40 transition count 79
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 229 place count 36 transition count 80
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 232 place count 36 transition count 77
Applied a total of 232 rules in 16 ms. Remains 36 /103 variables (removed 67) and now considering 77/255 (removed 178) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 77 rows 36 cols
[2024-05-23 02:35:42] [INFO ] Computed 3 invariants in 0 ms
[2024-05-23 02:35:42] [INFO ] After 22ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 02:35:42] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 02:35:42] [INFO ] After 19ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 02:35:42] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-23 02:35:42] [INFO ] After 4ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-23 02:35:42] [INFO ] After 9ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-23 02:35:42] [INFO ] After 58ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 101 ms.
Starting structural reductions in LTL mode, iteration 0 : 198/198 places, 506/506 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 195 transition count 506
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 21 place count 177 transition count 454
Iterating global reduction 1 with 18 rules applied. Total rules applied 39 place count 177 transition count 454
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 53 place count 177 transition count 440
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 62 place count 168 transition count 422
Iterating global reduction 2 with 9 rules applied. Total rules applied 71 place count 168 transition count 422
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 77 place count 162 transition count 408
Iterating global reduction 2 with 6 rules applied. Total rules applied 83 place count 162 transition count 408
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 89 place count 156 transition count 386
Iterating global reduction 2 with 6 rules applied. Total rules applied 95 place count 156 transition count 386
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 100 place count 151 transition count 376
Iterating global reduction 2 with 5 rules applied. Total rules applied 105 place count 151 transition count 376
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 109 place count 147 transition count 360
Iterating global reduction 2 with 4 rules applied. Total rules applied 113 place count 147 transition count 360
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 117 place count 143 transition count 344
Iterating global reduction 2 with 4 rules applied. Total rules applied 121 place count 143 transition count 344
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 125 place count 139 transition count 336
Iterating global reduction 2 with 4 rules applied. Total rules applied 129 place count 139 transition count 336
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 133 place count 135 transition count 328
Iterating global reduction 2 with 4 rules applied. Total rules applied 137 place count 135 transition count 328
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 141 place count 131 transition count 320
Iterating global reduction 2 with 4 rules applied. Total rules applied 145 place count 131 transition count 320
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 149 place count 127 transition count 312
Iterating global reduction 2 with 4 rules applied. Total rules applied 153 place count 127 transition count 312
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 157 place count 123 transition count 304
Iterating global reduction 2 with 4 rules applied. Total rules applied 161 place count 123 transition count 304
Applied a total of 161 rules in 32 ms. Remains 123 /198 variables (removed 75) and now considering 304/506 (removed 202) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33 ms. Remains : 123/198 places, 304/506 transitions.
[2024-05-23 02:35:43] [INFO ] Flatten gal took : 9 ms
[2024-05-23 02:35:43] [INFO ] Flatten gal took : 10 ms
[2024-05-23 02:35:43] [INFO ] Input system was already deterministic with 304 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 198/198 places, 506/506 transitions.
Graph (complete) has 1054 edges and 198 vertex of which 195 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.5 ms
Discarding 3 places :
Also discarding 0 output transitions
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 20 place count 176 transition count 452
Iterating global reduction 0 with 19 rules applied. Total rules applied 39 place count 176 transition count 452
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 53 place count 176 transition count 438
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 64 place count 165 transition count 414
Iterating global reduction 1 with 11 rules applied. Total rules applied 75 place count 165 transition count 414
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 82 place count 158 transition count 398
Iterating global reduction 1 with 7 rules applied. Total rules applied 89 place count 158 transition count 398
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 96 place count 151 transition count 372
Iterating global reduction 1 with 7 rules applied. Total rules applied 103 place count 151 transition count 372
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 110 place count 144 transition count 354
Iterating global reduction 1 with 7 rules applied. Total rules applied 117 place count 144 transition count 354
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 124 place count 137 transition count 328
Iterating global reduction 1 with 7 rules applied. Total rules applied 131 place count 137 transition count 328
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 138 place count 130 transition count 304
Iterating global reduction 1 with 7 rules applied. Total rules applied 145 place count 130 transition count 304
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 152 place count 123 transition count 290
Iterating global reduction 1 with 7 rules applied. Total rules applied 159 place count 123 transition count 290
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 166 place count 116 transition count 276
Iterating global reduction 1 with 7 rules applied. Total rules applied 173 place count 116 transition count 276
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 179 place count 110 transition count 264
Iterating global reduction 1 with 6 rules applied. Total rules applied 185 place count 110 transition count 264
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 191 place count 104 transition count 252
Iterating global reduction 1 with 6 rules applied. Total rules applied 197 place count 104 transition count 252
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 202 place count 99 transition count 242
Iterating global reduction 1 with 5 rules applied. Total rules applied 207 place count 99 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 209 place count 99 transition count 240
Applied a total of 209 rules in 42 ms. Remains 99 /198 variables (removed 99) and now considering 240/506 (removed 266) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 42 ms. Remains : 99/198 places, 240/506 transitions.
[2024-05-23 02:35:43] [INFO ] Flatten gal took : 7 ms
[2024-05-23 02:35:43] [INFO ] Flatten gal took : 7 ms
[2024-05-23 02:35:43] [INFO ] Input system was already deterministic with 240 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 198/198 places, 506/506 transitions.
Graph (complete) has 1054 edges and 198 vertex of which 195 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 0 output transitions
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 21 place count 175 transition count 450
Iterating global reduction 0 with 20 rules applied. Total rules applied 41 place count 175 transition count 450
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 57 place count 175 transition count 434
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 67 place count 165 transition count 412
Iterating global reduction 1 with 10 rules applied. Total rules applied 77 place count 165 transition count 412
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 83 place count 159 transition count 398
Iterating global reduction 1 with 6 rules applied. Total rules applied 89 place count 159 transition count 398
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 95 place count 153 transition count 376
Iterating global reduction 1 with 6 rules applied. Total rules applied 101 place count 153 transition count 376
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 107 place count 147 transition count 360
Iterating global reduction 1 with 6 rules applied. Total rules applied 113 place count 147 transition count 360
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 119 place count 141 transition count 338
Iterating global reduction 1 with 6 rules applied. Total rules applied 125 place count 141 transition count 338
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 131 place count 135 transition count 318
Iterating global reduction 1 with 6 rules applied. Total rules applied 137 place count 135 transition count 318
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 143 place count 129 transition count 306
Iterating global reduction 1 with 6 rules applied. Total rules applied 149 place count 129 transition count 306
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 155 place count 123 transition count 294
Iterating global reduction 1 with 6 rules applied. Total rules applied 161 place count 123 transition count 294
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 167 place count 117 transition count 282
Iterating global reduction 1 with 6 rules applied. Total rules applied 173 place count 117 transition count 282
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 178 place count 112 transition count 272
Iterating global reduction 1 with 5 rules applied. Total rules applied 183 place count 112 transition count 272
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 187 place count 108 transition count 264
Iterating global reduction 1 with 4 rules applied. Total rules applied 191 place count 108 transition count 264
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 195 place count 108 transition count 260
Applied a total of 195 rules in 33 ms. Remains 108 /198 variables (removed 90) and now considering 260/506 (removed 246) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 34 ms. Remains : 108/198 places, 260/506 transitions.
[2024-05-23 02:35:43] [INFO ] Flatten gal took : 8 ms
[2024-05-23 02:35:43] [INFO ] Flatten gal took : 8 ms
[2024-05-23 02:35:43] [INFO ] Input system was already deterministic with 260 transitions.
RANDOM walk for 15721 steps (37 resets) in 50 ms. (308 steps per ms) remains 0/1 properties
FORMULA FunctionPointer-PT-b004-CTLCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 198/198 places, 506/506 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 195 transition count 506
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 21 place count 177 transition count 454
Iterating global reduction 1 with 18 rules applied. Total rules applied 39 place count 177 transition count 454
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 51 place count 177 transition count 442
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 60 place count 168 transition count 422
Iterating global reduction 2 with 9 rules applied. Total rules applied 69 place count 168 transition count 422
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 75 place count 162 transition count 410
Iterating global reduction 2 with 6 rules applied. Total rules applied 81 place count 162 transition count 410
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 87 place count 156 transition count 386
Iterating global reduction 2 with 6 rules applied. Total rules applied 93 place count 156 transition count 386
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 99 place count 150 transition count 372
Iterating global reduction 2 with 6 rules applied. Total rules applied 105 place count 150 transition count 372
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 110 place count 145 transition count 354
Iterating global reduction 2 with 5 rules applied. Total rules applied 115 place count 145 transition count 354
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 120 place count 140 transition count 336
Iterating global reduction 2 with 5 rules applied. Total rules applied 125 place count 140 transition count 336
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 130 place count 135 transition count 326
Iterating global reduction 2 with 5 rules applied. Total rules applied 135 place count 135 transition count 326
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 140 place count 130 transition count 316
Iterating global reduction 2 with 5 rules applied. Total rules applied 145 place count 130 transition count 316
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 149 place count 126 transition count 308
Iterating global reduction 2 with 4 rules applied. Total rules applied 153 place count 126 transition count 308
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 157 place count 122 transition count 300
Iterating global reduction 2 with 4 rules applied. Total rules applied 161 place count 122 transition count 300
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 165 place count 118 transition count 292
Iterating global reduction 2 with 4 rules applied. Total rules applied 169 place count 118 transition count 292
Applied a total of 169 rules in 22 ms. Remains 118 /198 variables (removed 80) and now considering 292/506 (removed 214) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 22 ms. Remains : 118/198 places, 292/506 transitions.
[2024-05-23 02:35:43] [INFO ] Flatten gal took : 8 ms
[2024-05-23 02:35:43] [INFO ] Flatten gal took : 8 ms
[2024-05-23 02:35:43] [INFO ] Input system was already deterministic with 292 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 198/198 places, 506/506 transitions.
Graph (complete) has 1054 edges and 198 vertex of which 195 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 0 output transitions
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 19 place count 177 transition count 462
Iterating global reduction 0 with 18 rules applied. Total rules applied 37 place count 177 transition count 462
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 0 with 24 rules applied. Total rules applied 61 place count 177 transition count 438
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 69 place count 169 transition count 420
Iterating global reduction 1 with 8 rules applied. Total rules applied 77 place count 169 transition count 420
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 83 place count 163 transition count 406
Iterating global reduction 1 with 6 rules applied. Total rules applied 89 place count 163 transition count 406
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 94 place count 158 transition count 388
Iterating global reduction 1 with 5 rules applied. Total rules applied 99 place count 158 transition count 388
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 104 place count 153 transition count 376
Iterating global reduction 1 with 5 rules applied. Total rules applied 109 place count 153 transition count 376
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 113 place count 149 transition count 360
Iterating global reduction 1 with 4 rules applied. Total rules applied 117 place count 149 transition count 360
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 121 place count 145 transition count 346
Iterating global reduction 1 with 4 rules applied. Total rules applied 125 place count 145 transition count 346
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 129 place count 141 transition count 338
Iterating global reduction 1 with 4 rules applied. Total rules applied 133 place count 141 transition count 338
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 136 place count 138 transition count 332
Iterating global reduction 1 with 3 rules applied. Total rules applied 139 place count 138 transition count 332
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 141 place count 136 transition count 328
Iterating global reduction 1 with 2 rules applied. Total rules applied 143 place count 136 transition count 328
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 145 place count 134 transition count 324
Iterating global reduction 1 with 2 rules applied. Total rules applied 147 place count 134 transition count 324
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 148 place count 133 transition count 322
Iterating global reduction 1 with 1 rules applied. Total rules applied 149 place count 133 transition count 322
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 1 with 8 rules applied. Total rules applied 157 place count 133 transition count 314
Applied a total of 157 rules in 40 ms. Remains 133 /198 variables (removed 65) and now considering 314/506 (removed 192) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 41 ms. Remains : 133/198 places, 314/506 transitions.
[2024-05-23 02:35:43] [INFO ] Flatten gal took : 8 ms
[2024-05-23 02:35:43] [INFO ] Flatten gal took : 9 ms
[2024-05-23 02:35:43] [INFO ] Input system was already deterministic with 314 transitions.
Starting structural reductions in LTL mode, iteration 0 : 198/198 places, 506/506 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 195 transition count 506
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 23 place count 175 transition count 450
Iterating global reduction 1 with 20 rules applied. Total rules applied 43 place count 175 transition count 450
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 59 place count 175 transition count 434
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 70 place count 164 transition count 410
Iterating global reduction 2 with 11 rules applied. Total rules applied 81 place count 164 transition count 410
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 88 place count 157 transition count 394
Iterating global reduction 2 with 7 rules applied. Total rules applied 95 place count 157 transition count 394
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 102 place count 150 transition count 368
Iterating global reduction 2 with 7 rules applied. Total rules applied 109 place count 150 transition count 368
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 116 place count 143 transition count 350
Iterating global reduction 2 with 7 rules applied. Total rules applied 123 place count 143 transition count 350
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 129 place count 137 transition count 328
Iterating global reduction 2 with 6 rules applied. Total rules applied 135 place count 137 transition count 328
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 141 place count 131 transition count 306
Iterating global reduction 2 with 6 rules applied. Total rules applied 147 place count 131 transition count 306
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 153 place count 125 transition count 294
Iterating global reduction 2 with 6 rules applied. Total rules applied 159 place count 125 transition count 294
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 165 place count 119 transition count 282
Iterating global reduction 2 with 6 rules applied. Total rules applied 171 place count 119 transition count 282
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 177 place count 113 transition count 270
Iterating global reduction 2 with 6 rules applied. Total rules applied 183 place count 113 transition count 270
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 188 place count 108 transition count 260
Iterating global reduction 2 with 5 rules applied. Total rules applied 193 place count 108 transition count 260
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 198 place count 103 transition count 250
Iterating global reduction 2 with 5 rules applied. Total rules applied 203 place count 103 transition count 250
Applied a total of 203 rules in 17 ms. Remains 103 /198 variables (removed 95) and now considering 250/506 (removed 256) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18 ms. Remains : 103/198 places, 250/506 transitions.
[2024-05-23 02:35:43] [INFO ] Flatten gal took : 6 ms
[2024-05-23 02:35:43] [INFO ] Flatten gal took : 7 ms
[2024-05-23 02:35:43] [INFO ] Input system was already deterministic with 250 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 198/198 places, 506/506 transitions.
Graph (complete) has 1054 edges and 198 vertex of which 195 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 0 output transitions
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 20 place count 176 transition count 452
Iterating global reduction 0 with 19 rules applied. Total rules applied 39 place count 176 transition count 452
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 53 place count 176 transition count 438
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 64 place count 165 transition count 414
Iterating global reduction 1 with 11 rules applied. Total rules applied 75 place count 165 transition count 414
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 82 place count 158 transition count 398
Iterating global reduction 1 with 7 rules applied. Total rules applied 89 place count 158 transition count 398
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 95 place count 152 transition count 376
Iterating global reduction 1 with 6 rules applied. Total rules applied 101 place count 152 transition count 376
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 107 place count 146 transition count 362
Iterating global reduction 1 with 6 rules applied. Total rules applied 113 place count 146 transition count 362
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 119 place count 140 transition count 338
Iterating global reduction 1 with 6 rules applied. Total rules applied 125 place count 140 transition count 338
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 131 place count 134 transition count 316
Iterating global reduction 1 with 6 rules applied. Total rules applied 137 place count 134 transition count 316
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 142 place count 129 transition count 306
Iterating global reduction 1 with 5 rules applied. Total rules applied 147 place count 129 transition count 306
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 152 place count 124 transition count 296
Iterating global reduction 1 with 5 rules applied. Total rules applied 157 place count 124 transition count 296
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 162 place count 119 transition count 286
Iterating global reduction 1 with 5 rules applied. Total rules applied 167 place count 119 transition count 286
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 172 place count 114 transition count 276
Iterating global reduction 1 with 5 rules applied. Total rules applied 177 place count 114 transition count 276
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 180 place count 111 transition count 270
Iterating global reduction 1 with 3 rules applied. Total rules applied 183 place count 111 transition count 270
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 185 place count 111 transition count 268
Applied a total of 185 rules in 35 ms. Remains 111 /198 variables (removed 87) and now considering 268/506 (removed 238) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 35 ms. Remains : 111/198 places, 268/506 transitions.
[2024-05-23 02:35:43] [INFO ] Flatten gal took : 7 ms
[2024-05-23 02:35:43] [INFO ] Flatten gal took : 7 ms
[2024-05-23 02:35:43] [INFO ] Input system was already deterministic with 268 transitions.
Starting structural reductions in LTL mode, iteration 0 : 198/198 places, 506/506 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 195 transition count 506
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 21 place count 177 transition count 454
Iterating global reduction 1 with 18 rules applied. Total rules applied 39 place count 177 transition count 454
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 53 place count 177 transition count 440
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 62 place count 168 transition count 420
Iterating global reduction 2 with 9 rules applied. Total rules applied 71 place count 168 transition count 420
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 76 place count 163 transition count 408
Iterating global reduction 2 with 5 rules applied. Total rules applied 81 place count 163 transition count 408
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 86 place count 158 transition count 390
Iterating global reduction 2 with 5 rules applied. Total rules applied 91 place count 158 transition count 390
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 96 place count 153 transition count 376
Iterating global reduction 2 with 5 rules applied. Total rules applied 101 place count 153 transition count 376
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 106 place count 148 transition count 358
Iterating global reduction 2 with 5 rules applied. Total rules applied 111 place count 148 transition count 358
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 116 place count 143 transition count 342
Iterating global reduction 2 with 5 rules applied. Total rules applied 121 place count 143 transition count 342
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 126 place count 138 transition count 332
Iterating global reduction 2 with 5 rules applied. Total rules applied 131 place count 138 transition count 332
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 136 place count 133 transition count 322
Iterating global reduction 2 with 5 rules applied. Total rules applied 141 place count 133 transition count 322
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 146 place count 128 transition count 312
Iterating global reduction 2 with 5 rules applied. Total rules applied 151 place count 128 transition count 312
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 154 place count 125 transition count 306
Iterating global reduction 2 with 3 rules applied. Total rules applied 157 place count 125 transition count 306
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 160 place count 122 transition count 300
Iterating global reduction 2 with 3 rules applied. Total rules applied 163 place count 122 transition count 300
Applied a total of 163 rules in 19 ms. Remains 122 /198 variables (removed 76) and now considering 300/506 (removed 206) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19 ms. Remains : 122/198 places, 300/506 transitions.
[2024-05-23 02:35:43] [INFO ] Flatten gal took : 8 ms
[2024-05-23 02:35:43] [INFO ] Flatten gal took : 8 ms
[2024-05-23 02:35:43] [INFO ] Input system was already deterministic with 300 transitions.
[2024-05-23 02:35:43] [INFO ] Flatten gal took : 13 ms
[2024-05-23 02:35:43] [INFO ] Flatten gal took : 14 ms
[2024-05-23 02:35:43] [INFO ] Export to MCC of 12 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 2 ms.
[2024-05-23 02:35:43] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 198 places, 506 transitions and 2034 arcs took 4 ms.
Total runtime 116250 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running FunctionPointer-PT-b004

IS_COLORED=
IS_NUPN=

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


SAVING FILE /home/mcc/execution/413/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: 676
MODEL NAME: /home/mcc/execution/413/model
198 places, 506 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.
Start RS construction.
Start RS construction.
Start RS construction.
coverability test failed!!
Convergence in 11 steps.
The state space is infinite.
CANNOT_COMPUTE
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716431745508

--------------------
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-b004"
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-b004, 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-171640601100225"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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