About the Execution of LTSMin+red for SieveSingleMsgMbox-PT-d2m64
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 1541.884 | 304439.00 | 456715.00 | 811.20 | [undef] | Cannot compute |
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.r532-smll-171683810800130.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 ltsminxred
Input is SieveSingleMsgMbox-PT-d2m64, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r532-smll-171683810800130
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.6M
-rw-r--r-- 1 mcc users 6.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K 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 58K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 23 07:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 19:19 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 12 19:12 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 121K Apr 12 19:12 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 12 19:11 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 92K Apr 12 19:11 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 19 07:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 19 15:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 6 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 1.1M May 18 16:43 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME SieveSingleMsgMbox-PT-d2m64-CTLFireability-2024-00
FORMULA_NAME SieveSingleMsgMbox-PT-d2m64-CTLFireability-2024-01
FORMULA_NAME SieveSingleMsgMbox-PT-d2m64-CTLFireability-2024-02
FORMULA_NAME SieveSingleMsgMbox-PT-d2m64-CTLFireability-2024-03
FORMULA_NAME SieveSingleMsgMbox-PT-d2m64-CTLFireability-2024-04
FORMULA_NAME SieveSingleMsgMbox-PT-d2m64-CTLFireability-2024-05
FORMULA_NAME SieveSingleMsgMbox-PT-d2m64-CTLFireability-2024-06
FORMULA_NAME SieveSingleMsgMbox-PT-d2m64-CTLFireability-2024-07
FORMULA_NAME SieveSingleMsgMbox-PT-d2m64-CTLFireability-2024-08
FORMULA_NAME SieveSingleMsgMbox-PT-d2m64-CTLFireability-2024-09
FORMULA_NAME SieveSingleMsgMbox-PT-d2m64-CTLFireability-2024-10
FORMULA_NAME SieveSingleMsgMbox-PT-d2m64-CTLFireability-2024-11
FORMULA_NAME SieveSingleMsgMbox-PT-d2m64-CTLFireability-2023-12
FORMULA_NAME SieveSingleMsgMbox-PT-d2m64-CTLFireability-2023-13
FORMULA_NAME SieveSingleMsgMbox-PT-d2m64-CTLFireability-2023-14
FORMULA_NAME SieveSingleMsgMbox-PT-d2m64-CTLFireability-2023-15
=== Now, execution of the tool begins
BK_START 1717249731800
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SieveSingleMsgMbox-PT-d2m64
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 13:48:53] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 13:48:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 13:48:54] [INFO ] Load time of PNML (sax parser for PT used): 342 ms
[2024-06-01 13:48:54] [INFO ] Transformed 2398 places.
[2024-06-01 13:48:54] [INFO ] Transformed 1954 transitions.
[2024-06-01 13:48:54] [INFO ] Parsed PT model containing 2398 places and 1954 transitions and 7816 arcs in 519 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 26 ms.
Deduced a syphon composed of 1984 places in 24 ms
Reduce places removed 1984 places and 0 transitions.
Support contains 67 out of 414 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 414/414 places, 1954/1954 transitions.
Reduce places removed 25 places and 0 transitions.
Ensure Unique test removed 828 transitions
Reduce isomorphic transitions removed 828 transitions.
Iterating post reduction 0 with 853 rules applied. Total rules applied 853 place count 389 transition count 1126
Discarding 73 places :
Symmetric choice reduction at 1 with 73 rule applications. Total rules 926 place count 316 transition count 1002
Iterating global reduction 1 with 73 rules applied. Total rules applied 999 place count 316 transition count 1002
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 1010 place count 316 transition count 991
Discarding 46 places :
Symmetric choice reduction at 2 with 46 rule applications. Total rules 1056 place count 270 transition count 945
Iterating global reduction 2 with 46 rules applied. Total rules applied 1102 place count 270 transition count 945
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 2 with 30 rules applied. Total rules applied 1132 place count 270 transition count 915
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 1145 place count 257 transition count 899
Iterating global reduction 3 with 13 rules applied. Total rules applied 1158 place count 257 transition count 899
Ensure Unique test removed 42 transitions
Reduce isomorphic transitions removed 42 transitions.
Iterating post reduction 3 with 42 rules applied. Total rules applied 1200 place count 257 transition count 857
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 1203 place count 254 transition count 852
Iterating global reduction 4 with 3 rules applied. Total rules applied 1206 place count 254 transition count 852
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 1208 place count 252 transition count 850
Iterating global reduction 4 with 2 rules applied. Total rules applied 1210 place count 252 transition count 850
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 1211 place count 251 transition count 849
Iterating global reduction 4 with 1 rules applied. Total rules applied 1212 place count 251 transition count 849
Applied a total of 1212 rules in 165 ms. Remains 251 /414 variables (removed 163) and now considering 849/1954 (removed 1105) transitions.
// Phase 1: matrix 849 rows 251 cols
[2024-06-01 13:48:54] [INFO ] Computed 5 invariants in 47 ms
[2024-06-01 13:48:55] [INFO ] Implicit Places using invariants in 609 ms returned []
[2024-06-01 13:48:55] [INFO ] Invariant cache hit.
[2024-06-01 13:48:55] [INFO ] State equation strengthened by 663 read => feed constraints.
[2024-06-01 13:48:57] [INFO ] Implicit Places using invariants and state equation in 2071 ms returned []
Implicit Place search using SMT with State Equation took 2745 ms to find 0 implicit places.
Running 848 sub problems to find dead transitions.
[2024-06-01 13:48:57] [INFO ] Invariant cache hit.
[2024-06-01 13:48:57] [INFO ] State equation strengthened by 663 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/250 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 848 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/250 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 848 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/250 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 848 unsolved
At refinement iteration 3 (OVERLAPS) 1/251 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 848 unsolved
[2024-06-01 13:49:20] [INFO ] Deduced a trap composed of 85 places in 154 ms of which 29 ms to minimize.
[2024-06-01 13:49:20] [INFO ] Deduced a trap composed of 85 places in 108 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/251 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 848 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/251 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 848 unsolved
At refinement iteration 6 (OVERLAPS) 849/1100 variables, 251/258 constraints. Problems are: Problem set: 0 solved, 848 unsolved
SMT process timed out in 33533ms, After SMT, problems are : Problem set: 0 solved, 848 unsolved
Search for dead transitions found 0 dead transitions in 33588ms
Starting structural reductions in LTL mode, iteration 1 : 251/414 places, 849/1954 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 36551 ms. Remains : 251/414 places, 849/1954 transitions.
Support contains 67 out of 251 places after structural reductions.
[2024-06-01 13:49:31] [INFO ] Flatten gal took : 122 ms
[2024-06-01 13:49:31] [INFO ] Flatten gal took : 73 ms
[2024-06-01 13:49:31] [INFO ] Input system was already deterministic with 849 transitions.
Reduction of identical properties reduced properties to check from 71 to 66
RANDOM walk for 40000 steps (8920 resets) in 4713 ms. (8 steps per ms) remains 65/66 properties
BEST_FIRST walk for 4002 steps (188 resets) in 83 ms. (47 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4002 steps (187 resets) in 61 ms. (64 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4002 steps (181 resets) in 58 ms. (67 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4003 steps (193 resets) in 63 ms. (62 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4001 steps (425 resets) in 45 ms. (86 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4002 steps (191 resets) in 52 ms. (75 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4002 steps (188 resets) in 30 ms. (129 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4004 steps (188 resets) in 32 ms. (121 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4003 steps (201 resets) in 33 ms. (117 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4003 steps (185 resets) in 30 ms. (129 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4000 steps (187 resets) in 36 ms. (108 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4004 steps (189 resets) in 32 ms. (121 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4004 steps (194 resets) in 32 ms. (121 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4002 steps (193 resets) in 43 ms. (90 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4003 steps (207 resets) in 31 ms. (125 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4004 steps (198 resets) in 32 ms. (121 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4004 steps (171 resets) in 37 ms. (105 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4004 steps (177 resets) in 30 ms. (129 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4003 steps (175 resets) in 30 ms. (129 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4004 steps (187 resets) in 34 ms. (114 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4001 steps (202 resets) in 29 ms. (133 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4003 steps (183 resets) in 37 ms. (105 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4003 steps (193 resets) in 31 ms. (125 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4000 steps (195 resets) in 40 ms. (97 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4003 steps (186 resets) in 31 ms. (125 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4004 steps (177 resets) in 44 ms. (88 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4003 steps (162 resets) in 29 ms. (133 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4003 steps (184 resets) in 38 ms. (102 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4003 steps (166 resets) in 29 ms. (133 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4001 steps (174 resets) in 33 ms. (117 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4003 steps (179 resets) in 30 ms. (129 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4003 steps (173 resets) in 48 ms. (81 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4003 steps (192 resets) in 58 ms. (67 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4002 steps (185 resets) in 36 ms. (108 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4003 steps (164 resets) in 52 ms. (75 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4003 steps (195 resets) in 38 ms. (102 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4002 steps (197 resets) in 34 ms. (114 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4004 steps (168 resets) in 63 ms. (62 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4002 steps (201 resets) in 36 ms. (108 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4003 steps (175 resets) in 51 ms. (76 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4003 steps (192 resets) in 41 ms. (95 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4003 steps (163 resets) in 33 ms. (117 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4002 steps (193 resets) in 52 ms. (75 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4002 steps (187 resets) in 36 ms. (108 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4003 steps (191 resets) in 62 ms. (63 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4004 steps (209 resets) in 52 ms. (75 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4001 steps (181 resets) in 36 ms. (108 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4002 steps (166 resets) in 42 ms. (93 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4004 steps (166 resets) in 27 ms. (143 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4002 steps (176 resets) in 28 ms. (138 steps per ms) remains 65/65 properties
Interrupted probabilistic random walk after 360882 steps, run timeout after 6001 ms. (steps per millisecond=60 ) properties seen :25 out of 65
Probabilistic random walk after 360882 steps, saw 172251 distinct states, run finished after 6008 ms. (steps per millisecond=60 ) properties seen :25
[2024-06-01 13:49:39] [INFO ] Invariant cache hit.
[2024-06-01 13:49:40] [INFO ] State equation strengthened by 663 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (OVERLAPS) 109/155 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 40 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 64/219 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/219 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (OVERLAPS) 732/951 variables, 219/224 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/951 variables, 546/770 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/951 variables, 0/770 constraints. Problems are: Problem set: 0 solved, 40 unsolved
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp34 is UNSAT
Problem AtomicPropp50 is UNSAT
Problem AtomicPropp55 is UNSAT
At refinement iteration 8 (OVERLAPS) 149/1100 variables, 32/802 constraints. Problems are: Problem set: 7 solved, 33 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1100 variables, 117/919 constraints. Problems are: Problem set: 7 solved, 33 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1100 variables, 0/919 constraints. Problems are: Problem set: 7 solved, 33 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1100/1100 variables, and 919 constraints, problems are : Problem set: 7 solved, 33 unsolved in 5023 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 251/251 constraints, ReadFeed: 663/663 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 7 solved, 33 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 0/0 constraints. Problems are: Problem set: 7 solved, 33 unsolved
At refinement iteration 1 (OVERLAPS) 111/150 variables, 2/2 constraints. Problems are: Problem set: 7 solved, 33 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/150 variables, 0/2 constraints. Problems are: Problem set: 7 solved, 33 unsolved
At refinement iteration 3 (OVERLAPS) 64/214 variables, 3/5 constraints. Problems are: Problem set: 7 solved, 33 unsolved
[2024-06-01 13:49:45] [INFO ] Deduced a trap composed of 79 places in 110 ms of which 3 ms to minimize.
[2024-06-01 13:49:46] [INFO ] Deduced a trap composed of 82 places in 116 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/214 variables, 2/7 constraints. Problems are: Problem set: 7 solved, 33 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/214 variables, 0/7 constraints. Problems are: Problem set: 7 solved, 33 unsolved
At refinement iteration 6 (OVERLAPS) 652/866 variables, 214/221 constraints. Problems are: Problem set: 7 solved, 33 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/866 variables, 466/687 constraints. Problems are: Problem set: 7 solved, 33 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/866 variables, 3/690 constraints. Problems are: Problem set: 7 solved, 33 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/866 variables, 0/690 constraints. Problems are: Problem set: 7 solved, 33 unsolved
At refinement iteration 10 (OVERLAPS) 234/1100 variables, 37/727 constraints. Problems are: Problem set: 7 solved, 33 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1100 variables, 197/924 constraints. Problems are: Problem set: 7 solved, 33 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1100/1100 variables, and 954 constraints, problems are : Problem set: 7 solved, 33 unsolved in 5047 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 251/251 constraints, ReadFeed: 663/663 constraints, PredecessorRefiner: 33/40 constraints, Known Traps: 2/2 constraints]
After SMT, in 10344ms problems are : Problem set: 7 solved, 33 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 39 out of 251 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 251/251 places, 849/849 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 229 transition count 658
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 229 transition count 658
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 52 place count 229 transition count 650
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 66 place count 215 transition count 636
Iterating global reduction 1 with 14 rules applied. Total rules applied 80 place count 215 transition count 636
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 82 place count 215 transition count 634
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 89 place count 208 transition count 627
Iterating global reduction 2 with 7 rules applied. Total rules applied 96 place count 208 transition count 627
Ensure Unique test removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Iterating post reduction 2 with 26 rules applied. Total rules applied 122 place count 208 transition count 601
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 123 place count 207 transition count 599
Iterating global reduction 3 with 1 rules applied. Total rules applied 124 place count 207 transition count 599
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 125 place count 206 transition count 598
Iterating global reduction 3 with 1 rules applied. Total rules applied 126 place count 206 transition count 598
Applied a total of 126 rules in 148 ms. Remains 206 /251 variables (removed 45) and now considering 598/849 (removed 251) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 148 ms. Remains : 206/251 places, 598/849 transitions.
RANDOM walk for 40000 steps (8952 resets) in 847 ms. (47 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (192 resets) in 23 ms. (166 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (171 resets) in 34 ms. (114 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4002 steps (190 resets) in 27 ms. (142 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4002 steps (419 resets) in 49 ms. (80 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (180 resets) in 27 ms. (143 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (177 resets) in 28 ms. (138 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (179 resets) in 30 ms. (129 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (181 resets) in 29 ms. (133 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4002 steps (190 resets) in 28 ms. (138 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (179 resets) in 28 ms. (138 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4002 steps (198 resets) in 28 ms. (138 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (180 resets) in 30 ms. (129 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (177 resets) in 24 ms. (160 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (187 resets) in 28 ms. (138 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (199 resets) in 30 ms. (129 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4001 steps (197 resets) in 27 ms. (142 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4002 steps (184 resets) in 44 ms. (88 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (170 resets) in 21 ms. (181 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4001 steps (175 resets) in 50 ms. (78 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4002 steps (192 resets) in 20 ms. (190 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (178 resets) in 57 ms. (69 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4001 steps (193 resets) in 25 ms. (153 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4000 steps (423 resets) in 33 ms. (117 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4002 steps (196 resets) in 26 ms. (148 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (187 resets) in 75 ms. (52 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (168 resets) in 41 ms. (95 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (175 resets) in 25 ms. (153 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (204 resets) in 30 ms. (129 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4002 steps (188 resets) in 40 ms. (97 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (186 resets) in 51 ms. (76 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4002 steps (193 resets) in 28 ms. (138 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (181 resets) in 34 ms. (114 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (397 resets) in 30 ms. (129 steps per ms) remains 33/33 properties
Interrupted probabilistic random walk after 149364 steps, run timeout after 3001 ms. (steps per millisecond=49 ) properties seen :9 out of 33
Probabilistic random walk after 149364 steps, saw 73108 distinct states, run finished after 3001 ms. (steps per millisecond=49 ) properties seen :9
// Phase 1: matrix 598 rows 206 cols
[2024-06-01 13:49:54] [INFO ] Computed 5 invariants in 6 ms
[2024-06-01 13:49:54] [INFO ] State equation strengthened by 441 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 1 (OVERLAPS) 93/123 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 3 (OVERLAPS) 51/174 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/174 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 5 (OVERLAPS) 488/662 variables, 174/179 constraints. Problems are: Problem set: 0 solved, 24 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/662 variables, 331/510 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/662 variables, 0/510 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 8 (OVERLAPS) 142/804 variables, 32/542 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/804 variables, 110/652 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/804 variables, 0/652 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 11 (OVERLAPS) 0/804 variables, 0/652 constraints. Problems are: Problem set: 0 solved, 24 unsolved
No progress, stopping.
After SMT solving in domain Real declared 804/804 variables, and 652 constraints, problems are : Problem set: 0 solved, 24 unsolved in 2984 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 206/206 constraints, ReadFeed: 441/441 constraints, PredecessorRefiner: 24/24 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 24 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 1 (OVERLAPS) 93/123 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 3 (OVERLAPS) 51/174 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 24 unsolved
[2024-06-01 13:49:57] [INFO ] Deduced a trap composed of 67 places in 92 ms of which 3 ms to minimize.
[2024-06-01 13:49:57] [INFO ] Deduced a trap composed of 67 places in 92 ms of which 2 ms to minimize.
[2024-06-01 13:49:58] [INFO ] Deduced a trap composed of 69 places in 93 ms of which 3 ms to minimize.
[2024-06-01 13:49:58] [INFO ] Deduced a trap composed of 68 places in 89 ms of which 2 ms to minimize.
[2024-06-01 13:49:58] [INFO ] Deduced a trap composed of 69 places in 88 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/174 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/174 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 6 (OVERLAPS) 488/662 variables, 174/184 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/662 variables, 331/515 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/662 variables, 3/518 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/662 variables, 0/518 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 10 (OVERLAPS) 142/804 variables, 32/550 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/804 variables, 110/660 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/804 variables, 21/681 constraints. Problems are: Problem set: 0 solved, 24 unsolved
[2024-06-01 13:50:01] [INFO ] Deduced a trap composed of 58 places in 45 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/804 variables, 1/682 constraints. Problems are: Problem set: 0 solved, 24 unsolved
[2024-06-01 13:50:04] [INFO ] Deduced a trap composed of 28 places in 62 ms of which 1 ms to minimize.
[2024-06-01 13:50:04] [INFO ] Deduced a trap composed of 51 places in 41 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/804 variables, 2/684 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/804 variables, 0/684 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 16 (OVERLAPS) 0/804 variables, 0/684 constraints. Problems are: Problem set: 0 solved, 24 unsolved
No progress, stopping.
After SMT solving in domain Int declared 804/804 variables, and 684 constraints, problems are : Problem set: 0 solved, 24 unsolved in 13465 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 206/206 constraints, ReadFeed: 441/441 constraints, PredecessorRefiner: 24/24 constraints, Known Traps: 8/8 constraints]
After SMT, in 16572ms problems are : Problem set: 0 solved, 24 unsolved
Parikh walk visited 0 properties in 21274 ms.
Support contains 30 out of 206 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 206/206 places, 598/598 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 199 transition count 507
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 199 transition count 507
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 21 place count 192 transition count 499
Iterating global reduction 0 with 7 rules applied. Total rules applied 28 place count 192 transition count 499
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 32 place count 192 transition count 495
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 35 place count 189 transition count 489
Iterating global reduction 1 with 3 rules applied. Total rules applied 38 place count 189 transition count 489
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 40 place count 189 transition count 487
Applied a total of 40 rules in 75 ms. Remains 189 /206 variables (removed 17) and now considering 487/598 (removed 111) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 75 ms. Remains : 189/206 places, 487/598 transitions.
RANDOM walk for 40000 steps (9003 resets) in 842 ms. (47 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (186 resets) in 23 ms. (166 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (214 resets) in 33 ms. (117 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (200 resets) in 26 ms. (148 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (404 resets) in 37 ms. (105 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (195 resets) in 42 ms. (93 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (181 resets) in 39 ms. (100 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (196 resets) in 32 ms. (121 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (205 resets) in 46 ms. (85 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (184 resets) in 20 ms. (190 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (194 resets) in 36 ms. (108 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (173 resets) in 23 ms. (166 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4001 steps (198 resets) in 25 ms. (153 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (193 resets) in 23 ms. (166 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (186 resets) in 23 ms. (166 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (206 resets) in 21 ms. (181 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4001 steps (177 resets) in 24 ms. (160 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (180 resets) in 19 ms. (200 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (395 resets) in 26 ms. (148 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (198 resets) in 38 ms. (102 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (185 resets) in 24 ms. (160 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (190 resets) in 18 ms. (210 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (177 resets) in 17 ms. (222 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4001 steps (183 resets) in 16 ms. (235 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (402 resets) in 21 ms. (181 steps per ms) remains 24/24 properties
Interrupted probabilistic random walk after 175048 steps, run timeout after 3001 ms. (steps per millisecond=58 ) properties seen :4 out of 24
Probabilistic random walk after 175048 steps, saw 79957 distinct states, run finished after 3001 ms. (steps per millisecond=58 ) properties seen :4
// Phase 1: matrix 487 rows 189 cols
[2024-06-01 13:50:35] [INFO ] Computed 5 invariants in 11 ms
[2024-06-01 13:50:36] [INFO ] State equation strengthened by 348 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 89/115 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/115 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 44/159 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/159 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (OVERLAPS) 407/566 variables, 159/164 constraints. Problems are: Problem set: 0 solved, 20 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/566 variables, 268/432 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/566 variables, 0/432 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (OVERLAPS) 110/676 variables, 30/462 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/676 variables, 80/542 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/676 variables, 0/542 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 11 (OVERLAPS) 0/676 variables, 0/542 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 676/676 variables, and 542 constraints, problems are : Problem set: 0 solved, 20 unsolved in 2263 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 189/189 constraints, ReadFeed: 348/348 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 89/115 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/115 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 44/159 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 20 unsolved
[2024-06-01 13:50:38] [INFO ] Deduced a trap composed of 60 places in 81 ms of which 2 ms to minimize.
[2024-06-01 13:50:38] [INFO ] Deduced a trap composed of 85 places in 82 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/159 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/159 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (OVERLAPS) 407/566 variables, 159/166 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/566 variables, 268/434 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/566 variables, 3/437 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/566 variables, 0/437 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 10 (OVERLAPS) 110/676 variables, 30/467 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/676 variables, 80/547 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/676 variables, 17/564 constraints. Problems are: Problem set: 0 solved, 20 unsolved
[2024-06-01 13:50:42] [INFO ] Deduced a trap composed of 58 places in 73 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/676 variables, 1/565 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/676 variables, 0/565 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 15 (OVERLAPS) 0/676 variables, 0/565 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 676/676 variables, and 565 constraints, problems are : Problem set: 0 solved, 20 unsolved in 8446 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 189/189 constraints, ReadFeed: 348/348 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 3/3 constraints]
After SMT, in 10782ms problems are : Problem set: 0 solved, 20 unsolved
Parikh walk visited 0 properties in 8502 ms.
Support contains 26 out of 189 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 189/189 places, 487/487 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 185 transition count 427
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 185 transition count 427
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 12 place count 181 transition count 423
Iterating global reduction 0 with 4 rules applied. Total rules applied 16 place count 181 transition count 423
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 18 place count 181 transition count 421
Applied a total of 18 rules in 45 ms. Remains 181 /189 variables (removed 8) and now considering 421/487 (removed 66) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45 ms. Remains : 181/189 places, 421/487 transitions.
RANDOM walk for 40000 steps (8961 resets) in 518 ms. (77 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (196 resets) in 20 ms. (190 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (189 resets) in 22 ms. (174 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (180 resets) in 18 ms. (210 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (411 resets) in 23 ms. (166 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (188 resets) in 21 ms. (181 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4001 steps (187 resets) in 20 ms. (190 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (181 resets) in 20 ms. (190 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4001 steps (183 resets) in 19 ms. (200 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (186 resets) in 20 ms. (190 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (191 resets) in 19 ms. (200 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (183 resets) in 19 ms. (200 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (153 resets) in 28 ms. (138 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (192 resets) in 32 ms. (121 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (405 resets) in 33 ms. (117 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (190 resets) in 20 ms. (190 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (200 resets) in 39 ms. (100 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4000 steps (185 resets) in 19 ms. (200 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (174 resets) in 21 ms. (181 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (206 resets) in 20 ms. (190 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (407 resets) in 38 ms. (102 steps per ms) remains 20/20 properties
Interrupted probabilistic random walk after 162702 steps, run timeout after 3001 ms. (steps per millisecond=54 ) properties seen :1 out of 20
Probabilistic random walk after 162702 steps, saw 75383 distinct states, run finished after 3001 ms. (steps per millisecond=54 ) properties seen :1
// Phase 1: matrix 421 rows 181 cols
[2024-06-01 13:50:58] [INFO ] Computed 5 invariants in 3 ms
[2024-06-01 13:50:58] [INFO ] State equation strengthened by 288 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (OVERLAPS) 89/115 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/115 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (OVERLAPS) 40/155 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/155 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 5 (OVERLAPS) 401/556 variables, 155/160 constraints. Problems are: Problem set: 0 solved, 19 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/556 variables, 268/428 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/556 variables, 0/428 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 8 (OVERLAPS) 46/602 variables, 26/454 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/602 variables, 20/474 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/602 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 11 (OVERLAPS) 0/602 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 19 unsolved
No progress, stopping.
After SMT solving in domain Real declared 602/602 variables, and 474 constraints, problems are : Problem set: 0 solved, 19 unsolved in 2174 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 181/181 constraints, ReadFeed: 288/288 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 19 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (OVERLAPS) 89/115 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/115 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (OVERLAPS) 40/155 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 19 unsolved
[2024-06-01 13:51:01] [INFO ] Deduced a trap composed of 61 places in 82 ms of which 2 ms to minimize.
[2024-06-01 13:51:01] [INFO ] Deduced a trap composed of 62 places in 82 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/155 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/155 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 6 (OVERLAPS) 401/556 variables, 155/162 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/556 variables, 268/430 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/556 variables, 3/433 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/556 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 10 (OVERLAPS) 46/602 variables, 26/459 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/602 variables, 20/479 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/602 variables, 16/495 constraints. Problems are: Problem set: 0 solved, 19 unsolved
[2024-06-01 13:51:04] [INFO ] Deduced a trap composed of 51 places in 57 ms of which 1 ms to minimize.
[2024-06-01 13:51:04] [INFO ] Deduced a trap composed of 58 places in 52 ms of which 13 ms to minimize.
[2024-06-01 13:51:05] [INFO ] Deduced a trap composed of 28 places in 73 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/602 variables, 3/498 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/602 variables, 0/498 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 15 (OVERLAPS) 0/602 variables, 0/498 constraints. Problems are: Problem set: 0 solved, 19 unsolved
No progress, stopping.
After SMT solving in domain Int declared 602/602 variables, and 498 constraints, problems are : Problem set: 0 solved, 19 unsolved in 9607 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 181/181 constraints, ReadFeed: 288/288 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 5/5 constraints]
After SMT, in 11836ms problems are : Problem set: 0 solved, 19 unsolved
Parikh walk visited 0 properties in 24673 ms.
Support contains 26 out of 181 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 181/181 places, 421/421 transitions.
Applied a total of 0 rules in 19 ms. Remains 181 /181 variables (removed 0) and now considering 421/421 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 181/181 places, 421/421 transitions.
Successfully simplified 7 atomic propositions for a total of 16 simplifications.
[2024-06-01 13:51:35] [INFO ] Flatten gal took : 52 ms
[2024-06-01 13:51:35] [INFO ] Flatten gal took : 63 ms
[2024-06-01 13:51:35] [INFO ] Input system was already deterministic with 849 transitions.
Computed a total of 63 stabilizing places and 116 stable transitions
Graph (complete) has 1319 edges and 251 vertex of which 250 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.26 ms
Starting structural reductions in LTL mode, iteration 0 : 251/251 places, 849/849 transitions.
Discarding 39 places :
Symmetric choice reduction at 0 with 39 rule applications. Total rules 39 place count 212 transition count 443
Iterating global reduction 0 with 39 rules applied. Total rules applied 78 place count 212 transition count 443
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 84 place count 212 transition count 437
Discarding 32 places :
Symmetric choice reduction at 1 with 32 rule applications. Total rules 116 place count 180 transition count 405
Iterating global reduction 1 with 32 rules applied. Total rules applied 148 place count 180 transition count 405
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 154 place count 180 transition count 399
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 167 place count 167 transition count 383
Iterating global reduction 2 with 13 rules applied. Total rules applied 180 place count 167 transition count 383
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 29 transitions.
Iterating post reduction 2 with 29 rules applied. Total rules applied 209 place count 167 transition count 354
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 212 place count 164 transition count 348
Iterating global reduction 3 with 3 rules applied. Total rules applied 215 place count 164 transition count 348
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 218 place count 161 transition count 345
Iterating global reduction 3 with 3 rules applied. Total rules applied 221 place count 161 transition count 345
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 223 place count 159 transition count 343
Iterating global reduction 3 with 2 rules applied. Total rules applied 225 place count 159 transition count 343
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 227 place count 157 transition count 341
Iterating global reduction 3 with 2 rules applied. Total rules applied 229 place count 157 transition count 341
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 230 place count 156 transition count 340
Iterating global reduction 3 with 1 rules applied. Total rules applied 231 place count 156 transition count 340
Applied a total of 231 rules in 28 ms. Remains 156 /251 variables (removed 95) and now considering 340/849 (removed 509) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 29 ms. Remains : 156/251 places, 340/849 transitions.
[2024-06-01 13:51:35] [INFO ] Flatten gal took : 20 ms
[2024-06-01 13:51:35] [INFO ] Flatten gal took : 20 ms
[2024-06-01 13:51:35] [INFO ] Input system was already deterministic with 340 transitions.
Starting structural reductions in LTL mode, iteration 0 : 251/251 places, 849/849 transitions.
Discarding 54 places :
Symmetric choice reduction at 0 with 54 rule applications. Total rules 54 place count 197 transition count 276
Iterating global reduction 0 with 54 rules applied. Total rules applied 108 place count 197 transition count 276
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 116 place count 197 transition count 268
Discarding 45 places :
Symmetric choice reduction at 1 with 45 rule applications. Total rules 161 place count 152 transition count 222
Iterating global reduction 1 with 45 rules applied. Total rules applied 206 place count 152 transition count 222
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 219 place count 152 transition count 209
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 241 place count 130 transition count 177
Iterating global reduction 2 with 22 rules applied. Total rules applied 263 place count 130 transition count 177
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 2 with 16 rules applied. Total rules applied 279 place count 130 transition count 161
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 285 place count 124 transition count 152
Iterating global reduction 3 with 6 rules applied. Total rules applied 291 place count 124 transition count 152
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 297 place count 118 transition count 146
Iterating global reduction 3 with 6 rules applied. Total rules applied 303 place count 118 transition count 146
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 307 place count 114 transition count 142
Iterating global reduction 3 with 4 rules applied. Total rules applied 311 place count 114 transition count 142
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 313 place count 114 transition count 140
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 317 place count 110 transition count 136
Iterating global reduction 4 with 4 rules applied. Total rules applied 321 place count 110 transition count 136
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 323 place count 108 transition count 134
Iterating global reduction 4 with 2 rules applied. Total rules applied 325 place count 108 transition count 134
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 326 place count 107 transition count 131
Iterating global reduction 4 with 1 rules applied. Total rules applied 327 place count 107 transition count 131
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 328 place count 106 transition count 130
Iterating global reduction 4 with 1 rules applied. Total rules applied 329 place count 106 transition count 130
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 330 place count 105 transition count 129
Iterating global reduction 4 with 1 rules applied. Total rules applied 331 place count 105 transition count 129
Applied a total of 331 rules in 20 ms. Remains 105 /251 variables (removed 146) and now considering 129/849 (removed 720) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20 ms. Remains : 105/251 places, 129/849 transitions.
[2024-06-01 13:51:35] [INFO ] Flatten gal took : 7 ms
[2024-06-01 13:51:35] [INFO ] Flatten gal took : 6 ms
[2024-06-01 13:51:35] [INFO ] Input system was already deterministic with 129 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 251/251 places, 849/849 transitions.
Discarding 51 places :
Symmetric choice reduction at 0 with 51 rule applications. Total rules 51 place count 200 transition count 309
Iterating global reduction 0 with 51 rules applied. Total rules applied 102 place count 200 transition count 309
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 109 place count 200 transition count 302
Discarding 43 places :
Symmetric choice reduction at 1 with 43 rule applications. Total rules 152 place count 157 transition count 258
Iterating global reduction 1 with 43 rules applied. Total rules applied 195 place count 157 transition count 258
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 207 place count 157 transition count 246
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 227 place count 137 transition count 218
Iterating global reduction 2 with 20 rules applied. Total rules applied 247 place count 137 transition count 218
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 2 with 20 rules applied. Total rules applied 267 place count 137 transition count 198
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 272 place count 132 transition count 190
Iterating global reduction 3 with 5 rules applied. Total rules applied 277 place count 132 transition count 190
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 282 place count 127 transition count 185
Iterating global reduction 3 with 5 rules applied. Total rules applied 287 place count 127 transition count 185
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 290 place count 124 transition count 182
Iterating global reduction 3 with 3 rules applied. Total rules applied 293 place count 124 transition count 182
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 297 place count 124 transition count 178
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 300 place count 121 transition count 175
Iterating global reduction 4 with 3 rules applied. Total rules applied 303 place count 121 transition count 175
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 305 place count 119 transition count 173
Iterating global reduction 4 with 2 rules applied. Total rules applied 307 place count 119 transition count 173
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 308 place count 118 transition count 170
Iterating global reduction 4 with 1 rules applied. Total rules applied 309 place count 118 transition count 170
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 310 place count 117 transition count 169
Iterating global reduction 4 with 1 rules applied. Total rules applied 311 place count 117 transition count 169
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 312 place count 116 transition count 168
Iterating global reduction 4 with 1 rules applied. Total rules applied 313 place count 116 transition count 168
Applied a total of 313 rules in 73 ms. Remains 116 /251 variables (removed 135) and now considering 168/849 (removed 681) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 74 ms. Remains : 116/251 places, 168/849 transitions.
[2024-06-01 13:51:35] [INFO ] Flatten gal took : 12 ms
[2024-06-01 13:51:35] [INFO ] Flatten gal took : 12 ms
[2024-06-01 13:51:35] [INFO ] Input system was already deterministic with 168 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 251/251 places, 849/849 transitions.
Discarding 54 places :
Symmetric choice reduction at 0 with 54 rule applications. Total rules 54 place count 197 transition count 276
Iterating global reduction 0 with 54 rules applied. Total rules applied 108 place count 197 transition count 276
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 116 place count 197 transition count 268
Discarding 45 places :
Symmetric choice reduction at 1 with 45 rule applications. Total rules 161 place count 152 transition count 222
Iterating global reduction 1 with 45 rules applied. Total rules applied 206 place count 152 transition count 222
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 219 place count 152 transition count 209
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 241 place count 130 transition count 177
Iterating global reduction 2 with 22 rules applied. Total rules applied 263 place count 130 transition count 177
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 2 with 16 rules applied. Total rules applied 279 place count 130 transition count 161
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 285 place count 124 transition count 152
Iterating global reduction 3 with 6 rules applied. Total rules applied 291 place count 124 transition count 152
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 297 place count 118 transition count 146
Iterating global reduction 3 with 6 rules applied. Total rules applied 303 place count 118 transition count 146
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 307 place count 114 transition count 142
Iterating global reduction 3 with 4 rules applied. Total rules applied 311 place count 114 transition count 142
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 313 place count 114 transition count 140
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 317 place count 110 transition count 136
Iterating global reduction 4 with 4 rules applied. Total rules applied 321 place count 110 transition count 136
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 323 place count 108 transition count 134
Iterating global reduction 4 with 2 rules applied. Total rules applied 325 place count 108 transition count 134
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 326 place count 107 transition count 131
Iterating global reduction 4 with 1 rules applied. Total rules applied 327 place count 107 transition count 131
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 328 place count 106 transition count 130
Iterating global reduction 4 with 1 rules applied. Total rules applied 329 place count 106 transition count 130
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 330 place count 105 transition count 129
Iterating global reduction 4 with 1 rules applied. Total rules applied 331 place count 105 transition count 129
Applied a total of 331 rules in 70 ms. Remains 105 /251 variables (removed 146) and now considering 129/849 (removed 720) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 71 ms. Remains : 105/251 places, 129/849 transitions.
[2024-06-01 13:51:36] [INFO ] Flatten gal took : 9 ms
[2024-06-01 13:51:36] [INFO ] Flatten gal took : 9 ms
[2024-06-01 13:51:36] [INFO ] Input system was already deterministic with 129 transitions.
RANDOM walk for 40000 steps (8932 resets) in 99 ms. (400 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (1897 resets) in 35 ms. (1111 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2173517 steps, run timeout after 3001 ms. (steps per millisecond=724 ) properties seen :0 out of 1
Probabilistic random walk after 2173517 steps, saw 961603 distinct states, run finished after 3001 ms. (steps per millisecond=724 ) properties seen :0
// Phase 1: matrix 129 rows 105 cols
[2024-06-01 13:51:39] [INFO ] Computed 5 invariants in 4 ms
[2024-06-01 13:51:39] [INFO ] State equation strengthened by 57 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 54/56 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 20/76 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/76 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 6/82 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/82 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 112/194 variables, 82/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/194 variables, 40/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/194 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 40/234 variables, 23/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/234 variables, 17/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/234 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/234 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 234/234 variables, and 167 constraints, problems are : Problem set: 0 solved, 1 unsolved in 153 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 105/105 constraints, ReadFeed: 57/57 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 54/56 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 20/76 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/76 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 6/82 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/82 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 112/194 variables, 82/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/194 variables, 40/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/194 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 40/234 variables, 23/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/234 variables, 17/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/234 variables, 1/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 13:51:39] [INFO ] Deduced a trap composed of 23 places in 65 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/234 variables, 1/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/234 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/234 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 234/234 variables, and 169 constraints, problems are : Problem set: 0 solved, 1 unsolved in 358 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 105/105 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 523ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 662 ms.
Support contains 2 out of 105 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 105/105 places, 129/129 transitions.
Graph (complete) has 307 edges and 105 vertex of which 104 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 104 transition count 127
Applied a total of 3 rules in 15 ms. Remains 104 /105 variables (removed 1) and now considering 127/129 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 104/105 places, 127/129 transitions.
RANDOM walk for 4000000 steps (897959 resets) in 6138 ms. (651 steps per ms) remains 1/1 properties
BEST_FIRST walk for 4000004 steps (188737 resets) in 3136 ms. (1275 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 4460178 steps, run timeout after 6001 ms. (steps per millisecond=743 ) properties seen :0 out of 1
Probabilistic random walk after 4460178 steps, saw 1971733 distinct states, run finished after 6002 ms. (steps per millisecond=743 ) properties seen :0
// Phase 1: matrix 127 rows 104 cols
[2024-06-01 13:51:48] [INFO ] Computed 4 invariants in 2 ms
[2024-06-01 13:51:48] [INFO ] State equation strengthened by 55 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 84/86 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 139/225 variables, 96/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/225 variables, 43/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/225 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 6/231 variables, 2/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/231 variables, 2/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/231 variables, 6/163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/231 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/231 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 231/231 variables, and 163 constraints, problems are : Problem set: 0 solved, 1 unsolved in 208 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 104/104 constraints, ReadFeed: 55/55 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 84/86 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 139/225 variables, 96/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/225 variables, 43/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/225 variables, 1/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/225 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 6/231 variables, 2/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/231 variables, 2/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/231 variables, 6/164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/231 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/231 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 231/231 variables, and 164 constraints, problems are : Problem set: 0 solved, 1 unsolved in 358 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 104/104 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 580ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 13 ms.
Support contains 2 out of 104 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 104/104 places, 127/127 transitions.
Applied a total of 0 rules in 4 ms. Remains 104 /104 variables (removed 0) and now considering 127/127 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 104/104 places, 127/127 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 104/104 places, 127/127 transitions.
Applied a total of 0 rules in 3 ms. Remains 104 /104 variables (removed 0) and now considering 127/127 (removed 0) transitions.
[2024-06-01 13:51:49] [INFO ] Invariant cache hit.
[2024-06-01 13:51:49] [INFO ] Implicit Places using invariants in 86 ms returned []
[2024-06-01 13:51:49] [INFO ] Invariant cache hit.
[2024-06-01 13:51:49] [INFO ] State equation strengthened by 55 read => feed constraints.
[2024-06-01 13:51:49] [INFO ] Implicit Places using invariants and state equation in 314 ms returned []
Implicit Place search using SMT with State Equation took 403 ms to find 0 implicit places.
[2024-06-01 13:51:49] [INFO ] Redundant transitions in 3 ms returned []
Running 126 sub problems to find dead transitions.
[2024-06-01 13:51:49] [INFO ] Invariant cache hit.
[2024-06-01 13:51:49] [INFO ] State equation strengthened by 55 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 3 (OVERLAPS) 1/104 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 5 (OVERLAPS) 127/231 variables, 104/108 constraints. Problems are: Problem set: 0 solved, 126 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/231 variables, 55/163 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/231 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 8 (OVERLAPS) 0/231 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 126 unsolved
No progress, stopping.
After SMT solving in domain Real declared 231/231 variables, and 163 constraints, problems are : Problem set: 0 solved, 126 unsolved in 5596 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 104/104 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 126/126 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 126 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 3 (OVERLAPS) 1/104 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 5 (OVERLAPS) 127/231 variables, 104/108 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/231 variables, 55/163 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/231 variables, 126/289 constraints. Problems are: Problem set: 0 solved, 126 unsolved
[2024-06-01 13:51:59] [INFO ] Deduced a trap composed of 22 places in 52 ms of which 2 ms to minimize.
Problem TDEAD37 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD115 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/231 variables, 1/290 constraints. Problems are: Problem set: 3 solved, 123 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/231 variables, 0/290 constraints. Problems are: Problem set: 3 solved, 123 unsolved
At refinement iteration 10 (OVERLAPS) 0/231 variables, 0/290 constraints. Problems are: Problem set: 3 solved, 123 unsolved
No progress, stopping.
After SMT solving in domain Int declared 231/231 variables, and 290 constraints, problems are : Problem set: 3 solved, 123 unsolved in 14211 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 104/104 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 126/126 constraints, Known Traps: 1/1 constraints]
After SMT, in 19918ms problems are : Problem set: 3 solved, 123 unsolved
Search for dead transitions found 3 dead transitions in 19919ms
Found 3 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 3 transitions
Dead transitions reduction (with SMT) removed 3 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 104/104 places, 124/127 transitions.
Graph (complete) has 298 edges and 104 vertex of which 101 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 4 ms. Remains 101 /104 variables (removed 3) and now considering 124/124 (removed 0) transitions.
// Phase 1: matrix 124 rows 101 cols
[2024-06-01 13:52:09] [INFO ] Computed 3 invariants in 1 ms
[2024-06-01 13:52:10] [INFO ] Implicit Places using invariants in 176 ms returned []
[2024-06-01 13:52:10] [INFO ] Invariant cache hit.
[2024-06-01 13:52:10] [INFO ] State equation strengthened by 54 read => feed constraints.
[2024-06-01 13:52:10] [INFO ] Implicit Places using invariants and state equation in 456 ms returned []
Implicit Place search using SMT with State Equation took 634 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 101/104 places, 124/127 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 20977 ms. Remains : 101/104 places, 124/127 transitions.
RANDOM walk for 4000000 steps (898092 resets) in 6810 ms. (587 steps per ms) remains 1/1 properties
BEST_FIRST walk for 4000003 steps (188780 resets) in 2555 ms. (1564 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 4536489 steps, run timeout after 6001 ms. (steps per millisecond=755 ) properties seen :0 out of 1
Probabilistic random walk after 4536489 steps, saw 2001129 distinct states, run finished after 6001 ms. (steps per millisecond=755 ) properties seen :0
[2024-06-01 13:52:19] [INFO ] Invariant cache hit.
[2024-06-01 13:52:19] [INFO ] State equation strengthened by 54 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 82/84 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/84 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 135/219 variables, 93/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/219 variables, 1/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/219 variables, 42/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/219 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 6/225 variables, 2/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/225 variables, 6/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/225 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/225 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 225/225 variables, and 158 constraints, problems are : Problem set: 0 solved, 1 unsolved in 157 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 101/101 constraints, ReadFeed: 54/54 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 82/84 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/84 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 135/219 variables, 93/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/219 variables, 1/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/219 variables, 42/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/219 variables, 1/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/219 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 6/225 variables, 2/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/225 variables, 6/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 13:52:19] [INFO ] Deduced a trap composed of 22 places in 57 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/225 variables, 1/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/225 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/225 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 225/225 variables, and 160 constraints, problems are : Problem set: 0 solved, 1 unsolved in 363 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 101/101 constraints, ReadFeed: 54/54 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 528ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 804 ms.
Support contains 2 out of 101 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 101/101 places, 124/124 transitions.
Applied a total of 0 rules in 5 ms. Remains 101 /101 variables (removed 0) and now considering 124/124 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 101/101 places, 124/124 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 101/101 places, 124/124 transitions.
Applied a total of 0 rules in 3 ms. Remains 101 /101 variables (removed 0) and now considering 124/124 (removed 0) transitions.
[2024-06-01 13:52:20] [INFO ] Invariant cache hit.
[2024-06-01 13:52:20] [INFO ] Implicit Places using invariants in 144 ms returned []
[2024-06-01 13:52:20] [INFO ] Invariant cache hit.
[2024-06-01 13:52:20] [INFO ] State equation strengthened by 54 read => feed constraints.
[2024-06-01 13:52:20] [INFO ] Implicit Places using invariants and state equation in 447 ms returned []
Implicit Place search using SMT with State Equation took 593 ms to find 0 implicit places.
[2024-06-01 13:52:21] [INFO ] Redundant transitions in 5 ms returned []
Running 123 sub problems to find dead transitions.
[2024-06-01 13:52:21] [INFO ] Invariant cache hit.
[2024-06-01 13:52:21] [INFO ] State equation strengthened by 54 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/100 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 2 (OVERLAPS) 1/101 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/101 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 123 unsolved
Problem TDEAD34 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD110 is UNSAT
At refinement iteration 4 (OVERLAPS) 124/225 variables, 101/104 constraints. Problems are: Problem set: 3 solved, 120 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/225 variables, 54/158 constraints. Problems are: Problem set: 3 solved, 120 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/225 variables, 0/158 constraints. Problems are: Problem set: 3 solved, 120 unsolved
At refinement iteration 7 (OVERLAPS) 0/225 variables, 0/158 constraints. Problems are: Problem set: 3 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Real declared 225/225 variables, and 158 constraints, problems are : Problem set: 3 solved, 120 unsolved in 5530 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 101/101 constraints, ReadFeed: 54/54 constraints, PredecessorRefiner: 123/123 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 120 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 0/1 constraints. Problems are: Problem set: 3 solved, 120 unsolved
At refinement iteration 2 (OVERLAPS) 1/98 variables, 2/3 constraints. Problems are: Problem set: 3 solved, 120 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 0/3 constraints. Problems are: Problem set: 3 solved, 120 unsolved
At refinement iteration 4 (OVERLAPS) 123/221 variables, 98/101 constraints. Problems are: Problem set: 3 solved, 120 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/221 variables, 53/154 constraints. Problems are: Problem set: 3 solved, 120 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/221 variables, 14/168 constraints. Problems are: Problem set: 3 solved, 120 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/221 variables, 0/168 constraints. Problems are: Problem set: 3 solved, 120 unsolved
At refinement iteration 8 (OVERLAPS) 4/225 variables, 3/171 constraints. Problems are: Problem set: 3 solved, 120 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/225 variables, 1/172 constraints. Problems are: Problem set: 3 solved, 120 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/225 variables, 106/278 constraints. Problems are: Problem set: 3 solved, 120 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/225 variables, 0/278 constraints. Problems are: Problem set: 3 solved, 120 unsolved
At refinement iteration 12 (OVERLAPS) 0/225 variables, 0/278 constraints. Problems are: Problem set: 3 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Int declared 225/225 variables, and 278 constraints, problems are : Problem set: 3 solved, 120 unsolved in 13912 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 101/101 constraints, ReadFeed: 54/54 constraints, PredecessorRefiner: 120/123 constraints, Known Traps: 0/0 constraints]
After SMT, in 19582ms problems are : Problem set: 3 solved, 120 unsolved
Search for dead transitions found 3 dead transitions in 19584ms
Found 3 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 3 transitions
Dead transitions reduction (with SMT) removed 3 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 101/101 places, 121/124 transitions.
Graph (complete) has 289 edges and 101 vertex of which 98 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 7 ms. Remains 98 /101 variables (removed 3) and now considering 121/121 (removed 0) transitions.
// Phase 1: matrix 121 rows 98 cols
[2024-06-01 13:52:40] [INFO ] Computed 3 invariants in 1 ms
[2024-06-01 13:52:40] [INFO ] Implicit Places using invariants in 120 ms returned []
[2024-06-01 13:52:40] [INFO ] Invariant cache hit.
[2024-06-01 13:52:40] [INFO ] State equation strengthened by 53 read => feed constraints.
[2024-06-01 13:52:41] [INFO ] Implicit Places using invariants and state equation in 380 ms returned []
Implicit Place search using SMT with State Equation took 508 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 98/101 places, 121/124 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 20712 ms. Remains : 98/101 places, 121/124 transitions.
RANDOM walk for 4000000 steps (897674 resets) in 7301 ms. (547 steps per ms) remains 1/1 properties
BEST_FIRST walk for 4000004 steps (188050 resets) in 2323 ms. (1721 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 4486141 steps, run timeout after 6001 ms. (steps per millisecond=747 ) properties seen :0 out of 1
Probabilistic random walk after 4486141 steps, saw 1974707 distinct states, run finished after 6001 ms. (steps per millisecond=747 ) properties seen :0
[2024-06-01 13:52:49] [INFO ] Invariant cache hit.
[2024-06-01 13:52:49] [INFO ] State equation strengthened by 53 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 80/82 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/82 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 131/213 variables, 90/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/213 variables, 1/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/213 variables, 41/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/213 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 6/219 variables, 2/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/219 variables, 6/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/219 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/219 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 219/219 variables, and 154 constraints, problems are : Problem set: 0 solved, 1 unsolved in 129 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 98/98 constraints, ReadFeed: 53/53 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 80/82 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/82 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 131/213 variables, 90/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/213 variables, 1/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/213 variables, 41/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/213 variables, 1/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/213 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 6/219 variables, 2/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/219 variables, 6/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/219 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/219 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 219/219 variables, and 155 constraints, problems are : Problem set: 0 solved, 1 unsolved in 200 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 98/98 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 334ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 379 ms.
Support contains 2 out of 98 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 98/98 places, 121/121 transitions.
Applied a total of 0 rules in 6 ms. Remains 98 /98 variables (removed 0) and now considering 121/121 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 98/98 places, 121/121 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 98/98 places, 121/121 transitions.
Applied a total of 0 rules in 4 ms. Remains 98 /98 variables (removed 0) and now considering 121/121 (removed 0) transitions.
[2024-06-01 13:52:50] [INFO ] Invariant cache hit.
[2024-06-01 13:52:50] [INFO ] Implicit Places using invariants in 161 ms returned []
[2024-06-01 13:52:50] [INFO ] Invariant cache hit.
[2024-06-01 13:52:50] [INFO ] State equation strengthened by 53 read => feed constraints.
[2024-06-01 13:52:50] [INFO ] Implicit Places using invariants and state equation in 453 ms returned []
Implicit Place search using SMT with State Equation took 618 ms to find 0 implicit places.
[2024-06-01 13:52:50] [INFO ] Redundant transitions in 5 ms returned []
Running 120 sub problems to find dead transitions.
[2024-06-01 13:52:50] [INFO ] Invariant cache hit.
[2024-06-01 13:52:50] [INFO ] State equation strengthened by 53 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 2 (OVERLAPS) 1/98 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 4 (OVERLAPS) 121/219 variables, 98/101 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/219 variables, 53/154 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/219 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 7 (OVERLAPS) 0/219 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Real declared 219/219 variables, and 154 constraints, problems are : Problem set: 0 solved, 120 unsolved in 5324 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 98/98 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 120 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 2 (OVERLAPS) 1/98 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 4 (OVERLAPS) 121/219 variables, 98/101 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/219 variables, 53/154 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/219 variables, 120/274 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/219 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 8 (OVERLAPS) 0/219 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Int declared 219/219 variables, and 274 constraints, problems are : Problem set: 0 solved, 120 unsolved in 8862 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 98/98 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 0/0 constraints]
After SMT, in 14337ms problems are : Problem set: 0 solved, 120 unsolved
Search for dead transitions found 0 dead transitions in 14339ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14975 ms. Remains : 98/98 places, 121/121 transitions.
RANDOM walk for 400000 steps (89755 resets) in 3795 ms. (105 steps per ms) remains 1/2 properties
Running SMT prover for 1 properties.
[2024-06-01 13:53:06] [INFO ] Invariant cache hit.
[2024-06-01 13:53:06] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-06-01 13:53:06] [INFO ] After 54ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-06-01 13:53:06] [INFO ] State equation strengthened by 53 read => feed constraints.
[2024-06-01 13:53:06] [INFO ] After 22ms SMT Verify possible using 53 Read/Feed constraints in real domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 13:53:06] [INFO ] After 43ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 13:53:06] [INFO ] After 150ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 13:53:06] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-06-01 13:53:06] [INFO ] After 91ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-01 13:53:06] [INFO ] After 36ms SMT Verify possible using 53 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 13:53:06] [INFO ] After 56ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-01 13:53:06] [INFO ] After 216ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
RANDOM walk for 4000000 steps (897948 resets) in 8128 ms. (492 steps per ms) remains 1/1 properties
BEST_FIRST walk for 4000004 steps (188723 resets) in 2849 ms. (1403 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 4371168 steps, run timeout after 6001 ms. (steps per millisecond=728 ) properties seen :0 out of 1
Probabilistic random walk after 4371168 steps, saw 1919509 distinct states, run finished after 6001 ms. (steps per millisecond=728 ) properties seen :0
[2024-06-01 13:53:15] [INFO ] Invariant cache hit.
[2024-06-01 13:53:15] [INFO ] State equation strengthened by 53 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 80/82 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/82 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 131/213 variables, 90/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/213 variables, 1/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/213 variables, 41/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/213 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 6/219 variables, 2/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/219 variables, 6/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/219 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/219 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 219/219 variables, and 154 constraints, problems are : Problem set: 0 solved, 1 unsolved in 148 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 98/98 constraints, ReadFeed: 53/53 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 80/82 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/82 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 131/213 variables, 90/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/213 variables, 1/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/213 variables, 41/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/213 variables, 1/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/213 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 6/219 variables, 2/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/219 variables, 6/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/219 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/219 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 219/219 variables, and 155 constraints, problems are : Problem set: 0 solved, 1 unsolved in 257 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 98/98 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 417ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 354 ms.
Support contains 2 out of 98 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 98/98 places, 121/121 transitions.
Applied a total of 0 rules in 9 ms. Remains 98 /98 variables (removed 0) and now considering 121/121 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 98/98 places, 121/121 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 98/98 places, 121/121 transitions.
Applied a total of 0 rules in 4 ms. Remains 98 /98 variables (removed 0) and now considering 121/121 (removed 0) transitions.
[2024-06-01 13:53:16] [INFO ] Invariant cache hit.
[2024-06-01 13:53:16] [INFO ] Implicit Places using invariants in 154 ms returned []
[2024-06-01 13:53:16] [INFO ] Invariant cache hit.
[2024-06-01 13:53:16] [INFO ] State equation strengthened by 53 read => feed constraints.
[2024-06-01 13:53:16] [INFO ] Implicit Places using invariants and state equation in 454 ms returned []
Implicit Place search using SMT with State Equation took 610 ms to find 0 implicit places.
[2024-06-01 13:53:16] [INFO ] Redundant transitions in 5 ms returned []
Running 120 sub problems to find dead transitions.
[2024-06-01 13:53:16] [INFO ] Invariant cache hit.
[2024-06-01 13:53:16] [INFO ] State equation strengthened by 53 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 2 (OVERLAPS) 1/98 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 4 (OVERLAPS) 121/219 variables, 98/101 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/219 variables, 53/154 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/219 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 7 (OVERLAPS) 0/219 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Real declared 219/219 variables, and 154 constraints, problems are : Problem set: 0 solved, 120 unsolved in 5313 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 98/98 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 120 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 2 (OVERLAPS) 1/98 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 4 (OVERLAPS) 121/219 variables, 98/101 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/219 variables, 53/154 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/219 variables, 120/274 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/219 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 8 (OVERLAPS) 0/219 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Int declared 219/219 variables, and 274 constraints, problems are : Problem set: 0 solved, 120 unsolved in 8490 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 98/98 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 0/0 constraints]
After SMT, in 13975ms problems are : Problem set: 0 solved, 120 unsolved
Search for dead transitions found 0 dead transitions in 13977ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14603 ms. Remains : 98/98 places, 121/121 transitions.
RANDOM walk for 400000 steps (89684 resets) in 771 ms. (518 steps per ms) remains 1/2 properties
Running SMT prover for 1 properties.
[2024-06-01 13:53:31] [INFO ] Invariant cache hit.
[2024-06-01 13:53:31] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-06-01 13:53:31] [INFO ] After 67ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-06-01 13:53:31] [INFO ] State equation strengthened by 53 read => feed constraints.
[2024-06-01 13:53:31] [INFO ] After 26ms SMT Verify possible using 53 Read/Feed constraints in real domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 13:53:31] [INFO ] After 42ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 13:53:31] [INFO ] After 168ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 13:53:31] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-06-01 13:53:31] [INFO ] After 83ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-01 13:53:31] [INFO ] After 34ms SMT Verify possible using 53 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 13:53:31] [INFO ] After 53ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-01 13:53:31] [INFO ] After 179ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
RANDOM walk for 4 steps (0 resets) in 5 ms. (0 steps per ms) remains 0/1 properties
RANDOM walk for 40000 steps (8897 resets) in 251 ms. (158 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (4040 resets) in 161 ms. (246 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2311319 steps, run timeout after 3001 ms. (steps per millisecond=770 ) properties seen :0 out of 1
Probabilistic random walk after 2311319 steps, saw 1023798 distinct states, run finished after 3004 ms. (steps per millisecond=769 ) properties seen :0
[2024-06-01 13:53:34] [INFO ] Invariant cache hit.
[2024-06-01 13:53:34] [INFO ] State equation strengthened by 53 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 13/14 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 95/109 variables, 14/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/109 variables, 26/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/109 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 104/213 variables, 77/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/213 variables, 1/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/213 variables, 27/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/213 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 6/219 variables, 2/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/219 variables, 6/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/219 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/219 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 219/219 variables, and 154 constraints, problems are : Problem set: 0 solved, 1 unsolved in 147 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 98/98 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 13/14 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 95/109 variables, 14/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/109 variables, 26/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/109 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/109 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 104/213 variables, 77/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/213 variables, 1/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/213 variables, 27/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/213 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 6/219 variables, 2/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/219 variables, 6/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/219 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/219 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 219/219 variables, and 155 constraints, problems are : Problem set: 0 solved, 1 unsolved in 196 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 98/98 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 361ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 20 ms.
Support contains 1 out of 98 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 98/98 places, 121/121 transitions.
Applied a total of 0 rules in 4 ms. Remains 98 /98 variables (removed 0) and now considering 121/121 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 98/98 places, 121/121 transitions.
RANDOM walk for 40000 steps (8958 resets) in 122 ms. (325 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (4204 resets) in 74 ms. (533 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2276010 steps, run timeout after 3001 ms. (steps per millisecond=758 ) properties seen :0 out of 1
Probabilistic random walk after 2276010 steps, saw 1008797 distinct states, run finished after 3001 ms. (steps per millisecond=758 ) properties seen :0
[2024-06-01 13:53:38] [INFO ] Invariant cache hit.
[2024-06-01 13:53:38] [INFO ] State equation strengthened by 53 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 13/14 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 95/109 variables, 14/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/109 variables, 26/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/109 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 104/213 variables, 77/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/213 variables, 1/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/213 variables, 27/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/213 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 6/219 variables, 2/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/219 variables, 6/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/219 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/219 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 219/219 variables, and 154 constraints, problems are : Problem set: 0 solved, 1 unsolved in 171 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 98/98 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 13/14 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 95/109 variables, 14/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/109 variables, 26/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/109 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/109 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 104/213 variables, 77/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/213 variables, 1/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/213 variables, 27/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/213 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 6/219 variables, 2/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/219 variables, 6/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/219 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/219 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 219/219 variables, and 155 constraints, problems are : Problem set: 0 solved, 1 unsolved in 206 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 98/98 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 396ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 28 ms.
Support contains 1 out of 98 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 98/98 places, 121/121 transitions.
Applied a total of 0 rules in 5 ms. Remains 98 /98 variables (removed 0) and now considering 121/121 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 98/98 places, 121/121 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 98/98 places, 121/121 transitions.
Applied a total of 0 rules in 5 ms. Remains 98 /98 variables (removed 0) and now considering 121/121 (removed 0) transitions.
[2024-06-01 13:53:38] [INFO ] Invariant cache hit.
[2024-06-01 13:53:38] [INFO ] Implicit Places using invariants in 150 ms returned []
[2024-06-01 13:53:38] [INFO ] Invariant cache hit.
[2024-06-01 13:53:38] [INFO ] State equation strengthened by 53 read => feed constraints.
[2024-06-01 13:53:39] [INFO ] Implicit Places using invariants and state equation in 389 ms returned []
Implicit Place search using SMT with State Equation took 552 ms to find 0 implicit places.
[2024-06-01 13:53:39] [INFO ] Redundant transitions in 4 ms returned []
Running 120 sub problems to find dead transitions.
[2024-06-01 13:53:39] [INFO ] Invariant cache hit.
[2024-06-01 13:53:39] [INFO ] State equation strengthened by 53 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 2 (OVERLAPS) 1/98 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 4 (OVERLAPS) 121/219 variables, 98/101 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/219 variables, 53/154 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/219 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 7 (OVERLAPS) 0/219 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Real declared 219/219 variables, and 154 constraints, problems are : Problem set: 0 solved, 120 unsolved in 5737 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 98/98 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 120 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 2 (OVERLAPS) 1/98 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 4 (OVERLAPS) 121/219 variables, 98/101 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/219 variables, 53/154 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/219 variables, 120/274 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/219 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 8 (OVERLAPS) 0/219 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Int declared 219/219 variables, and 274 constraints, problems are : Problem set: 0 solved, 120 unsolved in 9138 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 98/98 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 0/0 constraints]
After SMT, in 15022ms problems are : Problem set: 0 solved, 120 unsolved
Search for dead transitions found 0 dead transitions in 15024ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15593 ms. Remains : 98/98 places, 121/121 transitions.
Attempting over-approximation, by ignoring read arcs.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 98 transition count 113
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 14 place count 92 transition count 113
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 14 place count 92 transition count 98
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 44 place count 77 transition count 98
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 56 place count 71 transition count 92
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 58 place count 70 transition count 101
Applied a total of 58 rules in 29 ms. Remains 70 /98 variables (removed 28) and now considering 101/121 (removed 20) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 101 rows 70 cols
[2024-06-01 13:53:54] [INFO ] Computed 4 invariants in 4 ms
[2024-06-01 13:53:54] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-06-01 13:53:54] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2024-06-01 13:53:54] [INFO ] After 59ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 13:53:54] [INFO ] Deduced a trap composed of 39 places in 58 ms of which 2 ms to minimize.
TRAPS : Iteration 1
[2024-06-01 13:53:54] [INFO ] After 138ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 13:53:54] [INFO ] After 186ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 13:53:54] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-06-01 13:53:54] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2024-06-01 13:53:54] [INFO ] After 53ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 13:53:54] [INFO ] Deduced a trap composed of 39 places in 33 ms of which 1 ms to minimize.
[2024-06-01 13:53:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 44 ms
TRAPS : Iteration 1
[2024-06-01 13:53:54] [INFO ] After 115ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-01 13:53:54] [INFO ] After 158ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 383 ms.
Attempting over-approximation, by ignoring read arcs.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 98 transition count 114
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 13 place count 92 transition count 114
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 13 place count 92 transition count 99
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 43 place count 77 transition count 99
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 55 place count 71 transition count 93
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 57 place count 70 transition count 102
Applied a total of 57 rules in 9 ms. Remains 70 /98 variables (removed 28) and now considering 102/121 (removed 19) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 102 rows 70 cols
[2024-06-01 13:53:54] [INFO ] Computed 3 invariants in 1 ms
[2024-06-01 13:53:54] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-06-01 13:53:54] [INFO ] After 95ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 13:53:54] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-06-01 13:53:54] [INFO ] After 62ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 13:53:54] [INFO ] After 82ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-01 13:53:54] [INFO ] After 133ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 251 ms.
Starting structural reductions in LTL mode, iteration 0 : 251/251 places, 849/849 transitions.
Discarding 51 places :
Symmetric choice reduction at 0 with 51 rule applications. Total rules 51 place count 200 transition count 324
Iterating global reduction 0 with 51 rules applied. Total rules applied 102 place count 200 transition count 324
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 110 place count 200 transition count 316
Discarding 42 places :
Symmetric choice reduction at 1 with 42 rule applications. Total rules 152 place count 158 transition count 273
Iterating global reduction 1 with 42 rules applied. Total rules applied 194 place count 158 transition count 273
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 205 place count 158 transition count 262
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 224 place count 139 transition count 236
Iterating global reduction 2 with 19 rules applied. Total rules applied 243 place count 139 transition count 236
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 2 with 22 rules applied. Total rules applied 265 place count 139 transition count 214
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 269 place count 135 transition count 207
Iterating global reduction 3 with 4 rules applied. Total rules applied 273 place count 135 transition count 207
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 277 place count 131 transition count 203
Iterating global reduction 3 with 4 rules applied. Total rules applied 281 place count 131 transition count 203
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 284 place count 128 transition count 200
Iterating global reduction 3 with 3 rules applied. Total rules applied 287 place count 128 transition count 200
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 290 place count 125 transition count 197
Iterating global reduction 3 with 3 rules applied. Total rules applied 293 place count 125 transition count 197
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 295 place count 123 transition count 195
Iterating global reduction 3 with 2 rules applied. Total rules applied 297 place count 123 transition count 195
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 298 place count 122 transition count 192
Iterating global reduction 3 with 1 rules applied. Total rules applied 299 place count 122 transition count 192
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 300 place count 121 transition count 191
Iterating global reduction 3 with 1 rules applied. Total rules applied 301 place count 121 transition count 191
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 302 place count 120 transition count 190
Iterating global reduction 3 with 1 rules applied. Total rules applied 303 place count 120 transition count 190
Applied a total of 303 rules in 30 ms. Remains 120 /251 variables (removed 131) and now considering 190/849 (removed 659) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30 ms. Remains : 120/251 places, 190/849 transitions.
[2024-06-01 13:53:54] [INFO ] Flatten gal took : 10 ms
[2024-06-01 13:53:54] [INFO ] Flatten gal took : 11 ms
[2024-06-01 13:53:54] [INFO ] Input system was already deterministic with 190 transitions.
Starting structural reductions in LTL mode, iteration 0 : 251/251 places, 849/849 transitions.
Discarding 51 places :
Symmetric choice reduction at 0 with 51 rule applications. Total rules 51 place count 200 transition count 309
Iterating global reduction 0 with 51 rules applied. Total rules applied 102 place count 200 transition count 309
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 110 place count 200 transition count 301
Discarding 42 places :
Symmetric choice reduction at 1 with 42 rule applications. Total rules 152 place count 158 transition count 258
Iterating global reduction 1 with 42 rules applied. Total rules applied 194 place count 158 transition count 258
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 206 place count 158 transition count 246
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 225 place count 139 transition count 219
Iterating global reduction 2 with 19 rules applied. Total rules applied 244 place count 139 transition count 219
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 2 with 20 rules applied. Total rules applied 264 place count 139 transition count 199
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 268 place count 135 transition count 193
Iterating global reduction 3 with 4 rules applied. Total rules applied 272 place count 135 transition count 193
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 276 place count 131 transition count 189
Iterating global reduction 3 with 4 rules applied. Total rules applied 280 place count 131 transition count 189
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 282 place count 129 transition count 187
Iterating global reduction 3 with 2 rules applied. Total rules applied 284 place count 129 transition count 187
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 286 place count 127 transition count 185
Iterating global reduction 3 with 2 rules applied. Total rules applied 288 place count 127 transition count 185
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 290 place count 125 transition count 183
Iterating global reduction 3 with 2 rules applied. Total rules applied 292 place count 125 transition count 183
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 293 place count 124 transition count 180
Iterating global reduction 3 with 1 rules applied. Total rules applied 294 place count 124 transition count 180
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 295 place count 123 transition count 179
Iterating global reduction 3 with 1 rules applied. Total rules applied 296 place count 123 transition count 179
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 297 place count 122 transition count 178
Iterating global reduction 3 with 1 rules applied. Total rules applied 298 place count 122 transition count 178
Applied a total of 298 rules in 25 ms. Remains 122 /251 variables (removed 129) and now considering 178/849 (removed 671) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 25 ms. Remains : 122/251 places, 178/849 transitions.
[2024-06-01 13:53:54] [INFO ] Flatten gal took : 12 ms
[2024-06-01 13:53:54] [INFO ] Flatten gal took : 13 ms
[2024-06-01 13:53:54] [INFO ] Input system was already deterministic with 178 transitions.
Starting structural reductions in LTL mode, iteration 0 : 251/251 places, 849/849 transitions.
Discarding 49 places :
Symmetric choice reduction at 0 with 49 rule applications. Total rules 49 place count 202 transition count 356
Iterating global reduction 0 with 49 rules applied. Total rules applied 98 place count 202 transition count 356
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 106 place count 202 transition count 348
Discarding 40 places :
Symmetric choice reduction at 1 with 40 rule applications. Total rules 146 place count 162 transition count 307
Iterating global reduction 1 with 40 rules applied. Total rules applied 186 place count 162 transition count 307
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 196 place count 162 transition count 297
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 214 place count 144 transition count 273
Iterating global reduction 2 with 18 rules applied. Total rules applied 232 place count 144 transition count 273
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Iterating post reduction 2 with 27 rules applied. Total rules applied 259 place count 144 transition count 246
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 263 place count 140 transition count 239
Iterating global reduction 3 with 4 rules applied. Total rules applied 267 place count 140 transition count 239
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 271 place count 136 transition count 235
Iterating global reduction 3 with 4 rules applied. Total rules applied 275 place count 136 transition count 235
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 278 place count 133 transition count 232
Iterating global reduction 3 with 3 rules applied. Total rules applied 281 place count 133 transition count 232
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 284 place count 130 transition count 229
Iterating global reduction 3 with 3 rules applied. Total rules applied 287 place count 130 transition count 229
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 289 place count 128 transition count 227
Iterating global reduction 3 with 2 rules applied. Total rules applied 291 place count 128 transition count 227
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 292 place count 127 transition count 224
Iterating global reduction 3 with 1 rules applied. Total rules applied 293 place count 127 transition count 224
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 294 place count 126 transition count 223
Iterating global reduction 3 with 1 rules applied. Total rules applied 295 place count 126 transition count 223
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 296 place count 125 transition count 222
Iterating global reduction 3 with 1 rules applied. Total rules applied 297 place count 125 transition count 222
Applied a total of 297 rules in 35 ms. Remains 125 /251 variables (removed 126) and now considering 222/849 (removed 627) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 35 ms. Remains : 125/251 places, 222/849 transitions.
[2024-06-01 13:53:54] [INFO ] Flatten gal took : 15 ms
[2024-06-01 13:53:55] [INFO ] Flatten gal took : 16 ms
[2024-06-01 13:53:55] [INFO ] Input system was already deterministic with 222 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 251/251 places, 849/849 transitions.
Discarding 42 places :
Symmetric choice reduction at 0 with 42 rule applications. Total rules 42 place count 209 transition count 424
Iterating global reduction 0 with 42 rules applied. Total rules applied 84 place count 209 transition count 424
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 91 place count 209 transition count 417
Discarding 34 places :
Symmetric choice reduction at 1 with 34 rule applications. Total rules 125 place count 175 transition count 382
Iterating global reduction 1 with 34 rules applied. Total rules applied 159 place count 175 transition count 382
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 166 place count 175 transition count 375
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 179 place count 162 transition count 358
Iterating global reduction 2 with 13 rules applied. Total rules applied 192 place count 162 transition count 358
Ensure Unique test removed 37 transitions
Reduce isomorphic transitions removed 37 transitions.
Iterating post reduction 2 with 37 rules applied. Total rules applied 229 place count 162 transition count 321
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 230 place count 161 transition count 319
Iterating global reduction 3 with 1 rules applied. Total rules applied 231 place count 161 transition count 319
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 232 place count 160 transition count 318
Iterating global reduction 3 with 1 rules applied. Total rules applied 233 place count 160 transition count 318
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 234 place count 159 transition count 317
Iterating global reduction 3 with 1 rules applied. Total rules applied 235 place count 159 transition count 317
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 236 place count 158 transition count 316
Iterating global reduction 3 with 1 rules applied. Total rules applied 237 place count 158 transition count 316
Applied a total of 237 rules in 57 ms. Remains 158 /251 variables (removed 93) and now considering 316/849 (removed 533) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 57 ms. Remains : 158/251 places, 316/849 transitions.
[2024-06-01 13:53:55] [INFO ] Flatten gal took : 18 ms
[2024-06-01 13:53:55] [INFO ] Flatten gal took : 20 ms
[2024-06-01 13:53:55] [INFO ] Input system was already deterministic with 316 transitions.
Starting structural reductions in LTL mode, iteration 0 : 251/251 places, 849/849 transitions.
Discarding 45 places :
Symmetric choice reduction at 0 with 45 rule applications. Total rules 45 place count 206 transition count 391
Iterating global reduction 0 with 45 rules applied. Total rules applied 90 place count 206 transition count 391
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 97 place count 206 transition count 384
Discarding 36 places :
Symmetric choice reduction at 1 with 36 rule applications. Total rules 133 place count 170 transition count 348
Iterating global reduction 1 with 36 rules applied. Total rules applied 169 place count 170 transition count 348
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 179 place count 170 transition count 338
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 193 place count 156 transition count 320
Iterating global reduction 2 with 14 rules applied. Total rules applied 207 place count 156 transition count 320
Ensure Unique test removed 31 transitions
Reduce isomorphic transitions removed 31 transitions.
Iterating post reduction 2 with 31 rules applied. Total rules applied 238 place count 156 transition count 289
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 241 place count 153 transition count 283
Iterating global reduction 3 with 3 rules applied. Total rules applied 244 place count 153 transition count 283
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 247 place count 150 transition count 280
Iterating global reduction 3 with 3 rules applied. Total rules applied 250 place count 150 transition count 280
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 252 place count 148 transition count 278
Iterating global reduction 3 with 2 rules applied. Total rules applied 254 place count 148 transition count 278
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 256 place count 146 transition count 276
Iterating global reduction 3 with 2 rules applied. Total rules applied 258 place count 146 transition count 276
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 259 place count 145 transition count 275
Iterating global reduction 3 with 1 rules applied. Total rules applied 260 place count 145 transition count 275
Applied a total of 260 rules in 23 ms. Remains 145 /251 variables (removed 106) and now considering 275/849 (removed 574) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23 ms. Remains : 145/251 places, 275/849 transitions.
[2024-06-01 13:53:55] [INFO ] Flatten gal took : 15 ms
[2024-06-01 13:53:55] [INFO ] Flatten gal took : 16 ms
[2024-06-01 13:53:55] [INFO ] Input system was already deterministic with 275 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 251/251 places, 849/849 transitions.
Discarding 54 places :
Symmetric choice reduction at 0 with 54 rule applications. Total rules 54 place count 197 transition count 276
Iterating global reduction 0 with 54 rules applied. Total rules applied 108 place count 197 transition count 276
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 116 place count 197 transition count 268
Discarding 45 places :
Symmetric choice reduction at 1 with 45 rule applications. Total rules 161 place count 152 transition count 222
Iterating global reduction 1 with 45 rules applied. Total rules applied 206 place count 152 transition count 222
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 219 place count 152 transition count 209
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 241 place count 130 transition count 177
Iterating global reduction 2 with 22 rules applied. Total rules applied 263 place count 130 transition count 177
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 2 with 16 rules applied. Total rules applied 279 place count 130 transition count 161
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 285 place count 124 transition count 152
Iterating global reduction 3 with 6 rules applied. Total rules applied 291 place count 124 transition count 152
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 297 place count 118 transition count 146
Iterating global reduction 3 with 6 rules applied. Total rules applied 303 place count 118 transition count 146
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 307 place count 114 transition count 142
Iterating global reduction 3 with 4 rules applied. Total rules applied 311 place count 114 transition count 142
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 313 place count 114 transition count 140
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 317 place count 110 transition count 136
Iterating global reduction 4 with 4 rules applied. Total rules applied 321 place count 110 transition count 136
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 323 place count 108 transition count 134
Iterating global reduction 4 with 2 rules applied. Total rules applied 325 place count 108 transition count 134
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 326 place count 107 transition count 131
Iterating global reduction 4 with 1 rules applied. Total rules applied 327 place count 107 transition count 131
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 328 place count 106 transition count 130
Iterating global reduction 4 with 1 rules applied. Total rules applied 329 place count 106 transition count 130
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 330 place count 105 transition count 129
Iterating global reduction 4 with 1 rules applied. Total rules applied 331 place count 105 transition count 129
Applied a total of 331 rules in 38 ms. Remains 105 /251 variables (removed 146) and now considering 129/849 (removed 720) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 38 ms. Remains : 105/251 places, 129/849 transitions.
[2024-06-01 13:53:55] [INFO ] Flatten gal took : 8 ms
[2024-06-01 13:53:55] [INFO ] Flatten gal took : 8 ms
[2024-06-01 13:53:55] [INFO ] Input system was already deterministic with 129 transitions.
Starting structural reductions in LTL mode, iteration 0 : 251/251 places, 849/849 transitions.
Discarding 43 places :
Symmetric choice reduction at 0 with 43 rule applications. Total rules 43 place count 208 transition count 423
Iterating global reduction 0 with 43 rules applied. Total rules applied 86 place count 208 transition count 423
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 95 place count 208 transition count 414
Discarding 35 places :
Symmetric choice reduction at 1 with 35 rule applications. Total rules 130 place count 173 transition count 378
Iterating global reduction 1 with 35 rules applied. Total rules applied 165 place count 173 transition count 378
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 173 place count 173 transition count 370
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 186 place count 160 transition count 355
Iterating global reduction 2 with 13 rules applied. Total rules applied 199 place count 160 transition count 355
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 2 with 25 rules applied. Total rules applied 224 place count 160 transition count 330
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 227 place count 157 transition count 325
Iterating global reduction 3 with 3 rules applied. Total rules applied 230 place count 157 transition count 325
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 233 place count 154 transition count 322
Iterating global reduction 3 with 3 rules applied. Total rules applied 236 place count 154 transition count 322
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 238 place count 152 transition count 320
Iterating global reduction 3 with 2 rules applied. Total rules applied 240 place count 152 transition count 320
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 242 place count 150 transition count 318
Iterating global reduction 3 with 2 rules applied. Total rules applied 244 place count 150 transition count 318
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 246 place count 148 transition count 316
Iterating global reduction 3 with 2 rules applied. Total rules applied 248 place count 148 transition count 316
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 249 place count 147 transition count 313
Iterating global reduction 3 with 1 rules applied. Total rules applied 250 place count 147 transition count 313
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 251 place count 146 transition count 312
Iterating global reduction 3 with 1 rules applied. Total rules applied 252 place count 146 transition count 312
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 253 place count 145 transition count 311
Iterating global reduction 3 with 1 rules applied. Total rules applied 254 place count 145 transition count 311
Applied a total of 254 rules in 30 ms. Remains 145 /251 variables (removed 106) and now considering 311/849 (removed 538) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30 ms. Remains : 145/251 places, 311/849 transitions.
[2024-06-01 13:53:55] [INFO ] Flatten gal took : 9 ms
[2024-06-01 13:53:55] [INFO ] Flatten gal took : 11 ms
[2024-06-01 13:53:55] [INFO ] Input system was already deterministic with 311 transitions.
Starting structural reductions in LTL mode, iteration 0 : 251/251 places, 849/849 transitions.
Discarding 53 places :
Symmetric choice reduction at 0 with 53 rule applications. Total rules 53 place count 198 transition count 292
Iterating global reduction 0 with 53 rules applied. Total rules applied 106 place count 198 transition count 292
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 114 place count 198 transition count 284
Discarding 44 places :
Symmetric choice reduction at 1 with 44 rule applications. Total rules 158 place count 154 transition count 239
Iterating global reduction 1 with 44 rules applied. Total rules applied 202 place count 154 transition count 239
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 215 place count 154 transition count 226
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 236 place count 133 transition count 196
Iterating global reduction 2 with 21 rules applied. Total rules applied 257 place count 133 transition count 196
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 2 with 18 rules applied. Total rules applied 275 place count 133 transition count 178
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 280 place count 128 transition count 170
Iterating global reduction 3 with 5 rules applied. Total rules applied 285 place count 128 transition count 170
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 290 place count 123 transition count 165
Iterating global reduction 3 with 5 rules applied. Total rules applied 295 place count 123 transition count 165
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 298 place count 120 transition count 162
Iterating global reduction 3 with 3 rules applied. Total rules applied 301 place count 120 transition count 162
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 304 place count 117 transition count 159
Iterating global reduction 3 with 3 rules applied. Total rules applied 307 place count 117 transition count 159
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 309 place count 115 transition count 157
Iterating global reduction 3 with 2 rules applied. Total rules applied 311 place count 115 transition count 157
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 312 place count 114 transition count 154
Iterating global reduction 3 with 1 rules applied. Total rules applied 313 place count 114 transition count 154
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 314 place count 113 transition count 153
Iterating global reduction 3 with 1 rules applied. Total rules applied 315 place count 113 transition count 153
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 316 place count 112 transition count 152
Iterating global reduction 3 with 1 rules applied. Total rules applied 317 place count 112 transition count 152
Applied a total of 317 rules in 13 ms. Remains 112 /251 variables (removed 139) and now considering 152/849 (removed 697) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13 ms. Remains : 112/251 places, 152/849 transitions.
[2024-06-01 13:53:55] [INFO ] Flatten gal took : 5 ms
[2024-06-01 13:53:55] [INFO ] Flatten gal took : 5 ms
[2024-06-01 13:53:55] [INFO ] Input system was already deterministic with 152 transitions.
Starting structural reductions in LTL mode, iteration 0 : 251/251 places, 849/849 transitions.
Discarding 50 places :
Symmetric choice reduction at 0 with 50 rule applications. Total rules 50 place count 201 transition count 340
Iterating global reduction 0 with 50 rules applied. Total rules applied 100 place count 201 transition count 340
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 108 place count 201 transition count 332
Discarding 40 places :
Symmetric choice reduction at 1 with 40 rule applications. Total rules 148 place count 161 transition count 291
Iterating global reduction 1 with 40 rules applied. Total rules applied 188 place count 161 transition count 291
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 198 place count 161 transition count 281
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 216 place count 143 transition count 257
Iterating global reduction 2 with 18 rules applied. Total rules applied 234 place count 143 transition count 257
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 2 with 24 rules applied. Total rules applied 258 place count 143 transition count 233
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 262 place count 139 transition count 226
Iterating global reduction 3 with 4 rules applied. Total rules applied 266 place count 139 transition count 226
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 270 place count 135 transition count 222
Iterating global reduction 3 with 4 rules applied. Total rules applied 274 place count 135 transition count 222
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 277 place count 132 transition count 219
Iterating global reduction 3 with 3 rules applied. Total rules applied 280 place count 132 transition count 219
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 283 place count 129 transition count 216
Iterating global reduction 3 with 3 rules applied. Total rules applied 286 place count 129 transition count 216
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 288 place count 127 transition count 214
Iterating global reduction 3 with 2 rules applied. Total rules applied 290 place count 127 transition count 214
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 291 place count 126 transition count 211
Iterating global reduction 3 with 1 rules applied. Total rules applied 292 place count 126 transition count 211
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 293 place count 125 transition count 210
Iterating global reduction 3 with 1 rules applied. Total rules applied 294 place count 125 transition count 210
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 295 place count 124 transition count 209
Iterating global reduction 3 with 1 rules applied. Total rules applied 296 place count 124 transition count 209
Applied a total of 296 rules in 15 ms. Remains 124 /251 variables (removed 127) and now considering 209/849 (removed 640) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16 ms. Remains : 124/251 places, 209/849 transitions.
[2024-06-01 13:53:55] [INFO ] Flatten gal took : 6 ms
[2024-06-01 13:53:55] [INFO ] Flatten gal took : 7 ms
[2024-06-01 13:53:55] [INFO ] Input system was already deterministic with 209 transitions.
Starting structural reductions in LTL mode, iteration 0 : 251/251 places, 849/849 transitions.
Discarding 44 places :
Symmetric choice reduction at 0 with 44 rule applications. Total rules 44 place count 207 transition count 436
Iterating global reduction 0 with 44 rules applied. Total rules applied 88 place count 207 transition count 436
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 96 place count 207 transition count 428
Discarding 35 places :
Symmetric choice reduction at 1 with 35 rule applications. Total rules 131 place count 172 transition count 392
Iterating global reduction 1 with 35 rules applied. Total rules applied 166 place count 172 transition count 392
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 176 place count 172 transition count 382
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 191 place count 157 transition count 364
Iterating global reduction 2 with 15 rules applied. Total rules applied 206 place count 157 transition count 364
Ensure Unique test removed 39 transitions
Reduce isomorphic transitions removed 39 transitions.
Iterating post reduction 2 with 39 rules applied. Total rules applied 245 place count 157 transition count 325
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 249 place count 153 transition count 318
Iterating global reduction 3 with 4 rules applied. Total rules applied 253 place count 153 transition count 318
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 257 place count 149 transition count 314
Iterating global reduction 3 with 4 rules applied. Total rules applied 261 place count 149 transition count 314
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 264 place count 146 transition count 311
Iterating global reduction 3 with 3 rules applied. Total rules applied 267 place count 146 transition count 311
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 270 place count 143 transition count 308
Iterating global reduction 3 with 3 rules applied. Total rules applied 273 place count 143 transition count 308
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 275 place count 141 transition count 306
Iterating global reduction 3 with 2 rules applied. Total rules applied 277 place count 141 transition count 306
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 278 place count 140 transition count 303
Iterating global reduction 3 with 1 rules applied. Total rules applied 279 place count 140 transition count 303
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 280 place count 139 transition count 302
Iterating global reduction 3 with 1 rules applied. Total rules applied 281 place count 139 transition count 302
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 282 place count 138 transition count 301
Iterating global reduction 3 with 1 rules applied. Total rules applied 283 place count 138 transition count 301
Applied a total of 283 rules in 22 ms. Remains 138 /251 variables (removed 113) and now considering 301/849 (removed 548) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 22 ms. Remains : 138/251 places, 301/849 transitions.
[2024-06-01 13:53:55] [INFO ] Flatten gal took : 9 ms
[2024-06-01 13:53:55] [INFO ] Flatten gal took : 10 ms
[2024-06-01 13:53:55] [INFO ] Input system was already deterministic with 301 transitions.
Starting structural reductions in LTL mode, iteration 0 : 251/251 places, 849/849 transitions.
Discarding 46 places :
Symmetric choice reduction at 0 with 46 rule applications. Total rules 46 place count 205 transition count 363
Iterating global reduction 0 with 46 rules applied. Total rules applied 92 place count 205 transition count 363
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 100 place count 205 transition count 355
Discarding 38 places :
Symmetric choice reduction at 1 with 38 rule applications. Total rules 138 place count 167 transition count 316
Iterating global reduction 1 with 38 rules applied. Total rules applied 176 place count 167 transition count 316
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 188 place count 167 transition count 304
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 203 place count 152 transition count 284
Iterating global reduction 2 with 15 rules applied. Total rules applied 218 place count 152 transition count 284
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 2 with 18 rules applied. Total rules applied 236 place count 152 transition count 266
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 240 place count 148 transition count 259
Iterating global reduction 3 with 4 rules applied. Total rules applied 244 place count 148 transition count 259
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 248 place count 144 transition count 255
Iterating global reduction 3 with 4 rules applied. Total rules applied 252 place count 144 transition count 255
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 255 place count 141 transition count 252
Iterating global reduction 3 with 3 rules applied. Total rules applied 258 place count 141 transition count 252
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 260 place count 139 transition count 250
Iterating global reduction 3 with 2 rules applied. Total rules applied 262 place count 139 transition count 250
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 263 place count 138 transition count 249
Iterating global reduction 3 with 1 rules applied. Total rules applied 264 place count 138 transition count 249
Applied a total of 264 rules in 13 ms. Remains 138 /251 variables (removed 113) and now considering 249/849 (removed 600) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14 ms. Remains : 138/251 places, 249/849 transitions.
[2024-06-01 13:53:55] [INFO ] Flatten gal took : 7 ms
[2024-06-01 13:53:55] [INFO ] Flatten gal took : 8 ms
[2024-06-01 13:53:55] [INFO ] Input system was already deterministic with 249 transitions.
Starting structural reductions in LTL mode, iteration 0 : 251/251 places, 849/849 transitions.
Discarding 53 places :
Symmetric choice reduction at 0 with 53 rule applications. Total rules 53 place count 198 transition count 277
Iterating global reduction 0 with 53 rules applied. Total rules applied 106 place count 198 transition count 277
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 114 place count 198 transition count 269
Discarding 44 places :
Symmetric choice reduction at 1 with 44 rule applications. Total rules 158 place count 154 transition count 224
Iterating global reduction 1 with 44 rules applied. Total rules applied 202 place count 154 transition count 224
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 214 place count 154 transition count 212
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 236 place count 132 transition count 180
Iterating global reduction 2 with 22 rules applied. Total rules applied 258 place count 132 transition count 180
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 2 with 16 rules applied. Total rules applied 274 place count 132 transition count 164
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 279 place count 127 transition count 157
Iterating global reduction 3 with 5 rules applied. Total rules applied 284 place count 127 transition count 157
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 289 place count 122 transition count 152
Iterating global reduction 3 with 5 rules applied. Total rules applied 294 place count 122 transition count 152
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 297 place count 119 transition count 149
Iterating global reduction 3 with 3 rules applied. Total rules applied 300 place count 119 transition count 149
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 302 place count 119 transition count 147
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 305 place count 116 transition count 144
Iterating global reduction 4 with 3 rules applied. Total rules applied 308 place count 116 transition count 144
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 309 place count 115 transition count 143
Iterating global reduction 4 with 1 rules applied. Total rules applied 310 place count 115 transition count 143
Applied a total of 310 rules in 11 ms. Remains 115 /251 variables (removed 136) and now considering 143/849 (removed 706) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11 ms. Remains : 115/251 places, 143/849 transitions.
[2024-06-01 13:53:55] [INFO ] Flatten gal took : 4 ms
[2024-06-01 13:53:55] [INFO ] Flatten gal took : 5 ms
[2024-06-01 13:53:55] [INFO ] Input system was already deterministic with 143 transitions.
[2024-06-01 13:53:55] [INFO ] Flatten gal took : 26 ms
[2024-06-01 13:53:55] [INFO ] Flatten gal took : 27 ms
[2024-06-01 13:53:55] [INFO ] Export to MCC of 16 properties in file /home/mcc/execution/CTLFireability.sr.xml took 6 ms.
[2024-06-01 13:53:55] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 251 places, 849 transitions and 3358 arcs took 11 ms.
Total runtime 302231 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=
[--mu-opt] [--saturation=
[--sat-granularity=
[--guidance=
[--action=
[--trace=
[--mu=
[--ctl=
[--save-levels=STRING] [--pg-solve] [--attr=
[--saturating-attractor] [--write-strategy=
[--check-strategy] [--interactive-play] [--player]
[--pg-write=
[--edge-label=
[--mucalc=
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por=
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=
[--cw-max-cols=
[--mh-timeout=
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=
[--ldd32-cache=
[--cache-ratio=
[--min-free-nodes=
[--fdd-reorder=
[--vset-cache-diff=
[--next-union] [--peak-nodes] [--maxsum=
[--block-size=
[--debug=
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS]
Could not compute solution for formula : SieveSingleMsgMbox-PT-d2m64-CTLFireability-2024-00
Could not compute solution for formula : SieveSingleMsgMbox-PT-d2m64-CTLFireability-2024-01
Could not compute solution for formula : SieveSingleMsgMbox-PT-d2m64-CTLFireability-2024-02
Could not compute solution for formula : SieveSingleMsgMbox-PT-d2m64-CTLFireability-2024-03
Could not compute solution for formula : SieveSingleMsgMbox-PT-d2m64-CTLFireability-2024-04
Could not compute solution for formula : SieveSingleMsgMbox-PT-d2m64-CTLFireability-2024-05
Could not compute solution for formula : SieveSingleMsgMbox-PT-d2m64-CTLFireability-2024-06
Could not compute solution for formula : SieveSingleMsgMbox-PT-d2m64-CTLFireability-2024-07
Could not compute solution for formula : SieveSingleMsgMbox-PT-d2m64-CTLFireability-2024-08
Could not compute solution for formula : SieveSingleMsgMbox-PT-d2m64-CTLFireability-2024-09
Could not compute solution for formula : SieveSingleMsgMbox-PT-d2m64-CTLFireability-2024-10
Could not compute solution for formula : SieveSingleMsgMbox-PT-d2m64-CTLFireability-2024-11
Could not compute solution for formula : SieveSingleMsgMbox-PT-d2m64-CTLFireability-2023-12
Could not compute solution for formula : SieveSingleMsgMbox-PT-d2m64-CTLFireability-2023-13
Could not compute solution for formula : SieveSingleMsgMbox-PT-d2m64-CTLFireability-2023-14
Could not compute solution for formula : SieveSingleMsgMbox-PT-d2m64-CTLFireability-2023-15
BK_STOP 1717250036239
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -timeout 360 -rebuildPNML
mcc2024
ctl formula name SieveSingleMsgMbox-PT-d2m64-CTLFireability-2024-00
ctl formula formula --ctl=/tmp/813/ctl_0_
ctl formula name SieveSingleMsgMbox-PT-d2m64-CTLFireability-2024-01
ctl formula formula --ctl=/tmp/813/ctl_1_
ctl formula name SieveSingleMsgMbox-PT-d2m64-CTLFireability-2024-02
ctl formula formula --ctl=/tmp/813/ctl_2_
ctl formula name SieveSingleMsgMbox-PT-d2m64-CTLFireability-2024-03
ctl formula formula --ctl=/tmp/813/ctl_3_
ctl formula name SieveSingleMsgMbox-PT-d2m64-CTLFireability-2024-04
ctl formula formula --ctl=/tmp/813/ctl_4_
ctl formula name SieveSingleMsgMbox-PT-d2m64-CTLFireability-2024-05
ctl formula formula --ctl=/tmp/813/ctl_5_
ctl formula name SieveSingleMsgMbox-PT-d2m64-CTLFireability-2024-06
ctl formula formula --ctl=/tmp/813/ctl_6_
ctl formula name SieveSingleMsgMbox-PT-d2m64-CTLFireability-2024-07
ctl formula formula --ctl=/tmp/813/ctl_7_
ctl formula name SieveSingleMsgMbox-PT-d2m64-CTLFireability-2024-08
ctl formula formula --ctl=/tmp/813/ctl_8_
ctl formula name SieveSingleMsgMbox-PT-d2m64-CTLFireability-2024-09
ctl formula formula --ctl=/tmp/813/ctl_9_
ctl formula name SieveSingleMsgMbox-PT-d2m64-CTLFireability-2024-10
ctl formula formula --ctl=/tmp/813/ctl_10_
ctl formula name SieveSingleMsgMbox-PT-d2m64-CTLFireability-2024-11
ctl formula formula --ctl=/tmp/813/ctl_11_
ctl formula name SieveSingleMsgMbox-PT-d2m64-CTLFireability-2023-12
ctl formula formula --ctl=/tmp/813/ctl_12_
ctl formula name SieveSingleMsgMbox-PT-d2m64-CTLFireability-2023-13
ctl formula formula --ctl=/tmp/813/ctl_13_
ctl formula name SieveSingleMsgMbox-PT-d2m64-CTLFireability-2023-14
ctl formula formula --ctl=/tmp/813/ctl_14_
ctl formula name SieveSingleMsgMbox-PT-d2m64-CTLFireability-2023-15
ctl formula formula --ctl=/tmp/813/ctl_15_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="SieveSingleMsgMbox-PT-d2m64"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is SieveSingleMsgMbox-PT-d2m64, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r532-smll-171683810800130"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/SieveSingleMsgMbox-PT-d2m64.tgz
mv SieveSingleMsgMbox-PT-d2m64 execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;