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.r377-smll-171683809800140.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is SieveSingleMsgMbox-PT-d2m96, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r377-smll-171683809800140
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.6M
-rw-r--r-- 1 mcc users 6.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 19 07:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 19 16:40 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 19:19 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 12 19:41 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 149K Apr 12 19:41 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.6K Apr 12 19:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 72K Apr 12 19:38 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:56 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:56 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-d2m96-LTLFireability-00
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-LTLFireability-01
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-LTLFireability-02
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-LTLFireability-03
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-LTLFireability-04
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-LTLFireability-05
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-LTLFireability-06
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-LTLFireability-07
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-LTLFireability-08
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-LTLFireability-09
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-LTLFireability-10
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-LTLFireability-11
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-LTLFireability-12
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-LTLFireability-13
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-LTLFireability-14
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716932827191

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SieveSingleMsgMbox-PT-d2m96
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-28 21:47:09] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-28 21:47:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 21:47:09] [INFO ] Load time of PNML (sax parser for PT used): 341 ms
[2024-05-28 21:47:09] [INFO ] Transformed 2398 places.
[2024-05-28 21:47:09] [INFO ] Transformed 1954 transitions.
[2024-05-28 21:47:09] [INFO ] Parsed PT model containing 2398 places and 1954 transitions and 7816 arcs in 514 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 18 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Deduced a syphon composed of 1984 places in 26 ms
Reduce places removed 1984 places and 0 transitions.
FORMULA SieveSingleMsgMbox-PT-d2m96-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m96-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 28 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 97 places :
Symmetric choice reduction at 1 with 97 rule applications. Total rules 950 place count 292 transition count 705
Iterating global reduction 1 with 97 rules applied. Total rules applied 1047 place count 292 transition count 705
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 1057 place count 292 transition count 695
Discarding 69 places :
Symmetric choice reduction at 2 with 69 rule applications. Total rules 1126 place count 223 transition count 626
Iterating global reduction 2 with 69 rules applied. Total rules applied 1195 place count 223 transition count 626
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 2 with 28 rules applied. Total rules applied 1223 place count 223 transition count 598
Discarding 26 places :
Symmetric choice reduction at 3 with 26 rule applications. Total rules 1249 place count 197 transition count 567
Iterating global reduction 3 with 26 rules applied. Total rules applied 1275 place count 197 transition count 567
Ensure Unique test removed 52 transitions
Reduce isomorphic transitions removed 52 transitions.
Iterating post reduction 3 with 52 rules applied. Total rules applied 1327 place count 197 transition count 515
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 1332 place count 192 transition count 507
Iterating global reduction 4 with 5 rules applied. Total rules applied 1337 place count 192 transition count 507
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 1342 place count 187 transition count 502
Iterating global reduction 4 with 5 rules applied. Total rules applied 1347 place count 187 transition count 502
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 1349 place count 185 transition count 499
Iterating global reduction 4 with 2 rules applied. Total rules applied 1351 place count 185 transition count 499
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 1353 place count 183 transition count 497
Iterating global reduction 4 with 2 rules applied. Total rules applied 1355 place count 183 transition count 497
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 1357 place count 181 transition count 495
Iterating global reduction 4 with 2 rules applied. Total rules applied 1359 place count 181 transition count 495
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 1360 place count 180 transition count 494
Iterating global reduction 4 with 1 rules applied. Total rules applied 1361 place count 180 transition count 494
Applied a total of 1361 rules in 171 ms. Remains 180 /414 variables (removed 234) and now considering 494/1954 (removed 1460) transitions.
// Phase 1: matrix 494 rows 180 cols
[2024-05-28 21:47:10] [INFO ] Computed 5 invariants in 36 ms
[2024-05-28 21:47:10] [INFO ] Implicit Places using invariants in 433 ms returned []
[2024-05-28 21:47:10] [INFO ] Invariant cache hit.
[2024-05-28 21:47:11] [INFO ] State equation strengthened by 354 read => feed constraints.
[2024-05-28 21:47:12] [INFO ] Implicit Places using invariants and state equation in 1252 ms returned []
Implicit Place search using SMT with State Equation took 1729 ms to find 0 implicit places.
Running 493 sub problems to find dead transitions.
[2024-05-28 21:47:12] [INFO ] Invariant cache hit.
[2024-05-28 21:47:12] [INFO ] State equation strengthened by 354 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/179 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 493 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/179 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 493 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/179 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 493 unsolved
At refinement iteration 3 (OVERLAPS) 1/180 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 493 unsolved
[2024-05-28 21:47:23] [INFO ] Deduced a trap composed of 60 places in 158 ms of which 31 ms to minimize.
[2024-05-28 21:47:23] [INFO ] Deduced a trap composed of 60 places in 104 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/180 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 493 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/180 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 493 unsolved
At refinement iteration 6 (OVERLAPS) 494/674 variables, 180/187 constraints. Problems are: Problem set: 0 solved, 493 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/674 variables, 354/541 constraints. Problems are: Problem set: 0 solved, 493 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/674 variables, 0/541 constraints. Problems are: Problem set: 0 solved, 493 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 674/674 variables, and 541 constraints, problems are : Problem set: 0 solved, 493 unsolved in 30049 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 180/180 constraints, ReadFeed: 354/354 constraints, PredecessorRefiner: 493/493 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 493 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/179 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 493 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/179 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 493 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/179 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 493 unsolved
At refinement iteration 3 (OVERLAPS) 1/180 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 493 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/180 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 493 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/180 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 493 unsolved
At refinement iteration 6 (OVERLAPS) 494/674 variables, 180/187 constraints. Problems are: Problem set: 0 solved, 493 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/674 variables, 354/541 constraints. Problems are: Problem set: 0 solved, 493 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/674 variables, 493/1034 constraints. Problems are: Problem set: 0 solved, 493 unsolved
[2024-05-28 21:48:07] [INFO ] Deduced a trap composed of 52 places in 55 ms of which 1 ms to minimize.
[2024-05-28 21:48:08] [INFO ] Deduced a trap composed of 23 places in 93 ms of which 2 ms to minimize.
Problem TDEAD57 is UNSAT
[2024-05-28 21:48:10] [INFO ] Deduced a trap composed of 57 places in 87 ms of which 2 ms to minimize.
Problem TDEAD61 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 674/674 variables, and 1037 constraints, problems are : Problem set: 2 solved, 491 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 180/180 constraints, ReadFeed: 354/354 constraints, PredecessorRefiner: 493/493 constraints, Known Traps: 5/5 constraints]
After SMT, in 62522ms problems are : Problem set: 2 solved, 491 unsolved
Search for dead transitions found 2 dead transitions in 62570ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) removed 2 transitions
Starting structural reductions in LTL mode, iteration 1 : 180/414 places, 492/1954 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 178 transition count 492
Applied a total of 2 rules in 11 ms. Remains 178 /180 variables (removed 2) and now considering 492/492 (removed 0) transitions.
// Phase 1: matrix 492 rows 178 cols
[2024-05-28 21:48:14] [INFO ] Computed 4 invariants in 8 ms
[2024-05-28 21:48:14] [INFO ] Implicit Places using invariants in 241 ms returned []
[2024-05-28 21:48:14] [INFO ] Invariant cache hit.
[2024-05-28 21:48:15] [INFO ] State equation strengthened by 353 read => feed constraints.
[2024-05-28 21:48:16] [INFO ] Implicit Places using invariants and state equation in 1375 ms returned []
Implicit Place search using SMT with State Equation took 1620 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 178/414 places, 492/1954 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 66147 ms. Remains : 178/414 places, 492/1954 transitions.
Support contains 28 out of 178 places after structural reductions.
[2024-05-28 21:48:16] [INFO ] Flatten gal took : 102 ms
[2024-05-28 21:48:16] [INFO ] Flatten gal took : 78 ms
[2024-05-28 21:48:16] [INFO ] Input system was already deterministic with 492 transitions.
RANDOM walk for 40000 steps (8935 resets) in 3287 ms. (12 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (207 resets) in 70 ms. (56 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (180 resets) in 77 ms. (51 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (172 resets) in 30 ms. (129 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (195 resets) in 63 ms. (62 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4001 steps (195 resets) in 36 ms. (108 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4001 steps (437 resets) in 45 ms. (86 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (196 resets) in 27 ms. (142 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (189 resets) in 25 ms. (153 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (182 resets) in 23 ms. (166 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4001 steps (192 resets) in 22 ms. (173 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (172 resets) in 22 ms. (174 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (198 resets) in 21 ms. (181 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (438 resets) in 29 ms. (133 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (172 resets) in 21 ms. (181 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (177 resets) in 23 ms. (166 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (385 resets) in 38 ms. (102 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (189 resets) in 24 ms. (160 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (188 resets) in 22 ms. (174 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (421 resets) in 29 ms. (133 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (220 resets) in 22 ms. (174 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (183 resets) in 32 ms. (121 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4001 steps (193 resets) in 24 ms. (160 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (195 resets) in 23 ms. (166 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (407 resets) in 30 ms. (129 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (178 resets) in 21 ms. (182 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (204 resets) in 22 ms. (174 steps per ms) remains 26/26 properties
Interrupted probabilistic random walk after 167165 steps, run timeout after 3001 ms. (steps per millisecond=55 ) properties seen :10 out of 26
Probabilistic random walk after 167165 steps, saw 79851 distinct states, run finished after 3008 ms. (steps per millisecond=55 ) properties seen :10
[2024-05-28 21:48:21] [INFO ] Invariant cache hit.
[2024-05-28 21:48:21] [INFO ] State equation strengthened by 353 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 78/97 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 4/101 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/101 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 16 unsolved
Problem AtomicPropp24 is UNSAT
At refinement iteration 5 (OVERLAPS) 37/138 variables, 1/4 constraints. Problems are: Problem set: 1 solved, 15 unsolved
[2024-05-28 21:48:22] [INFO ] Deduced a trap composed of 58 places in 118 ms of which 3 ms to minimize.
[2024-05-28 21:48:22] [INFO ] Deduced a trap composed of 59 places in 108 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/138 variables, 2/6 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/138 variables, 0/6 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 8 (OVERLAPS) 363/501 variables, 138/144 constraints. Problems are: Problem set: 1 solved, 15 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/501 variables, 224/368 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/501 variables, 0/368 constraints. Problems are: Problem set: 1 solved, 15 unsolved
Problem AtomicPropp25 is UNSAT
At refinement iteration 11 (OVERLAPS) 169/670 variables, 40/408 constraints. Problems are: Problem set: 2 solved, 14 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/670 variables, 129/537 constraints. Problems are: Problem set: 2 solved, 14 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/670 variables, 0/537 constraints. Problems are: Problem set: 2 solved, 14 unsolved
At refinement iteration 14 (OVERLAPS) 0/670 variables, 0/537 constraints. Problems are: Problem set: 2 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Real declared 670/670 variables, and 537 constraints, problems are : Problem set: 2 solved, 14 unsolved in 3013 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 178/178 constraints, ReadFeed: 353/353 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 2 solved, 14 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 78/94 variables, 2/2 constraints. Problems are: Problem set: 2 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 0/2 constraints. Problems are: Problem set: 2 solved, 14 unsolved
At refinement iteration 3 (OVERLAPS) 4/98 variables, 1/3 constraints. Problems are: Problem set: 2 solved, 14 unsolved
[2024-05-28 21:48:24] [INFO ] Deduced a trap composed of 53 places in 52 ms of which 1 ms to minimize.
[2024-05-28 21:48:24] [INFO ] Deduced a trap composed of 49 places in 49 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/98 variables, 2/5 constraints. Problems are: Problem set: 2 solved, 14 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/98 variables, 0/5 constraints. Problems are: Problem set: 2 solved, 14 unsolved
At refinement iteration 6 (OVERLAPS) 37/135 variables, 1/6 constraints. Problems are: Problem set: 2 solved, 14 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/135 variables, 2/8 constraints. Problems are: Problem set: 2 solved, 14 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/135 variables, 0/8 constraints. Problems are: Problem set: 2 solved, 14 unsolved
At refinement iteration 9 (OVERLAPS) 318/453 variables, 135/143 constraints. Problems are: Problem set: 2 solved, 14 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/453 variables, 179/322 constraints. Problems are: Problem set: 2 solved, 14 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/453 variables, 2/324 constraints. Problems are: Problem set: 2 solved, 14 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/453 variables, 0/324 constraints. Problems are: Problem set: 2 solved, 14 unsolved
At refinement iteration 13 (OVERLAPS) 217/670 variables, 43/367 constraints. Problems are: Problem set: 2 solved, 14 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/670 variables, 174/541 constraints. Problems are: Problem set: 2 solved, 14 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/670 variables, 12/553 constraints. Problems are: Problem set: 2 solved, 14 unsolved
[2024-05-28 21:48:27] [INFO ] Deduced a trap composed of 23 places in 28 ms of which 2 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/670 variables, 1/554 constraints. Problems are: Problem set: 2 solved, 14 unsolved
[2024-05-28 21:48:28] [INFO ] Deduced a trap composed of 52 places in 54 ms of which 2 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/670 variables, 1/555 constraints. Problems are: Problem set: 2 solved, 14 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 670/670 variables, and 555 constraints, problems are : Problem set: 2 solved, 14 unsolved in 5008 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 178/178 constraints, ReadFeed: 353/353 constraints, PredecessorRefiner: 14/16 constraints, Known Traps: 6/6 constraints]
After SMT, in 8161ms problems are : Problem set: 2 solved, 14 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 16 out of 178 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 178/178 places, 492/492 transitions.
Graph (complete) has 770 edges and 178 vertex of which 177 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 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 177 transition count 490
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 13 place count 167 transition count 340
Iterating global reduction 1 with 10 rules applied. Total rules applied 23 place count 167 transition count 340
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 33 place count 157 transition count 330
Iterating global reduction 1 with 10 rules applied. Total rules applied 43 place count 157 transition count 330
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 48 place count 157 transition count 325
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 52 place count 153 transition count 317
Iterating global reduction 2 with 4 rules applied. Total rules applied 56 place count 153 transition count 317
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 58 place count 153 transition count 315
Applied a total of 58 rules in 129 ms. Remains 153 /178 variables (removed 25) and now considering 315/492 (removed 177) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 129 ms. Remains : 153/178 places, 315/492 transitions.
RANDOM walk for 40000 steps (8923 resets) in 862 ms. (46 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (1911 resets) in 176 ms. (226 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (1885 resets) in 178 ms. (223 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (4051 resets) in 223 ms. (178 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (1904 resets) in 150 ms. (264 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (1849 resets) in 229 ms. (173 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (1892 resets) in 140 ms. (283 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40000 steps (4163 resets) in 204 ms. (195 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (1909 resets) in 184 ms. (216 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (4128 resets) in 234 ms. (170 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40001 steps (1844 resets) in 172 ms. (231 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (1869 resets) in 152 ms. (261 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (1873 resets) in 172 ms. (231 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (1961 resets) in 116 ms. (341 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (4141 resets) in 227 ms. (175 steps per ms) remains 14/14 properties
Interrupted probabilistic random walk after 263112 steps, run timeout after 3001 ms. (steps per millisecond=87 ) properties seen :2 out of 14
Probabilistic random walk after 263112 steps, saw 115939 distinct states, run finished after 3001 ms. (steps per millisecond=87 ) properties seen :2
// Phase 1: matrix 315 rows 153 cols
[2024-05-28 21:48:33] [INFO ] Computed 3 invariants in 4 ms
[2024-05-28 21:48:33] [INFO ] State equation strengthened by 199 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 74/88 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 4/92 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 263/355 variables, 92/95 constraints. Problems are: Problem set: 0 solved, 12 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/355 variables, 147/242 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/355 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (OVERLAPS) 113/468 variables, 61/303 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/468 variables, 52/355 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/468 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 11 (OVERLAPS) 0/468 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 468/468 variables, and 355 constraints, problems are : Problem set: 0 solved, 12 unsolved in 1708 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 153/153 constraints, ReadFeed: 199/199 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 74/88 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 4/92 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-05-28 21:48:35] [INFO ] Deduced a trap composed of 50 places in 46 ms of which 2 ms to minimize.
[2024-05-28 21:48:35] [INFO ] Deduced a trap composed of 51 places in 50 ms of which 4 ms to minimize.
[2024-05-28 21:48:36] [INFO ] Deduced a trap composed of 46 places in 97 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/92 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (OVERLAPS) 263/355 variables, 92/98 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/355 variables, 147/245 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/355 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (OVERLAPS) 113/468 variables, 61/306 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/468 variables, 52/358 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/468 variables, 12/370 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-05-28 21:48:37] [INFO ] Deduced a trap composed of 22 places in 28 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/468 variables, 1/371 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/468 variables, 0/371 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 14 (OVERLAPS) 0/468 variables, 0/371 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 468/468 variables, and 371 constraints, problems are : Problem set: 0 solved, 12 unsolved in 4466 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 153/153 constraints, ReadFeed: 199/199 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 4/4 constraints]
After SMT, in 6233ms problems are : Problem set: 0 solved, 12 unsolved
Parikh walk visited 0 properties in 35153 ms.
Support contains 14 out of 153 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 153/153 places, 315/315 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 151 transition count 285
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 151 transition count 285
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 149 transition count 283
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 149 transition count 283
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 9 place count 149 transition count 282
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 11 place count 147 transition count 278
Iterating global reduction 1 with 2 rules applied. Total rules applied 13 place count 147 transition count 278
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 14 place count 147 transition count 277
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 15 place count 146 transition count 276
Iterating global reduction 2 with 1 rules applied. Total rules applied 16 place count 146 transition count 276
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 17 place count 145 transition count 275
Iterating global reduction 2 with 1 rules applied. Total rules applied 18 place count 145 transition count 275
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 19 place count 144 transition count 274
Iterating global reduction 2 with 1 rules applied. Total rules applied 20 place count 144 transition count 274
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 28 place count 144 transition count 266
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 29 place count 143 transition count 265
Iterating global reduction 3 with 1 rules applied. Total rules applied 30 place count 143 transition count 265
Applied a total of 30 rules in 55 ms. Remains 143 /153 variables (removed 10) and now considering 265/315 (removed 50) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55 ms. Remains : 143/153 places, 265/315 transitions.
RANDOM walk for 40000 steps (8974 resets) in 294 ms. (135 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (1916 resets) in 139 ms. (285 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (1839 resets) in 165 ms. (240 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (4225 resets) in 119 ms. (333 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (1909 resets) in 113 ms. (350 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (1879 resets) in 122 ms. (325 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (4158 resets) in 164 ms. (242 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (1903 resets) in 115 ms. (344 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (4161 resets) in 162 ms. (245 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (1866 resets) in 117 ms. (339 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (1853 resets) in 120 ms. (330 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40001 steps (1905 resets) in 118 ms. (336 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40000 steps (4078 resets) in 157 ms. (253 steps per ms) remains 12/12 properties
Interrupted probabilistic random walk after 231225 steps, run timeout after 3001 ms. (steps per millisecond=77 ) properties seen :0 out of 12
Probabilistic random walk after 231225 steps, saw 99784 distinct states, run finished after 3001 ms. (steps per millisecond=77 ) properties seen :0
// Phase 1: matrix 265 rows 143 cols
[2024-05-28 21:49:19] [INFO ] Computed 3 invariants in 3 ms
[2024-05-28 21:49:19] [INFO ] State equation strengthened by 158 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 71/85 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 4/89 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 245/334 variables, 89/92 constraints. Problems are: Problem set: 0 solved, 12 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/334 variables, 138/230 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/334 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (OVERLAPS) 74/408 variables, 54/284 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/408 variables, 20/304 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/408 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 11 (OVERLAPS) 0/408 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 408/408 variables, and 304 constraints, problems are : Problem set: 0 solved, 12 unsolved in 1157 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 143/143 constraints, ReadFeed: 158/158 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 71/85 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 4/89 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 245/334 variables, 89/92 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/334 variables, 138/230 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/334 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (OVERLAPS) 74/408 variables, 54/284 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/408 variables, 20/304 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/408 variables, 12/316 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-05-28 21:49:21] [INFO ] Deduced a trap composed of 22 places in 52 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/408 variables, 1/317 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/408 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 13 (OVERLAPS) 0/408 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 408/408 variables, and 317 constraints, problems are : Problem set: 0 solved, 12 unsolved in 4369 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 143/143 constraints, ReadFeed: 158/158 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 1/1 constraints]
After SMT, in 5564ms problems are : Problem set: 0 solved, 12 unsolved
Parikh walk visited 0 properties in 34840 ms.
Support contains 14 out of 143 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 265/265 transitions.
Applied a total of 0 rules in 15 ms. Remains 143 /143 variables (removed 0) and now considering 265/265 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 143/143 places, 265/265 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 265/265 transitions.
Applied a total of 0 rules in 14 ms. Remains 143 /143 variables (removed 0) and now considering 265/265 (removed 0) transitions.
[2024-05-28 21:49:59] [INFO ] Invariant cache hit.
[2024-05-28 21:49:59] [INFO ] Implicit Places using invariants in 145 ms returned []
[2024-05-28 21:49:59] [INFO ] Invariant cache hit.
[2024-05-28 21:49:59] [INFO ] State equation strengthened by 158 read => feed constraints.
[2024-05-28 21:50:00] [INFO ] Implicit Places using invariants and state equation in 746 ms returned []
Implicit Place search using SMT with State Equation took 893 ms to find 0 implicit places.
[2024-05-28 21:50:00] [INFO ] Redundant transitions in 14 ms returned []
Running 264 sub problems to find dead transitions.
[2024-05-28 21:50:00] [INFO ] Invariant cache hit.
[2024-05-28 21:50:00] [INFO ] State equation strengthened by 158 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/142 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/142 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 2 (OVERLAPS) 1/143 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/143 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 264 unsolved
Problem TDEAD54 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD241 is UNSAT
At refinement iteration 4 (OVERLAPS) 265/408 variables, 143/146 constraints. Problems are: Problem set: 3 solved, 261 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/408 variables, 158/304 constraints. Problems are: Problem set: 3 solved, 261 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/408 variables, 0/304 constraints. Problems are: Problem set: 3 solved, 261 unsolved
At refinement iteration 7 (OVERLAPS) 0/408 variables, 0/304 constraints. Problems are: Problem set: 3 solved, 261 unsolved
No progress, stopping.
After SMT solving in domain Real declared 408/408 variables, and 304 constraints, problems are : Problem set: 3 solved, 261 unsolved in 19223 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 143/143 constraints, ReadFeed: 158/158 constraints, PredecessorRefiner: 264/264 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 261 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/139 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 261 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/139 variables, 0/1 constraints. Problems are: Problem set: 3 solved, 261 unsolved
At refinement iteration 2 (OVERLAPS) 1/140 variables, 2/3 constraints. Problems are: Problem set: 3 solved, 261 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/140 variables, 0/3 constraints. Problems are: Problem set: 3 solved, 261 unsolved
At refinement iteration 4 (OVERLAPS) 264/404 variables, 140/143 constraints. Problems are: Problem set: 3 solved, 261 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/404 variables, 157/300 constraints. Problems are: Problem set: 3 solved, 261 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/404 variables, 23/323 constraints. Problems are: Problem set: 3 solved, 261 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/404 variables, 0/323 constraints. Problems are: Problem set: 3 solved, 261 unsolved
At refinement iteration 8 (OVERLAPS) 4/408 variables, 3/326 constraints. Problems are: Problem set: 3 solved, 261 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/408 variables, 1/327 constraints. Problems are: Problem set: 3 solved, 261 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/408 variables, 238/565 constraints. Problems are: Problem set: 3 solved, 261 unsolved
[2024-05-28 21:50:45] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 1 ms to minimize.
[2024-05-28 21:50:46] [INFO ] Deduced a trap composed of 51 places in 42 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 408/408 variables, and 567 constraints, problems are : Problem set: 3 solved, 261 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 143/143 constraints, ReadFeed: 158/158 constraints, PredecessorRefiner: 261/264 constraints, Known Traps: 2/2 constraints]
After SMT, in 49854ms problems are : Problem set: 3 solved, 261 unsolved
Search for dead transitions found 3 dead transitions in 49857ms
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 : 143/143 places, 262/265 transitions.
Graph (complete) has 495 edges and 143 vertex of which 140 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 12 ms. Remains 140 /143 variables (removed 3) and now considering 262/262 (removed 0) transitions.
// Phase 1: matrix 262 rows 140 cols
[2024-05-28 21:50:50] [INFO ] Computed 3 invariants in 1 ms
[2024-05-28 21:50:50] [INFO ] Implicit Places using invariants in 144 ms returned []
[2024-05-28 21:50:50] [INFO ] Invariant cache hit.
[2024-05-28 21:50:50] [INFO ] State equation strengthened by 157 read => feed constraints.
[2024-05-28 21:50:51] [INFO ] Implicit Places using invariants and state equation in 671 ms returned []
Implicit Place search using SMT with State Equation took 818 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 140/143 places, 262/265 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 51619 ms. Remains : 140/143 places, 262/265 transitions.
Successfully simplified 2 atomic propositions for a total of 14 simplifications.
FORMULA SieveSingleMsgMbox-PT-d2m96-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 33 stabilizing places and 60 stable transitions
Graph (complete) has 832 edges and 178 vertex of which 177 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.11 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((G(F(p0)) U !p1)))'
Support contains 3 out of 178 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 178/178 places, 492/492 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 156 transition count 231
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 156 transition count 231
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 66 place count 134 transition count 209
Iterating global reduction 0 with 22 rules applied. Total rules applied 88 place count 134 transition count 209
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 104 place count 134 transition count 193
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 115 place count 123 transition count 172
Iterating global reduction 1 with 11 rules applied. Total rules applied 126 place count 123 transition count 172
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 132 place count 123 transition count 166
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 136 place count 119 transition count 162
Iterating global reduction 2 with 4 rules applied. Total rules applied 140 place count 119 transition count 162
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 144 place count 115 transition count 158
Iterating global reduction 2 with 4 rules applied. Total rules applied 148 place count 115 transition count 158
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 151 place count 112 transition count 155
Iterating global reduction 2 with 3 rules applied. Total rules applied 154 place count 112 transition count 155
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 157 place count 112 transition count 152
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 160 place count 109 transition count 149
Iterating global reduction 3 with 3 rules applied. Total rules applied 163 place count 109 transition count 149
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 164 place count 108 transition count 146
Iterating global reduction 3 with 1 rules applied. Total rules applied 165 place count 108 transition count 146
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 166 place count 107 transition count 145
Iterating global reduction 3 with 1 rules applied. Total rules applied 167 place count 107 transition count 145
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 168 place count 106 transition count 144
Iterating global reduction 3 with 1 rules applied. Total rules applied 169 place count 106 transition count 144
Applied a total of 169 rules in 46 ms. Remains 106 /178 variables (removed 72) and now considering 144/492 (removed 348) transitions.
// Phase 1: matrix 144 rows 106 cols
[2024-05-28 21:50:51] [INFO ] Computed 4 invariants in 1 ms
[2024-05-28 21:50:51] [INFO ] Implicit Places using invariants in 96 ms returned []
[2024-05-28 21:50:51] [INFO ] Invariant cache hit.
[2024-05-28 21:50:51] [INFO ] State equation strengthened by 69 read => feed constraints.
[2024-05-28 21:50:51] [INFO ] Implicit Places using invariants and state equation in 309 ms returned []
Implicit Place search using SMT with State Equation took 408 ms to find 0 implicit places.
[2024-05-28 21:50:51] [INFO ] Redundant transitions in 2 ms returned []
Running 143 sub problems to find dead transitions.
[2024-05-28 21:50:51] [INFO ] Invariant cache hit.
[2024-05-28 21:50:51] [INFO ] State equation strengthened by 69 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 2 (OVERLAPS) 1/106 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/106 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 143 unsolved
[2024-05-28 21:50:53] [INFO ] Deduced a trap composed of 31 places in 45 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/106 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/106 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 143 unsolved
Problem TDEAD34 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD128 is UNSAT
At refinement iteration 6 (OVERLAPS) 144/250 variables, 106/111 constraints. Problems are: Problem set: 3 solved, 140 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/250 variables, 69/180 constraints. Problems are: Problem set: 3 solved, 140 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/250 variables, 0/180 constraints. Problems are: Problem set: 3 solved, 140 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/250 variables, 0/180 constraints. Problems are: Problem set: 3 solved, 140 unsolved
No progress, stopping.
After SMT solving in domain Real declared 250/250 variables, and 180 constraints, problems are : Problem set: 3 solved, 140 unsolved in 7100 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 106/106 constraints, ReadFeed: 69/69 constraints, PredecessorRefiner: 143/143 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 3 solved, 140 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 140 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 0/1 constraints. Problems are: Problem set: 3 solved, 140 unsolved
At refinement iteration 2 (OVERLAPS) 1/103 variables, 1/2 constraints. Problems are: Problem set: 3 solved, 140 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 1/3 constraints. Problems are: Problem set: 3 solved, 140 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 0/3 constraints. Problems are: Problem set: 3 solved, 140 unsolved
At refinement iteration 5 (OVERLAPS) 1/104 variables, 1/4 constraints. Problems are: Problem set: 3 solved, 140 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/104 variables, 1/5 constraints. Problems are: Problem set: 3 solved, 140 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/104 variables, 0/5 constraints. Problems are: Problem set: 3 solved, 140 unsolved
At refinement iteration 8 (OVERLAPS) 143/247 variables, 104/109 constraints. Problems are: Problem set: 3 solved, 140 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/247 variables, 68/177 constraints. Problems are: Problem set: 3 solved, 140 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/247 variables, 27/204 constraints. Problems are: Problem set: 3 solved, 140 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/247 variables, 0/204 constraints. Problems are: Problem set: 3 solved, 140 unsolved
At refinement iteration 12 (OVERLAPS) 3/250 variables, 2/206 constraints. Problems are: Problem set: 3 solved, 140 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/250 variables, 1/207 constraints. Problems are: Problem set: 3 solved, 140 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/250 variables, 113/320 constraints. Problems are: Problem set: 3 solved, 140 unsolved
[2024-05-28 21:51:05] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 1 ms to minimize.
Problem TDEAD131 is UNSAT
At refinement iteration 15 (INCLUDED_ONLY) 0/250 variables, 1/321 constraints. Problems are: Problem set: 4 solved, 139 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/250 variables, 0/321 constraints. Problems are: Problem set: 4 solved, 139 unsolved
At refinement iteration 17 (OVERLAPS) 0/250 variables, 0/321 constraints. Problems are: Problem set: 4 solved, 139 unsolved
No progress, stopping.
After SMT solving in domain Int declared 250/250 variables, and 321 constraints, problems are : Problem set: 4 solved, 139 unsolved in 15817 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 106/106 constraints, ReadFeed: 69/69 constraints, PredecessorRefiner: 140/143 constraints, Known Traps: 2/2 constraints]
After SMT, in 23092ms problems are : Problem set: 4 solved, 139 unsolved
Search for dead transitions found 4 dead transitions in 23094ms
Found 4 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 4 transitions
Dead transitions reduction (with SMT) removed 4 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 106/178 places, 140/492 transitions.
Graph (complete) has 349 edges and 106 vertex of which 102 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 7 ms. Remains 102 /106 variables (removed 4) and now considering 140/140 (removed 0) transitions.
// Phase 1: matrix 140 rows 102 cols
[2024-05-28 21:51:14] [INFO ] Computed 4 invariants in 2 ms
[2024-05-28 21:51:15] [INFO ] Implicit Places using invariants in 114 ms returned []
[2024-05-28 21:51:15] [INFO ] Invariant cache hit.
[2024-05-28 21:51:15] [INFO ] State equation strengthened by 68 read => feed constraints.
[2024-05-28 21:51:15] [INFO ] Implicit Places using invariants and state equation in 324 ms returned []
Implicit Place search using SMT with State Equation took 442 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 102/178 places, 140/492 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 24008 ms. Remains : 102/178 places, 140/492 transitions.
Stuttering acceptance computed with spot in 352 ms :[p1, (NOT p0), (NOT p0), p1]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m96-LTLFireability-00
Product exploration explored 100000 steps with 22413 reset in 448 ms.
Product exploration explored 100000 steps with 22416 reset in 354 ms.
Computed a total of 17 stabilizing places and 23 stable transitions
Graph (complete) has 345 edges and 102 vertex of which 101 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 17 stabilizing places and 23 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (NOT p1)), (X (X (NOT p0))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 114 ms. Reduced automaton from 4 states, 10 edges and 2 AP (stutter insensitive) to 4 states, 10 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 162 ms :[p1, (NOT p0), (NOT p0), p1]
RANDOM walk for 40000 steps (9007 resets) in 328 ms. (121 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (1909 resets) in 389 ms. (102 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (1881 resets) in 191 ms. (208 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (1871 resets) in 293 ms. (136 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 1936985 steps, run timeout after 3001 ms. (steps per millisecond=645 ) properties seen :2 out of 3
Probabilistic random walk after 1936985 steps, saw 825686 distinct states, run finished after 3001 ms. (steps per millisecond=645 ) properties seen :2
[2024-05-28 21:51:20] [INFO ] Invariant cache hit.
[2024-05-28 21:51:20] [INFO ] State equation strengthened by 68 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) 58/60 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 11/71 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/71 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 4/75 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/75 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 111/186 variables, 75/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/186 variables, 39/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/186 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 56/242 variables, 27/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/242 variables, 29/174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/242 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/242 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 242/242 variables, and 174 constraints, problems are : Problem set: 0 solved, 1 unsolved in 137 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 102/102 constraints, ReadFeed: 68/68 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) 58/60 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 11/71 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/71 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 4/75 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/75 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 111/186 variables, 75/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/186 variables, 39/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/186 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 56/242 variables, 27/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/242 variables, 29/174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/242 variables, 1/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/242 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/242 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 242/242 variables, and 175 constraints, problems are : Problem set: 0 solved, 1 unsolved in 281 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 102/102 constraints, ReadFeed: 68/68 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 443ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 30 ms.
Support contains 2 out of 102 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 102/102 places, 140/140 transitions.
Graph (complete) has 310 edges and 102 vertex of which 101 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 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 101 transition count 138
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 100 transition count 126
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 100 transition count 126
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 99 transition count 125
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 99 transition count 125
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 8 place count 99 transition count 124
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 9 place count 98 transition count 122
Iterating global reduction 2 with 1 rules applied. Total rules applied 10 place count 98 transition count 122
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 11 place count 98 transition count 121
Applied a total of 11 rules in 14 ms. Remains 98 /102 variables (removed 4) and now considering 121/140 (removed 19) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 98/102 places, 121/140 transitions.
RANDOM walk for 40000 steps (8930 resets) in 83 ms. (476 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (1901 resets) in 28 ms. (1379 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2339834 steps, run timeout after 3001 ms. (steps per millisecond=779 ) properties seen :0 out of 1
Probabilistic random walk after 2339834 steps, saw 1036284 distinct states, run finished after 3001 ms. (steps per millisecond=779 ) properties seen :0
// Phase 1: matrix 121 rows 98 cols
[2024-05-28 21:51:23] [INFO ] Computed 3 invariants in 1 ms
[2024-05-28 21:51:23] [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 131 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 225 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 365ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 291 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 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.
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-05-28 21:51:24] [INFO ] Invariant cache hit.
[2024-05-28 21:51:24] [INFO ] Implicit Places using invariants in 102 ms returned []
[2024-05-28 21:51:24] [INFO ] Invariant cache hit.
[2024-05-28 21:51:24] [INFO ] State equation strengthened by 53 read => feed constraints.
[2024-05-28 21:51:24] [INFO ] Implicit Places using invariants and state equation in 302 ms returned []
Implicit Place search using SMT with State Equation took 410 ms to find 0 implicit places.
[2024-05-28 21:51:24] [INFO ] Redundant transitions in 1 ms returned []
Running 120 sub problems to find dead transitions.
[2024-05-28 21:51:24] [INFO ] Invariant cache hit.
[2024-05-28 21:51:24] [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 3785 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 7774 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 11691ms problems are : Problem set: 0 solved, 120 unsolved
Search for dead transitions found 0 dead transitions in 11693ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12130 ms. Remains : 98/98 places, 121/121 transitions.
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 23 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-05-28 21:51:36] [INFO ] Computed 3 invariants in 1 ms
[2024-05-28 21:51:36] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-28 21:51:36] [INFO ] After 110ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-28 21:51:36] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-28 21:51:36] [INFO ] After 56ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-28 21:51:36] [INFO ] After 75ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-28 21:51:36] [INFO ] After 128ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 281 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (NOT p1)), (X (X (NOT p0))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR p0 (NOT p1)))), (F p1)]
Knowledge based reduction with 7 factoid took 164 ms. Reduced automaton from 4 states, 10 edges and 2 AP (stutter insensitive) to 4 states, 10 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 152 ms :[p1, (NOT p0), (NOT p0), p1]
Stuttering acceptance computed with spot in 154 ms :[p1, (NOT p0), (NOT p0), p1]
Support contains 3 out of 102 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 102/102 places, 140/140 transitions.
Applied a total of 0 rules in 5 ms. Remains 102 /102 variables (removed 0) and now considering 140/140 (removed 0) transitions.
// Phase 1: matrix 140 rows 102 cols
[2024-05-28 21:51:37] [INFO ] Computed 4 invariants in 2 ms
[2024-05-28 21:51:37] [INFO ] Implicit Places using invariants in 158 ms returned []
[2024-05-28 21:51:37] [INFO ] Invariant cache hit.
[2024-05-28 21:51:37] [INFO ] State equation strengthened by 68 read => feed constraints.
[2024-05-28 21:51:37] [INFO ] Implicit Places using invariants and state equation in 332 ms returned []
Implicit Place search using SMT with State Equation took 492 ms to find 0 implicit places.
[2024-05-28 21:51:37] [INFO ] Redundant transitions in 1 ms returned []
Running 139 sub problems to find dead transitions.
[2024-05-28 21:51:37] [INFO ] Invariant cache hit.
[2024-05-28 21:51:37] [INFO ] State equation strengthened by 68 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 3 (OVERLAPS) 1/102 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 5 (OVERLAPS) 140/242 variables, 102/106 constraints. Problems are: Problem set: 0 solved, 139 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/242 variables, 68/174 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/242 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 8 (OVERLAPS) 0/242 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 139 unsolved
No progress, stopping.
After SMT solving in domain Real declared 242/242 variables, and 174 constraints, problems are : Problem set: 0 solved, 139 unsolved in 4703 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 102/102 constraints, ReadFeed: 68/68 constraints, PredecessorRefiner: 139/139 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 139 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 3 (OVERLAPS) 1/102 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 5 (OVERLAPS) 140/242 variables, 102/106 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/242 variables, 68/174 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/242 variables, 139/313 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/242 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 9 (OVERLAPS) 0/242 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 139 unsolved
No progress, stopping.
After SMT solving in domain Int declared 242/242 variables, and 313 constraints, problems are : Problem set: 0 solved, 139 unsolved in 9270 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 102/102 constraints, ReadFeed: 68/68 constraints, PredecessorRefiner: 139/139 constraints, Known Traps: 0/0 constraints]
After SMT, in 14177ms problems are : Problem set: 0 solved, 139 unsolved
Search for dead transitions found 0 dead transitions in 14186ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 14694 ms. Remains : 102/102 places, 140/140 transitions.
Computed a total of 17 stabilizing places and 23 stable transitions
Graph (complete) has 345 edges and 102 vertex of which 101 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Computed a total of 17 stabilizing places and 23 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (NOT (AND (NOT p0) p1))), (X (NOT p1)), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 105 ms. Reduced automaton from 4 states, 10 edges and 2 AP (stutter insensitive) to 4 states, 10 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 152 ms :[p1, (NOT p0), (NOT p0), p1]
RANDOM walk for 40000 steps (8906 resets) in 219 ms. (181 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (1880 resets) in 108 ms. (366 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (1908 resets) in 47 ms. (833 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (1960 resets) in 54 ms. (727 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 1912188 steps, run timeout after 3001 ms. (steps per millisecond=637 ) properties seen :2 out of 3
Probabilistic random walk after 1912188 steps, saw 815368 distinct states, run finished after 3001 ms. (steps per millisecond=637 ) properties seen :2
[2024-05-28 21:51:55] [INFO ] Invariant cache hit.
[2024-05-28 21:51:55] [INFO ] State equation strengthened by 68 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) 58/60 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 11/71 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/71 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 4/75 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/75 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 111/186 variables, 75/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/186 variables, 39/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/186 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 56/242 variables, 27/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/242 variables, 29/174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/242 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/242 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 242/242 variables, and 174 constraints, problems are : Problem set: 0 solved, 1 unsolved in 162 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 102/102 constraints, ReadFeed: 68/68 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) 58/60 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 11/71 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/71 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 4/75 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/75 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 111/186 variables, 75/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/186 variables, 39/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/186 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 56/242 variables, 27/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/242 variables, 29/174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/242 variables, 1/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/242 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/242 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 242/242 variables, and 175 constraints, problems are : Problem set: 0 solved, 1 unsolved in 261 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 102/102 constraints, ReadFeed: 68/68 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 432ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 31 ms.
Support contains 2 out of 102 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 102/102 places, 140/140 transitions.
Graph (complete) has 310 edges and 102 vertex of which 101 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 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 101 transition count 138
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 100 transition count 126
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 100 transition count 126
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 99 transition count 125
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 99 transition count 125
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 8 place count 99 transition count 124
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 9 place count 98 transition count 122
Iterating global reduction 2 with 1 rules applied. Total rules applied 10 place count 98 transition count 122
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 11 place count 98 transition count 121
Applied a total of 11 rules in 14 ms. Remains 98 /102 variables (removed 4) and now considering 121/140 (removed 19) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 98/102 places, 121/140 transitions.
RANDOM walk for 40000 steps (8977 resets) in 78 ms. (506 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (1884 resets) in 30 ms. (1290 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2205422 steps, run timeout after 3001 ms. (steps per millisecond=734 ) properties seen :0 out of 1
Probabilistic random walk after 2205422 steps, saw 978432 distinct states, run finished after 3002 ms. (steps per millisecond=734 ) properties seen :0
// Phase 1: matrix 121 rows 98 cols
[2024-05-28 21:51:59] [INFO ] Computed 3 invariants in 1 ms
[2024-05-28 21:51:59] [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 128 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 217 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 366ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 299 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 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.
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-05-28 21:51:59] [INFO ] Invariant cache hit.
[2024-05-28 21:51:59] [INFO ] Implicit Places using invariants in 98 ms returned []
[2024-05-28 21:51:59] [INFO ] Invariant cache hit.
[2024-05-28 21:51:59] [INFO ] State equation strengthened by 53 read => feed constraints.
[2024-05-28 21:52:00] [INFO ] Implicit Places using invariants and state equation in 291 ms returned []
Implicit Place search using SMT with State Equation took 395 ms to find 0 implicit places.
[2024-05-28 21:52:00] [INFO ] Redundant transitions in 0 ms returned []
Running 120 sub problems to find dead transitions.
[2024-05-28 21:52:00] [INFO ] Invariant cache hit.
[2024-05-28 21:52:00] [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 3674 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 7558 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 11357ms problems are : Problem set: 0 solved, 120 unsolved
Search for dead transitions found 0 dead transitions in 11358ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11770 ms. Remains : 98/98 places, 121/121 transitions.
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 12 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-05-28 21:52:11] [INFO ] Computed 3 invariants in 1 ms
[2024-05-28 21:52:11] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-28 21:52:11] [INFO ] After 117ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-28 21:52:11] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-28 21:52:11] [INFO ] After 53ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-28 21:52:11] [INFO ] After 72ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-28 21:52:11] [INFO ] After 139ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 280 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (NOT (AND (NOT p0) p1))), (X (NOT p1)), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR p0 (NOT p1)))), (F p1)]
Knowledge based reduction with 7 factoid took 169 ms. Reduced automaton from 4 states, 10 edges and 2 AP (stutter insensitive) to 4 states, 10 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 157 ms :[p1, (NOT p0), (NOT p0), p1]
Stuttering acceptance computed with spot in 155 ms :[p1, (NOT p0), (NOT p0), p1]
Stuttering acceptance computed with spot in 154 ms :[p1, (NOT p0), (NOT p0), p1]
Product exploration explored 100000 steps with 22399 reset in 206 ms.
Product exploration explored 100000 steps with 22460 reset in 221 ms.
Support contains 3 out of 102 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 102/102 places, 140/140 transitions.
Applied a total of 0 rules in 5 ms. Remains 102 /102 variables (removed 0) and now considering 140/140 (removed 0) transitions.
// Phase 1: matrix 140 rows 102 cols
[2024-05-28 21:52:12] [INFO ] Computed 4 invariants in 1 ms
[2024-05-28 21:52:12] [INFO ] Implicit Places using invariants in 103 ms returned []
[2024-05-28 21:52:12] [INFO ] Invariant cache hit.
[2024-05-28 21:52:13] [INFO ] State equation strengthened by 68 read => feed constraints.
[2024-05-28 21:52:13] [INFO ] Implicit Places using invariants and state equation in 313 ms returned []
Implicit Place search using SMT with State Equation took 419 ms to find 0 implicit places.
[2024-05-28 21:52:13] [INFO ] Redundant transitions in 1 ms returned []
Running 139 sub problems to find dead transitions.
[2024-05-28 21:52:13] [INFO ] Invariant cache hit.
[2024-05-28 21:52:13] [INFO ] State equation strengthened by 68 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 3 (OVERLAPS) 1/102 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 5 (OVERLAPS) 140/242 variables, 102/106 constraints. Problems are: Problem set: 0 solved, 139 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/242 variables, 68/174 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/242 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 8 (OVERLAPS) 0/242 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 139 unsolved
No progress, stopping.
After SMT solving in domain Real declared 242/242 variables, and 174 constraints, problems are : Problem set: 0 solved, 139 unsolved in 4621 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 102/102 constraints, ReadFeed: 68/68 constraints, PredecessorRefiner: 139/139 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 139 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 3 (OVERLAPS) 1/102 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 5 (OVERLAPS) 140/242 variables, 102/106 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/242 variables, 68/174 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/242 variables, 139/313 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/242 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 9 (OVERLAPS) 0/242 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 139 unsolved
No progress, stopping.
After SMT solving in domain Int declared 242/242 variables, and 313 constraints, problems are : Problem set: 0 solved, 139 unsolved in 9047 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 102/102 constraints, ReadFeed: 68/68 constraints, PredecessorRefiner: 139/139 constraints, Known Traps: 0/0 constraints]
After SMT, in 13827ms problems are : Problem set: 0 solved, 139 unsolved
Search for dead transitions found 0 dead transitions in 13829ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 14261 ms. Remains : 102/102 places, 140/140 transitions.
Treatment of property SieveSingleMsgMbox-PT-d2m96-LTLFireability-00 finished in 95865 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F((!p0&&(!p1||G(p2)))) U !p2)))'
Support contains 4 out of 178 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 178/178 places, 492/492 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 157 transition count 246
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 157 transition count 246
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 63 place count 136 transition count 225
Iterating global reduction 0 with 21 rules applied. Total rules applied 84 place count 136 transition count 225
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 0 with 19 rules applied. Total rules applied 103 place count 136 transition count 206
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 114 place count 125 transition count 185
Iterating global reduction 1 with 11 rules applied. Total rules applied 125 place count 125 transition count 185
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 131 place count 125 transition count 179
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 135 place count 121 transition count 175
Iterating global reduction 2 with 4 rules applied. Total rules applied 139 place count 121 transition count 175
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 143 place count 117 transition count 171
Iterating global reduction 2 with 4 rules applied. Total rules applied 147 place count 117 transition count 171
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 150 place count 114 transition count 168
Iterating global reduction 2 with 3 rules applied. Total rules applied 153 place count 114 transition count 168
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 157 place count 114 transition count 164
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 160 place count 111 transition count 161
Iterating global reduction 3 with 3 rules applied. Total rules applied 163 place count 111 transition count 161
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 164 place count 110 transition count 158
Iterating global reduction 3 with 1 rules applied. Total rules applied 165 place count 110 transition count 158
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 166 place count 109 transition count 157
Iterating global reduction 3 with 1 rules applied. Total rules applied 167 place count 109 transition count 157
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 168 place count 108 transition count 156
Iterating global reduction 3 with 1 rules applied. Total rules applied 169 place count 108 transition count 156
Applied a total of 169 rules in 17 ms. Remains 108 /178 variables (removed 70) and now considering 156/492 (removed 336) transitions.
// Phase 1: matrix 156 rows 108 cols
[2024-05-28 21:52:27] [INFO ] Computed 4 invariants in 1 ms
[2024-05-28 21:52:27] [INFO ] Implicit Places using invariants in 104 ms returned []
[2024-05-28 21:52:27] [INFO ] Invariant cache hit.
[2024-05-28 21:52:27] [INFO ] State equation strengthened by 81 read => feed constraints.
[2024-05-28 21:52:27] [INFO ] Implicit Places using invariants and state equation in 430 ms returned []
Implicit Place search using SMT with State Equation took 540 ms to find 0 implicit places.
Running 155 sub problems to find dead transitions.
[2024-05-28 21:52:27] [INFO ] Invariant cache hit.
[2024-05-28 21:52:27] [INFO ] State equation strengthened by 81 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/107 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 2 (OVERLAPS) 1/108 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 155 unsolved
[2024-05-28 21:52:29] [INFO ] Deduced a trap composed of 32 places in 42 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/108 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/108 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 155 unsolved
Problem TDEAD34 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD139 is UNSAT
At refinement iteration 6 (OVERLAPS) 156/264 variables, 108/113 constraints. Problems are: Problem set: 3 solved, 152 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/264 variables, 81/194 constraints. Problems are: Problem set: 3 solved, 152 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/264 variables, 0/194 constraints. Problems are: Problem set: 3 solved, 152 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/264 variables, 0/194 constraints. Problems are: Problem set: 3 solved, 152 unsolved
No progress, stopping.
After SMT solving in domain Real declared 264/264 variables, and 194 constraints, problems are : Problem set: 3 solved, 152 unsolved in 7538 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 108/108 constraints, ReadFeed: 81/81 constraints, PredecessorRefiner: 155/155 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 3 solved, 152 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 152 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 0/1 constraints. Problems are: Problem set: 3 solved, 152 unsolved
At refinement iteration 2 (OVERLAPS) 1/105 variables, 1/2 constraints. Problems are: Problem set: 3 solved, 152 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 1/3 constraints. Problems are: Problem set: 3 solved, 152 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 0/3 constraints. Problems are: Problem set: 3 solved, 152 unsolved
At refinement iteration 5 (OVERLAPS) 1/106 variables, 1/4 constraints. Problems are: Problem set: 3 solved, 152 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/106 variables, 1/5 constraints. Problems are: Problem set: 3 solved, 152 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/106 variables, 0/5 constraints. Problems are: Problem set: 3 solved, 152 unsolved
At refinement iteration 8 (OVERLAPS) 155/261 variables, 106/111 constraints. Problems are: Problem set: 3 solved, 152 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/261 variables, 80/191 constraints. Problems are: Problem set: 3 solved, 152 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/261 variables, 28/219 constraints. Problems are: Problem set: 3 solved, 152 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/261 variables, 0/219 constraints. Problems are: Problem set: 3 solved, 152 unsolved
At refinement iteration 12 (OVERLAPS) 3/264 variables, 2/221 constraints. Problems are: Problem set: 3 solved, 152 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/264 variables, 1/222 constraints. Problems are: Problem set: 3 solved, 152 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/264 variables, 124/346 constraints. Problems are: Problem set: 3 solved, 152 unsolved
[2024-05-28 21:52:45] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 3 ms to minimize.
Problem TDEAD142 is UNSAT
At refinement iteration 15 (INCLUDED_ONLY) 0/264 variables, 1/347 constraints. Problems are: Problem set: 4 solved, 151 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/264 variables, 0/347 constraints. Problems are: Problem set: 4 solved, 151 unsolved
At refinement iteration 17 (OVERLAPS) 0/264 variables, 0/347 constraints. Problems are: Problem set: 4 solved, 151 unsolved
No progress, stopping.
After SMT solving in domain Int declared 264/264 variables, and 347 constraints, problems are : Problem set: 4 solved, 151 unsolved in 21013 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 108/108 constraints, ReadFeed: 81/81 constraints, PredecessorRefiner: 152/155 constraints, Known Traps: 2/2 constraints]
After SMT, in 28730ms problems are : Problem set: 4 solved, 151 unsolved
Search for dead transitions found 4 dead transitions in 28733ms
Found 4 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 4 transitions
Dead transitions reduction (with SMT) removed 4 transitions
Starting structural reductions in LTL mode, iteration 1 : 108/178 places, 152/492 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 104 transition count 152
Applied a total of 4 rules in 1 ms. Remains 104 /108 variables (removed 4) and now considering 152/152 (removed 0) transitions.
// Phase 1: matrix 152 rows 104 cols
[2024-05-28 21:52:56] [INFO ] Computed 4 invariants in 2 ms
[2024-05-28 21:52:56] [INFO ] Implicit Places using invariants in 107 ms returned []
[2024-05-28 21:52:56] [INFO ] Invariant cache hit.
[2024-05-28 21:52:56] [INFO ] State equation strengthened by 80 read => feed constraints.
[2024-05-28 21:52:56] [INFO ] Implicit Places using invariants and state equation in 395 ms returned []
Implicit Place search using SMT with State Equation took 505 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 104/178 places, 152/492 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 29803 ms. Remains : 104/178 places, 152/492 transitions.
Stuttering acceptance computed with spot in 187 ms :[p2, p2, (OR p0 (AND p1 (NOT p2))), (OR (AND p1 (NOT p2)) (AND p0 (NOT p2)))]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m96-LTLFireability-01
Product exploration explored 100000 steps with 50000 reset in 330 ms.
Product exploration explored 100000 steps with 50000 reset in 276 ms.
Computed a total of 17 stabilizing places and 24 stable transitions
Graph (complete) has 360 edges and 104 vertex of which 103 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 17 stabilizing places and 24 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT p2)), (X (NOT (AND p2 p0))), (X (NOT (AND p2 (NOT p0) p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND p2 p0)))), (X (X (NOT (OR (AND (NOT p2) p0) (AND (NOT p2) p1))))), (X (X (NOT (AND p2 (NOT p0) p1)))), (X (X (NOT (OR (AND (NOT p2) p1) p0)))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (NOT (OR (AND p2 p0) (AND p2 p1)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 14 factoid took 18 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA SieveSingleMsgMbox-PT-d2m96-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SieveSingleMsgMbox-PT-d2m96-LTLFireability-01 finished in 30640 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(G(p1))||p0)))'
Support contains 4 out of 178 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 178/178 places, 492/492 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 156 transition count 217
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 156 transition count 217
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 66 place count 134 transition count 195
Iterating global reduction 0 with 22 rules applied. Total rules applied 88 place count 134 transition count 195
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 0 with 13 rules applied. Total rules applied 101 place count 134 transition count 182
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 113 place count 122 transition count 159
Iterating global reduction 1 with 12 rules applied. Total rules applied 125 place count 122 transition count 159
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 132 place count 122 transition count 152
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 136 place count 118 transition count 148
Iterating global reduction 2 with 4 rules applied. Total rules applied 140 place count 118 transition count 148
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 144 place count 114 transition count 144
Iterating global reduction 2 with 4 rules applied. Total rules applied 148 place count 114 transition count 144
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 151 place count 111 transition count 141
Iterating global reduction 2 with 3 rules applied. Total rules applied 154 place count 111 transition count 141
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 156 place count 111 transition count 139
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 159 place count 108 transition count 136
Iterating global reduction 3 with 3 rules applied. Total rules applied 162 place count 108 transition count 136
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 163 place count 107 transition count 133
Iterating global reduction 3 with 1 rules applied. Total rules applied 164 place count 107 transition count 133
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 165 place count 106 transition count 132
Iterating global reduction 3 with 1 rules applied. Total rules applied 166 place count 106 transition count 132
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 167 place count 105 transition count 131
Iterating global reduction 3 with 1 rules applied. Total rules applied 168 place count 105 transition count 131
Applied a total of 168 rules in 11 ms. Remains 105 /178 variables (removed 73) and now considering 131/492 (removed 361) transitions.
// Phase 1: matrix 131 rows 105 cols
[2024-05-28 21:52:57] [INFO ] Computed 4 invariants in 1 ms
[2024-05-28 21:52:57] [INFO ] Implicit Places using invariants in 94 ms returned []
[2024-05-28 21:52:57] [INFO ] Invariant cache hit.
[2024-05-28 21:52:58] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-05-28 21:52:58] [INFO ] Implicit Places using invariants and state equation in 261 ms returned []
Implicit Place search using SMT with State Equation took 357 ms to find 0 implicit places.
Running 130 sub problems to find dead transitions.
[2024-05-28 21:52:58] [INFO ] Invariant cache hit.
[2024-05-28 21:52:58] [INFO ] State equation strengthened by 58 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 2 (OVERLAPS) 1/105 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 130 unsolved
[2024-05-28 21:52:59] [INFO ] Deduced a trap composed of 31 places in 46 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/105 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 130 unsolved
Problem TDEAD34 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD115 is UNSAT
At refinement iteration 6 (OVERLAPS) 131/236 variables, 105/110 constraints. Problems are: Problem set: 3 solved, 127 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/236 variables, 58/168 constraints. Problems are: Problem set: 3 solved, 127 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/236 variables, 0/168 constraints. Problems are: Problem set: 3 solved, 127 unsolved
[2024-05-28 21:53:01] [INFO ] Deduced a trap composed of 33 places in 59 ms of which 1 ms to minimize.
[2024-05-28 21:53:01] [INFO ] Deduced a trap composed of 31 places in 63 ms of which 1 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/236 variables, 2/170 constraints. Problems are: Problem set: 3 solved, 127 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/236 variables, 0/170 constraints. Problems are: Problem set: 3 solved, 127 unsolved
At refinement iteration 11 (OVERLAPS) 0/236 variables, 0/170 constraints. Problems are: Problem set: 3 solved, 127 unsolved
No progress, stopping.
After SMT solving in domain Real declared 236/236 variables, and 170 constraints, problems are : Problem set: 3 solved, 127 unsolved in 5774 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 105/105 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 130/130 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 3 solved, 127 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 127 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 0/1 constraints. Problems are: Problem set: 3 solved, 127 unsolved
At refinement iteration 2 (OVERLAPS) 1/102 variables, 1/2 constraints. Problems are: Problem set: 3 solved, 127 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/102 variables, 1/3 constraints. Problems are: Problem set: 3 solved, 127 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 0/3 constraints. Problems are: Problem set: 3 solved, 127 unsolved
At refinement iteration 5 (OVERLAPS) 1/103 variables, 1/4 constraints. Problems are: Problem set: 3 solved, 127 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/103 variables, 3/7 constraints. Problems are: Problem set: 3 solved, 127 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/103 variables, 0/7 constraints. Problems are: Problem set: 3 solved, 127 unsolved
At refinement iteration 8 (OVERLAPS) 130/233 variables, 103/110 constraints. Problems are: Problem set: 3 solved, 127 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/233 variables, 57/167 constraints. Problems are: Problem set: 3 solved, 127 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/233 variables, 27/194 constraints. Problems are: Problem set: 3 solved, 127 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/233 variables, 0/194 constraints. Problems are: Problem set: 3 solved, 127 unsolved
At refinement iteration 12 (OVERLAPS) 3/236 variables, 2/196 constraints. Problems are: Problem set: 3 solved, 127 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/236 variables, 1/197 constraints. Problems are: Problem set: 3 solved, 127 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/236 variables, 100/297 constraints. Problems are: Problem set: 3 solved, 127 unsolved
[2024-05-28 21:53:10] [INFO ] Deduced a trap composed of 23 places in 28 ms of which 1 ms to minimize.
Problem TDEAD118 is UNSAT
At refinement iteration 15 (INCLUDED_ONLY) 0/236 variables, 1/298 constraints. Problems are: Problem set: 4 solved, 126 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/236 variables, 0/298 constraints. Problems are: Problem set: 4 solved, 126 unsolved
At refinement iteration 17 (OVERLAPS) 0/236 variables, 0/298 constraints. Problems are: Problem set: 4 solved, 126 unsolved
No progress, stopping.
After SMT solving in domain Int declared 236/236 variables, and 298 constraints, problems are : Problem set: 4 solved, 126 unsolved in 14272 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 105/105 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 127/130 constraints, Known Traps: 4/4 constraints]
After SMT, in 20191ms problems are : Problem set: 4 solved, 126 unsolved
Search for dead transitions found 4 dead transitions in 20193ms
Found 4 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 4 transitions
Dead transitions reduction (with SMT) removed 4 transitions
Starting structural reductions in LTL mode, iteration 1 : 105/178 places, 127/492 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 101 transition count 127
Applied a total of 4 rules in 1 ms. Remains 101 /105 variables (removed 4) and now considering 127/127 (removed 0) transitions.
// Phase 1: matrix 127 rows 101 cols
[2024-05-28 21:53:18] [INFO ] Computed 4 invariants in 1 ms
[2024-05-28 21:53:18] [INFO ] Implicit Places using invariants in 92 ms returned []
[2024-05-28 21:53:18] [INFO ] Invariant cache hit.
[2024-05-28 21:53:18] [INFO ] State equation strengthened by 57 read => feed constraints.
[2024-05-28 21:53:18] [INFO ] Implicit Places using invariants and state equation in 312 ms returned []
Implicit Place search using SMT with State Equation took 405 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 101/178 places, 127/492 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 20969 ms. Remains : 101/178 places, 127/492 transitions.
Stuttering acceptance computed with spot in 127 ms :[true, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m96-LTLFireability-03
Product exploration explored 100000 steps with 50000 reset in 182 ms.
Product exploration explored 100000 steps with 50000 reset in 195 ms.
Computed a total of 17 stabilizing places and 22 stable transitions
Graph (complete) has 331 edges and 101 vertex of which 100 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 17 stabilizing places and 22 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 17 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA SieveSingleMsgMbox-PT-d2m96-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SieveSingleMsgMbox-PT-d2m96-LTLFireability-03 finished in 21511 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||(G(p2)&&p1))))'
Support contains 4 out of 178 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 178/178 places, 492/492 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 156 transition count 218
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 156 transition count 218
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 66 place count 134 transition count 196
Iterating global reduction 0 with 22 rules applied. Total rules applied 88 place count 134 transition count 196
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 0 with 15 rules applied. Total rules applied 103 place count 134 transition count 181
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 114 place count 123 transition count 159
Iterating global reduction 1 with 11 rules applied. Total rules applied 125 place count 123 transition count 159
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 131 place count 123 transition count 153
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 134 place count 120 transition count 150
Iterating global reduction 2 with 3 rules applied. Total rules applied 137 place count 120 transition count 150
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 140 place count 117 transition count 147
Iterating global reduction 2 with 3 rules applied. Total rules applied 143 place count 117 transition count 147
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 145 place count 115 transition count 145
Iterating global reduction 2 with 2 rules applied. Total rules applied 147 place count 115 transition count 145
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 149 place count 115 transition count 143
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 151 place count 113 transition count 141
Iterating global reduction 3 with 2 rules applied. Total rules applied 153 place count 113 transition count 141
Applied a total of 153 rules in 30 ms. Remains 113 /178 variables (removed 65) and now considering 141/492 (removed 351) transitions.
// Phase 1: matrix 141 rows 113 cols
[2024-05-28 21:53:19] [INFO ] Computed 4 invariants in 1 ms
[2024-05-28 21:53:19] [INFO ] Implicit Places using invariants in 115 ms returned []
[2024-05-28 21:53:19] [INFO ] Invariant cache hit.
[2024-05-28 21:53:19] [INFO ] State equation strengthened by 62 read => feed constraints.
[2024-05-28 21:53:19] [INFO ] Implicit Places using invariants and state equation in 359 ms returned []
Implicit Place search using SMT with State Equation took 477 ms to find 0 implicit places.
[2024-05-28 21:53:19] [INFO ] Redundant transitions in 0 ms returned []
Running 140 sub problems to find dead transitions.
[2024-05-28 21:53:19] [INFO ] Invariant cache hit.
[2024-05-28 21:53:19] [INFO ] State equation strengthened by 62 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 2 (OVERLAPS) 1/113 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/113 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 140 unsolved
[2024-05-28 21:53:21] [INFO ] Deduced a trap composed of 34 places in 42 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/113 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 140 unsolved
Problem TDEAD43 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD125 is UNSAT
At refinement iteration 6 (OVERLAPS) 141/254 variables, 113/118 constraints. Problems are: Problem set: 3 solved, 137 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/254 variables, 62/180 constraints. Problems are: Problem set: 3 solved, 137 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/254 variables, 0/180 constraints. Problems are: Problem set: 3 solved, 137 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/254 variables, 0/180 constraints. Problems are: Problem set: 3 solved, 137 unsolved
No progress, stopping.
After SMT solving in domain Real declared 254/254 variables, and 180 constraints, problems are : Problem set: 3 solved, 137 unsolved in 6966 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 113/113 constraints, ReadFeed: 62/62 constraints, PredecessorRefiner: 140/140 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 3 solved, 137 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/109 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 137 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/109 variables, 0/1 constraints. Problems are: Problem set: 3 solved, 137 unsolved
At refinement iteration 2 (OVERLAPS) 1/110 variables, 1/2 constraints. Problems are: Problem set: 3 solved, 137 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/110 variables, 1/3 constraints. Problems are: Problem set: 3 solved, 137 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/110 variables, 0/3 constraints. Problems are: Problem set: 3 solved, 137 unsolved
At refinement iteration 5 (OVERLAPS) 1/111 variables, 1/4 constraints. Problems are: Problem set: 3 solved, 137 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/111 variables, 1/5 constraints. Problems are: Problem set: 3 solved, 137 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/111 variables, 0/5 constraints. Problems are: Problem set: 3 solved, 137 unsolved
At refinement iteration 8 (OVERLAPS) 140/251 variables, 111/116 constraints. Problems are: Problem set: 3 solved, 137 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/251 variables, 61/177 constraints. Problems are: Problem set: 3 solved, 137 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/251 variables, 30/207 constraints. Problems are: Problem set: 3 solved, 137 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/251 variables, 0/207 constraints. Problems are: Problem set: 3 solved, 137 unsolved
At refinement iteration 12 (OVERLAPS) 3/254 variables, 2/209 constraints. Problems are: Problem set: 3 solved, 137 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/254 variables, 1/210 constraints. Problems are: Problem set: 3 solved, 137 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/254 variables, 107/317 constraints. Problems are: Problem set: 3 solved, 137 unsolved
[2024-05-28 21:53:34] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 1 ms to minimize.
[2024-05-28 21:53:34] [INFO ] Deduced a trap composed of 41 places in 37 ms of which 1 ms to minimize.
Problem TDEAD128 is UNSAT
At refinement iteration 15 (INCLUDED_ONLY) 0/254 variables, 2/319 constraints. Problems are: Problem set: 4 solved, 136 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/254 variables, 0/319 constraints. Problems are: Problem set: 4 solved, 136 unsolved
At refinement iteration 17 (OVERLAPS) 0/254 variables, 0/319 constraints. Problems are: Problem set: 4 solved, 136 unsolved
No progress, stopping.
After SMT solving in domain Int declared 254/254 variables, and 319 constraints, problems are : Problem set: 4 solved, 136 unsolved in 17331 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 113/113 constraints, ReadFeed: 62/62 constraints, PredecessorRefiner: 137/140 constraints, Known Traps: 3/3 constraints]
After SMT, in 24462ms problems are : Problem set: 4 solved, 136 unsolved
Search for dead transitions found 4 dead transitions in 24466ms
Found 4 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 4 transitions
Dead transitions reduction (with SMT) removed 4 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 113/178 places, 137/492 transitions.
Graph (complete) has 361 edges and 113 vertex of which 109 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.2 ms
Discarding 4 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 7 ms. Remains 109 /113 variables (removed 4) and now considering 137/137 (removed 0) transitions.
// Phase 1: matrix 137 rows 109 cols
[2024-05-28 21:53:44] [INFO ] Computed 4 invariants in 5 ms
[2024-05-28 21:53:44] [INFO ] Implicit Places using invariants in 121 ms returned []
[2024-05-28 21:53:44] [INFO ] Invariant cache hit.
[2024-05-28 21:53:44] [INFO ] State equation strengthened by 61 read => feed constraints.
[2024-05-28 21:53:44] [INFO ] Implicit Places using invariants and state equation in 357 ms returned []
Implicit Place search using SMT with State Equation took 482 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 109/178 places, 137/492 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 25468 ms. Remains : 109/178 places, 137/492 transitions.
Stuttering acceptance computed with spot in 88 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m96-LTLFireability-05
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d2m96-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d2m96-LTLFireability-05 finished in 25576 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||X(G(p1))))'
Support contains 3 out of 178 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 178/178 places, 492/492 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 156 transition count 231
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 156 transition count 231
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 66 place count 134 transition count 209
Iterating global reduction 0 with 22 rules applied. Total rules applied 88 place count 134 transition count 209
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 0 with 17 rules applied. Total rules applied 105 place count 134 transition count 192
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 116 place count 123 transition count 171
Iterating global reduction 1 with 11 rules applied. Total rules applied 127 place count 123 transition count 171
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 133 place count 123 transition count 165
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 136 place count 120 transition count 162
Iterating global reduction 2 with 3 rules applied. Total rules applied 139 place count 120 transition count 162
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 142 place count 117 transition count 159
Iterating global reduction 2 with 3 rules applied. Total rules applied 145 place count 117 transition count 159
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 147 place count 115 transition count 157
Iterating global reduction 2 with 2 rules applied. Total rules applied 149 place count 115 transition count 157
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 151 place count 113 transition count 155
Iterating global reduction 2 with 2 rules applied. Total rules applied 153 place count 113 transition count 155
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 154 place count 112 transition count 152
Iterating global reduction 2 with 1 rules applied. Total rules applied 155 place count 112 transition count 152
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 156 place count 111 transition count 151
Iterating global reduction 2 with 1 rules applied. Total rules applied 157 place count 111 transition count 151
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 158 place count 110 transition count 150
Iterating global reduction 2 with 1 rules applied. Total rules applied 159 place count 110 transition count 150
Applied a total of 159 rules in 15 ms. Remains 110 /178 variables (removed 68) and now considering 150/492 (removed 342) transitions.
// Phase 1: matrix 150 rows 110 cols
[2024-05-28 21:53:44] [INFO ] Computed 4 invariants in 1 ms
[2024-05-28 21:53:45] [INFO ] Implicit Places using invariants in 111 ms returned []
[2024-05-28 21:53:45] [INFO ] Invariant cache hit.
[2024-05-28 21:53:45] [INFO ] State equation strengthened by 74 read => feed constraints.
[2024-05-28 21:53:45] [INFO ] Implicit Places using invariants and state equation in 365 ms returned []
Implicit Place search using SMT with State Equation took 478 ms to find 0 implicit places.
Running 149 sub problems to find dead transitions.
[2024-05-28 21:53:45] [INFO ] Invariant cache hit.
[2024-05-28 21:53:45] [INFO ] State equation strengthened by 74 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/109 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/109 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 2 (OVERLAPS) 1/110 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/110 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 149 unsolved
[2024-05-28 21:53:47] [INFO ] Deduced a trap composed of 32 places in 42 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/110 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/110 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 149 unsolved
Problem TDEAD34 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD133 is UNSAT
At refinement iteration 6 (OVERLAPS) 150/260 variables, 110/115 constraints. Problems are: Problem set: 3 solved, 146 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/260 variables, 74/189 constraints. Problems are: Problem set: 3 solved, 146 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/260 variables, 0/189 constraints. Problems are: Problem set: 3 solved, 146 unsolved
[2024-05-28 21:53:50] [INFO ] Deduced a trap composed of 35 places in 61 ms of which 2 ms to minimize.
[2024-05-28 21:53:50] [INFO ] Deduced a trap composed of 32 places in 73 ms of which 2 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/260 variables, 2/191 constraints. Problems are: Problem set: 3 solved, 146 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/260 variables, 0/191 constraints. Problems are: Problem set: 3 solved, 146 unsolved
At refinement iteration 11 (OVERLAPS) 0/260 variables, 0/191 constraints. Problems are: Problem set: 3 solved, 146 unsolved
No progress, stopping.
After SMT solving in domain Real declared 260/260 variables, and 191 constraints, problems are : Problem set: 3 solved, 146 unsolved in 8556 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 110/110 constraints, ReadFeed: 74/74 constraints, PredecessorRefiner: 149/149 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 3 solved, 146 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 146 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 0/1 constraints. Problems are: Problem set: 3 solved, 146 unsolved
At refinement iteration 2 (OVERLAPS) 1/107 variables, 1/2 constraints. Problems are: Problem set: 3 solved, 146 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 1/3 constraints. Problems are: Problem set: 3 solved, 146 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/107 variables, 0/3 constraints. Problems are: Problem set: 3 solved, 146 unsolved
At refinement iteration 5 (OVERLAPS) 1/108 variables, 1/4 constraints. Problems are: Problem set: 3 solved, 146 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/108 variables, 3/7 constraints. Problems are: Problem set: 3 solved, 146 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/108 variables, 0/7 constraints. Problems are: Problem set: 3 solved, 146 unsolved
At refinement iteration 8 (OVERLAPS) 149/257 variables, 108/115 constraints. Problems are: Problem set: 3 solved, 146 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/257 variables, 73/188 constraints. Problems are: Problem set: 3 solved, 146 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/257 variables, 28/216 constraints. Problems are: Problem set: 3 solved, 146 unsolved
[2024-05-28 21:53:58] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/257 variables, 1/217 constraints. Problems are: Problem set: 3 solved, 146 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/257 variables, 0/217 constraints. Problems are: Problem set: 3 solved, 146 unsolved
At refinement iteration 13 (OVERLAPS) 3/260 variables, 2/219 constraints. Problems are: Problem set: 3 solved, 146 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/260 variables, 1/220 constraints. Problems are: Problem set: 3 solved, 146 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/260 variables, 118/338 constraints. Problems are: Problem set: 3 solved, 146 unsolved
[2024-05-28 21:54:04] [INFO ] Deduced a trap composed of 23 places in 27 ms of which 1 ms to minimize.
Problem TDEAD136 is UNSAT
At refinement iteration 16 (INCLUDED_ONLY) 0/260 variables, 1/339 constraints. Problems are: Problem set: 4 solved, 145 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/260 variables, 0/339 constraints. Problems are: Problem set: 4 solved, 145 unsolved
At refinement iteration 18 (OVERLAPS) 0/260 variables, 0/339 constraints. Problems are: Problem set: 4 solved, 145 unsolved
No progress, stopping.
After SMT solving in domain Int declared 260/260 variables, and 339 constraints, problems are : Problem set: 4 solved, 145 unsolved in 20008 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 110/110 constraints, ReadFeed: 74/74 constraints, PredecessorRefiner: 146/149 constraints, Known Traps: 5/5 constraints]
After SMT, in 28748ms problems are : Problem set: 4 solved, 145 unsolved
Search for dead transitions found 4 dead transitions in 28750ms
Found 4 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 4 transitions
Dead transitions reduction (with SMT) removed 4 transitions
Starting structural reductions in LTL mode, iteration 1 : 110/178 places, 146/492 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 106 transition count 146
Applied a total of 4 rules in 2 ms. Remains 106 /110 variables (removed 4) and now considering 146/146 (removed 0) transitions.
// Phase 1: matrix 146 rows 106 cols
[2024-05-28 21:54:14] [INFO ] Computed 4 invariants in 1 ms
[2024-05-28 21:54:14] [INFO ] Implicit Places using invariants in 93 ms returned []
[2024-05-28 21:54:14] [INFO ] Invariant cache hit.
[2024-05-28 21:54:14] [INFO ] State equation strengthened by 73 read => feed constraints.
[2024-05-28 21:54:14] [INFO ] Implicit Places using invariants and state equation in 373 ms returned []
Implicit Place search using SMT with State Equation took 469 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 106/178 places, 146/492 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 29716 ms. Remains : 106/178 places, 146/492 transitions.
Stuttering acceptance computed with spot in 113 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m96-LTLFireability-06
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 1 ms.
FORMULA SieveSingleMsgMbox-PT-d2m96-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d2m96-LTLFireability-06 finished in 29845 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 2 out of 178 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 178/178 places, 492/492 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 155 transition count 202
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 155 transition count 202
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 69 place count 132 transition count 179
Iterating global reduction 0 with 23 rules applied. Total rules applied 92 place count 132 transition count 179
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 0 with 13 rules applied. Total rules applied 105 place count 132 transition count 166
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 117 place count 120 transition count 143
Iterating global reduction 1 with 12 rules applied. Total rules applied 129 place count 120 transition count 143
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 137 place count 120 transition count 135
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 141 place count 116 transition count 131
Iterating global reduction 2 with 4 rules applied. Total rules applied 145 place count 116 transition count 131
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 149 place count 112 transition count 127
Iterating global reduction 2 with 4 rules applied. Total rules applied 153 place count 112 transition count 127
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 156 place count 109 transition count 124
Iterating global reduction 2 with 3 rules applied. Total rules applied 159 place count 109 transition count 124
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 161 place count 109 transition count 122
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 164 place count 106 transition count 119
Iterating global reduction 3 with 3 rules applied. Total rules applied 167 place count 106 transition count 119
Applied a total of 167 rules in 11 ms. Remains 106 /178 variables (removed 72) and now considering 119/492 (removed 373) transitions.
// Phase 1: matrix 119 rows 106 cols
[2024-05-28 21:54:14] [INFO ] Computed 4 invariants in 1 ms
[2024-05-28 21:54:14] [INFO ] Implicit Places using invariants in 111 ms returned []
[2024-05-28 21:54:14] [INFO ] Invariant cache hit.
[2024-05-28 21:54:14] [INFO ] State equation strengthened by 45 read => feed constraints.
[2024-05-28 21:54:15] [INFO ] Implicit Places using invariants and state equation in 340 ms returned []
Implicit Place search using SMT with State Equation took 453 ms to find 0 implicit places.
Running 118 sub problems to find dead transitions.
[2024-05-28 21:54:15] [INFO ] Invariant cache hit.
[2024-05-28 21:54:15] [INFO ] State equation strengthened by 45 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 2 (OVERLAPS) 1/106 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/106 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 118 unsolved
[2024-05-28 21:54:16] [INFO ] Deduced a trap composed of 32 places in 44 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/106 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/106 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 118 unsolved
Problem TDEAD44 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD106 is UNSAT
At refinement iteration 6 (OVERLAPS) 119/225 variables, 106/111 constraints. Problems are: Problem set: 3 solved, 115 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/225 variables, 45/156 constraints. Problems are: Problem set: 3 solved, 115 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/225 variables, 0/156 constraints. Problems are: Problem set: 3 solved, 115 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/225 variables, 0/156 constraints. Problems are: Problem set: 3 solved, 115 unsolved
No progress, stopping.
After SMT solving in domain Real declared 225/225 variables, and 156 constraints, problems are : Problem set: 3 solved, 115 unsolved in 5467 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 106/106 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 118/118 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 3 solved, 115 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 115 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 0/1 constraints. Problems are: Problem set: 3 solved, 115 unsolved
At refinement iteration 2 (OVERLAPS) 1/103 variables, 2/3 constraints. Problems are: Problem set: 3 solved, 115 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 0/3 constraints. Problems are: Problem set: 3 solved, 115 unsolved
At refinement iteration 4 (OVERLAPS) 1/104 variables, 1/4 constraints. Problems are: Problem set: 3 solved, 115 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/104 variables, 1/5 constraints. Problems are: Problem set: 3 solved, 115 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/104 variables, 0/5 constraints. Problems are: Problem set: 3 solved, 115 unsolved
At refinement iteration 7 (OVERLAPS) 118/222 variables, 104/109 constraints. Problems are: Problem set: 3 solved, 115 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/222 variables, 44/153 constraints. Problems are: Problem set: 3 solved, 115 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/222 variables, 28/181 constraints. Problems are: Problem set: 3 solved, 115 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/222 variables, 0/181 constraints. Problems are: Problem set: 3 solved, 115 unsolved
At refinement iteration 11 (OVERLAPS) 3/225 variables, 2/183 constraints. Problems are: Problem set: 3 solved, 115 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/225 variables, 1/184 constraints. Problems are: Problem set: 3 solved, 115 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/225 variables, 87/271 constraints. Problems are: Problem set: 3 solved, 115 unsolved
[2024-05-28 21:54:25] [INFO ] Deduced a trap composed of 43 places in 41 ms of which 2 ms to minimize.
[2024-05-28 21:54:25] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 1 ms to minimize.
Problem TDEAD109 is UNSAT
At refinement iteration 14 (INCLUDED_ONLY) 0/225 variables, 2/273 constraints. Problems are: Problem set: 4 solved, 114 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/225 variables, 0/273 constraints. Problems are: Problem set: 4 solved, 114 unsolved
At refinement iteration 16 (OVERLAPS) 0/225 variables, 0/273 constraints. Problems are: Problem set: 4 solved, 114 unsolved
No progress, stopping.
After SMT solving in domain Int declared 225/225 variables, and 273 constraints, problems are : Problem set: 4 solved, 114 unsolved in 12481 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 106/106 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 115/118 constraints, Known Traps: 3/3 constraints]
After SMT, in 18071ms problems are : Problem set: 4 solved, 114 unsolved
Search for dead transitions found 4 dead transitions in 18073ms
Found 4 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 4 transitions
Dead transitions reduction (with SMT) removed 4 transitions
Starting structural reductions in LTL mode, iteration 1 : 106/178 places, 115/492 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 102 transition count 115
Applied a total of 4 rules in 1 ms. Remains 102 /106 variables (removed 4) and now considering 115/115 (removed 0) transitions.
// Phase 1: matrix 115 rows 102 cols
[2024-05-28 21:54:33] [INFO ] Computed 4 invariants in 1 ms
[2024-05-28 21:54:33] [INFO ] Implicit Places using invariants in 112 ms returned []
[2024-05-28 21:54:33] [INFO ] Invariant cache hit.
[2024-05-28 21:54:33] [INFO ] State equation strengthened by 44 read => feed constraints.
[2024-05-28 21:54:33] [INFO ] Implicit Places using invariants and state equation in 280 ms returned []
Implicit Place search using SMT with State Equation took 407 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 102/178 places, 115/492 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 18946 ms. Remains : 102/178 places, 115/492 transitions.
Stuttering acceptance computed with spot in 128 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m96-LTLFireability-07
Product exploration explored 100000 steps with 22443 reset in 303 ms.
Product exploration explored 100000 steps with 22368 reset in 238 ms.
Computed a total of 27 stabilizing places and 35 stable transitions
Graph (complete) has 323 edges and 102 vertex of which 101 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.7 ms
Computed a total of 27 stabilizing places and 35 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 83 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 120 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (8994 resets) in 60 ms. (655 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (4086 resets) in 42 ms. (930 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2130337 steps, run timeout after 3001 ms. (steps per millisecond=709 ) properties seen :0 out of 1
Probabilistic random walk after 2130337 steps, saw 993923 distinct states, run finished after 3001 ms. (steps per millisecond=709 ) properties seen :0
[2024-05-28 21:54:37] [INFO ] Invariant cache hit.
[2024-05-28 21:54:37] [INFO ] State equation strengthened by 44 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) 57/59 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 19/78 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 100/178 variables, 78/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/178 variables, 29/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/178 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 39/217 variables, 24/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/217 variables, 15/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 21:54:37] [INFO ] Deduced a trap composed of 34 places in 31 ms of which 1 ms to minimize.
Problem apf0 is UNSAT
After SMT solving in domain Real declared 217/217 variables, and 151 constraints, problems are : Problem set: 1 solved, 0 unsolved in 156 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 102/102 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 161ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [p0, (X (X p0)), (G p0)]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 14 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA SieveSingleMsgMbox-PT-d2m96-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SieveSingleMsgMbox-PT-d2m96-LTLFireability-07 finished in 23075 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(F(p0))))))'
Support contains 2 out of 178 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 178/178 places, 492/492 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 155 transition count 216
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 155 transition count 216
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 69 place count 132 transition count 193
Iterating global reduction 0 with 23 rules applied. Total rules applied 92 place count 132 transition count 193
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 0 with 15 rules applied. Total rules applied 107 place count 132 transition count 178
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 119 place count 120 transition count 155
Iterating global reduction 1 with 12 rules applied. Total rules applied 131 place count 120 transition count 155
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 138 place count 120 transition count 148
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 142 place count 116 transition count 144
Iterating global reduction 2 with 4 rules applied. Total rules applied 146 place count 116 transition count 144
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 150 place count 112 transition count 140
Iterating global reduction 2 with 4 rules applied. Total rules applied 154 place count 112 transition count 140
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 157 place count 109 transition count 137
Iterating global reduction 2 with 3 rules applied. Total rules applied 160 place count 109 transition count 137
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 162 place count 109 transition count 135
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 165 place count 106 transition count 132
Iterating global reduction 3 with 3 rules applied. Total rules applied 168 place count 106 transition count 132
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 169 place count 105 transition count 129
Iterating global reduction 3 with 1 rules applied. Total rules applied 170 place count 105 transition count 129
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 171 place count 104 transition count 128
Iterating global reduction 3 with 1 rules applied. Total rules applied 172 place count 104 transition count 128
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 173 place count 103 transition count 127
Iterating global reduction 3 with 1 rules applied. Total rules applied 174 place count 103 transition count 127
Applied a total of 174 rules in 14 ms. Remains 103 /178 variables (removed 75) and now considering 127/492 (removed 365) transitions.
// Phase 1: matrix 127 rows 103 cols
[2024-05-28 21:54:37] [INFO ] Computed 4 invariants in 1 ms
[2024-05-28 21:54:37] [INFO ] Implicit Places using invariants in 116 ms returned []
[2024-05-28 21:54:37] [INFO ] Invariant cache hit.
[2024-05-28 21:54:38] [INFO ] State equation strengthened by 56 read => feed constraints.
[2024-05-28 21:54:38] [INFO ] Implicit Places using invariants and state equation in 313 ms returned []
Implicit Place search using SMT with State Equation took 431 ms to find 0 implicit places.
Running 126 sub problems to find dead transitions.
[2024-05-28 21:54:38] [INFO ] Invariant cache hit.
[2024-05-28 21:54:38] [INFO ] State equation strengthened by 56 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 2 (OVERLAPS) 1/103 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 126 unsolved
[2024-05-28 21:54:39] [INFO ] Deduced a trap composed of 30 places in 41 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/103 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 126 unsolved
Problem TDEAD34 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD112 is UNSAT
At refinement iteration 6 (OVERLAPS) 127/230 variables, 103/108 constraints. Problems are: Problem set: 3 solved, 123 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/230 variables, 56/164 constraints. Problems are: Problem set: 3 solved, 123 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/230 variables, 0/164 constraints. Problems are: Problem set: 3 solved, 123 unsolved
[2024-05-28 21:54:42] [INFO ] Deduced a trap composed of 33 places in 59 ms of which 1 ms to minimize.
[2024-05-28 21:54:42] [INFO ] Deduced a trap composed of 31 places in 60 ms of which 2 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/230 variables, 2/166 constraints. Problems are: Problem set: 3 solved, 123 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/230 variables, 0/166 constraints. Problems are: Problem set: 3 solved, 123 unsolved
At refinement iteration 11 (OVERLAPS) 0/230 variables, 0/166 constraints. Problems are: Problem set: 3 solved, 123 unsolved
No progress, stopping.
After SMT solving in domain Real declared 230/230 variables, and 166 constraints, problems are : Problem set: 3 solved, 123 unsolved in 6907 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 103/103 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 126/126 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 3 solved, 123 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 123 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 0/1 constraints. Problems are: Problem set: 3 solved, 123 unsolved
At refinement iteration 2 (OVERLAPS) 1/100 variables, 1/2 constraints. Problems are: Problem set: 3 solved, 123 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 1/3 constraints. Problems are: Problem set: 3 solved, 123 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 0/3 constraints. Problems are: Problem set: 3 solved, 123 unsolved
At refinement iteration 5 (OVERLAPS) 1/101 variables, 1/4 constraints. Problems are: Problem set: 3 solved, 123 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/101 variables, 3/7 constraints. Problems are: Problem set: 3 solved, 123 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/101 variables, 0/7 constraints. Problems are: Problem set: 3 solved, 123 unsolved
At refinement iteration 8 (OVERLAPS) 126/227 variables, 101/108 constraints. Problems are: Problem set: 3 solved, 123 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/227 variables, 55/163 constraints. Problems are: Problem set: 3 solved, 123 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/227 variables, 26/189 constraints. Problems are: Problem set: 3 solved, 123 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/227 variables, 0/189 constraints. Problems are: Problem set: 3 solved, 123 unsolved
At refinement iteration 12 (OVERLAPS) 3/230 variables, 2/191 constraints. Problems are: Problem set: 3 solved, 123 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/230 variables, 1/192 constraints. Problems are: Problem set: 3 solved, 123 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/230 variables, 97/289 constraints. Problems are: Problem set: 3 solved, 123 unsolved
[2024-05-28 21:54:51] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 1 ms to minimize.
Problem TDEAD115 is UNSAT
At refinement iteration 15 (INCLUDED_ONLY) 0/230 variables, 1/290 constraints. Problems are: Problem set: 4 solved, 122 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/230 variables, 0/290 constraints. Problems are: Problem set: 4 solved, 122 unsolved
At refinement iteration 17 (OVERLAPS) 0/230 variables, 0/290 constraints. Problems are: Problem set: 4 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Int declared 230/230 variables, and 290 constraints, problems are : Problem set: 4 solved, 122 unsolved in 13402 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 103/103 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 123/126 constraints, Known Traps: 4/4 constraints]
After SMT, in 20448ms problems are : Problem set: 4 solved, 122 unsolved
Search for dead transitions found 4 dead transitions in 20450ms
Found 4 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 4 transitions
Dead transitions reduction (with SMT) removed 4 transitions
Starting structural reductions in LTL mode, iteration 1 : 103/178 places, 123/492 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 99 transition count 123
Applied a total of 4 rules in 2 ms. Remains 99 /103 variables (removed 4) and now considering 123/123 (removed 0) transitions.
// Phase 1: matrix 123 rows 99 cols
[2024-05-28 21:54:58] [INFO ] Computed 4 invariants in 1 ms
[2024-05-28 21:54:58] [INFO ] Implicit Places using invariants in 101 ms returned []
[2024-05-28 21:54:58] [INFO ] Invariant cache hit.
[2024-05-28 21:54:58] [INFO ] State equation strengthened by 55 read => feed constraints.
[2024-05-28 21:54:59] [INFO ] Implicit Places using invariants and state equation in 314 ms returned []
Implicit Place search using SMT with State Equation took 418 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 99/178 places, 123/492 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 21318 ms. Remains : 99/178 places, 123/492 transitions.
Stuttering acceptance computed with spot in 183 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m96-LTLFireability-08
Product exploration explored 100000 steps with 26658 reset in 138 ms.
Product exploration explored 100000 steps with 26656 reset in 148 ms.
Computed a total of 17 stabilizing places and 22 stable transitions
Graph (complete) has 323 edges and 99 vertex of which 98 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 17 stabilizing places and 22 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 80 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 180 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (8980 resets) in 79 ms. (500 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (1891 resets) in 49 ms. (800 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 3252 steps, run visited all 1 properties in 9 ms. (steps per millisecond=361 )
Probabilistic random walk after 3252 steps, saw 1669 distinct states, run finished after 16 ms. (steps per millisecond=203 ) properties seen :1
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 98 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 174 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 174 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 99 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 99/99 places, 123/123 transitions.
Applied a total of 0 rules in 1 ms. Remains 99 /99 variables (removed 0) and now considering 123/123 (removed 0) transitions.
[2024-05-28 21:55:00] [INFO ] Invariant cache hit.
[2024-05-28 21:55:00] [INFO ] Implicit Places using invariants in 117 ms returned []
[2024-05-28 21:55:00] [INFO ] Invariant cache hit.
[2024-05-28 21:55:00] [INFO ] State equation strengthened by 55 read => feed constraints.
[2024-05-28 21:55:00] [INFO ] Implicit Places using invariants and state equation in 315 ms returned []
Implicit Place search using SMT with State Equation took 436 ms to find 0 implicit places.
Running 122 sub problems to find dead transitions.
[2024-05-28 21:55:00] [INFO ] Invariant cache hit.
[2024-05-28 21:55:00] [INFO ] State equation strengthened by 55 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 3 (OVERLAPS) 1/99 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 5 (OVERLAPS) 123/222 variables, 99/103 constraints. Problems are: Problem set: 0 solved, 122 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/222 variables, 55/158 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/222 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 8 (OVERLAPS) 0/222 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Real declared 222/222 variables, and 158 constraints, problems are : Problem set: 0 solved, 122 unsolved in 3764 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 99/99 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 122/122 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 122 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 3 (OVERLAPS) 1/99 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 5 (OVERLAPS) 123/222 variables, 99/103 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/222 variables, 55/158 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/222 variables, 122/280 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/222 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 9 (OVERLAPS) 0/222 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Int declared 222/222 variables, and 280 constraints, problems are : Problem set: 0 solved, 122 unsolved in 8034 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 99/99 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 122/122 constraints, Known Traps: 0/0 constraints]
After SMT, in 11932ms problems are : Problem set: 0 solved, 122 unsolved
Search for dead transitions found 0 dead transitions in 11933ms
Finished structural reductions in LTL mode , in 1 iterations and 12371 ms. Remains : 99/99 places, 123/123 transitions.
Computed a total of 17 stabilizing places and 22 stable transitions
Graph (complete) has 323 edges and 99 vertex of which 98 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 17 stabilizing places and 22 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 93 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 183 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (8967 resets) in 177 ms. (224 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (1891 resets) in 31 ms. (1250 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 3252 steps, run visited all 1 properties in 15 ms. (steps per millisecond=216 )
Probabilistic random walk after 3252 steps, saw 1669 distinct states, run finished after 15 ms. (steps per millisecond=216 ) properties seen :1
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 110 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 176 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 172 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 175 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 26627 reset in 136 ms.
Product exploration explored 100000 steps with 26654 reset in 149 ms.
Applying partial POR strategy [true, false, false, false, false]
Stuttering acceptance computed with spot in 178 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 99 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 99/99 places, 123/123 transitions.
Applied a total of 0 rules in 5 ms. Remains 99 /99 variables (removed 0) and now considering 123/123 (removed 0) transitions.
[2024-05-28 21:55:14] [INFO ] Redundant transitions in 1 ms returned []
Running 122 sub problems to find dead transitions.
[2024-05-28 21:55:14] [INFO ] Invariant cache hit.
[2024-05-28 21:55:14] [INFO ] State equation strengthened by 55 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 3 (OVERLAPS) 1/99 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 5 (OVERLAPS) 123/222 variables, 99/103 constraints. Problems are: Problem set: 0 solved, 122 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/222 variables, 55/158 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/222 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 8 (OVERLAPS) 0/222 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Real declared 222/222 variables, and 158 constraints, problems are : Problem set: 0 solved, 122 unsolved in 3668 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 99/99 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 122/122 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 122 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 3 (OVERLAPS) 1/99 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 5 (OVERLAPS) 123/222 variables, 99/103 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/222 variables, 55/158 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/222 variables, 122/280 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/222 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 9 (OVERLAPS) 0/222 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Int declared 222/222 variables, and 280 constraints, problems are : Problem set: 0 solved, 122 unsolved in 7651 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 99/99 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 122/122 constraints, Known Traps: 0/0 constraints]
After SMT, in 11459ms problems are : Problem set: 0 solved, 122 unsolved
Search for dead transitions found 0 dead transitions in 11461ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 11473 ms. Remains : 99/99 places, 123/123 transitions.
Support contains 2 out of 99 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 99/99 places, 123/123 transitions.
Applied a total of 0 rules in 1 ms. Remains 99 /99 variables (removed 0) and now considering 123/123 (removed 0) transitions.
[2024-05-28 21:55:26] [INFO ] Invariant cache hit.
[2024-05-28 21:55:26] [INFO ] Implicit Places using invariants in 103 ms returned []
[2024-05-28 21:55:26] [INFO ] Invariant cache hit.
[2024-05-28 21:55:26] [INFO ] State equation strengthened by 55 read => feed constraints.
[2024-05-28 21:55:26] [INFO ] Implicit Places using invariants and state equation in 290 ms returned []
Implicit Place search using SMT with State Equation took 398 ms to find 0 implicit places.
Running 122 sub problems to find dead transitions.
[2024-05-28 21:55:26] [INFO ] Invariant cache hit.
[2024-05-28 21:55:26] [INFO ] State equation strengthened by 55 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 3 (OVERLAPS) 1/99 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 5 (OVERLAPS) 123/222 variables, 99/103 constraints. Problems are: Problem set: 0 solved, 122 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/222 variables, 55/158 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/222 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 8 (OVERLAPS) 0/222 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Real declared 222/222 variables, and 158 constraints, problems are : Problem set: 0 solved, 122 unsolved in 3597 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 99/99 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 122/122 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 122 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 3 (OVERLAPS) 1/99 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 5 (OVERLAPS) 123/222 variables, 99/103 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/222 variables, 55/158 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/222 variables, 122/280 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/222 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 9 (OVERLAPS) 0/222 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Int declared 222/222 variables, and 280 constraints, problems are : Problem set: 0 solved, 122 unsolved in 7651 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 99/99 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 122/122 constraints, Known Traps: 0/0 constraints]
After SMT, in 11375ms problems are : Problem set: 0 solved, 122 unsolved
Search for dead transitions found 0 dead transitions in 11382ms
Finished structural reductions in LTL mode , in 1 iterations and 11783 ms. Remains : 99/99 places, 123/123 transitions.
Treatment of property SieveSingleMsgMbox-PT-d2m96-LTLFireability-08 finished in 60118 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(X((!(!G(F(p0)) U !X(p1))&&F(!p1)))))'
Support contains 4 out of 178 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 178/178 places, 492/492 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 156 transition count 217
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 156 transition count 217
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 66 place count 134 transition count 195
Iterating global reduction 0 with 22 rules applied. Total rules applied 88 place count 134 transition count 195
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 102 place count 134 transition count 181
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 113 place count 123 transition count 160
Iterating global reduction 1 with 11 rules applied. Total rules applied 124 place count 123 transition count 160
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 131 place count 123 transition count 153
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 134 place count 120 transition count 150
Iterating global reduction 2 with 3 rules applied. Total rules applied 137 place count 120 transition count 150
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 140 place count 117 transition count 147
Iterating global reduction 2 with 3 rules applied. Total rules applied 143 place count 117 transition count 147
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 145 place count 115 transition count 145
Iterating global reduction 2 with 2 rules applied. Total rules applied 147 place count 115 transition count 145
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 149 place count 115 transition count 143
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 151 place count 113 transition count 141
Iterating global reduction 3 with 2 rules applied. Total rules applied 153 place count 113 transition count 141
Applied a total of 153 rules in 15 ms. Remains 113 /178 variables (removed 65) and now considering 141/492 (removed 351) transitions.
// Phase 1: matrix 141 rows 113 cols
[2024-05-28 21:55:37] [INFO ] Computed 4 invariants in 1 ms
[2024-05-28 21:55:38] [INFO ] Implicit Places using invariants in 108 ms returned []
[2024-05-28 21:55:38] [INFO ] Invariant cache hit.
[2024-05-28 21:55:38] [INFO ] State equation strengthened by 61 read => feed constraints.
[2024-05-28 21:55:38] [INFO ] Implicit Places using invariants and state equation in 291 ms returned []
Implicit Place search using SMT with State Equation took 403 ms to find 0 implicit places.
Running 140 sub problems to find dead transitions.
[2024-05-28 21:55:38] [INFO ] Invariant cache hit.
[2024-05-28 21:55:38] [INFO ] State equation strengthened by 61 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 2 (OVERLAPS) 1/113 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/113 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 140 unsolved
[2024-05-28 21:55:40] [INFO ] Deduced a trap composed of 34 places in 46 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/113 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 140 unsolved
Problem TDEAD44 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD126 is UNSAT
At refinement iteration 6 (OVERLAPS) 141/254 variables, 113/118 constraints. Problems are: Problem set: 3 solved, 137 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/254 variables, 61/179 constraints. Problems are: Problem set: 3 solved, 137 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/254 variables, 0/179 constraints. Problems are: Problem set: 3 solved, 137 unsolved
[2024-05-28 21:55:43] [INFO ] Deduced a trap composed of 34 places in 64 ms of which 2 ms to minimize.
[2024-05-28 21:55:43] [INFO ] Deduced a trap composed of 34 places in 77 ms of which 1 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/254 variables, 2/181 constraints. Problems are: Problem set: 3 solved, 137 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/254 variables, 0/181 constraints. Problems are: Problem set: 3 solved, 137 unsolved
At refinement iteration 11 (OVERLAPS) 0/254 variables, 0/181 constraints. Problems are: Problem set: 3 solved, 137 unsolved
No progress, stopping.
After SMT solving in domain Real declared 254/254 variables, and 181 constraints, problems are : Problem set: 3 solved, 137 unsolved in 8314 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 113/113 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 140/140 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 3 solved, 137 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/109 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 137 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/109 variables, 0/1 constraints. Problems are: Problem set: 3 solved, 137 unsolved
At refinement iteration 2 (OVERLAPS) 1/110 variables, 2/3 constraints. Problems are: Problem set: 3 solved, 137 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/110 variables, 0/3 constraints. Problems are: Problem set: 3 solved, 137 unsolved
At refinement iteration 4 (OVERLAPS) 1/111 variables, 1/4 constraints. Problems are: Problem set: 3 solved, 137 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/111 variables, 3/7 constraints. Problems are: Problem set: 3 solved, 137 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/111 variables, 0/7 constraints. Problems are: Problem set: 3 solved, 137 unsolved
At refinement iteration 7 (OVERLAPS) 140/251 variables, 111/118 constraints. Problems are: Problem set: 3 solved, 137 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/251 variables, 60/178 constraints. Problems are: Problem set: 3 solved, 137 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/251 variables, 30/208 constraints. Problems are: Problem set: 3 solved, 137 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/251 variables, 0/208 constraints. Problems are: Problem set: 3 solved, 137 unsolved
At refinement iteration 11 (OVERLAPS) 3/254 variables, 2/210 constraints. Problems are: Problem set: 3 solved, 137 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/254 variables, 1/211 constraints. Problems are: Problem set: 3 solved, 137 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/254 variables, 107/318 constraints. Problems are: Problem set: 3 solved, 137 unsolved
[2024-05-28 21:55:53] [INFO ] Deduced a trap composed of 23 places in 26 ms of which 1 ms to minimize.
[2024-05-28 21:55:53] [INFO ] Deduced a trap composed of 43 places in 39 ms of which 1 ms to minimize.
Problem TDEAD129 is UNSAT
At refinement iteration 14 (INCLUDED_ONLY) 0/254 variables, 2/320 constraints. Problems are: Problem set: 4 solved, 136 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/254 variables, 0/320 constraints. Problems are: Problem set: 4 solved, 136 unsolved
At refinement iteration 16 (OVERLAPS) 0/254 variables, 0/320 constraints. Problems are: Problem set: 4 solved, 136 unsolved
No progress, stopping.
After SMT solving in domain Int declared 254/254 variables, and 320 constraints, problems are : Problem set: 4 solved, 136 unsolved in 19381 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 113/113 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 137/140 constraints, Known Traps: 5/5 constraints]
After SMT, in 27858ms problems are : Problem set: 4 solved, 136 unsolved
Search for dead transitions found 4 dead transitions in 27860ms
Found 4 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 4 transitions
Dead transitions reduction (with SMT) removed 4 transitions
Starting structural reductions in LTL mode, iteration 1 : 113/178 places, 137/492 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 109 transition count 137
Applied a total of 4 rules in 5 ms. Remains 109 /113 variables (removed 4) and now considering 137/137 (removed 0) transitions.
// Phase 1: matrix 137 rows 109 cols
[2024-05-28 21:56:06] [INFO ] Computed 4 invariants in 1 ms
[2024-05-28 21:56:06] [INFO ] Implicit Places using invariants in 101 ms returned []
[2024-05-28 21:56:06] [INFO ] Invariant cache hit.
[2024-05-28 21:56:06] [INFO ] State equation strengthened by 60 read => feed constraints.
[2024-05-28 21:56:06] [INFO ] Implicit Places using invariants and state equation in 392 ms returned []
Implicit Place search using SMT with State Equation took 499 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 109/178 places, 137/492 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 28783 ms. Remains : 109/178 places, 137/492 transitions.
Stuttering acceptance computed with spot in 233 ms :[true, true, (NOT p1), p1, (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m96-LTLFireability-09
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d2m96-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d2m96-LTLFireability-09 finished in 29044 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F((p0&&X(p1)))&&F(G(p2)))))'
Support contains 5 out of 178 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 178/178 places, 492/492 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 156 transition count 231
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 156 transition count 231
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 66 place count 134 transition count 209
Iterating global reduction 0 with 22 rules applied. Total rules applied 88 place count 134 transition count 209
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 0 with 17 rules applied. Total rules applied 105 place count 134 transition count 192
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 116 place count 123 transition count 171
Iterating global reduction 1 with 11 rules applied. Total rules applied 127 place count 123 transition count 171
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 133 place count 123 transition count 165
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 136 place count 120 transition count 162
Iterating global reduction 2 with 3 rules applied. Total rules applied 139 place count 120 transition count 162
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 142 place count 117 transition count 159
Iterating global reduction 2 with 3 rules applied. Total rules applied 145 place count 117 transition count 159
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 148 place count 114 transition count 156
Iterating global reduction 2 with 3 rules applied. Total rules applied 151 place count 114 transition count 156
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 154 place count 114 transition count 153
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 157 place count 111 transition count 150
Iterating global reduction 3 with 3 rules applied. Total rules applied 160 place count 111 transition count 150
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 161 place count 110 transition count 147
Iterating global reduction 3 with 1 rules applied. Total rules applied 162 place count 110 transition count 147
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 163 place count 109 transition count 146
Iterating global reduction 3 with 1 rules applied. Total rules applied 164 place count 109 transition count 146
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 165 place count 108 transition count 145
Iterating global reduction 3 with 1 rules applied. Total rules applied 166 place count 108 transition count 145
Applied a total of 166 rules in 16 ms. Remains 108 /178 variables (removed 70) and now considering 145/492 (removed 347) transitions.
// Phase 1: matrix 145 rows 108 cols
[2024-05-28 21:56:07] [INFO ] Computed 4 invariants in 2 ms
[2024-05-28 21:56:07] [INFO ] Implicit Places using invariants in 129 ms returned []
[2024-05-28 21:56:07] [INFO ] Invariant cache hit.
[2024-05-28 21:56:07] [INFO ] State equation strengthened by 70 read => feed constraints.
[2024-05-28 21:56:07] [INFO ] Implicit Places using invariants and state equation in 314 ms returned []
Implicit Place search using SMT with State Equation took 445 ms to find 0 implicit places.
Running 144 sub problems to find dead transitions.
[2024-05-28 21:56:07] [INFO ] Invariant cache hit.
[2024-05-28 21:56:07] [INFO ] State equation strengthened by 70 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/107 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 2 (OVERLAPS) 1/108 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 144 unsolved
[2024-05-28 21:56:09] [INFO ] Deduced a trap composed of 32 places in 40 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/108 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/108 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 144 unsolved
Problem TDEAD34 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD128 is UNSAT
At refinement iteration 6 (OVERLAPS) 145/253 variables, 108/113 constraints. Problems are: Problem set: 3 solved, 141 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/253 variables, 70/183 constraints. Problems are: Problem set: 3 solved, 141 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/253 variables, 0/183 constraints. Problems are: Problem set: 3 solved, 141 unsolved
[2024-05-28 21:56:12] [INFO ] Deduced a trap composed of 34 places in 63 ms of which 1 ms to minimize.
[2024-05-28 21:56:13] [INFO ] Deduced a trap composed of 32 places in 66 ms of which 2 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/253 variables, 2/185 constraints. Problems are: Problem set: 3 solved, 141 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/253 variables, 0/185 constraints. Problems are: Problem set: 3 solved, 141 unsolved
At refinement iteration 11 (OVERLAPS) 0/253 variables, 0/185 constraints. Problems are: Problem set: 3 solved, 141 unsolved
No progress, stopping.
After SMT solving in domain Real declared 253/253 variables, and 185 constraints, problems are : Problem set: 3 solved, 141 unsolved in 9207 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 108/108 constraints, ReadFeed: 70/70 constraints, PredecessorRefiner: 144/144 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 3 solved, 141 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 141 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 0/1 constraints. Problems are: Problem set: 3 solved, 141 unsolved
At refinement iteration 2 (OVERLAPS) 1/105 variables, 1/2 constraints. Problems are: Problem set: 3 solved, 141 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 1/3 constraints. Problems are: Problem set: 3 solved, 141 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 0/3 constraints. Problems are: Problem set: 3 solved, 141 unsolved
At refinement iteration 5 (OVERLAPS) 1/106 variables, 1/4 constraints. Problems are: Problem set: 3 solved, 141 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/106 variables, 3/7 constraints. Problems are: Problem set: 3 solved, 141 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/106 variables, 0/7 constraints. Problems are: Problem set: 3 solved, 141 unsolved
At refinement iteration 8 (OVERLAPS) 144/250 variables, 106/113 constraints. Problems are: Problem set: 3 solved, 141 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/250 variables, 69/182 constraints. Problems are: Problem set: 3 solved, 141 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/250 variables, 28/210 constraints. Problems are: Problem set: 3 solved, 141 unsolved
[2024-05-28 21:56:20] [INFO ] Deduced a trap composed of 12 places in 47 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/250 variables, 1/211 constraints. Problems are: Problem set: 3 solved, 141 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/250 variables, 0/211 constraints. Problems are: Problem set: 3 solved, 141 unsolved
At refinement iteration 13 (OVERLAPS) 3/253 variables, 2/213 constraints. Problems are: Problem set: 3 solved, 141 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/253 variables, 1/214 constraints. Problems are: Problem set: 3 solved, 141 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/253 variables, 113/327 constraints. Problems are: Problem set: 3 solved, 141 unsolved
[2024-05-28 21:56:26] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 1 ms to minimize.
Problem TDEAD131 is UNSAT
At refinement iteration 16 (INCLUDED_ONLY) 0/253 variables, 1/328 constraints. Problems are: Problem set: 4 solved, 140 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/253 variables, 0/328 constraints. Problems are: Problem set: 4 solved, 140 unsolved
At refinement iteration 18 (OVERLAPS) 0/253 variables, 0/328 constraints. Problems are: Problem set: 4 solved, 140 unsolved
No progress, stopping.
After SMT solving in domain Int declared 253/253 variables, and 328 constraints, problems are : Problem set: 4 solved, 140 unsolved in 19691 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 108/108 constraints, ReadFeed: 70/70 constraints, PredecessorRefiner: 141/144 constraints, Known Traps: 5/5 constraints]
After SMT, in 29076ms problems are : Problem set: 4 solved, 140 unsolved
Search for dead transitions found 4 dead transitions in 29078ms
Found 4 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 4 transitions
Dead transitions reduction (with SMT) removed 4 transitions
Starting structural reductions in LTL mode, iteration 1 : 108/178 places, 141/492 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 104 transition count 141
Applied a total of 4 rules in 2 ms. Remains 104 /108 variables (removed 4) and now considering 141/141 (removed 0) transitions.
// Phase 1: matrix 141 rows 104 cols
[2024-05-28 21:56:36] [INFO ] Computed 4 invariants in 1 ms
[2024-05-28 21:56:36] [INFO ] Implicit Places using invariants in 125 ms returned []
[2024-05-28 21:56:36] [INFO ] Invariant cache hit.
[2024-05-28 21:56:36] [INFO ] State equation strengthened by 69 read => feed constraints.
[2024-05-28 21:56:36] [INFO ] Implicit Places using invariants and state equation in 308 ms returned []
Implicit Place search using SMT with State Equation took 435 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 104/178 places, 141/492 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 29978 ms. Remains : 104/178 places, 141/492 transitions.
Stuttering acceptance computed with spot in 175 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p2), (NOT p1)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m96-LTLFireability-10
Product exploration explored 100000 steps with 37307 reset in 208 ms.
Product exploration explored 100000 steps with 37265 reset in 219 ms.
Computed a total of 17 stabilizing places and 23 stable transitions
Graph (complete) has 350 edges and 104 vertex of which 103 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 17 stabilizing places and 23 stable transitions
Knowledge obtained : [(AND p0 p2 p1), (X p2), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (X p2)), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 135 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter sensitive) to 4 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 157 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p2), (NOT p1)]
RANDOM walk for 40000 steps (9020 resets) in 128 ms. (310 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (1924 resets) in 216 ms. (184 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (1877 resets) in 224 ms. (177 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (1820 resets) in 198 ms. (201 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (4063 resets) in 133 ms. (298 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (1879 resets) in 213 ms. (186 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 206322 steps, run timeout after 3001 ms. (steps per millisecond=68 ) properties seen :1 out of 5
Probabilistic random walk after 206322 steps, saw 90374 distinct states, run finished after 3004 ms. (steps per millisecond=68 ) properties seen :1
[2024-05-28 21:56:41] [INFO ] Invariant cache hit.
[2024-05-28 21:56:41] [INFO ] State equation strengthened by 69 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 60/63 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 11/74 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 4/78 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/78 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 124/202 variables, 78/82 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/202 variables, 52/134 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/202 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem apf1 is UNSAT
At refinement iteration 10 (OVERLAPS) 43/245 variables, 26/160 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/245 variables, 17/177 constraints. Problems are: Problem set: 1 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/245 variables, 0/177 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 0/245 variables, 0/177 constraints. Problems are: Problem set: 1 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 245/245 variables, and 177 constraints, problems are : Problem set: 1 solved, 3 unsolved in 269 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 104/104 constraints, ReadFeed: 69/69 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 60/63 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 11/74 variables, 2/3 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 4/78 variables, 1/4 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/78 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 124/202 variables, 78/82 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/202 variables, 52/134 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/202 variables, 0/134 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 43/245 variables, 26/160 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/245 variables, 17/177 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/245 variables, 3/180 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/245 variables, 0/180 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 0/245 variables, 0/180 constraints. Problems are: Problem set: 1 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 245/245 variables, and 180 constraints, problems are : Problem set: 1 solved, 3 unsolved in 471 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 104/104 constraints, ReadFeed: 69/69 constraints, PredecessorRefiner: 3/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 755ms problems are : Problem set: 1 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 12815 ms.
Support contains 3 out of 104 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 104/104 places, 141/141 transitions.
Graph (complete) has 314 edges and 104 vertex of which 103 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 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 103 transition count 139
Applied a total of 3 rules in 4 ms. Remains 103 /104 variables (removed 1) and now considering 139/141 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 103/104 places, 139/141 transitions.
RANDOM walk for 40000 steps (8987 resets) in 419 ms. (95 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (1888 resets) in 46 ms. (851 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40001 steps (1869 resets) in 84 ms. (470 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (1868 resets) in 269 ms. (148 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 348247 steps, run timeout after 3001 ms. (steps per millisecond=116 ) properties seen :0 out of 3
Probabilistic random walk after 348247 steps, saw 150236 distinct states, run finished after 3001 ms. (steps per millisecond=116 ) properties seen :0
// Phase 1: matrix 139 rows 103 cols
[2024-05-28 21:56:58] [INFO ] Computed 3 invariants in 1 ms
[2024-05-28 21:56:58] [INFO ] State equation strengthened by 67 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 96/99 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 24/27 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 137/236 variables, 94/121 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/236 variables, 1/122 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/236 variables, 43/165 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/236 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 6/242 variables, 2/167 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/242 variables, 6/173 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/242 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 0/242 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 242/242 variables, and 173 constraints, problems are : Problem set: 0 solved, 3 unsolved in 226 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 103/103 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 96/99 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 24/27 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 137/236 variables, 94/121 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/236 variables, 1/122 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/236 variables, 43/165 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/236 variables, 3/168 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/236 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 6/242 variables, 2/170 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/242 variables, 6/176 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/242 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 0/242 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 242/242 variables, and 176 constraints, problems are : Problem set: 0 solved, 3 unsolved in 401 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 103/103 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 639ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 18869 ms.
Support contains 3 out of 103 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 103/103 places, 139/139 transitions.
Applied a total of 0 rules in 4 ms. Remains 103 /103 variables (removed 0) and now considering 139/139 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 103/103 places, 139/139 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 103/103 places, 139/139 transitions.
Applied a total of 0 rules in 3 ms. Remains 103 /103 variables (removed 0) and now considering 139/139 (removed 0) transitions.
[2024-05-28 21:57:17] [INFO ] Invariant cache hit.
[2024-05-28 21:57:17] [INFO ] Implicit Places using invariants in 115 ms returned []
[2024-05-28 21:57:17] [INFO ] Invariant cache hit.
[2024-05-28 21:57:17] [INFO ] State equation strengthened by 67 read => feed constraints.
[2024-05-28 21:57:18] [INFO ] Implicit Places using invariants and state equation in 347 ms returned []
Implicit Place search using SMT with State Equation took 463 ms to find 0 implicit places.
[2024-05-28 21:57:18] [INFO ] Redundant transitions in 1 ms returned []
Running 138 sub problems to find dead transitions.
[2024-05-28 21:57:18] [INFO ] Invariant cache hit.
[2024-05-28 21:57:18] [INFO ] State equation strengthened by 67 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 2 (OVERLAPS) 1/103 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 4 (OVERLAPS) 139/242 variables, 103/106 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/242 variables, 67/173 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/242 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 7 (OVERLAPS) 0/242 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 138 unsolved
No progress, stopping.
After SMT solving in domain Real declared 242/242 variables, and 173 constraints, problems are : Problem set: 0 solved, 138 unsolved in 5207 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 103/103 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 138/138 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 138 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 2 (OVERLAPS) 1/103 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 4 (OVERLAPS) 139/242 variables, 103/106 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/242 variables, 67/173 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/242 variables, 138/311 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/242 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 8 (OVERLAPS) 0/242 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 138 unsolved
No progress, stopping.
After SMT solving in domain Int declared 242/242 variables, and 311 constraints, problems are : Problem set: 0 solved, 138 unsolved in 9023 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 103/103 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 138/138 constraints, Known Traps: 0/0 constraints]
After SMT, in 14388ms problems are : Problem set: 0 solved, 138 unsolved
Search for dead transitions found 0 dead transitions in 14390ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14864 ms. Remains : 103/103 places, 139/139 transitions.
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 103 transition count 132
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 13 place count 97 transition count 132
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 97 transition count 117
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 82 transition count 117
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 57 place count 75 transition count 110
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 59 place count 74 transition count 119
Applied a total of 59 rules in 17 ms. Remains 74 /103 variables (removed 29) and now considering 119/139 (removed 20) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 119 rows 74 cols
[2024-05-28 21:57:32] [INFO ] Computed 3 invariants in 1 ms
[2024-05-28 21:57:32] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-28 21:57:32] [INFO ] After 116ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-28 21:57:32] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-28 21:57:32] [INFO ] After 97ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
TRAPS : Iteration 0
[2024-05-28 21:57:32] [INFO ] After 170ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
[2024-05-28 21:57:33] [INFO ] After 284ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Over-approximation ignoring read arcs solved 0 properties in 427 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p2 p1), (X p2), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (X p2)), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (G (OR p0 p1))]
False Knowledge obtained : [(F (NOT p2))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 12 factoid took 198 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter sensitive) to 6 states, 15 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 242 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p2), (NOT p1), false, false]
Stuttering acceptance computed with spot in 241 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p2), (NOT p1), false, false]
Support contains 5 out of 104 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 104/104 places, 141/141 transitions.
Applied a total of 0 rules in 3 ms. Remains 104 /104 variables (removed 0) and now considering 141/141 (removed 0) transitions.
// Phase 1: matrix 141 rows 104 cols
[2024-05-28 21:57:33] [INFO ] Computed 4 invariants in 1 ms
[2024-05-28 21:57:33] [INFO ] Implicit Places using invariants in 109 ms returned []
[2024-05-28 21:57:33] [INFO ] Invariant cache hit.
[2024-05-28 21:57:33] [INFO ] State equation strengthened by 69 read => feed constraints.
[2024-05-28 21:57:34] [INFO ] Implicit Places using invariants and state equation in 336 ms returned []
Implicit Place search using SMT with State Equation took 448 ms to find 0 implicit places.
[2024-05-28 21:57:34] [INFO ] Redundant transitions in 0 ms returned []
Running 140 sub problems to find dead transitions.
[2024-05-28 21:57:34] [INFO ] Invariant cache hit.
[2024-05-28 21:57:34] [INFO ] State equation strengthened by 69 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 3 (OVERLAPS) 1/104 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 5 (OVERLAPS) 141/245 variables, 104/108 constraints. Problems are: Problem set: 0 solved, 140 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/245 variables, 69/177 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/245 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 8 (OVERLAPS) 0/245 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 140 unsolved
No progress, stopping.
After SMT solving in domain Real declared 245/245 variables, and 177 constraints, problems are : Problem set: 0 solved, 140 unsolved in 4673 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 104/104 constraints, ReadFeed: 69/69 constraints, PredecessorRefiner: 140/140 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 140 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 3 (OVERLAPS) 1/104 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 5 (OVERLAPS) 141/245 variables, 104/108 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/245 variables, 69/177 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/245 variables, 140/317 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/245 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 9 (OVERLAPS) 0/245 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 140 unsolved
No progress, stopping.
After SMT solving in domain Int declared 245/245 variables, and 317 constraints, problems are : Problem set: 0 solved, 140 unsolved in 9388 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 104/104 constraints, ReadFeed: 69/69 constraints, PredecessorRefiner: 140/140 constraints, Known Traps: 0/0 constraints]
After SMT, in 14224ms problems are : Problem set: 0 solved, 140 unsolved
Search for dead transitions found 0 dead transitions in 14226ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 14685 ms. Remains : 104/104 places, 141/141 transitions.
Computed a total of 17 stabilizing places and 23 stable transitions
Graph (complete) has 350 edges and 104 vertex of which 103 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 17 stabilizing places and 23 stable transitions
Knowledge obtained : [(AND p0 p2 p1), (X p2), (X p0), (X (NOT (AND (NOT p2) p0 p1))), (X (AND p2 p0 p1)), (X p1), (X (X p2)), (X (X p0)), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X (AND p2 p0 p1))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 156 ms. Reduced automaton from 6 states, 15 edges and 3 AP (stutter insensitive) to 6 states, 15 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 234 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p2), (NOT p1), false, false]
RANDOM walk for 40000 steps (9014 resets) in 558 ms. (71 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (1971 resets) in 334 ms. (119 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (4069 resets) in 437 ms. (91 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (1878 resets) in 467 ms. (85 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (4081 resets) in 381 ms. (104 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (4110 resets) in 419 ms. (95 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (1905 resets) in 339 ms. (117 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 358338 steps, run timeout after 3001 ms. (steps per millisecond=119 ) properties seen :3 out of 6
Probabilistic random walk after 358338 steps, saw 154793 distinct states, run finished after 3005 ms. (steps per millisecond=119 ) properties seen :3
[2024-05-28 21:57:53] [INFO ] Invariant cache hit.
[2024-05-28 21:57:53] [INFO ] State equation strengthened by 69 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 60/63 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 11/74 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 4/78 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/78 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 124/202 variables, 78/82 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/202 variables, 52/134 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/202 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 43/245 variables, 26/160 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/245 variables, 17/177 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/245 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 0/245 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 245/245 variables, and 177 constraints, problems are : Problem set: 0 solved, 3 unsolved in 234 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 104/104 constraints, ReadFeed: 69/69 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 60/63 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 11/74 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 4/78 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/78 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 124/202 variables, 78/82 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/202 variables, 52/134 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/202 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 43/245 variables, 26/160 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/245 variables, 17/177 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/245 variables, 3/180 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/245 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 0/245 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 245/245 variables, and 180 constraints, problems are : Problem set: 0 solved, 3 unsolved in 424 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 104/104 constraints, ReadFeed: 69/69 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 684ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 12423 ms.
Support contains 3 out of 104 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 104/104 places, 141/141 transitions.
Graph (complete) has 314 edges and 104 vertex of which 103 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 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 103 transition count 139
Applied a total of 3 rules in 6 ms. Remains 103 /104 variables (removed 1) and now considering 139/141 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 103/104 places, 139/141 transitions.
RANDOM walk for 40000 steps (9068 resets) in 434 ms. (91 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (1879 resets) in 39 ms. (1000 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (1915 resets) in 117 ms. (339 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (1939 resets) in 45 ms. (869 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 366897 steps, run timeout after 3001 ms. (steps per millisecond=122 ) properties seen :0 out of 3
Probabilistic random walk after 366897 steps, saw 158511 distinct states, run finished after 3001 ms. (steps per millisecond=122 ) properties seen :0
// Phase 1: matrix 139 rows 103 cols
[2024-05-28 21:58:09] [INFO ] Computed 3 invariants in 1 ms
[2024-05-28 21:58:09] [INFO ] State equation strengthened by 67 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 96/99 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 24/27 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 137/236 variables, 94/121 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/236 variables, 1/122 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/236 variables, 43/165 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/236 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 6/242 variables, 2/167 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/242 variables, 6/173 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/242 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 0/242 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 242/242 variables, and 173 constraints, problems are : Problem set: 0 solved, 3 unsolved in 214 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 103/103 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 96/99 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 24/27 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 137/236 variables, 94/121 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/236 variables, 1/122 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/236 variables, 43/165 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/236 variables, 3/168 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/236 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 6/242 variables, 2/170 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/242 variables, 6/176 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/242 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 0/242 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 242/242 variables, and 176 constraints, problems are : Problem set: 0 solved, 3 unsolved in 406 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 103/103 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 663ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 17979 ms.
Support contains 3 out of 103 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 103/103 places, 139/139 transitions.
Applied a total of 0 rules in 3 ms. Remains 103 /103 variables (removed 0) and now considering 139/139 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 103/103 places, 139/139 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 103/103 places, 139/139 transitions.
Applied a total of 0 rules in 2 ms. Remains 103 /103 variables (removed 0) and now considering 139/139 (removed 0) transitions.
[2024-05-28 21:58:28] [INFO ] Invariant cache hit.
[2024-05-28 21:58:28] [INFO ] Implicit Places using invariants in 113 ms returned []
[2024-05-28 21:58:28] [INFO ] Invariant cache hit.
[2024-05-28 21:58:28] [INFO ] State equation strengthened by 67 read => feed constraints.
[2024-05-28 21:58:28] [INFO ] Implicit Places using invariants and state equation in 296 ms returned []
Implicit Place search using SMT with State Equation took 434 ms to find 0 implicit places.
[2024-05-28 21:58:28] [INFO ] Redundant transitions in 0 ms returned []
Running 138 sub problems to find dead transitions.
[2024-05-28 21:58:28] [INFO ] Invariant cache hit.
[2024-05-28 21:58:28] [INFO ] State equation strengthened by 67 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 2 (OVERLAPS) 1/103 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 4 (OVERLAPS) 139/242 variables, 103/106 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/242 variables, 67/173 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/242 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 7 (OVERLAPS) 0/242 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 138 unsolved
No progress, stopping.
After SMT solving in domain Real declared 242/242 variables, and 173 constraints, problems are : Problem set: 0 solved, 138 unsolved in 4836 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 103/103 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 138/138 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 138 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 2 (OVERLAPS) 1/103 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 4 (OVERLAPS) 139/242 variables, 103/106 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/242 variables, 67/173 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/242 variables, 138/311 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/242 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 8 (OVERLAPS) 0/242 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 138 unsolved
No progress, stopping.
After SMT solving in domain Int declared 242/242 variables, and 311 constraints, problems are : Problem set: 0 solved, 138 unsolved in 9117 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 103/103 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 138/138 constraints, Known Traps: 0/0 constraints]
After SMT, in 14107ms problems are : Problem set: 0 solved, 138 unsolved
Search for dead transitions found 0 dead transitions in 14109ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14553 ms. Remains : 103/103 places, 139/139 transitions.
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 103 transition count 132
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 13 place count 97 transition count 132
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 97 transition count 117
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 82 transition count 117
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 57 place count 75 transition count 110
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 59 place count 74 transition count 119
Applied a total of 59 rules in 7 ms. Remains 74 /103 variables (removed 29) and now considering 119/139 (removed 20) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 119 rows 74 cols
[2024-05-28 21:58:42] [INFO ] Computed 3 invariants in 1 ms
[2024-05-28 21:58:42] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-28 21:58:42] [INFO ] After 123ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-28 21:58:42] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-28 21:58:42] [INFO ] After 103ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
TRAPS : Iteration 0
[2024-05-28 21:58:43] [INFO ] After 174ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
[2024-05-28 21:58:43] [INFO ] After 290ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Over-approximation ignoring read arcs solved 0 properties in 432 ms.
Knowledge obtained : [(AND p0 p2 p1), (X p2), (X p0), (X (NOT (AND (NOT p2) p0 p1))), (X (AND p2 p0 p1)), (X p1), (X (X p2)), (X (X p0)), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X (AND p2 p0 p1))), (X (X p1))]
False Knowledge obtained : [(F (NOT p2)), (F (NOT (AND p1 p2 p0))), (F (NOT (OR (NOT p1) p2 (NOT p0))))]
Knowledge based reduction with 11 factoid took 340 ms. Reduced automaton from 6 states, 15 edges and 3 AP (stutter insensitive) to 6 states, 15 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 245 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p2), (NOT p1), false, false]
Stuttering acceptance computed with spot in 235 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p2), (NOT p1), false, false]
Stuttering acceptance computed with spot in 242 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p2), (NOT p1), false, false]
Product exploration explored 100000 steps with 22416 reset in 185 ms.
Product exploration explored 100000 steps with 22481 reset in 202 ms.
Support contains 5 out of 104 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 104/104 places, 141/141 transitions.
Applied a total of 0 rules in 3 ms. Remains 104 /104 variables (removed 0) and now considering 141/141 (removed 0) transitions.
// Phase 1: matrix 141 rows 104 cols
[2024-05-28 21:58:44] [INFO ] Computed 4 invariants in 1 ms
[2024-05-28 21:58:44] [INFO ] Implicit Places using invariants in 113 ms returned []
[2024-05-28 21:58:44] [INFO ] Invariant cache hit.
[2024-05-28 21:58:44] [INFO ] State equation strengthened by 69 read => feed constraints.
[2024-05-28 21:58:45] [INFO ] Implicit Places using invariants and state equation in 344 ms returned []
Implicit Place search using SMT with State Equation took 460 ms to find 0 implicit places.
[2024-05-28 21:58:45] [INFO ] Redundant transitions in 0 ms returned []
Running 140 sub problems to find dead transitions.
[2024-05-28 21:58:45] [INFO ] Invariant cache hit.
[2024-05-28 21:58:45] [INFO ] State equation strengthened by 69 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 3 (OVERLAPS) 1/104 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 5 (OVERLAPS) 141/245 variables, 104/108 constraints. Problems are: Problem set: 0 solved, 140 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/245 variables, 69/177 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/245 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 8 (OVERLAPS) 0/245 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 140 unsolved
No progress, stopping.
After SMT solving in domain Real declared 245/245 variables, and 177 constraints, problems are : Problem set: 0 solved, 140 unsolved in 4665 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 104/104 constraints, ReadFeed: 69/69 constraints, PredecessorRefiner: 140/140 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 140 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 3 (OVERLAPS) 1/104 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 5 (OVERLAPS) 141/245 variables, 104/108 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/245 variables, 69/177 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/245 variables, 140/317 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/245 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 9 (OVERLAPS) 0/245 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 140 unsolved
No progress, stopping.
After SMT solving in domain Int declared 245/245 variables, and 317 constraints, problems are : Problem set: 0 solved, 140 unsolved in 9628 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 104/104 constraints, ReadFeed: 69/69 constraints, PredecessorRefiner: 140/140 constraints, Known Traps: 0/0 constraints]
After SMT, in 14448ms problems are : Problem set: 0 solved, 140 unsolved
Search for dead transitions found 0 dead transitions in 14450ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 14920 ms. Remains : 104/104 places, 141/141 transitions.
Treatment of property SieveSingleMsgMbox-PT-d2m96-LTLFireability-10 finished in 172546 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(F(p0))||G(p1))))'
Support contains 3 out of 178 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 178/178 places, 492/492 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 156 transition count 231
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 156 transition count 231
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 66 place count 134 transition count 209
Iterating global reduction 0 with 22 rules applied. Total rules applied 88 place count 134 transition count 209
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 0 with 17 rules applied. Total rules applied 105 place count 134 transition count 192
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 116 place count 123 transition count 171
Iterating global reduction 1 with 11 rules applied. Total rules applied 127 place count 123 transition count 171
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 133 place count 123 transition count 165
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 136 place count 120 transition count 162
Iterating global reduction 2 with 3 rules applied. Total rules applied 139 place count 120 transition count 162
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 142 place count 117 transition count 159
Iterating global reduction 2 with 3 rules applied. Total rules applied 145 place count 117 transition count 159
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 147 place count 115 transition count 157
Iterating global reduction 2 with 2 rules applied. Total rules applied 149 place count 115 transition count 157
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 151 place count 113 transition count 155
Iterating global reduction 2 with 2 rules applied. Total rules applied 153 place count 113 transition count 155
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 154 place count 112 transition count 152
Iterating global reduction 2 with 1 rules applied. Total rules applied 155 place count 112 transition count 152
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 156 place count 111 transition count 151
Iterating global reduction 2 with 1 rules applied. Total rules applied 157 place count 111 transition count 151
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 158 place count 110 transition count 150
Iterating global reduction 2 with 1 rules applied. Total rules applied 159 place count 110 transition count 150
Applied a total of 159 rules in 16 ms. Remains 110 /178 variables (removed 68) and now considering 150/492 (removed 342) transitions.
// Phase 1: matrix 150 rows 110 cols
[2024-05-28 21:58:59] [INFO ] Computed 4 invariants in 1 ms
[2024-05-28 21:58:59] [INFO ] Implicit Places using invariants in 116 ms returned []
[2024-05-28 21:58:59] [INFO ] Invariant cache hit.
[2024-05-28 21:58:59] [INFO ] State equation strengthened by 74 read => feed constraints.
[2024-05-28 21:59:00] [INFO ] Implicit Places using invariants and state equation in 356 ms returned []
Implicit Place search using SMT with State Equation took 475 ms to find 0 implicit places.
Running 149 sub problems to find dead transitions.
[2024-05-28 21:59:00] [INFO ] Invariant cache hit.
[2024-05-28 21:59:00] [INFO ] State equation strengthened by 74 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/109 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/109 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 2 (OVERLAPS) 1/110 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/110 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 149 unsolved
[2024-05-28 21:59:02] [INFO ] Deduced a trap composed of 32 places in 39 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/110 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/110 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 149 unsolved
Problem TDEAD34 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD133 is UNSAT
At refinement iteration 6 (OVERLAPS) 150/260 variables, 110/115 constraints. Problems are: Problem set: 3 solved, 146 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/260 variables, 74/189 constraints. Problems are: Problem set: 3 solved, 146 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/260 variables, 0/189 constraints. Problems are: Problem set: 3 solved, 146 unsolved
[2024-05-28 21:59:05] [INFO ] Deduced a trap composed of 35 places in 66 ms of which 2 ms to minimize.
[2024-05-28 21:59:05] [INFO ] Deduced a trap composed of 32 places in 63 ms of which 2 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/260 variables, 2/191 constraints. Problems are: Problem set: 3 solved, 146 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/260 variables, 0/191 constraints. Problems are: Problem set: 3 solved, 146 unsolved
At refinement iteration 11 (OVERLAPS) 0/260 variables, 0/191 constraints. Problems are: Problem set: 3 solved, 146 unsolved
No progress, stopping.
After SMT solving in domain Real declared 260/260 variables, and 191 constraints, problems are : Problem set: 3 solved, 146 unsolved in 8231 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 110/110 constraints, ReadFeed: 74/74 constraints, PredecessorRefiner: 149/149 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 3 solved, 146 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 146 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 0/1 constraints. Problems are: Problem set: 3 solved, 146 unsolved
At refinement iteration 2 (OVERLAPS) 1/107 variables, 1/2 constraints. Problems are: Problem set: 3 solved, 146 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 1/3 constraints. Problems are: Problem set: 3 solved, 146 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/107 variables, 0/3 constraints. Problems are: Problem set: 3 solved, 146 unsolved
At refinement iteration 5 (OVERLAPS) 1/108 variables, 1/4 constraints. Problems are: Problem set: 3 solved, 146 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/108 variables, 3/7 constraints. Problems are: Problem set: 3 solved, 146 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/108 variables, 0/7 constraints. Problems are: Problem set: 3 solved, 146 unsolved
At refinement iteration 8 (OVERLAPS) 149/257 variables, 108/115 constraints. Problems are: Problem set: 3 solved, 146 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/257 variables, 73/188 constraints. Problems are: Problem set: 3 solved, 146 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/257 variables, 28/216 constraints. Problems are: Problem set: 3 solved, 146 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/257 variables, 0/216 constraints. Problems are: Problem set: 3 solved, 146 unsolved
At refinement iteration 12 (OVERLAPS) 3/260 variables, 2/218 constraints. Problems are: Problem set: 3 solved, 146 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/260 variables, 1/219 constraints. Problems are: Problem set: 3 solved, 146 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/260 variables, 118/337 constraints. Problems are: Problem set: 3 solved, 146 unsolved
[2024-05-28 21:59:14] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 1 ms to minimize.
Problem TDEAD136 is UNSAT
At refinement iteration 15 (INCLUDED_ONLY) 0/260 variables, 1/338 constraints. Problems are: Problem set: 4 solved, 145 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/260 variables, 0/338 constraints. Problems are: Problem set: 4 solved, 145 unsolved
At refinement iteration 17 (OVERLAPS) 0/260 variables, 0/338 constraints. Problems are: Problem set: 4 solved, 145 unsolved
No progress, stopping.
After SMT solving in domain Int declared 260/260 variables, and 338 constraints, problems are : Problem set: 4 solved, 145 unsolved in 15670 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 110/110 constraints, ReadFeed: 74/74 constraints, PredecessorRefiner: 146/149 constraints, Known Traps: 4/4 constraints]
After SMT, in 24087ms problems are : Problem set: 4 solved, 145 unsolved
Search for dead transitions found 4 dead transitions in 24090ms
Found 4 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 4 transitions
Dead transitions reduction (with SMT) removed 4 transitions
Starting structural reductions in LTL mode, iteration 1 : 110/178 places, 146/492 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 106 transition count 146
Applied a total of 4 rules in 4 ms. Remains 106 /110 variables (removed 4) and now considering 146/146 (removed 0) transitions.
// Phase 1: matrix 146 rows 106 cols
[2024-05-28 21:59:24] [INFO ] Computed 4 invariants in 1 ms
[2024-05-28 21:59:24] [INFO ] Implicit Places using invariants in 132 ms returned []
[2024-05-28 21:59:24] [INFO ] Invariant cache hit.
[2024-05-28 21:59:24] [INFO ] State equation strengthened by 73 read => feed constraints.
[2024-05-28 21:59:24] [INFO ] Implicit Places using invariants and state equation in 371 ms returned []
Implicit Place search using SMT with State Equation took 506 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 106/178 places, 146/492 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 25092 ms. Remains : 106/178 places, 146/492 transitions.
Stuttering acceptance computed with spot in 163 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m96-LTLFireability-11
Product exploration explored 100000 steps with 33333 reset in 169 ms.
Product exploration explored 100000 steps with 33333 reset in 179 ms.
Computed a total of 17 stabilizing places and 23 stable transitions
Graph (complete) has 358 edges and 106 vertex of which 105 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 17 stabilizing places and 23 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT p1)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 15 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA SieveSingleMsgMbox-PT-d2m96-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SieveSingleMsgMbox-PT-d2m96-LTLFireability-11 finished in 25643 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 178 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 178/178 places, 492/492 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 155 transition count 216
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 155 transition count 216
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 69 place count 132 transition count 193
Iterating global reduction 0 with 23 rules applied. Total rules applied 92 place count 132 transition count 193
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 0 with 15 rules applied. Total rules applied 107 place count 132 transition count 178
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 119 place count 120 transition count 155
Iterating global reduction 1 with 12 rules applied. Total rules applied 131 place count 120 transition count 155
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 138 place count 120 transition count 148
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 142 place count 116 transition count 144
Iterating global reduction 2 with 4 rules applied. Total rules applied 146 place count 116 transition count 144
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 150 place count 112 transition count 140
Iterating global reduction 2 with 4 rules applied. Total rules applied 154 place count 112 transition count 140
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 157 place count 109 transition count 137
Iterating global reduction 2 with 3 rules applied. Total rules applied 160 place count 109 transition count 137
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 162 place count 109 transition count 135
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 165 place count 106 transition count 132
Iterating global reduction 3 with 3 rules applied. Total rules applied 168 place count 106 transition count 132
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 169 place count 105 transition count 129
Iterating global reduction 3 with 1 rules applied. Total rules applied 170 place count 105 transition count 129
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 171 place count 104 transition count 128
Iterating global reduction 3 with 1 rules applied. Total rules applied 172 place count 104 transition count 128
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 173 place count 103 transition count 127
Iterating global reduction 3 with 1 rules applied. Total rules applied 174 place count 103 transition count 127
Applied a total of 174 rules in 30 ms. Remains 103 /178 variables (removed 75) and now considering 127/492 (removed 365) transitions.
// Phase 1: matrix 127 rows 103 cols
[2024-05-28 21:59:25] [INFO ] Computed 4 invariants in 2 ms
[2024-05-28 21:59:25] [INFO ] Implicit Places using invariants in 104 ms returned []
[2024-05-28 21:59:25] [INFO ] Invariant cache hit.
[2024-05-28 21:59:25] [INFO ] State equation strengthened by 56 read => feed constraints.
[2024-05-28 21:59:25] [INFO ] Implicit Places using invariants and state equation in 286 ms returned []
Implicit Place search using SMT with State Equation took 392 ms to find 0 implicit places.
[2024-05-28 21:59:25] [INFO ] Redundant transitions in 0 ms returned []
Running 126 sub problems to find dead transitions.
[2024-05-28 21:59:25] [INFO ] Invariant cache hit.
[2024-05-28 21:59:25] [INFO ] State equation strengthened by 56 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 2 (OVERLAPS) 1/103 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 126 unsolved
[2024-05-28 21:59:27] [INFO ] Deduced a trap composed of 30 places in 42 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/103 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 126 unsolved
Problem TDEAD34 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD112 is UNSAT
At refinement iteration 6 (OVERLAPS) 127/230 variables, 103/108 constraints. Problems are: Problem set: 3 solved, 123 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/230 variables, 56/164 constraints. Problems are: Problem set: 3 solved, 123 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/230 variables, 0/164 constraints. Problems are: Problem set: 3 solved, 123 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/230 variables, 0/164 constraints. Problems are: Problem set: 3 solved, 123 unsolved
No progress, stopping.
After SMT solving in domain Real declared 230/230 variables, and 164 constraints, problems are : Problem set: 3 solved, 123 unsolved in 5594 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 103/103 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 126/126 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 3 solved, 123 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 123 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 0/1 constraints. Problems are: Problem set: 3 solved, 123 unsolved
At refinement iteration 2 (OVERLAPS) 1/100 variables, 1/2 constraints. Problems are: Problem set: 3 solved, 123 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 1/3 constraints. Problems are: Problem set: 3 solved, 123 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 0/3 constraints. Problems are: Problem set: 3 solved, 123 unsolved
At refinement iteration 5 (OVERLAPS) 1/101 variables, 1/4 constraints. Problems are: Problem set: 3 solved, 123 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/101 variables, 1/5 constraints. Problems are: Problem set: 3 solved, 123 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/101 variables, 0/5 constraints. Problems are: Problem set: 3 solved, 123 unsolved
At refinement iteration 8 (OVERLAPS) 126/227 variables, 101/106 constraints. Problems are: Problem set: 3 solved, 123 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/227 variables, 55/161 constraints. Problems are: Problem set: 3 solved, 123 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/227 variables, 26/187 constraints. Problems are: Problem set: 3 solved, 123 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/227 variables, 0/187 constraints. Problems are: Problem set: 3 solved, 123 unsolved
At refinement iteration 12 (OVERLAPS) 3/230 variables, 2/189 constraints. Problems are: Problem set: 3 solved, 123 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/230 variables, 1/190 constraints. Problems are: Problem set: 3 solved, 123 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/230 variables, 97/287 constraints. Problems are: Problem set: 3 solved, 123 unsolved
[2024-05-28 21:59:36] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 1 ms to minimize.
Problem TDEAD115 is UNSAT
At refinement iteration 15 (INCLUDED_ONLY) 0/230 variables, 1/288 constraints. Problems are: Problem set: 4 solved, 122 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/230 variables, 0/288 constraints. Problems are: Problem set: 4 solved, 122 unsolved
At refinement iteration 17 (OVERLAPS) 0/230 variables, 0/288 constraints. Problems are: Problem set: 4 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Int declared 230/230 variables, and 288 constraints, problems are : Problem set: 4 solved, 122 unsolved in 12488 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 103/103 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 123/126 constraints, Known Traps: 2/2 constraints]
After SMT, in 18223ms problems are : Problem set: 4 solved, 122 unsolved
Search for dead transitions found 4 dead transitions in 18226ms
Found 4 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 4 transitions
Dead transitions reduction (with SMT) removed 4 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 103/178 places, 123/492 transitions.
Graph (complete) has 327 edges and 103 vertex of which 99 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 5 ms. Remains 99 /103 variables (removed 4) and now considering 123/123 (removed 0) transitions.
// Phase 1: matrix 123 rows 99 cols
[2024-05-28 21:59:43] [INFO ] Computed 4 invariants in 1 ms
[2024-05-28 21:59:43] [INFO ] Implicit Places using invariants in 96 ms returned []
[2024-05-28 21:59:43] [INFO ] Invariant cache hit.
[2024-05-28 21:59:44] [INFO ] State equation strengthened by 55 read => feed constraints.
[2024-05-28 21:59:44] [INFO ] Implicit Places using invariants and state equation in 266 ms returned []
Implicit Place search using SMT with State Equation took 366 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 99/178 places, 123/492 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 19027 ms. Remains : 99/178 places, 123/492 transitions.
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m96-LTLFireability-12
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d2m96-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d2m96-LTLFireability-12 finished in 19111 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 178 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 178/178 places, 492/492 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 155 transition count 216
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 155 transition count 216
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 69 place count 132 transition count 193
Iterating global reduction 0 with 23 rules applied. Total rules applied 92 place count 132 transition count 193
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 0 with 15 rules applied. Total rules applied 107 place count 132 transition count 178
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 119 place count 120 transition count 155
Iterating global reduction 1 with 12 rules applied. Total rules applied 131 place count 120 transition count 155
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 138 place count 120 transition count 148
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 142 place count 116 transition count 144
Iterating global reduction 2 with 4 rules applied. Total rules applied 146 place count 116 transition count 144
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 150 place count 112 transition count 140
Iterating global reduction 2 with 4 rules applied. Total rules applied 154 place count 112 transition count 140
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 157 place count 109 transition count 137
Iterating global reduction 2 with 3 rules applied. Total rules applied 160 place count 109 transition count 137
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 162 place count 109 transition count 135
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 165 place count 106 transition count 132
Iterating global reduction 3 with 3 rules applied. Total rules applied 168 place count 106 transition count 132
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 169 place count 105 transition count 129
Iterating global reduction 3 with 1 rules applied. Total rules applied 170 place count 105 transition count 129
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 171 place count 104 transition count 128
Iterating global reduction 3 with 1 rules applied. Total rules applied 172 place count 104 transition count 128
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 173 place count 103 transition count 127
Iterating global reduction 3 with 1 rules applied. Total rules applied 174 place count 103 transition count 127
Applied a total of 174 rules in 16 ms. Remains 103 /178 variables (removed 75) and now considering 127/492 (removed 365) transitions.
// Phase 1: matrix 127 rows 103 cols
[2024-05-28 21:59:44] [INFO ] Computed 4 invariants in 1 ms
[2024-05-28 21:59:44] [INFO ] Implicit Places using invariants in 101 ms returned []
[2024-05-28 21:59:44] [INFO ] Invariant cache hit.
[2024-05-28 21:59:44] [INFO ] State equation strengthened by 56 read => feed constraints.
[2024-05-28 21:59:44] [INFO ] Implicit Places using invariants and state equation in 260 ms returned []
Implicit Place search using SMT with State Equation took 364 ms to find 0 implicit places.
Running 126 sub problems to find dead transitions.
[2024-05-28 21:59:44] [INFO ] Invariant cache hit.
[2024-05-28 21:59:44] [INFO ] State equation strengthened by 56 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 2 (OVERLAPS) 1/103 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 126 unsolved
[2024-05-28 21:59:46] [INFO ] Deduced a trap composed of 30 places in 38 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/103 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 126 unsolved
Problem TDEAD34 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD112 is UNSAT
At refinement iteration 6 (OVERLAPS) 127/230 variables, 103/108 constraints. Problems are: Problem set: 3 solved, 123 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/230 variables, 56/164 constraints. Problems are: Problem set: 3 solved, 123 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/230 variables, 0/164 constraints. Problems are: Problem set: 3 solved, 123 unsolved
At refinement iteration 9 (OVERLAPS) 0/230 variables, 0/164 constraints. Problems are: Problem set: 3 solved, 123 unsolved
No progress, stopping.
After SMT solving in domain Real declared 230/230 variables, and 164 constraints, problems are : Problem set: 3 solved, 123 unsolved in 5343 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 103/103 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 126/126 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 3 solved, 123 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 123 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 0/1 constraints. Problems are: Problem set: 3 solved, 123 unsolved
At refinement iteration 2 (OVERLAPS) 1/100 variables, 1/2 constraints. Problems are: Problem set: 3 solved, 123 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 1/3 constraints. Problems are: Problem set: 3 solved, 123 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 0/3 constraints. Problems are: Problem set: 3 solved, 123 unsolved
At refinement iteration 5 (OVERLAPS) 1/101 variables, 1/4 constraints. Problems are: Problem set: 3 solved, 123 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/101 variables, 1/5 constraints. Problems are: Problem set: 3 solved, 123 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/101 variables, 0/5 constraints. Problems are: Problem set: 3 solved, 123 unsolved
At refinement iteration 8 (OVERLAPS) 126/227 variables, 101/106 constraints. Problems are: Problem set: 3 solved, 123 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/227 variables, 55/161 constraints. Problems are: Problem set: 3 solved, 123 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/227 variables, 26/187 constraints. Problems are: Problem set: 3 solved, 123 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/227 variables, 0/187 constraints. Problems are: Problem set: 3 solved, 123 unsolved
At refinement iteration 12 (OVERLAPS) 3/230 variables, 2/189 constraints. Problems are: Problem set: 3 solved, 123 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/230 variables, 1/190 constraints. Problems are: Problem set: 3 solved, 123 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/230 variables, 97/287 constraints. Problems are: Problem set: 3 solved, 123 unsolved
[2024-05-28 21:59:55] [INFO ] Deduced a trap composed of 23 places in 26 ms of which 1 ms to minimize.
Problem TDEAD115 is UNSAT
At refinement iteration 15 (INCLUDED_ONLY) 0/230 variables, 1/288 constraints. Problems are: Problem set: 4 solved, 122 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/230 variables, 0/288 constraints. Problems are: Problem set: 4 solved, 122 unsolved
At refinement iteration 17 (OVERLAPS) 0/230 variables, 0/288 constraints. Problems are: Problem set: 4 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Int declared 230/230 variables, and 288 constraints, problems are : Problem set: 4 solved, 122 unsolved in 12471 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 103/103 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 123/126 constraints, Known Traps: 2/2 constraints]
After SMT, in 17948ms problems are : Problem set: 4 solved, 122 unsolved
Search for dead transitions found 4 dead transitions in 17951ms
Found 4 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 4 transitions
Dead transitions reduction (with SMT) removed 4 transitions
Starting structural reductions in LTL mode, iteration 1 : 103/178 places, 123/492 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 99 transition count 123
Applied a total of 4 rules in 1 ms. Remains 99 /103 variables (removed 4) and now considering 123/123 (removed 0) transitions.
// Phase 1: matrix 123 rows 99 cols
[2024-05-28 22:00:02] [INFO ] Computed 4 invariants in 1 ms
[2024-05-28 22:00:02] [INFO ] Implicit Places using invariants in 86 ms returned []
[2024-05-28 22:00:02] [INFO ] Invariant cache hit.
[2024-05-28 22:00:02] [INFO ] State equation strengthened by 55 read => feed constraints.
[2024-05-28 22:00:02] [INFO ] Implicit Places using invariants and state equation in 270 ms returned []
Implicit Place search using SMT with State Equation took 358 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 99/178 places, 123/492 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 18692 ms. Remains : 99/178 places, 123/492 transitions.
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m96-LTLFireability-13
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d2m96-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d2m96-LTLFireability-13 finished in 18780 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0||F(p1)))))'
Support contains 4 out of 178 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 178/178 places, 492/492 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 156 transition count 217
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 156 transition count 217
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 66 place count 134 transition count 195
Iterating global reduction 0 with 22 rules applied. Total rules applied 88 place count 134 transition count 195
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 0 with 13 rules applied. Total rules applied 101 place count 134 transition count 182
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 113 place count 122 transition count 159
Iterating global reduction 1 with 12 rules applied. Total rules applied 125 place count 122 transition count 159
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 132 place count 122 transition count 152
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 136 place count 118 transition count 148
Iterating global reduction 2 with 4 rules applied. Total rules applied 140 place count 118 transition count 148
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 144 place count 114 transition count 144
Iterating global reduction 2 with 4 rules applied. Total rules applied 148 place count 114 transition count 144
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 151 place count 111 transition count 141
Iterating global reduction 2 with 3 rules applied. Total rules applied 154 place count 111 transition count 141
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 156 place count 111 transition count 139
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 159 place count 108 transition count 136
Iterating global reduction 3 with 3 rules applied. Total rules applied 162 place count 108 transition count 136
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 163 place count 107 transition count 133
Iterating global reduction 3 with 1 rules applied. Total rules applied 164 place count 107 transition count 133
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 165 place count 106 transition count 132
Iterating global reduction 3 with 1 rules applied. Total rules applied 166 place count 106 transition count 132
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 167 place count 105 transition count 131
Iterating global reduction 3 with 1 rules applied. Total rules applied 168 place count 105 transition count 131
Applied a total of 168 rules in 23 ms. Remains 105 /178 variables (removed 73) and now considering 131/492 (removed 361) transitions.
// Phase 1: matrix 131 rows 105 cols
[2024-05-28 22:00:03] [INFO ] Computed 4 invariants in 3 ms
[2024-05-28 22:00:03] [INFO ] Implicit Places using invariants in 105 ms returned []
[2024-05-28 22:00:03] [INFO ] Invariant cache hit.
[2024-05-28 22:00:03] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-05-28 22:00:03] [INFO ] Implicit Places using invariants and state equation in 273 ms returned []
Implicit Place search using SMT with State Equation took 381 ms to find 0 implicit places.
[2024-05-28 22:00:03] [INFO ] Redundant transitions in 1 ms returned []
Running 130 sub problems to find dead transitions.
[2024-05-28 22:00:03] [INFO ] Invariant cache hit.
[2024-05-28 22:00:03] [INFO ] State equation strengthened by 58 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 2 (OVERLAPS) 1/105 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 130 unsolved
[2024-05-28 22:00:04] [INFO ] Deduced a trap composed of 31 places in 38 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/105 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 130 unsolved
Problem TDEAD34 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD115 is UNSAT
At refinement iteration 6 (OVERLAPS) 131/236 variables, 105/110 constraints. Problems are: Problem set: 3 solved, 127 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/236 variables, 58/168 constraints. Problems are: Problem set: 3 solved, 127 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/236 variables, 0/168 constraints. Problems are: Problem set: 3 solved, 127 unsolved
[2024-05-28 22:00:06] [INFO ] Deduced a trap composed of 33 places in 57 ms of which 1 ms to minimize.
[2024-05-28 22:00:06] [INFO ] Deduced a trap composed of 31 places in 61 ms of which 1 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/236 variables, 2/170 constraints. Problems are: Problem set: 3 solved, 127 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/236 variables, 0/170 constraints. Problems are: Problem set: 3 solved, 127 unsolved
At refinement iteration 11 (OVERLAPS) 0/236 variables, 0/170 constraints. Problems are: Problem set: 3 solved, 127 unsolved
No progress, stopping.
After SMT solving in domain Real declared 236/236 variables, and 170 constraints, problems are : Problem set: 3 solved, 127 unsolved in 5638 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 105/105 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 130/130 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 3 solved, 127 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 127 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 0/1 constraints. Problems are: Problem set: 3 solved, 127 unsolved
At refinement iteration 2 (OVERLAPS) 1/102 variables, 1/2 constraints. Problems are: Problem set: 3 solved, 127 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/102 variables, 1/3 constraints. Problems are: Problem set: 3 solved, 127 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 0/3 constraints. Problems are: Problem set: 3 solved, 127 unsolved
At refinement iteration 5 (OVERLAPS) 1/103 variables, 1/4 constraints. Problems are: Problem set: 3 solved, 127 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/103 variables, 3/7 constraints. Problems are: Problem set: 3 solved, 127 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/103 variables, 0/7 constraints. Problems are: Problem set: 3 solved, 127 unsolved
At refinement iteration 8 (OVERLAPS) 130/233 variables, 103/110 constraints. Problems are: Problem set: 3 solved, 127 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/233 variables, 57/167 constraints. Problems are: Problem set: 3 solved, 127 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/233 variables, 27/194 constraints. Problems are: Problem set: 3 solved, 127 unsolved
[2024-05-28 22:00:12] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/233 variables, 1/195 constraints. Problems are: Problem set: 3 solved, 127 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/233 variables, 0/195 constraints. Problems are: Problem set: 3 solved, 127 unsolved
At refinement iteration 13 (OVERLAPS) 3/236 variables, 2/197 constraints. Problems are: Problem set: 3 solved, 127 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/236 variables, 1/198 constraints. Problems are: Problem set: 3 solved, 127 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/236 variables, 100/298 constraints. Problems are: Problem set: 3 solved, 127 unsolved
[2024-05-28 22:00:17] [INFO ] Deduced a trap composed of 23 places in 28 ms of which 1 ms to minimize.
Problem TDEAD118 is UNSAT
At refinement iteration 16 (INCLUDED_ONLY) 0/236 variables, 1/299 constraints. Problems are: Problem set: 4 solved, 126 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/236 variables, 0/299 constraints. Problems are: Problem set: 4 solved, 126 unsolved
At refinement iteration 18 (OVERLAPS) 0/236 variables, 0/299 constraints. Problems are: Problem set: 4 solved, 126 unsolved
No progress, stopping.
After SMT solving in domain Int declared 236/236 variables, and 299 constraints, problems are : Problem set: 4 solved, 126 unsolved in 15690 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 105/105 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 127/130 constraints, Known Traps: 5/5 constraints]
After SMT, in 21464ms problems are : Problem set: 4 solved, 126 unsolved
Search for dead transitions found 4 dead transitions in 21466ms
Found 4 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 4 transitions
Dead transitions reduction (with SMT) removed 4 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 105/178 places, 127/492 transitions.
Graph (complete) has 335 edges and 105 vertex of which 101 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 4 ms. Remains 101 /105 variables (removed 4) and now considering 127/127 (removed 0) transitions.
// Phase 1: matrix 127 rows 101 cols
[2024-05-28 22:00:24] [INFO ] Computed 4 invariants in 1 ms
[2024-05-28 22:00:25] [INFO ] Implicit Places using invariants in 97 ms returned []
[2024-05-28 22:00:25] [INFO ] Invariant cache hit.
[2024-05-28 22:00:25] [INFO ] State equation strengthened by 57 read => feed constraints.
[2024-05-28 22:00:25] [INFO ] Implicit Places using invariants and state equation in 271 ms returned []
Implicit Place search using SMT with State Equation took 370 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 101/178 places, 127/492 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 22251 ms. Remains : 101/178 places, 127/492 transitions.
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m96-LTLFireability-14
Stuttering criterion allowed to conclude after 8 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d2m96-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d2m96-LTLFireability-14 finished in 22343 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((G(F(p0)) U !p1)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(F(p0))))))'
Found a Shortening insensitive property : SieveSingleMsgMbox-PT-d2m96-LTLFireability-08
Stuttering acceptance computed with spot in 170 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 178 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 178/178 places, 492/492 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 155 transition count 216
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 155 transition count 216
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 69 place count 132 transition count 193
Iterating global reduction 0 with 23 rules applied. Total rules applied 92 place count 132 transition count 193
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 0 with 15 rules applied. Total rules applied 107 place count 132 transition count 178
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 119 place count 120 transition count 155
Iterating global reduction 1 with 12 rules applied. Total rules applied 131 place count 120 transition count 155
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 138 place count 120 transition count 148
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 142 place count 116 transition count 144
Iterating global reduction 2 with 4 rules applied. Total rules applied 146 place count 116 transition count 144
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 150 place count 112 transition count 140
Iterating global reduction 2 with 4 rules applied. Total rules applied 154 place count 112 transition count 140
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 157 place count 109 transition count 137
Iterating global reduction 2 with 3 rules applied. Total rules applied 160 place count 109 transition count 137
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 162 place count 109 transition count 135
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 165 place count 106 transition count 132
Iterating global reduction 3 with 3 rules applied. Total rules applied 168 place count 106 transition count 132
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 169 place count 105 transition count 129
Iterating global reduction 3 with 1 rules applied. Total rules applied 170 place count 105 transition count 129
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 171 place count 104 transition count 128
Iterating global reduction 3 with 1 rules applied. Total rules applied 172 place count 104 transition count 128
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 173 place count 103 transition count 127
Iterating global reduction 3 with 1 rules applied. Total rules applied 174 place count 103 transition count 127
Applied a total of 174 rules in 17 ms. Remains 103 /178 variables (removed 75) and now considering 127/492 (removed 365) transitions.
// Phase 1: matrix 127 rows 103 cols
[2024-05-28 22:00:25] [INFO ] Computed 4 invariants in 1 ms
[2024-05-28 22:00:25] [INFO ] Implicit Places using invariants in 95 ms returned []
[2024-05-28 22:00:25] [INFO ] Invariant cache hit.
[2024-05-28 22:00:26] [INFO ] State equation strengthened by 56 read => feed constraints.
[2024-05-28 22:00:26] [INFO ] Implicit Places using invariants and state equation in 279 ms returned []
Implicit Place search using SMT with State Equation took 376 ms to find 0 implicit places.
Running 126 sub problems to find dead transitions.
[2024-05-28 22:00:26] [INFO ] Invariant cache hit.
[2024-05-28 22:00:26] [INFO ] State equation strengthened by 56 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 2 (OVERLAPS) 1/103 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 126 unsolved
[2024-05-28 22:00:27] [INFO ] Deduced a trap composed of 30 places in 37 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/103 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 126 unsolved
Problem TDEAD34 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD112 is UNSAT
At refinement iteration 6 (OVERLAPS) 127/230 variables, 103/108 constraints. Problems are: Problem set: 3 solved, 123 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/230 variables, 56/164 constraints. Problems are: Problem set: 3 solved, 123 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/230 variables, 0/164 constraints. Problems are: Problem set: 3 solved, 123 unsolved
[2024-05-28 22:00:30] [INFO ] Deduced a trap composed of 33 places in 56 ms of which 1 ms to minimize.
[2024-05-28 22:00:30] [INFO ] Deduced a trap composed of 31 places in 56 ms of which 2 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/230 variables, 2/166 constraints. Problems are: Problem set: 3 solved, 123 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/230 variables, 0/166 constraints. Problems are: Problem set: 3 solved, 123 unsolved
At refinement iteration 11 (OVERLAPS) 0/230 variables, 0/166 constraints. Problems are: Problem set: 3 solved, 123 unsolved
No progress, stopping.
After SMT solving in domain Real declared 230/230 variables, and 166 constraints, problems are : Problem set: 3 solved, 123 unsolved in 6445 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 103/103 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 126/126 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 3 solved, 123 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 123 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 0/1 constraints. Problems are: Problem set: 3 solved, 123 unsolved
At refinement iteration 2 (OVERLAPS) 1/100 variables, 1/2 constraints. Problems are: Problem set: 3 solved, 123 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 1/3 constraints. Problems are: Problem set: 3 solved, 123 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 0/3 constraints. Problems are: Problem set: 3 solved, 123 unsolved
At refinement iteration 5 (OVERLAPS) 1/101 variables, 1/4 constraints. Problems are: Problem set: 3 solved, 123 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/101 variables, 3/7 constraints. Problems are: Problem set: 3 solved, 123 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/101 variables, 0/7 constraints. Problems are: Problem set: 3 solved, 123 unsolved
At refinement iteration 8 (OVERLAPS) 126/227 variables, 101/108 constraints. Problems are: Problem set: 3 solved, 123 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/227 variables, 55/163 constraints. Problems are: Problem set: 3 solved, 123 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/227 variables, 26/189 constraints. Problems are: Problem set: 3 solved, 123 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/227 variables, 0/189 constraints. Problems are: Problem set: 3 solved, 123 unsolved
At refinement iteration 12 (OVERLAPS) 3/230 variables, 2/191 constraints. Problems are: Problem set: 3 solved, 123 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/230 variables, 1/192 constraints. Problems are: Problem set: 3 solved, 123 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/230 variables, 97/289 constraints. Problems are: Problem set: 3 solved, 123 unsolved
[2024-05-28 22:00:38] [INFO ] Deduced a trap composed of 23 places in 32 ms of which 2 ms to minimize.
Problem TDEAD115 is UNSAT
At refinement iteration 15 (INCLUDED_ONLY) 0/230 variables, 1/290 constraints. Problems are: Problem set: 4 solved, 122 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/230 variables, 0/290 constraints. Problems are: Problem set: 4 solved, 122 unsolved
At refinement iteration 17 (OVERLAPS) 0/230 variables, 0/290 constraints. Problems are: Problem set: 4 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Int declared 230/230 variables, and 290 constraints, problems are : Problem set: 4 solved, 122 unsolved in 12233 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 103/103 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 123/126 constraints, Known Traps: 4/4 constraints]
After SMT, in 18811ms problems are : Problem set: 4 solved, 122 unsolved
Search for dead transitions found 4 dead transitions in 18813ms
Found 4 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 4 transitions
Dead transitions reduction (with SMT) removed 4 transitions
Starting structural reductions in LI_LTL mode, iteration 1 : 103/178 places, 123/492 transitions.
Graph (complete) has 327 edges and 103 vertex of which 99 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.0 ms
Discarding 4 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 3 ms. Remains 99 /103 variables (removed 4) and now considering 123/123 (removed 0) transitions.
// Phase 1: matrix 123 rows 99 cols
[2024-05-28 22:00:45] [INFO ] Computed 4 invariants in 1 ms
[2024-05-28 22:00:45] [INFO ] Implicit Places using invariants in 95 ms returned []
[2024-05-28 22:00:45] [INFO ] Invariant cache hit.
[2024-05-28 22:00:45] [INFO ] State equation strengthened by 55 read => feed constraints.
[2024-05-28 22:00:45] [INFO ] Implicit Places using invariants and state equation in 289 ms returned []
Implicit Place search using SMT with State Equation took 386 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 99/178 places, 123/492 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 19595 ms. Remains : 99/178 places, 123/492 transitions.
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m96-LTLFireability-08
Product exploration explored 100000 steps with 26606 reset in 131 ms.
Product exploration explored 100000 steps with 26651 reset in 142 ms.
Computed a total of 17 stabilizing places and 22 stable transitions
Graph (complete) has 323 edges and 99 vertex of which 98 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 17 stabilizing places and 22 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 72 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 172 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (8949 resets) in 68 ms. (579 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (1866 resets) in 31 ms. (1250 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 3252 steps, run visited all 1 properties in 9 ms. (steps per millisecond=361 )
Probabilistic random walk after 3252 steps, saw 1669 distinct states, run finished after 9 ms. (steps per millisecond=361 ) properties seen :1
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 86 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 168 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 163 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 99 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 99/99 places, 123/123 transitions.
Applied a total of 0 rules in 1 ms. Remains 99 /99 variables (removed 0) and now considering 123/123 (removed 0) transitions.
[2024-05-28 22:00:46] [INFO ] Invariant cache hit.
[2024-05-28 22:00:46] [INFO ] Implicit Places using invariants in 96 ms returned []
[2024-05-28 22:00:46] [INFO ] Invariant cache hit.
[2024-05-28 22:00:46] [INFO ] State equation strengthened by 55 read => feed constraints.
[2024-05-28 22:00:46] [INFO ] Implicit Places using invariants and state equation in 278 ms returned []
Implicit Place search using SMT with State Equation took 377 ms to find 0 implicit places.
Running 122 sub problems to find dead transitions.
[2024-05-28 22:00:46] [INFO ] Invariant cache hit.
[2024-05-28 22:00:46] [INFO ] State equation strengthened by 55 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 3 (OVERLAPS) 1/99 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 5 (OVERLAPS) 123/222 variables, 99/103 constraints. Problems are: Problem set: 0 solved, 122 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/222 variables, 55/158 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/222 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 8 (OVERLAPS) 0/222 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Real declared 222/222 variables, and 158 constraints, problems are : Problem set: 0 solved, 122 unsolved in 3622 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 99/99 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 122/122 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 122 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 3 (OVERLAPS) 1/99 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 5 (OVERLAPS) 123/222 variables, 99/103 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/222 variables, 55/158 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/222 variables, 122/280 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/222 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 9 (OVERLAPS) 0/222 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Int declared 222/222 variables, and 280 constraints, problems are : Problem set: 0 solved, 122 unsolved in 7462 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 99/99 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 122/122 constraints, Known Traps: 0/0 constraints]
After SMT, in 11207ms problems are : Problem set: 0 solved, 122 unsolved
Search for dead transitions found 0 dead transitions in 11209ms
Finished structural reductions in LTL mode , in 1 iterations and 11588 ms. Remains : 99/99 places, 123/123 transitions.
Computed a total of 17 stabilizing places and 22 stable transitions
Graph (complete) has 323 edges and 99 vertex of which 98 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 17 stabilizing places and 22 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 74 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 172 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (9005 resets) in 66 ms. (597 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (1869 resets) in 28 ms. (1379 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 3252 steps, run visited all 1 properties in 8 ms. (steps per millisecond=406 )
Probabilistic random walk after 3252 steps, saw 1669 distinct states, run finished after 8 ms. (steps per millisecond=406 ) properties seen :1
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 91 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 170 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 175 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 173 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 26696 reset in 130 ms.
Product exploration explored 100000 steps with 26660 reset in 140 ms.
Applying partial POR strategy [true, false, false, false, false]
Stuttering acceptance computed with spot in 168 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 99 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 99/99 places, 123/123 transitions.
Applied a total of 0 rules in 2 ms. Remains 99 /99 variables (removed 0) and now considering 123/123 (removed 0) transitions.
[2024-05-28 22:00:59] [INFO ] Redundant transitions in 0 ms returned []
Running 122 sub problems to find dead transitions.
[2024-05-28 22:00:59] [INFO ] Invariant cache hit.
[2024-05-28 22:00:59] [INFO ] State equation strengthened by 55 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 3 (OVERLAPS) 1/99 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 5 (OVERLAPS) 123/222 variables, 99/103 constraints. Problems are: Problem set: 0 solved, 122 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/222 variables, 55/158 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/222 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 8 (OVERLAPS) 0/222 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Real declared 222/222 variables, and 158 constraints, problems are : Problem set: 0 solved, 122 unsolved in 3453 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 99/99 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 122/122 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 122 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 3 (OVERLAPS) 1/99 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 5 (OVERLAPS) 123/222 variables, 99/103 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/222 variables, 55/158 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/222 variables, 122/280 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/222 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 9 (OVERLAPS) 0/222 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Int declared 222/222 variables, and 280 constraints, problems are : Problem set: 0 solved, 122 unsolved in 7172 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 99/99 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 122/122 constraints, Known Traps: 0/0 constraints]
After SMT, in 10746ms problems are : Problem set: 0 solved, 122 unsolved
Search for dead transitions found 0 dead transitions in 10749ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 10763 ms. Remains : 99/99 places, 123/123 transitions.
Support contains 2 out of 99 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 99/99 places, 123/123 transitions.
Applied a total of 0 rules in 0 ms. Remains 99 /99 variables (removed 0) and now considering 123/123 (removed 0) transitions.
[2024-05-28 22:01:10] [INFO ] Invariant cache hit.
[2024-05-28 22:01:10] [INFO ] Implicit Places using invariants in 97 ms returned []
[2024-05-28 22:01:10] [INFO ] Invariant cache hit.
[2024-05-28 22:01:10] [INFO ] State equation strengthened by 55 read => feed constraints.
[2024-05-28 22:01:10] [INFO ] Implicit Places using invariants and state equation in 284 ms returned []
Implicit Place search using SMT with State Equation took 398 ms to find 0 implicit places.
Running 122 sub problems to find dead transitions.
[2024-05-28 22:01:10] [INFO ] Invariant cache hit.
[2024-05-28 22:01:10] [INFO ] State equation strengthened by 55 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 3 (OVERLAPS) 1/99 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 5 (OVERLAPS) 123/222 variables, 99/103 constraints. Problems are: Problem set: 0 solved, 122 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/222 variables, 55/158 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/222 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 8 (OVERLAPS) 0/222 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Real declared 222/222 variables, and 158 constraints, problems are : Problem set: 0 solved, 122 unsolved in 3481 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 99/99 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 122/122 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 122 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 3 (OVERLAPS) 1/99 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 5 (OVERLAPS) 123/222 variables, 99/103 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/222 variables, 55/158 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/222 variables, 122/280 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/222 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 9 (OVERLAPS) 0/222 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Int declared 222/222 variables, and 280 constraints, problems are : Problem set: 0 solved, 122 unsolved in 7578 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 99/99 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 122/122 constraints, Known Traps: 0/0 constraints]
After SMT, in 11187ms problems are : Problem set: 0 solved, 122 unsolved
Search for dead transitions found 0 dead transitions in 11188ms
Finished structural reductions in LTL mode , in 1 iterations and 11589 ms. Remains : 99/99 places, 123/123 transitions.
Treatment of property SieveSingleMsgMbox-PT-d2m96-LTLFireability-08 finished in 56312 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F((p0&&X(p1)))&&F(G(p2)))))'
Found a Shortening insensitive property : SieveSingleMsgMbox-PT-d2m96-LTLFireability-10
Stuttering acceptance computed with spot in 154 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p2), (NOT p1)]
Support contains 5 out of 178 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 178/178 places, 492/492 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 156 transition count 231
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 156 transition count 231
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 66 place count 134 transition count 209
Iterating global reduction 0 with 22 rules applied. Total rules applied 88 place count 134 transition count 209
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 0 with 17 rules applied. Total rules applied 105 place count 134 transition count 192
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 116 place count 123 transition count 171
Iterating global reduction 1 with 11 rules applied. Total rules applied 127 place count 123 transition count 171
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 133 place count 123 transition count 165
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 136 place count 120 transition count 162
Iterating global reduction 2 with 3 rules applied. Total rules applied 139 place count 120 transition count 162
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 142 place count 117 transition count 159
Iterating global reduction 2 with 3 rules applied. Total rules applied 145 place count 117 transition count 159
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 148 place count 114 transition count 156
Iterating global reduction 2 with 3 rules applied. Total rules applied 151 place count 114 transition count 156
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 154 place count 114 transition count 153
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 157 place count 111 transition count 150
Iterating global reduction 3 with 3 rules applied. Total rules applied 160 place count 111 transition count 150
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 161 place count 110 transition count 147
Iterating global reduction 3 with 1 rules applied. Total rules applied 162 place count 110 transition count 147
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 163 place count 109 transition count 146
Iterating global reduction 3 with 1 rules applied. Total rules applied 164 place count 109 transition count 146
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 165 place count 108 transition count 145
Iterating global reduction 3 with 1 rules applied. Total rules applied 166 place count 108 transition count 145
Applied a total of 166 rules in 23 ms. Remains 108 /178 variables (removed 70) and now considering 145/492 (removed 347) transitions.
// Phase 1: matrix 145 rows 108 cols
[2024-05-28 22:01:22] [INFO ] Computed 4 invariants in 1 ms
[2024-05-28 22:01:22] [INFO ] Implicit Places using invariants in 115 ms returned []
[2024-05-28 22:01:22] [INFO ] Invariant cache hit.
[2024-05-28 22:01:22] [INFO ] State equation strengthened by 70 read => feed constraints.
[2024-05-28 22:01:22] [INFO ] Implicit Places using invariants and state equation in 302 ms returned []
Implicit Place search using SMT with State Equation took 419 ms to find 0 implicit places.
Running 144 sub problems to find dead transitions.
[2024-05-28 22:01:22] [INFO ] Invariant cache hit.
[2024-05-28 22:01:22] [INFO ] State equation strengthened by 70 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/107 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 2 (OVERLAPS) 1/108 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 144 unsolved
[2024-05-28 22:01:24] [INFO ] Deduced a trap composed of 32 places in 42 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/108 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/108 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 144 unsolved
Problem TDEAD34 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD128 is UNSAT
At refinement iteration 6 (OVERLAPS) 145/253 variables, 108/113 constraints. Problems are: Problem set: 3 solved, 141 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/253 variables, 70/183 constraints. Problems are: Problem set: 3 solved, 141 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/253 variables, 0/183 constraints. Problems are: Problem set: 3 solved, 141 unsolved
[2024-05-28 22:01:27] [INFO ] Deduced a trap composed of 34 places in 63 ms of which 2 ms to minimize.
[2024-05-28 22:01:28] [INFO ] Deduced a trap composed of 32 places in 62 ms of which 2 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/253 variables, 2/185 constraints. Problems are: Problem set: 3 solved, 141 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/253 variables, 0/185 constraints. Problems are: Problem set: 3 solved, 141 unsolved
At refinement iteration 11 (OVERLAPS) 0/253 variables, 0/185 constraints. Problems are: Problem set: 3 solved, 141 unsolved
No progress, stopping.
After SMT solving in domain Real declared 253/253 variables, and 185 constraints, problems are : Problem set: 3 solved, 141 unsolved in 9070 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 108/108 constraints, ReadFeed: 70/70 constraints, PredecessorRefiner: 144/144 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 3 solved, 141 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 141 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 0/1 constraints. Problems are: Problem set: 3 solved, 141 unsolved
At refinement iteration 2 (OVERLAPS) 1/105 variables, 1/2 constraints. Problems are: Problem set: 3 solved, 141 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 1/3 constraints. Problems are: Problem set: 3 solved, 141 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 0/3 constraints. Problems are: Problem set: 3 solved, 141 unsolved
At refinement iteration 5 (OVERLAPS) 1/106 variables, 1/4 constraints. Problems are: Problem set: 3 solved, 141 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/106 variables, 3/7 constraints. Problems are: Problem set: 3 solved, 141 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/106 variables, 0/7 constraints. Problems are: Problem set: 3 solved, 141 unsolved
At refinement iteration 8 (OVERLAPS) 144/250 variables, 106/113 constraints. Problems are: Problem set: 3 solved, 141 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/250 variables, 69/182 constraints. Problems are: Problem set: 3 solved, 141 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/250 variables, 28/210 constraints. Problems are: Problem set: 3 solved, 141 unsolved
[2024-05-28 22:01:35] [INFO ] Deduced a trap composed of 12 places in 45 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/250 variables, 1/211 constraints. Problems are: Problem set: 3 solved, 141 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/250 variables, 0/211 constraints. Problems are: Problem set: 3 solved, 141 unsolved
At refinement iteration 13 (OVERLAPS) 3/253 variables, 2/213 constraints. Problems are: Problem set: 3 solved, 141 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/253 variables, 1/214 constraints. Problems are: Problem set: 3 solved, 141 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/253 variables, 113/327 constraints. Problems are: Problem set: 3 solved, 141 unsolved
[2024-05-28 22:01:42] [INFO ] Deduced a trap composed of 23 places in 23 ms of which 1 ms to minimize.
Problem TDEAD131 is UNSAT
At refinement iteration 16 (INCLUDED_ONLY) 0/253 variables, 1/328 constraints. Problems are: Problem set: 4 solved, 140 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/253 variables, 0/328 constraints. Problems are: Problem set: 4 solved, 140 unsolved
At refinement iteration 18 (OVERLAPS) 0/253 variables, 0/328 constraints. Problems are: Problem set: 4 solved, 140 unsolved
No progress, stopping.
After SMT solving in domain Int declared 253/253 variables, and 328 constraints, problems are : Problem set: 4 solved, 140 unsolved in 19518 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 108/108 constraints, ReadFeed: 70/70 constraints, PredecessorRefiner: 141/144 constraints, Known Traps: 5/5 constraints]
After SMT, in 28763ms problems are : Problem set: 4 solved, 140 unsolved
Search for dead transitions found 4 dead transitions in 28765ms
Found 4 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 4 transitions
Dead transitions reduction (with SMT) removed 4 transitions
Starting structural reductions in LI_LTL mode, iteration 1 : 108/178 places, 141/492 transitions.
Graph (complete) has 354 edges and 108 vertex of which 104 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 3 ms. Remains 104 /108 variables (removed 4) and now considering 141/141 (removed 0) transitions.
// Phase 1: matrix 141 rows 104 cols
[2024-05-28 22:01:51] [INFO ] Computed 4 invariants in 1 ms
[2024-05-28 22:01:51] [INFO ] Implicit Places using invariants in 137 ms returned []
[2024-05-28 22:01:51] [INFO ] Invariant cache hit.
[2024-05-28 22:01:51] [INFO ] State equation strengthened by 69 read => feed constraints.
[2024-05-28 22:01:51] [INFO ] Implicit Places using invariants and state equation in 290 ms returned []
Implicit Place search using SMT with State Equation took 429 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 104/178 places, 141/492 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 29641 ms. Remains : 104/178 places, 141/492 transitions.
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m96-LTLFireability-10
Product exploration explored 100000 steps with 37263 reset in 208 ms.
Product exploration explored 100000 steps with 37493 reset in 217 ms.
Computed a total of 17 stabilizing places and 23 stable transitions
Graph (complete) has 350 edges and 104 vertex of which 103 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 17 stabilizing places and 23 stable transitions
Knowledge obtained : [(AND p0 p2 p1), (X p2), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (X p2)), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 136 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter sensitive) to 4 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 159 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p2), (NOT p1)]
RANDOM walk for 40000 steps (9032 resets) in 582 ms. (68 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (1908 resets) in 275 ms. (144 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (1855 resets) in 84 ms. (470 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (1916 resets) in 285 ms. (139 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (4106 resets) in 306 ms. (130 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (1855 resets) in 197 ms. (202 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 236122 steps, run timeout after 3001 ms. (steps per millisecond=78 ) properties seen :1 out of 5
Probabilistic random walk after 236122 steps, saw 103006 distinct states, run finished after 3001 ms. (steps per millisecond=78 ) properties seen :1
[2024-05-28 22:01:56] [INFO ] Invariant cache hit.
[2024-05-28 22:01:56] [INFO ] State equation strengthened by 69 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 60/63 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 11/74 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 4/78 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/78 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 124/202 variables, 78/82 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/202 variables, 52/134 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/202 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem apf1 is UNSAT
At refinement iteration 10 (OVERLAPS) 43/245 variables, 26/160 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/245 variables, 17/177 constraints. Problems are: Problem set: 1 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/245 variables, 0/177 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 0/245 variables, 0/177 constraints. Problems are: Problem set: 1 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 245/245 variables, and 177 constraints, problems are : Problem set: 1 solved, 3 unsolved in 265 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 104/104 constraints, ReadFeed: 69/69 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 60/63 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 11/74 variables, 2/3 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 4/78 variables, 1/4 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/78 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 124/202 variables, 78/82 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/202 variables, 52/134 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/202 variables, 0/134 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 43/245 variables, 26/160 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/245 variables, 17/177 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/245 variables, 3/180 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/245 variables, 0/180 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 0/245 variables, 0/180 constraints. Problems are: Problem set: 1 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 245/245 variables, and 180 constraints, problems are : Problem set: 1 solved, 3 unsolved in 432 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 104/104 constraints, ReadFeed: 69/69 constraints, PredecessorRefiner: 3/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 707ms problems are : Problem set: 1 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 12069 ms.
Support contains 3 out of 104 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 104/104 places, 141/141 transitions.
Graph (complete) has 314 edges and 104 vertex of which 103 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 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 103 transition count 139
Applied a total of 3 rules in 3 ms. Remains 103 /104 variables (removed 1) and now considering 139/141 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 103/104 places, 139/141 transitions.
RANDOM walk for 40000 steps (8923 resets) in 691 ms. (57 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (1929 resets) in 39 ms. (1000 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40000 steps (1897 resets) in 221 ms. (180 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (1824 resets) in 211 ms. (188 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 331593 steps, run timeout after 3001 ms. (steps per millisecond=110 ) properties seen :0 out of 3
Probabilistic random walk after 331593 steps, saw 142592 distinct states, run finished after 3001 ms. (steps per millisecond=110 ) properties seen :0
// Phase 1: matrix 139 rows 103 cols
[2024-05-28 22:02:12] [INFO ] Computed 3 invariants in 1 ms
[2024-05-28 22:02:12] [INFO ] State equation strengthened by 67 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 96/99 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 24/27 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 137/236 variables, 94/121 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/236 variables, 1/122 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/236 variables, 43/165 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/236 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 6/242 variables, 2/167 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/242 variables, 6/173 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/242 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 0/242 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 242/242 variables, and 173 constraints, problems are : Problem set: 0 solved, 3 unsolved in 205 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 103/103 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 96/99 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 24/27 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 137/236 variables, 94/121 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/236 variables, 1/122 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/236 variables, 43/165 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/236 variables, 3/168 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/236 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 6/242 variables, 2/170 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/242 variables, 6/176 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/242 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 0/242 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 242/242 variables, and 176 constraints, problems are : Problem set: 0 solved, 3 unsolved in 397 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 103/103 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 612ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 18712 ms.
Support contains 3 out of 103 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 103/103 places, 139/139 transitions.
Applied a total of 0 rules in 4 ms. Remains 103 /103 variables (removed 0) and now considering 139/139 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 103/103 places, 139/139 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 103/103 places, 139/139 transitions.
Applied a total of 0 rules in 3 ms. Remains 103 /103 variables (removed 0) and now considering 139/139 (removed 0) transitions.
[2024-05-28 22:02:31] [INFO ] Invariant cache hit.
[2024-05-28 22:02:31] [INFO ] Implicit Places using invariants in 112 ms returned []
[2024-05-28 22:02:31] [INFO ] Invariant cache hit.
[2024-05-28 22:02:32] [INFO ] State equation strengthened by 67 read => feed constraints.
[2024-05-28 22:02:32] [INFO ] Implicit Places using invariants and state equation in 317 ms returned []
Implicit Place search using SMT with State Equation took 433 ms to find 0 implicit places.
[2024-05-28 22:02:32] [INFO ] Redundant transitions in 1 ms returned []
Running 138 sub problems to find dead transitions.
[2024-05-28 22:02:32] [INFO ] Invariant cache hit.
[2024-05-28 22:02:32] [INFO ] State equation strengthened by 67 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 2 (OVERLAPS) 1/103 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 4 (OVERLAPS) 139/242 variables, 103/106 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/242 variables, 67/173 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/242 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 7 (OVERLAPS) 0/242 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 138 unsolved
No progress, stopping.
After SMT solving in domain Real declared 242/242 variables, and 173 constraints, problems are : Problem set: 0 solved, 138 unsolved in 4765 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 103/103 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 138/138 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 138 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 2 (OVERLAPS) 1/103 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 4 (OVERLAPS) 139/242 variables, 103/106 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/242 variables, 67/173 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/242 variables, 138/311 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/242 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 8 (OVERLAPS) 0/242 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 138 unsolved
No progress, stopping.
After SMT solving in domain Int declared 242/242 variables, and 311 constraints, problems are : Problem set: 0 solved, 138 unsolved in 9406 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 103/103 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 138/138 constraints, Known Traps: 0/0 constraints]
After SMT, in 14323ms problems are : Problem set: 0 solved, 138 unsolved
Search for dead transitions found 0 dead transitions in 14325ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14768 ms. Remains : 103/103 places, 139/139 transitions.
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 103 transition count 132
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 13 place count 97 transition count 132
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 97 transition count 117
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 82 transition count 117
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 57 place count 75 transition count 110
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 59 place count 74 transition count 119
Applied a total of 59 rules in 8 ms. Remains 74 /103 variables (removed 29) and now considering 119/139 (removed 20) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 119 rows 74 cols
[2024-05-28 22:02:46] [INFO ] Computed 3 invariants in 3 ms
[2024-05-28 22:02:46] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-28 22:02:46] [INFO ] After 110ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-28 22:02:46] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-28 22:02:46] [INFO ] After 99ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
TRAPS : Iteration 0
[2024-05-28 22:02:46] [INFO ] After 166ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
[2024-05-28 22:02:47] [INFO ] After 275ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Over-approximation ignoring read arcs solved 0 properties in 407 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p2 p1), (X p2), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (X p2)), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (G (OR p0 p1))]
False Knowledge obtained : [(F (NOT p2))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 12 factoid took 185 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter sensitive) to 6 states, 15 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 239 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p2), (NOT p1), false, false]
Stuttering acceptance computed with spot in 226 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p2), (NOT p1), false, false]
Support contains 5 out of 104 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 104/104 places, 141/141 transitions.
Applied a total of 0 rules in 3 ms. Remains 104 /104 variables (removed 0) and now considering 141/141 (removed 0) transitions.
// Phase 1: matrix 141 rows 104 cols
[2024-05-28 22:02:47] [INFO ] Computed 4 invariants in 0 ms
[2024-05-28 22:02:47] [INFO ] Implicit Places using invariants in 97 ms returned []
[2024-05-28 22:02:47] [INFO ] Invariant cache hit.
[2024-05-28 22:02:47] [INFO ] State equation strengthened by 69 read => feed constraints.
[2024-05-28 22:02:48] [INFO ] Implicit Places using invariants and state equation in 320 ms returned []
Implicit Place search using SMT with State Equation took 420 ms to find 0 implicit places.
[2024-05-28 22:02:48] [INFO ] Redundant transitions in 1 ms returned []
Running 140 sub problems to find dead transitions.
[2024-05-28 22:02:48] [INFO ] Invariant cache hit.
[2024-05-28 22:02:48] [INFO ] State equation strengthened by 69 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 3 (OVERLAPS) 1/104 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 5 (OVERLAPS) 141/245 variables, 104/108 constraints. Problems are: Problem set: 0 solved, 140 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/245 variables, 69/177 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/245 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 8 (OVERLAPS) 0/245 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 140 unsolved
No progress, stopping.
After SMT solving in domain Real declared 245/245 variables, and 177 constraints, problems are : Problem set: 0 solved, 140 unsolved in 4608 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 104/104 constraints, ReadFeed: 69/69 constraints, PredecessorRefiner: 140/140 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 140 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 3 (OVERLAPS) 1/104 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 5 (OVERLAPS) 141/245 variables, 104/108 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/245 variables, 69/177 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/245 variables, 140/317 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/245 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 9 (OVERLAPS) 0/245 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 140 unsolved
No progress, stopping.
After SMT solving in domain Int declared 245/245 variables, and 317 constraints, problems are : Problem set: 0 solved, 140 unsolved in 9622 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 104/104 constraints, ReadFeed: 69/69 constraints, PredecessorRefiner: 140/140 constraints, Known Traps: 0/0 constraints]
After SMT, in 14383ms problems are : Problem set: 0 solved, 140 unsolved
Search for dead transitions found 0 dead transitions in 14384ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 14813 ms. Remains : 104/104 places, 141/141 transitions.
Computed a total of 17 stabilizing places and 23 stable transitions
Graph (complete) has 350 edges and 104 vertex of which 103 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 17 stabilizing places and 23 stable transitions
Knowledge obtained : [(AND p0 p2 p1), (X p2), (X p0), (X (NOT (AND (NOT p2) p0 p1))), (X (AND p2 p0 p1)), (X p1), (X (X p2)), (X (X p0)), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X (AND p2 p0 p1))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 148 ms. Reduced automaton from 6 states, 15 edges and 3 AP (stutter insensitive) to 6 states, 15 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 242 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p2), (NOT p1), false, false]
RANDOM walk for 40000 steps (8985 resets) in 1018 ms. (39 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (1854 resets) in 225 ms. (177 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (4198 resets) in 442 ms. (90 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (1910 resets) in 317 ms. (125 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (4186 resets) in 517 ms. (77 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (4204 resets) in 550 ms. (72 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (1899 resets) in 259 ms. (153 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 393819 steps, run timeout after 3011 ms. (steps per millisecond=130 ) properties seen :3 out of 6
Probabilistic random walk after 393819 steps, saw 170019 distinct states, run finished after 3011 ms. (steps per millisecond=130 ) properties seen :3
[2024-05-28 22:03:07] [INFO ] Invariant cache hit.
[2024-05-28 22:03:07] [INFO ] State equation strengthened by 69 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 60/63 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 11/74 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 4/78 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/78 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 124/202 variables, 78/82 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/202 variables, 52/134 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/202 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 43/245 variables, 26/160 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/245 variables, 17/177 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/245 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 0/245 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 245/245 variables, and 177 constraints, problems are : Problem set: 0 solved, 3 unsolved in 238 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 104/104 constraints, ReadFeed: 69/69 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 60/63 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 11/74 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 4/78 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/78 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 124/202 variables, 78/82 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/202 variables, 52/134 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/202 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 43/245 variables, 26/160 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/245 variables, 17/177 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/245 variables, 3/180 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/245 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 0/245 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 245/245 variables, and 180 constraints, problems are : Problem set: 0 solved, 3 unsolved in 442 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 104/104 constraints, ReadFeed: 69/69 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 693ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 12315 ms.
Support contains 3 out of 104 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 104/104 places, 141/141 transitions.
Graph (complete) has 314 edges and 104 vertex of which 103 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 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 103 transition count 139
Applied a total of 3 rules in 3 ms. Remains 103 /104 variables (removed 1) and now considering 139/141 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 103/104 places, 139/141 transitions.
RANDOM walk for 40000 steps (8995 resets) in 484 ms. (82 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (1913 resets) in 256 ms. (155 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (1899 resets) in 54 ms. (727 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (1848 resets) in 53 ms. (740 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 366139 steps, run timeout after 3001 ms. (steps per millisecond=122 ) properties seen :0 out of 3
Probabilistic random walk after 366139 steps, saw 158175 distinct states, run finished after 3001 ms. (steps per millisecond=122 ) properties seen :0
// Phase 1: matrix 139 rows 103 cols
[2024-05-28 22:03:23] [INFO ] Computed 3 invariants in 0 ms
[2024-05-28 22:03:23] [INFO ] State equation strengthened by 67 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 96/99 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 24/27 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 137/236 variables, 94/121 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/236 variables, 1/122 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/236 variables, 43/165 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/236 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 6/242 variables, 2/167 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/242 variables, 6/173 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/242 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 0/242 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 242/242 variables, and 173 constraints, problems are : Problem set: 0 solved, 3 unsolved in 214 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 103/103 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 96/99 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 24/27 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 137/236 variables, 94/121 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/236 variables, 1/122 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/236 variables, 43/165 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/236 variables, 3/168 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/236 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 6/242 variables, 2/170 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/242 variables, 6/176 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/242 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 0/242 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 242/242 variables, and 176 constraints, problems are : Problem set: 0 solved, 3 unsolved in 410 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 103/103 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 635ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 18689 ms.
Support contains 3 out of 103 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 103/103 places, 139/139 transitions.
Applied a total of 0 rules in 5 ms. Remains 103 /103 variables (removed 0) and now considering 139/139 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 103/103 places, 139/139 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 103/103 places, 139/139 transitions.
Applied a total of 0 rules in 2 ms. Remains 103 /103 variables (removed 0) and now considering 139/139 (removed 0) transitions.
[2024-05-28 22:03:42] [INFO ] Invariant cache hit.
[2024-05-28 22:03:42] [INFO ] Implicit Places using invariants in 111 ms returned []
[2024-05-28 22:03:42] [INFO ] Invariant cache hit.
[2024-05-28 22:03:42] [INFO ] State equation strengthened by 67 read => feed constraints.
[2024-05-28 22:03:43] [INFO ] Implicit Places using invariants and state equation in 336 ms returned []
Implicit Place search using SMT with State Equation took 449 ms to find 0 implicit places.
[2024-05-28 22:03:43] [INFO ] Redundant transitions in 0 ms returned []
Running 138 sub problems to find dead transitions.
[2024-05-28 22:03:43] [INFO ] Invariant cache hit.
[2024-05-28 22:03:43] [INFO ] State equation strengthened by 67 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 2 (OVERLAPS) 1/103 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 4 (OVERLAPS) 139/242 variables, 103/106 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/242 variables, 67/173 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/242 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 7 (OVERLAPS) 0/242 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 138 unsolved
No progress, stopping.
After SMT solving in domain Real declared 242/242 variables, and 173 constraints, problems are : Problem set: 0 solved, 138 unsolved in 4814 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 103/103 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 138/138 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 138 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 2 (OVERLAPS) 1/103 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 4 (OVERLAPS) 139/242 variables, 103/106 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/242 variables, 67/173 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/242 variables, 138/311 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/242 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 8 (OVERLAPS) 0/242 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 138 unsolved
No progress, stopping.
After SMT solving in domain Int declared 242/242 variables, and 311 constraints, problems are : Problem set: 0 solved, 138 unsolved in 8760 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 103/103 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 138/138 constraints, Known Traps: 0/0 constraints]
After SMT, in 13727ms problems are : Problem set: 0 solved, 138 unsolved
Search for dead transitions found 0 dead transitions in 13728ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14187 ms. Remains : 103/103 places, 139/139 transitions.
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 103 transition count 132
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 13 place count 97 transition count 132
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 97 transition count 117
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 43 place count 82 transition count 117
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 57 place count 75 transition count 110
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 59 place count 74 transition count 119
Applied a total of 59 rules in 8 ms. Remains 74 /103 variables (removed 29) and now considering 119/139 (removed 20) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 119 rows 74 cols
[2024-05-28 22:03:56] [INFO ] Computed 3 invariants in 1 ms
[2024-05-28 22:03:57] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-28 22:03:57] [INFO ] After 105ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-28 22:03:57] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-28 22:03:57] [INFO ] After 101ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
TRAPS : Iteration 0
[2024-05-28 22:03:57] [INFO ] After 168ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
[2024-05-28 22:03:57] [INFO ] After 285ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Over-approximation ignoring read arcs solved 0 properties in 407 ms.
Knowledge obtained : [(AND p0 p2 p1), (X p2), (X p0), (X (NOT (AND (NOT p2) p0 p1))), (X (AND p2 p0 p1)), (X p1), (X (X p2)), (X (X p0)), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X (AND p2 p0 p1))), (X (X p1))]
False Knowledge obtained : [(F (NOT p2)), (F (NOT (AND p1 p2 p0))), (F (NOT (OR (NOT p1) p2 (NOT p0))))]
Knowledge based reduction with 11 factoid took 277 ms. Reduced automaton from 6 states, 15 edges and 3 AP (stutter insensitive) to 6 states, 15 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 234 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p2), (NOT p1), false, false]
Stuttering acceptance computed with spot in 231 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p2), (NOT p1), false, false]
Stuttering acceptance computed with spot in 271 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p2), (NOT p1), false, false]
Product exploration explored 100000 steps with 22427 reset in 186 ms.
Product exploration explored 100000 steps with 22485 reset in 196 ms.
Support contains 5 out of 104 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 104/104 places, 141/141 transitions.
Applied a total of 0 rules in 7 ms. Remains 104 /104 variables (removed 0) and now considering 141/141 (removed 0) transitions.
// Phase 1: matrix 141 rows 104 cols
[2024-05-28 22:03:58] [INFO ] Computed 4 invariants in 1 ms
[2024-05-28 22:03:58] [INFO ] Implicit Places using invariants in 101 ms returned []
[2024-05-28 22:03:58] [INFO ] Invariant cache hit.
[2024-05-28 22:03:58] [INFO ] State equation strengthened by 69 read => feed constraints.
[2024-05-28 22:03:59] [INFO ] Implicit Places using invariants and state equation in 308 ms returned []
Implicit Place search using SMT with State Equation took 435 ms to find 0 implicit places.
[2024-05-28 22:03:59] [INFO ] Redundant transitions in 0 ms returned []
Running 140 sub problems to find dead transitions.
[2024-05-28 22:03:59] [INFO ] Invariant cache hit.
[2024-05-28 22:03:59] [INFO ] State equation strengthened by 69 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 3 (OVERLAPS) 1/104 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 5 (OVERLAPS) 141/245 variables, 104/108 constraints. Problems are: Problem set: 0 solved, 140 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/245 variables, 69/177 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/245 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 8 (OVERLAPS) 0/245 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 140 unsolved
No progress, stopping.
After SMT solving in domain Real declared 245/245 variables, and 177 constraints, problems are : Problem set: 0 solved, 140 unsolved in 4727 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 104/104 constraints, ReadFeed: 69/69 constraints, PredecessorRefiner: 140/140 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 140 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 3 (OVERLAPS) 1/104 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 5 (OVERLAPS) 141/245 variables, 104/108 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/245 variables, 69/177 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/245 variables, 140/317 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/245 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 9 (OVERLAPS) 0/245 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 140 unsolved
No progress, stopping.
After SMT solving in domain Int declared 245/245 variables, and 317 constraints, problems are : Problem set: 0 solved, 140 unsolved in 9490 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 104/104 constraints, ReadFeed: 69/69 constraints, PredecessorRefiner: 140/140 constraints, Known Traps: 0/0 constraints]
After SMT, in 14371ms problems are : Problem set: 0 solved, 140 unsolved
Search for dead transitions found 0 dead transitions in 14373ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 14821 ms. Remains : 104/104 places, 141/141 transitions.
Treatment of property SieveSingleMsgMbox-PT-d2m96-LTLFireability-10 finished in 171771 ms.
[2024-05-28 22:04:13] [INFO ] Flatten gal took : 38 ms
[2024-05-28 22:04:13] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLFireability.sr.xml took 4 ms.
[2024-05-28 22:04:13] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 178 places, 492 transitions and 1945 arcs took 10 ms.
Total runtime 1024515 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running SieveSingleMsgMbox-PT-d2m96

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/415/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 178
TRANSITIONS: 492
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.006s, Sys 0.007s]


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


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

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

Process ID: 2838
MODEL NAME: /home/mcc/execution/415/model
178 places, 492 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.

BK_TIME_CONFINEMENT_REACHED

--------------------
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 LTLFireability -timeout 360 -rebuildPNML
MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is SieveSingleMsgMbox-PT-d2m96, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r377-smll-171683809800140"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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